Communication Networking

An Analytical Approach


  • Anurag Kumar, Professor, Deptartment of ECE, Indian Institute of Science, Bangalore
  • D. Manjunath, Professor, Deptartment of EE, Indian Institute of Technology, Bombay
  • Joy Kuri, Assistant Professor, Indian Institute of Science, Bangalore

The viewpoint is that communication networking is about efficient resource sharing. The focus is on the three building blocks of communication networking, namely, multiplexing, switching and routing. The approach is analytical, with the discussion being driven by mathematical analyses of and solutions to specific engineering problems.The result? A comprehensive, effectively organized treatment of core engineering issues in communication networking. Written for both the networking professional and for the classroom, this book covers fundamental concepts in detail and places design issues in context by drawing on real world examples from current technologies.
View full description


PROFESSIONAL REFERENCE: Networking professionals whose work is primarily architecture definition and implementation, i.e., network engineers and designers at telecom companies, industrial research labs, etc. ACADEMIC: Final year undergrad and first year graduate students in EE, CE, and CS programs.


Book information

  • Published: May 2004
  • ISBN: 978-0-12-428751-8


This book combines an innovative and uniform representation of a variety of communication networks, simple to understand motivations for real design problems for these networks, intuitive approaches to solutions, and rigorous mathematical analysis where appropriate. It will be very valuable both as a textbook and as a reference for practitioners. --Bharat Doshi, Director of Transformational Communication, Johns Hopkins University, Applied Physics Laboratory It has been very difficult to write a textbook on networking that is relevant and rigorous because the field is diverse and fast changing. This book stands out in both providing the readers with the essential domain knowledge and equipping them with fundamental tools to analyze and design new systems as the networking field evolves." --Steven Low, Associate Professor, California Institute of Technology This book is a well-researched compendium of theoretical modeling applied to a number of practical networking problems. Some interesting topics of note are important insights in the design of packet switches, performance of TCP under various conditions, and the design of packet address prefix lookups. Although much of the material is mathematically advanced, the book contains a comprehensive set of appendices useful as a reference for the researcher or advanced practitioner. --Dr. David E. McDysan, Fellow, MCI Internet Architecture and Technology

Table of Contents

Preface1 Introduction: Two Examples1.1 Efficient Transport of Packet Voice 1.2 Throughput of an Input Queuing Packet Switch 1.3 Importance of Quantitative Modeling 1.4 Summary 1.5 Notes on the Literature Problems2 Networking: Elements and Practice2.1 Networking as Resource Sharing 2.2 The Functional Elements 2.3 Current Practice 2.4 Summary 2.5 Notes on the Literature ProblemsPart I - Multiplexing3 Multiplexing: Performance Measures, Engineering Issues3.1 Network Performance, Source Characterization 3.2 Stream Sessions in a Packet Network 3.3 Circuit Multiplexed Networks 3.4 Elastic Traffic: Feedback Control 3.5 Packet Multiplexing over Wireless Networks4 Stream Sessions: Deterministic Network Analysis4.1 Events and Processes in Packet Multiplexer Models 4.2 Deterministic Network Calculus 4.3 Scheduling 4.4 Application to the Packet Voice Example 4.5 Connection Set Up: The RSVP Approach 4.6 Scheduling (continued) 4.7 Appendix 4.8 Notes on the Literature Problems5 Stream Sessions: Stochastic Analysis5.1 Deterministic Calculus Can Yield Loose Bounds 5.2 Stochastic Traffic Models 5.3 Additional Notation 5.4 Performance Measures 5.5 Little's Theorem, Brumelle's Theorem, and Applications 5.6 Multiplexer Analysis with Stationary and Ergodic Traffic 5.7 The Effective Bandwidth Approach for Admission Control 5.8 Application to the Packet Voice Example 5.9 Stochastic Analysis with Shaped Traffic 5.10 Multi-Hop Networks 5.11 Long Range Dependent Traffic 5.12 Notes on the Literature Problems6 Circuit Multiplexing 6.1 Introduction and Example Applications 6.2 Multiclass Traffic on a Single Link 6.3 Overflow and Non-Poisson Traffic 6.4 Multiclass Networks 6.5 Erlang Fixed Point Approximation 6.6 Admission Control 6.7 Waiting Room and Retrials 6.8 Channel Allocation in Cellular Networks 6.9 Wavelength Allocation in Optical Networks 6.10 Summary 6.11 Notes on the Literature Problems 7 Adaptive Bandwidth Sharing for Elastic Traffic7.1 Elastic Transfers in a Network 7.2 Network Parameters and Performance Objectives 7.3 Sharing a Single Link 7.4 Rate Based Control (RBC) 7.5 Window Based Control (WBC): General Principles 7.6 TCP: Internet's Adaptive Window Protocol 7.7 Bandwidth Sharing in a Network 7.8 Summary 7.9 Notes on the Literature Problems8 Multiple Access: Wireless Networks8.1 Bits over a Wireless Link: Principles, Issues, and Tradeoffs 8.2 Bits over a Wireless Network 8.3 TCP Performance over Wireless Links 8.4 Adaptive and Cross-Layer Techniques 8.5 Random Access: Aloha, S-Aloha, CSMA/CA 8.6 Wireless Local Area Networks 8.7 Wireless Ad-Hoc Networks 8.8 Link Scheduling and Network Capacity 8.9 Wireless Sensor Networks: An Overview 8.10 Summary 8.11 Notes on the Literature ProblemsPart II - Switching9 Performance and Architecture Issues 9.1 Performance Measures 9.2 Architectural Issues 10 Queuing in Packet Switches10.1 FIFO Queuing at Output and Input 10.2 Combined Input Output Queuing 10.3 Delay Analyses 10.4 Variable Length Packet Switches 10.5 Non FIFO Input Queued Switches 10.6 Emulating Output Queuing with Input Queuing 10.7 Summary 10.8 Notes on Literature Problems11 Switching Fabrics11.1 Elementary Switch Structures 11.2 Switching Networks 11.3 Self Routing Networks 11.4 Multicast Packet Switches 11.5 Summary 11.6 Notes on Literature Problems 12 Packet Processing12.1 Addressing and Address Lookup 12.2 Efficient Longest Prefix Matching 12.3 Packet Classification 12.4 Other Design Issues 12.5 Network Processors 12.6 Summary 12.7 Notes on Literature ProblemsPart III - Routing13 Routing: Engineering Issues14 Shortest Path Routing of Elastic Aggregates14.1 Elastic Aggregates and Traffic Engineering 14.2 Optimal Routing 14.3 Algorithms for Shortest Path Routing 14.4 Routing Protocols 14.5 Summary 14.6 Notes on the Literature Problems15 Virtual Path Routing of Elastic Aggregates15.1 On Demand Routing 15.2 Limitations of Min Hop Routing 15.3 Formulations of the Routing Problem 15.4 Multi-Protocol Label Switching (MPLS) 15.5 Summary 15.6 Notes on the Literature Problems16 Routing of Stream-Type Sessions 16.1 QoS Routing 16.2 Non-additive Metrics 16.3 Additive Metrics: Rate-Based Multiplexers 16.4 Additive Metrics: Non-Rate-Based Multiplexers 16.5 Summary 16.6 Notes on the Literature ProblemsPart IV - AppendicesA - Glossary of Terminology and Notation B - A Review of some Mathematical Concepts C - Convex Optimization D - Discrete Event Random Processes E - Complexity TheoryBibliographyIndex