Lagrange multipliers and optimality
SIAM Review
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Utility-based rate control in the Internet for elastic traffic
IEEE/ACM Transactions on Networking (TON)
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Convex Optimization
Power Control By Geometric Programming
IEEE Transactions on Wireless Communications
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Game theoretic distributed uplink power control for CDMA networks with real-time services
Computer Communications
On performance optimization for multi-carrier MIMO ad hoc networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Distributed utility-based rate adaptation protocols for prioritized, quasi-elastic flows
ACM SIGMOBILE Mobile Computing and Communications Review
Utility max-min fair resource allocation for communication networks with multipath routing
Computer Communications
A suboptimal network utility maximization approach for scalable multimedia applications
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Random access for elastic and inelastic traffic in WLANs
IEEE Transactions on Wireless Communications
Handling inelastic traffic in wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Improving rate allocation for ephemeral traffic using a second-order algorithm
Journal of Network and Computer Applications
Layering as optimization decomposition: questions and answers
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
A unified approach to optimizing performance in networks serving heterogeneous flows
IEEE/ACM Transactions on Networking (TON)
Resource Allocation via Message Passing
INFORMS Journal on Computing
User-level satisfaction aware end-to-end rate control in communication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stochastic utility-based flow control algorithm for services with time-varying rate requirements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Content-aware rate allocation for efficient video streaming via dynamic network utility maximization
Journal of Network and Computer Applications
Resource Allocation via Message Passing
INFORMS Journal on Computing
Hi-index | 0.00 |
A common assumption behind most of the recent research on network rate allocation is that traffic flows are elastic, which means that their utility functions are concave and continuous and that there is no hard limit on the rate allocated to each flow. These critical assumptions lead to the tractability of the analytic models for rate allocation based on network utility maximization, but also limit the applicability of the resulting rate allocation protocols. This paper focuses on inelastic flows and removes these restrictive and often invalid assumptions. First, we consider nonconcave utility functions, which turn utility maximization into difficult, nonconvex optimization problems. We present conditions under which the standard price-based distributed algorithm can still converge to the globally optimal rate allocation despite nonconcavity of utility functions. In particular, continuity of price-based rate allocation at all the optimal prices is a sufficient condition for global convergence of rate allocation by the standard algorithm, and continuity at at least one optimal price is a necessary condition. We then show how to provision link capacity to guarantee convergence of the standard distributed algorithm. Second, we model real-time flow utilities as discontinuous functions. We show how link capacity can be provisioned to allow admission of all real-time flows, then propose a price-based admission control heuristics when such link capacity provisioning is impossible, and finally develop an optimal distributed algorithm to allocate rates between elastic and real-time flows.