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.


Link Failure Failure Event Connection Request Minimum Load Path Protection 
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.


  1. 1.
    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)Google Scholar
  2. 2.
    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)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Chang, R.-S., Leu, S.-J.: The minimum labeling spanning trees. Information Processing Letters 63(5), 277–282 (1997)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Chaudhuri, S., Hjálmtýsson, G., Yates, J.: Control of lightpaths in an optical network. IETF Internet Draft (March 2000)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    ILOG CPLEX. CPLEX 8.1 (2004),
  8. 8.
    Krumke, S., Wirth, H.-C.: On the minimum label spanning tree problem. Information Processing Letters 66(2), 81–85 (1998)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Mehlhorn, K., Näher, S.: LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, Cambridge (1999)MATHGoogle Scholar
  11. 11.
    Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)MATHGoogle Scholar
  12. 12.
    Ramaswami, R., Sivarajan, K.N.: Optical Networks: A Practical Perspective, 2nd edn. Morgan Kaufmann Publishers, San Francisco (2002)Google Scholar
  13. 13.
    Wan, Y., Chen, G., Xu, Y.: A note on the minimum label spanning tree. Information Processing Letters 84, 99–101 (2002)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Wirth, H.-C.: Multicriteria Approximation of Network Design and Network Upgrade Problems. PhD thesis, University of Würzburg (2001)Google Scholar
  15. 15.
    Xin, Y., Rouskas, G.N.: A study of path protection in large-scale optical networks. Photonic Network Communications 7(3), 267–278 (2004)CrossRefGoogle Scholar
  16. 16.
    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)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Stamatis Stefanakos
    • 1
  1. 1.Dept. of Computer ScienceUniversity of Rome “La Sapienza”RomeItaly

Personalised recommendations