Value-aware Resource Allocation for Service Guarantees in Networks

10 years 4 months ago
Value-aware Resource Allocation for Service Guarantees in Networks
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixed route, and the objective is to maximize the total system throughput under some concept of fairness, subject to capacity constraints of the links used. This problem is well studied under the framework of network utility maximization and has led to several different distributed congestion control schemes. However, this idea of value does not capture the fact that flows might associate value, not just with throughput, but with linkquality metrics such as packet delay, jitter and so on. The traditional congestion control problem is redefined to include individual source preferences. It is assumed that degradation in link quality seen by a flow adds up on the links it traverses, and the total utility is maximized in such a way that the quality degradation seen by each source is bounded by a value that it decl...
Parimal Parag, Srinivas Shakkottai, Jean-Fran&cced
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Authors Parimal Parag, Srinivas Shakkottai, Jean-François Chamberland
Comments (0)