On-time Forwarding with Non-work Conserving Stateless Core Fair Queuing
draft-ryoo-detnet-nscore-02
| Document | Type |
Replaced Internet-Draft
(detnet WG)
Expired & archived
|
|
|---|---|---|---|
| Authors | Yeoncheol Ryoo , Jinoo Joung | ||
| Last updated | 2025-12-05 (Latest revision 2025-10-16) | ||
| Replaced by | draft-ietf-detnet-nscore | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | Candidate for WG Adoption | |
| Document shepherd | (None) | ||
| IESG | IESG state | Replaced by draft-ietf-detnet-nscore | |
| Consensus boilerplate | Unknown | ||
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This document specifies the framework and operational procedure for deterministic networking that guarantees maximum and minimum end-to- end latency bounds to flows. The solution has non-periodic, asynchronous, flow-level, non-work conserving, on-time, and rate- based functional characteristics, according to the taxonomy suggested by [draft-ietf-detnet-dataplane-taxonomy-03]. The packets are stored in the queue in ascending order of the ideal service start time, called Eligible Time (ET), and the ideal service completion time, called Finish Time (FT). The queued packets were forwarded between ET and FT in a non-work conserving manner. The ET and FT are calculated at the entrance node according to the packet size and rate of the flow. All subsequent core nodes are stateless and asynchronously compute ET and FT based on metadata received via packet headers. This mechanism is called non-work-preserving stateless fair queuing, which guarantees both E2E latency upper and lower bounds.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)