Quality of Service White Papers
Rate Allocation Under Network End-to-End Quality-of-Service Requirements
Overview This paper addresses the problem of allocating transmission rates to a set of network sessions with end-to-end bandwidth and delay requirements. It gives a unified convex programming formulation that captures both average and probabilistic delay requirements. Moreover, it presents a distributed algorithm and establishes its convergence to the global optimum of the overall rate allocation problem. In this algorithm, session sources update their rates as to maximize their individual benefit (utility minus bandwidth cost), the network partitions end-to-end delay requirements into local per-link delays, and the links adjust their prices to coordinate the sources' and network's decisions, respectively. This algorithm relies on a network utility maximization approach, and can be viewed as a generalization of TCP and queue management algorithms to handle end-to-end QoS.
| Publisher | University of Toronto | File Format | |
|---|---|---|---|
| Date Published | August 2006 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 1 out of 3 users found this white paper useful
White Paper RSS
Download
Register
