Shaping of traffic streams through data spacing

A traffic shaping algorithm, based on suitable spacing of data units, is proposed and validated both theoretically and by simulation. It ensures a "tight" upper bound to the queue-length distribution at subsequent multiplexing stages, being essentially an effective-rate-enforcement mechanism in the asymptotic regime. It does not presume any stationarity, homogeneity or Markovian property of the input streams.