Virtual Trellis Routing

How Regular Structures can ease Network Operations
  • Julien Ridoux
  • Anne Fladenmuller
  • Yannis Viniotis
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 197)

Abstract

The mobility characteristic of Ad Hoc and Sensor networks implies that the topological information contained in the traditional IP address can no longer reflect the position of a node in the network. In this paper we propose a new approach to resolve the location-identification coupling contained in the IP address. The approach uses a Virtual Regular Structure (VRS) to describe the addressing space of the entire network; such a structure provides additional desired properties such as robustness and multi-paths. Our approach explores a distributed implementation of the VRS based on a trellis graph description of routing tables instead of the traditional trees. We show that the construction of the optimal structure is an NP-Complete problem; in this paper, we propose a heuristic and evaluate its performance via simulations.

Keywords

Self-Organized Networks Regular Structures 

References

  1. [1]
    C.E. Perkins (1996). IP Mobility Support. RFC 2002, IETF.Google Scholar
  2. [2]
    I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan (2001). Chord: A Scalable P2P Lookup Service for Internet Applications. In Proc. of ACM SIGCOMM.Google Scholar
  3. [3]
    J. Ridoux, A. Fladenmuller and Y. Viniotis (2004). Beyond the Tree Structure: a new way to configure nodes in SONs. Technical report. http://www-rp.lip6.fr/∼ridoux/Publications/TR_BeyondTrellis.pdf.Google Scholar
  4. [4]
    J. Li, J. Jannotti, D. De Couto, D. Karger and R. Morris (2000). A Scalable Location Service for Geographic Ad Hoc Routing. In Proc. of ACM MOBICOM, pages 120–130.Google Scholar
  5. [5]
    Kirkpatrick, D. G. and Hell, P. (1978). On the Completeness of a generalized Matching Problem. In Proceedings of the tenth annual ACM symposium on Theory of computing, San Diego, CA.Google Scholar
  6. [6]
    L. Blazevic, L. Buttyan, S. Capkun, S. Giordano, J. P. Hubaux and J. Y. Le Boudec (2001). Self-Organization in Mobile Ad Hoc Networks: the Approach of Terminodes. IEEE Communications Mag., 39(6).Google Scholar
  7. [7]
    M. Castro, M. Costa and A. Rowstron (2003). Should we build Gnutella on a Structured Overlay? In HotNets-II, Cambridge, MA, USA.Google Scholar
  8. [8]
    S.D. Nikolopoulos, A. Pitsillides, and D. Tipper (1997). Addressing Network Survivability issues by finding the K-best paths through a Trellis Graph. In Proc. of IEEE INFOCOM.Google Scholar
  9. [9]
    S. Lin, D.J. Costello (1983). Error Control Coding: Fundamental and Applications. Electrical Engineering Series. Prentice-Hall.Google Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • Julien Ridoux
    • 1
  • Anne Fladenmuller
    • 1
  • Yannis Viniotis
    • 2
  1. 1.LIP6UPMCParisFrance
  2. 2.ECE DepartmentNCSURaleighUSA

Personalised recommendations