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

Simple mail transfer protocols (smtp), Simple Mail Transfer Protocols (SMTP...

Simple Mail Transfer Protocols (SMTP) The application  layer  protocols  for electronic  mail is SMTP( Simple mail  transfer protocols). Internet  electronic  mail  has man

Password authentication protocols (pap), Password Authentication Protocols ...

Password Authentication Protocols (PAP) PAP  implements the  traditional username and password  authentication methods. At the  request from  an authenticator the client respon

Overview of the transport layer protocols, Overview of the Transport  Laye...

Overview of the Transport  Layer Protocols Transport layer  can be  available  more than  protocols  to the  network  applications. For  example the network  applications. For

Computing shortest path in a graph, While calculating shortest path, first ...

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 on

Show the drawbacks of go-back-N, Q. Show the Drawbacks of Go-back-N? D...

Q. Show the Drawbacks of Go-back-N? Drawbacks of Go-back- N - Inefficient - Every out of order received packets are discarded (receiver side is simplified) - This

Dns - protocol attacks, DNS - Protocol Attacks Generally, in the DNS p...

DNS - Protocol Attacks Generally, in the DNS protocol, flaws are based on the implementation issues. The three common issues are generally, associated which can be of one of t

Transmission control protocol, Transmission Control Protocol (TCP) TCP ...

Transmission Control Protocol (TCP) TCP makes the Internet reliable. TCP solves several problems which can occur in a packet switching system. TCP provide the given facilities:

Data sharing - fundamentals of networks, Data Sharing One of the most ...

Data Sharing One of the most important uses of networking is to allow the sharing of data. Before networking was common an accounting employee who wanted to prepare a report f

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