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

Architecture of cisco ios software, Architecture of Cisco IOS software ...

Architecture of Cisco IOS software Cisco IOS might not  applications like ms word,multimedia softwares. It is mainly for switching data packet and concentrated on switching p

Power supply system in satellite system, POWER SUPPLY SYSTEM IN  SATELLITE...

POWER SUPPLY SYSTEM IN  SATELLITE SYSTEM Satellite Earth Station relies on the public power supply system. Two generators (1+1) of 250 KVA each in parallel connection having fa

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

Single program multiple date in parallel virtual machine, Single Program Mu...

Single Program Multiple Date A common style of writing data parallel programs for MIMD computers is SPMD (single program, multiple data): all the processors implement the same

What is the advantage of address sharing, What is the advantage of address ...

What is the advantage of address sharing? By using address translation instead of routing, address sharing gives an inherent security benefit. That's because host PCs on the In

What is network architecture, What is Network Architecture? When two o...

What is Network Architecture? When two or more computer are linked with one another for the purpose of communicating data electronically, besides physical connection of comput

What are the threats include in computer software, What are the threats inc...

What are the threats include in computer software The second component vulnerable to threats to the system is software. Threats to software may include, but are not limited to

State synchronous FDDI, Synchronous Synchronous traffic is able to cons...

Synchronous Synchronous traffic is able to consume a portion of the 100 Mbps total bandwidth of an FDDI network while asynchronous traffic can consume the rest. Synchronous

Routing by rumor, What is the major issue with routing by rumor?

What is the major issue with routing by rumor?

Dns cache poisoning, DNS cache poisoning The DNA cache poisoning gener...

DNS cache poisoning The DNA cache poisoning generally refers to the process of maintaining or developing the false information, in the cache of DNS server. This process refers

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