Module 2: Performance in Real-time Networks Flashcards

1
Q

Where all possible places where failures can happen in a network?

A

disk errors
incorrect software
hardware issues

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

solution space for such errors:

A
  1. hop by bop reliability
  2. end to end reliability

*implementing reliability at lower layers is insufficient

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

which reliability method does IP use?

A

end to end reliability
not as complex, too expensive to make every hop reliable by checking checksums

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

checksum

A

A checksum is a small-sized block of data for the purpose of detecting errors that may be introduced during its transmission. Checksum could be computed using different functions, such as the hash function at one side and then the original data along with the checksum value is transmitted onto the other side. The receiver, with the knowledge of the function over which checksum is computed, can recompute the checksum using the function and the data it receives and check that they match. If they match, there is a very high probability that the data has not been accidentally altered or corrupted during the transmission. Otherwise, there is some corruption.

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

IP Layer uses system call API for TCP and UDP, which is exposed to the application

A

end-to-end reliability

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

When does it make sense to violate end to end principle?

A

Sometimes solution 1 is better and sometimes solution 2 makes more sense. Let’s consider an example of lossy links. Let’s suppose I want to send data from A to B, and they’re both mobile devices. Let’s suppose between the mobile devices and the access point we have high probability of packet drops. For example, due to multiple mobile devices trying to transmit at the same time locally. In this case, solution 1 is a good approach to use because you can guarantee reliability on a per-hop basis between the mobile host and the access point. Doing so may result in performance penalty between the mobile host and the access point, but you can result in much higher reliability if you do that. And in doing so, reduce the need for you to retransmit the entire packet again and again from the mobile host to another mobile host, somewhere over the internet.

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

E2E rule of thumb for in network design

A

if hosts can implement functionality correctly, implement it in a lower layer only as a performance enhancement

but do so only if it does not impose burden on applications that do not require that functionality

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

metrics for network performance

A
  1. link bandwidth capacity: maximum rate (in bps) at which the sender can send data along the link
  2. propagation delay: time it takes the signal to travel from source to destination
  3. packet transmission time: time it takes the sender to transmit all bits of the packet
  4. queuing delay: time the packet needs to wait before being transmitted because the queue was not empty when it arrived
  5. processing time: time it takes a router/switch to process the packet header, manage memory, etc.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

sending one packet timing diagram

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

some formulas

A

latency = propagation + transmit + queuing delay
propagation = distance / speed of light
transmit = packet size bandwidth
queuing delay = queue length / bandwidth

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

bottleneck example

A

you can only transmit as fast as your slowest link

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

cut through switching

A

a packet starts being forwarded (sent) as soon as its header is received

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

throughput?

A

throughput of a connection or link = total number of bits successfully transmitted during some period [t, t+ T) divided by T

link utilization = throughput of the link / link capacity

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

delay related metrics

A

delay of bit from A to B
- the time required for bit to go from A to B

round-trip time (RTT)
- two way delay from sender to receiver and back

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

other delay-related metrics

A

jitter
- variability in delay

bandwidth-delay product
- product of bandwidth and delay = “storage”capacity of network
- for efficient resource usage: keep the pipe full. affects TCP (reliability delivery) buffer size

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

jitter

A

differences in latency

predictability can be hard
–> solution: buffer data flow

what causes jitter?
- router: queuing delays, congestion
- links: failures leading to alternative paths

17
Q

measuring jitter

A

jitter metrics
- difference between the forwarding delay of two consecutive received packets belonging to the same stream (RFC 4689)
- average jitter is defined as the average value of the jitter of consecutive packet pairs
- cisco IP-SLA: inter packet delay variance

18
Q

measuring jitter

A
19
Q

naming and addressing

A
20
Q

types of sockets

A

stream vs datagram
stream socket (TCP)
- connection oriented (establishment + termination)
- reliable, in order delivery
- at most once delivery
- ssh, http
datagram socket (UDP)
- connectionless, just data -transfer
- best effort delivery, possibly lower variance in dleay
- telephony, streaming audio

21
Q

ephemeral ports

A

The default ephemeral port numbers are in the range 1024 – 65535.