Stable Routing and Unique-Max Coloring on Trees
Name
Hahnle-2013-Stable routing and unique-max coloring on trees.pdf
Size
269.32 KB
Format
Adobe PDF
Checksum (MD5)
800953e1b5132539e65763b0c3d1c3ba
Author(s)
Hähnle, Nicolai
Sanità, Laura
Zenklusen, Rico
Date Issued
January 2013
Journal
SIAM Journal on Discrete Mathematics
Publisher
Society for Industrial and Applied Mathematics
Citation
Hähnle, Nicolai, Laura Sanità, and Rico Zenklusen. “Stable Routing and Unique-Max Coloring on Trees.” SIAM Journal on Discrete Mathematics 27, no. 1 (January 10, 2013): 109-125. © 2013, Society for Industrial and Applied Mathematics
Version
Final published version
Abstract
Some of the routing protocols used in telecommunication networks route traffic on a shortest path tree according to configurable integral link weights. One crucial issue for network operators is finding a weight function that ensures a stable routing: when some link fails, traffic whose path does not use that link should not be rerouted. In this paper we improve on several previously best results for finding small stable weights. As a conceptual contribution, we draw a connection between the stable weights problem and the seemingly unrelated unique-max coloring problem. In unique-max coloring, one is given a set of points and a family of subsets of those points called regions. The task is to assign to each region a color represented as an integer such that, for every point, one region containing it has a color strictly larger than the color of any other region containing this point. In our setting, points and regions become edges and paths of the shortest path tree, respectively, and based on this connection, we provide stable weight functions with a maximum weight of O(n log n) in the case of single link failure, where n is the number of vertices in the network. Furthermore, if the root of the shortest path tree is known, we present an algorithm for determining stable weights bounded by $4n$, which is optimal up to constant factors. For the case of an arbitrary number of failures, we show how stable weights bounded by 3[superscript n] n can be obtained. All the results improve on the previously best known bounds.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/100817565
