<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.peng-detnet-packet-timeslot-mechanism" target="https://datatracker.ietf.org/doc/html/draft-peng-detnet-packet-timeslot-mechanism-00">
   <front>
      <title>Generic Packet Timeslot Mechanism</title>
      <author initials="S." surname="Peng" fullname="Shaofu Peng">
         <organization>ZTE</organization>
      </author>
      <author initials="B." surname="Tan" fullname="Bin Tan">
         <organization>ZTE</organization>
      </author>
      <author initials="P." surname="Liu" fullname="Peng Liu">
         <organization>China Mobile</organization>
      </author>
      <date month="February" day="9" year="2023" />
      <abstract>
	 <t>   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.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-peng-detnet-packet-timeslot-mechanism-00" />
   
</reference>
