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 collective message passing, all the processes of a set participate in communication. MPI gives a number of functions to execute the collective message passing. Some of them are
Triggers are special user defined actions usually in the form of stored procedures, that are automatically requested by the server based on data related events. It can perform diff
What the Semantic Web is? Ans) The Semantic Web is a vision, that thinks to join together dispersed bits of data on the internet, very much like web pages are presently joined
What metrics are used by routing protocols to verify the best path?
What are the different kinds of host in multicasting?
Q. Explain the types of Security Threats? (a) Normal Flow (b) Interruption: An asset of a system develops into unavailable or unusable. (c) Interception: A few unaut
User Datagram Protocol - UDP is a connectionless oriented transport protocol for use when the upper layers give error-recovery and reliability. UDP does not series data or re-assem
If a client gives a 4096-byte request to a server located 50 km away on a 1 Gbps fiber optic, then what is the efficiency of the line during this time? Suppose that the server give
Multi Tasking Environment Multi tasking exploits parallelism by: 1) Concurrently using the multiple functional units 2) Pipelining functional units are pipe line toget
What does the following sequence of commands accomplish? router igrp 71 network 10.0.0.0 router igrp 109 network 172.68.7.0 Ans) It isolates network 10.0.0.0 and 172.68.7.0 and
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