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.
Name the two commands that save the running-config to a TFTP server Ans) Two commands are:- a) copy running tftp b) write network
How does the cut-through switching technique work? Ans) Cut-Through switching copies only the destination address which is the first 6 bytes after the =frame preamble into its b
Coaxial Applications & Performance - Analog plus digital phone networks - Cable TV networks - Traditional Ethernet LANs - Power line and Home Networks-phone line -
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
To Distribution System from BSS We require to identify the AP as the first hop to the destination (B) A will receive an ACK from the AP - indicates frame successfully on
Determine about the infrared spectrum (1) The spectrum for infrared is virtually unlimited, which shows the possibility of achieving extremely high data rates. (2) The infra
Algorithm: Odd-Even Transposition //Input: N numbers that are in the unsorted form //Assume that element bi is assigned to pi for I=1 to N { If (I%2 != 0) //i.e Odd
What are the main categories based on which applications of computer network can be categorized? The major areas under which the applications for computer network can be divide
definition
Which layers are user support layers? Three layers are come under user support layer:- a. Session Layer b. Presentation Layer and c. Application Layer
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