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.
Which layer is responsible for negotiating data transfer syntax? Ans) The Presentation layer does the following: Manages data representation conversions, or data transfer syntax
Wide Area Network WAN Wide Area Network ( WANs) connect larger geographic areas such as London the UK or the world. In this types of networks dedicated transoceanic cab
Suppose that frames are 1250 bytes long including 25 bytes of overhead. Also assume that ACK frames are 25 bytes long. Calculate the efficiency of stop-and-wait ARQ (a) Transmits a
Define DNS?
Calculate the Network Address, the broadcast address and the host range, for the following host address i. 192.168.180.94/27 ii. 172.23.8.19 /21 iii. 147.252.238.20 255.255.240.0 b
Give the solutions to the threats In order to implement solutions to the threats, it is advisable that the company should maintain proper password protected hardware. Wherever
MULTICASTING : The answer to above problem is multicasting. It is the normal form of broadcasting. It acts like broadcasting however it does not broadcast frames automatically
Describe the count-to-infinity problem in distance vector
In FLSM subnet mask of all subnets will b same. But in FLSM it changes.
What is the Power Of Semantic Web Languages? Ans) The major power of Semantic Web languages is that anyone can create one, simply by publishing some RDF that defines a set of
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