Abstract
Protocols for data transmission over an IP 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. Existing protocols, however, assume somewhat altruistic behavior from hosts. Karp et al. (2000) have initiated a study of whether or not a single host's optimum strategy (in a system where other hosts are well behaved) 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 multiplicative increase, multiplicative decrease strategy, which is very aggressive and non-altruistic.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Bansal, D. and H. Balakrishnan, “Binomial congestion control algorithms,” in Proceedings of INFOCOM, 2001. Extended version available as MIT-LCS-TR-806 from http://nms.lcs.mit.edu/papers/cm-binomial.html.
Chiu, D. and R. Jain, “Analysis of the increase and decrease algorithms for congestion avoidance in computer networks,” J. Comput. Networks ISDN Syst., 17, 1–14 (1989).
Fiat, A., R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young, “Competitive paging algorithms,” J. Algorithms, 12(4), 685–699 (1991).
Floyd, S. and K. Fall, “Promoting the use of end-to-end congestion control in the internet,” IEEE/ACM Trans. Networking, 7(4), 458–472 (1999).
Jacobson, V., “Congestion avoidance and control,” in Proceedings of ACM SIGCOMM, 1988, pp. 314–329.
Karp, R.M., E. Koutsoupias, C.H. Papadimitriou, and S. Shenker, “Algorithmic problems in congestion control,” in 41st IEEE Symposium on Foundations of Computer Science, 2000, pp. 66–74.
Kelly, F., A. Maulloo, and D. Tan, “Rate control in communication networks: shadow prices,” J. Oper. Res. Soc., 49, 237–252 (1998).
Savage, S., N. Cardwell, D. Wetherall, and T. Anderson, “TCP congestion control with a misbehaving receiver,” Comput. Commun. Rev., 29(5), 71–78 (1999).
Shenker, S., “Making greed work in networks: A game-theoretic analysis of switch service disciplines,” IEEETNWKG: IEEE/ACM Trans. Networking, 3, 819–831 (1995).
Yao, A. C. C., “Probabilistic computations: Towards a unified measure of complexity,” in 18th Symposium on Foundations of Computer Science, 1977, pp. 222–227.
Roughgarden, T. and E. Tardos, “How bad is selfish routing? in IEEE: Symposium on Foundations of Computer Science, 2000, pp. 93–102.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Arora, S., Brinkman, B. A Randomized Online Algorithm for Bandwidth Utilization. J Sched 7, 187–194 (2004). https://doi.org/10.1023/B:JOSH.0000019680.51396.32
Issue Date:
DOI: https://doi.org/10.1023/B:JOSH.0000019680.51396.32