### Abstract

Protocols for data transmission over a TCP-like computer network should not only lead to efficient network utilization but also be fair to different users. Current networks accomplish these goals by some form of end-to-end congestion control. However, existing protocols assume somewhat altruistic behavior from hosts, and Karp et al. [7] have initiated a study of whether or not the host's optimum strategy is altruistic. We carry this exploration further by developing an efficient randomized algorithm for bandwidth utilization in their model. The competitive ratio of this algorithm is optimal up to a constant factor. Karp et al. had earlier studied the deterministic case and left open the randomized case. What may be of some interest is that our algorithm is essentially the classical MIMD (multiplicative increase, multiplicative decrease) strategy, which is very aggressive and non-altruistic.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 |

Publisher | Association for Computing Machinery |

Pages | 535-539 |

Number of pages | 5 |

ISBN (Electronic) | 089871513X |

State | Published - Jan 1 2002 |

Event | 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 - San Francisco, United States Duration: Jan 6 2002 → Jan 8 2002 |

### Publication series

Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|

Volume | 06-08-January-2002 |

### Other

Other | 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 |
---|---|

Country | United States |

City | San Francisco |

Period | 1/6/02 → 1/8/02 |

### All Science Journal Classification (ASJC) codes

- Software
- Mathematics(all)

## Fingerprint Dive into the research topics of 'A randomized online algorithm for bandwidth utilization'. Together they form a unique fingerprint.

## Cite this

*Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002*(pp. 535-539). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; Vol. 06-08-January-2002). Association for Computing Machinery.