Redundancy with Processor Sharing servers

摘要

The main motivation to investigate redundancy models comes from empirical evidence suggesting that redundancy can help improve the performance of real-world applications. Under redundancy, a job that arrives to this system is dispatched to d servers uniformly chosen at random in order to benefit from the variability of the length of these queues. As soon as one of the copies finishes service, the job (and its copies) is removed from the system, and as a consequence, a job's delay is given by the minimum delay among the servers its copies are sent to.