Online Social Networks like Facebook, MySpace, **ng, etc. have become extremely popular.
Yet they have some limitations that we want to overcome for a next generation of social …

Hash tables-which map" keys" onto" values"-are an essential building block in modern
software systems. We believe a similar functionality would be equally valuable to large …

An efficient resource discovery mechanism is one of the fundamental requirements for grid
computing systems, as it aids in resource management and scheduling of applications …

Designing distributed computing systems is a complex process requiring a solid
understanding of the design problems and the theoretical and practical aspects of their …

Abstract Recent structured Peer-to-Peer (P2P) systems such as Distributed Hash Tables
(DHTs) offer scalable key-based lookup for distributed resources. However, they cannot be …

Locating content in decentralized peer-to-peer systems is a challenging problem. Gnutella, a
popular file-sharing application, relies on flooding queries to all peers. Although flooding is …

RFC 4981: Survey of Research towards Robust Peer-to-Peer Networks: Search Methods [RFC
Home] [TEXT|PDF|HTML] [Tracker] [IPR] [Info page] INFORMATIONAL Network Working Group …

Centralized Resource Description Framework (RDF) repositories have limitations both in
their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositories …

We present a Scalable Distributed Information Management System (SDIMS) that
aggregates information about large-scale networked systems and that can serve as a basic …

We propose a new approach for constructing P2P networks based on a dynamic
decomposition of a continuous space into cells corresponding to servers. We demonstrate …