Probabilistic QoS Guarantees over Switches and Multiplexers

摘要

We provide some probabilistic performance results over switches and multiplexers. In getting these results, we have adopted a probabilistic traffic characterization that we recently proposed. The analysis being presented assumes neither a scheduling policy employed in switches/multiplexers nor a statistical independence of input flows. We also provide some simulation results which show that the bounds we have obtained are tighter than the previously available similar bounds.