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.
You are designing a network for a retail customer; they plan to have 5 locations initially with the main store acting as the warehousing depot. Within the next year they are plann
Categories of traditional Ethernet a) Baseband - digital signals using Manchester encoding b) 10Base2, 10-Base-T, 10Base5, 10Base-FL c) First number signifies data rate
hi. this is 700 words assignment..how much charges will be for this..?
As in PRAM, there was no direct communication medium among the processors, therefore another model called as interconnection networks have been designed. In the interconnection net
List the Advantages of microwaves. a. They need no right of way acquisition among towers. b. They can carry high quantities of information because of their high operating f
DLCI- Data Link Connection Identifier. A frame-relay service provider usually assigns DLCI values that are used by frame-relay to distinguish among different virtual circuits on th
Local information is immediate hop routing table and distance from every switch. The switches regularly broadcast topology information i.e. distance, destination. Other switches mo
(i) Suppose that frames are 1250 bytes long including 25 bytes of overhead. Also assume that ACK frames are 25 bytes long. a) Calculate the efficiency of stop-and-wait ARQ in
how can I establish a home net work by using cables and wieless
Q. Define V - 32 modem? - ITU-T's V.32 standard was issued in 1989 for asynchronous and full-duplex operation at 9600 bps. - Even though designed for asynchronous DTEs two
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