Pith. sign in

REVIEW

An Online Orchestration Mechanism for General-Purpose Edge Computing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.09393 v1 pith:AAQA62ON submitted 2021-12-17 cs.NI

An Online Orchestration Mechanism for General-Purpose Edge Computing

classification cs.NI
keywords edgecomputingecpscloudgeneral-purposemobileprovidersanalysis
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In recent years, the fast development of mobile communications and cloud systems has substantially promoted edge computing. By pushing server resources to the edge, mobile service providers can deliver their content and services with enhanced performance, and mobile-network carriers can alleviate congestion in the core networks. Although edge computing has been attracting much interest, most current research is application-specific, and analysis is lacking from a business perspective of edge cloud providers (ECPs) that provide general-purpose edge cloud services to mobile service providers and users. In this article, we present a vision of general-purpose edge computing realized by multiple interconnected edge clouds, analyzing the business model from the viewpoint of ECPs and identifying the main issues to address to maximize benefits for ECPs. Specifically, we formalize the long-term revenue of ECPs as a function of server-resource allocation and public data-placement decisions subject to the amount of physical resources and inter-cloud data-transportation cost constraints. To optimize the long-term objective, we propose an online framework that integrates the drift-plus-penalty and primal-dual methods. With theoretical analysis and simulations, we show that the proposed method approximates the optimal solution in a challenging environment without having future knowledge of the system.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.