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.
Describe how EIGRP finds its successor and feasible successor?
What is Ring Topology? The physical ring topology is a circular loop of point-to-point links. Every device connects directly to the ring or indirectly by and interface device o
Post Office Protocols Version In computing the post office protocol version 3 (POP3) is an application layer internet standard protocols used by local e mail clients
how can i learn it?
Question 1 Discuss the architecture of new generation networks. Question 2 Explain the functioning of datagram packet switching and virtual circuit packet switching Quest
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
Question Approximately what is the low frequency cut-off of the band-pass filter shown in the figure?
Receive Window This field defines the size of the window in bytes that the other party must maintain. Note that the length of this field 16 bits which means
Router(config-if)# no cdp enable is the command to disable CDP on an interface
Explain about star topology This topology, obviously, needs a great deal of cabling. This design gives an excellent platform for reconfiguration and trouble-shooting. Changes t
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