A Self-organizing Routing Scheme for Random Networks
Most routing protocols employ address aggregation to achieve scalability with respect to routing table size. But often, as networks grow in size and complexity, address aggregation fails. Other networks, e.g. sensor-actuator networks or ad-hoc networks, that are characterized by “organic growth” might not at all follow the classical hierarchical structures that are required for aggregation.
In this paper, we present a fully self-organizing routing scheme that is able to efficiently route messages in random networks with randomly assigned node addresses. The protocol combines peer-to-peer techniques with source routing and can be implemented to work with very limited resource demands. With the help of simulations we show that it nevertheless quickly converges into a globally consistent state and achieves a routing stretch of only 1.2 – 1.3 in a network with more than 105 randomly assigned nodes.
KeywordsSelf-organization Peer-to-Peer Ad-Hoc Routing
- 1.Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: Proc. 16th ACM symposium on Parallelism in algorithms and architectures, Barcelona, Spain (2004)Google Scholar
- 2.Cramer, C., Fuhrmann, T., Kutzner, K.: Scalable Source Routing Protocol Specification. Technical Report 2005-4, University of Karlsruhe (2005)Google Scholar
- 4.Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proc. of ACM SIGCOMM 2001, San Diego, California, pp. 149–160 (2001)Google Scholar
- 5.Bu, D.T.T., Gao, L.: On characterizing BGP routing table growth. Computer Networks: The International Journal of Computer and Telecommunications Networking 45(1) (May 2004)Google Scholar