Abstract
This paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We present two routing schemes for dynamic trees that maintain labels of asymptotically optimal size using extremely low average message complexity (per node). Specifically, we first present a dynamic routing scheme that supports additions of both leaves and internal nodes, maintains asymptotically optimal labels and incurs only O(log2 n/log2logn) average message complexity. This routing scheme is then extended to supports also deletions of nodes of degree at most 2. The extended scheme incurs O(log2 n) average message complexity and still maintains asymptotically optimal labels.
We would like to point out that the best known routing scheme for dynamic trees that maintains asymptotically optimal labels in the fixed port model has very high average message complexity, namely, O(n ε). Moreover, that scheme supports additions and removals of leaf nodes only.
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
Afek, Y., Awerbuch, B., Plotkin, S.A., Saks, M.: Local management of a global resource in a communication network. J. ACM 43, 1–19 (1996)
Abraham, I., Gavoille, C.: Object location using path separators. In: PODC 2006 (2006)
Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms 4(3) (2008)
Afek, Y., Gafni, E., Ricklin, M.: Upper and lower bounds for routing schemes in dynamic networks. In: FOCS 1989, pp. 370–375 (1989)
Fraigniaud, P., Gavoille, C.: Routing in trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 757–772. Springer, Heidelberg (2001)
Fraigniaud, P., Gavoille, C.: A Space Lower Bound for Routing in Trees. In: STACS 2002, pp. 65–75 (2002)
Korman, A.: General compact labeling schemes for dynamic trees. J. Distributed Computing 20(3), 179–193 (2007)
Korman, A.: Improved compact routing schemes for dynamic trees. In: PODC 2008 (2008)
Korman, A., Kutten, S.: Controller and estimator for dynamic networks. In: PODC 2007 (2007)
Korman, A., Peleg, D.: Compact Separator Decomposition for Dynamic Trees and Applications. J. Distributed Computing (to appear, 2008)
Korman, A., Peleg, D., Rodeh, Y.: Labeling schemes for dynamic tree networks. Theory Comput. Syst. 37(1), 49–75 (2004)
Korman, A., Peleg, D.: Labeling schemes for weighted dynamic trees. J. Information and Computation 205(12), 1721–1740 (2007)
Korman, A., Peleg, D.: Dynamic routing schemes for graphs with low local density. ACM Trans. on Algorithms (to appear); Korman, A., Peleg, D.: Dynamic routing schemes for general graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 619–630. Springer, Heidelberg (2006)
Santoro, N., Khatib, R.: Labelling and implicit routing in networks. The Computer Journal 28, 5–8 (1985)
Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J. of the ACM 51, 993–1024 (2004)
Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA 2001, pp. 1–10 (2001)
Van Leeuwen, J., Tan, R.B.: Interval routing. The Computer Journal 30, 298–307 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korman, A. (2008). Compact Routing Schemes for Dynamic Trees in the Fixed Port Model. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds) Distributed Computing and Networking. ICDCN 2009. Lecture Notes in Computer Science, vol 5408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92295-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-92295-7_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92294-0
Online ISBN: 978-3-540-92295-7
eBook Packages: Computer ScienceComputer Science (R0)