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.
CONNECTION MULTIPLEXING: In various circumstances transceiver can be in convenient e.g. workstations in a LAN. Connection multiplexer acts multiple computers to a single tran
Receipt of Acknowledgment In our GBN protocols an acknowledgment for packet with sequence number will be taken to be accumulative acknowledgment indicating that all packe
The application layer This layer enables users to access the network by providing a few services to the user some of the protocols and services available to the user ar
graph theory
Q. Describe about Domain Name Space ? - Structure for systematize the name space in which names are defined in an inverted-tree structure with the root at the top - Every l
What is the minimum size of MTU bytes is
Q. Show the TCP/IP and OSI Similarities? TCP/IP and OSI Similarities - Both have Layers - Both have Application Layers - Have Comparable Transport and Network Layer
Lat take the CONNECT (client side), LISTEN, and ACCEPT (server side) socket primitives a) Why are these three needed for a TCP connection? b) Why are none of them needed for a U
what is the differnce between noise and distortion
Define about the term - hackers Every time technology updates itself, new techniques evolve. At the same time thieves or intruders (in the information technology line, they are
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