[Skip Breadcrumb Navigation]
:
[Skip Breadcrumb Navigation]
Home
Student Resources
Self-Assessment Quizzes
Chapter 4 MC
Chapter 4 MC
This activity contains 12 questions.
The link-state algorithm in Section 4.5 has the following properties:
it requires the source node to know the costs between every pair of adjacent nodes in the graph
after the
k
th iteration, the least-cost paths are known to
k
nodes
it determines the shortest path from the source node to all other nodes
all of the above
Suppose that c(E,F) = 6 instead of 2 in Figure 4.27. Then the link state algorithm finds the shortest path to F in
step 5
step 6
step 3
step 4
In routing among ASs, which of the following issues dominants:
current congestion levels in the ASs
policy
number of ASs traversed
geographical distance between ASs
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.
80%
20%
40%
60%
Consider sending a 1300 byte datagram into a link that has an MTU of 500 bytes.
Three fragments are created with offsets 0, 480 and 960.
Three fragments are created with offsets 0, 500 1000
Three fragments are created, with offsets 0, 460 and 920.
None of the above
The ICMP protocol
runs on top of UDP
runs on top of TCP
runs directly on top of IP
none of the above
In a router, queuing can occur
in the input ports
in an interconnection network
in the output ports
all of the above
In a high-performance router, shadow copies of the routing table are kept in
the switching fabric
the output ports
the input ports
all of the above
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
queuing can occur in an input port
queuing can occur in an output port
queuing can occur in the switching fabric
there is no queuing delay in the router
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
The sending IPv6 router creates an IPv6 datagram and puts it in the data filed of an IPv4 datagram.
The sending IPv6 router creates an IPv4 datagram and puts it in the data field of an Ipv6 datagram.
The sending IPv6 router one or more IPv6 fragments, none of which is larger than the maximum size of an IPv4 datagram.
None of the above
IPsec can provide:
Origin authentication
Data integrity.
Encryption of IP datagram payloads.
All of the above.
As part of hierarchical routing, hot-potato routing does the following:
Chooses the gateway that has the smallest cost.
Provides information to a router about the existence of external networks.
Labels suspicious packets as “hot”.
Determines the number of ASes in the shortest AS path from router to destination.
The Submit Answers for Grading feature requires scripting to function. Your browser either does not support scripting or you have turned scripting off.
So, the Submit Answers for Grading button below will not work.
The following Submit Answers for Grading button is provided in its place and will clear your answers:
The Clear Answers and Start Over feature requires scripting to function. Your browser either does not support scripting or you have turned scripting off.
So, the Clear Answers and Start Over button below will not work.
The following Clear Answers button is provided in its place and will clear your answers:
Your browser either does not support scripting or you have turned scripting off. Because of this, the answer choices will NOT appear in a different order each time the page is loaded, though that is mentioned below. Note that you do not need this feature to use this site.
Answer choices in this exercise appear in a different order each time the page
is loaded.
Copyright © 1995 - 2012
Pearson Education
. All rights reserved. Pearson Addison Wesley is an imprint of
Pearson
.
Legal Notice
|
Privacy Policy
|
Permissions
[Return to the Top of this Page]
: [Return to the Top of this Page]