Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Unmanaged Internet Protocol: taming the edge network management crisis
ACM SIGCOMM Computer Communication Review
On characterizing BGP routing table growth
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on The global Internet
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Component engineering for adaptive ad-hoc systems
Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems
Providing KBR service for multiple applications
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
| Hi-index | 0.00 |
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.