%% You should probably cite draft-peng-detnet-packet-timeslot-mechanism-09 instead of this revision.
@techreport{peng-detnet-packet-timeslot-mechanism-05,
    number =    {draft-peng-detnet-packet-timeslot-mechanism-05},
    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/05/},
    author =    {Shaofu Peng and Peng Liu and Kashinath Basu and Aihua Liu and Dong Yang and Guoyu Peng},
    title =     {{Timeslot Queueing and Forwarding Mechanism}},
    pagetotal = 47,
    year =      ,
    month =     ,
    day =       ,
    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 dependent on the used queueing mechanism. This document further describes a generic time division multiplexing scheme in IP/MPLS networks, which we call timeslot queueing and forwarding (TQF) mechanism. It aims to bring timeslot resources to layer-3, to make it easier for the control plane to calculate the delay performance based on the timeslot resources, and also make it easier for the data plane to create more flexible timeslot mapping. The functions of TQF can better meet large scaling requirements.},
}