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.
File servers are useful for sharing files through a network. With a file server, the client passes requests for file records over network to file server
CYCLE OF BRIDGES: A bridges network can join several segments. One bridge is useded to connect every segment to the rest of the bridge network. This is given in the figure be
Can you describe Active and Passive route?
Wait protocol The wait protocol is used for resolving the conflicts, which arise due to number of multiprocessors demanding the same resource. There are two types of wait prot
• This device creates one big collision domain and one large broadcast domain.
Consider a simple wireless data link using channel bandwidth of 40 kHz. The transmit power level is 20 dBm, the link attenuation is 40 dB and the SNRdB at the receiver is 20 dB.
NETWORK OWNERSHIP: There are two types in this case: 1. Private Network 2. Public Network
Operating system for Server Since 1994, when the original pair of web servers - NCSA HTTPd and CERN HTTPd , were proposed, dozens of commercial and shareware programs have
In spite of the incompatibilities among networks, researchers have devised a function that gives universal service among heterogeneous networks known 'internetworking'. It uses bot
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
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