Communication Networking: An Analytical Approach
Regular price
16.000 KD
inc. VAT
Couldn't load pickup availability
Table of contents
- Cover
- Contentsix
- Prefacexix
- Chapter 1. Introduction: Two Examples1
- 1.1 Efficient Transport of Packet Voice Calls1
- 1.2 Achievable Throughput in an Input-Queueing Packet Switch7
- 1.3 The Importance of Quantitative Modeling in the Engineering of Telecommunication Networks13
- 1.4 Summary17
- 1.5 Notes on the Literature17
- Problems18
- Chapter 2. Networking: Functional Elements and Current Practice19
- 2.1 Networking as Resource Sharing20
- 2.2 The Functional Elements23
- 2.3 Current Practice47
- 2.4 Summary and Our Way Forward85
- 2.5 Notes on the Literature86
- Problems87
- Part I: Multiplexing91
- Chapter 3. Multiplexing: Performance Measures and Engineering Issues93
- 3.1 Network Performance and Source Characterization93
- 3.2 Stream Sessions in a Packet Network: Delay Guarantees99
- 3.3 Circuit-Multiplexed Networks107
- 3.4 Elastic Transfers in a Packet Network: Feedback Control109
- 3.5 Packet Multiplexing over Wireless Networks114
- Chapter 4. Stream Sessions: Deterministic Network Analysis119
- 4.1 Events and Processes in Packet Multiplexer Models: Universal Concepts119
- 4.2 Deterministic Traffic Models and Network Calculus126
- 4.3 Scheduling148
- 4.4 Application to a Packet Voice Example161
- 4.5 Connection Setup: The RSVP Approach165
- 4.6 Scheduling (Continued)168
- 4.7 Summary171
- 4.8 Notes on the Literature171
- Appendix172
- Problems176
- Chapter 5. Stream Sessions: Stochastic Analysis179
- 5.1 Deterministic Calculus Can Yield Loose Bounds179
- 5.2 Stochastic Traffic Models183
- 5.3 Additional Notation188
- 5.4 Performance Measures188
- 5.5 Little’s Theorem, Brumelle’s Theorem, and Applications190
- 5.6 Multiplexer Analysis with Stationary and Ergodic Traf.c199
- 5.7 The Effective Bandwidth Approach for Admission Control232
- 5.8 Application to the Packet Voice Example237
- 5.9 Stochastic Analysis with Shaped Traffic240
- 5.10 Multihop Networks246
- 5.11 Long-Range-Dependent Traffic256
- 5.12 Summary258
- 5.13 Notes on the Literature259
- Problems261
- Chapter 6. Circuit-Multiplexed Networks265
- 6.1 Introduction and Sample Applications265
- 6.2 Multiclass Traffic on a Single Link267
- 6.3 Overflow and Non-Poisson Traffic281
- 6.4 Multiclass Networks289
- 6.5 Erlang Fixed-Point Approximation295
- 6.6 Admission Control303
- 6.7 Waiting Room and Retrials306
- 6.8 Channel Allocation in Cellular Networks307
- 6.9 Wavelength Allocation in Optical Networks313
- 6.10 Summary318
- 6.11 Notes on the Literature319
- Problems320
- Chapter 7. Adaptive Bandwidth Sharing for Elastic Traffic323
- 7.1 Elastic Transfers in a Network323
- 7.2 Network Parameters and Performance Objectives325
- 7.3 Sharing a Single Link328
- 7.4 Rate-Based Control (RBC)330
- 7.5 Window-Based Control (WBC): General Principles348
- 7.6 TCP: The Internet’s Adaptive Window Protocol354
- 7.7 Bandwidth Sharing in a Network408
- 7.8 Summary425
- 7.9 Notes on the Literature426
- Problems430
- Chapter 8. Multiple Access: Wireless Networks435
- 8.1 Bits over a Wireless Link: Principles, Issues, and Trade-Offs437
- 8.2 Bits over a Wireless Network457
- 8.3 TCP Performance over Wireless Links460
- 8.4 Adaptive and Cross-Layer Techniques467
- 8.5 Random Access: Aloha, S-Aloha, and CSMA/CA474
- 8.6 Wireless Local Area Networks490
- 8.7 Wireless Ad Hoc Networks501
- 8.8 Link Scheduling and Network Capacity509
- 8.9 Wireless Sensor Networks: An Overview518
- 8.10 Summary521
- 8.11 Notes on the Literature522
- Appendix: Probability of Connectivity in a One-Dimensional Ad Hoc Network524
- Problems527
- Part II: Switching533
- Chapter 9. Performance and Architectural Issues535
- 9.1 Performance Measures535
- 9.2 Architectural Issues540
- Chapter 10. Queueing in Packet Switches547
- 10.1 FIFO Queueing at Output and Input547
- 10.2 Combined Input–Output Queueing560
- 10.3 Delay Analyses564
- 10.4 Variable-Length Packet Switches570
- 10.5 Non-FIFO Input-Queued Switches574
- 10.6 Emulating Output Queueing with Input Queueing587
- 10.7 Summary592
- 10.8 Notes on the Literature592
- Problems594
- Chapter 11. Switching Fabrics597
- 11.1 Elementary Switch Structures597
- 11.2 Switching Networks605
- 11.3 Self-Routing Networks619
- 11.4 Multicast Packet Switches630
- 11.5 Summary633
- 11.6 Notes on the Literature634
- Problems635
- Chapter 12. Packet Processing637
- 12.1 Addressing and Address Lookup637
- 12.2 Efficient Longest Prefix Matching644
- 12.3 Packet Classification656
- 12.4 Other Design Issues660
- 12.5 Network Processors662
- 12.6 Summary665
- 12.7 Notes on the Literature665
- Problems666
- Part III: Routing669
- Chapter 13. Routing: Engineering Issues671
- Chapter 14. Shortest Path Routing of Elastic Aggregates677
- 14.1 Elastic Aggregates and Traffic Engineering677
- 14.2 Optimal Routing682
- 14.3 Algorithms for Shortest Path Routing695
- 14.4 Routing Protocols701
- 14.5 Summary708
- 14.6 Notes on the Literature709
- Problems709
- Chapter 15. Virtual-Path Routing of Elastic Aggregates713
- 15.1 On-Demand Routing713
- 15.2 Limitations of Min Hop Routing715
- 15.3 Formulations of the Routing Problem716
- 15.4 Multiprotocol Label Switching (MPLS)732
- 15.5 Summary736
- 15.6 Notes on the Literature736
- Appendix: The Maxflow Mincut Theorem737
- Problems738
- Chapter 16. Routing of Stream-Type Sessions741
- 16.1 QoS Routing741
- 16.2 Nonadditive Metrics744
- 16.3 Additive Metrics: Rate-Based Multiplexers745
- 16.4 Additive Metrics: Non-Rate-Based Multiplexers759
- 16.5 Summary772
- 16.6 Notes on the Literature773
- Problems773
- Part IV: Appendices777
- Appendix A. Glossary of Terms and Notation779
- A.1 Technical Terms and Expansions of Acronyms779
- A.2 Units786
- A.3 Miscellaneous Operators and Mathematical Notation786
- A.4 Vectors and Matrices786
- A.5 Asymptotics: The O, o, and ^ Notation787
- A.6 Probability788
- Appendix B. A Review of Some Mathematical Concepts791
- B.1 Limits of Real Number Sequences791
- B.2 A Fixed-Point Theorem793
- B.3 Probability and Random Processes795
- B.4 Notes on the Literature801
- Appendix C. Convex Optimization803
- C.1 Convexity803
- C.2 Local and Global Optima804
- C.3 The Karush–Kuhn–Tucker Conditions805
- C.4 Linear Programming809
- C.5 Duality810
- C.6 Sensitivity of the Optimal Solution815
- Appendix D. Discrete Event Random Processes819
- D.1 Markov Chains and Some Renewal Theory819
- D.2 Some Important Queueing Models843
- D.3 Reversibility of Markov Chains, and Jackson Queueing Networks848
- D.4 Notes on the Literature865
- Appendix E. Complexity Theory867
- Bibliography873
- Index895
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.
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.