skip to main content
10.1145/1052220.1052240acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicecConference Proceedingsconference-collections
Article

Pricing in publish/subscribe systems

Published: 25 March 2004 Publication History

Abstract

Publish/subscribe systems have gained increasing interest in the past few years. There are many commercial products available today that rely on them directly. However, up to now there has been no discussion about pricing in such systemsWe present a new strategyproof distributed algorithm that calculates the maximum subtree of the broker network and the costs arising for the clients. These payments sum up to the amount defined by the marginal cost mechanism and maximize the social surplus (i.e. the sum of the utilities minus the costs). It is taken into account that there may be multiple publishers serving one filter. An extended self-stabilized version copes with systems whose structure underlies a permanent change when publishers (dis-) appear and client utility changes. An adjustment is presented that considers different rates for subscriptions and therefore weakens the previous all-or-nothing scenario.

References

[1]
Micah Adler and Dan Rubenstein. Pricing multicasting in more practical network models. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algor. (SODA), pages 981--990. ACM-SIAM, 2002.
[2]
Markus Bläser. Budget balanced mechanisms for the multicast pricing problem with rates. In Proc. 4th ACM Conf. on Electronic Commerce, pages 194--195, 2002.
[3]
Markus Bläser. Budget balanced mechanisms for the multicast pricing problem with rates. Technical report SIIM-TR-A-03-02, Institut für Informatik and Mathematik, Universität Lübeck, 2003.
[4]
P. Th. Eugster, P. Felber, R. Guerraoui, and A.-M. Kermarrec. The many faces of publish/subscribe. ACM Computing Surveys, 35(2): 114--131, June 2003.
[5]
J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. A BGP-based mechanism for lowest-cost routing. In Proceedings of the 2002 ACM Symposium on Principles of Distributed Computing., 2002.
[6]
J. Feigenbaum and S. Shenker. Distributed algorithmic mechanism design: Recent results and future directions. In 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 2002.
[7]
Joan Feigenbaum, Christos H. Papadimitriou, and Scott Shenker. Sharing the cost of multicast transmissions. Journal of Computer and System Sciences, 63(1): 21--41, 2001.
[8]
Friedemann Mattern. Verteilte Basisalgorithmen. Springer, 1989.
[9]
H. Moulin. Incremental cost sharing: characterization by strategy-proofness. Social Choice and Wellfare, 16:279--320, 1999.
[10]
H. Moulin and S. Shenker. Strategyproof sharing of submodular costs: budget balance versus efficiency. Economic Theory, 18:511--533, 2001.
[11]
Gero Mühl. Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis, Darmstadt University of Technology, September 2002.
[12]
Noam Nisan and Amir Ronen. Algorithmic mechanism design. In Proceedings of 31st Symposium on Theory of Computing, pages 129--140. ACM, 1999.
[13]
Andreas Tanner and Gero Mühl. A formalisation of message-complete publish/subscribe systems. To appear as Technical Report at TU Berlin.

Cited By

View all
  • (2007)Addressing Click Fraud in Content Delivery SystemsProceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications10.1109/INFCOM.2007.36(240-248)Online publication date: 1-May-2007

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICEC '04: Proceedings of the 6th international conference on Electronic commerce
March 2004
684 pages
ISBN:1581139306
DOI:10.1145/1052220
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]

Sponsors

  • ICEC: International Center for Electronic Commerce

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 March 2004

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 150 of 244 submissions, 61%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2007)Addressing Click Fraud in Content Delivery SystemsProceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications10.1109/INFCOM.2007.36(240-248)Online publication date: 1-May-2007

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media