A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
We propose a new research direction to reinvigorate research into better understanding of the M/G/K and other queueing systems-via obtaining tight bounds on the mean waiting time as functions of the moments of the service distribution. Analogous to the classical Markov-Krein theorem, we conjecture that the bounds on the mean waiting time are achieved by service distributions corresponding to the upper/lower principal representations of the moment sequence. We present analytical, numerical, and simulation evidence in support of our conjectures. © 2011 Springer Science+Business Media, LLC.
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
B.K. Boguraev, Mary S. Neff
HICSS 2000
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking