Efficient Content Distribution in Fog-Based CDN: A Joint Optimization Algorithm for Fog-Node Placement and Content Delivery

被引:5
作者
Yadav, Prateek [1 ]
Kar, Subrat [1 ]
机构
[1] Indian Inst Technol Delhi, Dept Elect Engn, New Delhi 110016, India
来源
IEEE INTERNET OF THINGS JOURNAL | 2024年 / 11卷 / 09期
关键词
Costs; Quality of service; Servers; Internet of Things; Edge computing; Content distribution networks; Delays; Content distribution network (CDN); fog-based content delivery network (fog-CDN); fog computing; Internet of Things (IoT) model; joint optimization;
D O I
10.1109/JIOT.2024.3355468
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Efficient content distribution to end-users poses a significant challenge in content distribution networks (CDNs). Traditional CDNs rely on cloud-based architectures, which may not be optimal for delivering content in densely populated areas due to increased network latency and bandwidth limitations. These problems can be mitigated by adopting fog/edge computing, which deploys computing nodes near end-users to reduce latency and improve content delivery. Although factors such as deployment and distribution are often considered separately, there are relatively few studies on how node deployment affects content distribution. Moreover, current research on fog-based content distribution networks (fog-based CDNs) does not often address formal methods for key challenges, such as (R1) optimal fog node placement; (R2) providing efficient content distribution to end-users; and (R3) minimizing the overall fog-based CDN cost. Therefore, we propose an algorithm to jointly optimize the placement of fog nodes and the content distribution, called the joint optimization algorithm for the fog-node placement and content distribution (JFnP-CDA). The algorithm uses a two-step procedure including clustering and Voronoi method, and nonlinear programming to optimize R1, R2, and R3. We consider four parameters for this: 1) a given geographical region; 2) locations of open public Wi-Fi access points (OPWAPs) in that region; 3) Quality of Service (QoS, with delivery in delay as the measure); and 4) cost to generate optimal service subregions (and, thereby, distribute content to edge-network hot spots). We evaluated the effectiveness of the proposal by implementing real-world OPWAP data, and the results show that the algorithm JFnP-CDA outperforms the baseline methods.
引用
收藏
页码:16578 / 16590
页数:13
相关论文
共 25 条
  • [1] Amin K, 2014, ADV NEUR IN, V27
  • [2] [Anonymous], 2013, WWW
  • [3] [Anonymous], 2017, C LEARNING THEORY
  • [4] [Anonymous], 2012, EC
  • [5] Improved rates for the stochastic continuum-armed bandit problem
    Auer, Peter
    Ortner, Ronald
    Szepesvari, Csaba
    [J]. LEARNING THEORY, PROCEEDINGS, 2007, 4539 : 454 - +
  • [6] Personalized Dynamic Pricing with Machine Learning: High-Dimensional Features and Heterogeneous Elasticity
    Ban, Gah-Yi
    Keskin, N. Bora
    [J]. MANAGEMENT SCIENCE, 2021, 67 (09) : 5549 - 5568
  • [7] Chen X, 2021, Arxiv, DOI arXiv:2101.01301
  • [8] Feature-Based Dynamic Pricing
    Cohen, Maxime C.
    Lobel, Ilan
    Leme, Renato Paes
    [J]. MANAGEMENT SCIENCE, 2020, 66 (11) : 4921 - 4943
  • [9] Online Network Revenue Management Using Thompson Sampling
    Ferreira, Kris Johnson
    Simchi-Levi, David
    Wang, He
    [J]. OPERATIONS RESEARCH, 2018, 66 (06) : 1586 - 1602
  • [10] Gao GJ, 2020, IEEE INFOCOM SER, P179, DOI [10.1109/infocom41043.2020.9155518, 10.1109/INFOCOM41043.2020.9155518]