ListarLSI_Articles por tema "Greedy scheduling protocols"
Mostrando ítems 1-1 de 1
-
Stability bounds in networks with dynamic link capacities
Elsevier (2008)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), ...