A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Understanding TCP vegas: a duality model
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Internet pricing with a game theoretical approach: concepts and examples
IEEE/ACM Transactions on Networking (TON)
ATM Network Resource Management
ATM Network Resource Management
Assessing Voice Quality in Packet-Based Telephony
IEEE Internet Computing
The Aumann-Shapley price mechanism for allocating congestion costs
Operations Research Letters
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
End-to-end link power control in optical networks using Nash bargaining solution
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Fair resource allocation in wireless networks in the presence of a jammer
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Toward a fully decentralized algorithm for multiple bag-of-tasks application scheduling on grids
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Fair bandwidth sharing using Shapley value
Proceedings of the 2008 Euro American Conference on Telematics and Information Systems
Nash bargaining and proportional fairness for wireless systems
IEEE/ACM Transactions on Networking (TON)
Cooperative power-aware scheduling in grid computing environments
Journal of Parallel and Distributed Computing
Different dynamics for optimal association in heterogeneous wireless networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Fair scheduling in cellular systems in the presence of noncooperative mobiles
INFOCOM'10 Proceedings of the 29th conference on Information communications
Performance evaluation of bandwidth allocation in ATM networks
International Journal of Business Information Systems
A scheduling problem with one producer and the bargaining counterpart with two producers
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A new two-party bargaining mechanism
Journal of Combinatorial Optimization
Fair scheduling of bag-of-tasks applications using distributed Lagrangian optimization
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
For over a decade, the Nash Bargaining Solution (NBS) concept from cooperative game theory has been used in networks to share resources fairly. Due to its many appealing properties, it has recently been used for assigning bandwidth in a general topology network between applications that have linear utility functions. In this paper, we use this concept for allocating the bandwidth between applications with general concave utilities. Our framework includes in fact several other fairness criteria, such as the max-min criteria. We study the impact of concavity on the allocation and present computational methods for obtaining fair allocations in a general topology, based on a dual Lagrangian approach and on Semi-Definite Programming.