scispace - formally typeset
Search or ask a question
Topic

Edge computing

About: Edge computing is a research topic. Over the lifetime, 11657 publications have been published within this topic receiving 148533 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, a two-time-scale framework that jointly optimizes service (code and data) placement and request scheduling, while considering storage, communication, computation, and budget constraints is proposed.
Abstract: Mobile edge computing provides the opportunity for wireless users to exploit the power of cloud computing without a large communication delay To serve data-intensive applications (eg, video analytics, machine learning tasks) from the edge, we need, in addition to computation resources, storage resources for storing server code and data as well as network bandwidth for receiving user-provided data Moreover, due to time-varying demands, the code and data placement needs to be adjusted over time, which raises concerns of system stability and operation cost In this paper, we address these issues by proposing a two-time-scale framework that jointly optimizes service (code and data) placement and request scheduling, while considering storage, communication, computation, and budget constraints First, by analyzing the hardness of various cases, we completely characterize the complexity of our problem Next, we develop a polynomial-time service placement algorithm by formulating our problem as a set function optimization, which attains a constant-factor approximation under certain conditions Furthermore, we develop a polynomial-time request scheduling algorithm by computing the maximum flow in a carefully constructed auxiliary graph, which satisfies hard resource constraints and is provably optimal in the special case where requests have homogeneous resource demands Extensive synthetic and trace-driven simulations show that the proposed algorithms achieve 90% of the optimal performance

64 citations

Proceedings ArticleDOI
14 May 2018
TL;DR: Results on an object recognition scenario show 71\% efficiency gain in the throughput of the system by employing a combination of edge, in-transit and cloud resources when compared to a cloud-only approach.
Abstract: Applying deep learning models to large-scale IoT data is a compute-intensive task and needs significant computational resources. Existing approaches transfer this big data from IoT devices to a central cloud where inference is performed using a machine learning model. However, the network connecting the data capture source and the cloud platform can become a bottleneck. We address this problem by distributing the deep learning pipeline across edge and cloudlet/fog resources. The basic processing stages and trained models are distributed towards the edge of the network and on in-transit and cloud resources. The proposed approach performs initial processing of the data close to the data source at edge and fog nodes, resulting in significant reduction in the data that is transferred and stored in the cloud. Results on an object recognition scenario show 71\% efficiency gain in the throughput of the system by employing a combination of edge, in-transit and cloud resources when compared to a cloud-only approach.

64 citations

Journal ArticleDOI
TL;DR: This paper uses the random waypoint mobility model for fog nodes to calculate the expected makespan and application execution cost, and proposes a Tabu Search-based Component Placement (TSCP) algorithm to find sub-optimal placements.
Abstract: Fog computing reduces the latency induced by distant clouds by enabling the deployment of some application components at the edge of the network, on fog nodes, while keeping others in the cloud. Application components can be implemented as Virtual Network Functions (VNFs) and their execution sequences can be modeled by a combination of sub-structures like sequence, parallel, selection, and loops. Efficient placement algorithms are required to map the application components onto the infrastructure nodes. Current solutions do not consider the mobility of fog nodes, a phenomenon which may happen in real systems. In this paper, we use the random waypoint mobility model for fog nodes to calculate the expected makespan and application execution cost. We then model the problem as an Integer Linear Programming (ILP) formulation which minimizes an aggregated weighted function of the makespan and cost. We propose a Tabu Search-based Component Placement (TSCP) algorithm to find sub-optimal placements. The results show that the proposed algorithm improves the makespan and the application execution cost.

64 citations

Proceedings ArticleDOI
24 Sep 2019
TL;DR: This paper designs a computation graph representation for distributed programs, realizes it using Conflict-free Replicated Data Types (CRDTs) as the underlying data structures, and employs RICE (Remote Method Invocation for ICN), which provides attractive benefits in simplicity, performance, and failure resilience.
Abstract: Modern distributed computing frameworks and domain-specific languages provide a convenient and robust way to structure large distributed applications and deploy them on either data center or edge computing environments. The current systems suffer however from the need for a complex underlay of services to allow them to run effectively on existing Internet protocols. These services include centralized schedulers, DNS-based name translation, stateful load balancers, and heavy-weight transport protocols. In contrast, ICN-oriented remote invocation methodologies provide an attractive match for current distributed programming languages by supporting both functional programming and stateful objects such as Actors. In this paper we design a computation graph representation for distributed programs, realize it using Conflict-free Replicated Data Types (CRDTs) as the underlying data structures, and employ RICE (Remote Method Invocation for ICN) as the execution environment. We show using NDNSim simulations that it provides attractive benefits in simplicity, performance, and failure resilience.

64 citations

Posted Content
TL;DR: In this paper, the edge information system (EIS), including edge caching, edge computing, and edge AI, will play a key role in the future intelligent IoV, which will provide not only low-latency content delivery and computation services, but also localized data acquisition, aggregation and processing.
Abstract: The Internet of Vehicles (IoV) is an emerging paradigm, driven by recent advancements in vehicular communications and networking. Advances in research can now provide reliable communication links between vehicles, via vehicle-to-vehicle communications, and between vehicles and roadside infrastructures, via vehicle-to-infrastructure communications. Meanwhile, the capability and intelligence of vehicles are being rapidly enhanced, and this will have the potential of supporting a plethora of new exciting applications, which will integrate fully autonomous vehicles, the Internet of Things (IoT), and the environment. These trends will bring about an era of intelligent IoV, which will heavily depend upon communications, computing, and data analytics technologies. To store and process the massive amount of data generated by intelligent IoV, onboard processing and Cloud computing will not be sufficient, due to resource/power constraints and communication overhead/latency, respectively. By deploying storage and computing resources at the wireless network edge, e.g., radio access points, the edge information system (EIS), including edge caching, edge computing, and edge AI, will play a key role in the future intelligent IoV. Such system will provide not only low-latency content delivery and computation services, but also localized data acquisition, aggregation and processing. This article surveys the latest development in EIS for intelligent IoV. Key design issues, methodologies and hardware platforms are introduced. In particular, typical use cases for intelligent vehicles are illustrated, including edge-assisted perception, mapping, and localization. In addition, various open research problems are identified.

64 citations


Network Information
Related Topics (5)
Wireless sensor network
142K papers, 2.4M citations
93% related
Network packet
159.7K papers, 2.2M citations
93% related
Wireless network
122.5K papers, 2.1M citations
93% related
Server
79.5K papers, 1.4M citations
93% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
92% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20231,471
20223,274
20212,978
20203,397
20192,698
20181,649