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

Osi network layer addressing, Q. OSI Network Layer Addressing ISO/I...

Q. OSI Network Layer Addressing ISO/IEC and CCITT mutually administer the global network addressing domain. The primary hierarchical decomposition of the address is defined

Explain design issues of interconnection network, Design Issues Of Intercon...

Design Issues Of Interconnection Network Below are the issues, which must be considered when designing an interconnection network. 1)  Size and Dimension of network:  It m

Program to use of lastprivate clause, This example illustrate the use of la...

This example illustrate the use of lastprivate clause void for_loop (int n, float *a, float *b) { int i; #pragma omp parallel { #pragma omp for lastprivate(i) for

Data structures for parallel algorithms, To execute any algorithm, selectio...

To execute any algorithm, selection of a proper data structure is very crucial. A particular operation may be executed with a data structure in a smaller time but it may have a ver

Show vpns security and the internet model, Q. Show VPNs Security and the In...

Q. Show VPNs Security and the Internet Model? - VPN's Security and the Internet Model - Application layer - provide for each application protocol (other layers may be left v

CEI45 Network Communications, How could a VPN be used to facilitate secure ...

How could a VPN be used to facilitate secure remote administration of a server?

Concept of internetwork and intranetwork routing protocols, Describe the co...

Describe the concept of internetwork and intranetwork routing protocols?

What are the categories of traditional ethernet, Categories of traditional ...

Categories of traditional Ethernet a)  Baseband - digital signals using Manchester encoding b) 10Base2, 10-Base-T, 10Base5, 10Base-FL c)  First number signifies data rate

Comparison of connection-oriented and connectionless, CONNECTION-ORIENTED: ...

CONNECTION-ORIENTED: Accounting is simpler. Application can learn of network causes immediately. CONNECTIONLESS: It has fewer load. It is easier to cre

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