 |
|
|||
| Authors: | Thomas Erlebach |
| Group: | Theory of Communication Networks |
| Type: | Inproceedings |
| Title: | Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings |
| Year: | 2001 |
| Month: | August |
| Pub-Key: | E01 |
| Book Titel: | Lecture Notes in Computer Science. Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS 2001) |
| Volume: | 2136 |
| Pages: | 351-362 |
| Keywords: | tree of rings, path coloring, edge-disjoint paths |
| Publisher: | Springer-Verlag |
| Abstract: | A tree of rings is a network that is obtained by interconnecting rings in a tree structure such that any two rings share at most one node. A connection request (call) in a tree of rings is given by its two endpoints and, in the case of prespecified paths, a path connecting these two endpoints. We study undirected trees of rings as well as bidirected trees of rings. In both cases, we show that the path packing problem (assigning paths to calls so as to minimize the maximum load) can be solved in polynomial time, that the path coloring problem with prespecified paths can be approximated within a constant factor, and that the maximum (weight) edge-disjoint paths problem is NP-hard and can be approximated within a constant factor (no matter whether the paths are prespecified or can be determined by the algorithm). We also consider fault-tolerance in trees of rings: If a set of calls has been established along edge-disjoint paths and if an arbitrary link fails in every ring of the tree of rings, we show that at least one third of the calls can be recovered if rerouting is allowed. Furthermore, computing the optimal number of calls that can be recovered is shown to be polynomial in undirected trees of rings and NP-hard in bidirected trees of rings. |
| Location: | Marianske Lazne, Czech Republic |
| Resources: | [BibTeX] |
