Decongestion Control

5th ACM Workshop on Hot Topics in Networks, HotNets 2006

Volumn , Issue , 2006, Pages 61-66

  Raghavan, Barath ^a   Snoeren, Alex C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL PROTOCOLS; HIGH SPEED TRANSMISSION; LARGE PARTS; NETWORK CONGESTIONS; NETWORK DESIGN; PACKETS LOSS; PERFORMANCE; ROUTER BUFFER; STABILITY PERFORMANCE; TRANSMISSION RATES;

TRANSMISSION CONTROL PROTOCOL;

EID: 85134076411     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. A. Akella, R. Karp, C. Papadimitrou, S. Seshan, and S. Shenker. Selfish behavior and stability of the internet: A game-theoretic analysis of TCP. In Proceedings of ACM SIGCOMM, 2002.
2. G. Appenzeller, I. Keslassy, and N. McKeown. Sizing router buffers. In Proceedings of ACM SIGCOMM, 2004.
3. J. C. R. Bennett and H. Zhang. WF2Q: Worst-case fair weighted fair queueing. In Proceedings of IEEE INFOCOM, 1996.
4. S. Bhadra and S. Shakkottai. Looking at large networks: Coding vs. queueing. In Proceedings of IEEE INFOCOM, 2006.
5. J. Byers, J. Considine, M. Mitzenmacher, and S. Rost. Informed content delivery across adaptive overlay networks. In Proceedings of ACM SIGCOMM, 2002.
6. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege. A Digital Fountain approach to reliable distribution of bulk data. In Proceedings of ACM SIGCOMM, 1998.
7. D. W. Davies. The control of congestion in packet switching networks. In Proceedings of ACM Problems in the optimizations of data communications systems, 1971.
8. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In Proceedings of ACM SIGCOMM, 1989.
9. S. Floyd and V. Jacobson. Link-sharing and resource management models for packet networks. IEEE/ACM Transactions on Networking, 3(4):365-386, 1995.
10. T. Kelly, S. Floyd, and S. Shenker. Patterns of conjestion collapse, 2003. unpublished.
11. A. Kuzmanovic and E. W. Knightly. Low-rate TCP-targeted denial of service attacks: the shrew vs. the mice and elephants. In Proceedings of ACM SIGCOMM, 2003.
12. S. Lin, D. J. C. Jr., and M. J. Miller. Automatic-repeat-request error-control schemes. IEEE Communications Magazine, 22(12), 1984.
13. L. López, G. del Rey Almansa, S. Paquelet, and A. Fernández. A mathematical model for the TCP tragedy of the commons. Theor. Comput. Sci., 343(1-2):4-26, 2005.
14. L. López and A. Fernández. A game theoretic analysis of protocols based on fountain codes. In Proceedings of IEEE ISCC, 2005.
15. M. Luby. LT codes. In Proceedings of IEEE FOCS, 2002.
16. H. Lundqvist and G. Karlsson. TCP with end-to-end forward error correction. In Proceedings of International Zurich Seminar on Communications, 2004.
17. R. Mahajan, S. M. Bellovin, S. Floyd, J. Ioannidis, V. Paxson, and S. Shenker. Controlling high bandwidth aggregates in the network. ACM SIGCOMM CCR, 32(3):62-73, 2002.
18. P. Maymounkov. Online codes. Technical Report TR2002-833, New York University, 2002.
19. R. Pan, L. Breslau, B. Prabhakar, and S. Shenker. Approximate fairness through differential dropping. ACM SIGCOMM CCR, 33(2):23-39, 2003.
20. R. Pan, B. Prabhakar, and K. Psounis. CHOKe - A stateless queue management scheme for approximating fair bandwidth allocation. In Proceedings of IEEE INFOCOM, 2000.
21. A. Parekh and R. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The single node case. IEEE/ACM Transactions on Networking, 1(3):344-357, 1993.
22. L. Rizzo. Effective erasure codes for reliable computer communication protocols. ACM SIGCOMM CCR, 27(2):24-36, 1997.
23. S. Savage, N. Cardwell, D. Wetherall, and T. Anderson. TCP congestion control with a misbehaving receiver. ACM SIGCOMM CCR, 29(5):71-78, 1999.
24. S. Shenker. Making greed work in networks: A game-theoretic analysis of switch service disciplines. In Proceedings of ACM SIGCOMM, 1994.
25. R. Sherwood, B. Bhattacharjee, and R. Braud. Misbehaving TCP receivers can cause Internet-wide congestion collapse. In Proceedings of ACM CCS, 2005.
26. M. Shreedhar and G. Varghese. Efficient fair queuing using deficit round robin. In Proceedings of ACM SIGCOMM, 1995.
27. I. Stoica, S. Shenker, and H. Zhang. Core-stateless fair queueing: A scalable architecture to approximate fair bandwidth allocations in high speed networks. In Proceedings of ACM SIGCOMM, 1998.
28. R. Vasudevan, Z. M. Mao, O. Spatscheck, and J. van der Merwe. Reval: A tool for real-time evaluation of DDoS mitigation strategies. In Proceedings of USENIX, 2006.
29. M. Walfish, H. Balakrishnan, D. Karger, and S. Shenker. DoS: Fighting fire with fire. In Proceedings of ACM HotNets, 2005.
30. H. Zhang, D. Towsley, and W. Gong. TCP connection game: A study on the selfish behavior of TCP users. In Proceedings of IEEE ICNP, 2005.