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

Structure of internet servers address, In a client's software , the structu...

In a client's software , the structure of an Internet server's address keyed is as follows: Where: http refer for the communication protocol to be used www refer for th

IP datagram, On a LAN where are IP Datagram transported?

On a LAN where are IP Datagram transported?

What is domains in active directory, In Windows 2000, a domain describes bo...

In Windows 2000, a domain describes both an administrative boundary and a security boundary for a collection of objects that are relevant to a particular group of users on a networ

Simple mail transfer protocoland secure sockets layer, Simple Mail Transfer...

Simple Mail Transfer Protocoland Secure Sockets Layer SMTP: Simple Mail Transfer Protocol is a server-to-server protocol for delivering electronic mail. SSL: Secure Sockets

Basic working of spanning tree, Q. Basic working of Spanning Tree? Spa...

Q. Basic working of Spanning Tree? Spanning Tree - Redundant bridges may be installed to provide reliability - To prevent infinite looping of packets between bridges,

Describe the concept of successor and feasible successor, Describe the conc...

Describe the concept of successor and feasible successor?

What is difference among arp and rarp, What is difference among ARP and RAR...

What is difference among ARP and RARP? The address resolution protocol (ARP) is used to associate the 32 bit IP address with the 48 bit physical address, used by a host or a ro

What is data encapsulation, What is data encapsulation? Data encapsulat...

What is data encapsulation? Data encapsulation is the method of breaking down information into smaller manageable chunks before it is transferred across the network. It is also

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