Abstract
In this paper, we study a network design problem for TDM rings that are embedded in a WDM ring. We propose an optimization model based on the graph theory for the minimum use of TDM ADMs for these networks. We propose a branch-and-price algorithm to solve the suggested model to the optimality. By exploiting mathematical structure of ring networks, we develop a polynomial time column generation subroutine and a branching rule that conserves the mathematical structure for an efficient column generation. In computational experiments, the suggested model and algorithm can find not the approximation solutions but the optimal solutions for sufficient size networks within reasonable time. We also compare the solution qualities of the suggested algorithm with some known heuristics in literature.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Stern, T.E., Bala, K.: Multiwavelength Optical Networks: A layered approach. Addison-Wesley, Reading (1999)
Gerstel, O., et al.: Combined WDM and SONET Network Design. In: IEEE Infocom 1999 (1999)
Dutta, R., Rouskas, G.: On Optimal Traffic Grooming in WDM Rings. IEEE JSAC 20(1), 110–121 (2002)
Gerstel, O., et al.: Wavelength Assignment in a WDM Ring to Minimize Cost of Embedded SONET Rings. In: IEEE Infocom 1998 (1998)
Liu, L., Li, X., Wan, P., Frieder, O.: Wavelength assignment in WDM rings to minimize SONET ADMs. In: Proc. IEEE Infocom 2000, vol. 2, pp. 1020–1025 (2000)
Yuan, X., Fulay, A.: Wavelength Assignment to Minimize the Number of SONET ADMs. In: WDM Rings IEEE ICC 2002 (2002)
Lee, H., Chung, J.: Wavelength Assignment Optimization in Uni-Directional WDM ring. IE interface 13(4) (2000)
Lee, T., et al.: Optimal Routing and Wavelength Assignment in WDM Ring Networks. IEEE JSAC 18(10), 2146–2154 (2000)
Lu, X., He, S.: Wavelength assignment for WDM ring. Electronics Letters 39(19) (2003)
Mehrotra, A., Trick, M.A.: A Column Generation Approach for Graph Coloring. INFORMS Journal on Computing 8, 344–354 (1996)
Hsiao, J.Y., Tang, C.Y., Chang, R.S.: An efficient algorithms for finding a maximum weighted 2-independent set on interval graph. Information Processing Letters (43), 229–235 (1992)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms and applications. Prentice Hall Inc., Englewood Cliffs (1992)
Tucker, A.: Matrix Characterization of Circular-Arc Graph. Pacific J. of Mathematics 39(2), 535–545 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chung, J., Lee, H., Song, Hg. (2004). Cost Effective Design of TDM ADM Embedded in WDM Ring Networks. In: Freire, M.M., Chemouil, P., Lorenz, P., Gravey, A. (eds) Universal Multiservice Networks. ECUMN 2004. Lecture Notes in Computer Science, vol 3262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30197-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-30197-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23551-4
Online ISBN: 978-3-540-30197-4
eBook Packages: Springer Book Archive