A Novel Server Selection Method to Achieve Delay-Based Fairness in the Server Palm

Abstract

It is pivotal to achieve delay-based fairness when users access the same content, especially in real-time services, from content-replicated servers based upon the client-server communication model. To resolve this issue, this letter proposes a novel server selection method of providing users with delay-based fairness from all the corresponding servers by applying the delay-based dynamic deficit round robin (D(3)RR) scheme. The deficit counter of the D(3)RR is adjusted based upon round trip times (RTTs) of data traffic measured by passive-based probing which ensures low resource waste. Performance evaluation results highlight that the delay variance among all the corresponding servers can be maintained as low as possible and delay-based fairness is guaranteed without unnecessary waste of resources.