2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC)最新文献

Koala: Towards Lazy and Locality-Aware Overlays for Decentralized Clouds 考拉:对分散云的懒惰和位置感知覆盖

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC) Pub Date : 2018-05-03 DOI: 10.1109/CFEC.2018.8358728

Genc Tato, M. Bertier, Cédric Tedeschi

{"title":"Koala: Towards Lazy and Locality-Aware Overlays for Decentralized Clouds","authors":"Genc Tato, M. Bertier, Cédric Tedeschi","doi":"10.1109/CFEC.2018.8358728","DOIUrl":"https://doi.org/10.1109/CFEC.2018.8358728","url":null,"abstract":"Current cloud computing infrastructures and their management are highly centralized, and therefore they suffer from limitations in terms of network latency, energy consumption, and possible legal restrictions. Decentralizing the Cloud has been recently proposed as an alternative. However, the efficient management of a geographically dispersed platform brings new challenges related to service localization, network utilization and locality-awareness. We here consider a cloud topology composed of many small datacenters geographically dispersed within the backbone network. In this paper, we present the design, development and experimental validation of Koala, a novel overlay network that specifically targets such a geographically distributed cloud platform. The three key characteristics of Koala are laziness, latency-awareness and topology-awareness. By using application traffic, Koala maintains the overlay lazily while it takes locality into account in each routing decision. Although Koala's performance depends on application traffic, through simulation experiments we show that for a uniformly distributed traffic, Koala delivers similar routing complexity and reduced latency compared to a traditional proactive protocol, such as Chord. Additionally, we show that despite its passive maintenance, Koala can appropriately deal with churn by keeping the number of routing failures low, without significantly degrading the routing performance. Finally, we show how such an overlay adapts to a decentralized cloud composed of multiple small datacenters.","PeriodicalId":274968,"journal":{"name":"2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116591883","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}

引用次数: 7

Building/environment Data/information System for Fine-Scale Indoor Location Specific Services 用于精细室内定位服务的建筑/环境数据/信息系统

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC) Pub Date : 2018-05-01 DOI: 10.1109/CFEC.2018.8358731

C. Li, P. Wu, H. Wang, E. Chu, J. W. Liu

引用次数: 4

An Extension to iFogSim to Enable the Design of Data Placement Strategies 一个扩展到iFogSim，使数据放置策略的设计

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC) Pub Date : 2018-05-01 DOI: 10.1109/CFEC.2018.8358724

Mohammed Islam Naas, Jalil Boukhobza, Philippe Raipin Parvédy, L. Lemarchand

{"title":"An Extension to iFogSim to Enable the Design of Data Placement Strategies","authors":"Mohammed Islam Naas, Jalil Boukhobza, Philippe Raipin Parvédy, L. Lemarchand","doi":"10.1109/CFEC.2018.8358724","DOIUrl":"https://doi.org/10.1109/CFEC.2018.8358724","url":null,"abstract":"Fog computing consists in extending Cloud services down to the network edge by using resources such as base stations, routers and switches. It presents a dense, heterogeneous and geo-distributed infrastructure which pushes to investigate how data are placed within this infrastructure in order to minimize service latency, network utilization and energy consumption. iFogSim is a Fog and IoT environments simulator dedicated to manage IoT services in a Fog infrastructure. In this paper, we present an extension to iFogSim to be able to model and simulate scenarios with strategies aiming to optimize data placement in Fog and IoT contexts. Data placement problem is NP-Hard due to the large number of Fog nodes and the high amount of data to be placed. Thus, we added a support to divide and conquer strategies to subdivide the issued infrastructure into several parts hence reducing the data placement computing time. Moreover, the extension involves a generic smart city scenario with different workloads making it possible for the users to investigate the behavior of their strategies using various workloads. In order to optimize the execution time of the simulations, we parallelized the Floyd-Warshall algorithm. This algorithm is used in iFogSim to compute all shortest paths between nodes in order to simulate data transmission. We have evaluated this extension using the proposed smart city scenario with various infrastructure configurations. The experiments show that our extension has a small overhead in terms of simulation time and memory utilization.","PeriodicalId":274968,"journal":{"name":"2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125213321","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}

引用次数: 45

Fog-Enabled Multi-Robot Systems 雾化多机器人系统

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC) Pub Date : 2018-05-01 DOI: 10.1109/CFEC.2018.8358727

N. Mohamed, J. Al-Jaroodi, I. Jawhar

引用次数: 9

A Novel Forwarding Policy under Cloud Radio Access Network with Mobile Edge Computing Architecture 基于移动边缘计算架构的云无线接入网转发策略研究

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC) Pub Date : 2018-05-01 DOI: 10.1109/CFEC.2018.8358722

Dian-Yu Lin, Yung-Lin Hsu, Hung-Yu Wei

{"title":"A Novel Forwarding Policy under Cloud Radio Access Network with Mobile Edge Computing Architecture","authors":"Dian-Yu Lin, Yung-Lin Hsu, Hung-Yu Wei","doi":"10.1109/CFEC.2018.8358722","DOIUrl":"https://doi.org/10.1109/CFEC.2018.8358722","url":null,"abstract":"Nowadays, dozens of low-latency required application are emerging, traditional mobile network architecture would not be able to support such applications anymore in the future. Cloud radio access network (C-RAN) combined with Multi-access/mobile edge computing (MEC) seems to be one of the most feasible new RAN architectures to fulfill the requirement. With the assistance of MEC, the computing resource could be allocated more efficiently. In this paper, firstly the advantage of generalized-processor-sharing model (GPS) compared with first-in-first-out (FIFO) and processor-sharing (PS) are discussed in order to figure out the practical queueing behavior in MEC system. Next, the relationship between theoretical traffic intensity factor and realistic system CPU utilization condition is correlated. Finally, based on the discussion, a two threshold forwarding policy (TTFP) algorithm is proposed to dynamically arrange the data traffic according to current system traffic states. The result of the simulation articulates that TTFP algorithm could efficiently fulfill the applications who requires low entire waiting time as possible in high intensity traffic condition.","PeriodicalId":274968,"journal":{"name":"2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121689381","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}

引用次数: 4

A Novel PMU Fog Based Early Anomaly Detection for an Efficient Wide Area PMU Network 基于雾的PMU高效广域网络早期异常检测方法

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC) Pub Date : 2018-05-01 DOI: 10.1109/CFEC.2018.8358730

Zekun Yang, N. Chen, Yu Chen, N. Zhou

{"title":"A Novel PMU Fog Based Early Anomaly Detection for an Efficient Wide Area PMU Network","authors":"Zekun Yang, N. Chen, Yu Chen, N. Zhou","doi":"10.1109/CFEC.2018.8358730","DOIUrl":"https://doi.org/10.1109/CFEC.2018.8358730","url":null,"abstract":"Based on phasor measurement units (PMUs), a synchronphasor system is widely recognized as a promising smart grid measurement system. It is able to provide high-frequency, high-accuracy phasor measurements sampling for Wide Area Monitoring and Control (WAMC) applications.However,the high sampling frequency of measurement data under strict latency constraints introduces new challenges for real time communication. It would be very helpful if the collected data can be prioritized according to its importance such that the existing quality of service (QoS) mechanisms in the communication networks can be leveraged. To achieve this goal, certain anomaly detection functions should be conducted by the PMUs. Inspired by the recent emerging edge-fog-cloud computing hierarchical architecture, which allows computing tasks to be conducted at the network edge, a novel PMU fog is proposed in this paper. Two anomaly detection approaches, Singular Spectrum Analysis (SSA) and K-Nearest Neighbors (KNN), are evaluated in the PMU fog using the IEEE 16-machine 68-bus system. The simulation experiments based on Riverbed Modeler demonstrate that the proposed PMU fog can effectively reduce the data flow end-to-end (ETE) delay without sacrificing data completeness.","PeriodicalId":274968,"journal":{"name":"2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115639662","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}

引用次数: 16

Edge Enhanced Deep Learning System for Large-Scale Video Stream Analytics 用于大规模视频流分析的边缘增强深度学习系统

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC) Pub Date : 2018-05-01 DOI: 10.1109/CFEC.2018.8358733

Muhammad K. Ali, A. Anjum, Muhammad Usman Yaseen, A. Zamani, Daniel Balouek-Thomert, O. Rana, M. Parashar

引用次数: 57

Exploiting Google's Edge Network for Massively Multiplayer Online Games 利用谷歌的Edge网络开发大型多人在线游戏

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC) Pub Date : 2018-05-01 DOI: 10.1109/CFEC.2018.8358734

Jared N. Plumb, Ryan Stutsman

{"title":"Exploiting Google's Edge Network for Massively Multiplayer Online Games","authors":"Jared N. Plumb, Ryan Stutsman","doi":"10.1109/CFEC.2018.8358734","DOIUrl":"https://doi.org/10.1109/CFEC.2018.8358734","url":null,"abstract":"Massively multiplayer online game servers are challenging to build and maintain; they require always-on availability, low-latency, and high predictability. In many ways, these systems could benefit from pushing application logic to the connected clients. However, historically peer-to-peer networks have not worked when applied to this domain. Pushing game logic to the clients complicates development since client end hosts cannot trust their peers and they have unreliably persistent connections, increasing the possibility of cheating or network failure. Google's Edge Network changes everything we have concluded about peer-to-peer networks over the past decade. Having access to thousands of servers all over the world solves problems of availability, data access, link saturation, security, and control. This new system allows for the inclusion of trusted peers in otherwise untrusted node clusters. Developers can explore peer-to-peer or decentralized algorithms while allowing complete control over their data, code, and players, in their developed virtual worlds. They can offload application game logic to a low-latency scalable system, which provides a cost-effective solution residing closer to the connected clients. In this paper, we investigate the gains game developers may obtain by exploring emerging edge cloud technology. We demonstrate how massively multiplayer online games benefit from this new system though simulation. We compare area-of-interest latency, which is the latency between client interactions within the virtual world for known World of Warcraft and Google data centers locations. We show the benefits to area-of-interest latency gained from using Google's Edge Network, while minimally affecting client to server latency. Finally, we present a novel approach to maximize latency reductions for area-of- interest latency by moving players to optimal peering edge servers, thus reducing distance between clients.","PeriodicalId":274968,"journal":{"name":"2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127956857","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}

引用次数: 13

Towards Osmotic Computing: Analyzing Overlay Network Solutions to Optimize the Deployment of Container-Based Microservices in Fog, Edge and IoT Environments 面向渗透计算:分析覆盖网络解决方案，以优化基于容器的微服务在雾、边缘和物联网环境中的部署

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC) Pub Date : 2018-05-01 DOI: 10.1109/CFEC.2018.8358729

Alina Buzachis, A. Galletta, Lorenzo Carnevale, A. Celesti, M. Fazio, M. Villari

{"title":"Towards Osmotic Computing: Analyzing Overlay Network Solutions to Optimize the Deployment of Container-Based Microservices in Fog, Edge and IoT Environments","authors":"Alina Buzachis, A. Galletta, Lorenzo Carnevale, A. Celesti, M. Fazio, M. Villari","doi":"10.1109/CFEC.2018.8358729","DOIUrl":"https://doi.org/10.1109/CFEC.2018.8358729","url":null,"abstract":"In recent years, the rapid growth of new Cloud technologies acted as an enabling factor for the adoption of microservices based architecture that leverages container virtualization in order to build modular and robust systems. As the number of containers running on hosts increases, it becomes essential to have tools to manage them in a simple, straightforward manner and with a high level of abstraction. Osmotic Computing is an emerging research field that studies the migration, deployment and optimization of microservices from the Cloud to Fog, Edge, and Internet of Things (IoT) environments. However, in order to achieve Osmotic Computing environments, connectivity issues have to be addressed. This paper investigates these connectivity issues leveraging different network overlays. In particular, we analyze the performance of four network overlays that are OVN, Calico, Weave, and Flannel. Our results give a concrete overview in terms of overhead and performances for each proposed overlay solution, helping us to understand which the best overlay solution is. Specifically, we deployed CoAP and FTP microservices which helped us to carry out these benchmarks and collect the results in terms of transfer times.","PeriodicalId":274968,"journal":{"name":"2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132543540","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}

引用次数: 26

Synchronous Scheduling Algorithms for Edge Coordinated Internet of Things 边缘协调物联网的同步调度算法

2018 IEEE 2nd International Conference on Fog and Edge Computing (ICFEC) Pub Date : 2018-05-01 DOI: 10.1109/CFEC.2018.8358725

R. Olaniyan, Muthucumaru Maheswaran

引用次数: 10