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 used in design a banking network, You have been asked to d...

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

Determine the switch in a physical ring, Switch In a physical ring ...

Switch In a physical ring configuration any disabled or else disconnected node can disable the entire network Use of a switch can permit the ring to bypass an inactive

What is an object server in client server environment, With an object serve...

With an object server, the Client/Server application is written as a set of communicating objects. Client object commune with server objects using an Object Request Broker (ORB). T

Uses of fragmentation and reassembly, Uses of fragmentation and reassembly ...

Uses of fragmentation and reassembly The More bit is used for fragmentation and reassembly. If this bit is 0, then either there has been no fragmentation of this packet or this

What is proxy serer and firewall, What is Proxy Sever and Firewall Pro...

What is Proxy Sever and Firewall Proxy Sever Also known as a proxy or application level gateway. It is an application that breaks the connection among sender and receiver.

Permutation representation through matrix, Q. Permutation representation th...

Q. Permutation representation through Matrix? Figure: Clos Network The functioning of this above permutation is displayed in Figure. This permutation is able to

Subtle point, It is possible for a datagram to generate ICMP errors after i...

It is possible for a datagram to generate ICMP errors after it has been fragmented. For example, suppose that each of two fragments cannot be delivered. Seemingly, this would mean

Bit stuffing, bit stuffing program in python

bit stuffing program in python

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