Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is defined to be stable if the number of packets stays bounded over time. A central question is to determine which adversarial queueing networks are stable under-every work-conserving packet routing policy. Our main result is that stability of an adversarial queueing network is implied by stability of an associated fluid queueing network.
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008