Latency Minimization Through Optimal Data Placement in Fog Networks

@inproceedings{Wang2020LatencyMT,
  title={Latency Minimization Through Optimal Data Placement in Fog Networks},
  author={N. Wang and Jie Wu},
  year={2020}
}
  • N. Wang, Jie Wu
  • Published 2020
  • Computer Science
  • Nowadays, Fog Networks (FNs) distribute services to fog servers so that they are spatially closer to end-users and thus provide high availability and low data access delay, i.e., better usage experience. Given the different data demands of users and limited storage capacity of fog servers in FNs, it is non-trivial to optimally store data. Specifically, in this paper, we discuss the Multiple Data placement with Budget Problem (MDBP), whose objective is to minimize the overall data access latency… CONTINUE READING

    References

    SHOWING 1-10 OF 23 REFERENCES
    Rethinking CDN design with distributee time-varying traffic demands
    • 14
    Practical Resource Provisioning and Caching with Dynamic Resilience for Cloud-Based Content Distribution Networks
    • 52
    • PDF
    The cache location problem
    • 403
    • PDF
    A Survey on Replica Server Placement Algorithms for Content Delivery Networks
    • 61
    • PDF
    Distributed Caching Algorithms for Content Distribution Networks
    • 377
    • PDF
    Dynamic application placement in the Mobile Cloud Network
    • 45
    • PDF
    Tradeoffs in CDN designs for throughput oriented traffic
    • 35
    • PDF
    Optimal Content Placement for a Large-Scale VoD System
    • 83
    Minimizing the Subscription Aggregation Cost in the Content-Based Pub/Sub System
    • Ning Wang, J. Wu
    • Computer Science
    • 2016 25th International Conference on Computer Communication and Networks (ICCCN)
    • 2016
    • 3
    • PDF
    Placement problems for transparent data replication proxy services
    • 106
    • PDF