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.
How many IP addresses can come in IPV4?
A logic gate drives a load, which has a resistance of 1 kÙ and a capacitance of 20 pF. The printed circuit track connecting the gate to its load has an 40 pF capacitance to ground.
Which protocol will send a message to routers if a network outage or congestion happen Ans) Internet Control Message Protocol - ICMP will send a message to routers if a network
Router#
Q. Define the Distance Vector Routing? Distance Vector Routing Every router periodically shares its knowledge about the entire internet with its neighbours Sharing
Fat tree: It is a customized version of tree network. In this network bandwidth of edge (or connecting wire between nodes) increases in the direction of root. It's a more realisti
Fiber Optic Cable A fiber optic cable is made of glass or plastic and transmits signals in the form of light pulses. An optical fiber is a thin flexible medium conducts
DNS Message There are the only two kinds of DNS message DNS query and reply messages. Further mote both query and reply message have the same format as shown in figure.
Normal 0 false false false EN-IN X-NONE X-NONE Application Layer The application layer
What are the Unix-based firewalls The Unix-based firewalls are considered most secured as compared to the Windows NT based ones. The firewalls bind the holes of the operating
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