000 | 03500nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-540-69317-8 | ||
003 | DE-He213 | ||
005 | 20161121230717.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2008 gw | s |||| 0|eng d | ||
020 |
_a9783540693178 _9978-3-540-69317-8 |
||
024 | 7 |
_a10.1007/978-3-540-69317-8 _2doi |
|
050 | 4 | _aTK5105.5-5105.9 | |
072 | 7 |
_aUKN _2bicssc |
|
072 | 7 |
_aCOM075000 _2bisacsh |
|
082 | 0 | 4 |
_a004.6 _223 |
100 | 1 |
_aDenteneer, Dee. _eauthor. |
|
245 | 1 | 0 |
_aMultiaccess, Reservations & Queues _h[electronic resource] / _cby Dee Denteneer, Johan S. H. van Leeuwaarden. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2008. |
|
300 |
_aX, 254 p. 51 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aPhilips Research Book Series, _x1571-5671 ; _v10 |
|
505 | 0 | _aPrologue -- 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 | _aReservation 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 | _aComputer science. | |
650 | 0 |
_aComputer software _xReusability. |
|
650 | 0 | _aComputer organization. | |
650 | 0 | _aComputer communication systems. | |
650 | 0 | _aAlgebra. | |
650 | 0 | _aApplied mathematics. | |
650 | 0 | _aEngineering mathematics. | |
650 | 0 | _aComputer mathematics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aPerformance and Reliability. |
650 | 2 | 4 | _aComputer Systems Organization and Communication Networks. |
650 | 2 | 4 | _aComputational Science and Engineering. |
650 | 2 | 4 | _aApplications of Mathematics. |
650 | 2 | 4 | _aAlgebra. |
700 | 1 |
_aLeeuwaarden, Johan S. H. van. _eauthor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540693161 |
830 | 0 |
_aPhilips Research Book Series, _x1571-5671 ; _v10 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-540-69317-8 |
912 | _aZDB-2-SCS | ||
950 | _aComputer Science (Springer-11645) | ||
999 |
_c502837 _d502837 |