A New Unicast Routing Algorithm for Hyper Hexa-Cell Interconnection Networks

Int. J. Inf. Syst. Soc. Chang. Pub Date : 2017-07-01 DOI:10.4018/IJISSC.2017070104

J. Al-Sadi

{"title":"A New Unicast Routing Algorithm for Hyper Hexa-Cell Interconnection Networks","authors":"J. Al-Sadi","doi":"10.4018/IJISSC.2017070104","DOIUrl":null,"url":null,"abstract":"TheHyperHexa-Celltopology;HHCforshort;isanewinterconnectionnetworktopologythathas manyattractivetopologicalpropertiescomparedtoothertraditionaltopologies.Therehavebeena numberofstudiesintheliteratureontheHHCtoexplorethepromisingtopologicalpropertiesofthis topology.Furthermore,otherstudiesextendthistopologybycombiningitwithOTIStechnologyto produceanewversioncalledOHHC.Wehavefoundthatthereisalakeofpresentinganypointto pointroutingalgorithmfortheHHC,althoughthereweresomeeffortsonbuildingroutingalgorithms fortheOHHC.Tocoverthisshortage,thispaperintroducesanewunicastroutingalgorithmforthe HHC.Thenewroutingalgorithmfor theHHCusesstore-and-forward techniquewhichallowsa messagetobetransmittedthroughapathfromthesourcenodetothedestinationnode.Inaddition topresentingtheroutingalgorithm,wepresentanexampletoexplorethealgorithmstepsandalso anenhancementontheroutingalgorithmtoapplyadaptivelyontheroutingbasedonparameterized criteria.Finally,wepresentatheoreticaltheoremtoprovethatthealgorithmroutesanymessage fromanysourcetoanydestinationviaanoptimalpath. KeywoRdS Hypercube, Interconnection Networks, Routing Algorithm, Topological Properties","PeriodicalId":371573,"journal":{"name":"Int. J. Inf. Syst. Soc. Chang.","volume":"635 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Inf. Syst. Soc. Chang.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJISSC.2017070104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

TheHyperHexa-Celltopology;HHCforshort;isanewinterconnectionnetworktopologythathas manyattractivetopologicalpropertiescomparedtoothertraditionaltopologies.Therehavebeena numberofstudiesintheliteratureontheHHCtoexplorethepromisingtopologicalpropertiesofthis topology.Furthermore,otherstudiesextendthistopologybycombiningitwithOTIStechnologyto produceanewversioncalledOHHC.Wehavefoundthatthereisalakeofpresentinganypointto pointroutingalgorithmfortheHHC,althoughthereweresomeeffortsonbuildingroutingalgorithms fortheOHHC.Tocoverthisshortage,thispaperintroducesanewunicastroutingalgorithmforthe HHC.Thenewroutingalgorithmfor theHHCusesstore-and-forward techniquewhichallowsa messagetobetransmittedthroughapathfromthesourcenodetothedestinationnode.Inaddition topresentingtheroutingalgorithm,wepresentanexampletoexplorethealgorithmstepsandalso anenhancementontheroutingalgorithmtoapplyadaptivelyontheroutingbasedonparameterized criteria.Finally,wepresentatheoreticaltheoremtoprovethatthealgorithmroutesanymessage fromanysourcetoanydestinationviaanoptimalpath. KeywoRdS Hypercube, Interconnection Networks, Routing Algorithm, Topological Properties

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

超六元互联网络中一种新的单播路由算法

TheHyperHexa-Celltopology;HHCforshort;isanewinterconnectionnetworktopologythathas manyattractivetopologicalpropertiescomparedtoothertraditionaltopologies。Therehavebeena numberofstudiesintheliteratureontheHHCtoexplorethepromisingtopologicalpropertiesofthis拓扑。Furthermore，otherstudiesextendthistopologybycombiningitwithOTIStechnologyto produceanewversioncalledOHHC。Wehavefoundthatthereisalakeofpresentinganypointto pointroutingalgorithmfortheHHC，althoughthereweresomeeffortsonbuildingroutingalgorithms fortheOHHC。Tocoverthisshortage，thispaperintroducesanewunicastroutingalgorithmforthe HHC。Thenewroutingalgorithmfor theHHCusesstore-and-forward techniquewhichallowsa messagetobetransmittedthroughapathfromthesourcenodetothedestinationnode。Inaddition topresentingtheroutingalgorithm，wepresentanexampletoexplorethealgorithmstepsandalso anenhancementontheroutingalgorithmtoapplyadaptivelyontheroutingbasedonparameterized标准。Finally，wepresentatheoreticaltheoremtoprovethatthealgorithmroutesanymessage fromanysourcetoanydestinationviaanoptimalpath。关键词:超立方体，互连网络，路由算法，拓扑性质

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Int. J. Inf. Syst. Soc. Chang.

自引率

0.00%

发文量