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

Determine the characteristics of thicknet, Thicknet Characteristics ...

Thicknet Characteristics It Supports transmission rates up to 10 Mbps in Baseband mode Less expensive in comparison of fiber-optic cable however more expensive than ot

What is an ethernet, What is an Ethernet? The Ethernet topology was dev...

What is an Ethernet? The Ethernet topology was developed at the University of Hawaii to connect computers on the many Islands. It was radio based design. Later, Robert Metacalf

Define the microcells- routing and switching, Microcells As cells becom...

Microcells As cells become smaller, antennas move from the tops of tall buildings or hills, to the tops of small buildings or the sides of large buildings, and finally to lamp

Determine the objectives of computer security, Determine the Objectives of ...

Determine the Objectives of computer security Though computerisation helps a lot in proper organisation of experience, it also opens a Pandora's Box simultaneously. On one

Metropolitan area network ( man)- fundamentals of networks , Normal 0 ...

Normal 0 false false false EN-IN X-NONE X-NONE Metropolitan area Network ( MAN) Metropoli

Network control protocols ncp, Network  Control  protocols ( NCP) Th...

Network  Control  protocols ( NCP) The first  ARPANET  networking protocols  was named  simply the network  control protocols in 1970,and  was created by  created by  network

What is mesh network, What is mesh network? A network in which there ar...

What is mesh network? A network in which there are many network links among computers to provide multiple paths for data to travel.

How big can an intranet be, How big can an Intranet be? An Intranet ca...

How big can an Intranet be? An Intranet can be as big as a community of interest. Scale is an important factor in web implementation, but it has no bearing on the logical asso

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