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. Single Mode for transmitting optical signals? - Merely one beam from a light source is transmitted using a smaller range of angles - Smaller diameter as well as lower de
Point out the disadvantages of Ring Topology. The drawbacks of ring topologies are: a. It is considerably complex to install and reconfigure ring topology b. Media failur
Allows for transmission and receiving of data concurrently
Reliable data transfer over a perfectly reliable channel rdt 1.0 First all consider the simplest care in which the underlying channel perfectly reliable. The protoco
Can you Describe what the use of IGMP Protocol is?
In communication weakening or loss of signal energy, typically caused by distance
Question 1 Explain FDM and TDM with example Question 2 Define B-ISDN and explain its services Question 3 What is symmetric key cryptography? Describe one symmetric
OSI Reference Model Normal 0 false false false EN-IN X-NONE X-NONE
Control Frames for Lost Tokens If station goes down ... token lost Predecessor listens for data frame or token Noticing none, retransmits token Sends whofoll
Reliable Data Transfer Figure illustrate the framework for reliable transfer. The service abstraction provided to the upper layer entities is that of a reliable channel
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