Lijian ZOU, Xiaowen TONG, Xiaoqun YUAN, Bo HUANG

A stable marriage-based request routing framework for interconnection CDNs

Content delivery network (CDN) interconnection is a promising solution to addressing the limited service scale of CDNs. It scales the CDN s service footprint through the cooperation of CDNs without significantly changing the existing network architecture. However, in a CDN interconnection system, CDNs are independent of each other and each pursues its own goals, which means that cooperation is hard to establish and easy to break. In our paper, we propose a stable marriage-based routing framework to establish a strong cooperation service for CDNs and to select the optimal server for each request among the cooperative CDNs. To this end, we first investigate the relationship between the service cost and the service profit of CDN interconnection, and we design a price determination strategy to ensure the economic interests of each cooperative CDN, which is helpful in establishing a stable CDN cooperation service. Then we propose a dynamic request routing strategy to select the optimal server for each end user request by applying the stable match theory. This strategy is helpful in scaling the CDN service footprints with guaranteed service quality and in gaining more profit with lower service costs. The simulation results show that our frameworks can scale the CDN s service footprints with guaranteed service quality and gain more services without increasing service costs. Furthermore, our frameworks are win-win request routing frameworks because they help the upstream CDN of the CDN interconnection to increase service profit without increasing its cost. Moreover, they help the downstream CDNs of the CDN interconnection to gain extra revenue by using their idle resources.

PDF

___

[1] Pallis G, Vakali A. Insight and perspectives for content delivery networks. Commun ACM 2006; 49: 101-106.
[2] Vakali A, Pallis G. Content delivery networks: status and trends. IEEE Internet Comput 2003; 7: 68-74.
[3] Pacifici V, Dan G. Distributed algorithms for content allocation in interconnected content distribution networks. In: IEEE 2015 Computer Communications and Networks Conference; 26 April1 May 2015; Kowloon, Hong Kong. New York, NY, USA: IEEE. pp. 2362-2370.
[4] Durillo JJ, Prodan R, Barbosa JG. Pareto tradeoff scheduling of workflows on federated commercial clouds. Simul Model Pract Th 2015; 58: 95-111.
[5] Niven-Jenkins B, Faucheur FL, Bitar N. Content Distribution Network Interconnection (CDNI) Problem Statement. Freemont, CA, USA: Internet Engineering Task Force, 2012.
[6] Gonzalez JL, Perez JC, Sosa-Sosa VJ, Sanchez LM, Bergua B. SkyCDS: A resilient content delivery service based on diversified cloud storage. Simul Model Pract Th 2015; 54: 64-85.
[7] Woo H, Han S, Heo E, Kim J, Shin S. A virtualized, programmable content delivery networks. In: IEEE 2014 Mobile Cloud Computing, Services, and Engineering Conference; 811 April 2014; Oxford, UK. New York, NY,USA: IEEE. pp. 159-168.
[8] Heo K, Jung I, Yoon C. A study of enhancement in virtual content distribution network. In: IEEE 2014 Information Science and Applications Conference; 69 May 2014; Seoul, South Korea. New York, NY, USA: IEEE. pp. 1-5.
[9] Pathan AMK, Buyya R. A taxonomy and survey of content delivery networks. Lect Notes Electr En 2008; 9: 33-77.
[10] Kiesel S, Previdi S, Stiemerling M, Woundy R, Yang Y. Application-Layer Traffic Optimization (ALTO) Requirements. Freemont, CA, USA: Internet Engineering Task Force, 2012.
[11] Adhikari VK, Jain S, Ranjan G, Zhang ZL. Understanding data-center driven content distribution. In: ACM 2010 CoNEXT Student Workshop; 30 November3 December 2010; Philadelphia, PA, USA. New York, NY, USA: ACM.pp. 1-4.
[12] Pathan M, Buyya R. Resource discovery and request-redirection for dynamic load sharing in multi-provider peering content delivery networks. J Netw Comput Appl 2009; 32: 976-990.
[13] Seedorf J. CDNI Request Routing with ALTO. Freemont, CA, USA: Internet Engineering Task Force, 2013.
[14] Chen J, Zou L, Yuan X. An economic service strategy for cloud computing collaboration. J Comput Inform Syst 2015; 11: 3891-3902.