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.
In a network that contains two servers and twenty workstations, where is the best place to install an Anti-virus program? An anti-virus program must be installed on all servers
Can you define how L2F data tunneling process works?
Determine the working of Communications Intranet Intranets of this type tend to feature in geographically dispersed organisations. The motivation for its implementation is g
Q. Show the Distribution of Name Space? Distribution of Name Space --Information for domain name space must be stored on multiple servers (DNS servers) to be efficient
Explain Peer-to-Peer Networking Model. A networking model where every workstation has equivalent capabilities and responsibilities is called as peer-to-peer model. There is no
Q. What is Two Types of Errors? Single-Bit Errors: Merely one bit in the data unit has changed Burst Errors of length 'n': 2 or more bits in the data unit have changed (
What are short, long and medium-term scheduling? Long term scheduler verifies which programs are admitted to the system for processing. It controls the degree of multiprogrammi
DNS in the Internet -Domain name space is split into three sections: country, generic and inverse -Generic domains define hosts by generic behavior -Country domains are
Define the concept of one way redistribution and mutual
Tree topology Comments 1 - This features star nodes on a bus network 2 - All the disadvantages and advantages of both types of networks described above apply to this s
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