A new algorithm for routing and scheduling in optical omega network

Citation

Al-Shabi, Mohammed Abdulhameed Ali and Othman, Mohamed (2008) A new algorithm for routing and scheduling in optical omega network. International Journal of the Computer, the Internet and Management, 16 (1). pp. 26-31. ISSN 0858-7027

Abstract

Multistage interconnection networks (MIN) are popular in switching and communication applications. However, OMINs introduce crosstalk which results from coupling two signals within one Switching Element (SE). Under the constraint of avoiding crosstalk, what we will discuss in is how to realize a permutation that requires the minimum number of passes. In this paper, we are interested in a network called Omega Network, which has shuffle-exchange connection pattern. We propose a new algorithm called the ZeroY algorithm (ZeroY) to avoid crosstalk and route the traffic in an OM IN more efficiently. The results of the ZeroY algorithm are analyzed and compared with those of other algorithms (except the GA) in an Omega network. The ZeroY algorithm outperforms all the other algorithms in terms of the running time that are required for one permutation.

Download File

Preview

PDF (Abstract)
A new algorithm for routing and scheduling in optical omega network.pdf
Download (34kB) | Preview

Official URL or Download Paper: http://www.ijcim.th.org/past_editions/2008V16N1/v1...

Additional Metadata

Item Type:	Article
Divisions:	Faculty of Computer Science and Information Technology
Publisher:	Siam Technology College
Keywords:	Multistage interconnection networks (MIN); ZeroY; Omega Network; Routing algorithm
Depositing User:	Nabilah Mustapa
Date Deposited:	10 Oct 2016 04:29
Last Modified:	10 Oct 2016 04:29
URI:	http://psasir.upm.edu.my/id/eprint/48648
Statistic Details:	View Download Statistic

Actions (login required)

View Item