Advertisement

DHT-based Functionalities Using Hypercubes

  • José I. Alvarez-Hamelin
  • Aline C. Viana
  • Marcelo D. de Amorim
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 212)

Abstract

Decoupling the permanent identifier of a node from the node’s topology-dependent address is a promising approach toward completely scalable self-organizing networks. Existing solutions use a logical tree-like structure that, although allowing for simple address assignment and management, lead to low route selection flexibility. This clearly results in low routing performance and poor resilience to failures. In this paper, we propose to increase the number of candidate paths by using incomplete hypercubes. We will see that this solution can cover a wide range of applications by adapting to the dynamics of the network.

Key words

Self-organizing networks indirect routing DHT hypercubes 

References

  1. 1.
    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,” IEEE/ACM Transactions on Networking, vol. 11, no. 1, pp. 17–32, Feb. 2003.CrossRefGoogle Scholar
  2. 2.
    L. Blazevic, L. Buttyan, S. G. S. Capkun, J. P. Hubaux, and J. Y. L. Boudec, “Self-organization in mobile ad-hoc networks: the approach of terminodes,” IEEE Computer Communications Magazine, June 2001.Google Scholar
  3. 3.
    J. Li, J. Jannotti, D. S. J. D. Couto, D. R. Karger, and R. Morris, “A scalable location service for geographic ad hoc routing,” in Proceedings of ACM MOBI-COM’00, Aug. 2000.Google Scholar
  4. 4.
    Y. Xue, B. Li, and K. Nahrstedt, “A scalable location management scheme in mobile ad-hoc networks,” in Proceedings of IEEE Conference on Local Computer Networks (LCN), (Tampa, FL, USA), Nov. 2001.Google Scholar
  5. 5.
    B. Chen and R. Morris, “L+: Scalable landmark routing and address lookup for multi-hop wireless networks,” tech. rep., Massachusetts Institute of Technology, Cambridge, Massachusetts-MIT LCS Technical Report 837 (MIT-LCS-TR-837), Mar. 2002.Google Scholar
  6. 6.
    J. Eriksson, M. Faloutsos, and S. Krishnamurthy, “Scalable ad hoc routing: The case for dynamic addressing,” in Proceedings of IEEE INFOCOM’04, (Hong Kong), Mar. 2004.Google Scholar
  7. 7.
    A. C. Viana, M. D. Amorim, S. Fdida, and J. F. Rezende, “Indirect routing using distributed location information,” ACM Wireless Networks, vol. 10, no. 6, pp. 747–758, Dec. 2004.CrossRefGoogle Scholar
  8. 8.
    A. C. Viana, M. D. Amorim, S. Fdida, and J. F. Rezende, “Self-organization in spontaneous networks: the approach of dht-based routing protocols.” to appear in Ad Hoc Networks Journal, 2005.Google Scholar
  9. 9.
    J. P. Hubaux, T. Gross, J. Y. L. Boudec, and M. Vetterli, “Towards self-organized mobile ad hoc networks: the terminodes project,” IEEE Communications Magazine, vol. 39, no. 1, pp. 118–124, Jan. 2001.CrossRefGoogle Scholar
  10. 10.
    Terminodes Project. http://www.terminodes.com/.Google Scholar
  11. 11.
    Grid Project. http://www.pdos.lcs.mit.edu/grid/.Google Scholar
  12. 12.
    J. Eriksson, M. Faloutsos, and S. Krishnamurthy, “Peernet: Pushing peer-to-peer down the stack,” Proceedings of International Workshop on Peer-To-Peer Systems (IPTPS’03), Feb. 2003.Google Scholar
  13. 13.
    P. F. Tsuchiya, “The landmark hierarchy: a new hierarchy for routing in very large networks,” in Proceedings of ACM SIGCOMM’88, Aug. 1988.Google Scholar
  14. 14.
    P. F. Tsuchiya, “Landmark routing: Architecture, algorithms and issues,” tech. rep., MTR-87W00174, MITRE Corporation, Sept. 1987.Google Scholar
  15. 15.
    J. Broch, D. A. Maltz, D. B. Johnson, Y. Hu, and J. Jetcheva, “A performance comparison of multi-hop wireless ad hoc network routing protocols,” in Proceed-ings of ACM MOBICOM’98, Oct. 1998.Google Scholar
  16. 16.
    S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The broadcast storm problem in a mobile ad hoc network,” in Proceedings of ACM MOBICOM’99, pp. 152–162, Aug. 1999.Google Scholar
  17. 17.
    I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana, “Internet indirection infrastructure,” in Proceedings of ACM SIGCOMM’02, Aug. 2002.Google Scholar
  18. 18.
    C. E. Perkins and P. Bhagwat, “Highly dynamic destination sequenced distance-vector routing (dsdv) for mobile computers,” in Proceedings of ACM SIG-COMM’94 Oct. 1994.Google Scholar
  19. 19.
    Y. Saad, “Data communication in hypercubes,” tech. rep., Research Report 428, Department of Computer Science, Yale University, New Haven, CT, 1985.Google Scholar
  20. 20.
    F. T. Leighton, Introduction to parallel algorithms and architectures: array, trees, hypercubes. Morgan Kaufmann Publishers Inc. San Francisco, CA, US, 1991.Google Scholar
  21. 21.
    E. Oh and J. Chen, “Parallel routing in hypercube networks with faulty nodes,” in IEEE International Conference on Parallel and Distributed Systems (ICPADS’ 01), pp. 338–345, July 2001.Google Scholar
  22. 22.
    M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, “Hypercup-hypercubes, ontologies, and efficient search on peer-to-peer networks,” in Agents and Peer-to-Peer Computing: A Promising Combination of Paradigms, LNCS 2530, pp. 112–124, July 2003.Google Scholar
  23. 23.
    M. A. Jimenez-Montano, C. R. de la Mora-Basanez, and T. Poeschel, “On the hypercube structure of the genetic code,” in Proceedings of Bioinformatics and Genome Research, pp. 445–459, Oct. 1994.Google Scholar
  24. 24.
    D. Wang, “A low-cost fault-tolerant structure for the hypercube,” Journal of Supercomputing, vol. 20, no. 3, Nov. 2001.Google Scholar
  25. 25.
    R. Friedman, S. Manor, and K. Guo, “Scalable stability detection using logical hypercube,” tech. rep., Technion, Department of Computer Science Technical Report 0960, May 1999.Google Scholar
  26. 26.
    J. Slack, “Visualization of embedded binary trees in the hypercube,” tech. rep., Final Report of the Project for Information Visualization, Department of Computer Science, University of British Columbia, Apr. 2003.Google Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • José I. Alvarez-Hamelin
    • 1
  • Aline C. Viana
    • 2
  • Marcelo D. de Amorim
    • 3
  1. 1.Universidad de Buenos AiresArgentina
  2. 2.IRISA/INRIA-RennesFrance
  3. 3.CNRS/LIP6Université Pierre et Marie CurieParis VIFrance

Personalised recommendations