LP-Star: Embedding Longest Paths into Star Networks With Large-Scale Missing Edges Under an Emerging Assessment Model

IF 5.1 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Emerging Topics in Computing Pub Date : 2024-04-16 DOI:10.1109/TETC.2024.3387119
Xiao-Yan Li;Jou-Ming Chang
{"title":"LP-Star: Embedding Longest Paths into Star Networks With Large-Scale Missing Edges Under an Emerging Assessment Model","authors":"Xiao-Yan Li;Jou-Ming Chang","doi":"10.1109/TETC.2024.3387119","DOIUrl":null,"url":null,"abstract":"Star networks play an essential role in designing parallel and distributed systems. With the massive growth of faulty edges and the widespread applications of the longest paths and cycles, it is crucial to embed the longest fault-free paths and cycles in edge-faulty networks. However, the traditional fault model allows a concentrated distribution of faulty edges and thus can only tolerate faults that depend on the minimum degree of the network vertices. This article introduces an improved fault model called the partitioned fault model, which is an emerging assessment model for fault tolerance. Based on this model, we first explore the longest fault-free paths and cycles by proving the edge fault-tolerant Hamiltonian laceability, edge fault-tolerant strongly Hamiltonian laceability, and edge fault-tolerant Hamiltonicity in the <inline-formula><tex-math>$n$</tex-math></inline-formula>-dimensional star network <inline-formula><tex-math>$S_{n}$</tex-math></inline-formula>. Furthermore, based on the theoretical proof, we give an <inline-formula><tex-math>$O(nN)$</tex-math></inline-formula> algorithm to construct the longest fault-free paths in star networks based on the partitioned fault model, where <inline-formula><tex-math>$N$</tex-math></inline-formula> is the number of vertices in <inline-formula><tex-math>$S_{n}$</tex-math></inline-formula>. We also make comparisons to show that our result of edge fault tolerance has exponentially improved other known results.","PeriodicalId":13156,"journal":{"name":"IEEE Transactions on Emerging Topics in Computing","volume":"13 1","pages":"147-161"},"PeriodicalIF":5.1000,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10502266/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Star networks play an essential role in designing parallel and distributed systems. With the massive growth of faulty edges and the widespread applications of the longest paths and cycles, it is crucial to embed the longest fault-free paths and cycles in edge-faulty networks. However, the traditional fault model allows a concentrated distribution of faulty edges and thus can only tolerate faults that depend on the minimum degree of the network vertices. This article introduces an improved fault model called the partitioned fault model, which is an emerging assessment model for fault tolerance. Based on this model, we first explore the longest fault-free paths and cycles by proving the edge fault-tolerant Hamiltonian laceability, edge fault-tolerant strongly Hamiltonian laceability, and edge fault-tolerant Hamiltonicity in the $n$-dimensional star network $S_{n}$. Furthermore, based on the theoretical proof, we give an $O(nN)$ algorithm to construct the longest fault-free paths in star networks based on the partitioned fault model, where $N$ is the number of vertices in $S_{n}$. We also make comparisons to show that our result of edge fault tolerance has exponentially improved other known results.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
LP-Star:在新兴评估模型下将最长路径嵌入具有大规模缺边的星形网络
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Emerging Topics in Computing
IEEE Transactions on Emerging Topics in Computing Computer Science-Computer Science (miscellaneous)
CiteScore
12.10
自引率
5.10%
发文量
113
期刊介绍: IEEE Transactions on Emerging Topics in Computing publishes papers on emerging aspects of computer science, computing technology, and computing applications not currently covered by other IEEE Computer Society Transactions. Some examples of emerging topics in computing include: IT for Green, Synthetic and organic computing structures and systems, Advanced analytics, Social/occupational computing, Location-based/client computer systems, Morphic computer design, Electronic game systems, & Health-care IT.
期刊最新文献
Front Cover Table of Contents IEEE Transactions on Emerging Topics in Computing Publication Information Editorial Special Section on Emerging Edge AI for Human-in-the-Loop Cyber Physical Systems 2024 Reviewers List*
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1