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.RI0R4a. 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]34578 b. 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

Answered: Section B (Design Works) Below is a…

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

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.
COMPUTER CONSTRUCTION QUESTION : The routers in the network depicted by the figure above agree to use distance-vector protocol to build their routing tables. If router A just join the network with routing table only showing the cost to reach its immediate neighbors, how would the table of router A looks like after receiving the following tables in sequence: table of router B then table of router F thentable of router E? (the received tables are shown bellow.)
c) Given graph G=(N,E), where N is the set of routers and E is the set of links. Using Dijkstra's link-state routing algorithm compute the least cost path from node U to all other nodes and show the resulting least-cost-path tree from U. Show all calculations to get full credit. 1 2 3 2 3 3 2 2
Each active interface of Distance vector gets frequent transmissions of the whole routing table that Distance vector maintains. The link status protocol broadcasts information about the state of a router's own connections to all other routers in the network. Each statement has two ideal examples that show how the Link state and the Distance vector may be utilized in a number of circumstances.
11 Using Dijkstra's link-state routing algorithm, calculate routes from node v to all other nodes. 5 3 W- 5 2 1 1 2 -X- 1 Show your work by filling the following table. The 7 rows in the table does not indicate you will finish the calculation in 7 steps, modify the table as needed. NOTE: when there is a tie, i.e., two nodes have the same distance to N’, always use the node that is lower in the alphabetical order. For example, in the first step, D(u) and D(x) are both 2, you will include node u into the new N' because u is lower in the alphabet than x. N' D(u),p(u) D(w),p(w) D(x),p(x) D(y),p(y) D(y),p(y)_D(z),p(z) Step 0 1 6 Fill the following routing table, for each destination node, the outgoing link should be one of (v, u), (v, x), or (v, w). destination outgoing link u X у 2345 WN Z 3 Z

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS