Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
11 Cards in this Set
- Front
- Back
|
Link State Algorithm
|
1. All nodes which are connected to the node just added to the tree (excepting any nodes which are already in either the tree or the candidate list) are added to the second (candidate) list.
2. Each node in the candidate list is compared to each of the nodes already in the tree. The candidate node which is closest to any of the nodes already in the tree is itself moved into the tree and attached to the appropriate neighbor node. When a node is moved from the candidate list into the tree, it is removed from the candidate list and is not considered in subsequent iterations of the algorithm. |
|
|
Properties of Link State Algorithm
|
- it requires the source node to know the costs between every pair of adjacent nodes in the graph
- it determines the shortest path from the source node to all other nodes - after the kth iteration, the least-cost paths are known to k nodes |
|
|
Suppose an application generates chunks of 60 bytes of data every second, and each chunk gets encapsulated in a TCP segment and then an IP datagram. What percentage of each datagram will contain application data?
|
60% (20 byte header + 20 byte header + 60 byte data = 100 bytes; 60/100 = 60%)
|
|
|
Consider sending a 1300 byte datagram into a link that has an MTU of 500 bytes. What are the offsets of the fragments created?
|
Three fragments are created with offsets 0, 480 and 960.
|
|
|
The ICMP protocol runs on top of which protocol?
|
Directly on top of IP
|
|
|
In a router, queuing can occur where?
|
in the input ports
in an interconnection network in the output ports |
|
|
Suppose a router has n input ports each with identical line speeds, n output ports each with identical line speeds, and the line speed of an output port is at least n times as that of an input port. Further suppose that the switching fabric speed is at least n times as fast as an input line speed. Then where is there delay?
|
There is no delay.
|
|
|
Suppose one IPv6 router wants to send a datagram to another IPv6 router, but are connected together by intervening IPv4 routers. If the two routers use tunneling, then what happens?
|
The sending IPv6 router creates an IPv6 datagram and puts it in the data filed of an IPv4 datagram.
|
|
|
IPsec can provide what?
|
- Data integrity.
- Origin authentication - Encryption of IP datagram payloads. |
|
|
As part of hierarchical routing, hot-potato routing does what?
|
Chooses the gateway that has the smallest cost.
|
|
|
In a high-performance router, shadow copies of the routing table are kept where?
|
Input ports
|
