Minimizing ADMs on WDM directed fiber trees

Authors:
FengFeng Zhou;GuoLiang Chen;YinLong Xu;Jun Gu
Affiliations:
Department of Computer Science and Technology, National High Performance Computing Center at Hefei, University of Science and Technology of China, Hefei 230027, P.R. China;Department of Computer Science and Technology, National High Performance Computing Center at Hefei, University of Science and Technology of China, Hefei 230027, P.R. China;Department of Computer Science and Technology, National High Performance Computing Center at Hefei, University of Science and Technology of China, Hefei 230027, P.R. China;Hong Kong University of Science and Technology, Department of Computer Science, Hong Kong, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2003

Citing 7
Cited 2

Efficient routing in all-optical networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimal wavelength routing on directed fiber trees

Theoretical Computer Science
Improved access to optical bandwidth in trees

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Limited Wavelength Conversion in All-Optical Tree Networks

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Developments in wavelength division multiple access networking

IEEE Communications Magazine
Models of blocking probability in all-optical networks with and without wavelength changers

IEEE Journal on Selected Areas in Communications
Benefits of wavelength translation in all-optical clear-channel networks

IEEE Journal on Selected Areas in Communications

Request scheduling on WDM networks with tunable ADMs

ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
On-Line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology

SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a polynomial-time algorithm for Minimum WDM/SONET Add/Drop Multiplexer Problem (MADM) on WDM directed fiber trees whether or not wavelength converters are used. It runs in time O(m2n), where n and m are the number of nodes of the tree and the number of the requests respectively. Incorporating T. Erlebach et al.'s work into the proposed algorithm, it also reaches the lower bound of the required wavelengths with greedy algorithms for the case without wavelength converters. Combined with some previous work, the algorithm reduces the number of required wavelengths greatly while using minimal number of ADMs for the case with limited wavelength converters. The experimental results show the minimal number of required ADMs on WDM directed fiber trees.