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. Show about Alternate mark inversion? Bipolar AMI - Neutral, zero voltage represents binary 0 - Binary 1s symbolized by alternating positive and negative voltages
Q. How is computer networks used in teleconferencing? Teleconferencing: Teleconferencing allows conference to happen without the participants being in the same place. Applica
There are two kinds of characteristics in case of network performance. Delay Throughput
Can you describe voluntary and compulsory tunnels?
Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4 What is overlapping
Inside a device, every address mask is stored as a 32-bit number. When we submit a prefix and an address mask they use a changed form of dotted decimal addressing known CIDR addres
What is workstation? A workstation is a node in network that is more useful and can occur local information processing or graphics processing. A workstation generally has an in
Clos network This network was organized by Clos (1953). It is a non-blocking network and gives full connectivity like crossbar network but it also requires significantly minim
Q. Subnet layer of the TCP-IP model? These two layers of the OSI correspond straight to the subnet layer of the TCP/IP model. Majority of the time the lower layers under the
Point out the drawbacks of Token Ring. Few of the drawbacks of Token Ring are: a. Token Ring is very costly. All topology components cost much more than other more popular s
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