Fairness in routing and load balancing

Journal of Computer and System Sciences

Volumn 63, Issue 1, 2001, Pages 2-20

  Kleinberg, Jon ^a   Rabani, Yuval ^b   Tardos, Éva ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONGESTION CONTROL (COMMUNICATION); CONVERGENCE OF NUMERICAL METHODS; FREQUENCY ALLOCATION; GRAPH THEORY; INTERNET; MATHEMATICAL MODELS; OPTIMIZATION;

HIGH SPEED NETWORKS; LOAD BALANCING; ROUTING;

DATA COMMUNICATION SYSTEMS;

EID: 0035415972     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1752     Document Type: Article

References (16)

1. Convergence complexity of optimistic rate based flow control algorithms
2. Fast, fair, and frugal bandwidth allocation in ATM networks
3. Data networks
4. On the single-source unsplittable flow problem
5. College admissions and the stability of marriage
6. Voice flow control in integrated packet networks
7. Bottleneck flow control
8. On the computational complexity of combinatorial problems
9. Charging and rate control for elastic traffic
10. Single-source unsplittable flow
11. Improved approximation algorithms for unsplittable flow problems
12. Approximation algorithms for scheduling unrelated parallel machines
13. Approximation max-min fair rates via distributed local scheduling with partial information
14. Optimal flows in networks with sources and sinks
15. Competitive routing in ATM networks
16. The impact of multicast layering on network fairness