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

What is aspects of security, Q. What is Aspects of Security? - Securit...

Q. What is Aspects of Security? - Security Attack: Any action whichcompromises the security of information owned by an organization. - Security Mechanism: A mechanism th

State the methods to keep the attackers at bay, State the methods to keep t...

State the methods to keep the attackers at bay Another best methods to keep the attackers at bay is known as network address translator or NAT. The philosophy behind the design

Describe osi routing architecture, Q. Describe OSI Routing Architecture? ...

Q. Describe OSI Routing Architecture? End systems (ESs) as well as intermediate systems (ISs) use routing protocols to distribute (-advertise?) some or all of the informati

Find the main problems with access points in a wireless lan, Question: ...

Question: Wireless Access points have been known to have various security vulnerabilities that can lead to breach of Secured wired networks. IEEE 802.11 standards have identifi

Network control protocols ncp, Network  Control  protocols ( NCP) Th...

Network  Control  protocols ( NCP) The first  ARPANET  networking protocols  was named  simply the network  control protocols in 1970,and  was created by  created by  network

Link state packet - network layer and routing , Link State Packet When ...

Link State Packet When  a router floods  the network  with information about its  neighbourhood. It is said to  be advertising. The basis of this  advertising is  a short  pack

Explain how tcp handles connection-setup management, Problem: (a) Expla...

Problem: (a) Explain how TCP handles connection-setup management. (b) Each host on the Internet is currently assigned an IP address 32 bits long (IPv4). IPv4 addresses are u

Configure VTP Pruning on the Switches- CCNA, Configure VTP Pruning on the S...

Configure VTP Pruning on the Switche s VTP pruning allows a VTP server to suppress IP broadcast traffic for particular VLANs to switches that do not have any ports in that VLAN.

Des key, Assume the following 64-bit DES key (expressed in hexadecimal): FE...

Assume the following 64-bit DES key (expressed in hexadecimal): FEFE FEFE FEFE FEFE (a) What is the term for such a key? (b) State the value of each of the 48-bit round keys

Destination port number - transport layer, Destination Port Number Thi...

Destination Port Number This is  port number used by the process  running on the destination host. It is also 16 bits long  if the destination  host if  server ( a client  sen

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