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 Full Duplex data transmission? - Have two separate Communication channels as well as use each one for simplex Data traffic (in different directions). - If this is
I Have an exam Questions and i would like it to be answered. Thanks
Identify the purpose of the TCP three step handshakes Ans) The three step handshake establishes the parameters needed for a TCP connection. During the handshake process series n
Concept Of Permutation Network In permutation interconnection networks the information replace requires data transfer from input set of nodes to output set of nodes and likely
In point-to-point message passing, single process sends/receives message to/from another process. There are four communication modes for sending a message: i) Buffered mode
i want to make the assignment from you
What is the difference among flow control and error control? Ans) Flow control: adjust and confirm data flow rate for successful transmission. Error Control: a method to
Carrier Sense Multiple Access/Collision Avoidance a) Necessary since wireless LANs cannot implement CSMA/CD b) Collision detection requires increased bandwidth requirements
Reliable data transfer over a perfectly reliable channel rdt 1.0 First all consider the simplest care in which the underlying channel perfectly reliable. The protoco
bus topology disadvantage?
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