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

Explain the meaning of disassociation, Explain the meaning of Disassociatio...

Explain the meaning of Disassociation A notification from either a station or an AP that an existing association is terminated. A station should provide this notification befor

Distance vector multicast routing protocol, DVMRP • Distance vector mu...

DVMRP • Distance vector multicast routing protocol: Distance vector multicast routing protocol are abbreviated as DVMRP. These protocols are suitable for small networks which

The received message - application layer , The Received Message If  we...

The Received Message If  we didn't mention  another  class of header lines that are  inserted by the SMTP receiving  server. The receiving  server upon receiving a message wit

Compute the hash - part of the packet, In this question, we study Nested ES...

In this question, we study Nested ESP in AH, that is, we combine ESP with AH. Let's look at the site-to-site VPN scenario shown again in Figure 1. Let's assume that Alice's desktop

Explain the importance of authentication, Explain the importance of authent...

Explain the importance of authentication. Authentication is the method of verifying a user's credentials before he can log into the network. It is normally performed using a us

What is a pseudo TTY, What is a pseudo tty? A pseudo tty or false termi...

What is a pseudo tty? A pseudo tty or false terminal enables external machines to connect by Telnet or rlogin. Without a pseudo tty, no connection can take place.

Administrative distance of 0 mean, Directly linked network have the lowest ...

Directly linked network have the lowest administrative distance of 0. They are considered the most reliable.

Explain session layer in osi model, Q. Explain Session Layer in osi model? ...

Q. Explain Session Layer in osi model? - The session layer defines how to control, start and end conversations (called sessions) between applications. - This includes the c

Horizontal scaling and vertical scaling, What is meant by horizontal scalin...

What is meant by horizontal scaling and vertical scaling? Ans) Horizontal scaling means adding or removing client workstations with only a small performance impact. Vertical

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