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

What are major types of networks and explain, What are major types of netwo...

What are major types of networks and explain? Server-based network: Give centralized control of network resources and depend on server computers to give security and network

Explain about the intranet hardware and software, Explain about the Intrane...

Explain about the Intranet hardware and software Intranets not only provide a secure environment for companies but also provide an excellent working environment that is full of

R-sat networks for pstn and stm v-sat network, S t d "B" 9 m C-BAND EARTH...

S t d "B" 9 m C-BAND EARTH STATION (2001)   This  Earth  Station  is  aligned  with  INTEL  SAT  IOR  66°  and  provide domestic connectivity. R-Sat (Regional Satellite) i

What is client/server, What is client/server? Client/server is a type o...

What is client/server? Client/server is a type of network wherein one or more computers act as servers. Servers give a centralized repository of resources like printers and fil

Define ike modes, Normal 0 false false false EN-IN X-...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Database management, today, what is the most common or mostly encountered p...

today, what is the most common or mostly encountered problem in terms of database management system?

Subtract two from number of hosts, Why do we require to subtract two from n...

Why do we require to subtract two from number of hosts?

What is medium access control of ethernet, What is Medium Access Control of...

What is Medium Access Control of Ethernet? The set of rules which make sure that each node in an Ethernet gets a fair amount of frame transmission opportunity, are known as the

Cycle of bridges, CYCLE OF BRIDGES:  A bridges network can join severa...

CYCLE OF BRIDGES:  A bridges network can join several segments. One bridge is useded to connect every segment to the rest of the bridge network. This is given in the figure be

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