LEADER 04455nam  22007815  450 
001 9910143605403321
005 20200704045711.0
010   $a3-540-44592-7
024 7 $a10.1007/3-540-44592-7
035   $a(CKB)1000000000211401
035   $a(SSID)ssj0000326069
035   $a(PQKBManifestationID)11248953
035   $a(PQKBTitleCode)TC0000326069
035   $a(PQKBWorkID)10265219
035   $a(PQKB)10194624
035   $a(DE-He213)978-3-540-44592-0
035   $a(MiAaPQ)EBC3071504
035   $a(PPN)155169203
035   $a(EXLCZ)991000000000211401
100   $a20121227d2001      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aQueueing Networks with Discrete Time Scale $eExplicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks /$fby Hans Daduna
205   $a1st ed. 2001.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001.
215   $a1 online resource (X, 142 p.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2046
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-42357-5 
320   $aIncludes bibliographical references and index.
327   $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.
330   $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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v2046
606   $aComputer communication systems
606   $aProbabilities
606   $aComputer engineering
606   $aComputer system failures
606   $aOperating systems (Computers)
606   $aInformation technology
606   $aBusiness?Data processing
606   $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022
606   $aProbability Theory and Stochastic Processes$3https://scigraph.springernature.com/ontologies/product-market-codes/M27004
606   $aComputer Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I27000
606   $aSystem Performance and Evaluation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13049
606   $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045
606   $aIT in Business$3https://scigraph.springernature.com/ontologies/product-market-codes/522000
615  0$aComputer communication systems.
615  0$aProbabilities.
615  0$aComputer engineering.
615  0$aComputer system failures.
615  0$aOperating systems (Computers).
615  0$aInformation technology.
615  0$aBusiness?Data processing.
615 14$aComputer Communication Networks.
615 24$aProbability Theory and Stochastic Processes.
615 24$aComputer Engineering.
615 24$aSystem Performance and Evaluation.
615 24$aOperating Systems.
615 24$aIT in Business.
676   $a519.8/2
700   $aDaduna$b Hans$4aut$4http://id.loc.gov/vocabulary/relators/aut$0552616
906   $aBOOK
912   $a9910143605403321
996   $aQueueing networks with discrete time scale$9973505
997   $aUNINA