Share E-Book
Scan to open this page

Scan with your phone to open this page

Author: Ravi Malhotra

Rating No ratings yet

As a delivery vehicle for email, web pages, text, audio, and video, the global IP network is inspiring and intimidating in its vigor and resilience. While we could discuss at length the reasons for its vigor, the resilience of this network is in large part due to IP routing. This book introduces the reader to the intricacies of IP routing as it is implemented using Cisco routers. Each section leads the reader through the basics of configuring routing protocols. This approach gives the reader a quick start with the routing protocol under discussion and reveals the underlying concepts of IP routing. What is the packet-forwarding process? How is the routing table maintained? How do Distance Vector algorithms work? How do classful and classless route lookups differ? These and other concepts are illustrated in the discussions of static routing, RIP, IGRP, and EIGRP. The limitations of these traditional routing protocols will also become obvious to the reader.Variable Length Subnet Masks, route summarization, and fast convergence are key features in the design of any large IP network. These features are discussed in the OSPF chapter, which includes an introduction to Dijkstra's algorithm, the foundation for Link State protocols. Finally, BGP-4 is described in detail, showing the reader how to use BGP-4 attributes to set routing policies. This book is intended for anyone interested in IP routing. While it is appropriate for a beginner, it will also be useful for anyone already familiar with IP routing who is seeking a better understanding of the underlying concepts.

AI Reading Assistant

Whole-book reading guide from stratified index samples; jump to passages in the text

AI guide
【One-Line Pitch】 A hands-on introduction to IP routing on Cisco routers that pairs configuration drills with the underlying theory, so beginners can get protocols running quickly while experienced readers fill in the "why" behind the commands. Best for network engineers, certification candidates, and anyone who wants a conceptual grasp of how routing tables, distance-vector protocols, and BGP-4 actually behave. 【Book Arc】 - **Opening (~0%–10%)**: Frames the global IP network's resilience as a routing problem and sets up the book's teaching method — configure first, then unpack the concepts behind packet forwarding, routing-table maintenance, and route lookups. - **Early (~10%–30%)**: Builds the foundation with directly connected and static routes, then walks through RIP configuration on a multi-site case network, covering update packets, timers, convergence, split horizon, and the counting-to-infinity problem. - **Early–Middle (~30%–45%)**: Moves to IGRP, showing how autonomous systems partition a network and how a composite metric (bandwidth, delay, reliability, load, MTU) is computed and tuned — plus why tweaking those weights can destabilize routes. - **Middle (~45%–60%)**: Introduces EIGRP and the limits of traditional distance-vector protocols, setting up the shift toward link-state design. - **Late (~60%–85%)**: Covers OSPF, including Dijkstra's algorithm as the basis for link-state routing, plus Variable Length Subnet Masks, route summarization, and fast convergence for large IP networks. - **Ending (~85%–100%)**: Details BGP-4 and how its attributes are used to set routing policy between domains. 【Key Takeaways】 - **Routing tables are built from multiple sources** (Early): connected, static, and protocol-learned routes each carry a code (C, S, I, O, etc.) that tells you where a route came from — the first thing to read when troubleshooting. - **Classful protocols hide the subnet mask** (Early): RIP and IGRP updates carry no mask field, so the router must infer masks from interface configuration; this limitation is the root of many design constraints. - **Distance-vector convergence is fragile** (Early): split horizon and hold-down timers patch loops like counting-to-infinity, but they are workarounds, not fixes — understanding them explains why traditional protocols scale poorly. - **Metrics encode design assumptions** (Middle): RIP's hop count suits small homogeneous networks; IGRP's composite metric can include load and reliability, but weighting load can make routes oscillate between paths. - **Autonomous systems are a scaling tool with trade-offs** (Middle): splitting a network into AS domains limits failure propagation but eventually forces redistribution or static routes between domains. - **Link-state routing changes the game** (Late): OSPF's use of Dijkstra's algorithm, VLSM, summarization, and fast convergence addresses the core weaknesses of distance-vector protocols in large networks. - **BGP-4 is about policy, not just reachability** (Ending): its attributes let operators deliberately influence path selection between domains rather than simply picking the shortest path. 【Reading Tips】 - **Deep-read the RIP and IGRP chapters** — the timers, split horizon, and metric math are the conceptual backbone that later chapters assume. - **Skim the configuration listings on a first pass**, then return to them with a lab or simulator; the book's value is in connecting commands to behavior. - **Treat the case network (NewYork/Chicago/Ames and the African sites) as a running example** — track how the same topology is reconfigured for each protocol. - **Pause on the OSPF chapter's Dijkstra explanation** even if you only care about configuration; it is the pivot from traditional to modern routing. - **For BGP-4, focus on attribute semantics and policy examples** rather than memorizing every attribute. 【Coverage Limits】 The excerpts are heavily weighted toward the opening, RIP, and IGRP material; EIGRP, OSPF, and BGP-4 are represented mainly by the book's own preface and chapter transitions, so this guide's later-stage descriptions rely on the author's stated scope rather than detailed excerpted content.
Page 5
cial houses, and written several maga- zine assignments. Mr. Malhotra possesses degrees in Electrical Engineering and Computer Science. Colophon Our look is...
View in text
Excerpt 2
55.0 router rip network 172.16.0.0 hostname Chicago interface Ethernet0 ip address 172.16.50.1 255.255.255.0 ! interface Serial0 ip address 172.16.250.2 255....
View in text
Excerpt 3
would the router associate subnet masks with these routes? • If the router has an interface on a network number received in an update, it would associate the...
View in text
Excerpt 4
mputed as a five-minute exponentially weighted average) the metric for the path through P may become larger than the metric for an alternative path through r...
View in text
Excerpt 5
via 172.16.245.1, 00:00:26, Serial0 Note that network 10.0.0.0 has been flagged as a default route (*). To ensure that the default route works, let’s do a te...
View in text
Excerpt 6
d, Serial0 D 172.16.250.0 [90/2681856] via 172.16.252.1, 00:21:10, Serial0 C 172.16.251.0 is directly connected, Serial1 11 D 172.16.50.0 [90/2195456] via 17...
View in text
Excerpt 7
e of routing tables and the complexity of the network. Dis- abling route summarization should be undertaken only when necessary. Manual Summarization EIGRP a...
View in text
Excerpt 8
stening to RIP-2 from the task of unwrapping RIP-2 updates. The fields AFI, IP address, and metric have the same semantics as in a RIP-1 update packet. See C...
View in text
Tags
AI categories
BackendTechnology
ISBN: 0596002750
Publisher: O'Reilly
Publish Year: 2002
Language: English
Pages: 234
File Format: PDF
File Size: 6.3 MB
Text Preview (First 20 pages)
Registered users can read the full content for free

Register as a Gaohf Library member to read the complete e-book online for free and enjoy a better reading experience.

Generating text preview…