Shortest path - network layer and routing , Computer Networking

Assignment Help:

Shortest path

 The  dijkstra algorithms  four steps to discover what it called  the shortest path  tree .

a.The algorithm  beings  to build  the tree identifying  its root. The root  of each router tree is the  router itself. The algorithm them attaches all nodes  that can  be reached from that  root in other words. All of the other neighbour  nodes and are  are temporary at this step.

b.The algorithm compares the tree temporary acres and identifies the are with the  lowest  commutative cost. This are and the node to which it  connecters are now a permanent part of  shortest path  tree.

c.The  algorithm examines the database  and identifies every node that  can be  reached from it  chosen  node. These nodes  and their  arcs are added temporarily to the tree.

d.The last  two  steps  are repeated until every node  in the network  has become  a permanent part of the tree. The only  permanent  arcs are those  that represent the shortest route to every  node.

The cost number  next to  each node  represents the cumulative cost  from  the root  node  not the cost of the individual arc. The second  third  steps  repeated until  four more  nodes  have  becomes  permanent.

 


Related Discussions:- Shortest path - network layer and routing

Distributed shared memory systems, Distributed Shared Memory (DSM) systems ...

Distributed Shared Memory (DSM) systems copy a shared memory abstraction on loosely coupled architectures in order to allow shared memory programming despite missing hardware suppo

Host system in tcp-ip model, Q. Host System in TCP-IP model? - Standard...

Q. Host System in TCP-IP model? - Standards adopted because of widespread use like (Internet) - The protocols came first plus the model was really just a description of the

Explain anti-aliasing techniques, Question: (a) Explain the issue assoc...

Question: (a) Explain the issue associated with vertices when the scan line scan line polygon fill algorithm is being applied? (b) Explain the logic of shortening edges to a

Describe the depth penetration method for a crt, Question: (a) What do ...

Question: (a) What do you understand by the following terms related to LCDs: Reflective LCDs Backlit LCDs (b) By using an example, explain the main steps of the B

Explain the OSI Model Facts, OSI Model Facts The OSI model classifies a...

OSI Model Facts The OSI model classifies and organizes the methods that hosts perform to maintain data for transport across the network. You should be familiar with the OSI m

What common software problems can lead to network defects, What common soft...

What common software problems can lead to network defects? Software related problems can be any or a combination of the following: - Client server problems - Application

Determine sonet devices, Sonet Devices STS Mux or DMux either multiplex...

Sonet Devices STS Mux or DMux either multiplexes signals from multiple sources into an STS or demultiplexes an STS into different destination signals. Regenerator is a repea

CLIENT SERVER BLACKJACK, So for this project, we’re going to make a game. ...

So for this project, we’re going to make a game. This game will make use of a server to join two clients together for a modified game of Blackjack.

Checksum - transport layer, Checksum This 16 bits field contain  th...

Checksum This 16 bits field contain  the checksum. The  calculation of the   checksum for TCP follows  the same  procedure as the  described for  UDP. However the inclusion

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