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

Explain semantic web , What the Semantic Web is? Ans) The Semantic Web ...

What the Semantic Web is? Ans) The Semantic Web is a vision, that thinks to join together dispersed bits of data on the internet, very much like web pages are presently joined

Source independence, Next hop to receiver does not relay on source of packe...

Next hop to receiver does not relay on source of packet. This phenomenon is known 'Source Independence'. It has various benefits. It gives efficient and fast routing. Packet switch

Explain dynamic domain name system, Q. Explain Dynamic Domain Name System? ...

Q. Explain Dynamic Domain Name System? DDNS - Dynamic Domain Name System automatically updates the DNS master file - Sent by DHCP to a primary DNS server; secondary se

Stop service advertisements from flooding a network, To stop Service Adver...

To stop Service Advertisements (SAPs) from flooding a network, Cisco routers do not forward them. How are services advertised to other networks? Ans) Every router builds its own

Analyze snort or pcap data from a public wifi hotspot, The project idea is ...

The project idea is : Analyze Snort or PCAP data from a public WIFI hotspot (describe traffice seen and what it is, protocols, ports, etc). This is what is expected. Initially r

What is the effect on the security of the password, Question: (a) What...

Question: (a) What is a script kiddie? Is it a significant security threat, and why? (b) Assume that UNIX uses the user login name in lieu of the traditional salt, what is

Line layer - sonet sdh , Line Layer The line layer provides the synchr...

Line Layer The line layer provides the synchronization multiplexer, multiplexing and automatic  protection switching for the layer . primary  concerned with the  reliable trans

TRAFFIC CONGESTION, Can I get help for data analysis on traffic congestion ...

Can I get help for data analysis on traffic congestion using GIS

Chord, how to implement chord connection as the network management system ?...

how to implement chord connection as the network management system ?

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