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 segmentation and fragmentation, To split data in pieces is known as...

To split data in pieces is known as segmentation and divide segmentation in pieces called Fragmentation. #question..

Control - transport layer, Control This field  defines 6 different  co...

Control This field  defines 6 different  control  bits or  flags. These bits  enable flow  control  connection  establishment  and termination connection abortion and the mode

Verify network connectivity- ccna, Verify Network Connectivity Step 1: ...

Verify Network Connectivity Step 1: Use the ping command to determine network connectivity. You can determine network connectivity using the ping command.  Note: If pings

Distribution of dns - application layer , Distribution of DNS 1.By cen...

Distribution of DNS 1.By centralized data base The information contained in the domain  name space must be stored. A simple design  or DNS would have one DNS server that co

Explain in brief about the term- daemon, What is Daemon A daemon is ...

What is Daemon A daemon is a UNIX background process that implements the server side of a protocol. Daemons are unique to UNIX. For example, FTP stands for the File Transfer

Overview of the various network topologies, QUESTION Write a report to ...

QUESTION Write a report to explain the concept of LAN and WAN including the various components of the telecommunication infrastructure required by UTM Ltd. You are required to

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

Twisted pair cable - computer network, Twisted Pair Cable Twisted pair...

Twisted Pair Cable Twisted pair cable  consists of two insulated copper  wires  each  about 1 mm  thick arranged in a regular spiral  pattern. The wires  are twisted together

Connection to packet switches, CONNECTION TO PACKET SWITCHES:  A packe...

CONNECTION TO PACKET SWITCHES:  A packet switch many join to devices and to other packet switches. But the speeds are different in both parts. There are typically high-speed j

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