Providing Deterministic Guarantees For Bursty Traffic
  
               Hui Zhang and Domenico Ferrari

In this paper, we showed that it is possible to provide deterministic
delay bounds even when the sum of the peak rates of all the channels is greater
than the link speed. We show that, even for a simple discipline like FCFS,
a reasonable average utilization can be achieved for deterministic service 
when the burstiness of traffic is bounded.

For the traffic characterization (Xmin, Xave, I, Smax), it is important 
to notice that the burstiness of the traffic does not only depend on 
peak-average-rate-ratio, but also depends on the averaging interval. 

The result for FCFS only holds in a single node case and when none of the 
channels is sending  more packets than declared in the traffic specification. 
Thus, the result does not imply that more advanced service disciplines
are not necessary.