Abstract
We present a new mathematical model for all-optical network design, including sparse optical cross connects placement, traffic routing and wavelength assignment. The proposed linear integer program is refined by introducing valid inequalities, and a cutting plane procedure is described. The solution procedure is implemented using commercial mixed integer programming solvers and applied to some real instances of metropolitan and wide area networks. We present encouraging results that show the validity of the approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Babayev, V. Dean and D. Wilson, Design of optical communication networks, in: Proc. of the 8th Internat. Conf. on Telecommunication Systems, 2000, pp. 232-238.
D. Banerjee and B. Mukherjee, A practical approach for routing and wavelength assignment in large wavelength-routed optical networks, IEEE Journal on Selected Areas in Communications 14(5) (1996) 903-908.
D. Bienstock, S. Chopra, O. Günlük and C.-Y. Tsai, Minimum capacity installation for multicommodity network flows, Mathematical Programming 81(2) (1995) 177-200.
L. Brunetta and F. Malucelli, A colored multicommodity flow problem, Working paper, DEI, Politecnico di Milano, Italy (2000).
I. Chlamtac, A. Ganz and G. Karmi, Lightpath communications: An approach to high bandwidth optical WANs, IEEE Transactions on Communications 40(7) (1992) 1171-1182.
L.A. Cox, J. Sanchez, L. Lu and X. Sun, Cost savings from network optimization of DWDM facilities and optical switches, in: Proc. of the 8th Internat. Conf. on Telecommunication Systems, 2000, pp. 239-253.
E. Karasan and E. Ayanoglu, Performance of WDM transport networks, IEEE Journal on Selected Areas in Communications 16(7) (1998) 1081-1096.
E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Generating all maximal independent sets: NP-hardness and polynomial time algorithms, SIAM Journal on Computing 9(3) (2000) 559-565.
M.W. Maeda, Management and control of transparent optical networks, IEEE Journal on Selected Areas in Communications 16(7) (1998) 1008-1023.
S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementation (Wiley, New York, 1990).
Y. Miyao and H. Saito, Optimal design and evaluation of survivable WDM transport networks, IEEE Journal on Selected Areas in Communications 16(7) (1998) 1190-1198.
R. Ramaswami and K.N. Sivarajan, Routing and wavelength assignment in all optical networks, IEEE Transactions on Networking 13(5) (1995) 489-500.
B.Van Canegem, W. Van Parys, F. De Turck and P.M. Demeester, Dimensioning of survivable WDM networks, Journal on Selected Areas in Communications 16(7) (1998) 1146-1157.
N. Wauters and P. Demeester, Design of the optical path layer in multiwavelength cross-connected networks, IEEE Journal on Selected Areas in Communications 14(5) (1996) 881-892.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Brunetta, L., Malucelli, F., Värbrand, P. et al. Joint Optical Network Design, Routing and Wavelength Assignment by Integer Programming. Telecommunication Systems 26, 53–67 (2004). https://doi.org/10.1023/B:TELS.0000029020.17417.8e
Issue Date:
DOI: https://doi.org/10.1023/B:TELS.0000029020.17417.8e