Data networks
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Data networks (2nd ed.)
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
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)
Optimal flow control and routing in multi-path networks
Performance Evaluation - Special issue: Internet performance and control of network systems
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
Priority service and max-min fairness
IEEE/ACM Transactions on Networking (TON)
Resource pricing and the evolution of congestion control
Automatica (Journal of IFAC)
A scalable low-overhead rate control algorithm for multirate multicast sessions
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Improving media sensitivity of TCP-friendly rate control for multimedia streaming applications
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia
Utility max-min fair resource allocation for communication networks with multipath routing
Computer Communications
A simple framework of utility max-min flow control using sliding mode approach
IEEE Communications Letters
Content-aware distortion-fair video streaming in congested networks
IEEE Transactions on Multimedia - Special issue on quality-driven cross-layer design for multimedia communications
Optimal flow control for utility-lifetime tradeoff in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Joint power and rate control considering fairness for cognitive radio network
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
A simple iterative algorithm to achieve utility proportional fairness
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
IEEE Journal on Selected Areas in Communications
Handling inelastic traffic in wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Utility-based asynchronous flow control algorithm for wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
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
Hi-index | 0.00 |
This paper is concerned with flow control and resource allocation problems in computer networks in which real-time applications may have hard quality of service (QoS) requirements. Recent optimal flow control approaches are unable to deal with these problems since QoS utility functions generally do not satisfy the strict concavity condition in real-time applications. For elastic traffic, we show that bandwidth allocations using the existing optimal flow control strategy can be quite unfair. If we consider different QoS requirements among network users, it may be undesirable to allocate bandwidth simply according to the traditional max-min fairness or proportional fairness. Instead, a network should have the ability to allocate bandwidth resources to various users, addressing their real utility requirements. For these reasons, this paper proposes a new distributed flow control algorithm for multiservice networks, where the application's utility is only assumed to be continuously increasing over the available bandwidth. In this, we show that the algorithm converges, and that at convergence, the utility achieved by each application is well balanced in a proportionally (or max-min) fair manner.