Selection algorithms for replicated web servers

Mehmet Saya; Yuri Breitbart; Peter Scheuermann; Radek Vingralek

doi:10.1145/306225.306238

Selection algorithms for replicated web servers

Mehmet Saya^*, Yuri Breitbart, Peter Scheuermann, Radek Vingralek

^*Corresponding author for this work

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

50 Scopus citations

Abstract

Replication of documents on geographically distributed servers can improve both performance and reliability of the Web service. Server selection algorithms allow Web clients to select one of the replicated servers which is "close" to them and thereby minimize the response time of the Web service. Using client proxy server traces, we compare the effectiveness of several "proximity" metrics including the number of hops between the client and server, the ping round trip time and the HTTP request latency. Based on this analysis, we design two new algorithms for selection of replicated servers and compare their performance against other existing algorithms. We show that the new server selection algorithms improve the performance of other existing algorithms on the average by 55%. In addition, the new algorithms improve the performance of the existing non-replicated Web servers on average by 69%.

Original language	English (US)
Pages (from-to)	44-50
Number of pages	7
Journal	Performance Evaluation Review
Volume	26
Issue number	3
DOIs	https://doi.org/10.1145/306225.306238
State	Published - Dec 1998

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/306225.306238

Cite this

@article{768ca96515b5451ca74662944b745dbc,

title = "Selection algorithms for replicated web servers",

abstract = "Replication of documents on geographically distributed servers can improve both performance and reliability of the Web service. Server selection algorithms allow Web clients to select one of the replicated servers which is {"}close{"} to them and thereby minimize the response time of the Web service. Using client proxy server traces, we compare the effectiveness of several {"}proximity{"} metrics including the number of hops between the client and server, the ping round trip time and the HTTP request latency. Based on this analysis, we design two new algorithms for selection of replicated servers and compare their performance against other existing algorithms. We show that the new server selection algorithms improve the performance of other existing algorithms on the average by 55%. In addition, the new algorithms improve the performance of the existing non-replicated Web servers on average by 69%.",

author = "Mehmet Saya and Yuri Breitbart and Peter Scheuermann and Radek Vingralek",

year = "1998",

month = dec,

doi = "10.1145/306225.306238",

language = "English (US)",

volume = "26",

pages = "44--50",

journal = "Performance Evaluation Review",

issn = "0163-5999",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

T1 - Selection algorithms for replicated web servers

AU - Saya, Mehmet

AU - Breitbart, Yuri

AU - Scheuermann, Peter

AU - Vingralek, Radek

PY - 1998/12

Y1 - 1998/12

N2 - Replication of documents on geographically distributed servers can improve both performance and reliability of the Web service. Server selection algorithms allow Web clients to select one of the replicated servers which is "close" to them and thereby minimize the response time of the Web service. Using client proxy server traces, we compare the effectiveness of several "proximity" metrics including the number of hops between the client and server, the ping round trip time and the HTTP request latency. Based on this analysis, we design two new algorithms for selection of replicated servers and compare their performance against other existing algorithms. We show that the new server selection algorithms improve the performance of other existing algorithms on the average by 55%. In addition, the new algorithms improve the performance of the existing non-replicated Web servers on average by 69%.

AB - Replication of documents on geographically distributed servers can improve both performance and reliability of the Web service. Server selection algorithms allow Web clients to select one of the replicated servers which is "close" to them and thereby minimize the response time of the Web service. Using client proxy server traces, we compare the effectiveness of several "proximity" metrics including the number of hops between the client and server, the ping round trip time and the HTTP request latency. Based on this analysis, we design two new algorithms for selection of replicated servers and compare their performance against other existing algorithms. We show that the new server selection algorithms improve the performance of other existing algorithms on the average by 55%. In addition, the new algorithms improve the performance of the existing non-replicated Web servers on average by 69%.

UR - http://www.scopus.com/inward/record.url?scp=0002395452&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0002395452&partnerID=8YFLogxK

U2 - 10.1145/306225.306238

DO - 10.1145/306225.306238

M3 - Article

AN - SCOPUS:0002395452

SN - 0163-5999

VL - 26

SP - 44

EP - 50

JO - Performance Evaluation Review

JF - Performance Evaluation Review

IS - 3

ER -

Selection algorithms for replicated web servers

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this