Thomas M. Cover
IEEE Trans. Inf. Theory
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.
Thomas M. Cover
IEEE Trans. Inf. Theory
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002