Autonomic Request Management Algorithms for Geographically Distributed Internet-Based Systems

Supporting Web-based services through geographical distributed clusters of servers is a common solution to the increasing volume and variability of modern traffic. These architectures pose interesting challenges to request management strategies where the most important goal is not to achieve maximum performance, but to guarantee stable and robust results. In this paper, we propose novel request management algorithms that are based on autonomic principles that is, on loose collaboration among the closest nodes and no knowledge about the global system state. Experimental evaluation shows that our autonomic-enhanced algorithms can guarantee robust performance in a variety of settings and reduce standard deviations of the response times with respect to existing request management algorithms.

[1]  Michael Dahlin Interpreting Stale Load Information , 2000, IEEE Trans. Parallel Distributed Syst..

[2]  Jon B. Weissman,et al.  A new metric for robustness with application to job scheduling , 2005, HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005..

[3]  John F. Meyer,et al.  On Evaluating the Performability of Degradable Computing Systems , 1980, IEEE Transactions on Computers.

[4]  Bruce M. Maggs,et al.  Globally Distributed Content Delivery , 2002, IEEE Internet Comput..

[5]  Mikko H. Lipasti,et al.  An architectural evaluation of Java TPC-W , 2001, Proceedings HPCA Seventh International Symposium on High-Performance Computer Architecture.

[6]  Gustavo Alonso,et al.  GlobeDB: autonomic data replication for web applications , 2005, WWW '05.

[7]  Erica Jen,et al.  Stable or robust? What's the difference? , 2003, Complex..

[8]  San-qi Li,et al.  A predictability analysis of network traffic , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Robert H. Storer,et al.  Robustness Measures and Robust Scheduling for Job Shops , 1994 .

[10]  Michael Dahlin,et al.  Engineering web cache consistency , 2002, TOIT.

[11]  Ladislau Bölöni,et al.  Robust scheduling of metaprograms , 2002 .

[12]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[13]  Carey Williamson,et al.  Achieving Load Balance and Efiective Caching in Clustered Web Servers , 1999 .

[14]  Kishor S. Trivedi,et al.  Performability Analysis: Measures, an Algorithm, and a Case Study , 1988, IEEE Trans. Computers.

[15]  Hui Zhang,et al.  A Network Positioning System for the Internet , 2004, USENIX Annual Technical Conference, General Track.

[16]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[17]  Paul Barford,et al.  Critical path analysis of TCP transactions , 2001, TNET.

[18]  J. Christopher Beck,et al.  Slack-based Techniques for Robust Schedules , 2014 .

[19]  Ishfaq Ahmad,et al.  Continuous Replica Placement schemes in distributed systems , 2005, ICS '05.

[20]  Philip S. Yu,et al.  Request Redirection Algorithms for Distributed Web Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[21]  Guillaume Pierre,et al.  Globule: a collaborative content delivery network , 2006, IEEE Communications Magazine.

[22]  Michele Colajanni,et al.  Models and framework for supporting runtime decisions in Web-based systems , 2008, TWEB.

[23]  G. Pierre,et al.  Predictability of Web-server traffic congestion , 2005, 10th International Workshop on Web Content Caching and Distribution (WCW'05).

[24]  Pascal Felber,et al.  Proactive hot spot avoidance for Web server dependability , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..

[25]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, SIGMETRICS '02.

[26]  Michal Szymaniak,et al.  Replication for web hosting systems , 2004, CSUR.