Qing FANG, Xiaoqun YUAN, Yuting ZHAO, Jinhong LIU, Llifang XU, Changlai DU

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 signi cantly and improve the exibility and applicability of the NetClust.

PDF

___

[1] Li B, Golin MJ, Italiano GF, Deng X, Sohraby K. On the optimal placement of web proxies in the Internet. Int Fed Info Proc 1998; 8: 485-495.
[2] Yuan X, Yin H, Min G, Liu X, Hui W, Zhu G. A suitable server placement for peer-to-peer live streaming. J Supercomput 2013; 64: 1092-1107.
[3] Yin H, Zhang X, Zhan T, Zhang Y, Min G, Wu DO. NetClust: A framework for scalable and pareto-optimal media server placement. IEEE T Multimedia 2013; 8: 2114-2124.
[4] Lee I, Lee K. The Internet of things (IoT): applications, investments, and challenges for enterprises. Bus Horizons 2015; 58: 431-440.
[5] Gupta P, Seetharaman A, Raj JR. The usage and adoption of cloud computing by small and medium businesses. Int J Inform Manage 2013; 5: 861-874.
[6] Cronin E, Jamin S, Jin C, Kurc AR, Raz D, Shavitt Y. Constrained mirror placement on the Internet. In: IEEE 2001 International Conference on Computer Communication; 22{26 April 2001; Anchorage, AK, USA. New York, NY, USA: IEEE. pp. 1369-1382.
[7] Cameron CW, Low SH, Wei DX. High-density model for server allocation and placement. Perf E R SI 2002; 30: 152-159.
[8] Xu J, Li B, Lee DL. Placement problems for transparent data replication proxy services. IEEE J Sel Area Comm 2002; 20: 1383-1398.
[9] Ahuja S, Krunz M. Algorithms for server placement in multiple description-based media streaming. IEEE T Multimedia 2008; 7: 1382-1392.
[10] Zhang Y, Tatipamula M. The freshman handbook: a hint for the server placement of social networks. In: IEEE 2012 International Conference on Parallel and Distributed Systems; 17{19 December 2012; Singapore. New York, NY, USA: IEEE. pp. 173-174.
[11] Chaisiri S, Lee BS, Niyato D. Optimal virtual machine placement across multiple cloud providers. In: IEEE 2009 Asia-Paci c Services Computing Conference; 7{11 December 2009; Singapore. New York, NY, USA: IEEE. pp. 103-110.
[12] Zhang Q, Zhu Q, Zhani MF. Dynamic service placement in geographically distributed clouds. IEEE J Sel Area Comm 2013; 12: 762-772.
[13] Jin H, Pan D, Jing X. Efficient VM placement with multiple deterministic and stochastic resources in data centers. In: IEEE 2012 Global Communication Conference; 3{7 December 2012; Anaheim, CA, USA. New York, NY, USA: IEEE. pp. 2505-2510.
[14] Mijumbi R, Serrat J, Gorricho JL, Rubio-Loyola J, Davy S. Server placement and assignment in virtualized radio access networks. In: IEEE 2015 International Conference on Network and Service Management; 9{13 November 2015; Barcelona, Spain. New York, NY, USA: IEEE. pp. 398-401.
[15] Xu Z, Liang W, Xu W, Jia M, Guo S. Efficient algorithms for capacitated cloudlet placements. IEEE T Parall Distr 2016; 27: 2866-2880.
[16] Xiang H, Xu X, Zheng H, Li S, Wu T, Dou W, Yu S. An adaptive cloudlet placement method for mobile applications over GPS big data. In: IEEE 2016 Global Communication Conference; 4{8 December 2016; Washington, DC, USA. New York, NY, USA: IEEE. pp. 1-6.
[17] Bouguettaya A, Yu Q, Liu X, Zhou X, Song A. Efficient agglomerative hierarchical clustering. Expert Syst Appl 2015; 42: 2785-2797.
[18] Bin J, Jian P, Yufei T, Xuemin L. Clustering uncertain data based on probability distribution similarity. IEEE T Knowl Data En 2013; 4: 751-763.
[19] Zadegan SMR, Mirzaie M, Sadoughi F. Ranked k-medoids: a fast and accurate rank-based partitioning algorithm for clustering large datasets. Knowl-Based Syst 2013; 39: 133-143.
[20] Xie J, Jiang S. A simple and fast algorithm for global K-means clustering. In: 2010 2nd International Workshop on Education Technology and Computer Science; 6{7 March 2010; Wuhan, China. New York, NY, USA: IEEE. pp. 36-40.
[21] Aliahmadipour L, Torra V, Eslami E. On Hesitant Fuzzy Clustering and Clustering of Hesitant Fuzzy Data. Fuzzy Sets. New York, NY, USA: Springer, 2017.
[22] Hartuv E, Shamir R. A clustering algorithm based on graph connectivity. Inform Process Lett 2000; 76: 175-181.
[23] Kriegel H, Kroger P, Sander J, Zimek A. Density-based clustering. WIRES Data Min Knowl 2011; 1: 231-240.
[24] Sharan R, Shamir R. Center click: a clustering algorithm with applications to gene expression analysis. In: International Conference on Intelligent Systems for Molecular Biology; 19{23 August 1999; San Diego, CA, USA. Cambridge, MA, USA: MIT Press. pp. 307-316.
[25] Jain AK, Murty MN, Flynn PJ. Data clustering: a review. ACM Comput Surv 1999; 31: 264-323.