000 04341nam a22004338i 4500
001 CR9781139565363
005 20250919142047.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 120718s2014||||enk o ||1 0|eng|d
020 _a9781139565363 (ebook)
020 _z9781107035775 (hardback)
020 _z9781107691704 (paperback)
040 _aUkCbUP
_beng
_erda
_cUkCbUP
050 0 0 _aQA274.2
_b.K45 2014
082 0 0 _a384.0151922
_223
100 1 _aKelly, Frank,
_d1950-
_eauthor.
245 1 0 _aStochastic networks /
_cFrank Kelly, University of Cambridge, Elena Yudovina, University of Michigan, Ann Arbor.
264 1 _aCambridge :
_bCambridge University Press,
_c2014.
300 _a1 online resource (x, 222 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aInstitute of Mathematical Statistics textbooks ;
_v2
500 _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505 0 _aMachine generated contents note: Queueing and loss networks -- Decentralized optimization -- Random access networks -- Broadband networks -- Internet modelling -- Part I -- 1.Markov chains -- 1.1.Definitions and notation -- 1.2.Time reversal -- 1.3.Erlang's formula -- 1.4.Further reading -- 2.Queueing networks -- 2.1.An M/M/1 queue -- 2.2.A series of M/M//1 queues -- 2.3.Closed migration processes -- 2.4.Open migration processes -- 2.5.Little's law -- 2.6.Linear migration processes -- 2.7.Generalizations -- 2.8.Further reading -- 3.Loss networks -- 3.1.Network model -- 3.2.Approximation procedure -- 3.3.Truncating reversible processes -- 3.4.Maximum probability -- 3.5.A central limit theorem -- 3.6.Erlang fixed point -- 3.7.Diverse routing -- 3.8.Further reading -- Part II -- 4.Decentralized optimization -- 4.1.An electrical network -- 4.2.Road traffic models -- 4.3.Optimization of queueing and loss networks -- 4.4.Further reading -- 5.Random access networks --
505 0 _aContents note continued: 5.1.The ALOHA protocol -- 5.2.Estimating backlog -- 5.3.Acknowledgement-based schemes -- 5.4.Distributed random access -- 5.5.Further reading -- 6.Effective bandwidth -- 6.1.Chernoff bound and Cramer's theorem -- 6.2.Effective bandwidth -- 6.3.Large deviations for a queue with many sources -- 6.4.Further reading -- Part III -- 7.Internet congestion control -- 7.1.Control of elastic network flows -- 7.2.Notions of fairness -- 7.3.A primal algorithm -- 7.4.Modelling TCP -- 7.5.What is being optimized? -- 7.6.A dual algorithm -- 7.7.Time delays -- 7.8.Modelling a switch -- 7.9.Further reading -- 8.Flow level Internet models -- 8.1.Evolution of flows -- 8.2.[alpha]-fair rate allocations -- 8.3.Stability of [alpha]-fair rate allocations -- 8.4.What can go wrong? -- 8.5.Linear network with proportional fairness -- 8.6.Further reading.
520 _aCommunication networks underpin our modern world, and provide fascinating and challenging examples of large-scale stochastic systems. Randomness arises in communication systems at many levels: for example, the initiation and termination times of calls in a telephone network, or the statistical structure of the arrival streams of packets at routers in the Internet. How can routing, flow control and connection acceptance algorithms be designed to work well in uncertain and random environments? This compact introduction illustrates how stochastic models can be used to shed light on important issues in the design and control of communication networks. It will appeal to readers with a mathematical background wishing to understand this important area of application, and to those with an engineering background who want to grasp the underlying mathematical theory. Each chapter ends with exercises and suggestions for further reading.
650 0 _aTelecommunication systems
_xStatistical methods.
650 0 _aStochastic models.
700 1 _aYudovina, Elena,
_eauthor.
776 0 8 _iPrint version:
_z9781107035775
830 0 _aInstitute of Mathematical Statistics textbooks ;
_v2.
856 4 0 _uhttps://doi.org/10.1017/CBO9781139565363
907 _a.b16846436
_b2020-12-22
_c2020-12-22
942 _n0
998 _a1
_b2020-12-22
_cm
_da
_feng
_genk
_y0
_z.b16846436
999 _c651986
_d651986