Crosstalk Free Routing Algorithm for High Speed Optical Multistage Interconnection Network

Document Type : Original Article

Authors

1 Electronics and Electrical Communications Engineering Department, Faculty of Electronic Engineering, Menoufia University, EGYPT.

2 Telecommunications Engineering Department, Faculty Engineering, Egyptian Russian University, EGYPT.

3 Telecom Egypt Company.

Abstract

High speed optical interconnection networks are further more integrated
for modern computing systems and parallel computing. Optical multistage
interconnection network (OMIN) is a popular dynamic network schemes
that are used in switching and communication of high speed optical
interconnection network applications. However, OMINs introduce
crosstalk which results from coupling two signals within one Switching
Element. This paper highlights the breakthroughs in the area of
scheduling methods and crosstalk free routing in optical interconnection
networks, and proposes new timely conflict free routing algorithms.

width: 0px; "> </[1] O. L. Ladouceur, “Breakthroughs in Photonics 2014: Optical Interconnection
Networks” IEEE photonic journal, Vol. 7, No. 3, p.p 751–756 June 2015.
[2] Manisha, V. Malik, “Effect of Crosstalk in Optical Component”, International
Journal for Research in Applied Science & Engineering Technology
(IJRASET), Vol.3, No. V, p.p 456-459, May 2015.
[4] R. R. Aggarwal, L. Kaur, H. Aggarwal, “Multistage Interconnection
Networks: A transition from Electronic to Optical”, Journal of Emerging
Technologies in Web Intelligence, Vol. 2, No. 2, pp. 142-147, May 2010.
adjust: auto; -webkit-text-stroke-widt[4] N. A. Yunus, M. Othman “Reliability Evaluation and Routing Integration in
Shuffle Exchange Omega Network”, Journal of Networks, Vol. 9, No. 7, pp.
1732-1737, Jul. 2014.
[5] R. Mahajan, R. Vig, “A new min: fault-tolerant advance omega network”,
Proceedings of the 12th WSEAS International Conference on Computers, pp.
763-768, Jul. 2008.
[6] S. C. Chau, T. Xiao and A. W. C. Fu, “Routing and Scheduling for a Novel
Optical Multistage Interconnection Networks”. Euro-Par 2005 Parallel
Processing, Lecture Notes in Computer Science, Vol. 3648, No. 9, pp. 984-
993, 2005.
[7] C. Qiao, R. Melhem, “A Time Domain Approach for Avoiding Crosstalk in
Optical Blocking Multistage Interconnection Networks”, Journal of
Lightwave Technology, Vol. 12. No. 10, pp. 1854- 1862, 1994.
[8] T. D. Shahida, M. Othman and M. K. Abdullah, “Fast Zerox algorithm for
routing in optical Multistage interconnection networks”, IIUM Engineering
Journal, Vol.11, No.1, pp. 28-39, 2010.
[9] A.K. Katangur, S. Akkaladevi and Y. Pan, “Analyzing the performance of
optical multistage interconnection networks with limited crosstalk”, Cluster
Computing, Vol. 10, No.7, pp. 241-250, Mar. 2007.
[10] E. Lu and S. Q. Zheng, “High-Speed Crosstalk-Free Routing for Optical
Multistage Interconnection Networks”. Proceedings of the 12th International
Conference on Computer Communications and Networks, pp. 249-254,
2003.
[11] F. Abed and M. Othman, “Fast method to find conflicts in optical multistage
interconnection networks, International Journal of The Computer”, The
Internet and Management, Vol.16, No.1, pp. 18-25, 2008.
[12] M. Abdullah, M. Othman and R. Johari, “An efficient approach for message
routing in optical omega network”, International Journal of The Computer,
the Internet and Management, Vol.14, No.1, pp. 50- 60, 2006.
[13] M.A.Al-Shabi ,“ZeroX Algorithms with Free crosstalk in Optical Multistage
Interconnection Network” International Journal of Advanced Computer
Science and Applications IJACSA,Vol. 4, No. 2, pp.156-160, 2013.
[14] M.A.A.Al-shabi “Zero algorithms for avoiding crosstalk in optical
multistage interconnection networks” PhD thesis, universiti putra malaysia,
2005.
[15] M. Abdullah, “Efficient Sequential and Parallel Routing Algorithms in
Optical Multistage Interconnection Networks”, Master Thesis, Universiti
Putra Malaysia, 2005.
auto; -webkit-text-stroke-width: 0px; [16] M. Abdullah, M. Othman, and R. Johari, “Efficient Parallel Routing
Algorithms in Optical Multistage Interconnection Network”, IEEE
International Conference on Communication Networks, 13th IEEE
International Conference pp. 505-509, 16-18 Nov. 2005.
[17] Kaur, R. Vohra and S. Kaur, “Analysis of Various Crosstalk Avoidance
Techniques in Optical Multistage Interconnection Network”, International
Journal of P2P Network Trends and Technology.
www.internationaljournalssrg.org Vol.1, No.2, pp.1-5, 2011.
[18] H. Sharshar, A. El-Eraki, “Scheduling Methods Comparison Based Optical
Multistage Interconnection Networks With Using Proposed Fast Window
Methods,” International Journal of Advanced Research in Electronics and
Communication Engineering (IJARECE), Vol. 4, pp. 1489-1496, June 2015.
[19] A. K. Katangur, Y. Pan, M. D. Fraser, “Message Routing and Scheduling in
Optical Multistage Networks Using Simulated Annealing”, Proceedings of
the International Parallel and Distributed Processing Symposium, 2002.
[20] A. K. Katangur, S. Akkaladevi and Y. Pan, “Analyzing the performance of
optical multistage interconnection networks with limited Crosstalkm,”
Cluster Computing journal, Vol.10, No 2, pp. 241-250, June 2007.
[21] A. K. Katangur, A. Somasheker, Y. Pan, M. D. Fraser. “Applying Ant
Colony Optimization to Routing Optical Multistage Interconnection
Networks with Limited Crosstalk,” Vol. 04, April 26 2004.
[22] O. Munir, A. Mohamed, “An efficient approach to avoid crosstalk in optical
Omega Network,” International Journal of The Computer, The Internet and
Management, Vol. 14, No. 1, pp. 50-60, 2005.
[23] M. Fang, “layout Optimization for Point to Multi Point Wireless Optical
Networks via Simulated Annealing & Genetic Algorithm,” Master Project,
University of Bridgeport, 2000.
[24] Ramniwas, L. Lodha “Reduce the Cross Talk in Omega Network by Using
Windowing Techniques”, International Journal on Recent and Innovation
Trends in Computing and Communication, Vol. 4, No. 6, pp. 54-57, Jun.
2016.
[25] H. Miao, “A Java Visual Simulation Study of Four Routing Algorithms on
Optical Omega Network.” Master thesis, Computer Science department,
University of Dayton, 2000.