By Topic

Optimization Flow Control: A Queue Proportional Algorithm

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
$33 $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

1 Author(s)
Doraid Dalalah ; P.O.Box: 3030, Ind. Eng. Dept., Jordan University of Sc. and Tech., Irbid 22110, Jordan,

In this paper, an optimization approach to flow control in data networks is proposed. The model objective is to maximize the aggregate utilities of the data sources over soft bounds and delay constraints. The network links and data sources are considered as processors of a distributed computation system with a global objective function. The presented model works with different shapes of utility curves under the proposition of elastic data traffic. The approach relies on the observed delay as a measure of the network congestion at the routers. A primal-dual algorithm carried out by the data sources is used to solve the optimization problem in a decentralized manner. The algorithm solves for the rates without the access to any global information. The calculated rates conform to queue proportional fairness. Later, we present a simple approach for estimating the minimum roundtrip delay followed by simulation experiments.

Published in:

2008 IEEE International Symposium on Intelligent Control

Date of Conference:

3-5 Sept. 2008