Multiaccess, Reservations & Queues (inbunden)
Format
Inbunden (Hardback)
Språk
Engelska
Antal sidor
254
Utgivningsdatum
2008-08-19
Upplaga
2008 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
van Leeuwaarden, J.S.H.
Illustrationer
51 Illustrations, black and white; X, 254 p. 51 illus.
Dimensioner
239 x 160 x 18 mm
Vikt
568 g
Antal komponenter
1
Komponenter
1 Hardback
ISBN
9783540693161

Multiaccess, Reservations & Queues

Inbunden,  Engelska, 2008-08-19
1505
  • Skickas från oss inom 7-10 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
Visa alla 2 format & utgåvor
Reservation procedures constitute the core of many popular data transmission protocols. They consist of two steps: A request phase in which a station reserves the communication channel and a transmission phase in which the actual data transmission takes place. Such procedures are often applied in communication networks that are characterised by a shared communication channel with large round-trip times. In this book, we propose queuing models for situations that require a reservation procedure and validate their applicability in the context of cable networks. We offer various mathematical models to better understand the performance of these reservation procedures. The book covers four key performance models, and modifications to these: Contention trees, the repairman model, the bulk service queue, and tandem queues. The relevance of this book is not limited to reservation procedures and cable networks, and performance analysts from a variety of areas may benefit, as all models have found application in other fields as well.
Visa hela texten

Passar bra ihop

  1. Multiaccess, Reservations & Queues
  2. +
  3. The Anxious Generation

De som köpt den här boken har ofta också köpt The Anxious Generation av Jonathan Haidt (inbunden).

Köp båda 2 för 1794 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Innehållsförteckning

Prologue.- Multiaccess in Cable Networks.- Key Models.- Contention Trees.- Basic Properties of Contention Trees.- Delay Models for Contention Trees in Closed Populations.- The Repairman Model with Gros.- Bulk Service.- Methodology.- Periodic Scheduling.- Reservations with Transmission Delays.- Shared Service Capacity.- A Tandem Queue with Coupled Processors.- A Two-Station Network with Coupled Processors.- Epilogue.- Cable Networks Revisited.