Dynamic Markets for Wireless Congestion Pricing Srinivas Shakkottai - - PowerPoint PPT Presentation

dynamic markets for wireless congestion pricing
SMART_READER_LITE
LIVE PREVIEW

Dynamic Markets for Wireless Congestion Pricing Srinivas Shakkottai - - PowerPoint PPT Presentation

1 Dynamic Markets for Wireless Congestion Pricing Srinivas Shakkottai Texas A&M University Societal Networks 2 Congestion Pricing Road Networks Public Transportation Smart Grid Cellular Data? Societal Networks 3


slide-1
SLIDE 1

Dynamic Markets for Wireless Congestion Pricing

Srinivas Shakkottai Texas A&M University

1

slide-2
SLIDE 2

2

Societal Networks

¨ Congestion Pricing

Road Networks Public Transportation Smart Grid Cellular Data?

slide-3
SLIDE 3

3

Societal Networks

¨ Congestion Pricing

Road Networks Public Transportation Smart Grid Cellular Data? Large number of agents Infrequent interaction between subsets Repeated decisions: when how much?

Mean Field Game

slide-4
SLIDE 4

4

Related Work

¨ Time Dependent Pricing System:

  • S. Ha, S. Sen, C. Joe-Wong, Y. Im, and M. Chiang,

"TUBE: Time Dependent Pricing for Mobile Data", ACM SIGCOMM 2012.

¨ Theory of Mean Field Games:

  • K. Iyer, R. Johari and M. Sundararajan: “Mean field

equilibria of dynamic auctions with learning”, ACM Conference on Electronic Commerce 2011.

slide-5
SLIDE 5

5

¨ Steady state action distribution of single agent =

Empirical distribution of infinite agents over one step.

Mean Field Equilibrium

Assumed mixed strategy. State Value and Action functions

V ∗

ρ , θ∗ ρ

ρ x1 x2 x3 Π ρ

slide-6
SLIDE 6

6

Motivation

¨ A now-standard approach to

scheduling in queueing systems is the Max-weight idea (Tassiulas & Ephremides ‘92).

¨ In our context, (weighted) Longest

Queue First would yield short queue lengths.

¨ How do you get queue length and

cost functions?

¨ Will users reveal their true values?

Conduct an auction?

slide-7
SLIDE 7

7

System Model

¨ Users of cellular data networks use

apps that have differing service requirements: delay sensitivities à holding cost for queue.

¨ Users terminate apps and start new

  • nes periodically à geometric

lifetime and regeneration.

¨ The base station must schedule

uplink/downlink in a “fair” manner à auction with M agents.

¨ Users move around between different

cells à independence among queues.

slide-8
SLIDE 8

8

Theoretical Results

¨ MFE exists. ¨ Bid is strictly monotone increasing if holding cost is

strictly convex.

¨ Essentially gives rise to max-weight (longest queue first

regime).

¨ Max-weight is not just throughput optimal, it is also

incentive compatible!

¨ Extendable to multiple classes of cost functions.

¨ M. Manjrekar, V. Ramaswamy and S. Shakkottai, “A Mean

Field Game Approach to Scheduling in Cellular Systems” in IEEE INFOCOM ’14

slide-9
SLIDE 9

9

¨ Use a token-based scheme to conduct auctions à

3 Giga-tokens instead of 3 GB limits?

¨ Bid-distribution updated periodically

à Low demand à Low bid.

¨ LTE frame uplink control requires stations to indicate if

they wish to transmit.

¨ Supports declaration of buffer size as well. ¨ Smart phone laboratory, partially supported by

Google Inc.

¨ Open WRT based scheduling in 802.11 APs.

Implementation?