Unicast, multicast, and broadcast in enhanced Fibonacci cubes

Haifeng Qian, Jie Wu
{"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.
单播,多播和广播在增强的斐波那契立方体
基于F/sub n/=2F/sub n-2/+2F/sub n-4/的序列定义了增强Fibonacci立方(EFC)。它包含斐波那契立方体作为子图,并且几乎维护斐波那契立方体的所有理想属性,并且它还拥有斐波那契立方体不具备的哈密顿属性。本文研究了增强型斐波那契多维数据集中的数据路由,即单播、组播和广播。时间步长和流量步长用来衡量路由算法的效率。单播算法对EFC中任意两个节点使用汉明距离路径,在时间和流量上都是最优的。采用增强斐波那契树的广播算法具有流量最优和近时间最优的特点。提出了两种启发式组播算法,分别基于增强的斐波那契树和哈密顿循环。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书