Relaxed-2-Chord: Efficiency, flexibility and provable stretch

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Cordasco, Gennaro ^a   Corte, Francesca Della ^a   Negro, Alberto ^a   Sala, Alessandra ^b   Scarano, Vittorio ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHORD PROTOCOL; DISTRIBUTED HASH TABLE; HOP BY HOP; LOOKUP OPERATIONS; LOOKUPS; LOW LATENCY; MANAGEMENT COSTS; NEW DESIGN; NUMBER OF HOPS; P2P NETWORK; RANDOM SAMPLING; ROUTING EFFICIENCY; ROUTING TABLE; UNDERLYING NETWORKS; UNICAST;

DISTRIBUTED PARAMETER NETWORKS; OVERLAY NETWORKS; ROUTING ALGORITHMS;

ROUTING PROTOCOLS;

EID: 70449823666     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5160951     Document Type: Conference Paper

References (24)

1. I. Abraham, A. Badola, D. Bickson, D. Malkhi, S. Maloo, and S. Ron. "Practical Locality-Awareness for Large Scale Information Sharing". In Proc. of 4-th International Workshop on Peer-to-Peer Systems (IPTPS'05) 2005.
2. I. Abraham, D. Malkhi, and O. Dobzinski. "LAND: Stretch (1 + ε) Locality-Aware Networks for DHTs". In Proc. of 15-th Symposium on Discrete Algorithms (SODA'04), pages 550-559, 2004.
3. M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron, "Exploiting Network Proximity in Distributed Hash Tables". In Proc. of the Inter. Workshop on Future Directions in Distributed Computing (FuDiCo), Bertinoro, Italy, Jun. 2002.
4. R. Cox, F. Dabek, F. Kaashoek, J. Li, and R. Morris, "Practical, distributed network coordinates". In Proc. of the 2nd Workshop on Hot Topics in Networks (HotNets-II), Cambridge, MA, ACM SIGCOMM, Nov. 2003.
5. G. Cordasco, A. Negro, A. Sala, and V. Scarano, "PON: Exploiting Proximity on Overlay Networks". In Proc. of 4th International Workshop on Hot Topics in Peer-to-Peer Systems (HotP2P 2007), Mar. 2007.
6. G. Cordasco and A. Sala, "2-Chord Halved". In Proc. of 2nd International Workshop on Hot Topics in Peer-to-Peer Systems, (HOT-P2P 2005), pages 72-79, Jul. 2005.
7. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems". In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Nov. 2001.
8. F. Dabek, J. Li, E. Sit, J. Robertson, F. Kaashoek, and R. Morris, "Designing a DHT for low latency and high throughput". In Proc. of the 1st Symposium on Networked System Design and Implementation (NSDI '04), Mar. 2004.
9. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker and I. Stoica, "The Impact of DHT Routing Geometry on Resilience and Proximity". In Proc. of ACM SIGCOMM, Aug. 2003.
10. P. Ganesan and G. S. Manku, "Optimal Routing in Chord". In Proc. of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '04), pages 176-185, Jan. 2004.
11. C. GauthierDickey, D. Zappala, V. Lo and J. Marr, "Low Latency and Cheat-proof Event Ordering for Peer-to-Peer Games". In Proc. of ACM NOSSDAV, Jun. 2004.
12. D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewinand and R. Panigrahy, "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on World Wide Web". In Proc. of the 29th Annual ACM Symposium on Theory of Computing, May 1997.
13. A. Kumar, S. Merugu, J. Xu, E. Zegura and X. Yu, "Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-Peer Network". European Transactions on Telecommunications on P2P Networking and P2P Services, Vol. 15, No. 6, pp. 571-587, Dec. 2004.
14. L. Kleinrock, "Queueing Systems". Vol. I and II, J. Wiley and Sons, 1975.
15. T. Locher, S. Schmid, and R. Wattenhofer, "eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System". In Proc. of 6-th IEEE Inter. Conference on Peer-to-Peer Computing (P2P'06), 2006.
16. G. S. Manku, M. Naor, and U. Wieder, "Know thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks". In Proc. of 36th thirty-sixth annual ACM Symposium on Theory of Computing (STOC '04), pages 54-63, Jun. 2004.
17. T. S. Eugene Ng and H. Zhang, "Predicting Internet network distance with coordinates-based approaches". In Proc. of IEEE Infocom, 2002.
18. S. P. Ratnasamy, P. Francis, M. Handley, R. Karp, andS. Shenker, "A Scalable Content-Addressable Network". In Proc. of ACM Special Interest Group on Data Communication (ACM SIGCOMM '01), pages 161-172, Aug. 2001.
19. S. P. Ratnasamy, "A Scalable Content-Addressable Network". PhD Thesis, University of California, Berkeley, 2002.
20. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications". In IEEE/ACM Transactions on Networking (TON), Volume 11, No. 1, pages 17-32, Feb. 2003.
21. E. Setton, J. Noh and B. Girod, "Low Latency video Streaming over Peer-to-Peer Networks". In Multimedia and Expo, 2006 IEEE International Conference on, Jul. 2006.
22. J. Xu, A. Kumar, X. Yu, "On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks". In IEEE Journ. on Selected Areas in Comm., Volume 22, No. 1, Jan. 2004.
23. H. Zhang, A. Goel, and R. Govindan, "IncrementallyImproving Lookup Latency in distributed Hash Table Systems". In Proc. of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (SIGMETRICS '03), 2003.
24. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, J. D. Kubiatowicz, and A. D. Joseph, "Tapestry: A Global-scale Overlay for Rapid Service Deployment". In IEEE Journal on Selected Areas in Communications (J-SAC), Vol. 22, No. 1, pages 41-53, Jan. 2004.