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.
THIN ETHERNET WIRING: Thin Ethernet needs thin coax cable that is cost effective and easier to install than thick Ethernet coax. In this case transceiver electronics are creat
DLCI- Data Link Connection Identifier. A frame-relay service provider usually assigns DLCI values that are used by frame-relay to distinguish among different virtual circuits on th
discuss the concept of redundancy in error detection and correction
Recognize the command to show the status of the Frame Relay virtual circuit Ans) Router# show frame-relay pvc
Define RIP protocol?
Q. Explain about Horn Antenna? - Outgoing transmissions broadcast by a stem and deflected outward - Received transmissions collect by a scooped part of the horn and deflecte
Q. Explain the diffrent types of Security Attacks? Types of Security Attacks Passive Threats: - Traffic Analysis and - Release of Message Contents Active
Factor Causing Parallel Overheads Figure clearly explains that the performance metrics are not able to achieve a linear curve in comparison to the enhance in number of process
SONET Frame Can be viewed as a matrix of nine rows of 90 octets every for a total of 810 octets. A few used for control they aren't positioned at the beginning or end of the
TCP Connections TCP is an end to end point to point transport used in internet. being a point to point protocols means that there is always s single sender a single
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