Small-scale peer-to-peer overlays

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Small-scale peer-to-peer overlays

Full text

Pdf (139 KB)

Source

ACM SIGOPS Operating Systems Review archive
Volume 40 , Issue 3 (July 2006) table of contents

SPECIAL ISSUE: Self-organizing systems table of contents

Pages: 45 - 48

Year of Publication: 2006

ISSN:0163-5980

Author

Minor Gordon

University of Cambridge, Cambridge, UK

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 19, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1151374.1151385 What is a DOI?

ABSTRACT

Scalability and efficient global search in large-scale peer-to-peer overlays often come at the expense of small-scale, local interactions between peers. For many users, local operations such as browsing, messaging, and direct content exchange between nodes may be more useful than access to the network as a whole. In this note we sketch the design of a small-scale overlay for applications such as ticketing systems, editorial coordination, and ad hoc workflows that currently rely on more general and less efficient mediums such as e-mail. Peers in the overlay form local economies and attempt to maximize user-directed utility functions.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	David W. Aha , Dennis Kibler , Marc K. Albert, Instance-Based Learning Algorithms, Machine Learning, v.6 n.1, p.37-66, Jan. 1991 [doi>10.1023/A:1022689900470]
	2	Stephanos Androutsellis-Theotokis , Diomidis Spinellis, A survey of peer-to-peer content distribution technologies, ACM Computing Surveys (CSUR), v.36 n.4, p.335-371, December 2004 [doi>10.1145/1041680.1041681]
	3	Levente Buttyán , Jean-Pierre Hubaux, Stimulating cooperation in self-organizing mobile ad hoc networks, Mobile Networks and Applications, v.8 n.5, p.579-592, October 2003 [doi>10.1023/A:1025146013151]
	4	Mark Claypool , Phong Le , Makoto Wased , David Brown, Implicit interest indicators, Proceedings of the 6th international conference on Intelligent user interfaces, p.33-40, January 14-17, 2001, Santa Fe, New Mexico, United States [doi>10.1145/359784.359836]
	5	M. Falkner, M. Devetsikiotis, and I. Lambadaris. An overview of pricing concepts for broadband ip networks. IEEE Communications Surveys and Tutorials, 3(2), 2000.
	6	Leonard N. Foner, Yenta: a multi-agent, referral-based matchmaking system, Proceedings of the first international conference on Autonomous agents, p.301-307, February 05-08, 1997, Marina del Rey, California, United States [doi>10.1145/267658.267732]
	7	David Heckerman, A tutorial on learning with Bayesian networks, Proceedings of the NATO Advanced Study Institute on Learning in graphical models, p.301-354, March 1998, Erice, Italy
	8	Jeffrey O. Kephart , James E. Hanson , Amy R. Greenwald, Dynamic pricing by software agents, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.32 n.6, p.731-752, May 30 2000 [doi>10.1016/S1389-1286(00)00026-8]
	9	T. Moreton and A. Twigg. Trading in trust, tokens and stamps. In Proceedings of the 2nd Workshop on Economics of Peer-to-Peer Systems, 2003.
	10	Peter R. Pietzuch , Jean Bacon, Hermes: A Distributed Event-Based Middleware Architecture, Proceedings of the 22nd International Conference on Distributed Computing Systems, p.611-618, July 02-05, 2002
	11	A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218:329--??, 2001.
	12	S. Shi and J. S. Turner. Routing in overlay multicast networks. In Proceedings of IEEE INFOCOM, 2002.
	13	Michael Stonebraker , Robert Devine , Marcel Kornacker , Witold Litwin , Avi Pfeffer , Adam Sah , Carl Staelin, An economic paradigm for query processing and data migration in mariposa, Proceedings of the third international conference on on Parallel and distributed information systems, p.58-68, October 1994, Autin, Texas, United States
	14	A. Twigg. A subjective approach to routing in p2p and ad hoc networks. In Proceedings of the First International Conference on Trust Management, pages 225--238, 2003.
	15	H. Varian. Intermediate Microeconomics: A Modern Approach, Sixth Edition. W. W. Norton & Company, 2002.
	16	Christopher J. C. H. Watkins , Peter Dayan, Technical Note: $\cal Q$ -Learning, Machine Learning, v.8 n.3-4, p.279-292, May 1992 [doi>10.1007/BF00992698]
	17	S. Zhong, Y. Yang, and J. Chen. Sprite: A simple, cheat-proof, credit-based system for mobile ad hoc networks. In Proceedings of IEEE INFOCOM, 2003.