A core-stateless utility based rate allocation framework

In this paper, we present a core-stateless framework for allocating bandwidth to flows based on their requirements which are expressed using utility functions. The framework inherently supports flows with adaptive resource requirements and intra-flow drop priorities. The edge routers implement a labeling algorithm which in effect embeds partial information from a flow's utility function in each packet. The core routers maintain no per-flow state. Forwarding decisions are based a packets label and on a threshold utility value that is dynamically computed. Thus the edge and core routers work in tandem to provide bandwidth allocations based on a flow's utility function. We show how the labeling algorithm can be tailored to provide different services like weighted fair rate allocations. We then show the performance of our approach using simulations.