{"title":"超六元互联网络中一种新的单播路由算法","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":"{\"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}","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
A New Unicast Routing Algorithm for Hyper Hexa-Cell Interconnection Networks
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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
