Xiaoyi Tao

Dr. Xiaoyi Tao

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
28 January 2021 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
XTXiaoyi Tao
Xiaoyi Tao
KOKaoru Ota
Kaoru Ota
MDMianxiong Dong
Mianxiong Dong
HQHeng Qi
Heng Qi
KLKeqiu Li
Keqiu Li
As a successful solution for global communications, Space-Air-Ground (SAG) networks, have drawn extensive attention. Satellites are influenced by geographical features as a way of space communications. Since the traffic congestion may occur in densely populated cities, leading to serious latency and throughput collapses. To solve this problem, we first introduce Software Defined Networks (SDN) into satellites and then propose a load balancing approach to improve communication performances. However, the SDN Space-Air-Ground networks need a cooperative communication process, we consider this problem as an SDN-enabled routers placement problem, so that we can decide the exactly traditional routers are upgrading to ensure the robustness of hybrid networks. Based on the hybrid Space-Air-Ground networks, we design a load balancing strategy to distribute traffic among networks optimally, so that the total congested links are minimized in our proposed model. For better performance in Space-Air-Ground networks, we propose a resilient congestion estimate scheme. Detouring traffic around the nearby satellites to optimize traffic load is a decision based on the network condition. Simulation results illustrate that our proposed method outperforms traditional satellite network methods by improving 6.5% and 4.4% packet loss rate, and 11.6% and 8.3% higher throughput respectively.

9 June 2020 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
XTXiaoyi Tao
Xiaoyi Tao
KOKaoru Ota
Kaoru Ota
MDMianxiong Dong
Mianxiong Dong
WBWuyunzhaola Borjigin
Wuyunzhaola Borjigin
HQHeng Qi
Heng Qi
KLKeqiu Li
Keqiu Li
The Inter-datacenter transfer is a fundamental service for global cloud applications. Geo-distributed data centers become an essential resource for their application performance which may be destroyed by network congestion. Recent years, most inter-datacenter transfer methods focus on allocating transfers by bandwidth allocation to achieve low cost or high utilization. However, the congestion condition is rarely considered in these works. In this paper, we introduce a congestion-aware traffic allocation method named CONA (CONgestion-Aware), whose target is to maximize the profit of allocation transfer among multiple data centers. On this purpose, a maximizing optimization model is proposed, and an efficient link grading strategy is presented. A matrix transformation method is also introduced to simplify the optimization problem. Furthermore, the link congestion condition is considered by the controller, as well as the prediction on link congestion. To verify our proposed method, simulation model is established and comprehensive experiments are conducted. The experimental results show that our method brings higher profit than fair share traffic allocation method.

29 December 2017 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
WLWenxin Li
Wenxin Li
DGDeke Guo
Deke Guo
ALAlex X. Liu
Alex X. Liu
KLKeqiu Li
Keqiu Li
HQHeng Qi
Heng Qi
XTXiaoyi Tao
Xiaoyi Tao
Inefficient bandwidth sharing in a datacenter network, between different application frameworks, e.g., MapReduce and Spark, can lead to inelastic and skewed usage of link bandwidth and increased completion times for the applications. Existing work, however, either solely focuses on managing computation and storage resources or controlling only sending/receiving rate at hosts. In this paper, we present CoMan, a solution that provides global in-network bandwidth management in multiplexed data centers, with two goals: improving bandwidth utilization and reducing application completion time. CoMan first designs a novel abstraction of virtual link groups (VLGs) to establish a shared bandwidth resource pool. Based on this pool, CoMan implements a three-level bandwidth allocation model, which enables elastic bandwidth sharing among computing frameworks as well as guarantees network performance for the applications. CoMan further improves the bandwidth utilization by devising a VLG dependency graph and solves an optimization problem to guide the path selection using a 32-approximation algorithm. We conduct comprehensive trace-driven simulations as well as small-scale testbed experiments to evaluate the performance of CoMan. Extensive simulation results show that CoMan improves the bandwidth utilization and speeds up the application completion time by up to 2.83× and 6.68×, respectively, compared to the ECMP + ElasticSwitch solution. Our implementation also verifies that CoMan can realistically speed up the application completion times by 2.32× on average.

25 May 2020 in IEEE Access
Verified
Journal Article
Open access
SCSheng Chen
Sheng Chen
LNLihai Nie
Lihai Nie
XTXiaoyi Tao
Xiaoyi Tao
ZLZhiyang Li
Zhiyang Li
LZLaiping Zhao
Laiping Zhao
Event detection by discovering frequent itemsets is very popular in sensor network communities. However, the recorded data is often a probability rather than a determined value in a really productive environment as sensed data is often affected by noise. In this paper, we study to detect events by finding frequent patterns over probabilistic sensor data under the Possible World Semantics. This is technically challenging as probabilistic records can generate an exponential number of possible worlds. Although several efficient algorithms are proposed in the literature, it is still difficult to mine probabilistic maximal frequent items (PMFIs) in large uncertain database due to the high time complexity. To address this issue, we employ approximate idea to further reduce the time complexity from O(nlogn) to O(n) and propose a two-step solution (Aproximation Probabilistic Frequent Itemset-MAX, APFI-MAX in short) including PMFI candidates generation and PMFIs confirmation. We also provide the necessary proofs of our approximation method to make APFI-MAX more solid and convincing. Finally, extensive experiments have been conducted on synthetic and real databases, demonstrating that the proposed APFI-MAX always running faster than state-of-art methods under different parameter settings.

12 March 2021 in IEEE Networking Letters
Verified
Journal Article
Closed access
XTXiaoyi Tao
Xiaoyi Tao
KOKaoru Ota
Kaoru Ota
MDMianxiong Dong
Mianxiong Dong
HQHeng Qi
Heng Qi
KLKeqiu Li
Keqiu Li
This letter studies the virtualized network function (VNF) placement problem for edge systems, where the edge nodes can provide services that are originally deployed in cloud datacenters. As related to the end-users, edge supports low latency when the energy consumption of edge nodes and end users are the main concerns. Therefore, we formulate this problem with two performance metrics: latency and energy consumption. We present a joint VNF Placement optimization problem at the Edge, and propose the method of VPE. The numerical results show that our proposed VPE guarantees the energy consumption cost without damaging the performance on latency.

17 January 2023 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
SCSheng Chen
Sheng Chen
QZQihang Zhang
Qihang Zhang
XDXiaodong Dong
Xiaodong Dong
XTXiaoyi Tao
Xiaoyi Tao
KLKeqiu Li
Keqiu Li
ILIvan Lee
Ivan Lee
Mobile edge computing (MEC) is becoming increasingly popular due to its remarkable computing capacities in close proximity to end users or devices. With the widespread use of Industrial Internet of Things, more and more cloud service providers move their services to the edge of the network for a better quality of service and become MEC providers. These MEC providers require to rent wide area network (WAN) connections to transfer industrial data, which is a considerable expense. In this article, we propose a framework called Sublessor to reduce the WAN transmission cost for a group of cooperative MEC providers. The key idea of Sublessor is allowing some specific MEC providers to act as Internet transit brokers, transmitting not only their own network traffic but also the traffic of their partners under a reasonable reselling price. This article formulates the problem as a mixed-integer programming and finds the most suitable broker number and corresponding reselling price without damaging the profit of both brokers and partners by a deep-reinforcement-learning-based algorithm. Experimental results show that our algorithm can significantly reduce the traffic transmission cost by up to 35%.