检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:凌雪芸 鲍兴川 江凇 王颖[1] LING Xueyun;BAO Xingchuan;JIANG Song;WANG Ying(State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Haidian District,Beijing 100876,China;China Electric Power Research Institute,Nanjing 210003,Jiangsu Province,China;Information and Communication Branch,State Grid Jiangsu Electric Power Co.,Ltd.,Nanjing 210000,Jiangsu Province,China)
机构地区:[1]北京邮电大学网络与交换技术全国重点实验室,北京市海淀区100876 [2]中国电力科学研究院有限公司,江苏省南京市210003 [3]国网江苏省电力有限公司信息通信分公司,江苏省南京市210000
出 处:《电力信息与通信技术》2025年第3期55-63,共9页Electric Power Information and Communication Technology
基 金:国家电网公司总部科技项目“面向新型电力系统跨域分层算力网络的协同调度关键技术研究及应用(5700-202318269A-1-1-ZN)”。
摘 要:电力通信业务特别是新型算力业务对确定性承载的需求日益增长,而确定性网络(deterministic networking,DetNet)提供了有保障的传输服务,但如何路由和调度流量以保证端到端时延的有界仍是一个重要的研究方向。文章探讨了基于分段路由(segment routing,SR)技术的联合路由和调度方法,旨在解决在确定性网络中如何实现有界时延和较低丢包率的问题。通过仿真实验发现,该方法相比传统方法的循环指定排队和转发(cycle specified queuing and forwarding,CSQF),能够显著降低网络丢包率,并提供更低的延迟,为电力通信业务提供了可靠的传输服务。The demand for deterministic bearer in power communication services is growing increasingly,especially in new computing power services.Deterministic networking(DetNet)provides guaranteed transmission services.However,ensuring bounded end-to-end latency remains an important research direction.This paper explores a joint routing and scheduling method based on segment routing(SR)technology to address the challenge of achieving bounded latency and lower packet loss rates in deterministic networks.Through simulation experiments,it is found that this method,compared to traditional methods like CSQF,significantly reduces network packet loss rates and provides lower latency,thereby offering reliable transmission services for power communication businesses.
分 类 号:TN915.853[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.217.35.130