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.
Can you define what is classful IP addressing?
Question Which elementary logic gate is equivalent to this circuit? Show your working.
Diiferentiate between HTML and HTTP Hypertext Markup Language (HTML) The language used in writing pages for the World Wide Web. Knowledge of not HTML is not necessary f
What is the importance of Encryption on a network? Encryption is the process of translating information into a code that is unreadable by the user. It is then translated back o
Sharing information To understand how distance vector routing works examine the internet shown in the clouds represents local area network . the number inside each c
Enumerate about the server modules WebDAV is one of the best-used server modules and many companies developing Intranet software or groupware as well as various publishing and
What is a computer network? Computer Network is a collection of distributed intelligent devices that are connected with each other with transmission media for the purpose of da
Q. What is Manchester? - Utilizes an inversion at the middle of each bit interval for both synchronization and bit representation - Negative-to-positive represents binary 1
Multiplexing Multiplexing is the set of techniques that allows simultaneous transmission of multiple signals across a single data like. It is methods for efficient utiliza
Connectionless Multiplexing and De multiplexing Java program running in a host can create a UDP socket with the line Datagram's socket my socket = new datagram's socket
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