Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
Explain Difference between broadcast domain and collision domain? Ans) Broadcast Domain Send the packet to all the Present Network IT might be send by the person It mig
Suppose there are exactly five packet switches (Figure 4) between a sending host and a receiving host connected by a virtual circuit line (shown as dotted line in figure 4). The tr
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
Dijkstra Algorithms To calculate its routing table each router applies an algorithm called the dijkstra algorithm to its state database. The dijkstra algorithm calculate
identify different network topologies.
Explain Point-to-Point connection type. Many point-to-point connections are associated with modems and PSTN (Public Switched Telephone Network) communications.
Can you describe autonomous numbers in EGP?
Persistent and No persistent Connections HTTP can use both persistent and non persistent connection. By defaults uses persistent connections. Persistent Connections
Q. Illustrate Data-Link Layer in osi layers model? Data-Link Layer: This layer takes the data messages or frames from the Network Layer and gives for their actual transmissio
IEEE 802.3-Ethernet Introduction LAN (Local Area Network) - network connecting devices in a limited geographic area usually privately owned and limited to a single o
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd