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

Options - transport layer, Options The options  fields may be  used to...

Options The options  fields may be  used to  provide  other functions that are not  covered by  the header. If the length  of the  options  field is not  a multiple of 32 bits

Explain about wireless ethernet, Wireless Ethernet (802.11) a) Operates...

Wireless Ethernet (802.11) a) Operates on physical plus data link layers b) BSS (Basic service set) stationary or mobile wireless stations and a central base station known a

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

Wlan technology, Identify and briefly explain any four key requirements tha...

Identify and briefly explain any four key requirements that need to be examined when considering deploying a WLAN technology.

What is bookmark, What is Bookmark A list of pages a user likes to f...

What is Bookmark A list of pages a user likes to frequently visit. Netscape® Navigator and Explorer® have a "bookmark" menu item which allows users to add favourite sites vi

What is subnet mask, What is subnet mask? A subnet mask is combined wit...

What is subnet mask? A subnet mask is combined with an IP address in order to recognize two parts: the extended network address and the host address. Such as an IP address, a s

Which layer defines the physical topology, The Physical layer deals with th...

The Physical layer deals with the definite physical medium and the method of transporting 1s and 0s.

What is multiplexing, What is Multiplexing? Multiplexing is the set of ...

What is Multiplexing? Multiplexing is the set of techniques that permits the simultaneous transmission of multiple signals across a single data link.

Difference between multiprogramming and multithreading, Question: a) L...

Question: a) List three characteristics and two potential problems of a peer-to-peer environment. b) List three characteristics and two potential problems of a client/

Internet backbone - computer network, Internet Backbone Internet backb...

Internet Backbone Internet backbone  is the  physical  networks ( usually relying  on fiber optic  cable ) that  carries  internet  traffic between  different  networks  and i

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