The analysis of Grooming Factor on Optimization Algorithms in All-optical Network

DOI

10.2991/icaset-18.2018.3How to use a DOI?

Keywords

Bidirectional SONET ring; Grooming factor; Graph coloring problem; Approximation ratio

Abstract

The most important thing in all optical networks is to reduce the cost of using the network in electronic processing equipment, along with wavelength division multiplexing (WDM) technology are increasingly improved. Add-drop multiplexer (ADM) is not only the most important equipment but also the most basic equipment using the point difference in all-optical networks. The function of the ADM processing device ,is a separation or insert the desired wavelength to networks. The key to reducing the cost is to reduce the number of ADM uses and minimize the number of ADMs. Traffic grooming problem is an important generalization of the ADM minimization problem, which is NP-hard. The specific way is to effectively package the number of available wavelengths ADMS on low speed traffic streams by requiring the number of wavelength per fiber and the required network, so as to reduce the network cost as much as possible. Synchronous optical network (SONET), which is a fiber-optic network for high-speed data communications transmission network .This paper mainly use the algorithm GROOMBYSC(k) to solve the traffic grooming problems in bi-directional interconnected SONET/WDM rings networks. The algorithm analysis shows that the algorithm has a better approximation ratio. We further improve the algorithm by computational analysis. We obtain a similar result by used the algorithm, and the approximation ratio is , where g is the grooming factor. Algorithm analysis shows that the grooming factor smaller than its approximation ratio of the approximation algorithm, the better the performance of the algorithm can be seen, what’s more we can obtain proved a general of the approximation algorithm.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Su-xia Cui
AU  - Yuan Yuan
PY  - 2018/04
DA  - 2018/04
TI  - The analysis of Grooming Factor on Optimization Algorithms in All-optical Network
BT  - Proceedings of the 2018 8th International Conference on Applied Science, Engineering and Technology (ICASET 2018)
PB  - Atlantis Press
SP  - 10
EP  - 17
SN  - 2352-5401
UR  - https://doi.org/10.2991/icaset-18.2018.3
DO  - 10.2991/icaset-18.2018.3
ID  - Cui2018/04
ER  -