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

'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

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

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

'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

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

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

'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

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