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.
Can you describe IP protocol?
Systolic Array : This interconnection network is a kind of pipelined array architecture and it's intended for multidimensional flow of data. It is used for applying fixed algorithm
Difference between synchronous tdm and statistical tdm
What is Piggy Backing? A process called piggybacking is used to get better the efficiency of the bidirectional protocols. When a frame is carrying data from A to B, it can also
What is the minimum size of MTU bytes is
What is meant by horizontal scaling and vertical scaling? Ans) Horizontal scaling means adding or removing client workstations with only a small performance impact. Vertical
Question: (a) In relation with a cellular network architecture, describe the following terms: (i) Clusters (ii) Pico cells (iii) Nano cells (iii) Cell breathing (b)
It treats all processors as equivalent. Any processor can do the work of any other processor. Applications are separated into threads that can run simultaneously on any available p
Half-Duplex - Capability for data transmission in only single direction at a time among sending station and a receiving station.
How optimal MTU size is measured
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