TY - GEN
T1 - Compact routing schemes for dynamic trees in the fixed port model
AU - Korman, Amos
PY - 2009
Y1 - 2009
N2 - 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(log 2 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.
AB - 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(log 2 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.
KW - Distributed algorithms
KW - Dynamic networks
KW - Routing schemes
KW - Trees
UR - http://www.scopus.com/inward/record.url?scp=70350259557&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-92295-7_28
DO - 10.1007/978-3-540-92295-7_28
M3 - Conference contribution
AN - SCOPUS:70350259557
SN - 3540922946
SN - 9783540922940
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 218
EP - 229
BT - Distributed Computing and Networking - 10th International Conference, ICDCN 2009, Proceedings
PB - Springer Verlag
T2 - 10th International Conference on Distributed Computing and Networking, ICDCN 2009
Y2 - 3 January 2009 through 6 January 2009
ER -