A Characterization of universal stability for directed graphs in the adversarial queueing model
Document typeResearch report
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
In this paper we provide a characterization of universal stability for digraphs in the general case that the packets are not restricted to follow simple paths. Furthermore, we consider a variation of the Nearest To Go protocol and we show that stability under this queueing policy is equivalent to universal stability.
CitationAlvarez, C., Blesa, M., Serna, M. "A Characterization of universal stability for directed graphs in the adversarial queueing model". 2002.
Is part ofLSI-02-04