Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm
ACM SIGCOMM Computer Communication Review
Optimizing file transfer response time using the loss-load curve congestion control mechanism
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Making greed work in networks: a game-theoretic analysis of switch service disciplines
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Queue management for explicit rate based congestion control
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
End-to-end arguments in system design
ACM Transactions on Computer Systems (TOCS)
Understanding TCP vegas: a duality model
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Aggregate traffic performance with active queue management and drop from tail
ACM SIGCOMM Computer Communication Review
A game-theoretic approach towards congestion control in communication networks
ACM SIGCOMM Computer Communication Review
Controlling high bandwidth aggregates in the network
ACM SIGCOMM Computer Communication Review
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Reliable Blast UDP: Predictable High Performance Bulk Data Transfer
CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
A spectrum of TCP-friendly window-based congestion control algorithms
IEEE/ACM Transactions on Networking (TON)
Network border patrol: preventing congestion collapse and promoting fairness in the internet
IEEE/ACM Transactions on Networking (TON)
Rate-based versus queue-based models of congestion control
Proceedings of the joint international conference on Measurement and modeling of computer systems
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Congestion control in IP/TCP internetworks
ACM SIGCOMM Computer Communication Review
A global stability result for primal-dual congestion control algorithms with routing
ACM SIGCOMM Computer Communication Review
Congestion control for high performance, stability, and fairness in general networks
IEEE/ACM Transactions on Networking (TON)
Network utility maximization with nonconcave, coupled, and reliability-based uilities
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A measurement study of correlations of internet flow characteristics
Computer Networks: The International Journal of Computer and Telecommunications Networking
UDT: UDP-based data transfer for high-speed wide area networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stateful DDoS attacks and targeted filtering
Journal of Network and Computer Applications
Performance analysis of BitTorrent-like systems with heterogeneous users
Performance Evaluation
Limitations of equation-based congestion control
IEEE/ACM Transactions on Networking (TON)
Rethinking internet traffic management: from multiple decompositions to a practical protocol
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Stability and fairness of explicit congestion control with small buffers
ACM SIGCOMM Computer Communication Review
SQUARE: A New TCP Variant for Future High Speed and Long Delay Environments
AINA '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications
Statistical techniques for detecting traffic anomalies through packet header data
IEEE/ACM Transactions on Networking (TON)
Short Survey: A survey of TCP-friendly router-based AQM schemes
Computer Communications
RSVP and integrated services in the Internet: a tutorial
IEEE Communications Magazine
A survey on TCP-friendly congestion control
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
The Internet relies on cooperative endpoints to react to signals from the network that congestion is occurring. In particular, TCP interprets packet loss as a signal of congestion. However there are many new non-cooperative protocols in use which attempt to exploit the network aggressively and do not reduce their demands when the network signals congestion. We propose the aggregate control of ''fluxes'' defined by policies at individual routers. Each router can then calculate an optimal allocation of bandwidth to each flux contending for a given output link. We propose a combined hill climbing and convex programming method for this optimization, which we call HCCP. HCCP is designed to punish greedy fluxes rather than just regulating them: such fluxes may find their bandwidth allocation reduced to zero if they are sufficiently aggressive. Our results show that HCCP is effective at regulating a wide range of rather generally characterized transport protocols. We explore the use of both throughput maximization and proportionally fair allocation and recommend the latter because the former often leads to the situation where one or more fluxes receive zero bandwidth.