Data Link Layer Flashcards

1
Q

What is the responsibility of the data link layer?

A

data link layer has responsibility of transferring datagram from one node to physically adjacent node over a link

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

What are the link layer services?

A

Framing: Encapsulate datagram into frame, adding header, trailer
Link access: Channel access if shared medium
Reliable delivery between adjacent nodes
Error detection and correction

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

Where is the link layer implemented

A

In NIC “adaptor” or a chip

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

Tell the sender and receivers side in the communication between hosts

A

sending side:
• encapsulates datagram in frame
• adds error checking bits, rdt, etc

receiving side
• looks for errors
• extracts datagram, passes to upper layer

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

what are the two types of link?

A

point-point and broadcast

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

what is multiple access protocol?

A

distributed algorithm that determines how nodes share channel, i.e., determine when node can transmit

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

give examples of three MAC protocols?

A

random access, channel partitioning, taking turns

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

In FDMA, channels are partitioned by?

A

by frequency

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

In TDMA, channels are partitioned by?

A

by time

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

In Slotted Aloha, prob that given node has success in

a slot? How about N slots? What is its efficiency?

A
  1. p(1-p)^(N-1)
  2. Np(1-p)^(N-1)
  3. 0.37
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

In Pure Aloha, prob that given node has success in

a slot? How about N slots? What is its efficiency?

A
  1. p(1-p)^(2N-2)
  2. Np(1-p)^(2N-2)
  3. 0.18
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Explain the concept of CSMA

A

CSMA: listen before transmit:

  • if channel sensed idle: transmit entire frame
  • if channel sensed busy, defer transmission
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the difference between CSMA and CSMA/CD

A

Second has collision detection.

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

Tell the formula for CSMA/CD efficiency

A

1/(1 + 5t_prop/t_trans)

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

List taking turns protocols

A

Polling, token passing

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