Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lei Zhang 0175

dblp:97/8704-175 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2Computer networks · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 32% Energy-efficient computing · 32% Storage systems · 28%
Computer networks
1 paper
Edge and fog computing · 100%
Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Edge and fog computing
mobile edge computing
0.412020
Express: An Energy-Efficient and Secure Framework for Mobile Edge Computing and Blockchain based Smart Systems**This research is in part supported by the National Natural Science Foundation of China Project No. 61972001 · ASE 2020
Distributed systems
blockchain
0.412020
Express: An Energy-Efficient and Secure Framework for Mobile Edge Computing and Blockchain based Smart Systems**This research is in part supported by the National Natural Science Foundation of China Project No. 61972001 · ASE 2020
Energy-efficient computing
edge computing energy efficiency
0.412020
Express: An Energy-Efficient and Secure Framework for Mobile Edge Computing and Blockchain based Smart Systems**This research is in part supported by the National Natural Science Foundation of China Project No. 61972001 · ASE 2020
Storage systems
data placement
0.412019
A Novel Workflow-Level Data Placement Strategy for Data-Sharing Scientific Cloud Workflows · IEEE Trans. Serv. Comput. 2019
Cloud and datacenter computing › geo-distributed cloud
datacenter selection
0.112019
A Novel Workflow-Level Data Placement Strategy for Data-Sharing Scientific Cloud Workflows · IEEE Trans. Serv. Comput. 2019

Methods — techniques the papers use, named apart from their topics

mobile edge computing · 0.9blockchain · 0.9discrete particle swarm optimization · 0.8
YearPublicationVenuePosition
2022 Energy-Aware Computation Management Strategy for Smart Logistic System With MEC
abstract
As the most important part of a smart city and long-standing challenging issue, a highly efficient smart logistic system has attracted a great deal of attention in recent years. In particular, unmanned aerial vehicles (UAVs) are ideal solutions for last-mile delivery scenarios in recent years due to their fast speed and easy deployment. However, because of the highly automatic delivery process, UAVs are still constrained by the limited payload, battery, and computing capacity for complex computational tasks. With the aid of the mobile edge computing (MEC) technology, UAVs can offload computational tasks to the MEC computational resources in various types of IoT environments. In spite of the task offloading which can enhance their task process capability, it also brings extra overhead, such as data transfer time and energy consumption. These extra overheads may significantly impact the efficiency and payload of UAV-based delivery systems. Therefore, taking the UAV last-mile delivery system with MEC as an example, this article investigates the energy-aware multi-UAV task computation management problem according to a realistic autonomous delivery network (ADNET). Specifically, we propose a computation management strategy, namely, the MEC-based task offloading and scheduling strategy (TOSS), to provide an integral approach covering both the static task offloading and scheduling algorithm, as well as the dynamic resource conflict resolution algorithm. Grounded on real-world scenarios, our experimental results show that TOSS can achieve a higher payload for UAVs by using minimum energy consumption and task makespan within the given constraints of the deadline compared to the state-of-the-art methods.
Jia Xu 0010, Xiao Liu 0004, Xuejun Li 0001, Lei Zhang 0175, Jiong Jin, Yun Yang 0001
IEEE Internet Things J.4
2020 Express: An Energy-Efficient and Secure Framework for Mobile Edge Computing and Blockchain based Smart Systems**This research is in part supported by the National Natural Science Foundation of China Project No. 61972001
abstract
As most smart systems such as smart logistic and smart manufacturing are delay sensitive, the current mainstream cloud computing based system architecture is facing the critical issue of high latency over the Internet. Meanwhile, as huge amount of data is generated by smart devices with limited battery and computing power, the increasing demand for energy-efficient machine learning and secure data communication at the network edge has become a hurdle to the success of smart systems. To address these challenges with using smart UAV (Unmanned Aerial Vehicle) delivery system as an example, we propose EXPRESS, a novel energy-efficient and secure framework based on mobile edge computing and blockchain technologies. We focus on computation and data (resource) management which are two of the most prominent components in this framework. The effectiveness of the EXPRESS framework is demonstrated through the implementation of a real-world UAV delivery system. As an open-source framework, EXPRESS can help researchers implement their own prototypes and test their computation and data management strategies in different smart systems. The demo video can be found at https://youtu.be/r3U1iU8tSmk.
Jia Xu 0010, Xiao Liu 0004, Xuejun Li 0001, Lei Zhang 0175, Yun Yang 0001
ASE4
2019 A Novel Workflow-Level Data Placement Strategy for Data-Sharing Scientific Cloud Workflows
abstract
Cloud computing can provide a more cost-effective way to deploy scientific workflows than traditional distributed computing environments such as cluster and grid. Due to the large size of scientific datasets, data placement plays an important role in scientific cloud workflow systems for improving system performance and reducing data transfer cost. Traditional task-level data placement strategy only considers shared datasets within individual workflows to reduce data transfer cost. However, it is obvious that task-level strategy is not necessarily good enough for the situation of multiple workflows at the workflow level. In this paper, a novel workflow-level data placement model is constructed, which regards multiple workflows as a whole. Then, a two-stage data placement strategy is proposed which first pre-allocates initial datasets to proper datacenters during workflow build-time stage, and then dynamically distributes newly generated datasets to appropriate datacenters during runtime stage. Both stages use an efficient discrete particle swarm optimization algorithm to place flexible-location datasets. Comprehensive experiments demonstrate that our workflow-level data placement strategy can be more cost-effective than its task-level counterpart for data-sharing scientific cloud workflows.
Xuejun Li 0001, Lei Zhang 0175, Xiao Liu 0004, Erzhou Zhu, Huikang Yi, Futian Wang, Cheng Zhang 0010, Yun Yang 0001
IEEE Trans. Serv. Comput.2
2018 Cost-Effective and Traffic-Optimal Data Placement Strategy for Cloud-based Online Social Networks
abstract
Cloud-based Online Social Networks (OSNs) make it easier for geographically dispersed users to communicate with each other. These users not only demand to quickly access their own data but also hope to access their friends' data with low latency. In order to solve the problem, it is necessary to design a replica placement strategy to manage data on large-scale social networks and reduce the data storage costs while meeting the access latency requirement. In this paper, we propose a novel genetic algorithm-based data placement strategy to find an optimal number of replicas for each user's data and their optimal location. The method can reduce the inter-server traffic load across servers and ensure that users can access data in a tolerable time. Experiments with real Facebook dataset demonstrate that our data placement strategy can significantly reduce the cost of data storage and inter-server traffic.
Lei Zhang 0175, Xuejun Li 0001, Hourieh Khalajzadeh, Ruiyue Zhu, Xia Ji 0002, Chuanhui Ju, Yun Yang 0001
CSCWD1