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.
What is the meaning of P-persistent If the medium is idle, transmit with probability p, and delay one time unit with probability (1 - p); if the medium is busy, continue to lis
What is route summarization
Define the Bulletin Board Intranet This type of Intranet in an organisation extends to everyone the capability to review or update information that would normally be placed
Can you define PAP?
In this part, we shall talk about about message passing libraries. In history, various message passing libraries have been available since the 1980s. These executions differed subs
Firewalls After several security related internet newsgroups started overflowing with posts it becomes clear something hand to done to help secure networks. The first
DNS Message There are the only two kinds of DNS message DNS query and reply messages. Further mote both query and reply message have the same format as shown in figure.
Pipelined Processor A pipeline processor can be described as a processor which comprises of a series of processing circuits known as segments and a stream of operands (data) is
What is Single-mode fiber Single-mode fiber is competent of higher bandwidth and greater cable run distances than multi-mode fiber. For the reason that of these characterist
Originally Linux/UNIX systems had one all-powerful user called root that managed systems. Discuss the risks of having a single root user and how more limited management abilities c
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