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

Coaxial applications and performance, Coaxial Applications & Performance ...

Coaxial Applications & Performance - Analog plus digital phone networks - Cable TV networks - Traditional Ethernet LANs - Power line and Home Networks-phone line -

Data link layer responsibilities, Q. Data Link Layer Responsibilities? ...

Q. Data Link Layer Responsibilities? - Defines frames into manageable data units - Physical addressing - Flow control - Error control - Access control Nod

What are the bridges, Bridges - Operate in both physical and data link ...

Bridges - Operate in both physical and data link layers - Utilized to divide a network into smaller segments - May as well relay frames between separate LANs - Keeps t

Relevance and protection regarding dns attacks, Relevance and Protection re...

Relevance and Protection regarding DNS Attacks While discussing about the relevance and protection of the database, there are many things which need to consider. Almost, may o

Connection oriented multiplexing and de multiplexing, Connection Oriented M...

Connection Oriented Multiplexing And De multiplexing TCP socket  identified by 4 tuple: a.Source IP address b.Source port number c.Destination IP address d.Destina

Sharing information - network layer and routing , Sharing  information  ...

Sharing  information  To understand  how distance vector routing  works examine the  internet shown in  the  clouds represents local  area network . the  number  inside each c

Iso - organization for standardization, - The ISO (International Organisati...

- The ISO (International Organisation for Standardisation) is an International standards organisation responsible for a wide range of standards including many that are relevant to

Explain repeaters, Repeaters - Operate only in physical layer - Conn...

Repeaters - Operate only in physical layer - Connects two segments of the same LAN - Both segments must be of the same protocol - Only forwards frames; does not filter

Explain linear array interconnection networks, Linear Array: This is a most...

Linear Array: This is a most basic interconnection pattern. Processors are connected in a linear one-dimensional array. The first as well as last processors are attached with one a

My Printer, Cannot print from Computer recently

Cannot print from Computer recently

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