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.
Q. Unshielded Twisted Pair - transmission media? - A most common kind suitable for both voice and data transmission - Categories are determined by chain quality - Cat 3 c
Can you describe PPP packet format?
Error Detection-- CRC Powerful error detection system Rather than addition, binary division is utilized A series of redundant bits called "CRC" or else "CRC remai
Define Routing? The process of determining systematically hoe to forward messages toward the destination nodes based on its address is known as routing.
Q. Explain the Bit-Level Encryption? Bit-Level Encryption - Data is divided into blocks of bits then altered by encoding/decoding, permutation, substitution, exclusive OR
Explain about the Database Management Intranet This type of Intranet provides everyone in an organisation with the capability to maintain a "real-time" interactive database.
In quantum computing, we use the method of qubits, superposition and coherence. A normal bit can be in only two states - 0 and 1. But a qubit it can be in 0, 1, or in the superposi
100Base-TX Uses two category 5 UTP cable pairs or else two STP cable pairs to connect stations to a hub (star) One pair holds frames from station to hub one pair from
Error Detecting Code - Parity bit: The general idea for achieving error detection and correction is to add some redundancy (i.e., some extra data) to a message, which receiver
Question : a) Describe the following core components of a cellular based network: i) Cell ii) MSC iii) HLR & VLR iv) PSTN b) Explain why frequency reuse is consi
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