Network Layer Routing & Transport Layer Flashcards

1
Q

goal of the network layer

A

deliver a datagram from its source to its
destination

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

the way a packet is delivered to the next station

A

Forwarding

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

process of selecting a path for traffic in a network or across multiple
networks

A

Routing

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

if a datagram is destined for only one destination

A

Unicast Routing

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

if a datagram is destined for several destinations

A

Multicast Routing

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

A packet is routed, hop by hop, from its source to its destination by the help of

A

forwarding tables

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

The source router chooses a route to the destination router in such a way that the total cost for the route is the least cost among all possible routes

A

Least Cost Routing

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

Routing Algorithms

A

Distance-Vector Routing
Link-State Routing
Path-Vector Routing

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

Each node maintains a vector (table) of minimum distances to every node

A

Distance-Vector Routing

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

This method uses the term link-state to define the characteristic of a link (edge) that
represents a network in the internet

A

Link-State Routing

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

The collection of states for all links is called the

A

link-state database (LSDB)

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

To create a least-cost tree, each node needs a complete map of the network (using

A

Dijkstra’s Algorithm)

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

The best path is determined by the source using the policy it imposes on the route, i.e.
the source controls the path

A

Path-Vector Routing

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

In Path-Vector Routing, the path is also determined by the

A

best spanning tree.

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

responsible for the delivery of a message from one process
to another

A

transport layer

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

An application program on the local host,

A

client,

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

an application program on the remote host (provides services)

A

server

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

16-bit integers between 0 and 65,535

A

Port Number

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

Client program defines itself with a port number chosen randomly by the transport layer software running in the client host

A

(ephemeral port number),

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

Servers use universal port numbers

A

(well-known port number)

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

Well-known ports ranging from

A

0 to 1023

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

Well-known ports are assigned and controlled
by the (ICANN)

A

Internet Corporation for Assigned Names and Numbers

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

Registered ports – ports ranging from:
They can only be registered to prevent duplication. (not assigned by ICANN)

A

1024 to 49,151

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

ports ranging from 49,152 to 65,535 and are neither controlled nor registered. They can be used by any process

A

Dynamic (or private) ports

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
In UNIX, the well-known ports are stored in a file called
/etc/services
26
IP address + port number
Socket address
27
Connectionless, unreliable transport protocol
User Datagram Protocol (UDP)
28
Does not add anything to IP except provide process-to-process communication
User Datagram Protocol (UDP)
29
Simple protocol using minimum overhead
User Datagram Protocol (UDP)
30
UDP Datagram (composed of?)
header - 8 bytes Source port number - 16 bits Dest port number - 16 bits Length - 16 bits (total length, header + data) Checksum -16 bits
31
used to detect errors over the entire user datagram
Checksum
32
In a UDP header, source port number is the
1st 4 hexadecimal digits
33
In a UDP header, dest port number is the
2nd 4 hexadecimal digits
34
In a UDP header, total length is the
3rd 4 hexadecimal digits
34
In a UDP header, how to get the length of data?
Length of whole packet - length of header (8 bits)
34
If destination port number is a well-known port, the packet is from the...
client to a server
35
port 7
echo
36
port 9
discard
37
port 11
users
38
port 13
daytime
39
Suitable for a process that requires simple request-response communication
UDP
40
Connection-oriented, reliable transport protocol
Transmission Control Protocol (TCP)
41
allows the sending process to deliver data as a stream of bytes and allows the receiving process to obtain data as stream of bytes
Transmission Control Protocol (TCP)
42
RFC 768
User Datagram Protocol (UDP)
43
RFC 793
Transmission Control Protocol (TCP)
44
TCP numbers all data bytes that are transmitted in a connection.
Byte number
45
TCP assigns a ________ to each segment that is being sent.
sequence number
46
When a connection is established, both parties can send and receive data at the same time. Each party uses an __________ to confirm the bytes it has received
acknowledgment number
47
receiver of data controls the amount of data that are to be sent by the sender
Flow control
48
to provide reliable service, TCP implements an error control mechanism
Error control
49
amount of data sent by the sender is not only controlled by the receiver, but is also determined by the level of congestion in the network
Congestion control
50
32-bit field that defines the number assigned to the first byte of data contained in the segment.
Sequence number
51
During connection establishment, each party uses a random number generator to create an...
initial sequence number (ISN)
52
32-bit field that defines the byte number that the receiver of the segment is expecting to receive from the other party
Acknowledgment number
53
4-bit field indicates the number of the 4-byte word in the TCP header
Header length
54
6-bit field for future use
Reserved
55
6 different control bits or flags
Control
56
16-bit field that defines the size of the window, in bytes, that the other party must maintain. Normally referred to as the receiving window
Window size
57
Inclusion of the checksum in TCP is mandatory while it is optional in UDP
Checksum
58
16-bit field that defines the number that must be added to the sequence number to obtain the number of the last urgent byte in the data section of the segment
Urgent pointer
59
establishes a virtual path between the source and destination
TCP
60
TCP requires 3 phases:
Connection establishment Data transfer Connection termination
61
Process starts with the server where it tells its TCP that it is ready to start a connection
passive open
62
A client that wishes to connect to an open server tells it TCP that it needs to be connected to that particular server
(active open)
63
both process issue an active open. Both TCP transmit a SYN + ACK segment to each other, and one single connection is established between them
(simultaneous open)
64
The sending TCP must not wait for the window to be filled, it must create a segment and send it immediately
Pushing Data
65
Malicious attacker sends a large number of SYN segments to a server, pretending that each of them is coming from different clients by faking the source IP address in the datagrams
SYN flooding attack
66
the sending application program wants a piece of data to be read out of order by the receiving application program
Urgent Data
67
segment cannot carry data, but it does consume one sequence number
SYN+ACK
68
segment, if carrying no data, consumes no sequence number
ACK
69
segment consumes one sequence number if it does not carry data
FIN
70
New reliable, message-oriented transport layer protocol It has also congestion control and flow control mechanisms
Stream Control Transmission Protocol
71
Preserves the message boundaries and at the same time detects lost data, duplicate data and out-of-order data
Stream Control Transmission Protocol
72
RFC 4960
Stream Control Transmission Protocol
73
SCTP Services: (2)
Multiple Streams Multihoming
74
In TCP, each connection between client and server involves a single stream, a loss at any point in the stream blocks the delivery of the rest of the data
Multiple Streams
75
A TCP connection involves 1 source and 1 destination IP address, even if the sender or receiver is multihomed (connected to more than 1 physical address with multiple IP address), only one of these IP addresses per end can be used
Multihoming
76
unit of data in SCTP is a data chunk. Data transfer is controlled by numbering the data chunk using TSN
Transmission Sequence Number (TSN):
77
each stream in SCTP needs to be identified
Stream Identifier (SI)
78
SCTP defines each data chunk in each stream. When a data chunk arrives at the destination, it is delivered to the appropriate stream and in the proper order
Stream Sequence Number (SSN)
79
data are carried as data chunks, control information is carried as control chunks. Several control chunks and data chunks can be packed together in a packet
Packets
80
number that matches a packet to an association. It serves as an identifier for the association and is repeated in every packet during the association
Verification tag
81
32-bit field contains a CRC-32 checksum
Checksum