Scalable Flow Isolation With Work Conserving Stateless Core Fair Queuing for Deterministic Networking
We consider guaranteeing end-to-end (E2E) latency bounds to flows in a network. It is desirable that flows are isolated from other flows. The bursts from other flows or the network utilization level should not affect a flow’s latency bound. The fair queuing technique, which includes Packe...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10261190/ |
| _version_ | 1797668063432146944 |
|---|---|
| author | Jinoo Joung Juhyeok Kwon Jeong-Dong Ryoo Taesik Cheung |
| author_facet | Jinoo Joung Juhyeok Kwon Jeong-Dong Ryoo Taesik Cheung |
| author_sort | Jinoo Joung |
| collection | DOAJ |
| description | We consider guaranteeing end-to-end (E2E) latency bounds to flows in a network. It is desirable that flows are isolated from other flows. The bursts from other flows or the network utilization level should not affect a flow’s latency bound. The fair queuing technique, which includes Packetized Generalized Processor Sharing (PGPS) and Virtual Clock (VC), is based on the concept of ideal packet service completion time called the Finish Time (FT). The fair queuing is known to provide the near perfect flow isolation but has to maintain the flow states. Alternative schemes were suggested, in which the entrance node in a network generates FT for a packet and records it in the packet with other necessary information. Subsequent nodes, based on these records, decide the service eligibility and service order of the packets. A packet is served only when it is eligible, thus the system is non-work conserving. In this paper, a simpler framework for deriving such FTs in core nodes without flow state is presented, in which initial FT is updated by adding a delay factor per node, which is a function of parameters of nodes and flow. The proposed scheduler is work conserving and has the property that, for a certain choice of the delay factor, the expression for E2E latency bound can be found. This E2E latency bound function is the same as that of a network with stateful fair queuing schedulers in all the nodes. Moreover, utilizing the fact that the service order of packets passing through the same path can be unaltered in the middle of the path, we also present a FIFO-based architecture whose performance is similar to that of a priority queue-based architecture. The extensive simulations prove that the proposed framework shows an ideal flow isolation performance over a wide range of delay factor values, with superior scalability. |
| first_indexed | 2024-03-11T20:22:37Z |
| format | Article |
| id | doaj.art-c225040cb79b4922b84e45f1618b5941 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-03-11T20:22:37Z |
| publishDate | 2023-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-c225040cb79b4922b84e45f1618b59412023-10-02T23:01:31ZengIEEEIEEE Access2169-35362023-01-011110522510524710.1109/ACCESS.2023.331847910261190Scalable Flow Isolation With Work Conserving Stateless Core Fair Queuing for Deterministic NetworkingJinoo Joung0https://orcid.org/0000-0003-3053-9691Juhyeok Kwon1https://orcid.org/0000-0001-7642-4422Jeong-Dong Ryoo2https://orcid.org/0000-0002-6064-9157Taesik Cheung3Department of Human-Centered Artificial Intelligence, Sangmyung University, Seoul, South KoreaDepartment of Artificial Intelligence and Informatics, Sangmyung University, Seoul, South KoreaElectronics and Telecommunications Research Institute (ETRI), Daejeon, South KoreaElectronics and Telecommunications Research Institute (ETRI), Daejeon, South KoreaWe consider guaranteeing end-to-end (E2E) latency bounds to flows in a network. It is desirable that flows are isolated from other flows. The bursts from other flows or the network utilization level should not affect a flow’s latency bound. The fair queuing technique, which includes Packetized Generalized Processor Sharing (PGPS) and Virtual Clock (VC), is based on the concept of ideal packet service completion time called the Finish Time (FT). The fair queuing is known to provide the near perfect flow isolation but has to maintain the flow states. Alternative schemes were suggested, in which the entrance node in a network generates FT for a packet and records it in the packet with other necessary information. Subsequent nodes, based on these records, decide the service eligibility and service order of the packets. A packet is served only when it is eligible, thus the system is non-work conserving. In this paper, a simpler framework for deriving such FTs in core nodes without flow state is presented, in which initial FT is updated by adding a delay factor per node, which is a function of parameters of nodes and flow. The proposed scheduler is work conserving and has the property that, for a certain choice of the delay factor, the expression for E2E latency bound can be found. This E2E latency bound function is the same as that of a network with stateful fair queuing schedulers in all the nodes. Moreover, utilizing the fact that the service order of packets passing through the same path can be unaltered in the middle of the path, we also present a FIFO-based architecture whose performance is similar to that of a priority queue-based architecture. The extensive simulations prove that the proposed framework shows an ideal flow isolation performance over a wide range of delay factor values, with superior scalability.https://ieeexplore.ieee.org/document/10261190/Finish timedeterministic networkinglatency boundschedulerfair queuing |
| spellingShingle | Jinoo Joung Juhyeok Kwon Jeong-Dong Ryoo Taesik Cheung Scalable Flow Isolation With Work Conserving Stateless Core Fair Queuing for Deterministic Networking IEEE Access Finish time deterministic networking latency bound scheduler fair queuing |
| title | Scalable Flow Isolation With Work Conserving Stateless Core Fair Queuing for Deterministic Networking |
| title_full | Scalable Flow Isolation With Work Conserving Stateless Core Fair Queuing for Deterministic Networking |
| title_fullStr | Scalable Flow Isolation With Work Conserving Stateless Core Fair Queuing for Deterministic Networking |
| title_full_unstemmed | Scalable Flow Isolation With Work Conserving Stateless Core Fair Queuing for Deterministic Networking |
| title_short | Scalable Flow Isolation With Work Conserving Stateless Core Fair Queuing for Deterministic Networking |
| title_sort | scalable flow isolation with work conserving stateless core fair queuing for deterministic networking |
| topic | Finish time deterministic networking latency bound scheduler fair queuing |
| url | https://ieeexplore.ieee.org/document/10261190/ |
| work_keys_str_mv | AT jinoojoung scalableflowisolationwithworkconservingstatelesscorefairqueuingfordeterministicnetworking AT juhyeokkwon scalableflowisolationwithworkconservingstatelesscorefairqueuingfordeterministicnetworking AT jeongdongryoo scalableflowisolationwithworkconservingstatelesscorefairqueuingfordeterministicnetworking AT taesikcheung scalableflowisolationwithworkconservingstatelesscorefairqueuingfordeterministicnetworking |