Nowadays, Mobile Edge Computing (MEC) appears as a new computing paradigm with its ability to utilize the computing power of both local devices and edge servers. In MEC, edge pricing and resource allocation are two important problems. Edge servers make a profit by selling computing services to users. To maximize their revenue, they need to determine an appropriate price for each user, and decide the amount of resources allocated to each user. However, none of the existing works consider the effect of users’ task assignment strategy on the revenue of the edge. In fact, edge pricing and resource allocation will affect the users’ task offloading decision, as they expect to minimize their total cost. In turn, the users’ decision will also influence the revenue of the edge. Therefore, the interaction between mobile users and edge servers should be considered carefully and the interests of both sides need to be maximized simultaneously. In this paper, we model the interaction between the two sides as a Stackelberg game. First, given a specified edge pricing and resource allocation strategy, we derive a near-optimal task assignment strategy for each user to minimize the total cost based on a greedy algorithm UTA-G. Then, by applying the backward induction method, two pricing and resource allocation schemes with different granularity, i.e., EPRA-U and EPRA-T are proposed to bring higher revenue to the edge. Experimental results demonstrate that all the proposed algorithms can have good performance in task-intensive, resource-deficient and workload-heavy scenarios.

The microservice architecture has been commonly adopted by large scale software systems exemplified by a wide range of online services. Service monitoring through anomaly detection and root cause analysis (RCA) is crucial for these microservice systems to provide stable and continued services. However, compared with monolithic systems, software systems based on the layered microservice architecture are inherently complex and commonly involve entities at different levels of granularity. Therefore, for effective service monitoring, these systems have a special requirement of multi-granular RCA. Furthermore, as a large proportion of anomalies in microservice systems pertain to problematic code, to timely troubleshoot these anomalies, these systems have another special requirement of RCA at the finest code-level. Microservice systems rely on telemetry data to perform service monitoring and RCA of service anomalies. The majority of existing RCA approaches are only based on a single type of telemetry data and as a result can only support uni-granular RCA at either application-level or service-level. Although there are attempts to combine metric and tracing data in RCA, their objective is to improve RCA's efficiency or accuracy rather than to support multi-granular RCA. In this article, we propose a new RCA solutionTrinityRCLthat is able to localize the root causes of anomalies at multiple levels of granularity including application-level, service-level, host-level, and metric-level, with the unique capability of code-level localization by harnessing all three types of telemetry data to construct a causal graph representing the intricate, dynamic, and nondeterministic relationships among the various entities related to the anomalies. By implementing and deployingTrinityRCLin a real production environment, we evaluateTrinityRCLagainst two baseline methods and the results show thatTrinityRCLhas a significant performance advantage in terms of accuracy at the same level of granularity with comparable efficiency and is particularly effective to support large-scale systems with massive telemetry data.