03154nam a22005295i 4500001001800000003000900018005001700027007001500044008004100059020001800100024003100118050002000149072001600169072002300185082001400208100002700222245018000249264006100429300003200490336002600522337002600548338003600574347002400610490005800634505032500692520097201017650002201989650002802011650003102039650003602070650003002106650003502136650002602171650001902197650002202216650003702238650004902275650002602324650003902350650002302389650002002412710003402432773002002466776003602486830005802522856004402580978-3-540-44592-0DE-He21320170515111527.0cr nn 008mamaa121227s2001 gw | s |||| 0|eng d a97835404459207 a10.1007/3-540-44592-72doi 4aTK5105.5-5105.9 7aUKN2bicssc 7aCOM0750002bisacsh04a004.62231 aDaduna, Hans.eauthor.10aQueueing Networks with Discrete Time Scaleh[electronic resource] :bExplicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks /cby Hans Daduna. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2001. aX, 142 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v20460 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. 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. 0aComputer science. 0aInformation technology. 0aBusinessxData processing. 0aComputer communication systems. 0aComputer system failures. 0aOperating systems (Computers). 0aComputer engineering. 0aProbabilities.14aComputer Science.24aComputer Communication Networks.24aProbability Theory and Stochastic Processes.24aComputer Engineering.24aSystem Performance and Evaluation.24aOperating Systems.24aIT in Business.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540423577 0aLecture Notes in Computer Science,x0302-9743 ;v204640uhttp://dx.doi.org/10.1007/3-540-44592-7