Auction-based Admission Control for Continuous Queries in a Multi-Tenant DSMS

被引：0

作者：

Al Moakar, Lory ^{[1
]}

Chrysanthis, Panos K. ^{[1
]}

Chung, Christine ^{[2
]}

Guirguis, Shenoda ^{[1
,3
]}

Labrinidis, Alexandros ^{[1
]}

Neophytou, Panayiotis ^{[1
]}

Pruhs, Kirk ^{[1
]}

机构：

[1] Univ Pittsburgh, Dept Comp Sci, Pittsburgh, PA 15260 USA

[2] Connecticut Coll, Dept Comp Sci, New London, CT 06320 USA

[3] Intel Co, R&D, Hillsboro, OR USA

来源：

INTERNATIONAL JOURNAL OF NEXT-GENERATION COMPUTING | 2012年 / 3卷 / 03期

基金：

美国安德鲁·梅隆基金会;

关键词：

Data Streams; Multi-Tenant; Admission Control; Game Theory; Auction Mechanisms; Strategyproof; Sybil-immune;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The growing popularity of monitoring applications and "Big Data" analytics used by a variety of users will lead to a multi-tenant data stream management system. This paper deals with the problem of admission control of continuous queries, where the stream processing resources are sold to the end users. We employ variable pricing by means of auction-based mechanisms. The admission control auction mechanism determines which queries to admit, and how much to charge the user for each query in a way that maximizes system revenue. The admission mechanism is required to be strategyproof and sybil-immune, incentivizing users to use the system honestly. Specifically, we require that each user maximizes her payoff by bidding her true value of having a query run. We further consider the requirement that the mechanism be sybil-immune: that is, no user can increase her payoff by submitting queries that she does not value. Given the above requirements, the main challenges come from the difficulty of effectively utilizing shared processing of continuous queries. We design several payment mechanisms and experimentally evaluate them.

引用

页码：247 / 273

页数：27

共 26 条

[1]

Aggarwal C, 2006, PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P1083

[2] Admission Control Mechanisms for Continuous Queries in the Cloud [J].

Al Moakar, Lory ;

Chrysanthis, Panos K. ;

Chung, Christine ;

Guirguis, Shenoda ;

Labrinidis, Alexandros ;

Neophytou, Panayiotis ;

Pruhs, Kirk .

26TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING ICDE 2010, 2010, :409-412

[3]

AmazonEC, 2009, AM EL COMP

[4]

Arasu A, 2003, IEEE DATA ENG B, P19

[5]

Aurora, 2003, VLDB J, V12, P120

[6]

Babcock B., 2003, PROC ACM SIGMOD INT, P253

[7]

Blumrosen L, 2007, ALGORITHMIC GAME THEORY, P267

[8]

Carney D., 2002, Proceedings of the Twenty-eighth International Conference on Very Large Data Bases, P215

[9]

Chakravarthy S, 2009, ADV DATABASE SYST, V36, P1, DOI 10.1007/978-0-387-71003-7_1

[10]

Chandrasekaran S., 2003, SIGMOD, P668

← 1 2 3 →