A novel server selection method to achieve delay-based fairness in the server palm

Authors:
Young-Tae Han;Min-Gon Kim;Hong-Shik Park
Affiliations:
Dept. of Information and Communications, Korea Advanced Institute of Science and Technology, Daejeon, S. Korea;Public & Original Technology Research Center, DGIST, Daegu, S. Korea;Dept. of Information and Communications, Korea Advanced Institute of Science and Technology, Daejeon, S. Korea
Venue:
IEEE Communications Letters
Year:
2009

Citing 3
Cited 0

Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Application-layer anycasting: a server selection architecture and use in a replicated Web service

IEEE/ACM Transactions on Networking (TON)
Passive estimation of TCP round-trip times

ACM SIGCOMM Computer Communication Review

Quantified Score

Hi-index	0.00

Visualization

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 (D3RR) scheme. The deficit counter of the D3RR 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.