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

Networking, discuss the interdependence of workstation hardware with releva...

discuss the interdependence of workstation hardware with relevant software

What is forest, The term "forest" is used to explain a collection of AD dom...

The term "forest" is used to explain a collection of AD domains that share a one schema for the AD. All DC's in the forest share this schema and it is replicated in a hierarchical

Subnets and classless addressing, As the Internet started, the original Cla...

As the Internet started, the original Classful addressing procedure became a limitation. The IP address space was being terminated because all networks had to select one of three p

Format of hardware address, FORMAT OF HARDWARE ADDRESS:    It have ...

FORMAT OF HARDWARE ADDRESS:    It have of a numeric value and its size is chosen for specific network technology. The length of the message format is one to six bytes.

Ieee specification for spanning tree protocol, What is the IEEE specificati...

What is the IEEE specification for Spanning Tree Protocol Ans) IEEE 8021.d Spanning Tree Protocol (STP) was developed to stop routing loops in a network. If a router, switch, or

Explain the lan topologies, LAN Topologies The term topology explains t...

LAN Topologies The term topology explains the geographic arrangement of networking devices. It explains the actual layout of the network hardware. Given the location of worksta

Design a logical lan topology- ccna, Design a Logical LAN Topology Step...

Design a Logical LAN Topology Step: Design an IP addressing scheme. Given the IP address block of 192.168.7.0 /24, design an IP addressing scheme that states the following r

Unguided media - wireless, Unguided Media: Wireless - A Wireless commu...

Unguided Media: Wireless - A Wireless communication transporting electromagnetic waves without a physical conductor Wireless Propagation Methods - Ground - radio

Write the concept of simplex, Describe Concept of Simplex, Half Duplex and ...

Describe Concept of Simplex, Half Duplex and Full Duplex dialogs?

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