| Description |
1 online resource (1020 pages) |
| Series |
The Morgan Kaufmann Series in Networking |
|
Morgan Kaufmann series in networking
|
| Contents |
Front Cover; Network Routing; Copyright; Contents; Foreword (1st Edition); Preface (2nd Edition); Acknowledgments; Preface (1st Edition); Audience; Organization and Approach; Bonus Materials and Online Resources; Acknowledgments; About the Authors; Part 1 Routing: Basics and Foundations; 1 Networking and Network Routing: An Introduction; 1.1 Addressing and Internet Service: An Overview; 1.2 Network Routing: An Overview; 1.3 IPv4 Addressing; 1.3.1 Classful IPv4 Addressing Scheme; 1.3.2 Subnetting/Netmask in IPv4; 1.3.3 Classless Inter-Domain Routing (CIDR); 1.4 IPv6 Addressing |
|
1.5 On Architectures1.6 Service Architecture; 1.7 Protocol Stack Architecture; 1.7.1 OSI Reference Model; 1.7.2 IP Protocol Stack Architecture; 1.8 Router Architecture; 1.9 Network Topology Architecture; 1.10 Network Management Architecture; 1.11 Global Telephone Network; 1.12 Communication Technologies; 1.13 Standards Committees; 1.13.1 Internet Engineering Task Force; 1.13.2 International Telecommunication Union; 1.14 Last Two Bits; 1.14.1 Type-Length-Value (TLV); 1.14.2 Network Protocol Analyzer; 1.15 Summary; Further Lookup; Exercises |
|
2 Routing Algorithms: Shortest Path, Widest Path, and Spanning Tree2.1 Background; 2.2 Bellman-Ford Algorithm and the Distance Vector Approach; 2.2.1 Centralized View: Bellman-Ford Algorithm; 2.2.2 Distributed View: A Distance Vector Approach; 2.3 Dijkstra's Algorithm; 2.3.1 Centralized Approach; 2.3.2 Distributed Approach; 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.7.1 Dijkstra-Based Approach |
|
2.7.2 Distance Vector-Based Approach2.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 Matter3.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 Lookup |
| Summary |
Annotation Network Routing: Algorithms, Protocols, and Architectures, Second Edition, explores network routing and how it can be broadly categorized into Internet routing, PSTN routing, and telecommunication transport network routing. The book systematically considers these routing paradigms, as well as their interoperability, discussing how algorithms, protocols, analysis, and operational deployment impact these approaches and addressing both macro-state and micro-state in routing. Readers will learn about the evolution of network routing, the role of IP and E.164 addressing and traffic engineering in routing, the impact on router and switching architectures and their design, deployment of network routing protocols, and lessons learned from implementation and operational experience. Numerous real-world examples bring the material alive. Extensive coverage of routing in the Internet, from protocols (such as OSPF, BGP), to traffic engineering, to security issuesA detailed coverage of various router and switch architectures, IP lookup and packet classification methodsA comprehensive treatment of circuit-switched routing and optical network routingNew topics such as software-defined networks, data center networks, multicast routingBridges the gap between theory and practice in routing, including the fine points of implementation and operational experienceAccessible to a wide audience due to its vendor-neutral approach |
| Notes |
Exercises |
|
Print version record |
| Subject |
Routers (Computer networks)
|
|
Computer network architectures.
|
|
Computer networks.
|
|
Computer Communication Networks
|
|
Computer network architectures.
|
|
Computer networks.
|
|
Routers (Computer networks)
|
| Form |
Electronic book
|
| Author |
Ramasamy, Karthik
|
| ISBN |
9780128008294 |
|
0128008296 |
|
