Suppose the network implements a Link-state routing protocol between routers using a link cost factor related to
Fantastic news! We've Found the answer you've been seeking!
Question:
- Suppose the network implements a Link-state routing protocol between routers using a link cost factor related to the inverse of the link bandwidth (1/R) between each pair of routers. Apply Dijkstra algorithm to calculate the shortest paths from router R1 to each of the following destinations: Subnet1, Subnet 2, Subnet3 and the Internet.
- Suppose the network uses all possible routes (and not just the shortest path) to forward traffic between a source and a destination. What is the maximum combined traffic flow from all three user subnets (Subnet1, Subnet2 and Subnet3) to the Internet if 100% link utilization is possible?
- Suppose we set up a static route from R1 to R5 that goes through R1-R3-R5 (bypassing OSPF). Assume that the links R1-R3 and R3-R5 are each 200 Kilometers long and the speed of light in the medium is 2×108 meters/second. R1 is sending 1000-bit messages to R5. Ignore processing and queuing delays. Suppose Stop-and-Wait flow control algorithm is implemented between routers; i.e. each router waits for an acknowledgment for its packet from the next router before sending the next packet. Calculate the overall throughput between R1 and R5.
Related Book For
Accounting for Decision Making and Control
ISBN: 978-1259564550
9th edition
Authors: Jerold Zimmerman
Posted Date: