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 physical layer of Osi reference model? - The physical layer deals among the physical characteristics of the transmission medium. - It defines the mechanical, elec
Q. What is Domain Names ? - Full domain name is a sequence of labels separated by dots (.) - Fully competent domain name (FQDN) contains the full name of a host cis.usouthal
Hi, i am a college student doing a report on wireless broadband. I needed to know user requirements of user groups ie: Home user Small Medium Large Businesses Things like w
Q. Applications of networks? End systems (hosts): - Run application programs - Example email, Web - At -edge of network Client/server model - Client host
implementing cnet sliding window protocol with 6 nodes
Parallel Programming Environment Characteristics The parallel programming environment consists of an debugger, a editor, performance evaluator and programme visualizer for i
What is the meaning of P-persistent If the medium is idle, transmit with probability p, and delay one time unit with probability (1 - p); if the medium is busy, continue to lis
Types of VTs There are several option for payload are actually mapped into the VT. Locked mode VTs bypass the pointers with a fixed byte oriented mapping of limited flexi
what the domain name of 128.252.160.2000
Explain the meaning of bastion host?
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