Computing shortest path in a graph, Computer Networking

Assignment Help:

While calculating shortest path, first we assume graph presentation of network at every node then we use Djikstra's algorithm to calculate shortest path from every node to other one. Then extract next hop information from giving path information and add next hop information into routing tables.

WEIGHTED GRAPH

Djikstra's algorithm will add weights on edges in graph. The shortest path is then the path with minimum total weight. It could be noticed that the shortest path is not necessarily with fewest edges. For example as given in the figure below:

2244_weighted graph.png

The minimum path in the diagram from node 2 to node 6 is 2 to 3 and 3 to 6 as this way has the minimum weight so it is the shortest path.

DISTANCE MATRICS

Weights on graph nodes denote cost of traversing edge. This cost can be in time, hop or dollars counting (weight == 1). The resulting shortest path can not have fewest hops.


Related Discussions:- Computing shortest path in a graph

Configure the logical topology - configure router1, Configure Router1. ...

Configure Router1. From Host1, connect to the console of Router 1 and establish a console session. Directions for creating a console connection using HyperTerminal are in Appen

What is source route and ospf, What is source route and OSPF? Source r...

What is source route and OSPF? Source route It is a series of IP addresses identifying the route a datagram must follow. A source route might optionally be included in an

Running netware 4.11 and you cant commune with your router, You are a syst...

You are a system administrator on a NetWare network, you are running  NetWare 4.11 and you cannot commune with your router. What do think what problem is? Ans)NetWare 4.11 defau

Prepare network schema of a company, Your Case Study must be based on the i...

Your Case Study must be based on the information provided. There will be no additional information. This must be submitted in a .doc, or .pdf format. If you send a few paragraphs i

Comparing transport for tcp/ip and osi model, Q. Comparing Transport for TC...

Q. Comparing Transport for TCP/IP and osi model? - The features of TCP and UDP defined at TCP/IP Transport Layer correspond to many of the requirements of the OSI Transport Lay

Well known internet applications that uses tcp connection, a)  Which of the...

a)  Which of the well-known Internet applications uses a separate TCP connection for control?   b)  The separate control connection as in (a) above is an example of control (sig

Performance metrics of networks, The performance of interconnection network...

The performance of interconnection networks is measured on the below parameters.  1) Bandwidth: It determines maximum transfer rate between any two nodes.  It is measured in MB

Input port - network layer and routing , Input Port The input  ports ...

Input Port The input  ports line  termination functions  and data link processing implement  the physical  and data  link layer  associated with an individual input  link to

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd