Abstract
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.
Work partially done while the author was with the Computer Engineering and Networks Laboratory of the Swiss Federal Institute of Technology in Zurich.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Andrews, M., Zhang, L.: Hardness of the undirected congestion minimization problem. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC 2005 (2005)
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM 44(3), 486–504 (1997)
Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 345–353 (2000)
Chang, R.-S., Leu, S.-J.: The minimum labeling spanning trees. Information Processing Letters 63(5), 277–282 (1997)
Chaudhuri, S., Hjálmtýsson, G., Yates, J.: Control of lightpaths in an optical network. IETF Internet Draft (March 2000)
Choi, H., Subramaniam, S., Choi, H.-A.: On double-link failure recovery in WDM optical networks. In: Proceedings IEEE INFOCOM 2002, The 21st Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 808–816 (2002)
ILOG CPLEX. CPLEX 8.1 (2004), http://www.cplex.com/
Krumke, S., Wirth, H.-C.: On the minimum label spanning tree problem. Information Processing Letters 66(2), 81–85 (1998)
Médard, M., Barry, R.A., Finn, S.G., He, W., Lumetta, S.: Generalized loop-back recovery in optical mesh networks. IEEE/ACM Transactions on Networking 10(1), 153–164 (2002)
Mehlhorn, K., Näher, S.: LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, Cambridge (1999)
Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
Ramaswami, R., Sivarajan, K.N.: Optical Networks: A Practical Perspective, 2nd edn. Morgan Kaufmann Publishers, San Francisco (2002)
Wan, Y., Chen, G., Xu, Y.: A note on the minimum label spanning tree. Information Processing Letters 84, 99–101 (2002)
Wirth, H.-C.: Multicriteria Approximation of Network Design and Network Upgrade Problems. PhD thesis, University of Würzburg (2001)
Xin, Y., Rouskas, G.N.: A study of path protection in large-scale optical networks. Photonic Network Communications 7(3), 267–278 (2004)
Yuan, S., Varma, S., Jue, J.P.: Minimum-color path problems for reliability in mesh networks. In: Proceedings of IEEE INFOCOM 2005, The 24th Annual Joint Conference of the IEEE Computer and Communications Societies (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 IFIP International Federation for Information Processing
About this paper
Cite this paper
Stefanakos, S. (2006). Reliable Routings in Networks with Generalized Link Failure Events. In: Boavida, F., Plagemann, T., Stiller, B., Westphal, C., Monteiro, E. (eds) NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. NETWORKING 2006. Lecture Notes in Computer Science, vol 3976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753810_19
Download citation
DOI: https://doi.org/10.1007/11753810_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34192-5
Online ISBN: 978-3-540-34193-2
eBook Packages: Computer ScienceComputer Science (R0)