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

Different technologies involved in establishing wan links, What are the dif...

What are the different technologies involved in establishing WAN links? Analog connections - using conventional telephone lines; Digital connections - using digital-grade telep

Introduction-parallel algorithms, Introduction An algorithm is defined ...

Introduction An algorithm is defined as a series of computational steps required to accomplish an exact task. The algorithm works for a given input and will terminate in a well

What is sliding window protocols, Q. What is Sliding Window protocols? ...

Q. What is Sliding Window protocols? Alternatives: Sliding Window protocols - One task begins prior to the other one ends                                     (concept of

Presentation layer of osi reference model, Q. Presentation layer of osi ref...

Q. Presentation layer of osi reference model? - The presentation layer makes sure that the information that the application layer of one system sends out is readable by the app

State the example of security audit as case study, State the Example of sec...

State the Example of security audit as case study Linda narrates one of her experience about a security audit. She was performing a spot audit where she was checking certain

Go back-n ( gbn) - transport layer, Go Back ( GBN) Go back  N ARQ is s...

Go Back ( GBN) Go back  N ARQ is specific  instance of the  automatic  repeat request protocols  in which  the sending  process continues to send  a number of frames specific

Electronic cheques, Electronic Cheques   Another mechanism for Internet p...

Electronic Cheques   Another mechanism for Internet payment is electronic cheques. With electronic cheques, the payer (either an individual consumer or a business) instructs his

What layer can optionally support reliability, Ans) The Transport Layer : ...

Ans) The Transport Layer : Segments upper-layer applications. Establishes an end-to-end connection. Sends segments from one end host to another. Optionally, make sures

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