Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/90695
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLuo, Jun.en
dc.contributor.authorMa, Kexin.en
dc.contributor.authorRavi Mazumdar.en
dc.date.accessioned2009-12-17T04:37:40Zen
dc.date.accessioned2019-12-06T17:52:20Z-
dc.date.available2009-12-17T04:37:40Zen
dc.date.available2019-12-06T17:52:20Z-
dc.date.copyright2008en
dc.date.issued2008en
dc.identifier.citationLuo, J., Ma, K., & Ravi, M. (2008). INFOCOM 2008. The 27th Conference on Computer Communications. IEEE. On the performance of primal/dual schemes for congestion control in networks with dynamic flows. 2008:(pp. 326-330)en
dc.identifier.urihttps://hdl.handle.net/10356/90695-
dc.description.abstractStability 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.en
dc.format.extent8 p.en
dc.language.isoenen
dc.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.en
dc.subjectDRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networksen
dc.titleOn the performance of primal/dual schemes for congestion control in networks with dynamic flowsen
dc.typeConference Paperen
dc.contributor.schoolSchool of Computer Engineeringen
dc.contributor.conferenceIEEE Conference on Computer Communications (27th : 2008 : Phoenix, Arizona, US)en
dc.identifier.doi10.1109/INFOCOM.2008.74en
dc.description.versionPublished versionen
dc.identifier.rims140293en
item.fulltextWith Fulltext-
item.grantfulltextopen-
Appears in Collections:SCSE Conference Papers
Files in This Item:
File Description SizeFormat 
140293_1.pdf316.37 kBAdobe PDFThumbnail
View/Open

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.