Low traffic overlay networks with large routing tables
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Decentralized algorithms using both local and random probes for P2P load balancing
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
IEEE/ACM Transactions on Networking (TON)
SCALLOP: A Scalable and Load-Balanced Peer-to-Peer Lookup Protocol
IEEE Transactions on Parallel and Distributed Systems
A hybrid query scheme to speed up queries in unstructured peer-to-peer networks
Advances in Multimedia
Computer Networks: The International Journal of Computer and Telecommunications Networking
P2P Networking and Applications
P2P Networking and Applications
Optimal node-selection algorithm for parallel download in overlay content-distribution networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Real-time diameter monitoring for time-evolving graphs
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
| Hi-index | 0.00 |
A number of Distributed Hash Table (DHT)-based protocols have been proposed to address the issue of scalability in peer-to-peer networks. In this paper, we present Ulysses, a peer-to-peer network based on the butterfly topology that achieves the theoretical lower bound of \frac{{\log n}}{{\log \log n}} on network diameter when the average routing table size at nodes is no more than log n. Compared to existing DHT-based schemes with similar raouting table size, Ulysses reduces the network diameter by a factor of log log n, which is 2-4 for typical configurations. This translates into the same amount of reduction on query latency and average traffic per link/node. In addition, Ulysses maintains the same level of robustness in terms of routing in the face of faults and recovering from graceful/ungraceful joins and departures, as provided by existing DHT-based schemes. The performance of the protocol has been evaluated using both analysis and simulation.