Table of Contents Author Guidelines Submit a Manuscript
Research Letters in Communications
Volume 2008, Article ID 704878, 5 pages
http://dx.doi.org/10.1155/2008/704878
Research Letter

A Simple Mechanism for Throttling High-Bandwidth Flows

Electrical and Computer Engineering Department, University of California, San Diego, La Jolla, CA 92093-0407, USA

Received 9 July 2008; Accepted 31 August 2008

Academic Editor: Jun Bi

Copyright © 2008 Chia-Wei Chang and Bill Lin. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. B. Braden, D. Clark, J. Crowcroft et al., “Recommendations on queue management and congestion avoidance in the internet,” IETF RFC (Informational), 2309, April 1998.
  2. A. Demers, S. Keshav, and S. Shenker, “Analysis and simulation of a fair queueing algorithm,” in Proceedings of the ACM Symposium on Communications Architectures & Protocols (ACM SIGCOMM '89), pp. 1–12, Austin, Tex, USA, September 1989. View at Publisher · View at Google Scholar
  3. P. E. McKenney, “Stochastic fairness queueing,” in Proceedings of the 9th Annual Joint Conference of IEEE Computer and Communications Societies (INFOCOM '90), vol. 2, pp. 733–740, San Francisco, Calif, USA, June 1990. View at Publisher · View at Google Scholar
  4. A. Manin and K. Ramakrishnan, “Gateway congestion control survey,” IETF RFC (Informational), 1254, August 1991.
  5. S. Floyd and V. Jacobson, “Random early detection gateways for congestion avoidance,” IEEE/ACM Transactions on Networking, vol. 1, no. 4, pp. 397–413, 1993. View at Publisher · View at Google Scholar
  6. D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, Upper Saddle River, NJ, USA, 2nd edition, 1992.
  7. D. Lin and R. Morris, “Dynamics of random early detection,” ACM SIGCOMM Computer Communication Review, vol. 27, no. 4, pp. 127–137, 1997. View at Publisher · View at Google Scholar
  8. T. J. Ott, T. V. Lakshman, and L. H. Wong, “SRED: stabilized RED,” in Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '99), vol. 3, pp. 1346–1355, New York, NY, USA, March 1999. View at Publisher · View at Google Scholar
  9. R. Pan, B. Prabhakar, and K. Psounis, “CHOKe—a stateless active queue management scheme for approximating fair bandwidth allocation,” in Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '00), vol. 2, pp. 942–951, Tel Aviv, Israel, March 2000. View at Publisher · View at Google Scholar
  10. Y. Jiang, M. Hamdi, and J. Liu, “Self adjustable CHOKe: an active queue management algorithm for congestion control and fair bandwidth allocation,” in Proceedings of the 8th IEEE International Symposium on Computers and Communication (ISCC '03), vol. 2, pp. 1018–1025, Antalya, Turkey, June-July 2003. View at Publisher · View at Google Scholar
  11. R. Pan, L. Breslau, B. Prabhakar, and S. Shenker, “Approximate fairness through differential dropping,” ACM SIGCOMM Computer Communication Review, vol. 33, no. 2, pp. 23–39, 2003. View at Publisher · View at Google Scholar
  12. R. M. Karp, S. Shenker, and C. H. Papadimitriou, “A simple algorithm for finding frequent elements in streams and bags,” ACM Transactions on Database Systems, vol. 28, no. 1, pp. 51–55, 2003. View at Publisher · View at Google Scholar