增强量子通信:一种公平和有限的纠缠网络资源分配方法

IF 7.9 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Li Ren;Zhong-Rui Huang;Hong Lai;Lin-Chun Wan
{"title":"增强量子通信:一种公平和有限的纠缠网络资源分配方法","authors":"Li Ren;Zhong-Rui Huang;Hong Lai;Lin-Chun Wan","doi":"10.1109/TNSE.2025.3551425","DOIUrl":null,"url":null,"abstract":"Quantum entanglement networks has ushered in a new era of communication, with the core task of generating long-distance quantum entanglement being crucial for a multitude of quantum applications. Although current research is primarily focused on establishing long-distance entanglement across various network topologies, there is still a lack of attention to the variability of communication requests within quantum networks. This paper introduces the Fair and Restricted Resource Allocation Algorithm (FARA), designed to meet the business-driven resource allocation requirements within quantum networks. This algorithm prioritizes the demands and urgency of requests to establish a fairer response mechanism, leading to an enhanced user experience. We refine the strategy for allocating network resources to maximize their use during multiple concurrent requests and to improve the success rate of business. Simulation results demonstrate that our proposed scheme improves the business success rate by 6.35% to 24.58% and user satisfaction by 0.922 to 4.533 points compared to the Q-CAST algorithm. Additionally, resource wastage is reduced by 473 to 800 units. These enhancements indicate that our research provides effective strategies for business-driven optimization in quantum networks and makes a positive contribution to the development of entanglement networks towards more practical and efficient applications.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2654-2665"},"PeriodicalIF":7.9000,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhancing Quantum Communication: A Fair and Restricted Resource Allocation Approach for Entanglement Networks\",\"authors\":\"Li Ren;Zhong-Rui Huang;Hong Lai;Lin-Chun Wan\",\"doi\":\"10.1109/TNSE.2025.3551425\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quantum entanglement networks has ushered in a new era of communication, with the core task of generating long-distance quantum entanglement being crucial for a multitude of quantum applications. Although current research is primarily focused on establishing long-distance entanglement across various network topologies, there is still a lack of attention to the variability of communication requests within quantum networks. This paper introduces the Fair and Restricted Resource Allocation Algorithm (FARA), designed to meet the business-driven resource allocation requirements within quantum networks. This algorithm prioritizes the demands and urgency of requests to establish a fairer response mechanism, leading to an enhanced user experience. We refine the strategy for allocating network resources to maximize their use during multiple concurrent requests and to improve the success rate of business. Simulation results demonstrate that our proposed scheme improves the business success rate by 6.35% to 24.58% and user satisfaction by 0.922 to 4.533 points compared to the Q-CAST algorithm. Additionally, resource wastage is reduced by 473 to 800 units. These enhancements indicate that our research provides effective strategies for business-driven optimization in quantum networks and makes a positive contribution to the development of entanglement networks towards more practical and efficient applications.\",\"PeriodicalId\":54229,\"journal\":{\"name\":\"IEEE Transactions on Network Science and Engineering\",\"volume\":\"12 4\",\"pages\":\"2654-2665\"},\"PeriodicalIF\":7.9000,\"publicationDate\":\"2025-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10925831/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10925831/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

量子纠缠网络开创了一个新的通信时代,其核心任务是产生长距离量子纠缠,这对众多量子应用至关重要。虽然目前的研究主要集中在建立跨各种网络拓扑的长距离纠缠,但仍然缺乏对量子网络中通信请求的可变性的关注。本文介绍了公平与受限资源分配算法(FARA),旨在满足量子网络中业务驱动的资源分配需求。该算法对请求的需求和紧迫性进行优先排序,建立更公平的响应机制,从而增强用户体验。我们改进了分配网络资源的策略,以便在多个并发请求期间最大限度地利用网络资源,并提高业务成功率。仿真结果表明,与Q-CAST算法相比,我们提出的方案将业务成功率提高了6.35% ~ 24.58%,用户满意度提高了0.922 ~ 4.533分。此外,资源浪费减少了473到800个单位。这些改进表明,我们的研究为业务驱动的量子网络优化提供了有效的策略,并为纠缠网络向更实际、更高效的应用方向发展做出了积极的贡献。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Enhancing Quantum Communication: A Fair and Restricted Resource Allocation Approach for Entanglement Networks
Quantum entanglement networks has ushered in a new era of communication, with the core task of generating long-distance quantum entanglement being crucial for a multitude of quantum applications. Although current research is primarily focused on establishing long-distance entanglement across various network topologies, there is still a lack of attention to the variability of communication requests within quantum networks. This paper introduces the Fair and Restricted Resource Allocation Algorithm (FARA), designed to meet the business-driven resource allocation requirements within quantum networks. This algorithm prioritizes the demands and urgency of requests to establish a fairer response mechanism, leading to an enhanced user experience. We refine the strategy for allocating network resources to maximize their use during multiple concurrent requests and to improve the success rate of business. Simulation results demonstrate that our proposed scheme improves the business success rate by 6.35% to 24.58% and user satisfaction by 0.922 to 4.533 points compared to the Q-CAST algorithm. Additionally, resource wastage is reduced by 473 to 800 units. These enhancements indicate that our research provides effective strategies for business-driven optimization in quantum networks and makes a positive contribution to the development of entanglement networks towards more practical and efficient applications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.
×
引用
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学术官方微信