Stability bounds in networks with dynamic link capacities
Metadata
Show full item recordcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7038
comunitat-uji-handle3:10234/8634
comunitat-uji-handle4:
INVESTIGACIONThis resource is restricted
http://dx.doi.org/10.1016/j.ipl.2008.09.020 |
Metadata
Title
Stability bounds in networks with dynamic link capacitiesAuthor (s)
Date
2008Publisher
ElsevierISSN
200190Bibliographic citation
Information Processing Letters, 109, 2, p. 151-154Type
info:eu-repo/semantics/articleSubject
Abstract
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. [-]
Rights
http://rightsstatements.org/vocab/CNE/1.0/
info:eu-repo/semantics/restrictedAccess
info:eu-repo/semantics/restrictedAccess
This item appears in the folowing collection(s)
- LSI_Articles [362]