Hironao Abe;Hideo Kawata;Yuhei Kawakami;Akifumi Tanase;Shinichi Yoshihara;Tomoaki Yoshida
{"title":"Proposal to Reduce Computation Time in TAS Rescheduling Scheme","authors":"Hironao Abe;Hideo Kawata;Yuhei Kawakami;Akifumi Tanase;Shinichi Yoshihara;Tomoaki Yoshida","doi":"10.23919/comex.2024XBL0067","DOIUrl":null,"url":null,"abstract":"IEEE802.1Qbv Time-Aware Shaper (TAS) has attracted attention as a technology to realize low-delay communication in various fields. Especially in industrial networks, the demand for low-latency communication between remote areas is increasing, and the realization of a service provider network (SPNW) using TAS is expected. We consider the scheduling scheme of TAS for SPNW. When the scheduling order cannot be controlled, as in SPNW, the bandwidth utilization efficiency is lower than when the scheduling order is ideal. To cope with such problems, we propose a rescheduling scheme focusing on the difference in scheduling difficulty. However, the increase in computational load due to rescheduling has not been discussed. In this paper, we consider a method to reduce the computation time of the rescheduling method.","PeriodicalId":54101,"journal":{"name":"IEICE Communications Express","volume":"13 8","pages":"343-346"},"PeriodicalIF":0.3000,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10554802","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEICE Communications Express","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10554802/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0
Abstract
IEEE802.1Qbv Time-Aware Shaper (TAS) has attracted attention as a technology to realize low-delay communication in various fields. Especially in industrial networks, the demand for low-latency communication between remote areas is increasing, and the realization of a service provider network (SPNW) using TAS is expected. We consider the scheduling scheme of TAS for SPNW. When the scheduling order cannot be controlled, as in SPNW, the bandwidth utilization efficiency is lower than when the scheduling order is ideal. To cope with such problems, we propose a rescheduling scheme focusing on the difference in scheduling difficulty. However, the increase in computational load due to rescheduling has not been discussed. In this paper, we consider a method to reduce the computation time of the rescheduling method.
IEEE802.1Qbv 时间感知整形器(TAS)作为一种实现低延迟通信的技术,在各个领域都备受关注。特别是在工业网络中,偏远地区之间对低延迟通信的需求日益增长,利用 TAS 实现服务提供商网络(SPNW)成为人们的期待。我们考虑了 SPNW 的 TAS 调度方案。在 SPNW 中,当调度顺序无法控制时,带宽利用效率会比调度顺序理想时低。为应对此类问题,我们提出了一种以调度难度差异为重点的重新调度方案。然而,由于重新调度而增加的计算负荷尚未得到讨论。在本文中,我们考虑了一种减少重新调度方法计算时间的方法。