Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Data Networks > Basics > Flashcards

Basics Flashcards

1
Q

What does LAN stand for?

A

Local Area Network

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

What is the characteristic of best effort delivery?

A

No notification about packet receipt

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

Name two characteristcs of ethernet broadcast

A
  1. All transeivers receive every transmission
  2. Host interface filters among packets those intended for them.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are the 4 layers of TCP/IP?

A
  1. Link
  2. Internet
  3. Transport
  4. Application
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What does TCP stand for?

A

Transmission Control Protocol

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

What does CSMA stand for?

A

Carrier Sense Multiple Access

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

Explain CSMA

A

– multiple machines can access the Ethernet simultaneously
– each machine determines whether the “ether” is free by
sensing carrier wave propagation
– each transmission is limited in duration and needs a
minimum time between transmissions to prevent
monopolization of the network

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

What is CD and explain its purpuse in data networks.

A

Collision Detection
each transceiver monitors the cable while transmitting to search for foreign signal interferences

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

Explain Non-persistent CSMA

A

– Sensing is not continuously but repeated after random time.
– If no collisions are sensed, the station sends a packet.

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

Explain p-Persistent CSMA

A

Continuously sensing, but sending of packet probabilistically:
send in current time slot with probability p and in another
time slot with probability 1-p

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

What type of scheme does ethernet have?

A

1-persistent CSMA/CD scheme

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

What does the IP specify?

A

Internet Protocol:
– specification of basic unit of transfer (packet)
– IP software handles the routing functionality
– IP includes the rules for unreliable,
connectionless, best-effort delivery

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

How long is the IP adress of IPv4?

A

32 bits / 4 bytes

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

How large is the IPv4 header?

A

6x 32 bits

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

How is the fragmentation counter updated per IPv4 packet?

A

It contains the offset of the data in octets.
Ex. 320 bits in the first packet means 80 octets, so the offset for the second packet is 80

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

Why does IPv6 extended its adress size?

A

More digital devices calls for more adresses.

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

Why does IPv6 no longer provide checksum?

A

Speed up: data integrity is checked in other layers already

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

Explain why Header options are ommited in IPv6?

A

Because headers can now be appended using the “Next Header” option, which defines that there will be more header information before the packet data.

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

What makes IPv6 easier to manage than IPv4?

A

Auto configuration of Adresses, as well as more clearer structuring of subnets (using predefined adresses).

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

How can shorten IPv6 adresses?

A

You skip leading 0’s and replace large range of 0’s with ::

Ex. 2010:00A1:0000:0004= 2010:A1::4

this example is shorter than standard size

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

How is the global unicast adress composed ususually (for IPv6) ?

A

– First 64 bits: Global Routing Prefix (n bits) + Subnet-ID
(64 - n bits)
– Last 64 bits: Interface-ID
– Interface-ID often generated using the interface’s MAC
address

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

Explain what neighbor discovery is and how it works.

A

Every IPv6 interface has a link-local address that identifies it and
is used for link-local communication (e.g., for Neighbor
Discovery)
* Neighbor Discovery: IPv6 nodes can find systems they are
physically connected to (other nodes and routers)
– Routers send periodic Router Advertisements (RAs)
– Hosts can also solicit RAs by broadcasting a Router Solicitation
– RAs contain Global Routing Prefix and Subnet-IDs that hosts need for
generating global unicast IP addresses
* Duplicate Address Detection automatically resolves
address conflicts

Dia Dump

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

Give two examples of Distanc Vector protocols

A

RIP + Bellman-Ford

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

Give two examples of Link-state protocols

A

OSPF or Dijkstra

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

In Link-State Protocols, who constructs the forward table?

A

The local routing algorithm.

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

In Distance Vector Protocols, who constructs the forward table?

A

The protocol itself.

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

What kind of routing information does a Distance-vector protocol maintain?

A

maintain list of shortest distances

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

What kind of routing information does a Link-state protocol maintain?

A

maintain entire map of network

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

What kind of information does the Distance-vector protocol exchange with its peers?

A

a list of distances with neighbors

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

What kind of information does the link-state protocol exchange with its peers?

A

flood topology information

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

Which is more complex Link-state or distance-vector protocols?

A

Link state

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

Which is more vulnerable Link-state or distance-vector protocols?

A

distance vector

33
Q

In routing hierarchy, explain what the intra-domain routes?

A

Routing within
one Autonomonous Systems (e.g., OSPF or IS-IS)

34
Q

In routing hierarchy, explain what the inter-domain routes?

A

Glues together
different Autonomonous Systems (e.g., BGP)

35
Q

What does BGP stand for?

A

Border Gateway Protocol

36
Q

What are the 3 properties of BGP?

A

– glue between ASs
– complex protocol
– only unicas

37
Q

In what way is BGP enhanced comapered to standard dinstance vector protocols?

A

Path vector contains entire path (list of ASs)

38
Q

Explain how BGP decides best path:

A
  1. H receives the path vector from its BGP-neighbours about K:
    from B: BHIJK from G: GHDK
    from D: DK from I : IJK
  2. H discards the path from B and from G that runs over itself
  3. H uses a module with policy information and computes a “distance” for each remaining path from H to K
  4. The path corresponding to ‘best’ distance is stored in H’s
    routing table
39
Q

What does MPLS stand for?

A

Multi Protocol Label Switching

40
Q

What are MPLS use cases?

A
  • traffic engineering
  • scalable IP virtual private networks
41
Q

Does TCP send acknowledgements?

A

Yes, the receiver does

42
Q

In what layer is TCP applied?

A

Transport layer

43
Q

What are the three ways TCP handles errors or packet loss after detection?

A

Retransmission: for rare errors or when time permits.
Forward Error Correction: For frequent erros or when short on time.
Discard: When strict reliablity is not required or able.

44
Q

What is RTO and how is it applied in TCP?

A

Retransmission Timeout is maximum time between transmission and ACK before the transmittor retries the transmission. The value of RTO is updated during runtime in order to adapt for performance in the system.

45
Q

Explain how duplicate acknowledgements work

A

When ordered data is sent, the receiver responds with the ACK N+1 (the next expected packet). When a packet is lost, and an out of order packet is receieved, then the receiver keeps sending dublicate ACKs. When 3 dublicate ACKS (so 4 total) are received by the sender, it resends the packet that has been lost.

After the missing packet has been received by the receiver, it Acknowledges with the updated counter of prereceived packages. (so packets in buffer are read and processed before ACK is send).
ACK 45 -> ACK 50

46
Q

How does TCP implement flow control?

A

Using (sliding) receive window: it limits the packets that are ‘inflight’ such that the receiver is not overwhelmed. It does this by pacing the ACKs of the receiver.

47
Q

How does TCP implement congestion control?

A

Using (sliding) congestion window: it limits the packets that are ‘inflight’ such that the network is not overwhelmed. It does this by implementing a Congestion Control Algorithm

48
Q

What is CCA?

A

Congestion Control Algorithms

49
Q

In TCP, what is refered to using cwnd?

A

Congestion Window (for congestion control)

50
Q

What is TCP Reno responsible for?

A

Congestion Control in TCP.

51
Q

What type of congestion avoidance does TCP Reno have?

A

Additive Increase, Multiplicative
Decrease (AIMD)

52
Q

Explain the phases of TCP Reno (in detail)

A
  1. Slow start: For every ACK received, cwnd +=1. Until above allowed threshold or packetloss -> go to step 2.
  2. Packet Loss. Set ssthreshold to inflight/2. In case of heavy congestion: Go back to phase 1. In case of mil congestion, go to phase 3.
  3. Fast Recovery. Set cwnd to ssthresh + 3 and retransmit lost packets. If another dub. ACKs. occur, set to ssthresh +1. Go to step 4.
  4. Congestion Avoidence. Linearly increase the cwnd by one each round, untill packet loss or erro occurs.
53
Q

What problem does TCP Reno have?

A

TCP Reno’s linear increase is too slow in networks with high bandwith or long RTTs.

54
Q

What is TCP Cubic?

A

Another congestion control part of TCP, but with faster increase than TCP Reno.

55
Q

What is the problem for loss-based CCAs and small buffers?

A

low throughput: CCA cuts cwnd too often

56
Q

What is bufferfloating?

A

When buffers are too large: high queueing delay.

57
Q

What is BBR?

A

Bottleneck Bandwith and Routrip propegation time.

58
Q

What is the core idea of BBR?

A

adjust behavior based on a model of the
network path

59
Q

In BBR, what is BDP and how is it calculated?

A

Bandwith Delay Product = bottleneck (max) bandwith x RTT

60
Q

What is the optimal operating point for BBR?

A

1 Bandwidth-Delay Product
(BDP) of data is inflight

61
Q

How does BBR scale during runtime?

A
  • Regularly raise sending rate to probe for bandwidth
  • Regularly lower sending rate to obtain samples of the RTT
62
Q

Why does BBR not use ACKs?

A

self-clocking through ACKs no
longer possible nowadays
– DOCSIS or WiFi aggregate ACKs and send them out in a burst (“delayed ACKs”)

63
Q

What are some big problems with BBR?

A
  • fairness issues
  • high queueing delay
  • no reaction to packet loss
64
Q

How are classic buffers usually managed. And what are the consequences?

A

Tail drop It drops the latest packets when buffer is full.
Leads to higher queueing delay and specific flows being targeted.

Concurrent packets usually belong to the same flow, who are dropped

65
Q

What is AQM and how is it used?

A

Active Queue Management.
it manages the buffer by randomly select and dropping packets before the buffer is full.

66
Q

Is AQM faster than classic buffers?

A

Yes, certain flows are no longer targeted.

67
Q

What is RED and how does it work?

A

Random Early Detection introduces a buffer min and max capacity. It then drops packets between this threshold with probability p, as a prepocaution. p is increased with the queue’s occupancy.

68
Q

What is CoDel and how does it work?

A

Controlled Delay.
Measure the sojourn time of packets in buffer.
After an interval of 100 ms, if minimum sojourn time was over 5 ms, then drop a packet and shorten interval with sqrt of times interval was shortened. If min sojourn time was under 5 ms, reset back to 100 ms.

69
Q

What is ECN and how does it work?

A

Excplicit Congestion Notification. Routers mark packets with ‘congestion experienced’ (CE) such that it is received by the receiver. The receiver marks an ACK with an echo of this message (ECE) and sends it to the transmitter. The transmittor cwnd is reduced (CWR), and marks the next packet with this info.

70
Q

What system is a prerequicit for ECN?

A

AQM

71
Q

What is UDP?

A

User Data Protocol

72
Q

What does QUIC stand for?

A

Quick UDP Internet Connections

73
Q

What are the goals of QUIC?

A

– Low latency
– Security
– Multiplexing without head-of-line blocking
– Connection migration

74
Q

Where does QUIC implement congestion control?

A

Application layer

75
Q

Does QUIC send an acknowledge?

A

No, recievers only respond to initial message.

76
Q

What is multiplexing and what is a major disadvantage with TCP?

A

Multiple data streams
within one connection to access multiple endpoints at once.
If there is an error in one stream, then TCP blocks all other streams until this is resolved (major delay)

77
Q

How does QUIC implement multiplexing?

A

Using designated UDPs per stream, then streams are independent.

78
Q

How does QUIC solve connection migration?

A

packets contain connection ID, so it can reestablish connection fast. (In TCP connection just breaks and a workaround is needed)

Data Networks (7 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions