Section B (Design Works)Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network.a. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.Iteration0 1 2 3 4 5 6 7 8 9Nodes[6][6,3][6,3,2] [6,3,2,1] [6,3,2,1,4] [6,3,2,1,4,5] [6,3,2,1,4,5,7] [6,3,2,1,4,5,7,8] [6,3,2,1,4,5,7,8,9] [6,3,2,1,4,5,7,8,9,10]R1 R2 R3 R4 R5 R7 R8 R9 R10–...2/3b. Build/Sketch the new Dijkstra Shortest Path Tree.c. Tabulate a Distance Vector Routing Table with the following headings; Destination, Route, Least Cost and Next Hop using the table below.DestinationCustomer 1 Customer 2 Customer 3 Customer 4 Customer 5 Customer 7 Customer 8 Customer 9 Customer 10RouteLeast CostNext Hop–...3/3 l GH Vodafone 3G9:28 AM@ 75%Done CICS-202_DataComll -BIT May20...Section B (Design Works)Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected toRouter 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path forCustomer 6 to transmit packets to every other Customer/Destination connected to the rest of theRouters on the network.R5R8R6R1R9R10R4R78a. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.IterationNodesR1 R2 R3 R4 R5 R7 R8 R9 R10[6][6,3][6,3,2][6,3,2,1][6,3,2,1,4][6,3,2,1,4,5][6,3,2,1,4,5,7][6,3,2,1,4,5,7,8][6,3,2,1,4,5,7,8,9][6,3,2,1,4,5,7,8,9,10]|123456.78.9....2/3!! l GH Vodafone 3G9:28 AM@ 74%Done CICS-202_DataComll -BIT May20...-...2/3b. Build/Sketch the new Dijkstra Shortest Path Tree.c. Tabulate a Distance Vector Routing Table with the following headings; Destination, Route, Least Costand Next Hop using the table below.DestinationRouteLeast CostNext HopCustomer 1Customer 2Customer 3Customer 4Customer 5Customer 7Customer 8Customer 9Customer 10-...3/3

Actually, algorithm is an step by step process.

Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. a. Tabulate the executed iteration for the Dijkstra Algorithm using the table below. Iteration 0 1 2 3 4 5 6 7 8 9 Nodes [6] [6,3] [6,3,2] [6,3,2,1] [6,3,2,1,4] [6,3,2,1,4,5] [6,3,2,1,4,5,7] [6,3,2,1,4,5,7,8] [6,3,2,1,4,5,7,8,9] [6,3,2,1,4,5,7,8,9,10] R1 R2 R3 R4 R5 R7 R8 R9 R10 –...2/3 b. Build/Sketch the new Dijkstra Shortest Path Tree. c. Tabulate a Distance Vector Routing Table with the following headings; Destination, Route, Least Cost and Next Hop using the table below. Destination Customer 1 Customer 2 Customer 3 Customer 4 Customer 5 Customer 7 Customer 8 Customer 9 Customer 10 Route Least Cost Next Hop

Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. a. Tabulate the executed iteration for the Dijkstra Algorithm using the table below. Iteration 0 1 2 3 4 5 6 7 8 9 Nodes [6] [6,3] [6,3,2] [6,3,2,1] [6,3,2,1,4] [6,3,2,1,4,5] [6,3,2,1,4,5,7] [6,3,2,1,4,5,7,8] [6,3,2,1,4,5,7,8,9] [6,3,2,1,4,5,7,8,9,10] R1 R2 R3 R4 R5 R7 R8 R9 R10 –...2/3 b. Build/Sketch the new Dijkstra Shortest Path Tree. c. Tabulate a Distance Vector Routing Table with the following headings; Destination, Route, Least Cost and Next Hop using the table below. Destination Customer 1 Customer 2 Customer 3 Customer 4 Customer 5 Customer 7 Customer 8 Customer 9 Customer 10 Route Least Cost Next Hop

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 8P

See similar textbooks

Similar questions

1. Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. (a) i. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.                                                                                                                                                            Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…
Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.                                                                                                                                                            Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…
Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.                                                                                                                                                            Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…
Networking Draw a graph for TCP congestion control for both a) TCP Tahoe b) TCP Reno based on the following information. Also show SS, AI and MD phases on the graph. At round 1 CWND =1 MSS, Initial ssthresh =Infinity Timeout = At round 7 3 Duplicate ACK = At round 15 3 Duplicate ACK = At round 22 Add X round after 22, X=9 Give Complete Answer of this Question.
Please dont copy your answer from other sourses i.e chegg A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits. For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using: i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing.
Suppose that 6 routers (u, v, w, x, y and z) are connected as follows with the cost of each link shown next to it. a)Use Dijkstra’s algorithm to compute the least cost paths from Router u to all other routers in the network. b) Construct the shortest-path tree from Router u to all other routers from your solution in Part a. c) Find the routing table of Router u from your solution in Part b.
Assume that the network in Figure 20.34 uses distance-vector routing with the forwarding table as shown for each node. If each node periodically announces their vectors to the neighbor using the poison-reverse strategy, what is the distance vector advertised in the appropriate period: a. from A to B? b. from C to D? c. from D to B? d. from C to A?
This elementary problem begins to explore propagation delay and transmission delay, two central concepts in data networking. Consider two hosts, A and B, connected by a single link of rate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagation speed along the link is s meters/sec. Host A is to send a packet of size L bits to Host B. a. Express the propagation delay, dprop, in terms of m and s.b. Determine the transmission time of the packet, dtrans, in terms of L and R.c. Ignoring processing and queuing delays, obtain an expression for the end-to-end delay.d. Suppose Host A begins to transmit the packet at time t = 0. At time t = dtrans, where is the last bit of the packet?e. Suppose dprop is greater than dtrans. At time t = dtrans, where is the first bit of the packet?f. Suppose dprop is less than dtrans. At time t = dtrans, where is the first bit of the packet?g. Suppose s = 2.5 * 108 meters/sec, L = 120 bits, and R = 0.112 Mbps. Find the distance m…
Q4: Draw a graph for TCP congestion control for both a) TCP Tahoe b) TCP Reno based on the following information. Also show SS, AI and MD phases on the graph. At round 1 CWND =1 MSS Initial ssthresh =Infinity Timeout = At round 7 3 Duplicate ACK = At round 15 3 Duplicate ACK = At round 22 Add X round after 22, where X is 1
In a two-phase, total-order multicast system, messages are sent in the following sequence from node S to G1 and G2. G1 and G2 are the members of the group. S sends m1 to G1 S sends m1 to G2 S sends m2 to G2 S sends m2 to G1 Use the basic implementation of the Lamport clock. The clock s at each node start at: S: 4, G1: 6, G2: 1. Show the exchange of messages and their acknowledgments in a clock diagram using the basic implementation of Lamport's clock. In which order and at what times are m1 and m2 delivered?
DONT COPY FROM CHEGG!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits. For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using:i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing
Copy from chegg == Report! A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits. For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using: i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing