TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Information theoretic aspects of fairness criteria in network resource allocation problems
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Dynamic scheduling of multi-media streams in home automation systems
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers
Congestion control in utility fair networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Game theoretic distributed uplink power control for CDMA networks with real-time services
Computer Communications
Joint power and rate control considering fairness for cognitive radio network
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Maintaining utility fairness using weighting factors in wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
An interior point penalty method for utility maximization problems in OFDMA networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
An interior point penalty method for utility maximization problems in OFDMA networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A resource allocation algorithm for users with multiple applications in 4G-LTE
Proceedings of the 1st ACM workshop on Cognitive radio architectures for broadband
| Hi-index | 0.00 |
In this paper, we present a novel approach to the congestion control and resource allocation problem of elastic and real-time traffic in telecommunication networks. With the concept of utility functions, where each source uses a utility function to evaluate the benefit from achieving a transmission rate, we interpret the resource allocation problem as a global optimization problem. The solution to this problem is characterized by a new fairness criterion, utility proportional fairness. We argue that it is an application level performance measure, i.e. the utility that should be shared fairly among users. As a result of our analysis, we obtain congestion control laws at links and sources that are globally stable and provide a utility proportional fair resource allocation in equilibrium. We show that a utility proportional fair resource allocation also ensures utility max-min fairness for all users sharing a single path in the network. As a special case of our framework, we incorporate utility max-min fairness for the entire network. To implement our approach, neither per-flow state at the routers nor explicit feedback beside ECN (Explicit Congestion Notification) from the routers to the end-systems is required.