Communication Networks
Cambridge University Press (Verlag)
978-1-107-03605-5 (ISBN)
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.
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.
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.
| Zusatzinfo | Worked examples or Exercises; 155 Line drawings, unspecified |
|---|---|
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 193 x 253 mm |
| Gewicht | 930 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Netzwerke |
| Mathematik / Informatik ► Informatik ► Theorie / Studium | |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Technik ► Elektrotechnik / Energietechnik | |
| Technik ► Nachrichtentechnik | |
| ISBN-10 | 1-107-03605-4 / 1107036054 |
| ISBN-13 | 978-1-107-03605-5 / 9781107036055 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
