Path Diversity Protection in Two-Layer Networks

• Autorzy: Dzida M. , Śliwiński T. , Zagożdżon M. , Ogryczak W. , Pióro M.
• Języki publikacji: EN

Abstrakty

EN

The paper addresses an optimization problem related to dimensioning links in a resilient two-layer network. A particular version of the problem which assumes that links of the upper layer are supported by unique paths in the lower layer is considered. Two mixed-integer programming formulations of this problem are presented and discussed. Direct resolving of these formulations requirespre-selection of "good" candidate paths in the upper layer of the network. Thus, the paper presents an alternative approach which is based on decomposing the resolution process into two phases, resolved iteratively. The first phase subproblem is related to designing lower layer path flows that provide the capacities for the logical links of the upper layer. The second phase is related to designing the flow patterns in the upper layer with protection assured through diversity of paths. In this phase we take into account the failures of the logical links that result from the failures of the lower layer links (so called shared risk link groups).

Słowa kluczowe

EN

link dimensioning; path diversity; resilient routing; two-layer network optimization

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2009
• Tom: nr 3
• Strony: 14--19
• Opis fizyczny: Bibliogr. 7 poz., tab.

Twórcy

autor

Dzida M.

autor

Śliwiński T.

autor

Zagożdżon M.

autor

Ogryczak W.

autor

Pióro M.

• Institute of Telecommunications, Warsaw University of Technology, Nowowiejska st 15/19, 00-665 Warsaw, Poland,

Bibliografia

• [1] S. Borne, E. Gourdin, B. Liau, and A. R. Mahjoub, “Design of sur- vivable IP-over-optical networks”, in Proc. INOC’2003 Conf., Paris, France, 2003, pp. 114–118.
• [2] M. Pioro and D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks. San Francisco: Morgan Kaufman, 2004.
• [3] D. Coudert, P. Datta, S. Perennes, H. Rivano, and M.-E. Voge, “Shared risk resource group: complexity and approximability issues”, Paral. Proces. Lett., vol. 17, no. 2, pp. 169–184, 2007.
• [4] M. Dzida, T. Śliwiński, M. Zagożdżon, W. Ogryczak, and M. Pioro, “Path generation for a class survivable network design prob- lems”, in NGI 2008 Conf. Next Gener. Internet Netw., Cracow, Poland, 2008.
• [5] G. B. Dantzig and P. Wolfe, “The decomposition algorithm for linear programming”, Oper. Res., vol. 8, no. 1, pp. 101–111, 1960.
• [6] T. Stidsen, B. Petersen, K. B. Rasmussen, S. Spoorendonk, M. Zachariasen, F. Rambach, and M. Kiese, “Optimal routing with single backup path protection”, in Proc. INOC 2007 Conf., Spa, Belgium, 2007.
• [7] S. Irnich and G. Desaulniers, “Shortest path problems with resource constraints”, in Column Generation, G. Desaulniers, J. Desrosier, and M. M. Solomon, Eds. New York: Springer, 2005, pp. 33–65.