We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A simulation analysis of dynamic server selection algorithms for replicated Web services

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Bernardo, M. ; Dipt. di Inf., Torino Univ., Italy

A practical approach to the provision of responsive Web services is based on introducing redundancy in the service implementation by replicating the service across a number of servers geographically distributed over the Internet. In this paper we compare the user perceived performance of three dynamic server selection algorithms operating at the client side, in order to provide some guidelines for adopting an algorithm that is appropriate for a given scenario. All the three algorithms use small probes to assess the network congestion and the server load before making a decision. The first algorithm downloads the whole requested Web page from a single server while the other two algorithms concurrently download different pieces of the same requested Web page from different servers. The analysis is conducted via simulation with AEMPA/TwoTowers

Published in:

Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2001. Proceedings. Ninth International Symposium on

Date of Conference: