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

Base 64 encoding, Base 64 Encoding The Simple Mail Transfer Protocol (...

Base 64 Encoding The Simple Mail Transfer Protocol (SMTP) is a protocol used on the Internet for sending email. When you send an email, your mail client establishes an SMTP co

What is redundancy, What is Redundancy? The method of including extra i...

What is Redundancy? The method of including extra information in the transmission solely for the purpose of comparison. This technique is known as redundancy.

CEI45 Network Communications, How could a VPN be used to facilitate secure ...

How could a VPN be used to facilitate secure remote administration of a server?

Message passing programme development environment, Message Passing Programm...

Message Passing Programme Development Environment In a multicomputer system, the computational load among various processors must be balanced. To pass information among variou

Bit stuffing, bit stuffing program in python

bit stuffing program in python

Control flow in distributed enrollment protocol , Control Flow: Once the c...

Control Flow: Once the client has established a network connection with a server, the server must instantiate a new, empty, BasicEnrollmentManager implementation for this client,

Explain the basic of network properties, Explain the basic of Network Prope...

Explain the basic of Network Properties   The subsequent properties are related with interconnection networks. 1)  Topology: It refers how the nodes a network are systema

What is the protocol number for tcp, Transmission Control Protocol - TCP i...

Transmission Control Protocol - TCP is a connection oriented transport layer protocol with built unreliability. It considers a large block of data and breaks it down into segments

Parallel construct in openmp, Parallel Construct The syntax of the para...

Parallel Construct The syntax of the parallel construct is as follows: #pragma omp parallel [set of clauses]  where clause is one of the following:  structured-block if(sca

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