TY  - BOOK
AU  - Kumar,Anurag
AU  - Manjunath,D.
AU  - Kuri,Joy
TI  - Communication Networking: An Analytical Approach
T2  - The Morgan Kaufmann Series in Networking Ser
SN  - 9780080488516
AV  - TK5101.K86 2004 
U1  - 004.6/5 
PY  - 2004///
CY  - San Francisco
PB  - Elsevier Science & Technology
KW  - Multiplexing
KW  - Routers (Computer networks)
KW  - Telecommunication -- Switching systems
KW  - Telecommunication systems -- Management
KW  - Electronic books
N1  - Front Cover -- COMMUNICATION NETWORKING: An Analytical Approach -- Copyright Page -- Contents -- Preface -- Chapter 1. Introduction: Two Examples -- 1.1 Efficient Transport of Packet Voice Calls -- 1.2 Achievable Throughput in an Input-Queueing Packet Switch -- 1.3 The Importance of Quantitative Modeling in the Engineering of Telecommunication Networks -- 1.4 Summary -- 1.5 Notes on the Literature -- Problems -- Chapter 2. Networking: Functional Elements and Current Practice -- 2.1 Networking as Resource Sharing -- 2.2 The Functional Elements -- 2.3 Current Practice -- 2.4 Summary and Our Way Forward -- 2.5 Notes on the Literature -- Problems -- Part I: Multiplexing -- Chapter 3. Multiplexing: Performance Measures and Engineering Issues -- 3.1 Network Performance and Source Characterization -- 3.2 Stream Sessions in a Packet Network: Delay Guarantees -- 3.3 Circuit-Multiplexed Networks -- 3.4 Elastic Transfers in a Packet Network: Feedback Control -- 3.5 Packet Multiplexing over Wireless Networks -- Chapter 4. Stream Sessions: Deterministic Network Analysis -- 4.1 Events and Processes in Packet Multiplexer Models: Universal Concepts -- 4.2 Deterministic Traffic Models and Network Calculus -- 4.3 Scheduling -- 4.4 Application to a Packet Voice Example -- 4.5 Connection Setup: The RSVP Approach -- 4.6 Scheduling (Continued) -- 4.7 Summary -- 4.8 Notes on the Literature -- Appendix -- Problems -- Chapter 5. Stream Sessions: Stochastic Analysis -- 5.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 Traf.c -- 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 Multihop Networks -- 5.11 Long-Range-Dependent Traffic -- 5.12 Summary -- 5.13 Notes on the Literature -- Problems -- Chapter 6. Circuit-Multiplexed Networks -- 6.1 Introduction and Sample 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 -- Chapter 7. Adaptive Bandwidth Sharing for Elastic Traffic -- 7.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: The Internet's Adaptive Window Protocol -- 7.7 Bandwidth Sharing in a Network -- 7.8 Summary -- 7.9 Notes on the Literature -- Problems -- Chapter 8. Multiple Access: Wireless Networks -- 8.1 Bits over a Wireless Link: Principles, Issues, and Trade-Offs -- 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, and 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 -- Appendix: Probability of Connectivity in a One-Dimensional Ad Hoc Network -- Problems -- Part II: Switching -- Chapter 9. Performance and Architectural Issues -- 9.1 Performance Measures -- 9.2 Architectural Issues -- Chapter 10. Queueing in Packet Switches -- 10.1 FIFO Queueing at Output and Input -- 10.2 Combined Input-Output Queueing; 10.3 Delay Analyses -- 10.4 Variable-Length Packet Switches -- 10.5 Non-FIFO Input-Queued Switches -- 10.6 Emulating Output Queueing with Input Queueing -- 10.7 Summary -- 10.8 Notes on the Literature -- Problems -- Chapter 11. Switching Fabrics -- 11.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 the Literature -- Problems -- Chapter 12. Packet Processing -- 12.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 the Literature -- Problems -- Part III: Routing -- Chapter 13. Routing: Engineering Issues -- Chapter 14. Shortest Path Routing of Elastic Aggregates -- 14.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 -- Problems -- Chapter 15. Virtual-Path Routing of Elastic Aggregates -- 15.1 On-Demand Routing -- 15.2 Limitations of Min Hop Routing -- 15.3 Formulations of the Routing Problem -- 15.4 Multiprotocol Label Switching (MPLS) -- 15.5 Summary -- 15.6 Notes on the Literature -- Appendix: The Maxflow Mincut Theorem -- Problems -- Chapter 16. Routing of Stream-Type Sessions -- 16.1 QoS Routing -- 16.2 Nonadditive 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 -- Problems -- Part IV: Appendices -- Appendix A. Glossary of Terms and Notation -- A.1 Technical Terms and Expansions of Acronyms -- A.2 Units -- A.3 Miscellaneous Operators and Mathematical Notation -- A.4 Vectors and Matrices -- A.5 Asymptotics: The O, o, and   Notation -- A.6 Probability; Appendix B. A Review of Some Mathematical Concepts -- B.1 Limits of Real Number Sequences -- B.2 A Fixed-Point Theorem -- B.3 Probability and Random Processes -- B.4 Notes on the Literature -- Appendix C. Convex Optimization -- C.1 Convexity -- C.2 Local and Global Optima -- C.3 The Karush-Kuhn-Tucker Conditions -- C.4 Linear Programming -- C.5 Duality -- C.6 Sensitivity of the Optimal Solution -- Appendix D. Discrete Event Random Processes -- D.1 Markov Chains and Some Renewal Theory -- D.2 Some Important Queueing Models -- D.3 Reversibility of Markov Chains, and Jackson Queueing Networks -- D.4 Notes on the Literature -- Appendix E. Complexity Theory -- Bibliography -- Index
N2  - 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. ·Systematically uses mathematical models and analyses to drive the development of a practical understanding of core network engineering problems. ·Provides in-depth coverage of many current topics, including network calculus with deterministically-constrained traffic, congestion control for elastic traffic, packet switch queuing, switching architectures, virtual path routing, and routing for quality of service. ·Includes over 200 hands-on exercises and class-tested problems, dozens of schematic figures, a review of key mathematical concepts, and a glossary
UR  - https://ebookcentral.proquest.com/lib/buse-ebooks/detail.action?docID=333974
ER  -