New replica server placement strategies using clustering algorithms and SOM neural network in CDNs

Many service providers distribute various kinds of content over the internet. Content Distribution Networks (CDNs) use replication of either entire website or most used objects to bring content close to the users and improve communication delay. In order to deliver web contents, CDNs should decide where to place replica servers and how many replicas are needed. In this paper, a linear programming formulation for web server replica placement has been provided. We also present new algorithms using K-means, Fuzzy c-means clustering and Self-Organizing Maps (SOM) Neural network to place web server replicas. Our objective is to find best replica server sites, which minimize distance between replicas and clientsto keep replicas. We compare our algorithms with Greedy algorithm. We have considerable enhancement in terms of load balancing and Runtime.

[1]  Chien-Hsing Chou,et al.  Fuzzy C-Means Algorithm with a Point Symmetry Distance , 2006 .

[2]  Osama Abu Abbas,et al.  Comparisons Between Data Clustering Algorithms , 2008, Int. Arab J. Inf. Technol..

[3]  Esa Alhoniemi,et al.  Clustering of the self-organizing map , 2000, IEEE Trans. Neural Networks Learn. Syst..

[4]  Gustavo de los Reyes,et al.  The Security Cost of Content Distribution Network Architectures , 2011, 2011 IEEE 35th Annual Computer Software and Applications Conference Workshops.

[5]  Kala Karun,et al.  Recent Replica Placement Algorithms in P2P Networks - A Review , 2013 .

[6]  Sueli Aparecida Mingoti,et al.  Comparing SOM neural network with Fuzzy c , 2006, Eur. J. Oper. Res..

[7]  Renato Cordeiro de Amorim,et al.  Minkowski metric, feature weighting and anomalous cluster initializing in K-Means clustering , 2012, Pattern Recognit..

[8]  G. Lokesh,et al.  A Priori Data Replica Placement Strategy in Grid Computing , 2013 .

[9]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[10]  Ishfaq Ahmad,et al.  Comparison and analysis of ten static heuristics-based Internet data replication techniques , 2008, J. Parallel Distributed Comput..

[11]  M. D. Samrajesh,et al.  Context-Aware Replica Placement in Peer-to-Peer Overlay Networks , 2013 .

[12]  Constantine Kotropoulos,et al.  Assessment of self-organizing map variants for clustering with application to redistribution of emotional speech patterns , 2007, Neurocomputing.

[13]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Yutaka Arakawa,et al.  Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor , 2011, J. Comput. Networks Commun..

[15]  Jorma Laaksonen,et al.  Variants of self-organizing maps , 1990, International 1989 Joint Conference on Neural Networks.

[16]  Lúcia Maria de A. Drummond,et al.  Solving Replica Placement and Request Distribution in Content Distribution Networks , 2010, Electron. Notes Discret. Math..

[17]  Masato Asahara,et al.  Strategy for Selecting Replica Server Spots on the Basis of Demand Fluctuations , 2008 .

[18]  Novella Bartolini,et al.  Optimal dynamic replica placement in content delivery networks , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..

[19]  Safia Nait Bahloul,et al.  Privacy preserving k-means clustering: a survey research , 2012, Int. Arab J. Inf. Technol..

[20]  Catalin Calistru,et al.  The Role of Content Distribution Networks in the Future Media Networks , 2012 .

[21]  Anthony A. Maciejewski,et al.  Robust CDN replica placement techniques , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[22]  Holly E. Rushmeier,et al.  A Scalable Parallel Algorithm for Self-Organizing Maps with Applications to Sparse Data Mining Problems , 1999, Data Mining and Knowledge Discovery.

[23]  Sebastián Lozano,et al.  Parallel Fuzzy c-Means Clustering for Large Data Sets , 2002, Euro-Par.

[24]  James C. Bezdek,et al.  Efficient Implementation of the Fuzzy c-Means Clustering Algorithms , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  Samee Ullah Khan,et al.  Server Replication in Multicast Networks , 2012, 2012 10th International Conference on Frontiers of Information Technology.

[26]  Xi Fang,et al.  ESPN: Efficient server placement in probabilistic networks with budget constraint , 2011, 2011 Proceedings IEEE INFOCOM.

[27]  Shalini S Singh,et al.  K-means v/s K-medoids: A Comparative Study , 2011 .

[28]  Pavlin Radoslavov,et al.  Topology-informed Internet replica placement , 2002, Comput. Commun..

[29]  Leonidas Georgiadis,et al.  Replicated Server Placement with QoS Constraints , 2005, IEEE Transactions on Parallel and Distributed Systems.

[30]  Michal Szymaniak,et al.  Latency-driven replica placement , 2005, The 2005 Symposium on Applications and the Internet.

[31]  Olga Kurasova,et al.  Visual analysis of self-organizing maps , 2011 .

[32]  Wang,et al.  Degree-Based Replica Placement Algorithms for P2P Data Grids , 2010 .

[33]  Yves Robert,et al.  Power-Aware Replica Placement and Update Strategies in Tree Networks , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[34]  Pawan Kumar,et al.  Comparative Analysis of FCM and HCM Algorithm on Iris Data Set , 2010 .

[35]  Lutgarde M. C. Buydens,et al.  Self- and Super-organizing Maps in R: The kohonen Package , 2007 .