Donald Bren School of Information and Computer Sciences

End-to-end congestion control is an important reason why the Internet is robust, scalable and simple to use. Unfortunately, purely end-to-end congestion control algorithms are incapable of preventing the unfair bandwidth allocations and congestion collapse caused by unresponsive applications, which are becoming increasingly prevalent in the Internet. In this paper, we propose a new mechanism called Fair Queueing with Feedback-based Policing (FQFP) to address unfair bandwidth allocation and congestion collapse in the Internet. We demonstrate the promise of FQFP through simluations and suggest ways in which FQFP may leverage the mechanisms currently being developed in the context of differentiated services. The FQFP mechanism is compliant with the Internet philosophy of keeping router implementations simple and pushing complexity toward the edges of the network.