Skip to content
Register Sign in Wishlist

Communication Networks
An Optimization, Control, and Stochastic Networks Perspective

$73.99 (X)

  • Authors:
  • R. Srikant, University of Illinois, Urbana-Champaign
  • Lei Ying, Arizona State University
  • Date Published: February 2014
  • availability: In stock
  • format: Hardback
  • isbn: 9781107036055

$ 73.99 (X)

Add to cart Add to wishlist

Other available formats:

Request examination copy

Instructors may request a copy of this title for examination

Product filter button
About the Authors
  • Provides a modern mathematical approach to the design of communication networks for graduate students, blending control, optimization, and stochastic network theories. A broad range of performance analysis tools are discussed, including important advanced topics that have been made accessible to students for the first time. Taking a top-down approach to network protocol design, the authors begin with the deterministic model and progress to more sophisticated models. Network algorithms and protocols are tied closely to the theory, illustrating the practical engineering applications of each topic. The background behind the mathematical analyses is given before the formal proofs and is supported by worked examples, enabling students to understand the big picture before going into the detailed theory. End-of-chapter problems cover a range of difficulties, with complex problems broken into several parts, and hints to many problems are provided to guide students. Full solutions are available online for instructors.

    • Takes a top-down approach to network protocol design
    • Emphasizes cross-layer issues
    • Discusses a broad range of performance analysis tools
    • Theoretical results are tied to real-world network applications
    Read more

    Reviews & endorsements

    "This book by Srikant and Ying fills a major void - an analytical and authoritative study of communication networks that covers many of the major advances made in this area in an easy-to-understand and self-contained manner. It is a must read for any networking student, researcher, or engineer who wishes to have a fundamental understanding of the key operations of communication networks, from network dimensioning and design to congestion control, routing, and scheduling. Throughout the book, the authors have taken pains to explain highly mathematical material in a manner that is accessible to a beginning graduate student. This has often required providing new examples, results, and proofs that are simple and easy to follow, which makes the book attractive to academics and engineers alike. A must have networking book for one's personal library!"
    Ness B. Shroff, Ohio State University

    "Communication Networks provides a deep, modern and broad yet accessible coverage of the analysis of networks. The authors, who made many original contributions to this field, guide the readers through the intuition behind the analysis and results. The text is ideal for self-study and as a basis for a graduate course on the mathematics of communication networks. Students in networking will benefit greatly from reading this book."
    Jean Walrand, University of California, Berkeley

    "Communication Networks, by Srikant and Ying, provides a mathematically rigorous treatment of modern communication networks. The book provides the essential mathematical preliminaries in queueing theory, optimization and control, followed by a rigorous treatment of network architectures, protocols and algorithms that are at the heart of modern-day communication networks and the Internet. It is the best textbook on communication networks from a theoretical perspective in over 20 years, filling a much needed void in the field. It can be an excellent textbook for graduate and advanced undergraduate classes, and extremely useful to researchers in this rapidly evolving field."
    Eytan Modiano, Massachusetts Institute of Technology

    "This book presents a view of communication networks, their architecture and protocols, grounded in the theoretical constructs from optimization and queuing theory that underpin the modern approach to the design and analysis of networks. It is a superb introduction to this approach."
    Frank Kelly, University of Cambridge

    "This textbook provides a thoughtful treatment of network architecture and network protocol design within a solid mathematical framework. Networks are required to provide good stable behavior in random environments. This textbook provides the tools needed to make this happen. It provides needed foundations in optimization, control, and probabilistic techniques. It then demonstrates their application to the understanding of current networks and the design of future network architectures and protocols. This is a "must" addition to the library of graduate students performing research in networking, and engineers researching future network architectures and protocols."
    Donald F. Towsley, University of Massachusetts, Amherst

    "Chapters follow the logical flow of designing layers of the network. Each chapter brings another aspect of network modeling. Although many algorithms are presented in the form of pseudo-code only, no clarity is lost and the book can be recommended to programmers seeking a solid reference … Exercises are interesting and feel like real research problems. With solutions available to instructors, this book is also an excellent choice as a textbook for a performance evaluation course. The most appreciated feature of this work is its freshness: all the examples and exercises are up to date. This makes classic theories more attractive to students, who can see the real applications of complex mathematics, and motivate[s] them to dive into the exciting world of network optimization and control."
    IEEE Communications Magazine

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: February 2014
    • format: Hardback
    • isbn: 9781107036055
    • length: 363 pages
    • dimensions: 253 x 193 x 20 mm
    • weight: 0.86kg
    • contains: 155 b/w illus. 108 exercises
    • availability: In stock
  • Table of Contents

    1. Introduction
    2. Mathematics of internet architecture
    3. Links: statistical multiplexing and queues
    4. Scheduling in packet switches
    5. Scheduling in wireless networks
    6. Back to network utility maximization
    7. Network protocols
    8. Peer-to-peer networks
    9. Queuing theory in continuous time
    10. Heavy-traffic limits of queuing networks
    11. Large deviations
    12. Geometric random graph models of wireless networks.

  • Resources for

    Communication Networks

    R. Srikant, Lei Ying

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    *This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.

    These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.

    If you are having problems accessing these resources please email

  • Authors

    R. Srikant, University of Illinois, Urbana-Champaign
    R. Srikant is the Fredric G. and Elizabeth H. Nearing Endowed Professor of Electrical and Computer Engineering at the University of Illinois, Urbana-Champaign, and is frequently ranked as among the university's best teachers. His research interests include communications networks, stochastic processes, queuing theory, information theory and game theory. He has been a Distinguished Lecturer of the IEEE Communications Society and is a Fellow of the IEEE.

    Lei Ying, Arizona State University
    Lei Ying is an Associate Professor in the Department of Electrical and Computer Engineering at Arizona State University and formerly an Assistant Professor at Iowa State University. His research interests include stochastic networks, wireless networking, big data, peer-to-peer networks and cloud computing.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

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.

Please fill in the required fields in your feedback submission.