This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.02 Spring 2008 Homework #11 May 2, 2008 This problem set has four questions, some with multiple parts. Answer them as clearly and concisely as possible. Turn in your solutions during class on May 9, 2008 . 1 Routing Implementation Details A. In a link-state routing protocol, each node sends a HELLO message to all its neighbors every HELLO INTERVAL seconds. Why shouldnt a node remove the entry for a neighbor (link) from its local link state if it doesnt hear from that neighbor within HELLO INTERVAL of the last HELLO message? B. Why do network gurus generally recommend that distance vector routing protocols not be used on networks with large diameter? 2 Routing Protocol Bandwidth Anette Worker wants to compare the bandwidth consumed by distance vector routing advertise- ments and link-state advertisements in her network, which has has n nodes and m links. Each node address is 4 bytes long and each cost is a 2-byte integer. Each advertisement (in both distanceaddress is 4 bytes long and each cost is a 2-byte integer....
View Full Document