Browse > Article

Economic Analysis of SONET/WDM UPSR and BLSR Ring Networks Using Traffic Grooming  

Kang, Donghan (Information Management Team, Samsung Electro-Mechanics)
Park, Sungsoo (Department of Industrial Engineering, Korea Advanced Institute of Science and Technology)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.30, no.3, 2004 , pp. 213-223 More about this Journal
Abstract
We consider the traffic grooming problem for the design of SONET/WDM(Synchronous Optical NETwork/Wavelength Division Multiplexing) ring networks. Given a physical network with ring topology and a set of traffic demands between pairs of nodes, we are to obtain a stack of rings with the objective of minimizing the number of ADMs installed at the nodes. This problem arises when a single ring capacity is not large enough to accommodate all the demands. As a solution method, an efficient algorithm based on the branch-and-price approach has been reported in the literature for the problem in which only unidirecional path switched ring (UPSR) was considered. In this study, we suggest integer programming models and the algorithms based on the same approach as the above one, considering two-fiber bidirectional line switched ring(BLSR/2), and BLSR/4 additionally. Using the results, we compare the number of required ADMs for all types of the ring architecture.
Keywords
SONET/WDM ring networks; traffic grooming; branch-and-price algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Arijs, P., and Demeester, P. (1998), Efficient Design of Stacked Multiplex Section Shared Protection Ring, In: D.W. Faulkner and A.L. Harmer, eds., Long-Haul, ATM and Multi-media Networks, lOS Press, Amsterdam, The Netherlands, 164-171
2 Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., and Vance, P.H. (1998), Branch-and-price: Column Generation for Solving Huge Integer Programs, Operations Research, 46, 316-329
3 Sutter, A., Vanderbeck, F., and Wolsey, L. (1998), Optimal Placement of Add/drop Multiplexers: Heuristic and Exact Algorithms, Operations Research, 46, 719-728
4 Vanderbeck, F., and Wolsey, L., (1996), An Exact Algorithm for IP Column Generation, Operations Research Letters, 19, 151-159
5 Simmons, J.M., Goldstein, E.L. and Saleh, A.A.M. (1999), Quantifying the Benefit of Wavelength Add-drop in WDM Rings with Distance-independent and Dependent Traffic, IEEE Journal of Lightwave Technology, 17,48-57
6 Sherali, H.D., Smith, J.C. and Lee, Y. (2000), Enhanced Model Representations for an Intra-ring Synchronous Optical Network Design Problem Allowing Demand Splitting, INFORMS Journal on Computing, 12, 284-298
7 Chiu, A.L., and Modiano, E.H. (2000), Traffic Grooming Algorithms for Reducing Electronic Multiplexing Costs in WDM Ring Networks", IEEE Journal of Lightwave Technology, 18, 2-12
8 Vanderbeck, F. (2000), On Dantzig-Wolfe Decomposition in Integer Programming and Ways to Perform Branching in a Branch-andprice Algorithm, Operations Research, 48, 111-128
9 Wu, T-H. (1992), Fiber Network Service Survivability, Artec House, Boston, MA
10 Wan, P.-J., Cy linescu, G.,Liu, L.and Frieder, O.(2000), Grooming of Arbitrary Traffic in SONEI/WDM BLSRs, IEEE Journal on Selected Areas in Communications, 18, 1995-2003
11 Ramaswami, R., and Sivarajan, K. (1998), Optical Networks: A Practical Perspective, Morgan Kaufman, San Francisco, CA
12 Garey, M.R., and Johnson, D.S. (1979), Computer and Intractability, Freeman, San Francisco
13 Zhang, X., and Qiao, C. (2000), An Effective and Comprehensive Approach for Traffic Grooming and Wavelength Assignment in SONET/WDM Rings, IEEE/ACM Transaction on Networking, 8 (5),608-617   DOI   ScienceOn