Using approximate majorization to characterize protocol fairness

Performance Evaluation Review

Volumn 29, Issue 1, 2001, Pages 330-331

  Bhargava, Rishi ^a   Goel, Ashish ^b   Meyerson, Adam ^c  

^a ONI Systems

^b University of Southern California   (United States)

^c Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; CONSTRAINT THEORY; POLYNOMIAL APPROXIMATION; ROUTERS; TELECOMMUNICATION LINKS; VECTORS;

PROTOCOL FAIRNESS;

NETWORK PROTOCOLS;

EID: 0034836617     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384268.378826     Document Type: Conference Paper

References (14)

1. Convergence complexity of optimistic rate based flow control algorithms
2. Analysis of the increase/decrease algorithms for congestion avoidance in computer networks
3. Connections with multiple congested gateways in packet-switched networks Part 1: One-way traffic
4. Combining fairness with throughput: Online routing with multiple objectives
5. Approximate majorization and fair online load balancing
6. Some simple inequalities satisfied by convex functions
7. Rate control in communication networks: Shadow prices, proportional fairness and stability
8. Fairness in routing and load balancing
9. An analysis of short-term fairness in wireless media access protocols
10. Fairness measures for resource allocation
11. Methods of measuring concentrations of wealth