Priority service and max-min fairness

Authors:
Peter Marbach
Affiliations:
Department of Computer Science, University of Toronto, Toronto, ON M5S 1A4, Canada
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2003

Citing 12
Cited 17

Data networks

Data networks
Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Pricing in computer networks: motivation, formulation, and example

IEEE/ACM Transactions on Networking (TON)
Pricing the Internet

Public access to the Internet
Quality of service provision in noncooperative networks: heterogenous preferences, multi-dimensional QoS vectors, and burstiness

Proceedings of the first international conference on Information and computation economies
Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
Paris metro pricing for the internet

Proceedings of the 1st ACM conference on Electronic commerce
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)
On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
The impact of multicast layering on network fairness

IEEE/ACM Transactions on Networking (TON)
Utility-based rate control in the Internet for elastic traffic

IEEE/ACM Transactions on Networking (TON)

Fast convergence of selfish rerouting

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A survey on networking games in telecommunications

Computers and Operations Research
Resource allocation and cross-layer control in wireless networks

Foundations and Trends® in Networking
Application-oriented flow control: fundamentals, algorithms and fairness

IEEE/ACM Transactions on Networking (TON)
Long-lived TCP connections via satellite: cross-layer bandwidth allocation, pricing, and adaptive control

IEEE/ACM Transactions on Networking (TON)
Unifying view on min-max fairness, max-min fairness, and utility optimization incellular networks

EURASIP Journal on Wireless Communications and Networking
Pricing the quality of differentiated services for media-oriented real-time applications: A multi-attribute negotiation approach

Computer Networks: The International Journal of Computer and Telecommunications Networking
On the feasibility of dynamic congestion-based pricing in differentiated services networks

IEEE/ACM Transactions on Networking (TON)
Pareto-efficient and goal-driven power control in wireless networks: a game-theoretic approach with a novel pricing scheme

IEEE/ACM Transactions on Networking (TON)
A survey on networking games in telecommunications

Computers and Operations Research
A cooperative cache-based content delivery framework for intermittently connected mobile ad hoc networks

IEEE Transactions on Wireless Communications
Cost sharing and strategyproof mechanisms for set cover games

Journal of Combinatorial Optimization
Access point selection algorithm for multi-rate WLANs to optimise throughput and guarantee fairness

International Journal of Ad Hoc and Ubiquitous Computing
Fuzzy enabled congestion control for Differentiated Services Networks

Applied Soft Computing
Cost sharing and strategyproof mechanisms for set cover games

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Distributed workload and response time management for web applications

Proceedings of the 7th International Conference on Network and Services Management
Towards transparent and distributed workload management for large scale web servers

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a priority service where users are free to choose the priority of their traffic, but are charged accordingly by the network. We assume that each user chooses priorities to maximize its own net benefit, and model the resulting interaction among users as a noncooperative game. We show that there exists an unique equilibrium for this game and that in equilibrium the bandwidth allocation is weighted max-min fair.