Stability bounds in networks with dynamic link capacities
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7038
comunitat-uji-handle3:10234/8634
comunitat-uji-handle4:
INVESTIGACIONEste recurso está restringido
http://dx.doi.org/10.1016/j.ipl.2008.09.020 |
Metadatos
Título
Stability bounds in networks with dynamic link capacitiesAutoría
Fecha de publicación
2008Editor
ElsevierISSN
200190Cita bibliográfica
Information Processing Letters, 109, 2, p. 151-154Tipo de documento
info:eu-repo/semantics/articlePalabras clave / Materias
Resumen
We address the problem of stability in networks where the link capacities can change dynamically. We show that every network running a greedy scheduling policy is universally stable at any injection rate r < 1 / (C ... [+]
We address the problem of stability in networks where the link capacities can change dynamically. We show that every network running a greedy scheduling policy is universally stable at any injection rate r < 1 / (C d), where d is the largest number of links crossed by any packet and C is the maximum link capacity. We also show that system-wide time priority scheduling policies are universally stable at any injection rate r < 1 / (C (d - 1)). © 2008 Elsevier B.V. All rights reserved. [-]
Derechos de acceso
http://rightsstatements.org/vocab/CNE/1.0/
info:eu-repo/semantics/restrictedAccess
info:eu-repo/semantics/restrictedAccess
Aparece en las colecciones
- LSI_Articles [362]