The forwarding index of communication networks
IEEE Transactions on Information Theory
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
On forwarding indices of networks
Discrete Applied Mathematics
A course in computational algebraic number theory
A course in computational algebraic number theory
The forwarding index of directed networks
Discrete Applied Mathematics
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
HOT-P2P '05 Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems
DIMES: let the internet measure itself
ACM SIGCOMM Computer Communication Review
Cycloid: a constant-degree and lookup-efficient P2P overlay network
Performance Evaluation - P2P computing systems
Democratizing content publication with coral
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Shark: scaling file servers via cooperative caching
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Paths to stardom: calibrating the potential of a peer-based data management system
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Cayley graphs as models of deterministic small-world networks
Information Processing Letters
HyperCuP: hypercubes, ontologies, and efficient search on peer-to-peer networks
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
ComNET: a P2P community network
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Cayley DHTs — a group-theoretic framework for analyzing DHTs based on cayley graphs
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Spurring adoption of DHTs with openhash, a public DHT service
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
IEEE Communications Magazine
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Content-based video search on peer-to-peer networks
International Journal of Grid and Utility Computing
Sophia: A local trust system to secure key-based routing in non-deterministic DHTs
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
One of the main challenges of peer-to-peer (P2P) systems is how to efficiently store and locate the ever-increasing amount of data being shared by participants. Indexing methods have been adapted on top of P2P networks and querying methods have been developed to handle data distribution across different nodes. Among these technologies, Distributed hash tables (DHTs) provide the highest scalable substrates. Although DHTs have many virtues, yet, it is hard to develop certain types of applications. For instance, distributing multimedia content among users who form communities based on their interests or their location is difficult to achieve in plain DHTs. To support a broader range of applications, we present Echo, a framework that benefits from the recursive structure of DHTs to embed clusters into their structures at almost no cost. While retaining the uniformity, scalability and load balancing of the original designs, Echo improves their scalability by taking advantage of the locality in communication exhibited by communities of users. Since our framework is based on the Cayley graph-theoretic model, it is applicable to a large subset of the most representative DHTs. As an illustrative example, we show how Chord can be transformed into a clustered DHT using our methodology. Furthermore, we give some indicative hints of how six different DHTs-Randomized Chord, Symphony, Kademlia, P-Grid, Tapestry and Pastry-can be transformed into their Echoing versions. Simulations results verify the effectiveness of Echo.