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

Financial services - fundamentals of networks , Financial Services Tod...

Financial Services Today   financial services are totally depended  on computer network. Application includes credit history searchers foreign exchange and  investment service

What is the purpose of arp, ARP is used to search a devices MAC address giv...

ARP is used to search a devices MAC address given an IP address.

Connectionless multiplexing and de multiplexing, Connectionless Multiplexi...

Connectionless Multiplexing  and De multiplexing Java program running in a host can create a UDP socket  with the  line Datagram's socket my socket =  new datagram's socket

Firewalls, Firewalls Firewalls emerged as a new technology in 1990s but...

Firewalls Firewalls emerged as a new technology in 1990s but its idea was present near two decades back. Historical context of "Firewall" is quite literal. It was in use to des

Define IEEE 802.4-token bus, IEEE 802.4-Token bus Physical line or tree...

IEEE 802.4-Token bus Physical line or tree however logical ring. Stations know "left" as well as "right" stations. One token "passed" from station to station. Only station with

Tcp-ip and osi differences, Q. TCP-IP and OSI Differences - TCP/IP com...

Q. TCP-IP and OSI Differences - TCP/IP combines the Presentation and Application Layers - TCP/IP combines the OSI Data Link and Physical Layers into 1 Layer - TCP/IP app

R-sat networks for pstn and stm v-sat network, S t d "B" 9 m C-BAND EARTH...

S t d "B" 9 m C-BAND EARTH STATION (2001)   This  Earth  Station  is  aligned  with  INTEL  SAT  IOR  66°  and  provide domestic connectivity. R-Sat (Regional Satellite) i

What is the frame, What is the Frame A presentation format, which en...

What is the Frame A presentation format, which enables Web page designers and users to mark a part of the screen for links to other pages. Frames usually appear on the left

Advantages and disadvantages of client-server method, 1. Write a critical a...

1. Write a critical analysis of the client/server vs. service architecture method for developing service architectures.  You must explain what the client/server method is in terms

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