forked from joelbcastillo/NYU
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Chapter_4_questions
77 lines (76 loc) · 6.02 KB
/
Chapter_4_questions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
1. With a virtual-circuit network layer, packet switches are involved in virtual circuit setup, and each packet switch it aware of the VCs passing through it.\n T/F
T
2. With a datagram network layer, each packet carries the address of the destination host.\n T/F
T
3. In a distance-vector routing algorithm, each node has a map of the entire network and determines the shortest path from itself to all other nodes in the network.\n T/F
T
4. In the BGP routing algorithm, each AS advertises to its neighbors its estimates of the shortest distances from the AS to all possible destination ASs.\n T/F
F
5. OSPF uses BGP for routing among areas.\n T/F
F
6. Every autonomous system must use the same intra-autonomous system routing algorithm.\n T/F
F
7. Suppose the computer in your office has been configured with an IP address, and you move (along with your computer) to an office down the hall. If after the move your computer is connected to the same IP network, then it is not necessary to reconfigure the IP address in your computer.\n T/F
T
8. Single-homed hosts have one interface and routers typically have two or more interfaces.\n T/F
T
9. A gateway router must run both an intra-AS routing algorithm and an inter-AS routing algorithm.\n T/F
T
10. The network portion of an IP address is the same for all the hosts on the same IP network.\n T/F
T
11. NAT is known as a 'plug-n-play' or 'zero-conf' protocol\n T/F
F
12. Which of the following are properties of link-state algorithms.\nA. after the kth iteration, the least cost paths are known to k nodes\nB. It requires the source node to know the costs between every pair of adjacent nodes in the graph.\nC. It determines the shortest path from the source node to all other nodes.\nD. All of the above
D
13. In routing among AS's, which of the following issues are dominant\nA. Number of AS's traversed\nB. policy\nC. Current congestion levels\nD. Geographical distance between AS's
B
14. An application generates a 60 byte packet. This chunk is then sent to the transport layer and then the network layer. At this point, what percentage of the bytes in the datagram are the original application data?\nA. 20%\nB. 60%\nC. 80%\nD. 40%
B
15. The maximum amount of data that a _______ layer frame can carry is called Maximum Transmission Unit or MTU.\nA. Network\nB. Physical\nC. Link\nD. Application
C
16.According to the classful IP addressing schema, which of the following IP address belongs to the class-B IP address range\nA. 126.66.254.30\nB. 201.42.64.34\nC. 156.11.24.111\nD. 194.88.34.22
C
17. The role of a routing table is to _______\nA. transfer a packet from input link of a router to the appropriate outgoing link of a router\nB. determine the end-to-end path that packet takes from source to destination\nC. make sure all packets have arrived in correct sequence\nD. none of the above options
B
18. The ICMP protocol\nA. runs on top of UDP\nB. runs on top of IP\nC. runs on top of TCP\nD. none of the above
B
19. In a router, queuing can occur\nA. In the switching medium\nB. In the output ports\nC. In the input ports\nD. Both B and C
D
20. Which of the following switching mediums allow more than one packets to be forwarded from an input port to their appropriate output port\nA. Switching via Memory\nB. Switching via a bus\nC. Switching via a crossbar\nD. Switching via multiplexing
C
21. IPv4 and IPv6 addresses have \nA. 32 and 128 bit lengths respectively\nB. 24 and 64 bit lengths respectively\nC. /32 and /128 bit lengths respectively\nD. /24 and /64 bit lengths respectively
A
EOF
Intro
A. Data Plane\nB. Control Plane\nC. Forwarding\nD. Routing\nE. Routing Algorithm\nF. Forwarding Table\nG. Software-Defined Networking (SDN)\n
Network-wide process that determines the end-to-end paths that packets take from source to destination
D
The network-wide logic that controls how a datagram is routed among routers along an end to end path from the source host to the destination host
B
A router forwards a packet by examining one or more value in the arriving packet's header and then using these header values to index into its _______________. The value stored in the _________________ for those values indicates the outgoing link interface at that router to which that packet is to be forwarded.
F
The router-local action of transferring a packet from an input link interface to the appropriate output link interface.
C
The Per-Rounter functions in the network layer that determine how a datagram arriving on one of a router's input links if forwarded to one of that router's output links.
A
The controller that computed forwarding tables and interacts with routers is implemented in software. The routing device perfoms forwarding only, while the remote controller computes and distributes forwarding tables.
G
An algorithm which calculates the path taken by packets from sender to receiver. Implemented in the control plane of the network layer.
E
Network Layer Service Model
A. Network service model\nB. Guarenteed delivery\nC. Guaranteed delivery with bounded delay\nD. In-order packet delivery\nE. Guaranteed minimal bandwidth\nF. Security (as a network layer service)\nG. Best-effort Service
This service not only guarantees delivery of the packet. but delivery within a specified host-to-host delay bound
C
The network layer could encrypt all datagrams at the source and decrypt them at the destination, providing confidentiality to all transport-layer segments
F
packets are neither guaranteed to be received in the order which they were sent, nor is their eventual delivery even guaranteed.
G
This service guarantees that packets arrive at the destination in the order that they were sent
D
This service guarantees that a packet sent by a source host will enventually arrice at the destination host
B
Defines the characteristics of end-to-end delivery of packets between sending and reveiving hosts
A
This service emulates the behavior of a transmission link of a specified bit rate between sending and reveiving hosts. As long as the sending hosts transmits bits at a rate below the specified bit rate, than all packets are eventually delivered to the destination host
E
EOF