@techreport{ietf-detnet-packet-timeslot-mechanism-01,
    number =    {draft-ietf-detnet-packet-timeslot-mechanism-01},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-ietf-detnet-packet-timeslot-mechanism/01/},
    author =    {Shaofu Peng and Peng Liu and Kashinath Basu and Aihua Liu and Dong Yang and Guoyu Peng and Junfeng Zhao},
    title =     {{Timeslot Queueing and Forwarding Mechanism}},
    pagetotal = 52,
    year =      2026,
    month =     jun,
    day =       27,
    abstract =  {IP/MPLS networks use packet switching (with the feature store-and- forward) and are based on statistical multiplexing. Statistical multiplexing is essentially a variant of time division multiplexing, which refers to the asynchronous and dynamic allocation of link timeslot resources. Statistical multiplexing has certain challenges and complexity in meeting deterministic QoS. This document describes a generic time division multiplexing scheme for layer-3 in an IP/MPLS networks, called timeslot queueing and forwarding (TQF) mechanism. TQF is an enhancement based on TSN TAS and allows the data plane to create a flexible timeslot mapping based on available timeslot resources. It defines a cyclic period consisting of multiple timeslots where a flow is assigned to be transmitted within one or more dedicated timeslots. The objective of TQF is to better handle large scaling requirements.},
}