MARC Record from Library of Congress

LEADER: 03259cam a22004097a 4500
001 2014395645
003 DLC
005 20140805082806.0
008 140717s2014 enka b 001 0 eng d
010 $a 2014395645
015 $aGBB392481$2bnb
016 7 $a016515457$2Uk
020 $a9781107035775 (hbk.)
020 $a1107035775 (hbk.)
020 $a9781107691704 (pbk.)
020 $a1107691702 (pbk.)
035 $a(OCoLC)ocn874115769
040 $aUKMGB$beng$cUKMGB$dOCLCO$dLTSCA$dIPL$dAU@$dDLC
042 $alccopycat
050 00 $aQA274.2$b.K45 2014
082 04 $a384.0151922$223
100 1 $aKelly, Frank,$d1950-$eauthor.
245 10 $aStochastic networks /$cFrank Kelly, University of Cambridge, Elena Yudovina, University of Michigan, Ann Arbor.
264 1 $aCambridge, United Kingdom :$bCambridge University Press,$c2014.
300 $ax, 222 pages :$billustrations ;$c24 cm.
336 $atext$2rdacontent
336 $astill image$2rdacontent
337 $aunmediated$2rdamedia
338 $avolume$2rdacarrier
490 1 $aInstitute of Mathematical Statistics textbooks ;$v2
504 $aIncludes bibliographical references (pages 217-220) and index.
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.
650 0 $aTelecommunication systems$xStatistical methods.
650 0 $aStochastic models.
700 1 $aYudovina, Elena,$eauthor.
830 0 $aInstitute of Mathematical Statistics textbooks ;$v2.