Learn More
Peer-to-peer systems promise inexpensive scalability, adaptability, and robustness. Thus, they are an attractive platform for file sharing, distributed wikis, and search engines. These applications often store weakly structured data, requiring sophisticated search algorithms. To simplify the search problem, most scalable algorithms introduce structure to(More)
Massively Multiplayer Online Games (MMOGs) are a risky business: while they offer potential profits beyond those of conventional computer games, they also require costly investment in the necessary hardware infrastructure. In nearly every MMOG today, these costs come from the use of a Client/Server architecture where the load of possibly hundred thousands(More)
Publish/subscribe systems are successfully used to decouple distributed applications. However, their efficiency is closely tied to the topology of the underlying network, the design of which has been neglected. Peer-to-peer network topologies can offer inherently bounded delivery depth, load sharing, and self-organisation. In this paper, we present a(More)
The goal of ubiquitous computing research is refine devices to the point where their use is transparent. For many applications with mobile devices, transparent operation requires that the device be location-aware. Unfortunately, the location of an individual can be used to infer highly private information. Hence, these devices must be carefully designed ,(More)
Replication is widely used in unstructured peer-to-peer systems to improve search or achieve availability. We identify and solve a subclass of replication problems where each object is associated with a maintainer node, and its replicas should only be available as long as its maintainer is part of the network. Such requirement can be found in various(More)
In many distributed applications, pairs of predicates and data have to be evaluated locally. This includes publish-subscribe, keyword search for documents, and selection queries on tuples. We will present the Bit Zipper Rendezvous as a peer-to-peer based solution to these problems. Though not as efficient as value-based partitioning approaches , the Bit(More)
—This paper presents a novel transport protocol, CUSP, specifically designed with complex and dynamic network applications in mind. Peer-to-peer applications benefit in particular , as their requirements are met by neither UDP nor TCP. While other modern transports like SCTP or SST have also tried to combine the advantages of TCP and UDP, CUSP overcomes(More)
Exhaustive search in large-scale peer-to-peer systems is complicated by heterogeneity, crashes, node churn, hotspots, and weakly structured data. While existing approaches solve some of these problems, the BubbleStorm system offers a naturally integrated and simple solution based on random multigraphs. The simplicity of this mathematical structure allows us(More)