Edge Cache-Based ISP-CP Collaboration Scheme for Content Delivery Services

Hu, Yao; Wang, Zhuwei; Si, Pengbo; Chen, Yixin; Wang, Xiaodong; Yu, F. Richard

doi:10.1109/access.2018.2889787

Cited by 6 publications

(1 citation statement)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [6], Fang et al theoretically analyze the collaboration framework between ISPs and CSPs in content delivery services, taking into account the impact of content popularity and edge caching. The proposed formulation aims at maximizing the network profit considering both offline and online caching strategies.…”

Section: A Cache Sharing Without Network Neutralitymentioning

confidence: 99%

Network Neutrality in Content Cache Sharing: A Bankruptcy Problem Formulation

Antonopoulos

Mekikis

Kartsakli

2021

ICC 2021 - IEEE International Conference on Communications

View full text Add to dashboard Cite

The deployment of fifth generation (5G) mobile networks along with the massive penetration of multimedia applications render the edge cache capacity a valuable but limited network resource. Edge caching has been lately widely adopted, as it can bring to the network important benefits, such as better network utilization and higher Quality of Experience (QoE). However the cache sharing among different Content Service Providers (CSPs) is a non-trivial problem due to: i) the limited nature of cache resources, and ii) the network neutrality concept that requires equal treatment of the CSPs. In this paper, we study the cache sharing problem in the presence of multiple CSPs, focusing both on the fairness and the network performance. Taking into account the importance of network neutrality and the scarcity of the cache resources, we formulate the cache sharing as a bankruptcy problem and we propose a set of different approaches for its solution. The performance of the proposed approaches is assessed through a series of simulation experiments in different scenarios (i.e., assuming different popularity distributions and market shares), identifying the potential trade-offs.

show abstract

Section: A Cache Sharing Without Network Neutralitymentioning

confidence: 99%

Network Neutrality in Content Cache Sharing: A Bankruptcy Problem Formulation

Antonopoulos

Mekikis

Kartsakli

2021

ICC 2021 - IEEE International Conference on Communications

View full text Add to dashboard Cite

show abstract

Intelligence-Driven Networking Architecture

Jiang

Qian

2019

Wireless Networks

View full text Add to dashboard Cite

An Improved Web Caching System With Locally Normalized User Intervals

Vaithinathan¹,

Benadit

Parthiban

et al. 2021

IEEE Access

View full text Add to dashboard Cite

Caching is one of the most promising areas in the field of future internet architecture like Information-centric Networking, Software Defined Networking, and IoT. In Web caching, most of the web content is readily available across the network, even if the webserver is not reachable. Several existing traditional caching methods and cache replacement strategies are evaluated based on the metrics like hit ratio and byte hit Ratio. However, these metrics have not been improved over the period because of the traditional caching policies. So, in this paper, we have used an intelligent function like locally normalized intervals of page visit, website duration, users' interest between user groups is proposed. These intervals are combined with multiple distance metrics like Manhattan, squared Euclidean, and 3-,4-,5-norm Minkowski. In order to obtain significant common user navigation patterns, the clustering relation between the users using different intervals and distances is thoroughly analyzed. These patterns are successfully coupled with greedy web cache replacement strategies to improve the efficiency of the proposed web cache system. Particularly for improving the caching metrics more, we used an AI-based intelligent approach like Random Forest classifier to boost the prefetch buffer performance and achieves the maximum hit rate of 0.89, 0.90, and byte hit rate of 0.87, 0.89 for Greedy Dual Size Frequency and Weighted Greedy Dual Size Frequency algorithms, respectively. Our experiments show good hit/byte hit rates than the frequently used algorithms like least recently used and least frequently used.

show abstract

Edge Cache-Based ISP-CP Collaboration Scheme for Content Delivery Services

Cited by 6 publications

References 32 publications

Network Neutrality in Content Cache Sharing: A Bankruptcy Problem Formulation

Network Neutrality in Content Cache Sharing: A Bankruptcy Problem Formulation

Intelligence-Driven Networking Architecture

An Improved Web Caching System With Locally Normalized User Intervals

Contact Info

Product

Resources

About