Wei Dong 1 Joint work with Swati Rallapalli 1, Rittwik Jana 2, Lili Qiu 1, K. K. Ramakrishnan 2, Leonid V. Razoumov 2, Yin Zhang 1, Tae Won Cho 2 1 The.

Slides:



Advertisements
Similar presentations
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 17 Auction-based.
Advertisements

Yossi Sheffi Mass Inst of Tech Cambridge, MA ESD.260J/1.260J/15.
Xia Zhou*, Stratis Ioannidis ♯, and Laurent Massoulié + * University of California, Santa Barbara ♯ Technicolor Research Lab, Palo Alto + Technicolor Research.
QoS-based Management of Multiple Shared Resources in Dynamic Real-Time Systems Klaus Ecker, Frank Drews School of EECS, Ohio University, Athens, OH {ecker,
(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
Collaboration Mechanisms in SOA based MANETs. Introduction Collaboration implies the cooperation between the nodes to support the proper functioning of.
CPS Bayesian games and their use in auctions Vincent Conitzer
Economics 100B u Instructor: Ted Bergstrom u T.A. Oddgeir Ottesen u Syllabus online at (Class pages) Or at
Chapter 25: Auctions and Auction Markets 1 Auctions and Auction Markets.
Practical Public Sector Combinatorial Auctions S. RaghavanUniversity of Maryland (joint work with Robert Day, University of Connecticut) Full paper “Fair.
Multi-item auctions with identical items limited supply: M items (M smaller than number of bidders, n). Three possible bidder types: –Unit-demand bidders.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Welcome Auctions Jonathan D. Wareham
1 Chapter 6: Auctions SCIT1003 Chapter 6: Auctions Prof. Tsang.
Federal Communications Commission NSMA Spectrum Management Conference May 20, 2008 Market Based Forces and the Radio Spectrum By Mark Bykowsky, Kenneth.
Auction Theory Class 3 – optimal auctions 1. Optimal auctions Usually the term optimal auctions stands for revenue maximization. What is maximal revenue?
A Prior-Free Revenue Maximizing Auction for Secondary Spectrum Access Ajay Gopinathan and Zongpeng Li IEEE INFOCOM 2011, Shanghai, China.
CROWN “Thales” project Optimal ContRol of self-Organized Wireless Networks WP1 Understanding and influencing uncoordinated interactions of autonomic wireless.
Confidentiality/date line: 13pt Arial Regular, white Maximum length: 1 line Information separated by vertical strokes, with two spaces on either side Disclaimer.
Congestion Pricing: Competitive Locational Prices of Power Stoft (2002)
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Dynamic Spectrum Management: Optimization, game and equilibrium Tom Luo (Yinyu Ye) December 18, WINE 2008.
Chapter Seventeen Auctions. Who Uses Auctions? u Owners of art, cars, stamps, machines, mineral rights etc. u Q: Why auction? u A: Because many markets.
CS522: Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian
A Payment-based Incentive and Service Differentiation Mechanism for P2P Streaming Broadcast Guang Tan and Stephen A. Jarvis Department of Computer Science,
On Line Markets for Distributed Object Services: The MAJIC System Lior Levy, Liad Blumrosen and Noam Nisan The Hebrew University, Jerusalem Presented by.
1 Auction or Tâtonnement – Finding Congestion Prices for Adaptive Applications Xin Wang Henning Schulzrinne Columbia University.
Competitive Analysis of Incentive Compatible On-Line Auctions Ron Lavi and Noam Nisan SISL/IST, Cal-Tech Hebrew University.
Online Auctions in IaaS Clouds: Welfare and Profit Maximization with Server Costs Xiaoxi Zhang 1, Zhiyi Huang 1, Chuan Wu 1, Zongpeng Li 2, Francis C.M.
Multipath Protocol for Delay-Sensitive Traffic Jennifer Rexford Princeton University Joint work with Umar Javed, Martin Suchara, and Jiayue He
Wei Dong* Swati Rallapalli* Lili Qiu* K.K. Ramakrishnan + Yin Zhang* *The University of Texas at Austin + Rutgers University Swati Rallapalli IEEE INFOCOM.
Jian Zhao, Xiaowen Chu, Hai Liu, Yiu-Wing Leung
Strategic Demand Reduction in homogenous multiunit auctions (where bidders may be interested in more than one unit)
Introduction to Auctions David M. Pennock. Auctions: yesterday Going once, … going twice,...
Costs of Ancillary Services & Congestion Management Fedor Opadchiy Deputy Chairman of the Board.
Trading Agent Competition (Supply Chain Management) and TacTex-05.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
Chapter 6 Sourcing. Objectives After reading the chapter and reviewing the materials presented the students will be able to: Explain the difference between.
G-commerce Computational economies for resource allocation in computational Grid settings Fundamentals Resources are not free Resources are not free For.
CHAPTER 1 DEMAND AND SUPPLY ANALYSIS: INTRODUCTION Presenter’s name Presenter’s title dd Month yyyy.
An Online Procurement Auction for Power Demand Response in Storage-Assisted Smart Grids Ruiting Zhou †, Zongpeng Li †, Chuan Wu ‡ † University of Calgary.
An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing Weijie Shi*, Linquan Zhang +, Chuan Wu*, Zongpeng Li +, Francis C.M. Lau*
Combinatorial Auctions By: Shai Roitman
TRUST: A General Framework for Truthful Double Spectrum Auctions Xia Zhou Heather Zheng (University of California, Santa Barbara) Presenter: Emil Huang.
RGGI Auction Design Research: Phase 1 Results RGGI Stakeholder Meeting, New York City May 31, 2007 Dallas Burtraw, Karen Palmer; RFF Charlie Holt, Bill.
Utility-Optimal Scheduling in Time- Varying Wireless Networks with Delay Constraints I-Hong Hou P.R. Kumar University of Illinois, Urbana-Champaign 1/30.
Truthful and Non-Monetary Mechanism for Direct Data Exchange I-Hong Hou, Yu-Pin Hsu, and Alex Sprintson.
Strategyproof Auctions For Balancing Social Welfare and Fairness in Secondary Spectrum Markets Ajay Gopinathan, Zongpeng Li University of Calgary Chuan.
TRUST:A General Framework for Truthful Double Spectrum Auctions Xia Zhou and Heather Zheng Department of Computer Science, University of California, Santa.
EasyBid: Enabling Cellular Offloading via Small Players Zhixue Lu 1, Prasun Sinha 1 and R. Srikant 2 1 The Ohio State University 2 Univ. of Illinois at.
A Study of Central Auction Based Wholesale Electricity Markets S. Ceppi and N. Gatti.
Cell Zooming for Cost-Efficient Green Cellular Networks
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
Towards Economic Fairness for Big Data Processing in Pay-as-you-go Cloud Computing Nanyang Technological University Shanjiang Tang, Bu-Sung Lee, Bingsheng.
Promoting Gas-Interconnector Investment - Insights from Laboratory Experiments Bastian Henze Tilburg University, CentER & TILEC GRI Workshop Stockholm,
Steffen Staab 1WeST Web Science & Technologies University of Koblenz ▪ Landau, Germany Network Theory and Dynamic Systems Auctions.
Device-to-Device Load Balancing for Cellular Networks Lei Deng, Ying Zhang, Minghua Chen, Jack Y. B. Lee, Ying Jun (Angela) Zhang Zongpeng Li Lingyang.
Unit 4 Cellular Telephony
Lecture 4 on Auctions Multiunit Auctions We begin this lecture by comparing auctions with monopolies. We then discuss different pricing schemes for selling.
Auctions Supplemental Material. In case you haven't noticed: Auctions are Everywhere! eBay → simple auctions for a single item AdWord Auctions → advertisers.
Center for Networked Computing. Motivation Model and problem formulation Theoretical analysis The idea of the proposed algorithm Performance evaluations.
TEMPLE UNIVERSITY Deadline-Sensitive Mobile Data Offloading via Opportunistic Communications Guoju Gaoa, Mingjun Xiao∗a, Jie Wub, Kai Hana, Liusheng Huanga.
Near-Optimal Spectrum Allocation for Cognitive Radios: A Frequency-Time Auction Perspective Xinyu Wang Department of Electronic Engineering Shanghai.
Xiangtong Qi The Hong Kong University of Science and Technology
Liberalisation of Public Wifi Hotspot Infrastructure
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Internet Interconnection
Xinbing Wang*, Qian Zhang**
CPS Bayesian games and their use in auctions
Presentation transcript:

Wei Dong 1 Joint work with Swati Rallapalli 1, Rittwik Jana 2, Lili Qiu 1, K. K. Ramakrishnan 2, Leonid V. Razoumov 2, Yin Zhang 1, Tae Won Cho 2 1 The University of Texas at Austin 2 AT&T Labs – Research INFOCOM 2013 iDEAL: Incentivized Dynamic Cellular Offloading via Auctions 1

Motivation 2 Cellular network overloaded Traffic is highly dynamic Large peak-to-average traffic ratio Over 5 times in this example => Too costly to provision based on the peak demand Time (s) Cellular demand variation

Alternative? 3 ISPs augment cellular networks on their own Wi-Fi Femtocell Insufficient as a long-term solution High deployment cost High management cost Interferes with existing infrastructure

Our approach 4 Cellular provider purchases bandwidth on demand from 3 rd party resources Wi-Fi, femtocell, or other cellular resources Incentivize cellular offloading via auctions Effective price discovery Avoids long-term contracts Cut cost by leveraging the competition

Unique challenges Diverse spatial coverage Traffic uncertainty Non-truthful bidding and collusion 5

Cellular offloading as a reverse auction 6 Auction conducted periodically Cellular provider (A): buyer Hotspots: sellers Hotspots submit bids Cellular provider (A) serves as auctioneer A sector is divided into regions based on location of hotspots Objective: satisfy A’s traffic while minimizing the total cost Cost = cellular cost + hotspots cost R1 R2 R3 A

Naïve solution 7 Auction 1 Demand 1 Auction 2 Demand 2 Limited competition Cellular resource Cellular resource as a virtual bidder  Inter-region competition R1R2

iDEAL overview 8 Two phases of iDEAL Allocation: determine how to allocate cellular resources and 3 rd party resources to minimize cost Pricing: determine payment to 3 rd party resource owners

Global static allocation 9 Satisfy the demand with both Wi-Fi and cellular Translate cellular resource usage into spectrum Never buy more than offered Total cost: Wi-Fi + cellular

Global dynamic allocation 10

iDEAL pricing 11 VCG principle Pay the winners the opportunity cost Payment to winner w = the extra amount that other bidders could sell if w is not present iDEAL pricing Apply VCG over the whole sector as one auction Global opportunity cost Captures inter- and intra-region competition

iDEAL pricing: Example Region 1 (d: 1) Region 2 (d:1) r:1 v:$1 r:1 v:$9 r:1 v:$2 r:1 v:$1.5 Optimal allocation Allocation if 1 is not there Value sold by others: $3.5 Global opportunity cost: $2 The “local opportunity cost” is $9 r: amount of resource v: valuation of a single unit d: demand 1.Global opportunity cost captures inter-region competition and lowers cost 2.Payment is higher than bid Consider hotspot 1 Value sold by others: $1.5

Economic properties 13 Theorem 1: Truth-telling is optimal. Theorem 2: iDEAL is efficient (i.e., winners are the bidders with lowest valuation). Theorem 3: iDEAL is individually rational (i.e., bidders of the auction will get non-negative utility).

Understand collusions 14 Collusion strategies Single seller collusion Multi seller collusion In both cases, they use Supply Reduction Drop losing bids Reduce the capacity offered in winning bids Supply reduction: increases the opportunity cost  drives up price

Mitigating collusions 15 Dynamic demands make collusion hard Inaccurate traffic prediction  supply reduction may lead to missed winning opportunities Bidding as a group Hotspots owned by same party  bid as group  considered one bidder Removes competition within a group no incentive for supply reduction Inter-group competition retained Multi seller collusion is unstable Seller has incentive to leave the bidding ring

Evaluation methodology 16 Sector reports 3G HTTP sessions # of users Event driven trace player Detailed aggregated traffic demand Sector location Hotspot location Clustering Regions Pricing plan of major ISPs Bids Auctions

Comparison of truthful auctions 17 1.Auction based approaches much better than fixed pricing given enough competition 2.iDEAL consistently beats other auction based approaches 40 hotspots130 hotspots

40 hotspots130 hotspots Comparison of truthful auctions (cont.) 18 1.Global allocation efficiently allocates cellular resource to different regions. 2.Dynamic global allocation avoids provisioning for peak demand in each region.

Comparison of non-truthful auctions 19 Value consumption Cost 1.Non-truthful auctions invites gaming behaviors 2.Gaming causes fluctuation and can increase cost 3.VCG in iDEAL is stable, efficient and low-cost

Collusion under dynamic demands 20 50: 28% chance of higher utility 20: 5% chance Significantly weakens the incentive to collude Used two different sizes of bidding ring: 20 and 50

Collusion: Bidding as a group 21 Group bidding removes competition between a seller’s own hotspots and maintains the competition between different sellers, thus reducing the cost 40 hotspots130 hotspots

Conclusion 22 Design incentive framework for cellular offload Explicitly account for diverse spatial coverage of different resources Cope with dynamic traffic Promote truthfulness Provably efficient Guard against collusions Trace-driven simulations show iDEAL is efficient, low-cost and robust against collusion

Q&A Thank you 23

Backup slides 24

Practical Considerations 25 Supporting offloading to femtocells and dynamic roaming The same framework applies to purchasing femtocells and other cellular resources Handle partially overlapping spatial coverage Revise the constraint [C1] to split the resources from the same provider into different regions

Related Work 26 Measurement Balasubramanian et al. report Wi-Fi is available for 11% time and 3G is available for 87% time but they are negatively correlated Lee et al. find Wi-Fi offload 65% traffic without delay and 83% with over 1-hour delay Auction based offloading Zhou et al. uses auction to incentivize mobile users to wait until they reach Wi-Fi Chen et al. uses auction to incentivize femtocell owners to share resources Ignore three unique challenges iDEAL addresses Similar to local allocation in spirit

Design Goals Account for different spatial coverage of resources Achieve high efficiency Promote truthful bidding Low cost Guard against collusion 27

Mitigating Collusions (Cont.) 28 Stability of a multi-seller collusion Without utility sharing, a seller has no incentive to conduct supply reduction Follows from the truthfulness of VCG and that in our system sellers submit sealed, separated bids Utility sharing is hard to achieve in our system Hard to attribute utility change to collusion Demand and Wi-Fi availability is dynamic Hard to validate other bidders’ behavior Sellers submit sealed separately bids Can make it even harder via system design E.g. use delayed payment to further obfuscate the utility

Supporting Femtocell Offload 29 Benefit of femtocells is large when there are fewer Wi-Fi hotspots 16 femtocells

Supporting Dynamic Roaming 30 When Wi-Fi is insufficient, dynamic roaming can significantly cut down cost even with a small amount of capacity 40 hotspots

Implementation 31 Dynamic offloading involves three steps Identify a network to offload Solved by iDEAL Automatic authentication Solved by Hotspot 2.0 The roaming partners are updated dynamically according to the offload decision from iDEAL. Seamless offload to maintain the existing sessions Addressed by Dual Stack Mobile IP (DSMIP), DSMIPv6, …

System Architecture 32