Least load dispatching algorithm for parallel Web server nodes

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)22_Publication in policy or professional journal

9 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)223-226
Journal / PublicationIEE Proceedings: Communications
Volume149
Issue number4
Publication statusPublished - Aug 2002

Abstract

A least load dispatching algorithm for distributing requests to parallel Web server nodes is described. In this algorithm, the load offered to a node by a request is estimated based on the expected transfer time of the corresponding reply through the Internet. This loading information is then used by the algorithm to identify the least load node of the Web site. By using this algorithm, each request will always be sent for service at the earliest possible time. Performance comparison using NASA and ClarkNet access logs between the proposed algorithm and commonly used dispatching algorithms is performed. The results show that the proposed algorithm gives 10% higher throughput than that of the commonly used random and round-robin dispatching algorithms.

Citation Format(s)

Least load dispatching algorithm for parallel Web server nodes. / Yeung, K. H.; Suen, K. W.; Wong, K. Y.

In: IEE Proceedings: Communications, Vol. 149, No. 4, 08.2002, p. 223-226.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)22_Publication in policy or professional journal