FAST ZEROX ALGORITHM FOR ROUTING IN OPTICAL MULTISTAGE INTERCONNECTION NETWORKS

Based on the ZeroX algorithm, a fast and efficient crosstalk-free time- domain algorithm called the Fast ZeroX or shortly FastZ_X algorithm is proposed for solving optical crosstalk problem in optical Omega multistage interconnection networks. A new pre-routing technique called the inverse Conflict...

Full description

Saved in:
Bibliographic Details
Published inIIUM engineering journal Vol. 11; no. 1; pp. 28 - 39
Main Authors Shahida, T. D., Othman, M., Abdullah, M. K.
Format Journal Article
LanguageEnglish
Published IIUM Press, International Islamic University Malaysia 22.06.2010
Online AccessGet full text
ISSN1511-788X
2289-7860
2289-7860
DOI10.31436/iiumej.v11i1.51

Cover

Abstract Based on the ZeroX algorithm, a fast and efficient crosstalk-free time- domain algorithm called the Fast ZeroX or shortly FastZ_X algorithm is proposed for solving optical crosstalk problem in optical Omega multistage interconnection networks. A new pre-routing technique called the inverse Conflict Matrix (iCM) is also introduced to map all possible conflicts identified between each node in the network as another representation of the standard conflict matrix commonly used in previous Zero-based algorithms. It is shown that using the new iCM, the original ZeroX algorithm is simplified, thus improved the algorithm by reducing the time to complete routing process. Through simulation modeling, the new approach yields the best performance in terms of minimal routing time in comparison to the original ZeroX algorithm as well as previous algorithms tested for comparison in this paper.
AbstractList Based on the ZeroX algorithm, a fast and efficient crosstalk-free time- domain algorithm called the Fast ZeroX or shortly FastZ_X algorithm is proposed for solving optical crosstalk problem in optical Omega multistage interconnection networks. A new pre-routing technique called the inverse Conflict Matrix (iCM) is also introduced to map all possible conflicts identified between each node in the network as another representation of the standard conflict matrix commonly used in previous Zero-based algorithms. It is shown that using the new iCM, the original ZeroX algorithm is simplified, thus improved the algorithm by reducing the time to complete routing process. Through simulation modeling, the new approach yields the best performance in terms of minimal routing time in comparison to the original ZeroX algorithm as well as previous algorithms tested for comparison in this paper.
Author Shahida, T. D.
Othman, M.
Abdullah, M. K.
Author_xml – sequence: 1
  givenname: T. D.
  surname: Shahida
  fullname: Shahida, T. D.
– sequence: 2
  givenname: M.
  surname: Othman
  fullname: Othman, M.
– sequence: 3
  givenname: M. K.
  surname: Abdullah
  fullname: Abdullah, M. K.
BookMark eNqFkEFPwjAYhhujiYjcPe4PgG3Xru2RkAGLsJpRIvHSlNKZksHINjT8eycYDx709L15k-f5kvcOXO_LvQPgAcFBiEgYPXp_3Lnt4B0hjwYUXYEOxlz0GY_gNeggilCb-eoW9OraryGOBIMchh0gx8OFCl7jTK6C4Wwis0RN58FYZkEmlypJJ0GSBvJZJaPhLJgvZypZqOEkblsVZyOZpvFIJTIN0li9yOxpcQ9uclPUrvd9u2A5jtVo2p_JyZejbzFHTZ8zRmxObIQhcYKwDYtyR4QgMId5SDdYWIioccJATJyljjHBGKfCIcJcBMMuSC7eTWm2-lD5nalOujRen4uyetOmarwtnBbUWopDuCGCEWwiszY5xwZagYxjnLUudHEd9wdz-jBF8SNEUJ8H1peB9XlgTVHLRBfGVmVdVy7X1jem8eW-qYwv_gLhL_DfX5_bhI4b
CitedBy_id crossref_primary_10_4304_jnw_9_7_1732_1737
crossref_primary_10_3745_JIPS_2013_9_2_301
ContentType Journal Article
DBID AAYXX
CITATION
ADTOC
UNPAY
DOA
DOI 10.31436/iiumej.v11i1.51
DatabaseName CrossRef
Unpaywall for CDI: Periodical Content
Unpaywall
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: Open Access资源_DOAJ
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2289-7860
EndPage 39
ExternalDocumentID oai_doaj_org_article_95cc5230d49742a6abaf82a0c91ae787
10.31436/iiumej.v11i1.51
10_31436_iiumej_v11i1_51
GroupedDBID AAYXX
ADBBV
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
GROUPED_DOAJ
IPNFZ
KQ8
OK1
RIG
ADTOC
UNPAY
ID FETCH-LOGICAL-c281t-8774cf4c6204e947d76fe49940f0f35d29c015ae9a024ec5e77977859e147e603
IEDL.DBID UNPAY
ISSN 1511-788X
2289-7860
IngestDate Fri Oct 03 12:29:44 EDT 2025
Mon Sep 15 10:02:17 EDT 2025
Thu Apr 24 23:07:47 EDT 2025
Tue Jul 01 01:51:47 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License cc-by
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c281t-8774cf4c6204e947d76fe49940f0f35d29c015ae9a024ec5e77977859e147e603
OpenAccessLink https://proxy.k.utb.cz/login?url=https://journals.iium.edu.my/ejournal/index.php/iiumej/article/download/51/25
PageCount 12
ParticipantIDs doaj_primary_oai_doaj_org_article_95cc5230d49742a6abaf82a0c91ae787
unpaywall_primary_10_31436_iiumej_v11i1_51
crossref_citationtrail_10_31436_iiumej_v11i1_51
crossref_primary_10_31436_iiumej_v11i1_51
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2010-06-22
PublicationDateYYYYMMDD 2010-06-22
PublicationDate_xml – month: 06
  year: 2010
  text: 2010-06-22
  day: 22
PublicationDecade 2010
PublicationTitle IIUM engineering journal
PublicationYear 2010
Publisher IIUM Press, International Islamic University Malaysia
Publisher_xml – name: IIUM Press, International Islamic University Malaysia
SSID ssib026970803
ssj0001595987
Score 1.753491
Snippet Based on the ZeroX algorithm, a fast and efficient crosstalk-free time- domain algorithm called the Fast ZeroX or shortly FastZ_X algorithm is proposed for...
SourceID doaj
unpaywall
crossref
SourceType Open Website
Open Access Repository
Enrichment Source
Index Database
StartPage 28
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NS8NAEF2kF_UgfmL9Yg9eFGKzyW6SPdaSfmibSJti8RJ2NxuolCpSFf-9s0ks9WIvXsOGDS-Tmfc2wxuELgV8P9oDkSNyGViUK2lxyZTl5VpmAQiyQBmhOIi87pjeTdhkZdSX6Qkr7YFL4BqcKWVOLjMKzNcRnpAiDxxhK06Ehmgz2dcO-IqYgkhyPO7b1dil8rSFccaLaXlQ4YhpoZuU_yxd4AteYzqFRPB880HIlNww8qtGFVb-22jzff4qvj7FbLZSf9q7aKcijrhZPvAe2tDzfbS9Yid4gOJ2c5Tgp3AYT3Cz34mHvaQ7wCDzsDE_7kUd3Itw_JAYCwQ8GPeT3ihpdkJc2OK24igKi44SHIXJYzy8Hx2icTtMWl2rGphgKScgC8hsPlU5VcZjXnPqZz5ADpKG2rmduyxzuAIkhOYCKrNWTPs-0L-AcU2orz3bPUK1-ctcHyMMWBPlajMARtJMqiAHaqhMCw1wBNeRddT4gShVlZu4GWoxS0FVFKCmJahpAWrKSB1dLe94LZ00_lh7a1BfrjMe2MUFiIy0iox0XWTU0fXyna3d8eQ_djxFW2VzgWc5zhmqLd7e9TlwloW8KMLzGzjv4Ao
  priority: 102
  providerName: Directory of Open Access Journals
Title FAST ZEROX ALGORITHM FOR ROUTING IN OPTICAL MULTISTAGE INTERCONNECTION NETWORKS
URI https://journals.iium.edu.my/ejournal/index.php/iiumej/article/download/51/25
https://doaj.org/article/95cc5230d49742a6abaf82a0c91ae787
UnpaywallVersion publishedVersion
Volume 11
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 2289-7860
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001595987
  issn: 1511-788X
  databaseCode: KQ8
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVAON
  databaseName: Open Access资源_DOAJ
  customDbUrl:
  eissn: 2289-7860
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001595987
  issn: 1511-788X
  databaseCode: DOA
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lj9MwELaW7gH2wHtFeax84AJSHk5iJzmGVfqAbbJqU1G4RLbjoEI3XS0taPn1jJ20WjiAkLhFzuQ149jf50y-Qeglh_dHMSA5vBaRFcRSWLGg0mK1ElUEhCySmihOMjaaB28XdHGAJrt_YToPfrWXy-2FWa-4uHZU1-oYBUEtG-Ho3eqz07nXqbSy_JpXDiWOR2-hQ0YBmvfQ4Tw7Tz4YzVRCdObcQhebA5IB28xtP1v6ABlYd0L7GyFLYlPyyzRl1PyP0O1tc8mvv_PV6sYUNLiHmt3Nt5knX-ztRtjyx2-6jv_t6e6jux1YxUlr8AAdqOYhOrohYfgI5YNkVuCP6TRf4ORsmE_HxWiCgVpiLbg8zoZ4nOH8vNCyC3gyPyvGsyIZpthI8Z7mWZaaLBacpcX7fPpu9hjNB2lxOrK6Ig2W9CKygdE0DGQdSK1rr-IgrEIIM9CowK3d2qeVF0tAHFzFHNCAklSFIUDOiMaKBKFirn-Mes26UU8QBpZOpK900RkRVEJGNcBRqdN2AJf4nugjZxeTUnYK5rqQxqoEJmOiWLaOK00US0r66NX-iMtWveMPtm90mPd2WnfbNKyvPpVdJMqYSqnX0asAeJjHGRe8jjzuyphwBWNfH73ed5K_XvHpvxg_Q3faxAVmed5z1NtcbdULwEMbcWLWEU66vv4TEyAJaw
linkProvider Unpaywall
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lj9MwEB4t3QPsgTeiy0M-cAEpDydxHsewSh-wTVZtKgqXyHYcVLabrpYWtPx6xklaLRxASNwiZ_KacezvcybfALzi-P4oH0kOr0RoeJEURiSYNPxKiTJEQhZKTRQnqT-ae-8WbHEAk92_MJ0Hv5rL5faiWa-4uLZU12o1CoJaNsLSu9UXq3OvVWpl-TUvLUYth92CQ58hNO_B4Tw9iz82mqmU6sy5hS42hyQDt327_WzpImTwuxOa3yhdUpPRX6apRs3_CG5v60t-_Z2vVjemoME9qHc332aenJvbjTDlj990Hf_b092Hux1YJXFr8AAOVP0Qjm5IGD6CbBDPcvIpmWYLEp8Os-k4H00IUkuiBZfH6ZCMU5Kd5Vp2gUzmp_l4lsfDhDRSvCdZmiZNFgtJk_xDNn0_ewzzQZKfjIyuSIMhnZBucDQNPFl5Uuvaq8gLygDDjDTKsyu7clnpRBIRB1cRRzSgJFNBgJAzZJGiXqB8230CvXpdq6dAkKVT6SpddEZ4pZBhhXBU6rQdxCWuI_pg7WJSyE7BXBfSWBXIZJooFq3jiiaKBaN9eL0_4rJV7_iD7Vsd5r2d1t1uGtZXn4suEkXEpNTr6KWHPMzhPhe8Ch1uy4hyhWNfH97sO8lfr3j8L8bP4E6buOAbjvMcepurrXqBeGgjXna9_CfgWgh2
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=FAST+ZEROX+ALGORITHM+FOR+ROUTING+IN+OPTICAL+MULTISTAGE+INTERCONNECTION+NETWORKS&rft.jtitle=IIUM+engineering+journal&rft.au=T.+D.+Shahida&rft.au=M.+Othman&rft.au=M.+K.+Abdullah&rft.date=2010-06-22&rft.pub=IIUM+Press%2C+International+Islamic+University+Malaysia&rft.issn=1511-788X&rft.eissn=2289-7860&rft.volume=11&rft.issue=1&rft_id=info:doi/10.31436%2Fiiumej.v11i1.51&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_95cc5230d49742a6abaf82a0c91ae787
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1511-788X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1511-788X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1511-788X&client=summon