ROUTING IN THE “UMBRELLA” ARCHITECTURE

A. D. Sotiriou, P. Kalliaras, N. Mitrou

2006

Abstract

Routing in a Peer-to-Peer environment faces a number of challenges, mainly due to its distributed nature. In this paper we evaluate a new distributed hash table architecture that is able to provide efficient routing through a fixed-size table. By introducing a set of base algorithms, multiple replication schemas, virtual nodes and a variable repair mechanism, we are able to ensure successful lookups of published keywords. Along with theoretical analysis of our proposed work, we present extensive simulation results that testify and evaluate our protocol.

References

  1. Francis, P. (1999). “Yoid : Extending the Multicast Internet Architecture,” White paper, http://www.aciri.org/yoid
  2. Ghodsi, A., Alima, L.,O., Haridi, S. (2005). “Symmetric Replication for Structured Peer-to-Peer Systems”, The 3rd International Workshop on Databases, Information Systems and Peer-to-Peer Computing, Trondheim, Norway , August
  3. Joseph, S. (2003). “An Extendible Open Source P2P Simulator,” P2PJournal
  4. Karger, D., Lehman, E., Leighton, F., Levine, M., Lewin, D., Panigrahy, R. (1997). “Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web”, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX
  5. Madadhain J., Fisher D., Smyth P., White S., Boey Y. (2005). “Analysis and Visualization of Network Data using JUNG”, http://jung.sourceforge.net
  6. Maymounkov, P., Mazieres, D. (2002). “Kademlia: A peerto -peer informatic system based on the XOR metric,” in Proceedings of IPTPS'02, (Cambridge, MA)
  7. Moy J. (1998). “OSPF Version 2”, Network Working Group, RFC 2328
  8. National Institute of Standards and Technology. (1995). “FIPS Pub 180-1: Secure Hash Standard (SHA-1),” Federal Information Processing Standards Publication
  9. Plaxton, G., Rajaraman, R., Richa, A.W. (1997). “Accessing Nearby Copies of Replicated Objects in a Distributed Environment,” in 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)
  10. Ratsanamy, S., Francis, P., Handley, M., Karp, R. (2001). “A scalable content-addressable network,” in ACM SIGCOMM Conference, ACM Press, San Diego (CA)
  11. Rowstron, A., Druschel, P. (2001). “Pastry: Scalable, decentralized object location, and routing for largescale Peer-to-Peer systems,” in Middleware 2001
  12. Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H. (2001). “Chord: A Peer-to-Peer Lookup Service for Internet Applications,” in Proc. SIGCOMM
  13. Zhao, B. Y., Huang, L., Stribling, J., Rhea, S.C., Joseph,A.D., Kubiatowicz, J.D. (2004). “Tapestry: A resilient global-scale overlay for service deployment,” IEEE Journal on Selected Areas in Communications
Download


Paper Citation


in Harvard Style

D. Sotiriou A., Kalliaras P. and Mitrou N. (2006). ROUTING IN THE “UMBRELLA” ARCHITECTURE . In Proceedings of the International Conference on Wireless Information Networks and Systems - Volume 1: WINSYS, (ICETE 2006) ISBN 978-972-8865-65-8, pages 234-241. DOI: 10.5220/0002088002340241


in Bibtex Style

@conference{winsys06,
author={A. D. Sotiriou and P. Kalliaras and N. Mitrou},
title={ROUTING IN THE “UMBRELLA” ARCHITECTURE},
booktitle={Proceedings of the International Conference on Wireless Information Networks and Systems - Volume 1: WINSYS, (ICETE 2006)},
year={2006},
pages={234-241},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002088002340241},
isbn={978-972-8865-65-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Wireless Information Networks and Systems - Volume 1: WINSYS, (ICETE 2006)
TI - ROUTING IN THE “UMBRELLA” ARCHITECTURE
SN - 978-972-8865-65-8
AU - D. Sotiriou A.
AU - Kalliaras P.
AU - Mitrou N.
PY - 2006
SP - 234
EP - 241
DO - 10.5220/0002088002340241