Xiaoyu Xia

Xiaoyu Xia

Auto-generated profile, based on publicly available information

Xiaoyu Xia

RMIT University

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
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.

10 August 2020 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
BLBo Li
Bo Li
QHQiang He
Qiang He
GCGuangming Cui
Guangming Cui
XXXiaoyu Xia
Xiaoyu Xia
FCFeifei Chen
Feifei Chen
YYYun Yang
Yun Yang
Edge computing (EC) can overcome several limitations of cloud computing. In the EC environment, a service provider can deploy its application instances on edge servers to serve users with low latency. Given a limited budget K for deploying applications in a particular geographical area, some approaches have been proposed to achieves various optimization objectives, e.g., to maximize the servers' coverage, to minimize the average network latency, etc. However, the robustness of the services collectively delivered by the service provider's applications deployed on the edge servers has not been considered at all. This is a critical issue, especially in the highly distributed, dynamic and volatile EC environment. We make the first attempt to tackle this challenge. Specifically, we formulate this Robustness-oriented Edge Application Deployment(READ) problem as a constrained optimization problem and prove its NP-hardness. Then, we provide an integer programming based approach READ-O for solving it precisely, and an approximation algorithm READ-A for efficiently finding near-optimal solutions to large-scale problems. READ-A's approximation ratio is not worse than K/2, which is constant regardless of the total number of edge servers. Evaluation of the widely-used real-world dataset against five representative approaches demonstrates that our approaches can solve the READ problem effectively and efficiently.

17 June 2021 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
GCGuangming Cui
Guangming Cui
QHQiang He
Qiang He
BLBo Li
Bo Li
XXXiaoyu Xia
Xiaoyu Xia
FCFeifei Chen
Feifei Chen
YYYun Yang
Yun Yang
Edge computing, as a new computing paradigm that extends cloud computing, allows a service vendor to deploy its services on distributed edge servers to serve its service users in close geographic proximity to those edge servers. Caching edge data on edge servers can minimize service users data retrieval latency. However, such edge data are subject to intentional and accidental corruption in the highly distributed and dynamic edge computing environment. Verifying the integrity of service vendors edge data accurately and efficiently is a critical security problem. Given a potentially large number of edge servers and their limited computing capacities, verifying the integrity of the edge data on each edge server individually is computation expensive. In this paper, we make the first attempt to tackle this Edge Data Integrity (EDI) problem from the service vendors perspective by proposing an inspection and corruption localization scheme for EDI named ICL-EDI. This scheme allows a service vendor to inspect its edge data and localize corrupted edge data on multiple edge servers accurately and efficiently. To evaluate its performance, we implement ICL-EDI and conduct extensive experiments to demonstrate its effectiveness and efficiency.

21 October 2023 in ACM Computing Surveys
Verified
Journal Article
Open access
XXXiaoyu Xia
Xiaoyu Xia
SFSheik Mohammad Mostakim Fattah
Sheik Mohammad Mostakim Fattah
MBMuhammad Ali Babar
Muhammad Ali Babar
Edge computing facilitates low-latency services at the network’s edge by distributing computation, communication, and storage resources within the geographic proximity of mobile and Internet-of-Things devices. The recent advancement in Unmanned Aerial Vehicle (UAV) technologies has opened new opportunities for edge computing in military operations, disaster response, or remote areas where traditional terrestrial networks are limited or unavailable. In such environments, UAVs can be deployed as aerial edge servers or relays to facilitate edge computing services. This form of computing is also known as UAV-enabled Edge Computing (UEC), which offers several unique benefits such as mobility, line-of-sight, flexibility, computational capability, and cost-efficiency. However, the resources on UAVs, edge servers, and Internet-of-Things devices are typically very limited in the context of UEC. Efficient resource management is therefore a critical research challenge in UEC. In this article, we present a survey on the existing research in UEC from the resource management perspective. We identify a conceptual architecture, different types of collaborations, wireless communication models, research directions, key techniques, and performance indicators for resource management in UEC. We also present a taxonomy of resource management in UEC. Finally, we identify and discuss some open research challenges that can stimulate future research directions for resource management in UEC.

24 February 2021 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
XXXiaoyu Xia
Xiaoyu Xia
FCFeifei Chen
Feifei Chen
JGJohn Grundy
John Grundy
MAMohamed Almorsy Abdelrazek
Mohamed Almorsy Abdelrazek
HJHai Jin
Hai Jin
QHQiang He
Qiang He
In recent years, edge computing, as an extension of cloud computing, has emerged as a promising paradigm for powering a variety of applications demanding low latency, e.g., virtual or augmented reality, interactive gaming, real-time navigation, etc. In the edge computing environment, edge servers are deployed at base stations to offer highly-accessible computing capacities to nearby end-users, e.g., CPU, RAM, storage, etc. From a service provider’s perspective, caching app data on edge servers can ensure low latency in its users’ data retrieval. Given constrained cache spaces on edge servers due to their physical sizes, the optimal data caching strategy must minimize overall user latency. In this article, we formulate this Constrained Edge Data Caching (CEDC) problem as a constrained optimization problem from the service provider’s perspective and prove its $\mathcal {NP}$ -hardness. We propose an optimal approach named CEDC-IP to solve this CEDC problem with the Integer Programming technique. We also provide an approximation algorithm named CEDC-A for finding approximate solutions to large-scale CEDC problems efficiently and prove its approximation ratio. CEDC-IP and CEDC-A are evaluated on a real-world data set. The results demonstrate that they significantly outperform four representative approaches.