Abstract
The key to the asynchronous traffic shaping (ATS) technology being standardized in IEEE 802.1 time sensitive network (TSN) task group (TG) is the theorem that a minimal interleaved regulator (IR), attached to a FIFO system does not increase delay upper bound while suppresses the burst accumulation. In this work it is observed that the FIFO system can be a network for flows that share same input/output ports and same queues of the network, and are treated with a scheduling scheme that guarantees the FIFO property within a queue. Based on this observation, a framework for delay bound guarantee is further proposed, in which the networks with flow aggregates (FAs) scheduling and minimal IRs per FA attached at the network edge are interconnected. The framework guarantees the end-to-end delay bound with reduced complexity, compared to the traditional flow-based approach. Numerical analysis shows that the framework yields smaller bound than both the flow-based frameworks such as the integrated services (IntServ) and the class-based ATS, at least in the networks with identical flows and symmetrical topology.
Highlights
ITU-T focus group on technologies for network 2030 (FG Net-2030) has declared that the network delay guarantee is one of the most important requirements for the 6G network [1]
We proposed a framework with flow aggregate (FA)-based scheduling in a network, and with minimal interleaved regulators (IRs) placed between the networks
We have shown that the framework can guarantee a smaller delay upper bound, than both the integrated services (IntServ) and the asynchronous traffic shaping (ATS) framework
Summary
ITU-T focus group on technologies for network 2030 (FG Net-2030) has declared that the network delay guarantee is one of the most important requirements for the 6G network [1]. The flow-based approaches such as the integrated services (IntServ) framework are known to provide the delay guarantee. The DiffServ framework does not provide a delay bound in a general topology network. It is proven that a minimal IR does not increase the delay upper bound of the bound of the attached FIFO system, such as the class-based FIFO system employed in ATS [5]. The current frameworks, IntServ, DiffServ, and ATS, have their own shortcomings to be employed employed in large scale multi-domain networks. A new framework is required, which is less complex than than IntServ and has better probabilistic performance than ATS. The delay bounds for IntServ, ATS, framework is analyzed with a symmetrical network topology. The delay bounds for IntServ, ATS, and the proposed framework are given.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
