export_week 8 summary exercises Flashcards

1
Q

The process of moving a datagram from a router’s input port to output port is handled by the ________.

A

Switching fabric

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

The Internet Protocol (IP) implements timing controls.

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What can cause packet queueing at a router’s output port? (Check all that apply)

A
  • Slow outbound link transmission rate.

* Multiple data flows requiring the same outbound link

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Given a router with 5 input ports and 5 output ports. If the switching fabric is 5 times as fast as the input/output line speed, queueing _______ occur at an input port.

A

can

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

The Internet Protocol (IP) header may be 28 bytes long.

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the longest-common-prefix for the following address range?

10011110 10111001 10011100 10000000 – 10011110 10111001 10011101 00000000

A

10011110101110011001110

10011110 10111001 1001110

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

It is the responsibility of a routing algorithm to determine a datagram’s next hop information.

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

In network graph terminology, [a] represent routers.

A

Nodes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

The largest amount of data, in bytes, which can be accomodated by a particilar network, link, or physical-layer is called the [a].

A

Maximum Transmission Unit (MTU)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

It is the responsibility of a routing algorithm to forward packets to the appropriate output link.

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

In network graph terminology, [a] represent costs.

A

Weights

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

The largest amount of data, in bytes, which can be accomodated throughout a datagram’s route from sender to receiver is called the [a].

A

Path Maximum Transmission Unit (Path MTU)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

IP datagrams fragments can not be fragmented again.

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

The transport-layer header is encapsulated in every IP datagram fragment.

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

The “traceroute” application (on Windows) sends UDP messages by default.

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

The “traceroute” application (on Windows) receives ICMP messages.

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

In network graph terminology, a [a] from A to B is the set of edges to traverse to reach B from A for the lowest total cost.

A

Shortest Path

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

NAPT devices translate IP address and port numbers.

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

If an IP datagram is fragmented into 1000-byte fragments, and later encounters a link with an 800-byte MTU, a special procedure (other than standard IP fragmentation) must be used.

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

ICMP can carry messages from… (Check all that apply)

A
  • Router to Sender Host
  • Source Host to Destination Host
  • Destination Host to Source Host
  • Router to Router
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

For a TCP/IP datagram leaving a home network through a NAPT device, which of the following header fields (IP and/or TCP) are altered? (Check all that apply)

A
  • Source Port
  • Source IP Address
  • Header Checksum
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

The “traceroute” application (on Windows) sends ICMP messages by default.

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

It is the responsibility of a routing algorithm to determine the cost of an output link.

A

False

24
Q

The “time to live” field in a modern IPv4 datagram header specifies…

A

the number of remaining hops before the datagram is dropped.

25
Q

Given an internet represented as a weighted undirected graph, the shortest path between node X and node Y is the path that…

A

has the smallest sum of edge weights.

26
Q

The IP header is encapsulated in IP datagram fragments.

A

False

27
Q

The network layer manages communications from ____ to _____.

A
  • host

* host

28
Q

What can cause queueing at a router’s input ports? (Check all that apply)

A
  • Output port contention
  • Slow outbound link transmission rate
  • Head of Line blocking
29
Q

The process of determining a path through the internet is handled by the ________.

A

Routing algorithm

30
Q

A router’s routing table is output by a ______.

A

Routing Algorithm

31
Q

In a datagram network, the responsibilities of the network layer include: (check all that apply).

A
  • Packet forwarding
  • Packet Routing
  • Host-to-Host communication
32
Q

https://s3.amazonaws.com/classconnection/350/flashcards/1550350/jpg/capture-16240DA40793594CEBE.jpg

A

Port 1

33
Q

For a TCP/IP datagram coming into a home network through a NAPT device, which of the following header fields (IP and/or TCP) are altered? (Check all that apply)

A
  • Header Checksum
  • Destination Port
  • Destination IP address
34
Q

The IP header is encapsulated in IP datagram fragments.

A

False

35
Q

The transport-layer header is encapsulated in every IP datagram fragment.

A

False

36
Q

The path MTU is the largest MTU on a path from sender to receiver.

A

False

37
Q

In network graph terminology, [a] represent direct connections between routers.

A

Edges

38
Q

In a fragmented IP datagram, the “offset” IP header field value is exactly equal to the number of bytes of fragmented data preceding this fragment.

A

False

39
Q

ICMP messages are carried within the payload of IP datagrams.

A

True

40
Q

If an IP datagram is fragmented into 1000-byte fragments, and later encounters a link with an 800-byte MTU, it is dropped.

A

False

41
Q

It is the responsibility of a routing algorithm to correlate MAC addresses with IP addresses.

A

False

42
Q

The “Identification” header field is unchanged by IP datagram fragmentation.

A

True

43
Q

IP datagrams fragments can not be fragmented again.

A

False

44
Q

Network address translation alters IP to add new IP addresses.

A

False

45
Q

Network address translation is strictly a Layer-3 protocol.

A

False

46
Q

The “time to live” field in a modern IPv4 datagram header specifies…

A

The “time to live” field in a modern IPv4 datagram header specifies…

47
Q

It is the responsibility of a routing algorithm to determine a datagram’s next hop information.

A

True

48
Q

The “ping” application (on Windows) uses ICMP echo request/reply.

A

True

49
Q

The largest amount of data, in bytes, which can be accomodated throughout a datagram’s route from sender to receiver is called the [a].

A

Path Maximum Transmission Unit (Path MTU)

50
Q

Network address translation has ameliorated the IP address shortage problem.

A

True

51
Q

Re-assembly of fragmented IP datagrams is handled by…

A

The Destination Host

52
Q

For a TCP/IP datagram leaving a home network through a NAPT device, which of the following header fields (IP and/or TCP) are altered? (Check all that apply)

A
  • Header checksum
  • Source IP Address
  • Source Port
53
Q

Select the proper equation for TCP’s calculation of DevRTT.

A

DevRTTn = (1 - b) * DevRTTn-1 + b * (SampleRTTnew - EstimatedRTTn-1)

54
Q

When a destination host’s IP fragment timer expires, it drops all accumulated fragments corresponding to that timer.

A

True

55
Q

The transport-layer header is encapsulated in the first fragmented IP datagram.

A

True

56
Q

The “traceroute” application (on Windows) receives ICMP messages.

A

False

57
Q

It is the responsibility of a routing algorithm to find a datagram’s path through a network.

A

True