Statistical service assurances for traffic scheduling algorithms

Network services for the most demanding advanced networked applications whi ch require absolute, per-flow service assurances ran be deterministic or st atistical. By exploiting statistical properties of traffic, statistical ass urances can extract more capacity from a network than deterministic assuran ces, In this paper we consider statistical service assurances for traffic s cheduling algorithms. We present functions, so-called effective envelopes, which are, with high certainty, upper bounds of multiplexed traffic, Effect ive envelopes can be used to obtain bounds on the amount of traffic on a li nk that can be provisioned with statistical service assurances, We show tha t our bounds can be applied to a variety of traffic scheduling algorithms. In fact, one can reuse existing admission control functions for scheduling algorithms with deterministic assurances. We present numerical examples whi ch compare the number of flows with statistical assurances that can be admi tted with our effective envelope approach to those achieved with existing m ethods.