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.
Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4
Q. Electrical Characteristics of 9-Pin RS232 Connector? Electrical Characteristics - Single-ended One wire per signal and voltage levels are with respect to s
Name the factors that affect the performance of the network? a. Number of Users b. Type of transmission medium c. Hardware d. Software
Suppose that frames are 1250 bytes long including 25 bytes of overhead. Also assume that ACK frames are 25 bytes long. Calculate the efficiency of stop-and-wait ARQ (a) Transmits a
Explain RIB?
So how packets do determines their way across the Internet? Does each computer linked to the Internet know where the other computers are? Do packets just get 'broadcast' to every c
Recognize the command to show the Frame Relay map table Ans) Router# show frame-relay map is the the command to show the Frame Relay map table
Unfortunately, building real-life distributed systems is not easy. It is hard, for instance, to implement instructions such as "send this data structure to be processed on that com
Wireless Ethernet (802.11) a) Operates on physical plus data link layers b) BSS (Basic service set) stationary or mobile wireless stations and a central base station known a
Q. Illustrate the Advantages of VLANs? - Cost and time reduction in moving stations from one group to another - Creation of virtual workgroups - Security Position of
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