mirage

On the performance of primal/dual schemes for congestion control in networks with dynamic flows.

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

On the performance of primal/dual schemes for congestion control in networks with dynamic flows.

Show full item record

Title: On the performance of primal/dual schemes for congestion control in networks with dynamic flows.
Author: Luo, Jun.; Ma, Kexin.; Ravi Mazumdar.
Copyright year: 2008
Abstract: Stability and fairness are two design objectives of congestion control mechanisms; they have traditionally been analyzed for long-lived flows (or elephants). It is only recently that short-lived flows (or mice) have received attention. Whereas stability has been established for the existing primal-dual based control mechanisms, the performance issue has been largely overlooked. In this paper, we study utility maximization problems for networks with dynamic flows. In particular, we consider the case where sessions of each class results in flows that arrive according to a Poisson process and have a length given by a general distribution. The goal is to maximize the long-term expected system utility that is a function of the number of flows and the rate (identical within a given class) allocated to each flow. Our results show that, as long as the average amount of work brought by the flows is strictly within the network stability region, the rate allocation and stability issues are decoupled. While stability can be guaranteed by, for example, a FIFO policy, utility maximization becomes an unconstrained optimization that results in a static rate allocation for flows. We also provide a queueing interpretation of this seemingly surprising result and show that not all utility functions make sense for dynamic flows. Finally, we use simulation results to show that indeed the open-loop algorithm maximizes the expected system utility.
Subject: DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks.
Type: Conference Paper
Conference name: IEEE Conference on Computer Communications (27th : 2008 : Phoenix, Arizona, US)
School: School of Computer Engineering
Rights: © 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Version: Published version

Files in this item

Files Size Format View
140293_1.pdf 323.9Kb PDF View/Open
   

DOI Query

- Get published version (via Digital Object Identifier)
   

This item appears in the following Collection(s)

Show full item record

Statistics

Total views

All Items Views
On the performance of primal/dual schemes for congestion control in networks with dynamic flows. 661

Total downloads

All Bitstreams Views
140293_1.pdf 562

Top country downloads

Country Code Views
United States of America 201
Singapore 170
China 93
Vietnam 18
Ukraine 15

Top city downloads

city Views
Singapore 169
Mountain View 82
Beijing 70
Seattle 31
Hanoi 17

Downloads / month

  2014-10 2014-11 2014-12 total
140293_1.pdf 0 0 10 10