Chapter 6 - Link Layer and LANs Flashcards

1
Q

What are the links in a network?

A
  • wired links
  • wireless links
  • LANs
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the packet in the link layer?

A

-A frame
- The frame will encapsulate the datagram

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

What is the data-link layer responsibility?

A

transferring datagram from one node to a physically adjacent node over a link

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

What are the link layer services?

A

Framing, link access:
- encapsulate datagram into frame, adding header, trailer
- channel access if shared medium
- MAC addresses used in frame headers to identify source and destination (different from IP)

Reliable delivery between adjacent nodes

Flow control

error detection

error correction

half-duplex and full-duplex

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

Where is the link layer implements?

A

Each and every host

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

How do adaptors communicate?

A

Sending side:
- encapsulates datagram in frame
- adds error checking bits, rdt, flow control etc.

Receiving side:
- looks for errors, rdt, flow control etc.
- extracts datagram, passes to upper layer at receiving side

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

How does error detection work?

A
  • add erros detection and correction bits to the data
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is a single parity check?

A
  • add single parity bit to a block of data bits
    -can be a 1 or a 0
  • ensures that sum of all bits yeilds either an even or odd result
  • exclusive or operation
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

what is even parity?

A

designed to yield an even result

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

what is odd parity?

A
  • designed to yield an odd result
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is two dimensional bit parity?

A
  • rectangle of bits with i and j columns
  • then horizontal parity check is appended to each row and vertical parity to each column
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Internet checksum?

A
  • 1s compliment addition
  • sender puts checksum into UDP checksum field
  • receiver will add all segments
  • if all values equals one, no error, but if not all one, then there is error
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Cyclic redundancy?

A
  • more powerful error-detection
  • data bits as binary
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What are the type of links for a multiple access links protocol

A

point to point:
- PPP for dial up access
- point to point link between ethernet switch, host

broadcast:
- old fashioned ethernet
- upstream HFC
- 802.11 wireless LAN

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

What is a multiple access protocol?

A
  • distributed algorithm that determines how nodes share channel ie determine when node can transmit
  • communication about channel sharing must use channel itself
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What are the three MAC protocols classes?

A

channel partitioning:
- divide into smaller pieces (time slots, frequency)
- allocate piece to node for exclusive use

random access:
- channel not divided, allow collisions
- recover from collisions

taking turns:
- node takes turns, but nodes with more to send can take longer turns

17
Q

What is Time division multiple access?

A
  • access to channel in rounds
  • each station gets fixed length slot in each round
  • unused slots go idle
18
Q

What is frequency division multiple access?

A
  • channel spectrum divided into frequency bands
  • each station assigned fixed frequency band
  • unused transmission time in frequency bands go idle
19
Q

What is slotted ALOHA?

A
  • node obtains fresh frame, transmits in next slot
  • if no collision: node can send new frame in next slot
  • if collision: node retransmits frame in each subsequent slot with prob. p until success
20
Q

Asumptions with slotted ALOHA

A
  • all frames same size
  • time divided into equal size slots
  • nodes start to transmit only slot beginning
  • nodes are synchronized
  • if 2 or more nodes transmit in slot, all nodes detect collision
21
Q

Pros and cons of slotted ALOHA

A

Pros:
- single active node can continuously transmit at full rate of channel
- highly decentralized: only slots innodes need to be in sync
-simple

cons:
- collisions, wasting slots
- idle slots
- nodes may be able to detect collision in less than time to transmit packet
clock synchronization

22
Q

Efficiency of slotted ALOHA

A

long run fraction of successful slots (many nodes, all with many frames to send)

23
Q

what is Pure (unslotted) ALOHA?

A
  • simpler, no synchronization
  • when frame first arrives, transmit immediately
  • collision probability increases
24
Q

Efiiciency of Pure ALOHA

A
  • worse than slotted ALOHA
25
Q

What is carrier sense multiple access?

A
  • listen before transmit
  • if channel sensed idle: transmit entire frame
  • if channel sensed busy: defer transmission
26
Q

Collisions of CSMA

A
  • propagation delay means two nodes may not hear each others transmission
  • entire packet transmission time wasted