How to efficiently deploying the service components of a data-intensive application on cloud and edge servers to minimize its latency is one of the main challenges for service providers. Most existing studies consider either service deployment or data placement, rather than their joint optimization. This work considers the driving relationship between data and services in a heterogeneous environment including remote cloud and nearby edge servers, and aims to obtain a desired data placement and service deployment scheme while meeting user requirements for service quality. Firstly, we formulate the problem and decouple data placement from service deployment by polynomial reduction. Then, a priority-based data placement strategy is proposed, which can generate a data placement scheme. After that, the original problem is transformed into a classical assignment problem, and a service deployment strategy based on an improved Hungarian algorithm is proposed to obtain a service deployment scheme. Then, a dynamic adjustment strategy based on response weight is proposed to dynamically adjust the data placement and service deployment scheme in order to reduce response latency, and obtain the final scheme. Finally, a series of comparative experiments were conducted, pitting our algorithms against several baseline and SOTA algorithms. The results show that the proposed algorithms, in comparison to other algorithms, is capable of generating superior data placement and service deployment schemes to significantly reduce response latency.

Efficiently deploying the service components of data-intensive applications on edge or cloud servers to minimize latency is one of the main challenges faced by the cloudedge environment. Most existing studies consider either service deployment or data placement, rather than the joint optimization of them. To this end, this work considers the driving relationship between data and services in a heterogeneous environment including remote cloud and nearby edge servers, and aims to obtain a satisfactory data placement and service deployment scheme while ensuring the QoS for users. Firstly, we formulate the desired problem and decouple data placement from service deployment by polynomial reduction. Then, a priority-based data placement strategy (PDPS) is proposed, which can generate a data placement scheme. After that, the original problem is reduced to a classical assignment problem, and a service deployment strategy based on an improved Hungarian algorithm (HA-SDS) is proposed to obtain a service deployment scheme. The effectiveness of our proposed method are evaluated by ablation and comparative experiments, which performs better than other existing algorithms.