Resource allocation for multimedia traffic flows using a burstiness curve envelope

Resource allocation is required to guarantee the quality-of-service requirements for networks with a bounded delay service. This study presents a new traffic envelope based on the burstiness curve to capture the traffic characteristics of a variable bit rate data stream. A simple and efficient call admission control algorithm for rate-controlled Earliest Deadline First schedules is developed based on this traffic characterization by employing the closed-form formula and considering the local quality-of-service allocation policy. Clearly, the novel approach is as simple as the leaky bucket model. To evaluate the scheme, trace-driven simulation experiments are performed with a set of 10 minutes long MPEG-compressed video traces, indicating that the novel approach is sufficiently accurate to guarantee end-to-end quality of service requirement for end-users, and to substantially outperform alternate schemes.