Elliot Linzer, M. Vetterli
Computing
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.
Elliot Linzer, M. Vetterli
Computing
Pradip Bose
VTS 1998
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering