A 5 2 3 E F 7. Consider the network from the problem running distance-vector routing has already achieved convergence. At some time link B-C fails. a) Give the routing tables at A and D after B and C have reported the news. b) Give the routing tables at A and D after their next mutual exchange.

A 5 2 3 E F 7. Consider the network from the problem running distance-vector routing has already achieved convergence. At some time link B-C fails. a) Give the routing tables at A and D after B and C have reported the news. b) Give the routing tables at A and D after their next mutual exchange.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

(a) Consider the following network with the indicated link costs. Use Dijkstra's algorithm to determine the forwarding table for the given node which implements the shortest path routing. Given node: f 2 a 4 8 d 11 b 8 1 6 4 7 h 2 14 9 g 10
In the figure above Q3, if the routers agree to use the OSPF protocol (a link state method) to build their routing tables. Routers start flooding LSAs which to help each other in building a complete graph structure for the network. At one time during the flooding, router E has thefollowing information in its LSDB: If router E got the following LSA from router F, answer the following: A - How would the LSDB of router E looks like after completing the OSPF process?
DP
5 B TC 2 A 3 3 E F 7. Consider the network from the previous problem running distance-vector routing has already achieved convergence. At some time link B-C fails. a) Give the routing tables at A and D after B and C have reported the news. b) Give the routing tables at A and D after their next mutual exchange.
P7. Examine the network fragment below. w and y are x's only neighbours. W's minimum-cost route to u (not illustrated) is 5, while y's is 6. The pathways from w and y to u and between them are not indicated. All network link costs are positive integers. 2, Give x's distance vector to w, y, and u.
Consider the 6-node network shown below, with the given link costs. Using Dijkstra's algorithm, find the least cost path from source node u to all other destinations. Fill in the following table using the convention shown the text. I am having trouble identifying the D(u), p(u) of this table. Could you help me, please?
4. a) Consider designing an ATM network with a leaky-bucket policer that ensures a virtual circuit does not send more cells than expected. Suppose a link has a first-in-first-out (FIFO) queue and carries traffic for two virtual circuits. The traffic on the first virtual circuit follows a leaky- bucket policer (with a bucket depth of 9 cells and a token rate of 100 cells/second) and can settle for best-effort service. The traffic on the second virtual circuit follows a leaky-bucket policer (with a bucket depth of one cell and a token rate of 100 cells/second) that cannot tolerate more than 100 milliseconds of delay in delivering each cell. Suppose the propagation delay on the link is 50 milliseconds. Analyse the smallest transmission rate R, in cells per second, that can satisfy the delay constraint, given that the link serves cells in FIFO order.
3. Compute a minimum cost multicast tree for router F in the network of Fig 2 (take the associated weights of the links into account for this problem) for a group with members at routers A, B, and E. A 4 5 B 2 6 C E 8 F 3 7 D
One of the following is consider an advantage of static routing. No intervention is required to maintain changing route information Configuration of static route is error-free O The path a static route uses to send data is known Static routes scale well as the network grows
4 8 10 2 2 F 4 1 If you apply Link state routing algorithm at Node A, and the algorithm steps are applied in the following order A, B, C, D, E, F. What is the routing cost from A to F, after including nodes A, B, C?
Distance-Vector and link state are two popular algorithms that have been implemented by RIP and OSPF for intra-domain routing. Summarize the differences between the two approaches.
Suppose a routing algorithm identifies paths that are “best” in the sense that: (1) minimum number ofhops, (2) minimum delay, or (3) maximum available bandwidth. Identify conditions under which the pathsproduced by the different criteria are the same? are different?