Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
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.
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
M.F. Cowlishaw
IBM Systems Journal
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996