%% You should probably cite draft-ietf-detnet-packet-timeslot-mechanism instead of this I-D.
@techreport{peng-detnet-packet-timeslot-mechanism-00,
    number =    {draft-peng-detnet-packet-timeslot-mechanism-00},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-peng-detnet-packet-timeslot-mechanism/00/},
    author =    {Shaofu Peng and Bin Tan and Peng Liu},
    title =     {{Generic Packet Timeslot Mechanism}},
    pagetotal = 16,
    year =      2023,
    month =     feb,
    day =       9,
    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. In this case, the service flow does not occupy a fixed timeslot, and the length of the timeslot is not fixed, but depends on the size of the packet. Statistical multiplexing has certain challenges and complexity in meeting deterministic QoS, and its delay performance is closely related to the used queueing mechanism. This document further describes a generic time division multiplexing scheme in IP/MPLS networks, which we call packet timeslot scheme. It aims to make the control plane easier to calculate the delay performance and more flexible to allocate deterministic resources, and make the data plane create more flexible timeslot mapping.},
}