Gal Badishi, Idit Keidar, et al.
IEEE TDSC
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.
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Thomas M. Cheng
IT Professional
Michael D. Moffitt
ICCAD 2009