TAS Scheduling With Grouping Flows
IEEE802.1Qbv (Time-aware Shaper: TAS) in IEEE802.1-Time-Sensitive Networking (TSN) has recently been applied within user networks for realizing factory automation and remote control. As mass customization matures, TAS is expected to extend its coverage to not only user networks but also wide-area ne...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10836675/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832590317287636992 |
|---|---|
| author | Hironao Abe Yuhei Kawakami Hideo Kawata Takashi Nakanishi Tomoaki Yoshida |
| author_facet | Hironao Abe Yuhei Kawakami Hideo Kawata Takashi Nakanishi Tomoaki Yoshida |
| author_sort | Hironao Abe |
| collection | DOAJ |
| description | IEEE802.1Qbv (Time-aware Shaper: TAS) in IEEE802.1-Time-Sensitive Networking (TSN) has recently been applied within user networks for realizing factory automation and remote control. As mass customization matures, TAS is expected to extend its coverage to not only user networks but also wide-area networks to realize ultra-low-latency (ULL) communication between remote locations. TAS is TSN technology expected to be used for long-distance communications because it can guarantee maximum latency limits. However, designing a TAS schedule is an NP-hard problem, which becomes more difficult as the amount of delay guarantee flow increases. This paper proposes a method to reduce the computational complexity of TAS schedules for the problem that the computation time increases exponentially as the amount of scheduled traffic (ST) flows increases. This problem has serious impacts on TAS scheduling in wide-area networks. In the proposed method, flows with the same characteristics are grouped to reduce the number of flows to be input into the scheduling calculation. This suppresses computation infeasibility in the NP-hard problem and improves the schedulability of ST flows. This paper contributes to realizing TAS over wide-area networks, which are currently underutilized. |
| format | Article |
| id | doaj-art-38dd402ef290462fb233aa86aca5b729 |
| institution | Kabale University |
| issn | 2169-3536 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj-art-38dd402ef290462fb233aa86aca5b7292025-01-24T00:01:53ZengIEEEIEEE Access2169-35362025-01-0113119181192910.1109/ACCESS.2025.352839610836675TAS Scheduling With Grouping FlowsHironao Abe0https://orcid.org/0009-0003-7804-5938Yuhei Kawakami1Hideo Kawata2Takashi Nakanishi3Tomoaki Yoshida4https://orcid.org/0000-0002-1673-5293NTT Access Network Service Systems Laboratories, Tsukuba, JapanNTT West, Osaka, JapanNTT Access Network Service Systems Laboratories, Tsukuba, JapanNTT Access Network Service Systems Laboratories, Tsukuba, JapanNTT Access Network Service Systems Laboratories, Tsukuba, JapanIEEE802.1Qbv (Time-aware Shaper: TAS) in IEEE802.1-Time-Sensitive Networking (TSN) has recently been applied within user networks for realizing factory automation and remote control. As mass customization matures, TAS is expected to extend its coverage to not only user networks but also wide-area networks to realize ultra-low-latency (ULL) communication between remote locations. TAS is TSN technology expected to be used for long-distance communications because it can guarantee maximum latency limits. However, designing a TAS schedule is an NP-hard problem, which becomes more difficult as the amount of delay guarantee flow increases. This paper proposes a method to reduce the computational complexity of TAS schedules for the problem that the computation time increases exponentially as the amount of scheduled traffic (ST) flows increases. This problem has serious impacts on TAS scheduling in wide-area networks. In the proposed method, flows with the same characteristics are grouped to reduce the number of flows to be input into the scheduling calculation. This suppresses computation infeasibility in the NP-hard problem and improves the schedulability of ST flows. This paper contributes to realizing TAS over wide-area networks, which are currently underutilized.https://ieeexplore.ieee.org/document/10836675/Time-sensitive networkingtime-aware shaperdelayjitterservice provider networks |
| spellingShingle | Hironao Abe Yuhei Kawakami Hideo Kawata Takashi Nakanishi Tomoaki Yoshida TAS Scheduling With Grouping Flows IEEE Access Time-sensitive networking time-aware shaper delay jitter service provider networks |
| title | TAS Scheduling With Grouping Flows |
| title_full | TAS Scheduling With Grouping Flows |
| title_fullStr | TAS Scheduling With Grouping Flows |
| title_full_unstemmed | TAS Scheduling With Grouping Flows |
| title_short | TAS Scheduling With Grouping Flows |
| title_sort | tas scheduling with grouping flows |
| topic | Time-sensitive networking time-aware shaper delay jitter service provider networks |
| url | https://ieeexplore.ieee.org/document/10836675/ |
| work_keys_str_mv | AT hironaoabe tasschedulingwithgroupingflows AT yuheikawakami tasschedulingwithgroupingflows AT hideokawata tasschedulingwithgroupingflows AT takashinakanishi tasschedulingwithgroupingflows AT tomoakiyoshida tasschedulingwithgroupingflows |