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.
Router(config-if)# bandwidth 56
Question: (a) Describe the following biometric techniques:- (i) Retina scan, (ii) Fingerprint, (iii) Iris Scan. Your answer should consider the following: the data storage requ
There are two logical addressing :- a) Datalink is physical (hardware) addressing. b) Network is logical (software) addressing.
do you do paraphrase
Q. What is Subnetting ? Subnetting IP addressing is hierarchical First reach a device through its network id (netid) Then reach the host itself using the se
What are the different types of network topologies
what is logical ring maintenance and how does it work>?
QUESTION Write a report to explain the concept of LAN and WAN including the various components of the telecommunication infrastructure required by UTM Ltd. You are required to
First, split the given series of n numbers into two parts, each consisting of n/2 numbers. After that, recursively split the series into two parts until each number acts as an inde
State in brief about the Graceful degradation With FDMA or TDMA, a fixed number of users can concurrently access the system. Though, with CDMA, as more user concurrently access
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