A strategy for improving NetClust server placement for multicloud environments

In this paper, we propose a fast server placement algorithm to improve the NetClust framework and make it more efficient and exible. To this end, we introduce hierarchical clustering technologies to the NetClust framework and propose a exible server placement algorithm, which integrates the agglomerative and divisive clustering technologies to reduce the time complexity and avoid the performance uctuation affected by the initial node selection. The experiment results show that our server placement algorithm may reduce the time complexity of server selection of NetClust significantly and improve the exibility and applicability of the NetClust.

[1]  In Lee,et al.  The Internet of Things (IoT): Applications, investments, and challenges for enterprises , 2015 .

[2]  Weifa Liang,et al.  Efficient Algorithms for Capacitated Cloudlet Placements , 2016, IEEE Transactions on Parallel and Distributed Systems.

[3]  Jörg Sander.  Density-Based Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[4]  Athman Bouguettaya,et al.  Efficient agglomerative hierarchical clustering , 2015, Expert Syst. Appl..

[5]  Steven H. Low,et al.  High-density model for server allocation and placement , 2002, SIGMETRICS '02.

[6]  Bin Jiang,et al.  Clustering Uncertain Data Based on Probability Distribution Similarity , 2013, IEEE Transactions on Knowledge and Data Engineering.

[7]  Bu-Sung Lee,et al.  Optimal virtual machine placement across multiple cloud providers , 2009, 2009 IEEE Asia-Pacific Services Computing Conference (APSCC).

[8]  Ying Zhang,et al.  NetClust: A Framework for Scalable and Pareto-Optimal Media Server Placement , 2013, IEEE Transactions on Multimedia.

[9]  Deng Pan,et al.  Efficient VM placement with multiple deterministic and stochastic resources in data centers , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[10]  Qi Zhang,et al.  Dynamic Service Placement in Geographically Distributed Clouds , 2013, IEEE J. Sel. Areas Commun..

[11]  Guangxi Zhu,et al.  A suitable server placement for peer-to-peer live streaming , 2011, The Journal of Supercomputing.

[12]  Joan Serrat,et al.  Server placement and assignment in virtualized radio access networks , 2015, 2015 11th International Conference on Network and Service Management (CNSM).

[13]  S. Ahuja,et al.  Algorithms for Server Placement in Multiple-Description-Based Media Streaming , 2008, IEEE Transactions on Multimedia.

[14]  Arumugam Seetharaman,et al.  The usage and adoption of cloud computing by small and medium businesses , 2013, Int. J. Inf. Manag..

[15]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[16]  Shui Yu,et al.  An Adaptive Cloudlet Placement Method for Mobile Applications over GPS Big Data , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[17]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Ying Zhang,et al.  The freshman handbook: a hint for the server placement of social networks , 2011, WWW.

[19]  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).

[20]  Farahnaz Sadoughi,et al.  Ranked k-medoids: A fast and accurate rank-based partitioning algorithm for clustering large datasets , 2013, Knowl. Based Syst..

[21]  Jianliang Xu,et al.  Placement problems for transparent data replication proxy services , 2002, IEEE J. Sel. Areas Commun..

[22]  Shuai Jiang,et al.  A Simple and Fast Algorithm for Global K-means Clustering , 2010, 2010 Second International Workshop on Education Technology and Computer Science.

[23]  Esfandiar Eslami,et al.  On Hesitant Fuzzy Clustering and Clustering of Hesitant Fuzzy Data , 2017, Fuzzy Sets, Rough Sets, Multisets and Clustering.

[24]  Ron Shamir,et al.  A clustering algorithm based on graph connectivity , 2000, Inf. Process. Lett..

[25]  R. Sharan,et al.  CLICK: a clustering algorithm with applications to gene expression analysis. , 2000, Proceedings. International Conference on Intelligent Systems for Molecular Biology.

[26]  Roded Sharan,et al.  Center CLICK: A Clustering Algorithm with Applications to Gene Expression Analysis , 2000, ISMB.