Parametric-Decomposition Based Request Routing in Content Delivery Networks

  • Tuğçe BilenEmail author
  • Dinçer Salih Kurnaz
  • Serkan Sevim
  • Berk Canberk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10866)


Content Delivery Networks (CDNs) enable the rapid web service access by meeting the client requests using the optimal surrogate server located at their nearby. However, the optimal surrogate server can suddenly be overloaded by the spiky characteristics of the high-bandwidth client requests. This accumulates both the drop rates and response times of the client requests. To solve these problems and balance the load on surrogate servers, we propose a Parametric-Decomposition based request routing at the surrogate servers in CDNs. With the Parametric Decomposition method, we combine the high-bandwidth client requests on origin server with our proposed Superposition and Queuing procedures. Then, we split these requests into more than one surrogate server through proposed Splitting and Adjustment procedures. We model the origin and surrogate servers based on G/G/1 queuing system to determine the load status. In case of high congestion on the origin server, we split client requests to the different surrogate servers instead of selecting one. The split sizes of whole content are adjusted by defining a novel splitter index parameter based on the queuing load and waiting time of surrogate servers. The results reveal that the proposed strategy reduces the load on surrogate servers by 42% compared to the conventional approaches. Moreover, the latency and request drops are decreased by 44% and 57% compared to the conventional approaches, respectively.


Content Delivery Networks Load balancing Request routing Queuing theory 


  1. 1.
    Pathan, A., Buyya, R.: A taxonomy and survey of content delivery networks. Technical report, GRIDS-TR-2007-4, February 2007Google Scholar
  2. 2.
    Bilen, T., Canberk, B., Chowdhury, K.R.: Handover management in software-defined ultra-dense 5G networks. IEEE Netw. 31(4), 49–55 (2017)CrossRefGoogle Scholar
  3. 3.
    Flach, T., et al.: Reducing web latency: the virtue of gentle aggression. In: Proceedings of the ACM Conference of the Special Interest Group on Data Communication (SIGCOMM 2013) (2013)Google Scholar
  4. 4.
    Jia, Q., Xie, R., Huang, T., Liu, J., Liu, Y.: The collaboration for content delivery and network infrastructures: a survey. IEEE Access 5, 18 088–18 106 (2017)CrossRefGoogle Scholar
  5. 5.
    Manfredi, S., Oliviero, F., Romano, S.P.: A distributed control law for load balancing in content delivery networks. IEEE/ACM Trans. Netw. 21(1), 55–68 (2013)CrossRefGoogle Scholar
  6. 6.
    Dahlin, M.: Interpreting stale load information. IEEE Trans. Parallel Distrib. Syst. 11(10), 1033–1047 (2000)CrossRefGoogle Scholar
  7. 7.
    Carter, R.L., Crovella, M.E.: Server selection using dynamic path characterization in wide-area networks. In: INFOCOM 1997, Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, Proceedings IEEE, vol. 3, April 1997, pp. 1014–1021 (1997)Google Scholar
  8. 8.
    Mitzenmacher, M.: The power of two choices in randomized load balancing. IEEE Trans. Parallel Distrib. Syst. 12(10), 1094–1104 (2001)CrossRefGoogle Scholar
  9. 9.
    Khare, V., Zhang, B.: CDN request routing to reduce network access cost. In: 37th Annual IEEE Conference on Local Computer Networks, October 2012Google Scholar
  10. 10.
    Kee, H.S., Lau, P.Y., Park, S.K.: Peered-CDN through request routing peering system for video-on-demand. In: 2013 13th International Symposium on Communications and Information Technologies (ISCIT), September 2013, pp. 66–71 (2013)Google Scholar
  11. 11.
    Arumaithurai, M., Seedorf, J., Paragliela, G., Pilarski, M., Niccolini, S.: Evaluation of ALTO-enhanced request routing for CDN interconnection. In: 2013 IEEE International Conference on Communications (ICC), June 2013, pp. 3519–3524 (2013)Google Scholar
  12. 12.
    Fan, Q., Yin, H., Jiao, L., Lv, Y., Huang, H., Zhang, X.: Towards optimal request mapping and response routing for content delivery networks. IEEE Trans. Serv. Comput. PP(99), 1 (2018)Google Scholar
  13. 13.
    Gross, D., Shortle, J.F., Thompson, J.M., Harris, C.M.: Fundamentals of Queueing Theory, 4th edn. Wiley-Interscience, New York (2008)CrossRefGoogle Scholar
  14. 14.
    Cece, F., Formicola, V., Oliviero, F., Romano, S.P.: An extended ns-2 for validation of load balancing algorithms in content delivery networks. In: 2010 Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques, pp. 32:1–32:6 (2010)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2018

Authors and Affiliations

  • Tuğçe Bilen
    • 1
    Email author
  • Dinçer Salih Kurnaz
    • 2
  • Serkan Sevim
    • 2
  • Berk Canberk
    • 1
  1. 1.Department of Computer Engineering, Faculty of Computer and InformaticsIstanbul Technical UniversityIstanbulTurkey
  2. 2.MedianovaIstanbulTurkey

Personalised recommendations