Abstract
Multistage interconnection networks (MINs) consist of more than one stage of small interconnection elements called switching elements and links interconnecting them. A MIN connects N inputs to N outputs and is referred as an N × N MIN, having size N. An Optical MIN (OMIN) is an important class of Interconnection networks. The problem of crosstalk is caused by coupling two signals within switching elements. A number of techniques like Optical window, Heuristic, Genetic, and Zero have been proposed earlier in this regard. In this paper, we have proposed an Address Selection Algorithm (ASA) and we have applied to existing Omega network, having shuffle-exchange connection pattern. The aim of this algorithm is to minimize the number of switch conflicts in the network and to provide conflict free routes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Shahida, T.D., Othman, M., Abdullah, M.K.: Fast Zerox Algorithm for Routing in Optical Multistage Interconnection Networks. IIUM Engineering Journal 11(1) (2010)
Al-Shabi, M.A., Othman, M.: A New Algorithm for Routing and Scheduling in Optical Omega Network. International Journal of the Computer, the Internet and Management 16(1), 26–31 (2008)
Abed, F., Othman, M.: Fast Method to Find Conflicts in Optical Multistage Interconnection Networks. International Journal of the Computer, the Internet and Management 16(1), 18–25 (2008)
Shahida, D., Othman, M., Khazani, M.: Routing Algorithms in Optical Multistage Interconnection Networks: Revisited. In: Proceedings of the 3rd World Engineering Congress, pp. 63–70 (2007)
Abdullah, M., Othman, M., Johari, R.: An Efficient Approach for Message Routing in Optical Omega Network. International Journal of the Computer, the Internet and Management 14(1), 50–60 (2006)
Chau, S.-C., Xiao, T., Fu, A.W.-c.: Routing and scheduling for a novel optical multistage interconnection network. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 984–993. Springer, Heidelberg (2005)
Al-Shabi, M.A., Othman, M., Johari, R., Subramaniam, S.: New Algorithm to avoid Crosstalk in Optical Omega Network. In: Proceedings of the IEEE International Conference on Network (MICC-ICON 2005), pp. 501–504 (2005)
Katangur, A.K., Akkaladevi, S., Pan, Y., Fraser, M.D.: Applying Ant Colony Optimization to Routing Optical Multistage Interconnection Networks with Limited Crosstalk. In: Proceedings of the 18th International Parallel and Distributed Processing Symposium, pp. 163–170 (2004)
Chau, S.C., Xiao, T.: A New Algorithm for Routing and Scheduling in Optical Multistage Interconnection Networks. In: Proceedings of the 4th IASTED International Multi-Conference on Wireless and Optical Communications, Banff, Canada, pp. 749–755 (2004)
Yang, Y., Wang, J., Pan, Y.: Routing Permutations with Link-Disjoint and Node Disjoint Paths in a Class of Self-Routable Interconnects. IEEE Transactions on Parallel and Distributed Systems 14(4), 383–393 (2003)
Lu, E., Zheng, S.Q.: High-Speed Crosstalk-Free Routing for Optical Multistage Interconnection Networks. In: Proceedings of the 12th International Conference on Computer Communications and Networks, pp. 249–254 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhardwaj, V.P., Nitin, Tyagi, V. (2011). An Algorithmic Approach to Minimize the Conflicts in an Optical Multistage Interconnection Network. In: Abraham, A., Lloret Mauri, J., Buford, J.F., Suzuki, J., Thampi, S.M. (eds) Advances in Computing and Communications. ACC 2011. Communications in Computer and Information Science, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22714-1_58
Download citation
DOI: https://doi.org/10.1007/978-3-642-22714-1_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22713-4
Online ISBN: 978-3-642-22714-1
eBook Packages: Computer ScienceComputer Science (R0)