Yugo Nakamura, Teruhiro Mizumoto, H. Suwa, Yutaka Arakawa, H. Yamaguchi, K. Yasumoto
{"title":"In-Situ Resource Provisioning with Adaptive Scale-out for Regional IoT Services","authors":"Yugo Nakamura, Teruhiro Mizumoto, H. Suwa, Yutaka Arakawa, H. Yamaguchi, K. Yasumoto","doi":"10.1109/SEC.2018.00022","DOIUrl":"https://doi.org/10.1109/SEC.2018.00022","url":null,"abstract":"In an era where billions of IoT devices have been deployed, edge/fog computing paradigms are attracting attention for their ability to reduce processing delays and communication overhead. In order to improve Quality of Experience (QoE) of regional IoT services that create timely geo-spatial information in response to users' queries, it is important to efficiently allocate sufficient resources based on the computational demand of each service. However since edge/fog devices are assumed to be heterogeneous (in terms of their computational power, network performance to other devices, deployment density, etc.), provisioning computational resources according to computational demand becomes a challenging constrained optimization problem. In this paper, we formulate a delay constrained regional IoT service provisioning (dcRISP) problem. dcRISP assigns computational resources of devices based on the demand of the regional IoT services in order to maximize users' QoE. We also present dcRISP+, an extension of dcRISP, that enables resource selection to extend beyond the initial area in order to satisfy increasing computational demands. We propose a provisioning algorithm, in-situ resource area selection with adaptive scale out and in-situ task scheduling based on a tabu search, to solve the dcRISP+ problem. We conducted a simulation study of a tourist area in Kyoto where 4,000 IoT devices and 3 types of IoT services were deployed. Results show that our proposed algorithms can obtain higher user QoE compared to conventional resource provisioning algorithms.","PeriodicalId":376439,"journal":{"name":"2018 IEEE/ACM Symposium on Edge Computing (SEC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128489819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secure Edge Computing in IoT Systems: Review and Case Studies","authors":"Mohammed Alrowaily, Zhuo Lu","doi":"10.1109/SEC.2018.00060","DOIUrl":"https://doi.org/10.1109/SEC.2018.00060","url":null,"abstract":"Today, the architectures for efficient and secure network system designs, such as Internet of Things (IoT) and big data analytics, are growing at a faster pace than ever before. Edge computing for an IoT system is data processing that is done at or near the collectors of data in an IoT system. In this paper, we aim to briefly review the concepts, features, security, applications of IoT empowered edge computing as well as its security aspects in our data-driven world. We focus on clarifying different aspects that should be taken into consideration while creating a scalable, reliable, secure and distributed edge computing system. We also summarize the basic ideas regarding security risk mitigation techniques. Then, we explore the presented challenges and opportunities in the field of edge computing. Finally, we review two case studies, smart parking and content delivery network (CDN), and analyze different methods in which IoT systems can be used to carry out daily tasks.","PeriodicalId":376439,"journal":{"name":"2018 IEEE/ACM Symposium on Edge Computing (SEC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126489894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Envy-Free Auction Mechanism for Resource Allocation in Edge Computing Systems","authors":"Tayebeh Bahreini, H. Badri, Daniel Grosu","doi":"10.1109/SEC.2018.00030","DOIUrl":"https://doi.org/10.1109/SEC.2018.00030","url":null,"abstract":"One of the major challenges in Mobile Edge Computing~(MEC) systems is to decide how to allocate and price edge/cloud resources so that a given system's objective, such as revenue or social welfare, is optimized. One promising approach is to allocate these resources based on auction models, in which users place bids for using a certain amount of resources. In this paper, we address the problem of resource allocation and pricing in a two-level edge computing system. We consider a system in which servers with different capacities are located in the cloud or at the edge of the network. Mobile users compete for these resources and have heterogeneous demands. We design an auction-based mechanism that allocates and prices edge/cloud resources. The proposed mechanism is novel in the sense that it handles the allocation of resources available at the two-levels of the system by combining features from both position and combinatorial auctions. We show that the proposed mechanism is individually-rational and produces envy-free allocations. The first property guarantees that users are willing to participate in the mechanism, while the second guarantees that when the auction is finished, no user would be happier with the outcome of another user. We evaluate the performance of the proposed mechanism by performing extensive experiments. The experimental results show that the proposed mechanism is scalable and obtains efficient solutions.","PeriodicalId":376439,"journal":{"name":"2018 IEEE/ACM Symposium on Edge Computing (SEC)","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121685377","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Manuel Osvaldo Jesus Olguin Muñoz, Junjue Wang, M. Satyanarayanan, J. Gross
{"title":"Demo: Scaling on the Edge – A Benchmarking Suite for Human-in-the-Loop Applicationss","authors":"Manuel Osvaldo Jesus Olguin Muñoz, Junjue Wang, M. Satyanarayanan, J. Gross","doi":"10.1109/SEC.2018.00031","DOIUrl":"https://doi.org/10.1109/SEC.2018.00031","url":null,"abstract":"Previous works on cloudlets, one of the earliest incarnation of edge computing, enable small data-centers at the edge of the Internet. Many futuristic applications become viable with these clusters that are only one wireless hop away. One of the most promising genres of these emerging applications is human-in-the-loop applications such as wearable cognitive assistance. In these applications, sensor data, for example video and audio, are continuously streamed to a cloudlet, where they are analyzed in realtime in order to assist users to complete a particular task. Benchmarking infrastructures for these human-in-the-loop applications is challenging - the main issue arises from the involvement of humans. Applications' execution path and resource utilization vary among users. In this demo we present a methodology and benchmarking suite capable of tackling this challenges through the use of prerecorded sensory input traces, which allows for efficient scaling of benchmark scenarios.","PeriodicalId":376439,"journal":{"name":"2018 IEEE/ACM Symposium on Edge Computing (SEC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114281635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ying Xiong, Donghui Zhuo, Sungwook Moon, Michael Xie, Isaac Ackerman, Quinton Hoole
{"title":"Amino - A Distributed Runtime for Applications Running Dynamically Across Device, Edge and Cloud","authors":"Ying Xiong, Donghui Zhuo, Sungwook Moon, Michael Xie, Isaac Ackerman, Quinton Hoole","doi":"10.1109/SEC.2018.00046","DOIUrl":"https://doi.org/10.1109/SEC.2018.00046","url":null,"abstract":"This paper presents a framework and runtime system, Amino, for developing and executing distributed applications in highly dynamic computing environment consisting of cloud resources, edge nodes and/or devices such as phones and smart cameras. This work is based on Sapphire [1] - a general-purpose distributed programming platform. In Sapphire, application objects (called Sapphire Objects) run inside kernel servers (KS), and Kernel server instance runs on every device or cloud node. Between Kernel Server and an application object is a layer called Deployment Manager (DM). Inbound and outbound communications to/from Sapphire objects will be intercepted and processed by deployment manager. Each DM provides one specific distributed system capabilities, e.g. caching, resource leasing, replication, data partitioning etc. Programmers selectively choose DMs to manage Sapphire objects. As part of this work (Amino), we re-implemented and extended Sapphire platform to support the invocation of methods on objects written in multiple languages and to support attaching multiple DMs to a Sapphire object for increased distribution capabilities. Finally, in the work, we introduce a code offloading design for dynamically moving application objects between devices and cloud servers at runtime to optimize a user specified objective, e.g. to reduce latency or to save energy consumption.","PeriodicalId":376439,"journal":{"name":"2018 IEEE/ACM Symposium on Edge Computing (SEC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128864959","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DyCREM: Dynamic Credit Risk Management Using Edge-Based Blockchain","authors":"Youhuizi Li, Weisong Shi, Mohit Kumar, Jun Chen","doi":"10.1109/SEC.2018.00039","DOIUrl":"https://doi.org/10.1109/SEC.2018.00039","url":null,"abstract":"Banks play an important role in the financial market, and their profit mainly comes from loan service. Traditional risk management approaches, as the key part in the loan services, still have several issues including low data credibility, unreliable checking and alert delay. We propose a novel dynamic credit risk management system which leverages edge-based blockchain technology to improve the performance and provide a fair loan environment. Besides, we discuss the potential challenges that the system may face, such as data standards, security on edge and scalability.","PeriodicalId":376439,"journal":{"name":"2018 IEEE/ACM Symposium on Edge Computing (SEC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127738294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"F-MStorm: Feedback-Based Online Distributed Mobile Stream Processing","authors":"M. Chao, ChenKuang Yang, Yukun Zeng, R. Stoleru","doi":"10.1109/SEC.2018.00027","DOIUrl":"https://doi.org/10.1109/SEC.2018.00027","url":null,"abstract":"A distributed mobile stream processing system allows mobile devices to process stream data that exceeds any single device's computation capability without the help of infrastructure. It is paramount to have such a system in many critical application scenarios, such as military operations and disaster response, yet an efficient online mobile stream processing system is still missing. In this paper, we make the key observation that the unique characteristics of mobile stream processing call for a feedback-based system design, which is in sharp contrast with the static configuration and scheduling of the current mobile stream processing system, \"MStorm\". At first, we demonstrate the inefficiencies of MStorm through several real-world experiments. Then, we propose F-MStorm, a feedback-based online distributed mobile stream processing system, which adopts the feedback-based approach in the configuration, scheduling and execution levels of system design. We implement F-MStorm on Android phones and evaluate its performance through benchmark applications. We show that it achieves up to 3x lower response time, 10% higher throughput and consumes 23% less communication energy than the state-of-the-art systems.","PeriodicalId":376439,"journal":{"name":"2018 IEEE/ACM Symposium on Edge Computing (SEC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127208546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Latency-Oblivious Incentive Service Offloading in Mobile Edge Computing","authors":"Amit Samanta, Yong Li","doi":"10.1109/SEC.2018.00042","DOIUrl":"https://doi.org/10.1109/SEC.2018.00042","url":null,"abstract":"We design a latency-oblivious incentive service offloading scheme to manage complex network services for future mobile services. We build our prototype and show its feasibility in terms of latency and total incurred cost by using mobile edge computing as an example use case in a realistic testbed.","PeriodicalId":376439,"journal":{"name":"2018 IEEE/ACM Symposium on Edge Computing (SEC)","volume":"470 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133637058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yogesh D. Barve, Shashank Shekhar, A. Chhokra, S. Khare, Anirban Bhattacharjee, A. Gokhale
{"title":"FECBench: An Extensible Framework for Pinpointing Sources of Performance Interference in the Cloud-Edge Resource Spectrum","authors":"Yogesh D. Barve, Shashank Shekhar, A. Chhokra, S. Khare, Anirban Bhattacharjee, A. Gokhale","doi":"10.1109/SEC.2018.00034","DOIUrl":"https://doi.org/10.1109/SEC.2018.00034","url":null,"abstract":"Effective resource management is critical in multi-tenant, virtualized cloud platforms to meet service level objectives (SLOs) of individual applications. Thus, cloud providers must be able to detect sources of performance bottlenecks and reliability problems. One such cause, which is the focus of this study, is Performance Interference, where applications collocated on the same physical resource influence each others' performance in a non-linear fashion. In this paper, we present the challenges and requirements for an extensible performance interference benchmarking platform. This poster presents ongoing work on an extensible resource usage statistics collection and benchmarking framework we are developing called FECBench (Fog/Edge/Cloud Bench).","PeriodicalId":376439,"journal":{"name":"2018 IEEE/ACM Symposium on Edge Computing (SEC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133491663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dependency Mining for Service Resilience at the Edge","authors":"Atakan Aral, I. Brandić","doi":"10.1109/SEC.2018.00024","DOIUrl":"https://doi.org/10.1109/SEC.2018.00024","url":null,"abstract":"Edge computing paradigm is prone to failures as it trades reliability against other quality of service properties such as low latency and geographical prevalence. Therefore, software services that run on edge infrastructure must rely on failure resilience techniques for uninterrupted delivery. Unique combination of hardware, software, and network characteristics of edge services is not addressed by existing techniques that are designed or tailored for cloud services. In this work, we propose a novel method for evaluating the resilience of replicated edge services, which exploits failure dependencies between edge servers to forecast probability of service interruption. This is done by analyzing historical failure logs of individual servers, modeling temporal dependencies as a dynamic Bayesian network, and inferring the probability that certain number of servers fail concurrently. Furthermore, we propose two replica scheduling algorithms that optimize different criteria in resilient service deployment, namely failure probability and cost of redundancy.","PeriodicalId":376439,"journal":{"name":"2018 IEEE/ACM Symposium on Edge Computing (SEC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134358847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}