Description: Multiaccess, Reservations & Queues, Hardcover by Denteneer, Dee; Leeuwaarden, Johan S. H., ISBN 3540693165, ISBN-13 9783540693161, Brand New, Free shipping in the US 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. Th 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.
Price: 139.91 USD
Location: Jessup, Maryland
End Time: 2024-12-29T12:30:55.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Restocking Fee: No
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 14 Days
Refund will be given as: Money Back
Number of Pages: X, 254 Pages
Language: English
Publication Name: Multiaccess, Reservations and Queues
Publisher: Springer Berlin / Heidelberg
Subject: Probability & Statistics / Stochastic Processes, Hardware / General, Networking / General, Data Processing, Networking / Network Protocols, Applied
Publication Year: 2008
Item Weight: 19.9 Oz
Type: Textbook
Subject Area: Mathematics, Computers
Item Length: 9.3 in
Author: Dee Denteneer, J. S. H. Van Leeuwaarden
Series: Philips Research Book Ser.
Item Width: 6.1 in
Format: Hardcover
