Zhijun Ding

Zhijun Ding

Auto-generated profile, based on publicly available information

Zhijun Ding

Tongji University

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
27 July 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
SWSheng Wang
Sheng Wang
ZDZhijun Ding
Zhijun Ding
CJChangjun Jiang
Changjun Jiang
Microservices are widely used for flexible software development. Recently, containers have become the preferred deployment technology for microservices because of fast start-up and low overhead. However, the container layer complicates task scheduling and auto-scaling in clouds. Existing algorithms do not adapt to the two-layer structure composed of virtual machines and containers, and they often ignore streaming workloads. To this end, this paper proposes an Elastic Scheduling for Microservices (ESMS) that integrates task scheduling with auto-scaling. ESMS aims to minimize the cost of virtual machines while meeting deadline constraints. Specifically, we define the task scheduling problem of microservices as a cost optimization problem with deadline constraints and propose a statistics-based strategy to determine the configuration of containers under a streaming workload. Then, we propose an urgency-based workflow scheduling algorithm that assigns tasks and determines the type and quantity of instances for scale-up. Finally, we model the mapping of new containers to virtual machines as a variable-sized bin-packing problem and solve it to achieve integrated scaling of the virtual machines and containers. Via simulation-based experiments with well-known workflow applications, the ability of ESMS to improve the success ratio of meeting deadlines and reduce the cost is verified through comparison with existing algorithms.

24 March 2022 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
ZDZhijun Ding
Zhijun Ding
SWSong Wang
Song Wang
CJChangjun Jiang
Changjun Jiang
Microservices and Kubernetes are widely used in the development and operations of cloud-native applications. By providing automated placement and scaling, Kubernetes has become the main tool for managing microservices. However, existing work and Kubernetes fail to consider the dynamic competition and availability of microservices as well as the problem of shared dependency libraries among multiple microservice instances. To this end, this paper proposes an integer nonlinear microservice placement model for Kubernetes with the goal of cost minimization. Specifically, we calculate the number of instances based on microservice availability and construct a model in which the total resource demand of multiple microservice instances exceeds the appropriate proportion of node resources when dynamic resource competition exists and the size of the shared dependency library is less than the node storage capacity. Finally, this paper solves the microservice placement model using an improved genetic algorithm. The experimental results demonstrate that higher throughput is obtained with the same costs and that the same throughput is obtained with lower costs.

7 March 2022 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
BFBinbin Feng
Binbin Feng
ZDZhijun Ding
Zhijun Ding
CJChangjun Jiang
Changjun Jiang
The workload predictor has attracted attention as a key component of the proactive service operation management framework. However, the request and resource workloads of cloud applications are highly dynamic. Existing approaches decompose the original workload into trend, seasonal, and random components, establish models accordingly, and then combine all outputs to generate results. Indeed, the random component usually has significant heteroscedasticity and noise, having little or even a negative effect on model accuracy improvement. In our model, trend and seasonal components are seen as macro workload changes, and the micro workload changes are obtained by an adaptive sliding window algorithm. Therefore, we propose an ensembling model named FAST for Forecasting workloads with Adaptive Sliding window and Time locality integration. Notably, we propose an adaptive sliding window algorithm that considers trend correlation, time correlation, and random fluctuations of workload for online regression to achieve higher accuracy with lower overhead; and for the error-based integration strategy, we propose a time locality concept for local-predictor behavior and develop a multi-class regression algorithm for model integration. Finally, we conduct experiments on Google cluster trace datasets which show FAST has better accuracy than all other state-of-the-art models for dynamic workloads.

30 August 2022 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
ZDZhijun Ding
Zhijun Ding
BFBinbin Feng
Binbin Feng
CJChangjun Jiang
Changjun Jiang
Recently, containers have become the primary deployment form for cloud applications. Predicting container workload accurately is critical to ensure the quality of service (QoS) and cost-efficiency of the applications and meet service level agreements (SLAs) with users. However, facing multiple challenges, including model unavailability due to insufficient data, model maladaptation due to dynamic workload changes, and model non-generalization due to changeable workload patterns in container workload prediction, existing methods have not yet provided a united and effective solution. To this end, we propose a novel integrated forecasting model named COIN that combines COmmon and INdividual changes in container workloads to ensure the availability, adaptivity, and generality of the prediction model based on transfer learning and online learning. Besides, we present a container similarity calculation algorithm for real cloud scenarios, which combines the static and dynamic information of containers and comprehensively depicts the similarity between containers. Through experiments based on two public datasets, the COIN model achieves a higher accuracy than existing state-of-the-art solutions, demonstrating the effectiveness and robustness of our proposed model, which provides a new solution to container workload prediction.

26 February 2019 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
ZDZhijun Ding
Zhijun Ding
HQHaojie Qiu
Haojie Qiu
RYRu Yang
Ru Yang
CJChangjun Jiang
Changjun Jiang
Mengchu ZhouMengchu Zhou
Mengchu Zhou
In human-computer interactive systems (HCISs), there are not only autonomous robots completely controlled by computers but also semiautonomous robots requiring human control. To avoid the errors in a procedure of interaction, a control model is needed. This paper proposes a systematic strategy with specific algorithms to construct an interactive-control-model based on Petri nets owing to their ability to describe concurrence and other system features. Instead of cumbersome iterations of deadlock detection in the existing studies, this paper introduces the concept of implicit constraints and the related implicit-conflict-marking-search algorithm to excavate them. In the algorithm, only the status of a single robot is needed to analyze the system instead of the status of all system components, which is an important innovation in this paper since this can well help one resolve the state explosion issue. Several examples are provided to show the feasibility of the proposed method. The proposed idea in this paper can be readily applied to practical HCISs.

3 January 2025 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
TZTIEHUA ZHANG
TIEHUA ZHANG
YLYuze Liu
Yuze Liu
Zhishu ShenZhishu Shen
Zhishu Shen
XMXingjun Ma
Xingjun Ma
PQPeng Qi
Peng Qi
JJJiong Jin
Jiong Jin
Graph neural network (GNN) has gained increasing popularity in recent years owing to its capability and flexibility in modeling complex graph structure data. Among all graph learning methods, hypergraph learning is a technique for exploring the implicit higher-order correlations when training the embedding space of the graph. In this paper, we propose a hypergraph learning framework named Learning from Heterogeneity (LFH) that is capable of dynamic hyperedge construction and attentive embedding update utilizing the heterogeneity attributes of the graph. Specifically, in our framework, the high-quality features are first generated by the pairwise fusion strategy that utilizes explicit graph structure information when generating initial node embedding. Afterwards, a hypergraph is constructed through the dynamic grouping of implicit hyperedges, followed by the type-specific hypergraph learning process. To evaluate the effectiveness of our proposed framework, we conduct comprehensive experiments on several popular datasets with twelve state-of-the- art models on both node classification and link prediction tasks, which fall into categories of homogeneous pairwise graph learning, heterogeneous pairwise graph learning, and hypergraph learning. The experiment results demonstrate a significant performance gain (an average of 12.9% in node classification and 12.8% in link prediction) compared with recent state-of-the-art methods.