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.
What is the Frame relay, in which layer it comes? Ans) Frame relay is an industry standard, shared access, switched Data Link Layer encapsulation that services many virtual circ
What is data encapsulation? Data encapsulation is the method of breaking down information into smaller manageable chunks before it is transferred across the network. It is also
Describe packet filtering firewall?
MIME The Multipurpose Internet Mail Extensions While the message headers described in are satisfactory for sending ordinary ASCII text they are not sufficiently Reich for
Why do we require to subtract two from number of hosts?
write on everything on telecommunication
Network Allocation Vector Timer which shows how much time must pass before a station is allowed to check the channel
What is Groupware Groupware are a collection of software tools that encompass a broad range of applications. Even though groupware broadly consists of applications like calend
Q. Why we use numbering frames? Why numbering frames? Stop--and-wait ARQ, 1. Numbering Frames prevents the retaining of duplicate frames.. 2. Numbered acknowled
After studying this part the students will be able to understand about the following: Analysis of Parallel Algorithms; Different Models of Computation; o Interco
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