{"title":"Service Migration for Deadline-Varying User-Generated Data in Mobile Edge-Clouds","authors":"Zhipeng Gao, Jie Meng, Qian Wang, Yang Yang","doi":"10.1109/SERVICES.2018.00039","DOIUrl":null,"url":null,"abstract":"Mobile edge computing is a promising paradigm to compensate for the lack of traditional cloud computing, which has a variety of application scenarios. However, the migration of user-generated data in edge networks is a key issue which involves in transmission costs, the mobility of users, transmission resources, etc. In this paper, we focus on migrating deadline-varying user-generated data to edge servers, considering the tasks characteristics and contact patterns between nodes. We design a heuristic algorithm and propose the online algorithm using real-time information to save the cost of transmission. Further, we conduct the extensive simulations to demonstrate the effectiveness of our algorithms.","PeriodicalId":130225,"journal":{"name":"2018 IEEE World Congress on Services (SERVICES)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE World Congress on Services (SERVICES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SERVICES.2018.00039","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Mobile edge computing is a promising paradigm to compensate for the lack of traditional cloud computing, which has a variety of application scenarios. However, the migration of user-generated data in edge networks is a key issue which involves in transmission costs, the mobility of users, transmission resources, etc. In this paper, we focus on migrating deadline-varying user-generated data to edge servers, considering the tasks characteristics and contact patterns between nodes. We design a heuristic algorithm and propose the online algorithm using real-time information to save the cost of transmission. Further, we conduct the extensive simulations to demonstrate the effectiveness of our algorithms.