Overlay partition: Iterative detection and proactive recovery

IEEE International Conference on Communications

Volumn , Issue , 2007, Pages 1854-1859

  Qiu, Tongqing ^a,b   Chan, Edward ^b   Chen, Guihai ^a  

^a NANJING UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; MULTIMEDIA SYSTEMS; ONLINE SYSTEMS; WEB SERVICES;

MULTIMEDIA STREAMING; ONLINE GAMING; OVERLAY NETWORKS;

ITERATIVE DECODING;

EID: 38549085414     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2007.309     Document Type: Conference Paper

References (21)

1. D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris., "Resilient overlay networks," in Proceedings of SOSP 2001, 2001.
2. http://rfc-gnutella.sourceforge.net.
3. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proceedings of the ACM SIGCOMM, 2001.
4. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in Middleware 2001, 2001.
5. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz, "Tapestry: A resilient global-scale overlay for service deployment," IEEE Journal on Selected Areas in Communications, vol. 22, no. 1, pp. 4.1-53, Jan 2004.
6. S. Q. Zhuang, D. Geels, I. Stoica, and R. H. Katz, "On failure detection algorithms in overlay networks," in Proceedings of INFOCOM 2005, 2005.
7. G. Pandurangan, P. Raghavan, and E. Upfal, "Building low-diameter p2p networks," in Proceedings of IEEE Symposium on Foundations of Computer Science 2001, 2001
8. D. LibenNowell, H. Balakrishnan, and D. Karger, "Analysis of the evolution of peer-to-peer systems," in Proceedings of Principles of Distributed Computing(PODC 2002), 2002.
9. A. Mislove, A. Post, A. Haeberlen, and P. Druschel, "Experiences in building and operating epost, a reliable peer-to-peer application," in Proceedings of Eurosys 2005, 2005.
10. W. Hohberg, "How to find biconnected components in distributed networks," Journal of Parrallel and Distributed Computing, vol. 9, no. 4, pp. 374-386, August 1990.
11. J. Park, N. Tokura, T. Masuzawa, and K. hagiharra, "Efficient distributed algorithms solving problems about the connectivity of network," in Proceedings of Systems and Computers in Japan, 1992.
12. X. Liu, L. Xiao, A. Kreling, and Y. Liu, "Optimizing overlay topology by reducing cut vertices," in Proceedings of NOSSDAV 2006, 2006.
13. T. H. Cormen, C. E. Leisereson, and R. L. Rivest, Introduction to Algorithms. MIT Press, 1990.
14. F. Bustamante and Y. Qiao, "Friendships that last: Peer lifespan and its role in p2p protocols," in Proceedings of International Workshop on Web Content Caching and Distribution, 2003.
15. S. S. Lam and H. Liu, "Failure recovery for structured p2p networks: protocol design and performance evaluation," in ACM SIGMETRICS Performance Evaluation Review, 2004.
16. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee., "How to model an internetwork," in Proceedings of INFOCOM, 1996.
17. Z. Liu, R. Yuan, Z. Li, H. Li, and C. Chen, "Survive under high, churn in structured p2p systems: evaluation and strategy," in Proceedings of ICCS 2006, 2006.
18. S. Saroiu, P. K. Gummadi, and S. D. Gribble, "Measuring and analyzing the characteristics of napseter and gnutella hosts," Multimedia Systems, vol. 9, no. 1, pp. 170-184, 2003.
19. M. Ripeanu and I. Foster, "Peer-to-peer architecture case study: Gnutella network," in Proceedings of IEEE P2P 2001, 2001.
20. E. Sit and R. Morris, "Security considerations for peer-to-peer distributed hash, tables," in Proceedings of IPTPS'02, 2002.
21. N. J. Harvey, J. Dunagan, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman., "Skipnet: A scalable overlay network with practical locality properties," in Proceedings of USITS 03, 2003.