Analysis of Various Crosstalk Avoidance Techniques in Optical Multistage Interconnection Network
|
International Journal of P2P Network Trends and Technology (IJPTT) | |
© 2011 by IJPTT Journal | ||
Volume-1 Issue-2 |
||
Year of Publication : 2011 | ||
Authors : Sehajpal Kaur, Rajan Vohra, Sandeep Kaur |
Citation
Sehajpal Kaur, Rajan Vohra, Sandeep Kaur."Analysis of Various Crosstalk Avoidance Techniques in Optical Multistage Interconnection Network". International Journal of P2P Network Trends and Technology (IJPTT), V1(2):12-16 Sep - Oct 2011, ISSN:2249-2615, www.ijpttjournal.org. Published by Seventh Sense Research Group.
Abstract
This paper presents the various crosstalk avoidance algorithms in optical multistage interconnection network. The major problem introduced by optical multistage interconnection networks is crosstalk which is caused by the coupling of two signals within same switching element. To avoid a crosstalk, many approaches have been proposed such as time domain and space domain approaches. One way to solve this problem is to avoid coupling of two signals within same switching element. In this paper, various algorithms such as Window method, Improved Window method and Bitwise window method are implemented to avoid crosstalk. Window Method is used to find out which messages have conflict and it is also used to find the message that are not in same group because it causes crosstalk in the network. Then Improved window method is used in which first window is eliminated. Then Bitwise window method in which all the binary bits of single row in each window are converted to decimal so complexity is reduced.
References
[1] Christopher Tocci, H. John Caufield “Optical interconnection foundation and applications” Artech house, Norwood, 1994.
[2] Pan, Y. Qiao, Yang Y., “Optical multistage interconnection networks: new challenges and approaches”, IEEE communications magazine, feature topic on optical networks, communication systems and devices, vol. 37, no. 2, 1999, pp. 50.
[3] Pan, Y. Ji, C. Lin, X. Jia, X. “Evolutionary Approach for Message Scheduling in Optical Omega Networks”, Fifth International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP), (2002).
[4] Siu-Cheung Chau and Tiehong Xiao, “A new algorithm for routing and Scheduling in optical multistage interconnection networks”, Proceedings of the 4th international multi-conference on wireless and optical Communications, 2004, pp. 749-755.
[5] Mohammad, .A. A. Mohamed, O., Rozita, J., Shamala, S., “New algorithm to avoid crosstalk in optical multistage interconnection networks”, Proceeding of IEEE international conference on network, vol. 1, 2005, pp.501-504.
[6] Munir, A, mohamed, O., Rozita, J., “An efficient approach to avoid crosstalk in optical omega network”. International journal of the computer, the internet and management, vol.14, no.1, 2005, pp.50-60.
[7] Farzaneh Abed , Mohamed Othman, “ Efficient window method in optical multistage interconnection networks”, Proceedings of the IEEE international conference on telecommunications and Malaysia international conference on communications, May 2006, pp.14-17.
[8] F.Abed, 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, April 2008, pp. 18- 25.
[9] Tengku Dian Shahida1, Mohamed Othman, Mohamad Khazani “A fast and efficient crosstalk-free algorithm for routing in optical multistage interconnection networks”, IEEE,2008.
[10] Mohamed Othman, Farzaneh Abed, “Fast four heuristic routing algorithms in optical Multistage interconnection switch networks”, Journal of information & communication technology, vol. 2, no. 1, 2008, pp. 40-48.
[11] Er. Sandeep kaur, Er. Anantdeep, Er. Deepak Aggarwal , “Effect of crosstalk on permutation in optical multistage interconnection networks”, Journal of computing, vol. 2, Issue 4, April 2010, issue 2151-9617.
Keywords
Optical Multistage Interconnection Networks, Window Method, Improved window method, Bitwise Window Method, Crosstalk Algorithm.