Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and...

35
Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakri shnan, and John Apostolopoulos MIT Computer Science and Artificial Intelligence Laboratory MobiSys’04, June 6–9, 2004, Boston, Massachusetts, USA.
  • date post

    22-Dec-2015
  • Category

    Documents

  • view

    215
  • download

    2

Transcript of Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and...

Page 1: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Divert: Fine-grained Path Selection for Wireless LANs

Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos

MIT Computer Science and Artificial Intelligence Laboratory

MobiSys’04, June 6–9, 2004, Boston, Massachusetts, USA.

Page 2: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Outline

Introduction The case for fine-grained path

selection Design and implementation of divert Experimental result conclusion

Page 3: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Introduction

Wireless communication channels have notoriously time-varying characteristics

■ Noise ■ Attenuation ■ interference ■ multipath ■ user mobility results in packet losses, and higher and more var

iable packet latencies

Page 4: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Introduction

In current WLANs, a client station sends and receives data only via the AP

The client station will only switch association to another AP via a handoff

decouple the process of associating a client with an AP

fine-grained path selection for each frame transmission to client stations can reduce link-layer frame loss rates

Page 5: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Introduction

two reasons why such fine-grained control is effective:

- Frame losses occur in bursts, and many of these bursts are of long lengths on the order of tens of frames - attenuation,multipath and mobility—depend on the path traversed between an AP and a client fine-grained client-specific path selection among a

set of neighboring APs. call Divert Little overhead for AP exchanged

Page 6: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Introduction

fine-grained path selection heuristic that can reduce the average frame loss rates

Page 7: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

802.11b transmitter at location A and B each broadcast packets at 2.88Mbps to receiver R1,R2,R3

The packet generator sends a stream UDP/IP packets at 240 packets per second to each

wireless transmitter

Page 8: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

measure the loss characteristics of two concurrent packet streams transmitted (spatial correlation)

how bursty losses how frame losses from different transmitters how receiver motion affects loss characteristics

Page 9: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

Page 10: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

Page 11: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

how frame losses are correlated between different transmitters (spatial)

Ai and Bi represent the lost of frame i sent from transmitters A and B respectively

- auto-conditional loss probability P(Ai+k|Ai) and P(Bi+k|Bi), for k > 0 , K=lag if losses occur in bursts P(Ai+k|Ai) > P(A), P(A) = FLRA

Page 12: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

- auto-conditional loss probability if losses are non-bursty P(Ai+k|Ai) = P(A)

Page 13: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

- cross-conditional loss probability P(Bi+k|Ai) and P(Ai+k|Bi) if losses correlated between the stream P(Bi+k|Ai) >P(B), P(B) = FLRB

if losses are independent between streams P(Bi+k|Ai) = P(B).

Page 14: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

1 ≦ k ≧ 200 (4.2 to 840ms) (P(Ai+k|Ai) and P(Bi+k|Bi)) ar

e much larger than the respective average FLR

A 0.17 B 0.15 cross-conditional loss prob

abilities (P(Ai+k|Bi) and P(Bi+k|Ai)) remain nearly the same as the respective average FLR

frame losses have very little correlation between the different transmission sites

Page 15: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

Observe that the average FLR 0.17 of A is larger than that of B 0.15 , yet P(Ai+k|Bi) < P(Bi+k|Bi)

fine-grained path selection can be effective in avoiding imminent burst losses by switching to an alternate site whenever a loss occurs in the current site

Page 16: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

P(Bi+k|Ai) > P(Ai+k|Ai) but P(Ai+k|Bi) < P(Bi+k|Bi). This is because the FLR of B (1.02) is about twice that of A (0.47)

Page 17: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

1 ≦ k ≧ 20000 (4.2 to 84s)

frame losses become more and more independent as the lag increases

Page 18: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

frame loss occurs ,the short-term probability of losing a subsequent frame transmitted from the same site is greater than the short-term probability of losing a subsequent frame if it were sent from another site

Page 19: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

Interference - Before sending a frame, the sender

senses the channel for activity. If the sender senses energy in the channel, it suppresses its transmission to avoid colliding with another potential ongoing transmission

Page 20: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

The case for fine-grained path selection

one site’s transmission is suppressed by CS, an alternate site may be used to transmit data frames.

A fine-grained path selection system can discover such transmission

Page 21: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Design and implementation of divert

Page 22: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Design and implementation of divert

Divert uses a path-selection heuristic to determine which AP and path

Divert requires explicit coordination because it makes path choices

To enable this coordination - Divert extends the WLAN architecture by

adding two components, the Divert Controller (DC) and

the Divert Monitor (DM)

Page 23: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Design and implementation of divert

The DC runs a fine-grained path-selection heuristic, which makes a forwarding decision for each packet

DC runs at primary AP within a cell

DM runs at each secondary AP

Page 24: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Design and implementation of divert

A DM monitors the wireless link at its AP and sends two types of messages to the DC

- registration event messages . The DM sends a periodic registration event to the

DC . The registration event allows the DC to maintain a set of usable transmission paths for fine-

grained path selection . the registration can timeout when a client moves

out of an AP’s transmission range

Page 25: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Design and implementation of divert

- path-condition update messages . Each DM monitors the channel conditions . the DM maintains this information per client. The

DM periodically sends updates of this information to

the DC. 1.The DM observes a failed transmission if the

sender does not receive asynchronous ACK after a frame transmission. 2.either the data frame or the returning ACK is lost

Page 26: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Design and implementation of divert

Divert path selection Heuristic - The goal of Divert’s fine-grained path selectio

n heuristic is to reduce losses in the wireless medium

- selects only one AP with a good transmission path to a client

- The DM then monitors the loss rate within this time window H

- number of lost data frames is greater than a threshold T, the DM notifies the DC to forward subsequent frames via a different AP

Page 27: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Design and implementation of divert

- a larger value for H allows the heuristic to obtain a better estimate of the channel’s average loss rate, suitable static channel conditions

- a large T is desirable to prevent switching to a potentially poorer path

- a small T , to avoid imminent burst losses in the current path

- H = 1 and T = 1 when the receiver is mobile

- H = 10 and T = 5 , less dynamic

Page 28: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Design and implementation of divert

Reducing path switching cost

Secondary access points (SAP) provide alternate communication paths within the same cell

Page 29: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Experimental result

1500 byte of Unicast packets to the receiver

Use AP A or AP B to transmit each frame

H=1 T=1 reduces the average FLR by about 38% from scheme A and 21% from scheme B

Page 30: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Experimental result

H=1 T=1 with a higher average FLR

H=3 T=2 with a lower average FLR

Hybrid H=1 T=1 to A H=3 T=2 to B R1 closer to A the average FLR of

scheme A (2.1%) is much lower than B (15%)

Page 31: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Experimental result

Page 32: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Experimental result

Page 33: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Experimental result

in Divert, 98% of the packets have a channel delay less than 15 ms(0.015s)

fewer packets (90% and 95%) are transmitted successfully

Page 34: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Experimental result

Page 35: Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Conclusion

fine-grained site selection can be used to reduce both loss and delay by switching data frame transmissions intelligently between the available transmission sites