Combining fairness with throughput: online routing with multiple objectives

@inproceedings{Goel2000CombiningFW,
  title={Combining fairness with throughput: online routing with multiple objectives},
  author={Ashish Goel and Adam Meyerson and Serge A. Plotkin},
  booktitle={STOC},
  year={2000}
}
This paper presents online algorithms for routing and bandwidth allocation which simultaneously approximate fair and max-throughput solutions. In fact, the algorithms solve a more difficult problem: for any bandwidth b, the number of sessions that get bandwidth b in the online algorithm is not smaller than the number of sessions receiving vb offiine, where V is the competitive ratio. This problem is provably harder than the problem of maximizing throughput (e.g. [4]) or the problem of… CONTINUE READING
Highly Cited
This paper has 67 citations. REVIEW CITATIONS
39 Citations
3 References
Similar Papers

Citations

Publications citing this paper.

68 Citations

0510'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…