Advanced SearchSearch Tips
Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem
Lee, Sang-Un;
  PDF(new window)
This paper deals with the routing and wavelength assignment problem (RWAP) that decides the best lightpaths for multiple packet demands for (s,t) in optical communication and assigns the minimum number of wavelengths to given lightpaths. There has been unknown of polynomial-time algorithm to obtain the optimal solution for RWAP. Hence, the RWAP is classified as NP-complete problem and one can obtain the approximate solution in polynomial-time. This paper decides the shortest main and alternate lightpath with same hop count for all (s,t) for given network in advance. When the actual demands of communication for particular multiple packet for (s,t), we decrease the maximum utilized edge into b utilized number using these dual-paths. Then, we put these (s,t) into b-wavelength bins without duplicated edge. This algorithm can be get the optimal solution within O(kn) computational complexity. For two experimental data, the proposed algorithm shows that can be obtain the known optimal solution.
Lightpath routing;Wavelength assignment;Dual-path;Independent set;Bin packing;
 Cited by
H. Zang, J. Jue, and B.Mukherjee, "A Review of Routing and Wavelength Assignment Approaches for Wavelength Routed Optical WDM Networks," Optical Networks Magazine, Jan. 2000.

I. Chlamtac, A. Ganz, and G. Karmi, "Lightpath Communications:An Approach to High Bandwidth Optical WAN's," IEEE Transactions on Communications, Vol. 40, No. 7, pp. 1171-1182, Jul. 1992. crossref(new window)

J. P. Jue, "Lightpath Establishment in Wavelength- Routed WDM Optical Networks," Optical networks, Kluwer Academic Publishers, pp. 99-122, 2001.

G. Z.Markovic and V. S. Acimovic-Raspopovic, "Solving the RWA Problemin WDM Optical Networks Using the BCO Meta-Heuristic," Telfor Journal, Vol. 2, No. 1, pp. 43-48, Jan. 2010.

C. Dzongang, P. Galinier, and S.Pierre, "A Tabu Search Heuristic for the Routing and Wavelength Assignment Problemin Optical Networks," IEEE Communications Letters, Vol. 9, No. 5, pp. 426-428, May 2005.

S. Baroni and P. Bayvel, "Wavelength Requirements in Arbitrarily Connected Wavelength-Routed Optical Networks," IEEE/OSA Journal of Lightwave Technology, Vol. 15, No. 2, pp. 242-251, Feb. 1997.

J.H. Siregar, H, Takagi, and Y. Zhang, "Efficient Routing and Wavelength Assignment in Wavelength-Routed Optical Networks," Proceedings of 7th Asia-Pacific Network Operations and Management Symposium, pp. 116-127. Oct. 2003.

D. Banerjee and B. Mukherjee, "A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks," IEEE Journal on Selected Areas in Communications, Vol. 14, No. 5, pp. 903-908, Jun. 1996. crossref(new window)

S. Even, A. Itai, and A. Shamir, "On the Complexity of Timetable and Multi-commodity Flow Problems," SIAM Journal on Computing, Vol. 5, No. 4, pp. 691-703, 1976. crossref(new window)

C. Hendrik, "RFC1058, Routing Information Protocol," The Internet Society, Jun. 1988.

G. Li and R. Simha, "The Partition Coloring Problem and its Application to Wavelength Routing and Assignment," Proceedings of the First Workshop on Optical Networks, pp. 1-19, 2000.

T. F. Noronha and C. C. Ribeiro, "Routing and Wavelength Assignment by Partition Colouring," European Journal of Operational Research,Vol. 171,No. 3, pp. 797-810, Jun. 2006. crossref(new window)