In this paper, we consider a variant of an M/M/c/c loss system with fluctuating server capacity. Given a set of primary inputs, such as arrival rate, service rate, and capacity fl...
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
Sandra G. Dykes, Kay A. Robbins, Clinton L. Jeffer...
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...
Idris A. Rai, Guillaume Urvoy-Keller, Mary K. Vern...
: AWAIT: Efficient Overload Management for Busy Multi-tier Web Services under Bursty Workloads Lei Lu, Ludmila Cherkasova, Vittoria de Nitto Persone, Ningfang Mi, Evgenia Smirn...
Lei Lu, Ludmila Cherkasova, Vittoria de Nitto Pers...
In order to provide a generic, applicationindependent and resource-efficient framework for server redundancy and session failover, the IETF RSerPool WG is currently standardizing ...