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.
Can you describe what a FIREWALL is?
Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4
Define Encoder? A device or program that uses predefined algorithms to encode, or compress audio or video data for storage or transmission use. A circuit that is used to change
QUESTION a) Security is a very crucial component in a Distributed System. Describe three properties of a secure channel. b) During packet transmission, messages are subdivid
Length This is a 16 bit field that defines the total length of the user datagram, header plus data. This 16 bit can define a total length of a 0 to 65, 535 bytes.
Round Trip Time (RTT) and Time Out The size and the complexity of computer networks have grown in past years. To achieve an efficient and reliable transmission some
802.11 FHSS Frequency-hopping spread spectrum in a 2.4 GHz band Carrier sends on one frequency for short duration then hops to another frequency for same duration, hops agai
Question: a) Show the shortest form of the following IPv6 address: 2340:0000:0000:000F:7000:119A:A001:0000 b) The IPv6 header includes a Class field and a Flow ID field. Bri
Can you describe the concept of NAT
Q. Explain about Virtual Circuit Switching? Virtual Circuit Switching - All packets belong to a message (or) session is preserved. - Single route is selected between s
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