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. Focus of Reliability Control? - Implementation of the OSI model puts emphasis on providing a reliable data transfer service while the TCP/IP model treats reliability as an e
OBJECTIVES After reading this unit, you should be able to: Describe the basics of parallel programming; Explain the parallel programming based on message passing;
(i) Suppose N stations are connected to an extended Ethernet LAN, as shown below shown in Figure operating at the rate of 10 Mbps. Assume that the efficiency of each Ethernet is 8
Mesh : This is two dimensional networks. In this all processing elements are organised in a two dimensional grid. The processor in the row i and column j are indicated by PE i .
FRAME FILTERING: The very important task a bridge operates is frame filtering. If both the destination and source are on the same segment, it does not repeat the frame to the
What is the major issue with hop count metric issue
Can you define the concept of BGP confederations?
Fixed version of rdt 2.0 rdt 2.1 The rdt 2.1 sender and receiver FSM each now have twice as many states as before. This is because the protocols state must now refle
State about the Cell sectoring With cell sectoring, a cell is separated into a number of wedge-shaped sectors, each with its own set of channels, typically 3 or 6 sectors per c
Describe the functions and significances of all fields (such as Source Port and Destination Port) of a TCP header. Functions and significance of tcp header's fields FIELDS
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