Browse > Article

Telecommunication Network Optimization Current Status and Challenges  

Park, Kyungchul (School of Business Administration, Myongji University)
Lee, Heesang (Department of Systems Management Engineering, Sungkyunkwan University)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.34, no.1, 2008 , pp. 13-22 More about this Journal
Abstract
This paper gives reviews on current research status in telecommunication network design. Two problems are identified as major research issues. One is the WDM network design problem, where traffic grooming, virtual topology design and routing and wavelength assignment problems are considered. The other is the OSPF weight setting problem which was proposed as a practical method to implement traffic engineering capability in IP networks. After presenting surveys on those problems, we discuss potential challenging research issues in telecommunication network design.
Keywords
Telecommunication Network; Optimization; Operations Research;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Bley, A. (2005), On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem, Proc. of IPCO, 2005.
2 Buriol, L. S., Resende, M. G., Rebeiro, C. C. C. and Thorup, M. (2002), A Memetic Algorithm for OSPF Routing, Proc. of 6th INFORMS Telecom, 187-188.
3 Colburn, C. J. and Ling, A. C. H. (2003), Graph Decompositions with Application to Wavelength Add-drop Multiplexing for Minimizing SONET ADMs, Discrete Mathematics, 261(1), 141-156.   DOI   ScienceOn
4 Corteel, S., Valencia-Pabon, M., Gardy, D., Barth, D. and Denise, A. (2003), The Permutation-Path Coloring Problem on Trees, Theoretical Computer Science, 297(2), 119-143.   DOI   ScienceOn
5 Dutta, R. and Rouskas, G. N. (2000), A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks, Optical Networks Magazine, 1(1), 73-89.
6 Dutta, R. and Rouskas, G. N. (2002), Traffic Grooming in WDM Networks : Past and Future, IEEE Network, 16(6), 46-56.   DOI   ScienceOn
7 Lee, K., K. Kang, T. Lee, and Park, S. (2002), An Optimization Approach to Routing and Wavelength Assignment in WDM All-Optical Mesh Networks without Wavelength Conversion, ETRI Journal, 24(2), 131-141.   DOI   ScienceOn
8 Lee, T., Lee, K. and Park, S. (2000), Optimal Routing and Wavelength Assignment in WDM Ring Networks, IEEE JSAC, 18(10), 2146-2154.
9 Li, G. and Simha, R. (2001), On the Wavelength Assignment Problem in Multi-Fiber WDM Star and Ring Networks, IEEE/ACM Trans. Net, 9(1), 60-68.   DOI   ScienceOn
10 Myung, Y. S. (2001), An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting, SIAM Journal on Discrete Mathematics, 14, 291-298.   DOI   ScienceOn
11 Ozdaglar, A. and Bertsekas, D. (2003), Routing and Wavelength Assignment in Optical Networks, IEEE/ACM Trans. Net., 11(2), 259-272.   DOI   ScienceOn
12 Thiagarajan, S. and Somani, A. K. (2001), Capacity Fairness of WDM Networks with Grooming Capabilities, Opt. Net. Mag., 2(3), 24-31.
13 Wang, B. F. (2005), Linear Time Algorithms for the Ring Loading Problem with Demand Splitting, Journal of Algorithms, 54(1), 45-57.   DOI   ScienceOn
14 Retvari, G. and Cinkler, T. (2004), Practical OSPF Traffic Engineering, IEEE Comm. Letters, 8(11), 689-691.   DOI   ScienceOn
15 Zhang, X. and Qiao, C. (1999), On Scheduling All-to-All Personalized Connections and Cost-Effective Designs in WDM Rings, IEEE/ACM Trans. Net, 7(3), 435-445.   DOI   ScienceOn
16 Zhu. K. and Mukherjee, B. (2002), Traffic Grooming in an Optical WDM Mesh Network, IEEE JSAC, 20(1), 122-133.
17 Din, D-R. (2005), Heuristic and Hybrid Methods for Solving Optimal Multiple Multicast Problem on WDM Ring Network, Telecommunication Systems, 28(2), 245-262.   DOI
18 Berry, R. and Modiano, E. (2000), Reducing Electronic Multiplexing Costs in SONET/WDM Rings with Dynamically Changing Traffic, IEEE JSAC, 18(10), 1961-1971.
19 Fortz, B., Rexford, J. and Thorup, M. (2002), Traffic Engineering with Traditional IP Routing Protocols, IEEE Comm. Magazine, 40(10), 118-124.
20 Jia, X., Hu, X-D., Ruan, L. and Sun, J. (2002), Multicast Routing, Load Balancing, and Wavelength Assignment on Tree of Rings, IEEE Comm. Letters, 6(2), 79-81.   DOI   ScienceOn
21 Saad, M. and Luo, Z-Q. (2002), A Lagrangian Decomposition Approach for the Routing and Wavelength Assignment in Multi-fiber WDM Networks, GLOBECOM, 2818-2822.
22 Tornatore, M., Maier, G. and Pattavina, A. (2002), WDM Network Optimization by ILP Based on Source Formulation, IEEE Infocom, 3, 1813-1821.
23 Zhou, Y. and Poo. G-S. (2005), Optical Multicast over Wavelength-routed WDM Networks: A Survey, Optical Switching and Networking, 2(3), 176-197.   DOI   ScienceOn
24 Zang, H., Jue, J. P. and Mukherjee, B. (2000), A Review of Routing and Wavelength Assignment Approaches for Wavelength-Routed Optical WDM Networks, Optical Networks Magazine, 47-60.
25 Lee, T., Park, K., Yang, J. and Park, S. (2007), Optimal Multicast Routing and Wavelength Assignment on WDM Ring Networks without Wavelength Conversion, to appear in IEEE Comm. Letters.
26 Zhang, X. and Qiao, C. (2000), An Effective and Comprehensive Approach to Traffic Grooming and Wavelength Assignment in SONET/WDM Rings, IEEE/ACM Trans. Net, 8(5), 608-617.   DOI   ScienceOn
27 Zhu, K. and Mukherjee, B. (2003), A Review of Traffic Grooming in WDM Optical Networks : Architectures and Challenges, Optical Networks Magazine, 1(1), 55-64.
28 Dutta, R. and Rouskas, G. N. (2002b), On Optimal Traffic Grooming in WDM Rings, IEEE JSAC, 20(1), 110-121.
29 Gerstel, O., Ramaswami, R. and Sasaki, G. (2000), Cost- Effective Traffic Grooming in WDM Rings, IEEE/ACM Trans. Net, 8(5), 618-630.   DOI   ScienceOn
30 Parmar, A., Ahmed, S. and Sokol, J. (2006), An Integer Programming Approach to the OSPF Weight Setting Problem, Working Paper, School of Industrial and Systems Engineering, Georgia Institute of Technology.
31 Singhal N. and Mukherjee, B. (2001), Architectures and Algorithms for Multicasting in Optical WDM Mesh Networks using Opaque and Transparent Optical Cross-connects, Porc. IEEE OFC '01, 2, TuG8-T1-3.
32 Lardies, A., Gupta, R. and Patterson, P. A. (2001), Traffic Grooming in a Multi-Layer Network, Optical Networks Magazine, 2(3), 91-99.
33 Ramaswami, R. and Sasaki, G. H. (1998), Multi-wavelength Optical Networks with Limited Wavelength Conversion, IEEE/ACM Trans. Net., 6(6), 744-754.   DOI   ScienceOn
34 Ramaswami, R. and Sivarajan, K. (1995), Routing and Wavelength Assignment in All-Optical Networks, IEEE/ ACM Trans. Net., 5(3), 489-501.
35 Pioro, M., Szenti, A., Harmatos, J., Juttner, A., Gajownicczek, P. and Kozdrowski, S. (2002), On Open Shortest Path First Related Network Optimization Problems, Performance Evaluation, 48(4), 201-223.   DOI   ScienceOn
36 Bertsimas, D. and Sim, M. (2004), Robust Discrete Optimization and Network Flows, Mathematical Programming, 98(1), 49-71.
37 Ericsson, M., Resende, M. and Pardolas, P. (2002), A Genetic Algorithm for Weight Setting Problem in OSPF Routing, J. of Combinatorial Opt, 6, 299-333.   DOI
38 Ou, C., Zhang, J. Zhang, Hui., Sahasrabuddhe, L. H. and Mukerjee, B. (2004), New and Improved Approaches for Shared-Path Protection in WDM Mesh Networks, Journal on Lightwave Technology, 22(5), 1223-1232.   DOI   ScienceOn
39 Ramaswami, R. and Sivarajan, K. (2002), Optical Networks -A Practical Perspective, 2nd Ed. Morgan Kaufmann.
40 Wan P-J., Calinescu, G. and Frieder, O. (2000), Grooming of Arbitrary Traffic in SONET/WDM BLSRs, IEEE JSAC, 18(10), 1995-2003.
41 Krishnaswamy, R. and Sivarajan, K. (2001), Algorithms for Routing and Wavelength Assignment Based on Solutions of LP-Relaxation, IEEE Comm, Letters, 10(10), 435-437.
42 Wolfgang, G. and Winkler, P. (1998), Ring Routing and Wavelength Translation, Proc. 9th Annual ACM-SIAM Symp. Discerete Algorithms, 333-341.
43 Guan, Y., S. Ahmed, Nemhauser, G. L. and Miller, A. J. (2006), A Branch-and-Cut Algorithm for the Stochastic Uncapacitated Lot-sizing Problem, Mathematical Programming, 105(1), 55-84.   DOI
44 Jaumard, B., Meyer, C. and Thiongane, B. (2004), Comparison of ILP Formulations for the RWA Problem, Research Report, Les Cahiers du GERAD.