Multiaccess, Reservations & 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 co...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Denteneer, Dee (Συγγραφέας), Leeuwaarden, Johan S. H. van (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
Σειρά:Philips Research Book Series, 10
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03517nam a22005775i 4500
001 978-3-540-69317-8
003 DE-He213
005 20151204165255.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 |a 9783540693178  |9 978-3-540-69317-8 
024 7 |a 10.1007/978-3-540-69317-8  |2 doi 
040 |d GrThAP 
050 4 |a TK5105.5-5105.9 
072 7 |a UKN  |2 bicssc 
072 7 |a COM075000  |2 bisacsh 
082 0 4 |a 004.6  |2 23 
100 1 |a Denteneer, Dee.  |e author. 
245 1 0 |a Multiaccess, Reservations & Queues  |h [electronic resource] /  |c by Dee Denteneer, Johan S. H. van Leeuwaarden. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2008. 
300 |a X, 254 p. 51 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Philips Research Book Series,  |x 1571-5671 ;  |v 10 
505 0 |a 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. 
520 |a 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. 
650 0 |a Computer science. 
650 0 |a Computer software  |x Reusability. 
650 0 |a Computer organization. 
650 0 |a Computer communication systems. 
650 0 |a Algebra. 
650 0 |a Applied mathematics. 
650 0 |a Engineering mathematics. 
650 0 |a Computer mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Performance and Reliability. 
650 2 4 |a Computer Systems Organization and Communication Networks. 
650 2 4 |a Computational Science and Engineering. 
650 2 4 |a Applications of Mathematics. 
650 2 4 |a Algebra. 
700 1 |a Leeuwaarden, Johan S. H. van.  |e author. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540693161 
830 0 |a Philips Research Book Series,  |x 1571-5671 ;  |v 10 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-69317-8  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)