COIN: An Efficient Indexing Mechanism for Unstructured Data Sharing Systems

Edge computing promises a dramatic reduction in the network latency and the traffic volume, where many edge servers are placed at the edge of the Internet. Furthermore, those edge servers cache data to provide services for edge users. The data sharing among those edge servers can effectively shorten...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2022-02, Vol.30 (1), p.313-326
Main Authors: Xie, Junjie, Qian, Chen, Guo, Deke, Wang, Minmei, Wang, Ge, Chen, Honghui
Format: Article
Language:English
Subjects:
Bandwidth
Cloud computing
Data indexing
Data retrieval
data sharing
Edge computing
IEEE transactions
Indexing
Information sharing
Network latency
Peer-to-peer computing
Performance indices
Servers
software-defined networking
Switches
Traffic volume
Unstructured data
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Edge computing promises a dramatic reduction in the network latency and the traffic volume, where many edge servers are placed at the edge of the Internet. Furthermore, those edge servers cache data to provide services for edge users. The data sharing among those edge servers can effectively shorten the latency to retrieve the data and further reduce the network bandwidth consumption. The key challenge is to construct an efficient data indexing mechanism no matter how the data is cached in the edge network. Although this is essential, it is still an open problem. Moreover, existing methods such as the centralized indexing and the DHT indexing in other fields fail to meet the performance demand of edge computing. This paper presents a COordinate-based INdexing (COIN) mechanism for the data sharing in edge computing. COIN maintains a virtual space where switches and data indexes are associated with their coordinates. Then, COIN distributes data indexes to indexing edge servers based on those coordinates. The COIN is effective because any query request from an edge server can be responded when the data has been stored in the edge network. More importantly, COIN is efficient in both routing path lengths and forwarding table sizes for publishing/querying data indexes. We implement COIN in a P4 prototype. Experimental results show that COIN uses 59% shorter path length and 30% less forwarding table entries to retrieve data indexes compared to using Chord, a well-known DHT solution.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2021.3110782