Covers contention trees, the repairman model, the bulk service queue, and tandem queues
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.
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.
This book presents queuing models for situations that require a reservation procedure and validate their applicability in the context of cable networks. It offers mathematical models to better understand the performance of these reservation procedures.
Inhaltsverzeichnis
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.
Klappentext
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.nnIn this book, we propose queuing models for situations that require a reservation procedure and validate their applicability in the context of cable networks.nnWe 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.nnThe 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.
Covers contention trees, the repairman model, the bulk service queue, and tandem queues
Includes supplementary material: sn.pub/extras
