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

Network analyzers, NETWORK ANALYZERS: A network analyzer also known ne...

NETWORK ANALYZERS: A network analyzer also known network monitor or a network sniffer is used to calculate the performance of or debug a network. It may report statistics s

Compute shortest path, Compute the shortest path from t to all network node...

Compute the shortest path from t to all network nodes.

What is beaconing, What is Beaconing? The process that permits a networ...

What is Beaconing? The process that permits a network to self-repair networks problems. The stations on the network notify the other stations on the ring when they are not rece

Developing prototypes - digital receipts, Increasingly it is the quality of...

Increasingly it is the quality of the interface of mobile phones that are giving competitors the edge.  Users not only make selections based on cost but also functionality and cert

Type of failures and bathtub curve, AILURES AND BATHTUB CURVE The life ...

AILURES AND BATHTUB CURVE The life of a component system can be grouped into three different phases typical curve depicting these three is called the bathtub curve due to its s

What to do to connection with external communication, What to do to connect...

What to do to connection with external communication For dealing with external communication, the Web server must have a static IP. Having a static IP could also be a problemat

Explain monitor stations of token passing, Monitor Stations Lost t...

Monitor Stations Lost tokens - timer is issued each time a frame or token is generated If no frame is received in time period new token is generated by a monitor stat

Troubleshooting vtp configuration -ccna, Prepare the Network Step 1: Ca...

Prepare the Network Step 1: Cable a network that is similar to the one in the topology diagram.  You can use any current switch in your lab as long as it has the needed inte

Cost saving - application layer, Cost Saving Better performance  scala...

Cost Saving Better performance  scalability  and viability  translates into  saving  for  website  operators.  Because  fewer  application  web servers are required  to meet

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