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.
Retransmission of packets The disadvantage of thronging away a correctly received packet is that the subsequent retransmission of the packet might be lost or garbled and
TP Monitor does mainly two things extremely well. They are Process management and Transaction management? They were originally introduced to run classes of applications that co
Q. Illustrate TCP – bytes and segments? TCP - bytes & segments TCP at the sending site collects bytes into a packet called a segment TCP adds a header to each se
Q. Illustrate Error Detection-Simple Parity Check? Error Detection-Simple Parity Check A redundant bit called as Parity Bit? is added to every data unit. Even Pa
Determine the term- Cyberspace The conceptual or virtual area where pages, data, images, and all the rest are stored. It is the area from where requests are accepted and ful
CAM- Content Address Memory. Its another name of MAC address table.
What are the different types of network topologies
Introduction An algorithm is defined as a series of computational steps required to accomplish an exact task. The algorithm works for a given input and will terminate in a well
There are three building blocks of client/server a) The client b) The server and c) Middleware.
What is CRC The CRC is computed while transmission and appended to output stream as soon as last bit goes out onto wire. If the CRC were in header, it will be necessary to make
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