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.
KSP Keywords
Completion Time, Deterministic networking, End to End(E2E), Finish time, Generalized processor sharing, Isolation performance, Network utilization, Packet service, Priority queues, Service completion, Wide range
This work is distributed under the term of Creative Commons License (CCL)
(CC BY NC ND)
Copyright Policy
ETRI KSP Copyright Policy
The materials provided on this website are subject to copyrights owned by ETRI and protected by the Copyright Act. Any reproduction, modification, or distribution, in whole or in part, requires the prior explicit approval of ETRI. However, under Article 24.2 of the Copyright Act, the materials may be freely used provided the user complies with the following terms:
The materials to be used must have attached a Korea Open Government License (KOGL) Type 4 symbol, which is similar to CC-BY-NC-ND (Creative Commons Attribution Non-Commercial No Derivatives License). Users are free to use the materials only for non-commercial purposes, provided that original works are properly cited and that no alterations, modifications, or changes to such works is made. This website may contain materials for which ETRI does not hold full copyright or for which ETRI shares copyright in conjunction with other third parties. Without explicit permission, any use of such materials without KOGL indication is strictly prohibited and will constitute an infringement of the copyright of ETRI or of the relevant copyright holders.
J. Kim et. al, "Trends in Lightweight Kernel for Many core Based High-Performance Computing", Electronics and Telecommunications Trends. Vol. 32, No. 4, 2017, KOGL Type 4: Source Indication + Commercial Use Prohibition + Change Prohibition
J. Sim et.al, “the Fourth Industrial Revolution and ICT – IDX Strategy for leading the Fourth Industrial Revolution”, ETRI Insight, 2017, KOGL Type 4: Source Indication + Commercial Use Prohibition + Change Prohibition
If you have any questions or concerns about these terms of use, or if you would like to request permission to use any material on this website, please feel free to contact us
KOGL Type 4:(Source Indication + Commercial Use Prohibition+Change Prohibition)
Contact ETRI, Research Information Service Section
Privacy Policy
ETRI KSP Privacy Policy
ETRI does not collect personal information from external users who access our Knowledge Sharing Platform (KSP). Unathorized automated collection of researcher information from our platform without ETRI's consent is strictly prohibited.
[Researcher Information Disclosure] ETRI publicly shares specific researcher information related to research outcomes, including the researcher's name, department, work email, and work phone number.
※ ETRI does not share employee photographs with external users without the explicit consent of the researcher. If a researcher provides consent, their photograph may be displayed on the KSP.