The SALADIN project: summary report
ACM SIGSOFT Software Engineering Notes
Stochastic Process Algebra: From an Algebraic Formalism to an Architectural Description Language
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Symbolic semantic rules for producing compact STGLAs from value passing process descriptions
ACM Transactions on Computational Logic (TOCL)
A Framework to Support Survivable Web Services
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
| Hi-index | 0.00 |
Abstract: 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 脝MPA/TwoTowers.