Data Link Layer (osi 2) Flashcards

1
Q

Name and describe the two sublayers of the data link layer

A

2a: logical link control
- error correction and detection
- flow control
- SAP management

2b: medium access control
- coordinates transmissions on the medium/channel
- decides how to deal with collisions
- secures reliable transmission process, so that little to no data is corrupted or goes missing

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

List and explain the services a link layer protocol offers

A

-framing:
encapsulating packets from upper layer into frames (using MAC address)
-error handling:
Detection and sometimes even correction of received bit stream
If data corrupt, ask for repeat
-contention resolving:
Medium access control, deciding when to transmit/receive so that no collisions occur
-flow control:
pacing between sender and receiver (avoid data overload)

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

all the methods learned in the lecture to implement the framing service

A
  • counting (to define when frame begins and ends)
  • sentinels: inserting flags to mark beginning and end of frames
  • clock-based(SONET)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

HLDC: High Level Data Link Control

A
  • primary and secondary classes for messages and links
  • commands only from primary
  • responses from secondary
  • unbalanced p2p : 1 prim. 1 second.
  • unbalanced multi point: 1 primary mult. secondary
  • balanced p2p: stations both primary and secondary

Message types:

  • supervisory..error, flow control
  • information
  • unnumbered.. connection establishment/tear down

-can use gbn and selective ARQ

Frame:
Flagged, address, control field, checksum, SDU

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

Explain what unslotted ALOHA does

A
  • Random Access MAC protocol
  • error detection and recovery specification
  • send data immediately
  • if collision occurs wait random time and send again

-channel has to stay silent for at least 2 slots, otherwise collisions can occur

-probability of k packets in channel is poison distributed:
P(k)=(G^k*e^-G )/ k!
with G offered traffic

Throughput S = G * P(successful transmission)

Theoretical Max throughput 18,4 %

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

Explain what slotted ALOHA does

A
  • MAC protocol (Cf unslotted Aloha)

Instead of sending frames right away, send in timeslots (synchronized clocks on all nodes)
-slots equal size (about frame time)

  • frame arrives :
  • > send in next slot
  • if collision occurs:
  • > send in next slot with probability p

Throughput S=GP(successful transmission) = Ge^-G
S,Max = 36,8%

P (next two slots free) = P(Slot free)*P(slot free)

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

Explain the basic CSMS mechanism

A

Carrier Sense Multiple Access

Avoid secure collision by listening to the channel

%If medium free:
Send
   %if collision 
       Collision handling
%If medium not free:
Wait random time

Issues:
max distance to ensure that propagation delay does not obfuscate a blocked channel
if collision occurs, transmission time wasted

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

CSMA 1 persistent

A

CSMA type where frame is transmitted as soon as channel is free

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

CSMA non-persistent

A

If channel is blocked , wait random time and try again, otherwise send

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

CSMA p-persistent

A

If channel free, transmit. If not, wait until free and send with probability p. If not sent, start over after waiting a fixed time slot.
If blocked, wait random time and try again

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

Explain what CSMA with collision detection does differently than pure CSMA

A

If collision during transmission, send jamming signal and abort.
Back off of transmission for a bit of time and then start again.

Constraints: frames must take longer than 2t,prop at least for the jamming signal to return before transmission ends

Efficiency:
Two stations: roh,max = 1/(1+2a)

a is normalized delay bandwidth product = t,prop/t,frame

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

Ethernet

A

Uses CSMA CD

BinaryExponentialBackoff:
after collision number n, choose a number k between 0 and 2^n - 1 and wait 512*k bits before trying again

Ethernet frame: synchronization preamble, addresses, type, data, crc

Type indicates higher level protocol

Connectionless service
Unreliable

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