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.
This work was performed while José Ignacio Alvarez-Hamelin was a researcher scientist at LPT/CNRS, University of Paris XI, France.
Chapter PDF
Similar content being viewed by others
References
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.
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.
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.
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.
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.
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.
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.
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.
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.
Terminodes Project. http://www.terminodes.com/.
Grid Project. http://www.pdos.lcs.mit.edu/grid/.
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.
P. F. Tsuchiya, “The landmark hierarchy: a new hierarchy for routing in very large networks,” in Proceedings of ACM SIGCOMM’88, Aug. 1988.
P. F. Tsuchiya, “Landmark routing: Architecture, algorithms and issues,” tech. rep., MTR-87W00174, MITRE Corporation, Sept. 1987.
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.
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.
I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana, “Internet indirection infrastructure,” in Proceedings of ACM SIGCOMM’02, Aug. 2002.
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.
Y. Saad, “Data communication in hypercubes,” tech. rep., Research Report 428, Department of Computer Science, Yale University, New Haven, CT, 1985.
F. T. Leighton, Introduction to parallel algorithms and architectures: array, trees, hypercubes. Morgan Kaufmann Publishers Inc. San Francisco, CA, US, 1991.
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.
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.
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.
D. Wang, “A low-cost fault-tolerant structure for the hypercube,” Journal of Supercomputing, vol. 20, no. 3, Nov. 2001.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Alvarez-Hamelin, J.I., Viana, A.C., de Amorim, M.D. (2006). DHT-based Functionalities Using Hypercubes. In: Al Agha, K. (eds) Ad-Hoc Networking. IFIP International Federation for Information Processing, vol 212. Springer, Boston, MA . https://doi.org/10.1007/978-0-387-34738-7_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-34738-7_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34635-9
Online ISBN: 978-0-387-34738-7
eBook Packages: Computer ScienceComputer Science (R0)