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

Http request message, HTTP Request Message The first  line of  an HTTP...

HTTP Request Message The first  line of  an HTTP request message  is called the  line. The subsequent lines are called  the header lines. The  request  line has  fields the me

How do you disable cdp on the whole router, By using this command Router(c...

By using this command Router(config)# no cdp run we can disable CDP on the entire Router

How intranets encourage integration of applications, How Intranets encourag...

How Intranets encourage integration of applications Intranets encourage integration of applications; such as the simple word processing application could be easily linked with

Describe the static routing process, Describe the static routing process ...

Describe the static routing process A static routing method does not adapt to changing conditions on the network but uses a fixed method developed ahead of time. With alternat

How many types of twisted pair cable are there, How many types of twisted p...

How many types of twisted pair cable are there We can find two types of twisted pair cables, namely: Unshielded Twisted Pair Cable (UTP) and Shielded Twisted Pair Cable (STP).

Classify different types of ip routing, INTERNETWORKING - TCP/IP 1. Sta...

INTERNETWORKING - TCP/IP 1. State the following terminologies: a) Node b) Router c) Host d) Subnet e) Network 2. What do you understand by IEEE 802 Local Area network 3.

Challenge handshake authentication protocols (chap), Challenge Handshake Au...

Challenge Handshake Authentication Protocols (CHAP) CHAP as its an implies implements  a form of authentication that  requires a challenge  and a response. A CHAP authenticator

Minimum possible response time , Consider the similar conditions as the las...

Consider the similar conditions as the last problem, except for the following: what's the minimum possible response time for the 1 Gbps and a 1 Mbps line?  What does the diffrentia

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