On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
The minimum labeling spanning trees
Information Processing Letters
On the minimum label spanning tree problem
Information Processing Letters
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
On the red-blue set cover problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Optical networks: a practical perspective
Optical networks: a practical perspective
Generalized loop-back recovery in optical mesh networks
IEEE/ACM Transactions on Networking (TON)
A note on the minimum label spanning tree
Information Processing Letters
Hardness of the undirected congestion minimization problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We study routing problems in networks that require guaranteed reliability against multiple correlated link failures. We consider two different routing objectives: The first ensures “local reliability,” i.e., the goal is to route so that each connection in the network is as reliable as possible. The second ensures “global reliability,” i.e., the goal is to route so that as few as possible connections are affected by any possible failure. We exhibit a trade-off between the two objectives and resolve their complexity and approximability for several classes of networks. Furthermore, we propose approximation algorithms and heuristics. We perform experiments to evaluate the heuristics against optimal solutions that are obtained using an integer linear programming solver. We also investigate up to what degree the routing trade-offs occur in randomly generated instances.