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.
GRP uses a composite metric complete up of bandwidth and delay by default, it updates each 60 Seconds and will trigger an update if the topology changes.
State about the international standardization There are many examples, certainly. Some systems for which there is international standardization include compressed disc players
Can you Describe the concept of Layer 3 switches
Virtual Private Network (VPN) adds the features of both public and private networks. It is fixed to single organization and needs public network for connectivity. These connect
Q. Error Correction in Burst Error Correction? Error Correction-Burst Error Correction In its place of sending all the bits in a data unit together we can organize "N
CPU bus It is connect with various components of the system and transformation of data between components. Power Supply It is separate external part of cisco rou
In RIP why we have HOP count of 15?
Q. Show the Error control in TCP? Error control in TCP Detect lost segments, out-of-order segments, corrupted segments and duplicated segments Three tools: chec
QUESTION 1: (a) Define what you understand by the following terms in Network Flows: i) UnDirected Path ii) Directed Path iii) Directed Cycle. iv) Tree In each of the abov
It is one of the models based on PRAM. In this model, the processors access the memory locations concurrently for reading as well as writing operations. In the algorithm, which use
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