A Core-Stateless Utility Based Rate Allocation Framework

Authors:
Narayanan Venkitaraman;Jayanth Mysore;Mike Needham
Affiliations:
-;-;-
Venue:
PIHSN '02 Proceedings of the 7th IFIP/IEEE International Workshop on Protocols for High Speed Networks
Year:
2002

Citing 4
Cited 1

Receiver-driven layered multicast

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Providing guaranteed services without per flow management

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Fundamental design issues for the future Internet

IEEE Journal on Selected Areas in Communications

An approach for seamless integration of QoS and mobility for wireless mobile networks

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.