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...
Guardado en:
Autor principal: | Jonckheere, Matthieu Thimothy Samson |
---|---|
Publicado: |
2015
|
Materias: | |
Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01635999_v43_n2_p24_Jonckheere http://hdl.handle.net/20.500.12110/paper_01635999_v43_n2_p24_Jonckheere |
Aporte de: |
Ejemplares similares
-
Gradient bandwidth allocations
por: Jonckheere, M., et al. -
Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
por: Marenco, Javier Leonardo
Publicado: (2007) -
Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
por: Marenco, J.L., et al. -
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
por: Marenco, Javier Leonardo
Publicado: (2009) -
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
por: Marenco, J., et al.
Publicado: (2009)