A GreedyZero algorithm to minimise the conflicts in an Optical Multistage Interconnection Network

Citation

Moudi, Mehrnaz and Othman, Mohamed (2014) A GreedyZero algorithm to minimise the conflicts in an Optical Multistage Interconnection Network. Journal of Network and Computer Applications, 41. pp. 312-318. ISSN 1084-8045; ESSN: 1095-8592

Abstract

An Optical Multistage Interconnection Network (OMIN) is an important class of Interconnection Network that has large transmission capacity in the communication networks. One of the severe problems is the conflict which is caused through coupling two signals within switching elements. In this paper, we have proposed a new algorithm to minimise the number of conflicts of OMINs using the greedy graph colouring and Zero algorithm. The greedy graph colouring approach employed the Zero algorithm to categorise inputs of the OMINs without conflict. The results showed that the number of passes reduced by approximately 30%. In addition, the average execution time of our proposed algorithm was less than the average execution time of the Zero algorithm.

Download File

Preview

PDF (Abstract)
A GreedyZero algorithm to minimise the conflicts in an Optical Multistage Interconnection Network.pdf
Download (37kB) | Preview

Official URL or Download Paper: http://www.sciencedirect.com/science/article/pii/S...

Additional Metadata

Item Type:	Article
Divisions:	Faculty of Computer Science and Information Technology
DOI Number:	https://doi.org/10.1016/j.jnca.2014.01.001
Publisher:	Elsevier
Keywords:	Conflicts; Optical Multistage Interconnection Networks; Zero algorithm; Greedy graph colouring algorithm
Depositing User:	Nabilah Mustapa
Date Deposited:	18 Dec 2015 04:24
Last Modified:	18 Dec 2015 04:24
Altmetrics:	http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1016/j.jnca.2014.01.001
URI:	http://psasir.upm.edu.my/id/eprint/36167
Statistic Details:	View Download Statistic

Actions (login required)

View Item