Compact roundtrip routing with topology-independent node names (2003)
Cached
Download Links
- [www.cs.tufts.edu]
- [www.eecs.tufts.edu]
- [www.cs.tufts.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing |
| Citations: | 7 - 0 self |
BibTeX
@INPROCEEDINGS{Arias03compactroundtrip,
author = {Marta Arias and Lenore J. Cowen and Kofi A. Laing},
title = {Compact roundtrip routing with topology-independent node names},
booktitle = {In Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing},
year = {2003},
pages = {43--52},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper presents compact roundtrip routing schemes with local tables of size Õ( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tables of size Õ(ǫ−1 n 2/k) and stretch min((2 k/2 − 1)(k + ǫ),16k 2 + 8k − 8), for any directed network with polynomially-sized edges, both in the topology-independent node-name model. 1 These are the first topology-independent results that apply to routing in directed networks.
