Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
SIAM Journal on Discrete Mathematics
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
Operations Research
Efficient access to optical bandwidth
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Grooming of arbitrary traffic in SONET/WDM BLSRs
IEEE Journal on Selected Areas in Communications
The chord version for SONET ADMs minimization
Theoretical Computer Science
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
Theoretical Computer Science
Optimizing regenerator cost in traffic grooming
Theoretical Computer Science
Approximating the traffic grooming problem in tree and star networks
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
SONET ADMs minimization with divisible paths
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
On the complexity of the regenerator cost problem in general networks with traffic grooming
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Optimal on-line colorings for minimizing the number of ADMs in optical networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 5.23 |
SONET ADMs are the dominant cost factor in the WDM/SONET rings. Recently several articles (Belvaux et al., European J. Oper. Res. 108 (1) (1998) 26-35; Clinescu and Wan, Traffic partition in WDM/SONET rings to minimize SONET ADMs, submitted for publication; Gerstel et al., Proc. IEEE INFOCOM'98, vol. 1, pp. 94-101; Liu et al., Proc. INFOCOM, vol. 2, 2000, pp.~1020-1025; Sutter et al., Oper. Res. 46 (5) (1998) 719-728) proposed a number of heuristics for traffic partition so as to use as few SONET ADMs as possible. Most of these heuristics assumes wavelength-continuity, i.e., the same wavelength is allocated on all of the links in the path established for a traffic stream. It was first observed and argued by Gerstel et al. that the number of ADMs can be potentially reduced by allowing a traffic stream to be locally transferred from one ADM in a wavelength to another ADM in a different wavelength at any intermediate node, in other words, the traffic streams are splittable. In this paper, we study two variations of this minimum ADM problem with splittable traffic streams: all traffic streams have prespecified routings, and all traffic streams have no prespecified routings respectively. Both variations are shown to be NP-hard. For the former variation, a heuristic with approximation ratio at most 5/4 is proposed. For the latter variation, a similar heuristic with approximation ratio 3/2 is proposed.