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. Explain about Bandwidth – delay product? Bandwidth - delay product - A measure of competence of ARQ system = bandwidth (bits per second) * round-trip delay (in seco
Consider figure. Assume a new flow E is added that takes a path from R1 to R2 to R6. How does the max-min bandwidth allocation change for the 5 flows?
What is Wired Equivalent Privacy?
Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4
Q. What is network layer of osi model? - Describe end-to-end delivery of packets. - Defines logical addressing thus that any endpoint can be identified. - Defines how ro
Time out Timers are used to protect against lost packet. Each packet must have its own logical timers since only a single packet will be retransmitted after timeou
Question 1 Write short notes on (i) Fiber Distributed Data Interface (ii) Serial Line Question 2 Explain Internet layer and transport layer Internet layer Tran
FAULT TREE ANALYSIS Reliability engineering, in a nutshell is concerned with failures. How failures occur, how often they occur, and how to minimize them are the basic proble
The second point to consider is that from each location, some calls are internal to that site and some are going to outside locations. Again, as an approximation, MyCo telecom peop
Enumerate about the Traffic policing Traffic policing happens when a flow of data is regulated so that cells (or frames or packets) that exceed a performance level are discarde
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