{"title":"Unicast, multicast, and broadcast in enhanced Fibonacci cubes","authors":"Haifeng Qian, Jie Wu","doi":"10.1109/ICCCN.1995.540114","DOIUrl":null,"url":null,"abstract":"The enhanced Fibonacci cube (EFC) is defined based on the sequence F/sub n/=2F/sub n-2/+2F/sub n-4/. It contains the Fibonacci cube as a subgraph and maintains virtually all the desirable properties of the Fibonacci cube, and it also possesses properties such as the Hamiltonian property that the Fibonacci cube does not have. In this paper, we study data routing, namely, unicast, multicast and broadcast in the enhanced Fibonacci cube. The time and traffic steps are used to measure the efficiency of the routing algorithms. The unicast algorithm, which uses a Hamming distance path for any two nodes in EFC, is time and traffic optimal. The broadcast algorithm which employs the enhanced Fibonacci tree is traffic optimal and near time optimal. Two heuristic multicast algorithms are proposed which are based on an enhanced Fibonacci tree and a Hamiltonian cycle, respectively.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.1995.540114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
The enhanced Fibonacci cube (EFC) is defined based on the sequence F/sub n/=2F/sub n-2/+2F/sub n-4/. It contains the Fibonacci cube as a subgraph and maintains virtually all the desirable properties of the Fibonacci cube, and it also possesses properties such as the Hamiltonian property that the Fibonacci cube does not have. In this paper, we study data routing, namely, unicast, multicast and broadcast in the enhanced Fibonacci cube. The time and traffic steps are used to measure the efficiency of the routing algorithms. The unicast algorithm, which uses a Hamming distance path for any two nodes in EFC, is time and traffic optimal. The broadcast algorithm which employs the enhanced Fibonacci tree is traffic optimal and near time optimal. Two heuristic multicast algorithms are proposed which are based on an enhanced Fibonacci tree and a Hamiltonian cycle, respectively.