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

What are the two broad class classifications, What are the two broad class ...

What are the two broad class classifications under which Networks can be divided? All computer networks fit in one of the two dimensions namely: a)      Transmission Technol

What is applets, What is Applets Little programs that can make the We...

What is Applets Little programs that can make the Web pages more aesthetically beautiful by means of animations, text, and graphics moving across the screen.

elementary logic gate circuit, Question Which elementary logic gate is...

Question Which elementary logic gate is equivalent to this circuit? Show your working.

What is the administrative distance for igrp, IGRP is a distance vector rou...

IGRP is a distance vector routing protocol designed by Cisco. The maximum hop count is 255, and it uses a combination of variables to verify a composite metric. IGRP has an adminis

What is the role of ieee in computer networking, What is the role of IEEE i...

What is the role of IEEE in computer networking? IEEE, or the Institute of Electrical and Electronics Engineers, is an organization composed of engineers that issues and manage

Define the term - hot swapping, Define the term - Hot swapping The rel...

Define the term - Hot swapping The reliability of the machine can be dramatically improved by installing the best components. Hot swapping is a concept through which component

Physical layer responsibilities of osi model, Q. Physical Layer Responsibil...

Q. Physical Layer Responsibilities of osi model? - Physical characteristics of interfaces as well as media - Representation of bits with no interpretation - Data rate is

State ethernet frame format, Ethernet Frame Format Consists of sev...

Ethernet Frame Format Consists of seven fields There is No mechanism for acknowledging received frames considered an unreliable medium

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