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.
what is a WAN
Define Retransmission? Retransmission is a process in which the receiver detects the occurrence of an error and asks the sender to resend the message. Resending is repeated unt
Broadcast and Multicast : Broadcast and Multicast :In the broadcast interconnection network, at one time one node transfer the data and all other nodes get that data. Broadca
Encoding Process c= uG u: binary data sequence of length 4( input) G: Generator matrix which is 7*4 c: Codeword D
network design for company
Can you explain the different layers in OSI model?
System Deadlock A deadlock refers to the situation when simultaneous processes are holding resources and preventing each other from completing their implementation. The fol
(a ) Std "A" 16.4 m C-BAND EARTH STATION (1996) This is the main system of this station and provides connectivity to most of the countries through dedicated transponder channe
Q. Illustrate Go Back - N protocol? Go Back - N - Sender window size - Receiver window size = 1 - Why the names go back- N? - When the frame is spoilt the sende
Explain how Tracert actually work?
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