Gradient bandwidth allocations

We look at bandwidth-sharing networks where bandwidth allocations are not known to maximize a priori any utility function. Instead, we only require the allocation functions to be 0-homogeneous and concave, which are desirable properties in many situations. We show that a certain gradient condition i...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Jonckheere, M.
Otros Autores: Shneer, S., Casale G., Golubchik L., Zwart B.
Formato: Acta de conferencia Capítulo de libro
Lenguaje:Inglés
Publicado: Association for Computing Machinery 2015
Acceso en línea:Registro en Scopus
DOI
Handle
Registro en la Biblioteca Digital
Aporte de:Registro referencial: Solicitar el recurso aquí
LEADER 03515caa a22005057a 4500
001 PAPER-13258
003 AR-BaUEN
005 20230518204333.0
008 190411s2015 xx ||||fo|||| 10| 0 eng|d
024 7 |2 scopus  |a 2-s2.0-84978760314 
040 |a Scopus  |b spa  |c AR-BaUEN  |d AR-BaUEN 
030 |a PERED 
100 1 |a Jonckheere, M. 
245 1 0 |a Gradient bandwidth allocations 
260 |b Association for Computing Machinery  |c 2015 
506 |2 openaire  |e Política editorial 
504 |a Bonald, T., Massoulie, L., Proutiere, A., Virtamo, J., A queueing analysis of max-min fairness, proportional fairness and balanced fairness (2006) Queueing Syst. Theory Appl., 53 (1-2), pp. 65-84 
504 |a Kelly, F., (1979) Reversibility and Stochastic Networks, , Wiley 
504 |a Kelly, F., Charging and rate control for elastic traffic (2013) Eur. Trans. Telecommun., 8, pp. 33-37 
504 |a Massoulie, L., Structural properties of proportional fairness: Stability and insensitivity (2007) Ann. Appl. Probab., 17 (3), pp. 809-839 
504 |a Massoulie, L., Roberts, J., Bandwidth sharing: Objectives and algorithms (1999) IEEE Infocom 1999, pp. 320-328 
504 |a Rockafellar, T., Convex analysis (1970) Princeton Landmarks in Mathematics, 28 
504 |a Stolyar, A., Dynamic distributed scheduling in random access networks (2008) J. Appl. Probab., 45, p. 297313A4 - 
520 3 |a We look at bandwidth-sharing networks where bandwidth allocations are not known to maximize a priori any utility function. Instead, we only require the allocation functions to be 0-homogeneous and concave, which are desirable properties in many situations. We show that a certain gradient condition is necessary and sufficient for such allocations to solve an optimization problem leading to important corollaries such as deriving the stability set of these 0-homogeneous concave allocation.  |l eng 
593 |a Facultad de Ciencias Exactas, Naturales Universidad de Buenos Aires, Ciudad Universitaria Buenos, Pabellon II, Aires, 1428, Argentina 
593 |a Department of AMS, Heriot-Watt University, Edinburgh, EH14 4AS, United Kingdom 
690 1 0 |a OPTIMIZATION 
690 1 0 |a ALLOCATION FUNCTION 
690 1 0 |a BANDWIDTH-SHARING NETWORKS 
690 1 0 |a OPTIMIZATION PROBLEMS 
690 1 0 |a UTILITY FUNCTIONS 
690 1 0 |a BANDWIDTH 
700 1 |a Shneer, S. 
700 1 |a Casale G. 
700 1 |a Golubchik L. 
700 1 |a Zwart B. 
711 2 |d 19 October 2015 through 21 October 2015  |g Código de la conferencia: 122367 
773 0 |d Association for Computing Machinery, 2015  |g v. 43  |h pp. 24-25  |k n. 2  |p Perform Eval Rev  |n Performance Evaluation Review  |x 01635999  |t 33rd International Symposium on Computer Performance, Modeling, Measurement, and Evaluation, IFIP WG 7.3 Performance 2015 
856 4 1 |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978760314&doi=10.1145%2f2825236.2825246&partnerID=40&md5=7d7a70a2c2fbe8d7bd8f2758ef48d6d4  |y Registro en Scopus 
856 4 0 |u https://doi.org/10.1145/2825236.2825246  |y DOI 
856 4 0 |u https://hdl.handle.net/20.500.12110/paper_01635999_v43_n2_p24_Jonckheere  |y Handle 
856 4 0 |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01635999_v43_n2_p24_Jonckheere  |y Registro en la Biblioteca Digital 
961 |a paper_01635999_v43_n2_p24_Jonckheere  |b paper  |c PE 
962 |a info:eu-repo/semantics/conferenceObject  |a info:ar-repo/semantics/documento de conferencia  |b info:eu-repo/semantics/publishedVersion 
999 |c 74211