Abstract
To cope with increasing number of clients and servers, content delivery networks (CDNs) desire a more efficient way to select servers from multiple data centers in different geographic locations. This paper presents a three-stage global optimization method for the server selection (OMSS) in CDNs, which jointly considers the service experience, load balancing, traffic control and overhead. OMSS first proposes a novel scalable network distance proximity algorithm for partitioning the servers and clients into different clusters, then finds a set of candidate servers and extracts the closest k servers. At last, OMSS proposes a global optimization function with taking into account load balancing and traffic control, and introduces a penalty coefficient to leverage the quality of service experience in terms of network delay and the traffic control in terms of inter-domain transit traffic. In order to comprehensively analyze the performance of OMSS, we use typical benchmarks to compare OMSS with traditional approaches on the one hand, and also perform statistical tests to display the improvement of OMSS on the other hand. As presented in the comparison table, OMSS not only achieves improved performance in both service experience and traffic control, but also enjoys less measurement and computation overhead.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adhikari VK, Jain S, Zhang Z (2012) Where do you tube? Uncovering you tube server selection strategy. In: IEEE ICCCN, 2012. doi:10.1109/2012.6006028
Agarwal S, Lorch JR (2009) Matchmaking for online games and other latency-sensitive p2p systems. In: SIGCOMM’09, Barcelona, Spain, 2009. doi:10.1145/2342356.2342370
Aggarwal V, Feldmann A, Scheideler C (2007) Can isps and p2p users cooperate for improved performance? In: ACM SIGCOMM communication review, vol 37, pp 29–40
Choffnes DR, Bustamante FE (2008) Taming the torrent: a practical approach to reducing cross-isp traffic in peer-to-peer systems. In: ACM SIGCOMM, Washington, USA, pp 363–374
De Oliveira TQ, Fernandez MP (2013) Fuzzy redirection algorithm for content delivery network (CDN). In: The twelfth international conference on networks, ICN, pp 137–143. doi:10.1109/AINA.2013.112
Dhamdhere A, Dovrolis C (2009) The internet is flat: modeling the transition from a transit hierarchy to a peering mesh. In: Proceedings of ACM CoNEXT, 2009
Ding C, Chen Y, Xu T, Fu X (2012) Cloudgps: a scalable and isp-friendly server selection scheme in cloud computing environments. In: The 2012 IEEE 20th international workshop on quality of service, 2012
Elmazi D, Kulla E, Oda T, Spaho E, Sakamoto S, Barolli L (2015) A comparison study of two fuzzy-based systems for selection of actor node in wireless sensor actor networks. J Ambient Intell Humaniz Comput. ISSN 1868–5145. doi:10.1007/s12652-015-0279-6
Field B, Van Doorn J, Hall J (2012) Integrating routing with content delivery networks. In the computer communications workshops, pp 292–297, 2012. doi:10.1109/2012.6193508
Intarapaiboon P (2015) A hierarchy-based similarity measure for intuitionistic fuzzy sets. Soft Comput. ISSN 1433–7479. doi:10.1007/s00500-015-1612-x
Labovitz C, Lekel-Johnson S, McPherson D, Oberheide J, Jahanian F (2010) Internet inter-domain traffic. In: ACM SIGCOMM 2010 conference on applications, technologies, architectures, and protocols for computer communications, 2010
Li J, Kim K (2010) Hidden attribute-based signatures without anonymity revocation. Inf Sci 180(9):1681–1689
Li J, Huang X, Li J, Chen X, Xiang Y (2012) Securely outsourcing attribute-based encryption with checkability. IEEE Trans Parallel Distrib Syst 25(8):2201–2210
Li J, Chen X, Li M, Li J, Lee P, Lou W (2014) Secure deduplication with efficient and reliable convergent key management. IEEE Trans Parallel Distrib Syst 25(6):1615–1625
Liao Y, Geurts P, Leduc G (2010) Internet inter-domain traffic. In: Network distance prediction based on decentralized matrix factorization. Networking 2010, Lecture Notes in Computer Science, vol 6091, pp 15–26. doi:10.1145/1851275.1851194
Liao Y, Wei D, Geurts P, Leduc G (2012) DMFSGD: a decentralized matrix factorization algorithm for network distance prediction. IEEE/ACM Trans Netw 21:1511–1524. doi:10.1109/2012.2228881
Lin M, Wierman A, Andrew LLH, Thereska E (2011) Dynamic rightsizing for power-proportional data centers. In: INFOCOM 2011. 30th IEEE international conference on computer communications, joint conference on of the IEEE Computer and Communications Societies, Shanghai, China, pp 10–15, 2011. doi:10.1145/164.1851194
Liu Z, Jia Z, Xue X, An J (2014) Securely outsourcing attribute-based encryption with checkability. Soft Comput 19(5):1409–1425. ISSN 1433–7479. doi:10.1007/s00500-014-1351-4
Maleki Dizaji S, Siddiqi J, Soltan-Zadeh Y, Rahman F (2014) Adaptive information retrieval system via modelling user behaviour. J Ambient Intell Humaniz Comput 5(1):105–110. doi:10.1007/s12652-012-0138-7
Poese I, Frank B, Knight S, Semmler N, Smaragdakis G (2010) Padis emulator: an emulator to evaluate CDN–ISP collaboration. In: SIGCOMM’ 12, vol 42, 2010. doi:10.1145/2342356.2342370
Qureshi A, Weber R, Balakrishnan H, Guttag J, Maggs B (2009) Cutting the electric bill for internet-scale systems. In: ACM SIGCOMM computer communication review, SIGCOMM’09, Barcelona, Spain, 2009. doi:10.1145/1592568.1592584
Wang Z, Wang R (2013) Optimizing dns server selection. Appl Math Inf Sci 6:2233–2240
Wendell P, Jiang JW, Freedman MJ, Rexford J (2010) Donar: decentralized server selection for cloud services. In: Proceedings of the ACM SIGCOMM 2010 conference on applications, technologies, architectures, and protocols for computer communications, 2010. doi:10.1145/1851182.1851211
Zhang R, Tang C, Hu YC, Fahmy S, Lin X (2006) Impact of the inaccuracy of distance prediction algorithms on internet applications-an analytical and comparative study. In: Proceedings of IEEE INFOCOM, pp 1–12, 2006
Acknowledgments
This work is supported by the National Key Project of Scientific and Technical Supporting Programs of China (Grant Nos. 2013BAH10F01, 2013BAH07F02, 2014BAH26F02); the Research Fund for the Doctoral Program of Higher Education (Grant No. 20110005120007); Beijing Higher Education Young Elite Teacher Project (Grant No. YETP0445); the Fundamental Research Funds for the Central Universities and Engineering Research Center of Information Networks, Ministry of Education.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Wang, T., Song, J. & Song, M. A three-stage global optimization method for server selection in content delivery networks. Soft Comput 21, 467–475 (2017). https://doi.org/10.1007/s00500-015-1797-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-015-1797-z