Developing a Ring-Based Optical Network Structure with Glass-Through Nodes

• Autorzy: Caserta M. , Schwarze S. , Voß S.
• Języki publikacji: EN

Abstrakty

EN

An important issue in designing optical transport networks (OTN) is security. The concept of 1+1 protection requires to connect each origin-destination(OD)-pair by at least two node-disjoint paths. In the case of a single edge or node failure, the connection of all OD-pairs is maintained under 1+1 protection. On a ring, 1+1 protection is given naturally. Moreover, on rings, the routing effort is typically decreasing. These observations motivate the investigation of ring structures for OTN. When developing a ring structure for telecommunication networks, several subtasks can be identified. Ringshave to be designed, OD-pairs have to be assigned to rings, communication among rings has to be defined, a proper flow routing has to be chosen, and rings have to be dimensioned regarding flow capacity. In this paper, we address the first two issues, namely generation of rings and assignment of OD-pairs to rings. Our approach allows to distinguish active and non-active (glass-through) nodes in OTN. Active nodes are equipped with active routing hardware that weakens the optical signal and has impact on feasible ring lengths. Non-active nodes do not influence the optical signal. Although a consideration of active/non-active nodes is important in ring design, only a few references address this issue. We propose an algorithm for generating random ring candidates. Moreover, we present a mathematical model for the assignment of OD-pairs to rings subject to a feasible choice of active nodes. We test our methods using a case of Deutsche Telekom.

Słowa kluczowe

EN

active nodes; interring traffic; optical transport network; ring network design

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2012
• Tom: nr 2
• Strony: 13--20
• Opis fizyczny: Bibliogr. 20 poz., rys., tab.

Twórcy

autor

Caserta M.

autor

Schwarze S.

autor

Voß S.

• IE Business School, Maria de Molina st 12, Piso 5, 28006 Madrid, Spain,

Bibliografia

• [1] P. Soriano, C. Wynants, R. S´eguin, M. Labb´e, M. Gendreau, and B. Fortz, “Design and dimensioning of survivable SDH/SONET networks”, in Telecommunications Network Planning, B. Sans`o and P. Soriano, Eds. Norwell, MA: Kluwer, 1999, pp. 147–167.
• [2] H. H¨oller, B. Meli´an, and S. Voß, “Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks”, European J. Oper. Res., vol. 191, no. 3, pp. 691–704, 2008.
• [3] M. Labb´e, G. Laporte, and P. Soriano, “Covering a graph with cycles”, Comput. Oper. Res., vol. 25, no. 6, pp. 499–504, 1998.
• [4] J. L. Kennington, V. S. S. Nair, and M. H. Rahman, “Optimization based algorithms for finding minimal cost ring covers in survivable networks”, Comput. Optimiz. Appl., vol. 14, pp. 219–230, 1999.
• [5] D. S. Hochbaum and E. V. Olinick, “The bounded cycle-cover problem”, INFORMS J. Comput., vol. 13, no. 2, pp. 104–119, 2001.
• [6] G. Pesant and P. Soriano, “An optimal strategy for the constrained cycle cover problem”, Annals Mathema. Artif. Intell., vol. 34, pp. 313–325, 2002.
• [7] N. Immorlica, M. Mahdian, and V. S. Mirrokni, “Cycle cover with short cycles”, in STACS 2005, LNCS 3404, V. Diekert and B. Durand, Eds. Berlin: Springer, pp. 641–653, 2005.
• [8] M. Henningsson, K. Holmberg, and D. Yuan, “Ring network design”, in Handbook of Optimization in Telecommunications, M. G. C. Resende and P. M. Pardalos, Eds. New York: Springer, pp. 291–311, 2006.
• [9] C. Arbib and F. Rossi, “An optimization problem arising in the design of multiring systems”, European J. Oper. Res., vol. 124, pp. 63–76, 2000.
• [10] J. G. Klincewicz, H. Luss, and D. C. K. Yan, “Designing tributary networks with multiple ring families”, Comput. Oper. Res., vol. 25, no. 12, pp. 1145–1157, 1998.
• [11] A. Fink, G. Schneidereit, and S. Voß, “Solving general ring network design problems by meta-heuristics”, in Computing Tools for Modeling, Optimization and Simulation, M. Laguna, J. L. Gonz´alez Velarde, Eds. Boston: Kluwer, pp. 91–113, 2000.
• [12] D. Rajan and A. Atamt ¨urk, “A directed cycle-based column-andcut generation method for capacitated survivable network design”, Networks, vol. 43, no. 4, pp. 201–211, 2004.
• [13] M. I. Eiger, H. Luss, and D. F. Shallcross, “Network restoration under a single link or node failure using preconfigured virtual cycles”, Telecomm. Sys., vol. 46, pp. 17–30, 2011.
• [14] A. Sutter, F. Vanderbeck, and L. Wolsey, “Optimal placement of add/drop multiplexers: heuristic and exact algorithms”, Oper. Res., vol. 46, no. 5, pp. 719–728, 1998.
• [15] T. Y. Chow and P. J. Lin, “The ring grooming problem”, Networks, vol. 44, no. 3, pp. 194–202, 2004.
• [16] G. D. Morley and W. D. Grover, “Comparison of mathematical programming approaches to optical ring network design”, in Proc. Of CCBR’99, Ottawa, Canada, 1999, pp. 137–184.
• [17] G. D. Morley and W. D. Grover, “Current approaches in the design of ring-based optical networks”, in Proc. IEEE Canadian Conf. Electrical and Comput. Eng., Edmonton, Canada, 1999, pp. 220–225.
• [18] G. D. Morley and W. D. Grover, “A Comparative Survey of Methods for Automated Design of Ring-based Transport Networks”, Tech. Rep., TR-97-04, TRLabs Network Systems, Canada, 1998.
• [19] ITU-T G.808.1, “Generic protection switching – Linear trail and subnetwork protection”, International Telecommunication Union Recommendation ITU-T G.808.1, 2010 [Online]. Available: http://www.itu.int/
• [20] S. Cosares, D. N. Deutsch, I. Saniee, and O. J. Wasem, “SONET toolkit: a decision support system for designing robust and costeffective fiber-optic networks”, Interfaces, vol. 25, no. 1, pp. 20–40, 1995.