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.
Question : (a) List down and explain the different signal propagation behaviours that radio waves exhibit. (b) Explain the term Delay Spread with reference to signal propaga
What is Single-mode fiber Single-mode fiber is competent of higher bandwidth and greater cable run distances than multi-mode fiber. For the reason that of these characterist
Q. Define V - 32 modem? - ITU-T's V.32 standard was issued in 1989 for asynchronous and full-duplex operation at 9600 bps. - Even though designed for asynchronous DTEs two
Q. Explain about Traditional Modems? - Subsequent to modulation by the modem an analog signal reaches the telephone company switching station where it sampled and digitized to
explaination of framing in datalink layer .
Simple Mail Transfer Protocols (SMTP) The application layer protocols for electronic mail is SMTP( Simple mail transfer protocols). Internet electronic mail has man
Types of Redundancy Checks Parity Check Simple Parity Check Two Dimensional Parity Check / Longitudinal Redundancy Check (LRC) CRC (Cyclic Redundancy Check)
Selective Repeat ARQ - Processing at the receiver additionally complex - The window size is reduced to 2(m-1) (2m/2 at most) - Both the transmitter as well as the receiv
Q. Explain Types of Redundancy Checks? Parity Check Simple Parity Check Two Dimensional Parity Check / Longitudinal Redundancy Check (LRC) CRC (Cyclic Redund
what is gateway?
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