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

Which layers are user support layers, Which layers are user support layers?...

Which layers are user support layers? Three layers are come under user support layer:- a. Session Layer b. Presentation Layer and c. Application Layer

Fundamental of network , Fundamental of Network The  concept  of netw...

Fundamental of Network The  concept  of network  is not  new. In simple  it means an interconnected set  of some  objects. For decades we are familiar with the radio,  televi

State the uses of groupware, State the uses of groupware With the use o...

State the uses of groupware With the use of groupware, users can easily do most of the office related management work, which otherwise would be extremely difficult. For instanc

Determine the level of fibre channel standard, Determine the level of Fibre...

Determine the level of Fibre Channel standard The Fibre Channel standard is organized into five levels: FC-0: The Physical Interface and Media Level handles a variety of phy

Internet address, Addresses are necessary for virtually everything we do on...

Addresses are necessary for virtually everything we do on the Internet. In TCP/IP the IP is a mechanism for providing addresses for computers on the Internet. Internet addresses ha

What is the importance of encryption on a network, What is the importance o...

What is the importance of Encryption on a network? Encryption is the process of translating information into a code that is unreadable by the user. It is then translated back o

What are the call routers, What are the Call routers Call routers A, B,...

What are the Call routers Call routers A, B, C, D, and E. There are ten potential lines: AB, AC, AD, AE, BC, BD, BE, CD, CE, and DE. Each of these lines has four possibilities

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