Medium edium Acces ccess Cont ontrol ol Prot otocols ocols 1 - - PDF document

medium edium acces ccess cont ontrol ol prot otocols ocols
SMART_READER_LITE
LIVE PREVIEW

Medium edium Acces ccess Cont ontrol ol Prot otocols ocols 1 - - PDF document

CMPE 252A: SET 5: Medium edium Acces ccess Cont ontrol ol Prot otocols ocols 1 Collision Avoidance Collision avoidance emulates collision detection in networks where stations are half duplex. First protocol was proposed by


slide-1
SLIDE 1

1

1

CMPE 252A: SET 5:

Medium edium Acces ccess Cont

  • ntrol
  • l

Prot

  • tocols
  • cols

2

Collision Avoidance

 Collision avoidance emulates collision detection in

networks where stations are half duplex.

 First protocol was proposed by Kleinrock and Tobagi (Split

Reservation Multiple Access).

 Many protocols have been proposed since then: MACA,

MACAW, FAMA, RIMA.

 The objective of collision avoidance protocols is to

eliminate the hidden-terminal problem of CSMA:

S N R H S, R, and N hear one another, and R, N, and H hear one another N hears S’s transmission However, S and H cannot hear each

  • ther’s transmissions to R, and cause

interference at the receiver R.

3

Collision Avoidance

 Because of hidden terminals, the vulnerability of a data

packet is just as in pure ALOHA, twice its length.

 With collision avoidance, stations exchange small control

packets to determine which sender can transmit to a receiver.

 The collision avoidance dialogue can be controlled by the

sender or the receiver.

 In sender-initiated collision avoidance we have:

RTS (S to R) -> CTS (R to S) -> DATA (S to R) -> ACK (R to S)

 In receiver-initiated collision avoidance we can have:

RTR (R to S) -> DATA (S to R) -> ACK (R to S)

slide-2
SLIDE 2

2

4

Sender-Initiated Collision Avoidance

 Examples are MACA, MACAW, FAMA, and IEEE 802.11.  MACA and MACAW do not use carrier sensing, FAMA and

802.11 do.

 MACA, MACAW, and IEEE 802.11 do not prevent collisions

in the absence of base stations.

  • C. Fullmer and JJ Garcia-Luna-Aceves, “Solutions to Hidden-Terminal

Problems in Wireless Networks,” Proc. ACM SIGCOMM 97 (in the ccrg web page)

 Objective is to force hidden sources to hear the feedback

from a receiver when they are causing interference during the collision-avoidance handshake.

5

Example of CSMA/CA:

Floor Acquisition Multiple Access

 Stations use carrier sensing to send any packet.  The CTS lasts much longer than an RTS to force the

interfering sources to detect carrier (from the receiver) and back off.

time

RTS

S to R

CTS

R to S

RTS

τ 2

noise is heard H to R

RTS from S arrives at R with no collisions. RTS from H must start within one prop. delay from CTS from R to S. H must hear noise from CTS and backs off! S S S

RTS CTS CTS RTS

6

Basic FAMA Protocol

send RTS no wait for a round-trip time CTS back? yes compute random backoff integer k

no

delay packet transmission k times Packet ready Floor Taken? yes send packet

Non-persistent strategy. Same basic algorithm for all CSMA/CA schemes

slide-3
SLIDE 3

3

7

Throughput of FAMA

Now we consider the effect of collision avoidance overhead.

Remember: Fully connected net, arrivals of RTSs to the channel are Poisson with parameter lambda.

Performance is always below that of CSMA/CD, because feedback incurs more overhead.

γ τ τ γ + ≤ + + = 2 Y C

collision interval: successful packet interval:

τ γ γ 3 '+ + + P

average idle period:

λ / 1 = I

first packet starts (A)

τ

τ ≤ Y

'

γ

last interfering packet starts (B)

idle period

τ

P

time DATA

NEW A B NEW RTS NEW CTS

τ

γ

τ

' γ

8

Throughput of FAMA

Typical (over) simplification: Think of two mutually exclusive events: packet is successful or a collision occurs. Therefore, …. but that is not correct C P P P B

S S

) 1 ( ) ( − + + = τ Note that:

  • A successful packet occurs when the first and the last packet of a

busy period are the same packet.

  • The average length of a collision interval includes the case when

Y = 0 i.e., the first and the last pkt starts in busy period are the same! Therefore, we know two things:

  • The length of an average busy period must include the length of the

average collision interval.

  • The busy period includes a CTS and a packet only when it is

successful with probability PS

9

Throughput of FAMA

A single RTS

= Y τ P

time DATA

NEW RTS NEW CTS

τ

γ

τ

' γ

first RTS starts (A)

τ

τ ≤ Y

'

γ

last interfering RTS starts (B)

time

NEW A B

τ τ γ ≤ + + Y Y is Length 2 is Length = + + ! + + + Y P Y τ γ τ γ

slide-4
SLIDE 4

4

10

Throughput of FAMA

Therefore:

with ) 2 ( τ τ γ τ γ ≤ + + $ + + + = Y P P Y B

S

A packet is successful with probability

λτ

τ

= = e P P

S

} in packets {

For

P << τ

we can approximate:

) 2 ' ( 2 τ γ τ γ

λτ

+ + + + ≈

P e B

The utilization period is only that portion of a packet transmission that has no overhead, that is:

λτ −

= Pe U

) 2 ' ( 2 1 τ γ τ γ λ

λτ λτ

+ + + + + ≈

− −

P e Pe S

Substituting: Notice the impact of the RTS-CTS

  • verhead!

11

Throughput of FAMA

 FAMA (and all collision-avoidance protocols) is always

below CSMA/CD.

Collision interval in CA is much longer than in CD, because detecting collisions is done using small packets, rather than listening to self transmission.

12

Collision Resolution and Backoff Strategies

 Used to stabilize the system by preventing

traffic loads that exceed its capacity.

 Collision resolution: Let packet that collide

resolve when each is transmitted and block new traffic from entering the system.

 Backoff strategies: Increase the time between

retransmissions when traffic load (that creates collisions) increases.

slide-5
SLIDE 5

5

13

Collision Resolution and Backoff Strategies

 Backoff strategy in Ethernet:

 After experiencing the nth collision of a frame,

pick a value K randomly from the set {0, 1, 2,…, 2m -1} with m= min{10, n}.

 Wait K.512 bit times before attempting a

retransmission.

 Goal is to reduce offered load to the channel;

however, it provides no assurance that a retransmission will be sent ahead of another new transmission from other node.

14

Conflict-Free MAC Protocols

 Conflict-free:  Fixed assignment (TDMA, FDMA)  Reservations  Polling  Dynamic scheduling  Token passing

15

TDMA TDMA: time division multiple access

 access to channel in "rounds"  each station gets fixed length slot (length =

pkt trans time) in each round

 unused slots go idle  example: 6-station LAN, 1,3,4 have pkt, slots

2,5,6 idle

slide-6
SLIDE 6

6

16

FDMA FDMA: frequency division multiple access

 channel spectrum divided into frequency bands  each station assigned fixed frequency band  unused transmission time in frequency bands go idle  example: 6-station LAN, 1,3,4 have pkt, frequency bands

2,5,6 idle.

frequency bands time

17

Channel Partitioning (CDMA)

CDMA (Code Division Multiple Access)

 unique “code” assigned to each user; i.e., code set

partitioning

 used mostly in wireless broadcast channels (cellular,

satellite, etc.)

 all users share same frequency, but each user has own

“chipping” sequence (i.e., code) to encode data

 encoded signal = (original data) X (chipping sequence)  decoding: inner-product of encoded signal and chipping

sequence

 allows multiple users to “coexist” and transmit

simultaneously with minimal interference (if codes are “orthogonal”)

18

Token Passing

 Basic Scheme:

 A token granting the right to transmit is circulated among stations.  Station with something to send receiving token changes the token

into a start of packet and sends its packet.

 The token is sent back to the system when the sender is done.

 Two transmission strategies:

 Release after transmission (RAT): Sender releases the token

immediately after transmitting its packet.

 Release after reception (RAR): Sender waits until it hears the

last bit of its own transmission before releasing the token.

 Token Passing protocols can be used in any network

topology; however, token management is simpler in rings.

slide-7
SLIDE 7

7

19

RAT Strategy

S D

TK

S D

SFD

Token circulates until it reaches S Source changes token to start-of-frame delimiter D copies the data S takes frame out (packet length is actually longer than token circulation time) S D

SFD

S D

SFD

20

Efficiency of RAT

 Let p be the probability that a station has something to

send when the token arrives to it, P is the packet length, T is the token length, there are N stations in the ring, and the propagation delay from one station to the next is

time

PKT TK 1 TK 2 PKT TK 3

...

PKT TK N

back to 1

P T a p a pP T N P N p TOTAL P N p

RAT RAT

τ η τ η + = + = + + × = × = with ; 1 1 ) ( ) ( ) (

τ τ τ τ τ

21

Average Delays in Token Ring

 Delays are bounded in token ring nets!  Each station can hold the token for a maximum

amount of time, and there is a finite number of stations in the net.

 The maximum medium access time (MMAT) is

defined to be the time elapsed from the start of a current packet transmission by a node to the time when it can have the “floor” of the network again.

 Assume that each station is allowed a token

holding time of THT sec.

slide-8
SLIDE 8

8

22

Average Delays in RAT

time

PKT TK 1

...

back to 1

THT TK N THT TK 2

) 1 ( ) ( − + + + = N THT P T N MMAT τ P p N THT T N D + − + + = ) )( 1 ( ) ( τ

The advantage is that channel access delays are bounded. The disadvantage is that, when stations are bursty, delay

  • verhead is paid in circulating the token.

Token management involves complex protocols!

τ τ τ τ

23

CSMA/CD Technology Issues

 IEEE802.3 and Ethernet are based on CSMA/CD.  CSMA/CD is used over buses and star topologies.  The most popular topology now (more than 80% of

installed base) is the star topology with hubs or switches.

 A hub acts just like a station executing CSMA/CD, and only

  • ne transmission can succeed.

 A switch is different!…and is the future. CPU

RT

Switch stores concurrently transmitted packets. No collisions. Higher throughput Limited by the switch architecture.