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 term data routing functions, Data Routing Functions The dat...

Data Routing Functions The data routing functions are functions that when executed set the path between source and destination. In dynamic interconnection networks there may be

Layer 2 switch, A typical layer 2 switch has a number of features. Identify...

A typical layer 2 switch has a number of features. Identify and explain 5 features that you think are important that you would consider in your evaluation of L2 switches offered b

Subnets and classless addressing, As the Internet started, the original Cla...

As the Internet started, the original Classful addressing procedure became a limitation. The IP address space was being terminated because all networks had to select one of three p

Illustrate keep alive and time-waited timer, Q. Illustrate Keep alive and T...

Q. Illustrate Keep alive and Time-Waited Timer? Keep alive timer To prevent a long inactive connection between two TCPs - Either client or server crash

Illustrate network layer in osi layers model, Q. Illustrate Network Layer i...

Q. Illustrate Network Layer in osi layers model? Network Layer :  This is responsible for addressing messages and data so they are sent to the required destination, and for tr

Show the tcp connections, Q. Show the TCP connections? Connection estab...

Q. Show the TCP connections? Connection establishment Three-way handshake Why is two-way handshake not enough? Connection termination Four steps

Explain categorization according to pipeline configuration, Categorization ...

Categorization according to pipeline configuration According to the configuration of a pipeline, the below categories are recognized under this classification: Unifunct

Length- transport layer, Length This is a 16 bit  field  that  defines...

Length This is a 16 bit  field  that  defines  the total  length  of the user  datagram, header  plus data. This 16 bit  can define  a total  length  of a 0 to 65, 535 bytes.

Http is stateless - discuss this statement, Question : (a) Describe, w...

Question : (a) Describe, with the aid of a diagram, a hybrid topology of a network of your choice. (b) Briefly explain the similarity and differences between a switch and

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