We present an approach to support massively multi-player games on peer-to-peer overlays. Our approach exploits the fact that players in MMGs display locality of interest, and therefore can form self-organizing groups based on their locations in the virtual world. To this end, we have designed

Peer-to-peer (P2P) online communities are commonly perceived as an environment offering both opportunities and threats. One way to

Abstract. We consider the free-rider problem in peer-to-peer file sharing networks such as Napster: that individual users are provided with no incentive for adding value to the network. We examine the design implications of the assumption that users will selfishly act to maximize their own rewards

, maxflowbased subjective reputation, and adaptive stranger policies. Through simulation, we show that these techniques can drive a system of strategic users to nearly optimal levels of cooperation.

Abstract — Over the Internet today, computing and communications environments are significantly more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. There has been much interest in emerging Peer-to-Peer (P2P) network overlays

Peer to Peer (P2P) networks boast three characteristics that make them unique. First, they are layered networks conceived and operating in a similar fashion to the Internet. Second, they are completely decentralized, making servers of individual computers at the P2P layer, and acting in the way

Computer Science I dedicate this thesis to my parents, sister, family, professors and friends, and to everybody that contributed directly or indirectly to make this work concrete. ACKNOWLEDGMENTS Everyday I remind myself that my inner and outer life are based on the labors of other men, living and dead, and that I must exert myself in order to give in the same measure as I have received and am still receiving. Albert Einstein This work is fruit of many collaborations. I am extremely grateful to my advisor, Distinguished Professor Don Towsley. His ideas, support, dedication and patience during the last four years are really inspiring to me. Many of the lessons that I learned from him, about how to tackle the right problems as well as on how to meticulously handle details, will stay with me for the rest of my life, and his influence in this thesis

The recent file storage applications built on top of peer-to-peer distributed hash tables lack search capabilities. We believe that search is an important part of any document publication system. To that end, we have designed and analyzed a distributed search engine based on a distributed hash

We model a market populated by two groups of boundedly rational agents: “newswatchers” and “momentum traders.” Each newswatcher observes some private information, but fails to extract other newswatchers’ information from prices. If information diffuses gradually across the population, prices

We propose a fully-distributed peer-to-peer architecture to solve the scalability problem of Networked Virtual Environment in a simple and efficient manner. Our method exploits locality of user interest inherent to such systems and is based on the mathematical construct Voronoi diagram. Scalable