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.
Recognize the command that shows traffic statistics on serial0/1? Ans) show interface serial 0/1
Fully connected : It is the most powerful interconnection topology. In this every node is directly associated to all other nodes. The limitation of this network is that it needs t
Acknowledgment number This 32 bit field defines the byte number that the from the segment is expecting to receive the segment is expecting to receive from the other par
What is source route and OSPF? Source route It is a series of IP addresses identifying the route a datagram must follow. A source route might optionally be included in an
Explain in dteail about the intranet The first Web browser was called Mosaic, and the HTML concept, although not a new one, has accelerated data access and research. In short,
Hierarchy of DNS Servers DNS uses a large number of server organized in hierarchical fashion and distribution around the world. No single DNS server has all of the mappin
Elaborate the term - Database Connectivity Basic connectivity A number of database management systems are available today such as the Oracle, Sybase, Ingres, etc. Most
Session layer examples are Netbios Names, SQL, NFS, X Windows, and RPC
Q Illustrate Unipolar line coding? - Simplest method is inexpensive - Utilizes only one voltage level - Polarity is habitually assigned to binary 1 a 0 is represented by
Can you define VPN tunneled packet in detail?
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