Close category search window
 

Adaptive bandwidth control for efficient aggregate QoS provisioning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Siripongwutikorn, P. ; Telecommun. Program, Pittsburgh Univ., PA, USA ; Banerjee, S. ; Tipper, D.

The paper proposes an adaptive bandwidth control algorithm that efficiently provides an aggregate loss guarantee to resolve the problem of inefficient bandwidth allocation due to incomplete, inaccurate traffic descriptors supplied by users. Because the control attempts to allocate only just enough bandwidth to meet the QoS requirement, the amount of bandwidth saving compared to static allocation can be substantial. Another distinct advantage of our control algorithm is that no a priori information on the traffic characteristics of the aggregate is required. From the simulation study, the proposed control can maintain the packet loss QoS while attaining very high utilization, and is robust against different system configurations and controller parameters.

Published in:
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE  (Volume:3 )

Date of Conference: 17-21 Nov. 2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.