Stochastic Networks
£36.99
Part of Institute of Mathematical Statistics Textbooks
- Authors:
- Frank Kelly, University of Cambridge
- Elena Yudovina, University of Michigan, Ann Arbor
- Date Published: February 2014
- availability: Available
- format: Paperback
- isbn: 9781107691704
£
36.99
Paperback
Other available formats:
Hardback, eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
Communication 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.
Read more- Author team includes Frank Kelly, a pioneer in the field of stochastic networks
- Self-contained appendices contain discussion of relevant mathematical techniques, such as Lagrange multipliers
- Derived from a graduate-level course taught at the University of Cambridge
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: February 2014
- format: Paperback
- isbn: 9781107691704
- length: 231 pages
- dimensions: 228 x 152 x 12 mm
- weight: 0.39kg
- contains: 60 b/w illus. 80 exercises
- availability: Available
Table of Contents
Overview
Part I:
1. Markov chains
2. Queueing networks
3. Loss networks
Part II:
4. Decentralized optimization
5. Random access networks
6. Effective bandwidth
Part III:
7. Internet congestion control
8. Flow level internet models
Appendix A. Continuous time Markov processes
Appendix B. Little's law
Appendix C. Lagrange multipliers
Appendix D. Foster-Lyapunov criteria
References
Index.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×