Abstract
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 schedulers is developed based on this traffic characterization by employing the closedform 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 ten minutes long MPEG-compressed video traces, indicating that the novel approach is sufficiently accurate to guarantee endto- end quality of service requirement for end-users, and to substantially outperforming alternate schemes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
