research-article

Managing virtual money for satisfaction and scale up in P2P systems

Authors:

Jorge-Arnulfo Quiané-Ruiz,

Philippe Lamarre,

Sylvie Cazalens,

Patrick ValduriezAuthors Info & Claims

DaMaP '08: Proceedings of the 2008 international workshop on Data management in peer-to-peer systems

Pages 67 - 74

https://doi.org/10.1145/1379350.1379360

Published: 25 March 2008 Publication History

Abstract

In peer-to-peer data management systems query allocation is a critical issue for the good operation of the system. This task is challenging because participants may prefer to perform some queries than others. Microeconomic mechanisms aim at dealing with this, but, to the best of our knowledge, none of them has ever proposed experimental validations that, beyond query load or response time, use measures that are outside the microeconomic scope. The contribution of this paper is twofold. We present a virtual money-based query allocation process that is suitable for large-scale super peer systems. We compare a non microeconomic mediation with micro-economic ones from a satisfaction point of view. The experimental results show that the providers' invoice phase is as much important as the providers' selection phase for a virtual money-based mediation.

References

[1]

Google adwords, http://adwords.google.com.

[2]

R. K. Dash, P. Vytelingum, A. Rogers, E. David, and N. R. Jennings. Market-Based Task Allocation Mechanisms for Limited Capacity Suppliers. IEEE Transactions on Systems, 37(3):391--405, 2007.

Digital Library

[3]

D. Ferguson, C. Nikolaou, J. Sairamesh, and Y. Yemini. Economic Models for Allocating Resources in Computer Systems. In S. H. Clearwater, editor, Market-Based Control: A Paradigm for Distributed Resource Allocation. World Scientific, 1996.

Digital Library

[4]

P. Lamarre, S. Cazalens, S. Lemp, and P. Valduriez. A Flexible Mediation Process for Large Distributed Information Systems. In Proceedings of the Cooperative Information Systems Confeference (CoopIS), 2004.

[5]

E. P. Markatos. Tracing a large-scale peer to peer system: An hour in the life of gnutella. In Proceedings of the IEEE/ACM International Symposium on Cluster Computing and the Grid, 2002.

Digital Library

[6]

T. Özsu and P. Valduriez. Principles of Distributed Database Systems, Second Edition. Prentice-Hall, 1999.

Digital Library

[7]

F. Pentaris and Y. loannidis. Query Optimization in Distributed Networks of Autonomous Database Systems. ACM Transactions on Database Systems (TODS), 31(2):537--583, 2006.

Digital Library

[8]

F. Pentaris and Y. loannidis. Autonomic Query Allocation Based on Microeconomics Principles. In Proceedings of the International Confeference on Data Engineering (ICDE), 2007.

[9]

J.-A. Quiané-Ruiz, P. Lamarre, and P. Valduriez. SQLB: A Query Allocation Framework for Autonomous Consumers and Providers. In Proceedings of the Very Large Data Bases Conference (VLDB), 2007.

Digital Library

[10]

T. W. Sandholm. Multiagent Systems, a modern approach to Distributed Artificial Intelligence, chapter Distributed Rational Decision Making. The MIT Press, 2001.

Digital Library

[11]

S. Saroiu, P. K. Gummadi, and S. D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Proceedings of the Multimedia Computing and Networking Conference, 2002.

[12]

Y. Shoham and M. Tennenholtz. Fair Imposition. In Proceedings of International Joint Conference on Arüficial Intelligence (IJCAI), 2001.

Digital Library

[13]

M. Stonebraker, P. Aoki, W. Litwin, A. Pfeffer, A. Sah, J. Sidall, C. Staelin, and A. Yu. Mariposa: A Wide-Area Distributed Database System. Journal on Very Large Data Bases (VLDBJ), 5(1):48--63, 1996.

Digital Library

[14]

W. Vickrey. Counterspeculation, Auctions, and Competitive Sealed Tenders. Finance, 16(1), 1961.

[15]

B. Yang and H. Garcia-Molina. Designing a Super-Peer Network. In Proceedings of the International Conference on Data Engineering (ICDE), 2003.

Cited By

Upadhyaya PBalazinska MSuciu D(2012)How to price shared optimizations in the cloudProceedings of the VLDB Endowment10.14778/2168651.21686575:6(562-573)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.14778/2168651.2168657
Quiané-Ruiz JLamarre PValduriez P(2009)A self-adaptable query allocation framework for distributed information systemsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-008-0114-118:3(649-674)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.1007/s00778-008-0114-1

Index Terms

Managing virtual money for satisfaction and scale up in P2P systems

Recommendations

Money for nothing: exploiting negative externalities
EC '11: Proceedings of the 12th ACM conference on Electronic commerce

We show that existence of negative externalities among market participants competing for a scarce resource, a setting typical for electronic commerce and internet advertising, allows for emergence of the no-allocation equilibrium with positive revenues ...
Money Talks: Rebate Mechanisms in Reputation System Design

Reputation systems that rely on voluntary feedback from traders are important in creating and sustaining trust in markets. Feedback nevertheless is a public good, and providing it is often costly. We combine theory with a laboratory experiment to study ...
Matching and Money
EC '21: Proceedings of the 22nd ACM Conference on Economics and Computation

We analyze the implications of financial or other budget constraints in a model of matching with contracts. We assume that agents' preferences satisfy the net substitutability condition: i.e, if a price of a good increases, then minimizing the cost of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

DaMaP '08: Proceedings of the 2008 international workshop on Data management in peer-to-peer systems

March 2008

85 pages

ISBN:9781595939678

DOI:10.1145/1379350

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 March 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

EDBT '08

EDBT '08: 11th International Conference on Extending Database Technology

March 25, 2008

Nantes, France

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
152
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Upadhyaya PBalazinska MSuciu D(2012)How to price shared optimizations in the cloudProceedings of the VLDB Endowment10.14778/2168651.21686575:6(562-573)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.14778/2168651.2168657
Quiané-Ruiz JLamarre PValduriez P(2009)A self-adaptable query allocation framework for distributed information systemsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-008-0114-118:3(649-674)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.1007/s00778-008-0114-1

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents