Optimised balancing algorithm for content delivery networks

In this study the authors present the ‘fictitiously starred optimised balancing’ (FSOB), a novel algorithm for load balancing in a content delivery network (CDN) scenario. FSOB exploits the multiple redirection mechanism of the HTTP protocol to optimally redistribute clients requests among the servers which build up the CDN. Load redistribution is aimed at equalising the level of occupancy of the server queues and is achieved through the periodical exchange of information computed locally at each node. The algorithm initially makes a fictitious assumption about the local topology of the network, as it is seen by each single server node, which looks at itself as the centre (i.e. the master) of a star made up of all of its neighbours (i.e. the slaves). Load redistribution is performed by the master which, if needed, appropriately redirects incoming requests to its slaves. The authors show how FSOB outperforms most of its competitors under a number of fundamental aspects, at the price of an increased overhead owing to the adoption of the multiple redirections mechanism for the redistribution phase. Finally, they study the scalability properties of FSOB and perform a comparative evaluation of its performance with respect to the most interesting existing solutions.

[1]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[2]  Philip S. Yu,et al.  The state of the art in locally distributed Web-server systems , 2002, CSUR.

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

[4]  Bharadwaj Veeravalli,et al.  Design and Performance Evaluation of Queue-and-Rate-Adjustment Dynamic Load Balancing Policies for Distributed Networks , 2006, IEEE Transactions on Computers.

[5]  Philip S. Yu,et al.  Analysis of Task Assignment Policies in Scalable Distributed Web-Server Systems , 1998, IEEE Trans. Parallel Distributed Syst..

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

[7]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Mark Crovella,et al.  Server selection using dynamic path characterization in wide-area networks , 1997, Proceedings of INFOCOM '97.

[9]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[10]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[11]  B. Bollobás The evolution of random graphs , 1984 .

[12]  Simon Pietro Romano,et al.  An extended ns-2 for validation of load balancing algorithms in Content Delivery Networks , 2010, SimuTools.

[13]  Daniel M. Dias,et al.  A scalable and highly available web server , 1996, COMPCON '96. Technologies for the Information Superhighway Digest of Papers.

[14]  Onur Altintas,et al.  Scalable request routing with next-neighbor load sharing in multi-server environments , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).