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

General middleware in client server environment, What is General Middleware...

What is General Middleware in client server environment? Ans) It having the communication stacks, distributed directories, authentication services, network time, RPC, Queuing se

Receive window - transport layer, Receive Window This  field  defin...

Receive Window This  field  defines the size  of the  window in bytes  that the  other party  must  maintain. Note  that the  length  of this  field 16 bits  which  means

Determine the switch in a physical ring, Switch In a physical ring ...

Switch In a physical ring configuration any disabled or else disconnected node can disable the entire network Use of a switch can permit the ring to bypass an inactive

Challenge handshake authentication protocols (chap), Challenge Handshake Au...

Challenge Handshake Authentication Protocols (CHAP) CHAP as its an implies implements  a form of authentication that  requires a challenge  and a response. A CHAP authenticator

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.

Framing techniques of datalink layer, java program to implement framing tec...

java program to implement framing techniques of datalink layer

What is ipv6, What is IPv6? IPv6, or Internet Protocol version 6, was d...

What is IPv6? IPv6, or Internet Protocol version 6, was developed to change IPv4. At present, IPv4 is being used to control internet traffic, butis expected to get saturated in

What are mac addresses, What are MAC addresses? MAC, or Media Access Co...

What are MAC addresses? MAC, or Media Access Control, uniquely identifies a device on the network. It is also called as physical address or Ethernet address. A MAC address is m

What is groupware server, What is Groupware server? Groupware addresses...

What is Groupware server? Groupware addresses the management of semi-structured information like text, image, mail, bulletin boards and the flow of work. These Client/Server sy

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

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