Yipeng Zhou

Dr. Yipeng Zhou

School of Computing, Macquarie University, Macquarie University, Sydney, NSW 2109, Australia
orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
8 September 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YLYong Li
Yong Li
YZYipeng Zhou
Yipeng Zhou
AJAlireza Jolfaei
Alireza Jolfaei
DYDongjin Yu
Dongjin Yu
GXGaochao Xu
Gaochao Xu
Xi ZhengXi Zheng
Xi Zheng
Federated learning is a promising new technology in the field of IoT intelligence. However, exchanging model-related data in federated learning may leak the sensitive information of participants. To address this problem, we propose a novel privacy-preserving FL framework based on an innovative chained secure multi-party computing technique, named Chain-PPFL. Our scheme mainly leverages two mechanisms: Single-Masking mechanism which protects information exchanged between participants; Chained-Communication mechanism which enables masked information to be transferred between participants with a serial chain frame. We conduct extensive simulation-based experiments using two public datasets (MNIST and CIFAR-100) by comparing both training accuracy and leak-defence with other state-of-the-art schemes. We set two data sample distributions (IID and Non-IID) and three training models (CNN, MLP and L-BFGS) in our experiments. The experimental results demonstrate that the Chain-PPFL scheme can achieve a practical privacy-preservation (equivalent to differential privacy with approaching zero) for federated learning with some cost of communication and without impairing the accuracy and convergence speed of the training model.

1 October 2007
Verified
Conference Paper
Closed access
YZYipeng Zhou
Yipeng Zhou
DCDah Ming Chiu
Dah Ming Chiu
JLJohn C.S. Lui
John C.S. Lui
P2P streaming tries to achieve scalability (like P2P file distribution) and at the same time meet real-time playback requirements. It is a challenging problem still not well understood. In this paper, we describe a simple stochastic model that can be used to compare different data-driven downloading strategies based on two performance metrics: continuity (probability of continuous playback), and startup latency (expected time to start playback). We first study two simple strategies: rarest first and greedy. The former is a well-known strategy for P2P file sharing that gives good scalability, whereas the latter an intuitively reasonable strategy to optimize continuity and startup latency from a single peer's viewpoint. Greedy, while achieving low startup latency, fares poorly in continuity by failing to maximize P2P sharing; whereas rarest first is the opposite. This highlights the trade-off between startup latency and continuity, and how system scalability improves continuity. Based on this insight, we propose a mixed strategy that can be used to achieve the best of both worlds. Our algorithm dynamically adapts to the peer population size to ensure scalability; at the same time, it reserves part of a peer's effort to the immediate playback requirements to ensure low startup latency.

1 March 2021 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
MHMiao Hu
Miao Hu
XLXianzhuo Luo
Xianzhuo Luo
JCJiawen Chen
Jiawen Chen
YLYoung Choon Lee
Young Choon Lee
YZYipeng Zhou
Yipeng Zhou
DWDi Wu
Di Wu

18 June 2015 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
YZYipeng Zhou
Yipeng Zhou
LCLiang Chen
Liang Chen
CYChunfeng Yang
Chunfeng Yang
DCDah Ming Chiu
Dah Ming Chiu
Popular online video-on-demand (VoD) services all maintain a large catalog of videos for their users to access. The knowledge of video popularity is very important for system operation , such as video caching on content distribution network (CDN) servers. The video popularity distribution at a given time is quite well understood. We study how the video popularity changes with time, for different types of videos, and apply the results to design video caching strategies. Our study is based on analyzing the video access levels over time, based on data provided by a large video service provider. Our main finding is, while there are variations, the glory days of a video’s popularity typically pass by quickly and the probability of replaying a video by the same user is low. The reason appears to be due to fairly regular number of users and view time per day for each user, and continuous arrival of new videos. All these facts will affect how video popularity changes, hence also affect the optimal video caching strategy. Based on the observation from our measurement study, we propose a mixed replication strategy (of LFU and FIFO) that can handle different kinds of videos. Offline strategy assuming tomorrow’s video popularity is known in advance is used as a performance benchmark. Through trace-driven simulation, we show that the caching performance achieved by the mixed strategy is very close to the performance achieved by the offline strategy.

26 June 2017 in IEEE Access
Verified
Journal Article
Open access
GYGuoqiao Ye
Guoqiao Ye
GLGaoxiang Li
Gaoxiang Li
DWDi Wu
Di Wu
XCXu Chen
Xu Chen
YZYipeng Zhou
Yipeng Zhou
The recent increasing evolution of renewable energy technologies makes it possible for common residents to afford the cost of installing renewable energy devices (REDs) and energy storage systems (ESSs) in their own houses. With the prevalence of REDs and ESSs, it is a beneficial and also promising idea for residents in a community to share extra energy with others, especially, when they have different electricity usage patterns. However, considering the unpredictable energy usage patterns, radically intermittent characteristics of renewable energy generation, and dynamic electricity price, it would be difficult for residents in a community to intelligently share their energy with others and thus minimize the overall cost of the whole community. In this paper, we design an online algorithm, which can tackle cost-aware energy sharing among residents in a cooperative community. We formulate the problem as a stochastic constrained problem and the objective is to minimize the time-average cost in the whole community, which includes the cost of purchasing electricity from the main grid, and the cost of charging and discharging ESSs. By exploiting the dynamics of electricity price, we can determine the charging and discharging behaviors of ESSs. We explore our method based on the Lyapunov optimization theory, which does not need any future statistics and possesses low computational complexity. Through theoretical analysis of our algorithm, we can conclude that our strategy can approximate the optimality with provable bounds. Meanwhile, we design a revenue division algorithm based on the Nash bargaining theory to fairly share the revenue among residents. We also conduct extensive trace-driven simulations and results show that our algorithm can obtain nearly 12% of cost reduction for the community when compared with noncooperative algorithms, and ensure the fairness among residents in the meanwhile.

17 April 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MHMiao Hu
Miao Hu
ZXZixuan Xie
Zixuan Xie
DWDi Wu
Di Wu
YZYipeng Zhou
Yipeng Zhou
XCXu Chen
Xu Chen
LXLiang Xiao
Liang Xiao
Task offloading is one of key operations in edge computing, which is essential for reducing the latency of task processing and boosting the capacity of end devices. However, the heterogeneity among tasks generated by various users makes it challenging to design efficient task offloading algorithms. In addition, the assumption of complete information for offloading decision-making does not always hold in a distributed edge computing environment. In this paper, we formulate the problem of heterogeneous task offloading in a distributed environment as a minority game (MG), in which each player must make decisions independently in each turn and the players who end up on the minority side win. The multi-player MG incentivizes players to cooperate with each other in the scenarios with incomplete information, where players don't have full information about other players (e.g., the number of tasks, the required resources). To address the challenges incurred by task heterogeneity and the divergence of naive MG approaches, we propose an MG based scheme, in which tasks are divided into subtasks and instructed to form into a set of groups as possible, and the left ones are scheduled to perform decision adjustment in a probabilistic manner. We prove that our proposed algorithm can converge to a near-optimal point, and also investigate its stability and price of anarchy in terms of task processing time. Finally, we conduct a series of simulations to evaluate the effectiveness of our proposed scheme and the results indicate that our scheme can achieve around 30% reduction of task processing time compared with other approaches. Moreover, our proposed scheme can converge to a near-optimal point, which cannot be guaranteed by naive MG approaches.