Feifei Chen
Auto-generated profile, based on publicly available information

Feifei Chen

School of Information Technology, Deakin University, Geelong, VIC, Australia

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 September 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
QHQiang He
Qiang He
GCGuangming Cui
Guangming Cui
XZXuyun Zhang
Xuyun Zhang
FCFeifei Chen
Feifei Chen
Shuguang DengShuguang Deng
Shuguang Deng
YYYun Yang
Yun Yang

13 August 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
XXXiaoyu Xia
Xiaoyu Xia
FCFeifei Chen
Feifei Chen
QHQiang He
Qiang He
JGJohn Grundy
John Grundy
MAMohamed Almorsy Abdelrazek
Mohamed Almorsy Abdelrazek
HJHai Jin
Hai Jin
In the edge computing (EC) environment, edge servers are deployed at base stations to offer highly accessible computing and storage resources to nearby app users. From the app vendor's perspective, caching data on edge servers can ensure low latency in app users' retrieval of app data. However, an edge server normally owns limited resources due to its limited size. In this paper, we investigate the collaborative caching problem in the EC environment with the aim to minimize the system cost including data caching cost, data migration cost, and quality-of-service (QoS) penalty. We model this collaborative edge data caching problem (CEDC) as a constrained optimization problem and prove that it is NP-complete. We propose an online algorithm, called CEDC-O, to solve this CEDC problem during all time slots. CEDC-O is developed based on Lyapunov optimization, works online without requiring future information, and achieves provable close-to-optimal performance. CEDC-O is evaluated on a real-world data set, and the results demonstrate that it significantly outperforms two representative approaches.

21 July 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
XXXiaoyu Xia
Xiaoyu Xia
FCFeifei Chen
Feifei Chen
QHQiang He
Qiang He
JGJohn C. Grundy
John C. Grundy
MAMohamed Almorsy Abdelrazek
Mohamed Almorsy Abdelrazek
HJHai Jin
Hai Jin
Edge computing, as an extension of cloud computing, distributes computing and storage resources from centralized cloud to distributed edge servers, to power a variety of applications demanding low latency, e.g., IoT services, virtual reality, real-time navigation, etc. From an app vendor's perspective, app data needs to be transferred from the cloud to specific edge servers in an area to serve the app users in the area. However, according to the pay-as-you-go business model, distributing a large amount of data from the cloud to edge servers can be expensive. The optimal data distribution strategy must minimize the cost incurred, which includes two major components, the cost of data transmission between the cloud to edge servers and the cost of data transmission between edge servers. In the meantime, the delay constraint must be fulfilled - the data distribution must not take too long. In this paper, we make the first attempt to formulate this Edge Data Distribution (EDD) problem from the app vendor's perspective and prove its NP-hardness. We propose an optimal approach named EDD-IP and an O(k)-approximation algorithm named EDD-A. EDD-IP and EDD-A are evaluated on a real-world dataset and the results demonstrate that they significantly outperform three representative approaches.

11 December 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
BLBo Li
Bo Li
QHQiang He
Qiang He
FCFeifei Chen
Feifei Chen
HJHai Jin
Hai Jin
YXYang Xiang
Yang Xiang
YYYun Yang
Yun Yang
Edge computing allows app vendor to deploy its applications and relevant data on distributed edge servers to serve its users in close proximity. Caching data on edge servers can minimize users' data retrieval latency. However, such data are subject to both intentional and accidental corruption in the highly distributed and dynamic edge computing environment. Given a large number of edge servers and their limited computing resources, how to effectively and efficiently audit the integrity of app vendors' cache data is a critical and challenging problem. This paper makes the first attempt to tackle this Edge Data Integrity (EDI) problem. We first analyze the threat model and the audit objectives, then propose a lightweight sampling-based probabilistic approach, namely EDI-V, to help app vendors audit the integrity of their data cached on a large scale of edge servers. We propose a new data structure named variable Merkle hash tree (VMHT) for generating the integrity proofs of data replicas during the audit. VMHT can ensure audit accuracy by maintaining sampling uniformity. EDI-V allows app vendors to inspect their cache data and locate the corrupted ones efficiently and effectively. Both theoretical analysis and comprehensively experimental evaluation demonstrate the efficiency and effectiveness of EDI-V.

22 April 2019 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
Lianyong QiLianyong Qi
Lianyong Qi
QHQiang He
Qiang He
FCFeifei Chen
Feifei Chen
WDWanchun Dou
Wanchun Dou
Shaohua WanShaohua Wan
Shaohua Wan
XXXiaolong Xu
Xiaolong Xu
The increasing number of web APIs registered in service sharing communities (e.g., ProgrammableWeb.com that provides a platform benefiting the social interactions between different software developers) has provided a promising way to quickly build various apps with diverse functions. Generally, an app developer can manually discover, select, and compose a set of appropriate web APIs to build a new app satisfying the developer's functional and nonfunctional business requirements, economically and conveniently. However, the above manual web APIs selection process is usually time-consuming and cumbersome as most app developers often do not have much background knowledge of candidate web APIs. Moreover, the manually selected web APIs cannot always guarantee to be integrated successfully as the compatibilities between different web APIs are often varied and not validated. In view of these challenges, we define a weighted APIs correlation graph (W-ACG) in this paper to model the APIs functions and compatibilities. Furthermore, we propose a novel web APIs recommendation approach named Keywords-based and Compatibility-aware APIs Recommendation (K-CAR) based on the defined W-ACG. Through analyzing the input keywords describing the functions expected by an app developer, K-CAR can return the app developer a set of optimal APIs that are not only functional-qualified but also compatibility-guaranteed. Extensive experiments are deployed on 18,478 real-world web APIs and 6146 real-world apps to evaluate the usefulness and efficiency of K-CAR.

9 January 2019 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
YZYiwen Zhang
Yiwen Zhang
KWKaibin Wang
Kaibin Wang
QHQiang He
Qiang He
FCFeifei Chen
Feifei Chen
Shuguang DengShuguang Deng
Shuguang Deng
YYYun Yang
Yun Yang