Network routing : algorithms, protocols, and architectures

Network routing can be broadly categorized into Internet routing, PSTN routing, and telecommunication transport network routing. This book systematically considers these routing paradigms, as well as their interoperability. The authors discuss how algorithms, protocols, analysis, and operational dep...

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autoři: Medhi, Deepankar, Ramasamy, Karthikeyan
Médium: E-kniha Kniha
Jazyk:angličtina
Vydáno: San Francisco Morgan Kaufmann Publishers is an imprint of Elsevier 2007
Elsevier Science & Technology
Morgan Kaufmann
Vydání:1
Edice:The Morgan Kaufmann series in networking
Témata:
Computer network architectures
Computer networks
Routers (Computer networks)
ISBN:0120885883, 9780120885886
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Obsah:
  • Front cover -- Network Routing: Algorithms, Protocols, and Architectures -- Copyright page -- Contents -- Foreword -- Preface -- About the Authors -- Part I: Network Routing: Basics and Foundations -- Chapter 1. Networking and Network Routing: An Introduction -- 1.1 Addressing and Internet Service: An Overview -- 1.2 Network Routing: An Overview -- 1.3 IP Addressing -- 1.4 On Architectures -- 1.5 Service Architecture -- 1.6 Protocol Stack Architecture -- 1.7 Router Architecture -- 1.8 Network Topology Architecture -- 1.9 Network Management Architecture -- 1.10 Public Switched Telephone Network -- 1.11 Communication Technologies -- 1.12 Standards Committees -- 1.13 Last Two Bits -- 1.14 Summary -- Further Lookup -- Exercises -- Chapter 2. Routing Algorithms: Shortest Path and Widest Path -- 2.1 Background -- 2.2 Bellman-Ford Algorithm and the Distance Vector Approach -- 2.3 Dijkstra's Algorithm -- 2.4 Comparison of the Bellman-Ford Algorithm and Dijkstra's Algorithm -- 2.5 Shortest Path Computation with Candidate Path Caching -- 2.6 Widest Path Computation with Candidate Path Caching -- 2.7 Widest Path Algorithm -- 2.8 k-Shortest Paths Algorithm -- 2.9 Summary -- Further Lookup -- Exercises -- Chapter 3. Routing Protocols: Framework and Principles -- 3.1 Routing Protocol, Routing Algorithm, and Routing Table -- 3.2 Routing Information Representation and Protocol Messages -- 3.3 Distance Vector Routing Protocol -- 3.4 Link State Routing Protocol -- 3.5 Path Vector Routing Protocol -- 3.6 Link Cost -- 3.7 Summary -- Further Lookup -- Exercises -- Chapter 4. Network Flow Modeling -- 4.1 Terminologies -- 4.2 Single-Commodity Network Flow -- 4.3 Multicommodity Network Flow: Three-Node Example -- 4.4 Multicommodity Network Flow Problem: General Formulation -- 4.5 Multicommodity Network Flow Problem: Nonsplittable Flow -- 4.6 Summary -- Further Lookup
  • 13.1 Global Telephone Addressing -- 13.2 Setting Up a Basic Telephone Call and Its Steps -- 13.3 Digit Analysis versus Translation -- 13.4 Routing Decision for a Dialed Call -- 13.5 Call Routing: Single National Provider Environment -- 13.6 Call Routing: Multiple Long-Distance Provider Case -- 13.7 Multiple-Provider Environment: Multiple Local Exchange Carriers -- 13.8 Routing Decision at an Intermediate TDM Switch -- 13.9 Number Portability -- 13.10 Nongeographic or Toll-Free Number Portability -- 13.11 Fixed/Mobile Number Portability -- 13.12 Multiple-Provider Environment with Local Number Portability -- 13.13 Summary -- Further Lookup -- Exercises -- Part IV: Router Architectures -- Chapter 14. Router Architectures -- 14.1 Functions of a Router -- 14.2 Types of Routers -- 14.3 Elements of a Router -- 14.4 Packet Flow -- 14.5 Packet Processing: Fast Path versus Slow Path -- 14.6 Router Architectures -- 14.7 Summary -- Further Lookup -- Exercises -- Chapter 15. IP Address Lookup Algorithms -- 15.1 Impact of Addressing on Lookup -- 15.2 Longest Prefix Matching -- 15.3 Naive Algorithms -- 15.4 Binary Tries -- 15.5 Multibit Tries -- 15.6 Compressing Multibit Tries -- 15.7 Search by Length Algorithms -- 15.8 Search by Value Approaches -- 15.9 Hardware Algorithms -- 15.10 Comparing Different Approaches -- 15.11 Summary -- Further Lookup -- Exercises -- Chapter 16. IP Packet Filtering and Classification -- 16.1 Importance of Packet Classification -- 16.2 Packet Classification Problem -- 16.3 Packet Classification Algorithms -- 16.4 Naive Solutions -- 16.5 Two-Dimensional Solutions -- 16.6 Approaches for d Dimensions -- 16.7 Extending Two-Dimensional Solutions -- 16.8 Divide and Conquer Approaches -- 16.9 Tuple Space Approaches -- 16.10 Decision Tree Approaches -- 16.11 Hardware-Based Solutions -- 16.12 Lessons Learned -- 16.13 Summary -- Further Lookup
  • Exercises -- Part V: Toward Next Generation Routing -- Chapter 17. Quality of Service Routing -- 17.1 Background -- 17.2 QoS Attributes -- 17.3 Adapting Shortest Path and Widest Path Routing: A Basic Framework -- 17.4 Update Frequency, Information Inaccuracy, and Impact on Routing -- 17.5 Lessons from Dynamic Call Routing in the Telephone Network -- 17.6 Heterogeneous Service, Single-Link Case -- 17.7 A General Framework for Source-Based QoS Routing with Path Caching -- 17.8 Routing Protocols for QoS Routing -- 17.9 Summary -- Further Lookup -- Exercises -- Chapter 18. MPLS and GMPLS -- 18.1 Background -- 18.2 Traffic Engineering Extension to Routing Protocols -- 18.3 Multiprotocol Label Switching -- 18.4 Generalized MPLS -- 18.5 MPLS Virtual Private Networks -- 18.6 Summary -- Further Lookup -- Exercises -- Chapter 19. Routing and Traffic Engineering with MPLS -- 19.1 Traffic Engineering of IP/MPLS Networks -- 19.2 VPN Traffic Engineering -- 19.3 Routing/Traffic Engineering for Voice Over MPLS -- 19.4 Summary -- Further Lookup -- Exercises -- Chapter 20. VoIP Routing: Interoperability Through IP and PSTN -- 20.1 Background -- 20.2 PSTN Call Routing Using the Internet -- 20.3 PSTN Call Routing: Managed IP Approach -- 20.4 IP-PSTN Interworking for VoIP -- 20.5 IP Multimedia Subsystem -- 20.6 Multiple Heterogeneous Providers Environment -- 20.7 All-IP Environment of VoIP Services -- 20.8 Addressing Revisited -- 20.9 Summary -- Further Lookup -- Exercises -- Appendix A: Notations, Conventions, and Symbols -- A.1 On Notations and Conventions -- A.2 Symbols -- Appendix B: Miscellaneous Topics -- B.1 Functions: Logarithm and Modulo -- B.2 Fixed-Point Equation -- B.3 Computational Complexity -- B.4 Equivalence Classes -- B.5 Using CPLEX -- B.6 Exponential Weighted Moving Average -- B.7 Nonlinear Regression Fit
  • Exercises -- Part II: Routing in IP Networks -- Chapter 5. IP Routing and Distance Vector Protocol Family -- 5.1 Routers, Networks, and Routing Information: Some Basics -- 5.2 Static Routes -- 5.3 Routing Information Protocol, Version 1 (RIPv1) -- 5.4 Routing Information Protocol, Version 2 (RIPv2) -- 5.5 Interior Gateway Routing Protocol (IGRP) -- 5.6 Enhanced Interior Gateway Routing Protocol (EIGRP) -- 5.7 Route Redistribution -- 5.8 Summary -- Further Lookup -- Exercises -- Chapter 6. OSPF and Integrated IS-IS -- 6.1 From a Protocol Family to an Instance of a Protocol -- 6.2 OSPF: Protocol Features -- 6.3 OSPF Packet Format -- 6.4 Examples of Router LSAs and Network LSAs -- 6.5 Integrated IS-IS -- 6.6 Similarities and Differences Between IS-IS and OSPF -- 6.7 Summary -- Further Lookup -- Exercises -- Chapter 7. IP Traffic Engineering -- 7.1 Traffic, Stochasticity, Delay, and Utilization -- 7.2 Applications' View -- 7.3 Traffic Engineering: An Architectural Framework -- 7.4 Traffic Engineering: A Four-Node Illustration -- 7.5 Link Weight Determination Problem: Preliminary Discussion -- 7.6 Duality of the MCNF Problem -- 7.7 Illustration of Link Weight Determination Through Duality -- 7.8 Link Weight Determination: Large Networks -- 7.9 Summary -- Further Lookup -- Exercises -- Chapter 8. BGP -- 8.1 BGP: A Brief Overview -- 8.2 BGP: Basic Terminology -- 8.3 BGP Operations -- 8.4 BGP Configuration Initialization -- 8.5 Two Faces of BGP: External BGP and Internal BGP -- 8.6 Path Attributes -- 8.7 BGP Decision Process -- 8.8 Internal BGP Scalability -- 8.9 Route Flap Dampening -- 8.10 BGP Additional Features -- 8.11 Finite State Machine of a BGP Connection -- 8.12 Protocol Message Format -- 8.13 Summary -- Further Lookup -- Exercises -- Chapter 9. Internet Routing Architectures -- 9.1 Internet Routing Evolution
  • B.8 Computing Probability of Path Blocking or Loss
  • 9.2 Addressing and Routing: Illustrations -- 9.3 Current Architectural View of the Internet -- 9.4 Allocation of IP Prefixes and AS Number -- 9.5 Policy-Based Routing -- 9.6 Point of Presence -- 9.7 Traffic Engineering Implications -- 9.8 Internet Routing Instability -- 9.9 Summary -- Further Lookup -- Exercises -- Part III: Routing in the PSTN -- Chapter 10. Hierarchical and Dynamic Call Routing in the Telephone Network -- 10.1 Hierarchical Routing -- 10.2 The Road to Dynamic Routing -- 10.3 Dynamic Nonhierarchical Routing -- 10.4 Dynamically Controlled Routing -- 10.5 Dynamic Alternate Routing -- 10.6 Real-Time Network Routing -- 10.7 Classification of Dynamic Call Routing Schemes -- 10.8 Maximum Allowable Residual Capacity Routing -- 10.9 Dynamic Routing and Its Relation to Other Routing -- 10.10 Summary -- Further Lookup -- Exercises -- Chapter 11. Traffic Engineering in the Voice Telephone Network -- 11.1 Why Traffic Engineering? -- 11.2 Traffic Load and Blocking -- 11.3 Grade-of-Service and Trunk Occupancy -- 11.4 Centi-Call Seconds and Determining Offered Load -- 11.5 Economic CCS Method -- 11.6 Network Controls for Traffic Engineering -- 11.7 State-Dependent Call Routing -- 11.8 Analysis of Dynamic Routing -- 11.9 Summary -- Further Lookup -- Exercises -- Chapter 12. SS7: Signaling Network for Telephony -- 12.1 Why SS7? -- 12.2 SS7 Network Topology -- 12.3 Routing in the SS7 Network -- 12.4 Point Codes: Addressing in SS7 -- 12.5 Point Code Usage -- 12.6 SS7 Protocol Stack -- 12.7 SS7 Network Management -- 12.8 ISUP and Call Processing -- 12.9 ISUP Messages and Trunk Management -- 12.10 ISUP Messages and Dynamic Call Routing -- 12.11 Transaction Services -- 12.12 SS7 Link Traffic Engineering -- 12.13 Summary -- Further Lookup -- Exercises -- Chapter 13. Public Switched Telephone Network: Architecture and Routing