Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Stochastic networks / Frank Kelly and Elena Yudovina.

By: Contributor(s): Material type: TextTextSeries: Publication details: Cambridge : CUP, 2014.Description: x, 222 p. : illustrations ; 24 cmISBN:
  • 9781107691704 (pbk.)
Subject(s): DDC classification:
  • 23 K29 000SB:384
Contents:
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 -- 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-- Appendix A-- Appendix B-- Appendix C-- Appendix D-- References-- Index.
Summary: A compact, highly-motivated introduction to some of the stochastic models found useful in the study of communications networks.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Status Date due Barcode Item holds
Books ISI Library, Kolkata 000SB:384 K29 (Browse shelf(Opens below)) Available 135514
Total holds: 0

Includes bibliographical references (pages 217-220) and index.

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 --
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--

Appendix A--
Appendix B--
Appendix C--
Appendix D--
References--
Index.

A compact, highly-motivated introduction to some of the stochastic models found useful in the study of communications networks.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in