Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
DOMINO: a system to detect greedy behavior in IEEE 802.11 hotspots
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Selfish load balancing and atomic congestion games
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
DIMSUMNet: New Directions in Wireless Networking Using Coordinated Dynamic Spectrum Access
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
IEEE Transactions on Mobile Computing
IEEE Transactions on Multimedia
A survey on networking games in telecommunications
Computers and Operations Research
Bargaining Strategies for Networked Multimedia Resource Management
IEEE Transactions on Signal Processing - Part I
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we assume that the network resources are managed by several brokers, which are endowed with resources by a (remote) central resource manager according to several predetermined policies. Our focus is on autonomous multimedia users. We propose a novel resource management scheme, where resource brokers choose well-suited axiomatic bargaining solutions to divide their allocated resources among the users associated with them. These resource division solutions enable resource brokers to provide strict minimum video quality guarantees according to the (varying) number of multimedia users associated with them. Finally, we show that the proposed solution enables us to model the problem of selecting resource brokers by multimedia users as an unweighted congestion game, thereby ensuring convergence to a stationary distribution of users across resource brokers. We investigate the number of required users' switches to reach the stationary distribution, and quantify the fairness of the stationary distribution by introducing a novel quality fairness comparison metric for the users.