Fault-tolerant routing for P2P systems with unstructured topology

Proceedings - 2005 Symposium on Applications and the Internet, SAINT'2005

Volumn , Issue , 2005, Pages 256-263

  Mariani, Leonardo ^a  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DECENTRALIZED SYSTEM; FAULT TOLERANT ROUTING; LOCAL INTERACTIONS; MOBILE SYSTEMS; NEW APPLICATIONS; P2P SYSTEM; PEER-TO-PEER PARADIGM;

DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; INTERNET; NETWORK ARCHITECTURE; QUALITY ASSURANCE; TOPOLOGY;

PEER TO PEER NETWORKS;

EID: 78649692140     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. K. Aberer, M. Punceva, M. Hauswirth, and R. Schmidt. Improving data access in P2P systems. IEEE Internet Computing, 6(1):58-67, January/February 2002.
2. A. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. P. Wattenhofer. Farsite: Federated, available, and reliable storage for an incompletely trusted environment. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation, December 2002.
3. R. Buyya, D. Abramson, J. Giddy, and H. Stockinger. Economic models for resource management and scheduling in grid computing. The Journal of Concurrency and Computation: Practice and Experience, 14(13-15):1507-1542, November/December 2002. Special Issue on Grid Computing Environments.
4. M. Castro and B. Liskov. Practical byzantine fault tolerance. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation, pages 1-14, 2002.
5. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval systems. In Proceedings of the ICSI Workshop on Design Issuer in Anonymity and Unobservability, number 2009 in Lecture Notes in Computer Science. Springer-Verlag, Berkley, California, 2001.
6. Clip2. The gnutella protocol specification v0.4. Specification, 2001.
7. E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. In Proceedings of ACM Special Interest Group on Data Communication (SIGCOMM) 2002, August 2002.
8. F. DePaoli and L. Mariani. Dependability in peer-to-peer systems. IEEE Internet Computing, 8(4):54-61, July/August 2004.
9. P. S. Dodds, D. J. Watts, and C. F. Sabel. Information exchange and the robustness of organizational networks. Proceedings of the National Academy of Sciences of the United States of America, 21(100):12516-12521, October 2003.
10. C. Fiduccia and R. Mattheyses. A linear time heurisic for improving network partition. In Proceedings of the ACM/IEEE Design Automation Conference, pages 175-181, 1982.
11. R. Gentilini, C. Piazza, and A. Policriti. Computing strongly connected components in a linear number of symbolic steps. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 573-582, Baltimore, Maryland, 2003. Society for Industrial and Applied Mathematics.
12. S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by simulated annealing. Science, 220(4598):671-680, May 1983.
13. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of the ACM Special Interest Group on Data Communication (SIGCOMM) 2001, San Diego, California, 2001.
14. S. Rhea, C. Wells, P. Eaton, D. Geels, B. Zhao, H. Weatherspoon, and J. Kubiatowicz. Maintenance-free global data storage. IEEE Internet Computing, 5(5):40-49, September/ October 2001.
15. B. Riess, K. Doll, and M. Frank. Partitioning very large circuits using analytical placement techniques. In Proceedings of the third ACM/IEEE Design Auotmation Conference, pages 646-651, 1994.
16. K. Samant and S. Bhattacharyya. Topology, search, and fault tolerance in unstructured P2P networks. In Proceedings of the 27th Hawaii Conference on System Sciences, pages 289-294. IEEE, January 2004.
17. Sharman Networks. KaZaA. http://www.kazaa.com, Visited in 2004.
18. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. Kaashoek, F. Dabek, and H. Balakrisham. Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 11(1):17-32, 2003.
19. R. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.
20. D. Watts and S. Strogatz. Collective dynamics of 'small world' networks. Nature, 390:440-442, 1998.
21. B. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide area location and routing. technical report UCB/CSD-01-1141, University of California at Berkeley, April 2001.