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

Tcp-ip routing architecture, Q. Explain TCP-IP Routing Architecture? ...

Q. Explain TCP-IP Routing Architecture? The TCP/IP routing architecture looks extremely much like the OSI routing architecture. Hosts utilize a discovery protocol to o

Source port number - transport layer, Source Port Number This fields o...

Source Port Number This fields occupies  the first 16 bytes of the UDP header. This  fields typically hold the UDP port number  of the application sending  this datagram. The

Combinational circuit for sorting the string, Every input line of the combi...

Every input line of the combinational circuit represents an individual element of the string say xi and every output line results in the form of a sorted list. In order to attain t

Why we use numbering frames, Q. Why we use numbering frames? Why numbe...

Q. Why we use numbering frames? Why numbering frames? Stop--and-wait ARQ, 1. Numbering Frames prevents the retaining of duplicate frames.. 2. Numbered acknowled

Command structure in distributed enrollment protocol , Command Structure: ...

Command Structure: Commands are all-upper-case strings, either 4 or 6 characters in length. Table 1 shows the commands, and (for method commands) the parameters, return values, ex

Give the solutions to the threats, Give the solutions to the threats In...

Give the solutions to the threats In order to implement solutions to the threats, it is advisable that the company should maintain proper password protected hardware. Wherever

Determine the relation between storage size and genomes, Genome4U is a scie...

Genome4U is a scientific research project at a large university in the United States. Genome4U has recently started a large-scale project to sequence the genomes of 250,000 volun

Difference between unicast and anycast, Difference between Unicast and Anyc...

Difference between Unicast and Anycast Unicast: An identifier for a single interface. A packet sent to a unicast address is delivered to the interface identified by that addres

Security, .test a number to be prime number in network security

.test a number to be prime number in network security

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