Core-Stateless Fair Queuing For Fair Bandwidth Allocations in Internet

To achieve fair bandwidth allocations, router mechanisms are attained in the network. Router mechanisms designed to achieve fair bandwidth allocations, like RED, have many desirable proper ties for congestion control in the Internet. In this paper, we propose an architecture that contains edge router and core router, significantly reduces this implementation complexity yet still achieves fair bandwidth allocations. We apply this approach to core routers that is, a nearby region of the network and we difference between edge routers and core routers. Edge routers maintain per flow state; they estimate the incoming rate of each flow and insert a label into each packet header based on this estimate. Core routers maintain no per flow state; they use FIFO packet scheduling. We call the scheme Core-Stateless Fair Queuing. We present simulations and analysis on the performance of this approach, and discuss an alternate approach.