Can I read Circuit-Switching: Hierarchical and Dynamic Call Routing on EtoBox?

Circuit-Switching: Hierarchical and Dynamic Call Routing by Medhi, Deep, Ramasamy, Karthik is a scholarly article available to read on EtoBox.

What is Circuit-Switching: Hierarchical and Dynamic Call Routing about?

2.8 Shortest Widest Path and Widest Shortest Path -- 2.9 Tree, Spanning Tree, and Steiner Tree Algorithms -- 2.9.1 Spanning Tree: Breadth First Search and Depth First Search -- 2.9.2 Minimum Spanning Tree -- 2.9.3 Steiner Tree -- 2.10 k-Shortest Paths Algorithm -- 2.11 Summary -- Further Lookup -- Exercises -- 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.3.1 Conceptual Framework and Illustration -- 3.3.2 Why Timers Matter -- 3.3.3 Solutions -- 3.3.4 Can We Avoid Loops? -- 3.3.5 Distance Vector Protocol based on Diffusing Computation with Coordinated Updates (DUAL) -- 3.3.6 Babel Routing Protocol -- 3.4 Link State Routing Protocol -- 3.4.1 Link State Protocol: In-Band Hop-by-Hop Dissemination -- 3.4.2 Link State Protocol: In-Band Based on End-to-End Session -- 3.4.3 Route Computation -- 3.5 Path Vector Routing Protocol -- 3.5.1 Basic Principle -- 3.5.2 Path Vector with Path Caching -- 3.6 Link Cost -- 3.6.1 ARPANET Routing Metrics -- 3.6.2 Other Metrics -- 3.7 Threats to Routing Protocols -- 3.8 Summary -- Further

Author

Medhi, Deep, Ramasamy, Karthik

Publisher

Elsevier Science & Technology Books

Published

2018

Language

EN

ISBN

9780128007372