Abstract
Cowen presented a universal compact routing algorithm with a stretch factor of three and a table-size of O(n 2/3 log 4/3 n), based on a simple and practical model [1]. (The table-size is later improved to \(O(\sqrt{n log^{3}}n)\) [2].) This stretch factor of three matches a general lower bound given in [3] and also matches a much tighter lower bound if we restrict the model to the Cowen’s [4]. Thus it seems quite hard to improve the stretch factor. However, her analysis is of course for the worst case; the situation might differ if we assume some desirable property that average-case networks often possess. As such a property, we consider the notion of flatness in this paper and it is shown that the stretch factor can be significantly improved if the given network is almost flat. Our new algorithm achieves a stretch factor of s < 3 and a table size of \(O(\sqrt{n log n})\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cowen, L.J.: Compact routing with minimum stretch. In: Proceedings of the 10th Annual ACM Symposium on Discrete Algorithms (SODA), ACM/SIAM, pp. 255–260 (1999)
Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1–10 (2001)
Gavoille, C., Gengler, M.: Space-efficiency of routing schemes of stretch factor three. In: Krizanc, D., Widmayer, P. (eds.) Proceedings of the 4th International Colloquium on Structual Information & Communication Complexity (SIROCCO), pp. 162–175. Carleton Scientific (1997)
Iwama, K., Kawachi, A.: Compact routing with stretch factor of less than three. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC), p. 337. ACM PRESS, New York (2000); A longer version in 21th IASTED PDCS, pp. 223–228 (2000)
Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 741–750 (2002)
Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 311–320 (1997)
Kleinrock, L., Kamoun, F.: Hierarchical routing for large networks; performance evaluation and optimization. Computer Networks 1, 155–174 (1977)
Santoro, N., Khatib, R.: Labelling and implicit routing in networks. The Computer Journal 28, 5–8 (1985)
van Leeuwen, J., Tan, R.B.: Routing with compact routing tables. The Book of L, pp. 259–273 (1986)
van Leeuwen, J., Tan, R.B.: Interval routing. The Computer Journal 30, 259–273 (1987)
Frederickson, G.N., Janardan, R.: Space-efficient message routing in c-decompo-sable networks. SIAM Journal on Computing 19, 164–181 (1990)
Frederickson, G.N., Janardan, R.: Designing networks with compact routing tables. Algorithmica, 171–190 (1988)
Peleg, D., Upfal, E.: A tradeoff between space and efficiency for routing tables. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 43–52. Carleton Scientific (1988)
Gavoille, C., Pérennès, S.: Memory requirement for routing in distributed networks. In: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC). LNCS, vol. 1644, pp. 125–133. ACM PRESS, New York (1996)
Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive routing. In: Proccedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 479–489 (1989)
Eilam, T., Gavoille, C., Peleg, D.: Compact routing schemes with low stretch factor. In: Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 11–20 (1998)
Narayanan, L., Opatrny, J.: Compact routing on chordal rings of degree four. In: Proceedings of the 4th International Colloquium on Structual Information & Communication Complexity (SIROCCO), pp. 125–137. Carleton Scientific (1997)
Gavoille, C., Hanusse, N.: Compact routing tables for graphs of bounded genus. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 351–360. Springer, Heidelberg (1999)
Buhrman, H., Hoepman, J.H., Vitányi, P.: Space-efficient routing tables for almost all netowrks and the incompressibility method. SIAM Journal on Computing 28, 1414–1432 (1999)
Fraigniaud, P., Gavoille, C.: A space lower bound for routing in trees. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, p. 65. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwama, K., Okita, M. (2003). Compact Routing for Flat Networks. In: Fich, F.E. (eds) Distributed Computing. DISC 2003. Lecture Notes in Computer Science, vol 2848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39989-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-39989-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20184-7
Online ISBN: 978-3-540-39989-6
eBook Packages: Springer Book Archive