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 is the protocol number for tcp, Transmission Control Protocol - TCP i...

Transmission Control Protocol - TCP is a connection oriented transport layer protocol with built unreliability. It considers a large block of data and breaks it down into segments

Layers, Layers, Massages, Segments, Datagram's and Frames Figure 2.15 ...

Layers, Massages, Segments, Datagram's and Frames Figure 2.15 show the physical  path data takes down a  sending  end  systems  protocol  stack up and  down the  protocol stac

Describe about data communications, Q. Describe about Data Communications? ...

Q. Describe about Data Communications? - Data - Information presented in whatsoever form is agreed upon by the parties creating and using the data - Data Communications - ex

Hypercube network and properties, Hypercube Network The hypercube archi...

Hypercube Network The hypercube architecture has played a vital role in the development of parallel processing and is still not much popular and influential. The highly symmetr

Explain in detail about wireless network, Explain in detail about wireless ...

Explain in detail about wireless network Think about unseen terminal problem. Imagine a wireless network consist of five stations, A through E, such that each one them is in r

What is an arp and how does it work, ARP(ADDRESS RESOLUTION PROTOCOL) is a ...

ARP(ADDRESS RESOLUTION PROTOCOL) is a network layer protocol which associates the physical hardware address of a network node(commonly called as a MAC ADDRESS) to its ip address. n

Networks - fundamental of network , Normal 0 false false fa...

Normal 0 false false false EN-IN X-NONE X-NONE Networks A networks  consists of two  or m

Explain the cost of a path between two nodes, Explain the cost of a path be...

Explain the cost of a path between two nodes Given a network of nodes linked by bidirectional links, where every link has a cost associated with it in each direction, explain t

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