@article{ART001958407},
author={Sang-Un, Lee},
title={Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2015},
volume={20},
number={1},
pages={111-118}
TY - JOUR
AU - Sang-Un, Lee
TI - Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem
JO - Journal of The Korea Society of Computer and Information
PY - 2015
VL - 20
IS - 1
PB - The Korean Society Of Computer And Information
SP - 111
EP - 118
SN - 1598-849X
AB - This paper deals with the routing and wavelength assignment problem (RWAP) that decides the bestlightpaths for multiple packet demands for in optical communication and assigns the minimum numberof wavelengths to given lightpaths. There has been unknown of polynomial-time algorithm to obtain theoptimal solution for RWAP. Hence, the RWAP is classified as NP-complete problem and one can obtain theapproximate solution in polynomial-time. This paper decides the shortest main and alternate lightpath withsame hop count for all for given network in advance. When the actual demands of communication forparticular multiple packet for , we decrease the maximum utilized edge into utilized number usingthese dual-paths. Then, we put these into -wavelength bins without duplicated edge. This algorithmcan be get the optimal solution within computational complexity. For two experimental data, the proposed algorithm shows that can be obtain the known optimal solution.
KW - Lightpath routing;Wavelength assignment;Dual-path;Independent set;Bin packing
DO -
UR -
ER -
Sang-Un, Lee. (2015). Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem. Journal of The Korea Society of Computer and Information, 20(1), 111-118.
Sang-Un, Lee. 2015, "Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem", Journal of The Korea Society of Computer and Information, vol.20, no.1 pp.111-118.
Sang-Un, Lee "Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem" Journal of The Korea Society of Computer and Information 20.1 pp.111-118 (2015) : 111.
Sang-Un, Lee. Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem. 2015; 20(1), 111-118.
Sang-Un, Lee. "Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem" Journal of The Korea Society of Computer and Information 20, no.1 (2015) : 111-118.
Sang-Un, Lee. Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem. Journal of The Korea Society of Computer and Information, 20(1), 111-118.
Sang-Un, Lee. Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem. Journal of The Korea Society of Computer and Information. 2015; 20(1) 111-118.
Sang-Un, Lee. Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem. 2015; 20(1), 111-118.
Sang-Un, Lee. "Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem" Journal of The Korea Society of Computer and Information 20, no.1 (2015) : 111-118.
