• Pricing for fairness : Distrib...

Result: Pricing for fairness : Distributed resource allocation for multiple objectives

Title:
Pricing for fairness : Distributed resource allocation for multiple objectives
Authors:
CHO, Sung-Woo, GOEL, Ashish
Source:
STOC'06 (Proceedings of the 38th annual ACM symposium on theory of computing). :197-204
Publisher Information:
New York NY: ACM Press, 2006.
Publication Year:
2006
Physical Description:
print, 24 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithme réparti, Distributed algorithm, Algoritmo repartido, Allocation bande passante, Bandwidth allocation, Allocation ressource, Resource allocation, Asignación recurso, Equité, Equity, Equidad, Fixation prix, Pricing, Fijación precios, Fonction objectif, Objective function, Función objetivo, Fonction symétrique, Symmetric function, Función simétrica, Fonction utilité, Utility function, Función utilidad, Largeur bande, Bandwidth, Anchura banda, Mise à jour, Updating, Actualización, Méthode primale duale, Primal dual method, Método primal dual, Optimisation, Optimization, Optimización, Optimum, Optimo, Programmation multiobjectif, Multiobjective programming, Programación multiobjetivo, Routage, Routing, Enrutamiento, Tarification, Tariffication, Tarificación, Théorie utilité, Utility theory, Teoría utilidad
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of Southern California, United States
Stanford University, United States
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18297911
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18297911
Database:
PASCAL Archive

Further Information

In this paper, we present a simple distributed algorithm for resource allocation which simultaneously approximates the optimum value for a large class of objective functions. In particular, we consider the class of canonical utility functions U that are symmetric, non-decreasing, concave, and satisfy U(0) = 0. Our distributed algorithm is based on primal-dual updates. We prove that this algorithm is an O(log ρ)-approximation for all canonical utility functions simultaneously, i.e. without any knowledge of U. The algorithm needs at most O(log2 p) iterations. Here n is the number of flows, m is the number of edges, R is the ratio between the maximum capacity and the minimum capacity of the edges in the network, and p is max {n, m, R}. We extend this result to multi-path routing, and also to a natural pricing mechanism that results in a simple and practical protocol for bandwidth allocation in a network. When the protocol reaches equilibrium, the allocated bandwidths are the same as when the distributed algorithm converges; hence the protocol is also an O(log ρ) approximation for all canonical utility functions.