Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3583740.3628439acmconferencesArticle/Chapter ViewAbstractPublication PagessecConference Proceedingsconference-collections
research-article
Open access

EdgeCut: Fast and Low-overhead Access of User-associated Contents from Edge Servers

Published: 07 August 2024 Publication History

Abstract

User-associated contents play an increasingly important role in modern network applications. With growing deployments of edge servers, the capacity of content storage in edge clusters significantly increases, which provides great potential to satisfy content requests with much shorter latency. However, the large number of contents also causes the difficulty of searching contents on edge servers in different locations because indexing contents costs huge DRAM on each edge server. In this work, we explore the opportunity of efficiently indexing user-associated contents and propose a scalable content-sharing mechanism for edge servers, called EdgeCut, that significantly reduces content access latency by allowing many edge servers to share their cached contents. We design a compact and dynamic data structure called Ludo Locator that returns the IP address of the edge server that stores the requested user-associated content. We have implemented a prototype of EdgeCut in a real network environment running in a public geo-distributed cloud. The experiment results show that EdgeCut reduces content access latency by up to 50% and reduces cloud traffic by up to 50% compared to existing solutions. The memory cost is less than 50MB for 10 million mobile users. The simulations using real network latency data show EdgeCut's advantages over existing solutions on a large scale.

References

[1]
[n. d.]. https://cloudlab.us/.
[2]
[n. d.]. https://seattle.poly.edu/.
[3]
[n. d.]. https://www.planet.com/.
[4]
[n. d.]. https://www.statista.com/statistics/744126/facebook-user-posts-per-month/.
[5]
[n. d.]. Redis. https://github.com/redis/redis.
[6]
[n. d.]. ZeroMQ. https://github.com/zeromq/libzmq.
[7]
Nasir Abbas, Yan Zhang, Amir Taherkordi, and Tor Skeie. 2017. Mobile edge computing: A survey. IEEE Internet of Things Journal 5, 1 (2017), 450--465.
[8]
J Almeida, AZ Broder, P Cao, and L Fan. 1998. A scalable wide-area web cache sharing protocol. SIGCOMM98 (1998).
[9]
Berk Atikoglu, Yuehai Xu, Eitan Frachtenberg, Song Jiang, and Mike Paleczny. 2012. Workload Analysis of a Large-Scale Key-Value Store. In In Proc. of ACM SIGMETRICS.
[10]
Andrei Broder, Michael Mitzenmacher, and Andrei Broder I Michael Mitzenmacher. 2002. Network applications of bloom filters: A survey. In Internet Mathematics. Citeseer.
[11]
I-R Chen and Baoshan Gu. 2003. Quantitative analysis of a hybrid replication with forwarding strategy for efficient and uniform location management in mobile wireless networks. IEEE Transactions on Mobile Computing 2, 1 (2003), 3--15.
[12]
Bin Fan, Dave G Andersen, Michael Kaminsky, and Michael D Mitzenmacher. 2014. Cuckoo filter: Practically better than bloom. In Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies. 75--88.
[13]
Ivan Farris, Tarik Taleb, Miloud Bagaa, and Hannu Flick. 2017. Optimizing service replication for mobile delay-sensitive applications in 5G edge network. In 2017 IEEE International Conference on Communications (ICC). IEEE, 1--6.
[14]
Ivan Farris, Tarik Taleb, Antonio Iera, and Hannu Flinck. 2017. Lightweight service replication for ultra-short latency applications in mobile edge networks. In 2017 IEEE International Conference on Communications (ICC). IEEE, 1--6.
[15]
Daniel Fernholz and Vijaya Ramachandran. 2007. The k-orientability thresholds for G n, p. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Citeseer, 459--468.
[16]
Frédéric Gabry, Valerio Bioglio, and Ingmar Land. 2016. On energy-efficient edge caching in heterogeneous networks. IEEE Journal on Selected Areas in Communications 34, 12 (2016), 3288--3298.
[17]
Maria Kihl, Robin Larsson, Niclas Unnervik, Jolina Haberkamm, Ake Arvidsson, and Andreas Aurelius. 2014. Analysis of Facebook content demand patterns. In 2014 International Conference on Smart Communications in Network Technologies (SaCoNeT). IEEE, 1--6.
[18]
Darwin Klingman, Albert Napier, and Joel Stutz. 1974. NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. management science 20, 5 (1974), 814--821.
[19]
Jun Li, Hao Wu, Bin Liu, Jianyuan Lu, Yi Wang, Xin Wang, Yanyong Zhang, and Lijun Dong. 2012. Popularity-driven coordinated caching in named data networking. In Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems. 15--26.
[20]
Zaoxing Liu, Zhihao Bai, Zhenming Liu, Xiaozhou Li, Changhoon Kim, Vladimir Braverman, Xin Jin, and Ion Stoica. 2019. {DistCache}: Provable Load Balancing for {Large-Scale} Storage Systems with Distributed Caching. In 17th USENIX Conference on File and Storage Technologies (FAST 19). 143--157.
[21]
Bruce M Maggs and Ramesh K Sitaraman. 2015. Algorithmic nuggets in content delivery. ACM SIGCOMM Computer Communication Review 45, 3 (2015), 52--66.
[22]
Najme Mansouri and Mohammad M Javidi. 2018. A new prefetching-aware data replication to decrease access latency in cloud environment. Journal of Systems and Software 144 (2018), 197--215.
[23]
Yuyi Mao, Changsheng You, Jun Zhang, Kaibin Huang, and Khaled B Letaief. 2017. A survey on mobile edge computing: The communication perspective. IEEE Communications Surveys & Tutorials 19, 4 (2017), 2322--2358.
[24]
Joseph Noor, Mani Srivastava, and Ravi Netravali. 2021. Portkey: Adaptive key-value placement over dynamic edge networks. In Proceedings of the ACM Symposium on Cloud Computing. 197--213.
[25]
Rasmus Pagh and Flemming Friche Rodler. 2004. Cuckoo hashing. Journal of Algorithms 51, 2 (2004), 122--144.
[26]
Jinglei Ren. 2016. YCSB-C. https://github.com/basicthinker/YCSB-C.
[27]
B. Schlinker et al. 2017. Engineering Egress with Edge Fabric: Steering Oceans of Content to the World. In Proc. of ACM SIGCOMM.
[28]
Shouqian Shi and Chen Qian. 2020. Ludo hashing: Compact, fast, and dynamic key-value lookups for practical network systems. Proceedings of the ACM on Measurement and Analysis of Computing Systems 4, 2 (2020), 1--32.
[29]
Narayanan Shivakumar, Jan Jannink, and Jennifer Widom. 1997. Per-user profile replication in mobile environments: Algorithms, analysis, and simulation results. Mobile Networks and Applications 2, 2 (1997), 129--140.
[30]
Narayanan Shivakumar and Jennifer Widom. 1995. User profile replication for faster location lookup in mobile environments. In Proceedings of the 1st annual international conference on Mobile computing and networking. 161--169.
[31]
Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante. 2009. Drafting Behind Akamai: Inferring Network Conditions Based on CDN Redirections. IEEE/ACM TRANSACTIONS ON NETWORKING (2009).
[32]
Tian Wang, Lei Qiu, Arun Kumar Sangaiah, Anfeng Liu, Md Zakirul Alam Bhuiyan, and Ying Ma. 2020. Edge-computing-based trustworthy data collection model in the internet of things. IEEE Internet of Things Journal 7, 5 (2020), 4218--4227.
[33]
Shiow-yang Wu and Yu-Tse Chang. 2006. A user-centered approach to active replica management in mobile environments. IEEE Transactions on Mobile Computing 5, 11 (2006), 1606--1619.
[34]
Xiaoyu Xia, Feifei Chen, Qiang He, John Grundy, Mohamed Abdelrazek, and Hai Jin. 2020. Online collaborative data caching in edge computing. IEEE Transactions on Parallel and Distributed Systems 32, 2 (2020), 281--294.
[35]
Junjie Xie, Deke Guo, Xiaofeng Shi, Haofan Cai, Chen Qian, and Honghui Chen. 2020. A fast hybrid data sharing framework for hierarchical mobile edge computing. In IEEE INFOCOM. IEEE, 2609--2618.
[36]
Junjie Xie, Chen Qian, Deke Guo, Xin Li, Shouqian Shi, and Honghui Chen. 2019. Efficient Data Placement and Retrieval Services in Edge Computing. In IEEE ICDCS. IEEE.
[37]
Junjie Xie, Chen Qian, Deke Guo, Minmei Wang, Shouqian Shi, and Honghui Chen. 2019. Efficient indexing mechanism for unstructured data sharing systems in edge computing. In IEEE INFOCOM. IEEE, 820--828.
[38]
Jianliang Xu, Bo Li, and Dik Lun Lee. 2002. Placement problems for transparent data replication proxy services. IEEE Journal on Selected areas in Communications 20, 7 (2002), 1383--1398.
[39]
Juncheng Yang, Yao Yue, and K. V. Rashmi. 2021. A Large-scale Analysis of Hundreds of In-memory Key-value Cache Clusters at Twitter. ACM Transactions on Storage (2021).
[40]
Kok-Kiong Yap et al. 2017. Taking the Edge off with Espresso: Scale, Reliability and Programmability for Global Internet Peering. In Proc. of ACM SIGCOMM.
[41]
Ye Yu, Djamal Belazzougui, Chen Qian, and Qin Zhang. 2018. Memory-efficient and ultra-fast network lookup and forwarding using Othello hashing. IEEE/ACM Transactions on Networking 26, 3 (2018), 1151--1164.
[42]
Yuming Zhang, Bohao Feng, Wei Quan, Aleteng Tian, Keshav Sood, Youfang Lin, and Hongke Zhang. 2020. Cooperative edge caching: A multi-agent deep learning based approach. IEEE Access 8 (2020), 133212--133224.
[43]
Rui Zhu, Bang Liu, Di Niu, Zongpeng Li, and Hong Vicky Zhao. 2016. Network latency estimation for personal devices: A matrix completion approach. IEEE/ACM Transactions on Networking 25, 2 (2016), 724--737.

Index Terms

  1. EdgeCut: Fast and Low-overhead Access of User-associated Contents from Edge Servers

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SEC '23: Proceedings of the Eighth ACM/IEEE Symposium on Edge Computing
    December 2023
    405 pages
    ISBN:9798400701238
    DOI:10.1145/3583740
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 07 August 2024

    Check for updates

    Author Tags

    1. edge computing
    2. edge location service
    3. user-associated data

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    SEC '23
    Sponsor:
    SEC '23: Eighth ACM/IEEE Symposium on Edge Computing
    December 6 - 9, 2023
    DE, Wilmington, USA

    Acceptance Rates

    Overall Acceptance Rate 40 of 100 submissions, 40%

    Upcoming Conference

    SEC '24
    The Nineth ACM/IEEE Symposium on Edge Computing
    December 4 - 7, 2024
    Rome , Italy

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 8
      Total Downloads
    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)9
    Reflects downloads up to 30 Aug 2024

    Other Metrics

    Citations

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media