Back to Results
First PageMeta Content
Teletraffic / Mathematical optimization / Max-min fairness / Computing / Data / Technology / Network performance / Operations research / Network congestion


On the Performance of Primal/Dual Schemes for Congestion Control in Networks With Dynamic Flows Kexin Ma Ravi Mazumdar
Add to Reading List

Document Date: 2007-06-01 17:07:49


Open Document

File Size: 140,44 KB

Share Result on Facebook

City

End Window / /

Company

Wireless Networks / Queueing Systems / Communication Networks / /

/

Facility

University of Virginia / Purdue University / Computer Engineering University of Waterloo Waterloo / /

IndustryTerm

distributed control algorithm / control algorithm / user utilities / logarithmic utilities / long-term congestion control solution / primaldual algorithm / primal-dual algorithms / feasible solution / internet performance / distributed iterative algorithm / openloop algorithm / long-term congestion avoidance algorithm / has focused on networks / multi-hop network / primal-dual type algorithms / flow utilities / primal-dual algorithm / primal solution / /

MarketIndex

B TABLE I T IME / /

Organization

Networks With Dynamic Flows Kexin Ma Ravi Mazumdar Jun Luo Department of Electrical / University of Virginia / Operational Research Society / Electrical and Computer Engineering University of Waterloo Waterloo / Purdue University / /

Person

C. Gromoll / R. J. Williams / /

Product

Fs / /

ProvinceOrState

Virginia / Ontario / /

PublishedMedium

Networks and Spatial Economics / /

Technology

distributed iterative algorithm / Broadband / proposed algorithm / flow control / primal-dual algorithm / C. All algorithms / distributed control algorithm / openloop algorithm / control algorithm / primaldual algorithm / primal-dual type algorithms / simulation / long-term congestion avoidance algorithm / two algorithms / primal-dual algorithms / /

SocialTag