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!
While calculating shortest path, first we assume graph presentation of network at every node then we use Djikstra's algorithm to calculate shortest path from every node to other one. Then extract next hop information from giving path information and add next hop information into routing tables.
WEIGHTED GRAPH
Djikstra's algorithm will add weights on edges in graph. The shortest path is then the path with minimum total weight. It could be noticed that the shortest path is not necessarily with fewest edges. For example as given in the figure below:
The minimum path in the diagram from node 2 to node 6 is 2 to 3 and 3 to 6 as this way has the minimum weight so it is the shortest path.
DISTANCE MATRICS
Weights on graph nodes denote cost of traversing edge. This cost can be in time, hop or dollars counting (weight == 1). The resulting shortest path can not have fewest hops.
Q. Illustrate about RSA Encryption? RSA Encryption - Public key encryption technique - Encryption steps: - Encode data to be encrypted as a number to create the pla
Dijkstra Algorithms To calculate its routing table each router applies an algorithm called the dijkstra algorithm to its state database. The dijkstra algorithm calculate
What is Framing? Framing in the data link layer divides a message from one source to a destination, or from other messages to other destinations, by adding a sender address and
As in PRAM, there was no direct communication medium among the processors, therefore another model called as interconnection networks have been designed. In the interconnection net
What are the drawbacks of wireless devices One drawback is security. Every random delivery man who happens to be in building can listen on network. Another weakness is reliabil
Merits of Shared Memory Programming Global address space gives a user-friendly programming perspective to memory. Data sharing among processes is both fast and uniform
What is Stop-and-Wait Automatic Repeat Request? Error correction in Stop-and-Wait ARQ is implemented by keeping a copy of the sent frame and retransmitting of the frame when th
Default IPX Ethernet encapsulation is Novell-Ether
1. A computer system has a two-level memory cache hierarchy. The L1 cache has a zero hit penalty, a miss penalty of 5 ns and a hit rate of 95 percent. The L2 cache has a miss pena
Describe difference among Single path and Multipath?
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