000 | 03518nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-540-44592-0 | ||
003 | DE-He213 | ||
005 | 20240423132553.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2001 gw | s |||| 0|eng d | ||
020 |
_a9783540445920 _9978-3-540-44592-0 |
||
024 | 7 |
_a10.1007/3-540-44592-7 _2doi |
|
050 | 4 | _aTK5105.5-5105.9 | |
072 | 7 |
_aUKN _2bicssc |
|
072 | 7 |
_aCOM043000 _2bisacsh |
|
072 | 7 |
_aUKN _2thema |
|
082 | 0 | 4 |
_a004.6 _223 |
100 | 1 |
_aDaduna, Hans. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 0 |
_aQueueing Networks with Discrete Time Scale _h[electronic resource] : _bExplicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks / _cby Hans Daduna. |
250 | _a1st ed. 2001. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2001. |
|
300 |
_aX, 142 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2046 |
|
505 | 0 | _aState dependent Bernoulli Servers -- Closed Cycles of State Dependent Bernoulli Servers with Different Customer Types -- Open Tandems of State Dependent Bernoulli Servers with Different Customer Types -- Networks with Doubly Stochastic and Geometrical Servers -- General Networks with Batch Movements and Batch Services. | |
520 | _aBuilding on classical queueing theory mainly dealing with single node queueing systems, networks of queues, or stochastic networks has been a field of intensive research over the last three decades. Whereas the first breakthrough in queueing network theory was initiated by problems and work in operations research, the second breakthrough, as well as subsequent major work in the area, was closely related to computer science, particularly to performance analysis of complex systems in computer and communication science. The text reports on recent research and development in the area. It is centered around explicit expressions for the steady behavior of discrete time queueing networks and gives a moderately positive answer to the question of whether there can be a product form calculus in discrete time. Originating from a course given by the author at Hamburg University, this book is ideally suited as a text for courses on discrete time stochastic networks. | ||
650 | 0 | _aComputer networks . | |
650 | 0 | _aProbabilities. | |
650 | 0 | _aComputer engineering. | |
650 | 0 |
_aElectronic digital computers _xEvaluation. |
|
650 | 0 | _aOperating systems (Computers). | |
650 | 0 | _aBusiness information services. | |
650 | 1 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aProbability Theory. |
650 | 2 | 4 | _aComputer Engineering and Networks. |
650 | 2 | 4 | _aSystem Performance and Evaluation. |
650 | 2 | 4 | _aOperating Systems. |
650 | 2 | 4 | _aIT in Business. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540423577 |
776 | 0 | 8 |
_iPrinted edition: _z9783662182765 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2046 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-44592-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c189231 _d189231 |