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

Describe essential security services, Problem: (a) Application Layer pr...

Problem: (a) Application Layer protocols can be classified as connection-oriented or connectionless-oriented. i. What do you understand by the term protocol? ii. Give an e

Characteristics of the user private group scheme, Question: a) The cpi...

Question: a) The cpio utility has three operating modes. What are they? b) The characters of the permission string are broken up into three groups of three characters. Ex

Conversion binary to hexadecimal, Qustion: Convert the binary number 10...

Qustion: Convert the binary number 10111100 to hexadecimal.

Role of software in intranet, Role of Software in Intranet For an Intr...

Role of Software in Intranet For an Intranet to be successful, it must have strong software support. In this section, a brief description of the operating system, groupware an

Describe one security measure against reverse tunneling, Question: a) I...

Question: a) In route-optimized communication, a mobile node sends packets to a correspondent using the home address present in the destination option. Why does the design use

When it comes to networking what are rights, When it comes to networking, w...

When it comes to networking, what are rights? Rights refer to the authorized permission to perform exact actions on the network. Every user on the network can be assigned indiv

What is the difference among tftp and ftp application, What is the differen...

What is the difference among TFTP and FTP application layer protocols? The Trivial File Transfer Protocol (TFTP) permits a local host to get files from a remote host but does n

Determine the definition of hdlc, Determine the definition of HDLC HDLC...

Determine the definition of HDLC HDLC has only one address field. In a LAN, any station may transmit to any other station. The receiving station needs to see its own address in

Define the term - proxy servers, Define the term - Proxy servers These ...

Define the term - Proxy servers These types of firewalls have been further classified into two types: application level gateways and circuit level gateways. The application

What is domain names, Q. What is Domain Names ? - Full domain name is a...

Q. What is Domain Names ? - Full domain name is a sequence of labels separated by dots (.) - Fully competent domain name (FQDN) contains the full name of a host cis.usouthal

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