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.
study on FTP
Explain Difference between broadcast domain and collision domain? Ans) Broadcast Domain Send the packet to all the Present Network IT might be send by the person It mig
Database servers connected as a cluster to the main server There could be three database servers connected as a cluster to the main server to provide better connectivity and se
Token Bus Physical order of stations doesn't matter Line is broadcast medium "Send" token by addressing neighbour Provisions for deleting, adding stations
a) Assume that the time required to transmit one packet (i.e. the packet length divided by link data rate) is 10ms and the Round Trip Time (from Source to Destination and back) is
Hardware difficulty It refers to the price of hardware logic like connectors, wires, switches, arbiter etc. that are required for execution of interconnection network.
Session layer protocols consists of NFS, SQL, RPC, Appletalk Session Protocol (ASP), XWindows, and NetBEUI.
TCP Segment Structure Figure shows the format of the TCP segment. The header consists of a 20 bytes fixed part plus a variable size options fields. The description o
Question: (a) Describe briefly the difference between flow control and congestion control in relation to a connection-oriented protocol such as TCP. (b) What is the initia
In connectionless schema, there is no connection required. The source of data includes destination information in data and transmit to the network. Network transmit each data item
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