Regulating best effort flows on per domain basis

It is difficult to properly regulate best effort flows. Although several methods have been proposed, the communication cost is too high to make them effective for large number of non-TCP friendly flows. We solve this problem by making a tradeoff between the communication cost and the computation complexity of core routers. In addition, core routers and edge routers regulate aggregate flows without dynamic calculation of round trip time and consumption of extra buffers. By simulation experiments, we find our proposal is effective in both tail-drop FIFO queuing and RED queuing.