Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

A Cuckoo Search based WDM Channel Allocation Algorithm

Print
PDF
International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 96 - Number 20
Year of Publication: 2014
Authors:
Shonak Bansal
Ruchi Chauhan
Parveen Kumar
10.5120/16908-6988

Shonak Bansal, Ruchi Chauhan and Parveen Kumar. Article: A Cuckoo Search based WDM Channel Allocation Algorithm. International Journal of Computer Applications 96(20):6-12, June 2014. Full text available. BibTeX

@article{key:article,
	author = {Shonak Bansal and Ruchi Chauhan and Parveen Kumar},
	title = {Article: A Cuckoo Search based WDM Channel Allocation Algorithm},
	journal = {International Journal of Computer Applications},
	year = {2014},
	volume = {96},
	number = {20},
	pages = {6-12},
	month = {June},
	note = {Full text available}
}

Abstract

More and more modern metaheuristics nature–inspired algorithms are emerging and they become increasingly popular. This paper formulates an algorithm for solving the channel–allocation problem in optical wavelength division multiplexing (WDM) systems to suppress four–wave mixing crosstalk (FWM) based on a novel nature–inspired algorithm, called Cuckoo Search algorithm by using the concept of Optimal Golomb ruler (OGR) sequences. Simulation results conclude the significance performance improvement, without the requirement of increased total optical channel bandwidth, unlike two existing classical channel–allocation algorithms i. e. Extended Quadratic Congruence (EQC) and Search Algorithm (SA) and one of the existing nature–inspired algorithm i. e. Genetic Algorithm (GA).

References

  • Kwong, W. C. , and Yang, G. C. 1997. An Algebraic Approach to the Unequal-Spaced Channel-Allocation Problem in WDM Lightwave Systems. IEEE Transactions on Communications, Vol. 45, No. 3, pp. 352–359.
  • Chraplyvy, A. R. 1990. Limitations on Lightwave Communications Imposed by Optical–Fiber Nonlinearities. J. Lightwave Technol. , Vol. 8, pp. 1548–1557.
  • Aggarwal, G. P. 2001. Nonlinear Fiber Optics. Second Edition, Academic Press, San Diego.
  • Thing, Vrizlynn L. L. , Shum, P. , and Rao, M. K. 2004. Bandwidth–Efficient WDM Channel Allocation for Four-Wave Mixing-Effect Minimization. IEEE Transactions on Communications, Vol. 52, No. 12, pp. 2184–2189.
  • Saaid, Nordiana M. 2010. Nonlinear Optical Effects Suppression Methods in WDM Systems with EDFAs: A Review. In Proceedings of the International Conference on Computer and Communication Engineering (ICCCE 2010), (11–13 May 2010), Kuala Lumpur, Malaysia.
  • Forghieri, F. , Tkach, R. W. , Chraplyvy, A. R. , and Marcuse, D. 1994. Reduction of Four–Wave Mixing Crosstalk in WDM Systems Using Unequally Spaced Channels. IEEE Photonics Technology Letters, Vol. 6, No. 6, pp. 754–756.
  • Babcock, W. C. 1953. Intermodulation interference in radio systems, Bell Systems Technical Journal, pp. 63–73.
  • Sardesai, H. P. 1999. A Simple Channel Plan to Reduce Effects of Nonlinearities In Dense WDM Systems. Lasers and Electro–Optics, (23–28, May–1999), pp. 183–184.
  • Forghieri, F. , Tkach, R. W. , and Chraplyvy, A. R. 1995. WDM systems with unequally spaced channels. J. Lightwave Technol. , Vol. 13, pp. 889–897.
  • Hwang, B. and Tonguz, O. K. 1998. A generalized suboptimum unequally spaced channel allocation technique—Part I: In IM/DDWDMsystems. IEEE Trans. Commun. , Vol. 46, pp. 1027–1037.
  • Tonguz, O. K. and Hwang, B. 1998. A generalized suboptimum unequally spaced channel allocation technique—Part II: In coherent WDM systems. IEEE Trans. Commun. , Vol. 46, pp. 1186–1193.
  • Atkinson, M. D. , Santoro, N. , and Urrutia, J. 1986. Integer sets with distinct sums and differences and carrier frequency assignments for nonlinear repeaters. IEEE Trans. Commun. , Vol. COM-34.
  • Randhawa, R. , Sohal, J. S. and Kaler, R. S. 2009. Optimum Algorithm for WDM Channel Allocation for Reducing Four-Wave Mixing Effects. Optik 120, pp. 898–904.
  • http://www. compunity. org/events/pastevents/ewomp2004/jaillet_krajecki_pap_ew04. pdf
  • Bloom, Gray S. and Golomb, S. W. 1977. Applications of Numbered Undirected Graphs. In Proceedings of the IEEE, Vol. 65, No. 4, (April 1977), pp. 562–570.
  • Thing, Vrizlynn L. L. , Rao, M. K. and Shum, P. 2003. Fractional Optimal Golomb Ruler Based WDM Channel Allocation. In Proceedings of the 8th Opto-Electronics and Communication Conference (OECC–2003), Vol. 23, pp. 631-632.
  • Shearer, James B. 1998. Some New Disjoint Golomb Rulers. IEEE Transactions on Information Theory, Vol. 44, No. 7, pp. 3151–3153.
  • http://theinf1. informatik. uni-jena. de/teaching/ss10/oberseminar-ss10
  • Robinson, J. P. 1979. Optimum Golomb Rulers. IEEE Transactions on Computers, Vol. C-28, No. 12, (December 1979), pp. 943–944.
  • James B. Shearer. 1990. Some New Optimum Golomb Rulers. IEEE Transactions on Information Theory. IT-36, (January 1990), pp. 183–184.
  • Galinier, Jaumard, Morales, and Pesant G. 2001. A constraint–Based Approach to the Golomb Ruler Problem. In Proceeding of 3rd International workshop on integration of AI and OR techniques (CP-AI-OR 2001).
  • Leitao, Tiago 2004. Evolving the Maximum Segment Length of a Golomb Ruler. Genetic and Evolutionary Computation Conference, USA.
  • Rankin, William T. 1993. Optimal Golomb Rulers: An exhaustive parallel search implementation. M. S. thesis, Duke University, (Available at http://people. ee. duke. edu/~wrankin/golomb/golomb. html).
  • Shobhika 2005. Generation of Golomb Ruler Sequences and Optimization Using Genetic Algorithm. M. Tech. Thesis, Department of Electronics and Communication Engineering, Thapar Institute of Engineering and Technology, Deemed University, Patiala.
  • Soliday, Stephen W. , Homaifar, A. and Lebby, Gary L. 1995. Genetic Algorithm Approach to the Search for Golomb Rulers. In Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA-95), Morgan Kaufmann, pp. 528–535.
  • Robinson, John P. 2000. Genetic Search for Golomb Arrays. IEEE Transactions on Information Theory, Vol. 46, No. 3, pp. 1170–1173.
  • Ayari, N. , The? Van Luong and A. Jemai. 2010. A Hybrid Genetic Algorithm for Golomb Ruler Problem. In Proceeding of ACS/IEEE International Conference on Computer Systems and Applications (AICCSA 2010), pp. 1–4.
  • Bansal, S. 2014. Optimal Golomb Ruler Sequence Generation for FWM Crosstalk Elimination: Soft Computing Versus Conventional Approaches. Appl. Soft Comput. J. http://dx. doi. org/10. 1016/j. asoc. 2014. 04. 015.
  • Bansal, S. , Kumar, S. , Sharma, H. and Bhalla, P. 2011. Golomb Ruler Sequences Optimization: A BBO Approach. International Journal of Computer Science and Information Security (IJCSIS), Pittsburgh, PA, USA, Vol. 9, No. 5, pp. 63–71.
  • Bansal, S. , Kumar, S. , Sharma, H. and Bhalla, P. 2011. Generation of Golomb Ruler Sequences and Optimization Using Biogeography Based Optimization. In Proceedings of 5th International Multi Conference on Intelligent Systems, Sustainable, New and Renewable Energy Technology and Nanotechnology (IISN–2011), Institute of Science and Technology Klawad, Haryana, pp 282–288.
  • Bansal, S. 2011. Golomb Ruler Sequences Optimization: Soft Computing Approaches. M. Tech. Thesis, Department of Electronics and Communication Engineering, Maharishi Markandeshwar Engineering College, Deemed University, Mullana.
  • Bansal S. , Kumar S. and Bhalla P. 2013. A Novel Approach to WDM Channel Allocation: Big Bang–Big Crunch Optimization. In the proceeding of Zonal Seminar on Emerging Trends in Embedded System Technologies (ETECH-2013) organized by The Institution of Electronics and Telecommunication Engineers (IETE), Chandigarh Centre, Chandigarh, pp. 80–81.
  • Kumar S. , Bansal S. and Bhalla P. 2012. Optimal Golomb Ruler Sequence Generation for FWM Crosstalk Elimination: A BB–BC Approach. In Proceedings of 6th International Multi Conference on Intelligent Systems, Sustainable, New and Renewable Energy Technology and Nanotechnology (IISN–2012), Institute of Science and Technology Klawad–133105, Haryana, India, pp. 255–262.
  • Bansal, S. , Singh, K. , 2014. A Novel Soft–Computing Algorithm for Channel Allocation in WDM Systems. International Journal of Computer Applications (IJCA), Vol. 85, No. 9, pp. 19–26.
  • Colannino, J. 2003. Circular and Modular Golomb Rulers. URL:http://cgm. cs. mcgill. ca/~athens/cs507/Projects/2003/JustinColannino/.
  • Dimitromanolakis, A. 2002. Analysis of the Golomb Ruler and the Sidon Set Problems, and Determination of Large, Near-Optimal Golomb Rulers. Master's Thesis, Department of Electronic and Computer Engineering, Technical University of Crete.
  • Dollas, A. , Rankin, William T. , and McCracken, D. 1998. A New Algorithm for Golomb Ruler Derivation and Proof of the 19 Mark Ruler. IEEE Transactions on Information Theory, Vol. 44, No. 1, pp. 379–382.
  • "Project OGR", http://www. distributed. net/OGR.
  • Cotta, C. , Dotu, I. , Fernandez, Antonio J. , and Hentenryck, Pascal V. 2007. Local Search-Based Hybrid Algorithms for Finding Golomb Rulers. Kluwer Academic Publishers, Boston, Vol. 12, Issue 3, pp. 263–291.
  • Lam, A. W. and Sarwate, D. V. 1988. On Optimal Time-hopping Patterns. IEEE Transactions on Communications (COM-36), pp. 380–382.
  • Lavoie, P. , Haccoun, D. and Savaria, Y. 1991. New VLSI Architectures for Fast Soft-Decision Threshold Decoders. IEEE Transactions on Communications, Vol. 39, No. 2, pp. 200–207.
  • http://mathworld. wolfram. com/PerfectRuler. html
  • http://mathworld. wolfram. com/GolombRuler. html
  • Robinson, J. P. and Bernstein, A. J. 1967. A Class of Binary Recurrent Codes with Limited Error Propagation. IEEE Transactions on Information Theory, IT-13, pp. 106–113.
  • Yang, X. -S. , and Deb, S. 2010. Engineering Optimisation by Cuckoo Search. Int. J. Mathematical Modelling and Numerical Optimisation. Vol. 1, No. 4, 330–343.
  • Yang, X. S. and Deb, S. 2009. Cuckoo search via Levy flights, in: Proc. of World Congress on Nature & Biologically Inspired Computing (NaBic 2009), IEEE Publications, USA, pp. 210--214.
  • Pratap R. 2010. Getting Started with Matlab A Quick Introduction for Scientists and Engineers. Oxford University Press, New York.
  • http://www. research. ibm. com/people/s/shearer/grtab. html
  • http://www. research. ibm. com/people/s/shearer/gropt. html