Blocking Analysis in Optical WDM network
DOI:
https://doi.org/10.26438/ijcse/v7i2.905909Keywords:
Irregular, Blocking Probability, Utilization, Channels, BandwidthAbstract
Demand of enormous bandwidth is explosively increasing nowadays. It can be fulfilled with the use of wavelength division multiplexing technology(wdm). Using optical wdm network for data transfer applications involves establishing the light paths for the traffic requests. In this paper, traffic scheduling of irregular requests is done with the use of the hybrid heuristic technique of flower pollination and simulated annealing algorithm. Also, the effect of number of wavelength channels present is analyzed using full wavelength conversion and nil wavelength conversion capability at the intermediate nodes. The results obtained after extensive simulation proved that the wavelength count of 16 is the most optimum count of wavelength resulting in proper resource optimization. Also, the hybrid of flower pollination and simulated annealing produces more promising results relative to chaotic particle swarm optimization in the context of the blocking probability for irregular traffic.
References
[1] F. Farahmand, X. Huang and J.P. Jue, “Efficient Online Traffic Grooming Algorithm in WDM Mesh Network with Drop and Continue Node Architecture”, In the Proceedings of First International Conference on Broadband networks,USA, pp. 1-10,2004.
[2] J. Triay, J. and C. Cervello- Pastor, “An ant based Algorithm for Distributed Routing and Wavelength Assignment in Dynamic Optical Networks”, IEEE Journal on Selected Areas in Communications, Vol. 28, Issue 4, pp. 542-55,2010.
[3] A. Wason and R.S. Kaler, “Wavelength Assignment Problem in optical WDM networks”, International Journal of Computer Science and Network Security, Vol 7,No. 4,pp 27-31,2007.
[4] V. Khosia, “A comprehensive Review of Recent Advancement in Optical Communication Networks”, International Journal of Computer Sciences & Engineering, Vol. 6, Issue 9, pp. 617-626,2018. Doi: 10.26438/ijcse/v6i9.617626
[5] B. Mukherjee, “WDM Optical Communication Networks: Progress and Challenges”, IEEE Journal on Selected Areas in Communications, Vol. 18,Issue 10, pp.1810-1824,2000.
[6] A. Hassan and C. Phillips, “Chaotic Particle Swarm Optimization for Dynamic Routing and Wavelength Assignment in all optical WDM networks”, In the Proceedings Of International Conference On Signal processing And Communication System, Omaha, NE, pp. 1-7,2009.
[7] D. Bisbal, I.D. Miguel, F. Gonzelez, J. Blas, J.C. Aguado, P. Fernadez, J. Duran , R. Duran,R. M. Lorenzo, E.J.Abril and M. Lopez, “Dynamic Routing and Wavelength Assignment in optical networks by means of genetic algorithms”, Photonic Network Communication,Vol. 7,Issue 1, pp.43-58,2004.
[8] S.H. Ngo, X. Jiang and S. Horiguchi, S., “An Ant Based Approach for Dynamic RWA In Optical WDM Networks”, Photonic Network Communications, 11(1), pp. 39-48,2006.
[9] R.M. Krishanaswamy, K.N. Sivaranjan, “Algorithms for routing and wavelength assignment based on solutions of LP relaxations”,IEEE Communications Letters,Vol. 5, Issue 10,pp. 435-437,2001.
[10] G. Shen, S.K. Bose, T.H. Cheng and T.Y. Chai, “Efficient heuristic algorithms for light path routing and wavelength assignment in WDM networks under dynamically varying loads”, Computer Communications, Vol. 24, Issue 3-4, pp. 364-373,2001.
[11] T.K. Ramesh, N. Amrutha Lakshmi, A. Madhu, K. Saumya Ready and P.R. Vaya, “ A Proactive and Self Regulated Ant Based RWA protocol for All Optical WDM Networks”, In the Proceedings Of International Conference On Process Automation Control and Computing , India, pp. 1-5,2011.
[12] T.F. Noronha. and C.C. Ribeiro,“Routing and wavelength assignment by partition colouring”, European Journal of Operational Research, Vol. 171,Issue 3, pp 797-810,2006.
[13] J. Crichigno, C. Xie, W. Shu, M.Y. Wu and N. Ghani, “A multiobjective approach for throughput optimization and traffic engineering in WDM networks”, In the Proceedings of 2009 Conference Record of Forty-Third Asilomar Conference On Signals, Systems and Computers, USA, pp.1043-1047,2009.
[14] K. Christodoulopoulos, K. Manousakis and E. Varvarigos, “Offline Routing and Wavelength Assignment in Transparent WDM Networks”, IEEE/ACM Transactions on Networking, Vol. 18,Issue 5,pp. 1557-1560,2010.
[15] Y. Ye, T.Y. Chai, T.H. Chen and C. Lu, “Dynamic routing and wavelength assignment algorithms in wavelength division multiplexed translucent optical network”, Computer Communications, Vol. 29, Issue 15, pp. 2975-2984,2006.
[16] M. Chen, B.M. Lin & S. Tseng, “Ant colony optimization for dynamic routing and wavelength assignment in WDM networks with sparse wavelength conversion”, Engineering Applications of Artificial Intelligence, Vol. 24, Issue 2, pp. 295-305,2011. doi:10.1016/j.engappai.2010.05.010
[17] H. Kaur and M. Rattan, “Hybid Algorithn Based Effective Light Trail Creation in an Optical Networks”, Journal of optical Communications. DOI: 10.1515/joc-2018-0209
[18] . B.M. Castañeda, J.P. Garzón & G.P. Leguizamón, “A comparative study of multiobjective computational intelligence algorithms to find the solution to the RWA problem in WDM networks”, Dyna., Vol 82, No. 194,pp 221-229,2015
[19] A.B. Rodriguez , A. Gutierrez , L. Rivera & L. Ramirez, “ RWA: Comparison of Genetic Algorithms and Simulated Annealing in Dynamic Traffic”, In: Sulaiman H, Othman M, Othman M, Rahim Y, Pee N (eds) Advanced Computer and Communication Engineering Technology. Lecture Notes in Electrical Engineering, 315, Springer, Cham:3-14,2014
[20] M.A. Baset and I. Hezam, “A hybrid flower pollination Algorithm for engineering Optimization Problems”, International journal of computer Applications, Vol. 140,Issue 12,pp 10-23,2016
[21] X.S. Yang, “Flower pollination algorithm for global optimization”, In Unconventional computation and natural computation, Lect. Notes Computer Science,Vol. 7445, Springer, pp. 240–249,2012.
[22] S. Kirkpatrick, C.D. Gelatt Jr., M.P. Vecchi, “Optimization by simulated annealing”, Science ,Vol. 220,Issue 4598,pp. 671–80,1983.
Downloads
Published
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
