31 results about "Service placement" patented technology

An approach efficiently and dynamically places services within a multi-node system when expanding or contracting services, that is, increasing and decreasing the number of instances that host a service. Service placement decisions are made in a way that accounts for performance and availability requirements of both the service being placed and other services.

Techniques to adaptively launch / replace applications and services on edge devices in a cellular infrastructure and / or adaptively place content and computation at the edge devices based on logic at the network core are provided. In one aspect, a method for dynamic placement of applications in a cellular network mobile cloud is provided which includes the steps of: (a) obtaining: (i) a model of the cellular network, (ii) a model of user mobility patterns in the cellular network, and (iii) a model of a profile of the applications; (b) upon receipt of requests from users for the applications, obtaining runtime states at edge servers in the mobile cloud; and (c) upon obtaining the runtime states at the edge servers, placing the requests among the edge servers and a core server in the mobile cloud based on the models obtained in step (a) and the runtime states obtained in step (b).

The invention relates to the field of information technology, and discloses a virtual service migration method and system based on incremental minimum cost and maximum flow. The method includes: constructing a network topology map according to the geographical location and connection relationship of edge servers; The shortest path distance between servers, and generate the shortest path distance matrix; combined with the access information of each service, establish the minimum cost maximum flow model, the model includes service nodes and edge server nodes; solve the model to obtain the minimum cost maximum flow, migrate and place service nodes; update the access information of each service, and use the incremental minimum cost maximum flow algorithm to update the location of service nodes; carry out real-time monitoring and statistics, when the change rate of access information exceeds When setting the threshold, adjust its corresponding service node and edge server node. The invention can solve the optimal service placement and migration scheme in a short time, and is simple, reliable and easy to implement.

The invention relates to a migration method for online VMEC service network selection, which belongs to the field of mobile communication. The method includes: S1: establishing a VMEC mathematical model; S2: scanning adjacent and accessible networks at time slot t, and performing network screening; S3: repeating S2 at time slot t+1 to obtain the initial time slot t+1 Network selection and migration placement as the initial strategy; S4: Network selection and service placement optimization: calculate and compare the three delays of the initial strategy for the t+1 time slot; update the time delay of the t+1 time slot based on the comparison results of the three delays The initial strategy obtains the optimized service migration strategy Φ(t+1) for time slot t+1; finally, the access network selection and service placement are performed according to the strategy Φ(t+1); S5: In the next time slot, repeat steps S3 and S4 , get access network selection and service migration strategy for each time slot in time T. The invention can minimize the time delay for the vehicle to select the network and formulate the service migration strategy during the moving process, and improve the service quality of the user.

The invention discloses a user satisfaction perception-based service placement method for data centers. The method comprises the following steps: first sequencing expenditures of all the data centers at a moment t from low expenditures to high expenditures; then sequentially allocating service requests to each data center under the conditions that the center data has enough virtual machines and that the requirements of the user requests are met, reserving a group of allocation with maximum profit for a computing service provider consistent with the conditions, and placing service in the data center; and after the corresponding service is placed for all the requests, finishing the service placement of the round, and making preparations for the next moment. According to the method, the service is placed in the data centers for the user requests with minimum expenditures by taking the maximization of return of the service providers as a target on the premise of meeting satisfaction of users; and the method is easy in computation, high in operation speed and applied to online large-scale service request scenes.