Enforceable quality of service guarantees for bursty traffic streams
Edward W. Knightly · 2002
Providing statistical quality-of-service guarantees introduces conflicting requirements for both deterministic traffic models to isolate and police users and statistical multiplexing to efficiently utilize and share network resources. We address this issue by introducing two schemes for providing statistical services to deterministically policed sources: (1) adversarial mode resource allocation in which we bound the stochastic envelopes of policed streams and provide a statistical service for adversarial or worst case sources and (2) non-adversarial mode allocation in which we approximate the stochastic envelopes of policed, but non-worst-case streams in order to exploit a further statistical multiplexing gain in the typical case. Our key technique is to study the problem within the domain of deterministic and stochastic traffic envelopes, which allows us to explicitly consider sources with rate variations over multiple time scales, obtain results for any deterministic traffic model, and apply accurate admission control tests for buffered priority schedulers. We evaluate the scheme's performance with experiments using traces of compressed video and show that substantial statistical multiplexing gains are achieved.