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

Spanning tree protocol - ccna, Perform Basic Switch Configurations Step...

Perform Basic Switch Configurations Step 1: Cable a network that is similar to the one in the topology diagram.  You can use any current switch in your lab as long as it has

Subnetting (EIGRP), #questiGE 1-A Objectives: • Consolidate EIGRP knowle...

#questiGE 1-A Objectives: • Consolidate EIGRP knowledge. • Introduce the Route Redistribution concept. • Introduce the EIGRP External Routes concept. • Introduce the Default Met

Differentiate lan and wan, Question 1 Differentiate LAN and WAN Questi...

Question 1 Differentiate LAN and WAN Question 2 Explain the TCP/IP Reference Model with diagram Question 3 Describe Circuit switching and message switching Question

Compare error detection and error correction, Compare Error Detection and E...

Compare Error Detection and Error Correction: The correction of errors is more difficult than the detection. In error detection, checks only any error has happened. In error co

Firewall architectures-screening router, Screening Router In this setu...

Screening Router In this setup network router acts as a firewall. It checks all incoming and outgoing packets according to the predefined rules. This filter is placed at the c

R-sat networks for pstn and stm v-sat network, S t d "B" 9 m C-BAND EARTH...

S t d "B" 9 m C-BAND EARTH STATION (2001)   This  Earth  Station  is  aligned  with  INTEL  SAT  IOR  66°  and  provide domestic connectivity. R-Sat (Regional Satellite) i

Metric translation takes place in redistributing routes, Why Does metric tr...

Why Does metric translation takes place in redistributing routes?

Explain in dteail about the intranet, Explain in dteail about the intranet ...

Explain in dteail about the intranet The first Web browser was called Mosaic, and the HTML concept, although not a new one, has accelerated data access and research. In short,

traffic flow mapping , Develop traffic flow mapping and performance requir...

Develop traffic flow mapping and performance requirements for flows. A) Traffic Flow Mapping B) Performance Requirements

Explain monitor stations of token passing, Monitor Stations Lost t...

Monitor Stations Lost tokens - timer is issued each time a frame or token is generated If no frame is received in time period new token is generated by a monitor stat

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