Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Simulation Modeling and Analysis
Simulation Modeling and Analysis
| Hi-index | 0.00 |
A growing number of network applications create virtual networks called overlays on top of the Internet. Because advanced communication modes such as multicast have not been able to be successfully deployed at the network layer, they are now being implemented at the application layer thus creating such virtual networks. However these overlays require some form of addressing and routing inside themselves. Usually their topology is kept as simple as possible (e.g. tree, ring, etc.) but as their size increases, the need to be able to cope with a non trivial topology will increase. Our aim is to design a simple but robust addressing and routing scheme for topologically complex overlays. The only assumption is that the overlays are built upon the Internet and thus their topologies are constrained by the Internet topology. The benefit of our architecture is that they will not have to set up and maintain specific trivial topologies. In this paper we present the mechanisms of our distributed addressing and routing scheme. We have carried out simulations and we present some performance results of our routing algorithm such as path inflation and resistance to network dynamics.