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.
An industry standard suite of protocols for the use of point-to-point links to transport multiprotocol datagrams.
Can you describe static and dynamic tunnels?
Network Control protocols ( NCP) The first ARPANET networking protocols was named simply the network control protocols in 1970,and was created by created by network
What is OSPF? It is an Internet routing protocol that scales well, can route traffic with multiple paths, and uses knowledge of an Internet's topology to make precise routing de
Data Transfer After connection is established bidirectional data transfer can take place. The client and server can both send data and acknowledgments. Figure show
Q. How two adjacent layers communicate in a layered network or what do you understand by Service Access Point? Ans: In layered network, each layer has several entities and enti
Q. Show the Traffic profiles? Constant-bit-rate traffic - ADR=PDR No MBS Variable-bit-rate traffic ADR != PDR Small MBS Bursty traffic
How do we diactivate auto-summarization in RIP?
M E T HOD OF CALCULATION It involves counting the number of each part type and multiplying with the generic failure rate of each part. On summing up the product, we obtain t
Can you describe the RPC and Client server Architecture?
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