On the Performance of Primal/Dual Schemes for Congestion Control in Networks With Dynamic Flows
Stability and fairness are two design objectives of congestion control mechanisms; the people 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, the authors study utility maximization problems for networks with dynamic flows. In particular, they 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.