6.02 fall 2014 lecture #18 - mitweb.mit.edu/6.02/www/currentsemester/handouts/l18_slides.pdf6.02...

16
6.02 Fall 2014 Lecture #18 Abstractions for shared communications Performance metrics MAC protocols (TDMA, ALOHA, CSMA)

Upload: others

Post on 01-Jan-2021

3 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

6.02 Fall 2014!Lecture #18

• Abstractions for shared communications • Performance metrics • MAC protocols (TDMA, ALOHA, CSMA)

Page 2: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

Single Link Communication Model

Original Source

Digitize!(if needed)

Source coding

Channel coding!(bit error protection)

Mapper + transmit samples

Receive samples + Demapper

Channel decoding!(bit error correction)

Receiving app/user

Render, display, etc.

Source decoding

transmitter receiver

Page 3: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

Single Link Communication Model

Original Source

Digitize!(if needed)

Source coding

Channel coding!(bit error protection)

Mapper + transmit samples

Receive samples + Demapper

Channel decoding!(bit error correction)

Receiving app/user

Render, display, etc.

Source decoding

transmitter receiver

Page 4: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

Shared Communications Channel

today’s goal: analyze protocols that allow many nodes to share a single channel

Page 5: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

Shared Communications Channel

channel

nodes

channel interface

packets!(stored in queues)

Page 6: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

channel

goal: design a media access protocol — which nodes will use to access the channel — that avoids collisions

and ensures good performance

Page 7: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

Good Performance

U = total throughput over all nodes

maximum data rate of the channel

1. utilization - the channel should be used efficiently

2. fairness - the channel should be divided evenly (if possible)

NX

i=1

xi

!2

N ·NX

i=1

x

2i

F =

Page 8: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

goal: design a media access protocol that avoids collisions and ensures high

utilization and high fairness

Page 9: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

goal: design a media access protocol that avoids collisions and ensures high utilization and high fairness even under

skewed workload

(TDMA is only good when workload is uniform)

Page 10: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

0

0.2

0.4

0.6

0.8

1

0 0.2 0.4 0.6 0.8 1

Utili

zatio

n

p

Utilization for Slotted ALOHA, N=10

Page 11: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

goal: design a media access protocol that avoids collisions and ensures high utilization and high fairness even under skewed workload and that allows nodes

to independently decide when to transmit

(TDMA is only good when workload is uniform)

(Slotted ALOHA requires all nodes to know the number of backlogged nodes, which is very hard to do in practice)

Page 12: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

= success = failure

some nodes are starved out of the system

utilization)=).45)fairness)=).71

Page 13: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

= success = failure significant short-term unfairness (“capture effect”)

pmin)=).05)utilization)=).43)fairness)=).98

(with a smaller pmin, utilization can increase

further)

Page 14: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

= success = failure

using)pmin)and)pmax)utilization)=).4)fairness)=).97

Page 15: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

Good Performance

1. utilization - the channel should be used efficiently

2. fairness - the channel should be divided evenly (if possible)3. bounded wait - have an upper bound on the wait before a successful transmission

4. dynamism - handle variability

5. scalability - work for a large number of users

Page 16: 6.02 Fall 2014 Lecture #18 - MITweb.mit.edu/6.02/www/currentsemester/handouts/L18_slides.pdf6.02 Fall 2014! Lecture #18 • Abstractions for shared communications • Performance metrics

• Abstractions for shared communications Nodes send packets, can detect when a collision happens, and can potentially hear each other

• Performance metrics Utilization and fairness first, then bounded wait, dynamism, and scalability

• MAC protocols TDMA is poor when workload is skewed; Slotted ALOHA handles skew, but doesn’t allow nodes to set p individually; Stabilized ALOHA does, but we must be smart about how we increase and decrease p