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

Routing protocol, implementation of energy aided shortest path routing prot...

implementation of energy aided shortest path routing protocol???

Explain fully connected interconnection networks, Fully connected : It is t...

Fully connected : It is the most powerful interconnection topology.  In this every node is directly associated to all other nodes. The limitation of this network is that it needs t

Explain the concept of router-root path, Explain the concept of router-root...

Explain the concept of router-root path The mean router-router path is double the mean router-root path. Number levels of tree with root as 1 and the deepest level as n. The pa

Packet cost - network layer and routing , Packet  Cost Both  distance ...

Packet  Cost Both  distance vector and link  state  routing  are lowest  algorithms. Tow factors  govern  how  cost is applied to packets  in determines  a route. Cost  is a

Design a banking network, You have been asked to design a Banking Network w...

You have been asked to design a Banking Network with two primary types of locations.  Branches that will have 3 subnets, one /25 subnet one /26 subnet for ABMS and one /26 s

What are the disadvantages of microwaves, What are the Disadvantages of Mic...

What are the Disadvantages of Microwaves?  a. Attenuation by solid objects: birds, snow, rain, and fog. b. Reflected from flat surfaces such as water and metal. c. Diffra

virtual private network - virtual private network vpns, Virtual private ne...

Virtual private network The virtual  private  networks takes the  user data  encrypts them and sends them  to their  destination over  the internet. the sender  and the receiv

What is passive topology , When the computers on the network basically list...

When the computers on the network basically listen and receive the signal, they are referred to as passive due to they don't amplify the signal in any way.

Protocol will send a message to routers, Which protocol will send a message...

Which protocol will send a message to routers if a network outage or congestion happen Ans) Internet Control Message Protocol - ICMP will send a message to routers if a network

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