Labeled graph partitioning scheme for distributed edge caching

doi:10.1016/j.future.2023.12.008

Labeled graph partitioning scheme for distributed edge caching

2024-04-01

0

PRE

AI

DOI：10.1016/j.future.2023.12.008

Original

Original request for help

Save

Abstract

En 中文

Distributed edge caching could address latency and congestion problems in large-scale data access effectively, improving system throughput and performance. However, the lack of specialized edge caching solutions for graph data resulted in low cache hit rates and high data access latency. This limitation stemmed from existing graph partitioning schemes that overlooked the specific requirements of edge caching, such as communication overhead between edge servers, data query frequency, and query patterns. To overcome these challenges, we proposed LGPE, a labeled graph partitioning scheme for distributed edge caching based on frequent query patterns. LGPE generated frequent query patterns according to the user's historical query subgraphs and then performed labeled graph partitioning based on the frequent pattern, ensuring that the labeled graph divided into edge servers had a high hit rate for frequent user queries while satisfying a minimum edge cut. Evaluation on real datasets from various application domains demonstrated that LGPE achieved approximately 40% higher cache hit rates compared to benchmarks like METIS and SCOTCH, and it also performed well in terms of edge cuts in special graph cases.

Keywords:

Labeled graph

Graph partitioning

Distributed edge caching

Frequent query patterns

Labeled graph partitioning scheme for distributed edge caching

Abstract

Journal

Organization