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

Advantages of mobile wireless network, Advantages of mobile wireless networ...

Advantages of mobile wireless network over a wired network is it is very much popular, it is very easy to set up, it requires a simple plug and the speed and reliability is very

What is telnet, What is Telnet It is a protocol or set of rules that us...

What is Telnet It is a protocol or set of rules that uses to connect one computer to another computer in network. It is also called as a remote login. The telnet operates on cl

General middleware in client server environment, What is General Middleware...

What is General Middleware in client server environment? Ans) It having the communication stacks, distributed directories, authentication services, network time, RPC, Queuing se

TRAFFIC CONGESTION ASSESSMENT, Can I get help for traffic congestion anlysi...

Can I get help for traffic congestion anlysis using GIS

What layer can optionally support reliability, Ans) The Transport Layer : ...

Ans) The Transport Layer : Segments upper-layer applications. Establishes an end-to-end connection. Sends segments from one end host to another. Optionally, make sures

Explain cross bar interconnection networks, Cross Bar : The crossbar networ...

Cross Bar : The crossbar network is simplest interconnection network. It has a double dimensional grid of switches.  It's a Non-blocking network and offers connectivity between out

Routing table - network layer and routing , Routing Table Each  router ...

Routing Table Each  router now  uses the  shortest path tree to construct its routing table . each  router  uses the same algorithm and the same link state  database its own sh

Overview of the various network topologies, QUESTION Write a report to ...

QUESTION Write a report to explain the concept of LAN and WAN including the various components of the telecommunication infrastructure required by UTM Ltd. You are required to

Multiplexing assignment help, What is multiplexing and demultiplexing? Expl...

What is multiplexing and demultiplexing? Explain. Describe Time division, Frequency division and Wavelength division multiplexing. What is ADSL? How does it use multiplexi

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