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.
Floating Point Representation in Memory 1. Describe the various ways of floating point representation in memory. What is the importance of normalizing the mantissa in this rep
Q. Illustrate User Agent Services? User Agent (UA) Services - Provide template for user to compose a message - Reads incoming messages - Allows a user to reply to m
Recalling two FEC schemes for internet phone described. Suppose the first scheme generates a redundant chunk for every four original chunks. Suppose the second scheme uses a low-ra
how to security net
The Common method for writing a program with PVM is as follows: A user writes one or more sequential programs in C, C++, or Fortran 77 having embedded PVM function (or subroutin
Computer Networks 1. Differentiate WAN and LAN. 2. Describe the TCP/IP Reference Model with diagram. 3. Explain Circuit switching and message switching. 4. List the fu
Q. Show the Parity Check - Performance? Parity Check - Performance Is able to detect all single-bit errors Can as well detect burst errors if the total number of
graph theory
what is compurter network and types, topology, communication media
Session layer examples are Netbios Names, SQL, NFS, X Windows, and RPC
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