Karen Boulos, K. Khawam, M. Helou, M. Ibrahim, H. Sawaya, Steven Martin
{"title":"An Efficient Scheme for BBU-RRH Association in C-RAN Architecture for Joint Power Saving and Re-Association Optimization","authors":"Karen Boulos, K. Khawam, M. Helou, M. Ibrahim, H. Sawaya, Steven Martin","doi":"10.1109/CloudNet.2018.8549295","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549295","url":null,"abstract":"A key drive towards 5G networks is the Cloud Radio Access Networks architecture (C-RAN). It consists in decoupling two main elements composing the base station: The Base Band Unit (BBU) and the Remote Radio Head (RRH), allowing for centralized processing of BBUs and efficient resource management. The BBU-RRH associations are optimized in this context, where many RRHs are associated to a single BBU when network load conditions are low. Many studies address the BBU-RRH association problem, also known as RRH clustering, for enhancing the energy efficiency. However, rare contributions seek to optimize the BBU-RRH re-association due to the dynamicity of network load conditions. In fact, frequent re-associations between BBUs and RRHs cause a serious degradation in the Quality of Service (QoS) since connected User Equipments (UEs) experience costly handovers (HOs) to different BBUs. This paper tackles such problem by proposing a hybrid algorithm that is divided into two stages: The first is based on a potential game among RRHs to associate to active BBUs, while the second is a centralized scheme, where a central controller decides of the activation/deactivation of BBUs. We compare the results to a previous centralized proposition and to a classical formulation of BBU-RRH association problem as a bin packing optimization. The results show a good tradeoff between power saving and HO rate reduction. In addition, our proposition outperforms the performances of the bin packing problem.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"49 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":"128680752","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}
Syed Muhammad Abrar Akber, Hanhua Chen, Yonghui Wang, Hai Jin
{"title":"Minimizing Overheads of Checkpoints in Distributed Stream Processing Systems","authors":"Syed Muhammad Abrar Akber, Hanhua Chen, Yonghui Wang, Hai Jin","doi":"10.1109/CloudNet.2018.8549548","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549548","url":null,"abstract":"Failure occurrence in large-scale systems is inevitable, which makes the resilience a key challenge for modern systems. Checkpoints with rollback recovery is a well-known approach to provide fault tolerance in distributed systems. The checkpoint based fault tolerance approach periodically persists the application state to reliable storage, which serves as a recovery point in case of failure. These periodic checkpoints are not inline with the failure rate of the systems as many studies conclude that failure occurrence is not periodic. The optimal size of checkpoint interval is a crucial decision, which directly determines the checkpoint overheads. To minimize the checkpoint overheads, we propose to reduce the number of checkpoints during the application execution. We suggest reducing the number of checkpoints by successively increasing the checkpoint intervals. We consider the failure probability of the underlying infrastructure and iteratively increase the checkpoint intervals. The proposed checkpoint approach tailors the checkpoint initializing based on the failure probability. If failure probability is low, it increases the checkpoint interval, and eventually reduces the total number of checkpoints triggered during application timespan. Reducing the total number of checkpoints during application execution results in decreasing the checkpoint overheads. The experiment results show that the proposed checkpoint policy considerably reduces the checkpoint overheads as compared to periodic checkpoints.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"24 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":"132201363","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":"Demystifying Myths of MEC: Rethinking and Exploring Benefits of Multi-Access/Mobile Edge Computing","authors":"Takamitsu Iwai, A. Nakao","doi":"10.1109/CloudNet.2018.8549539","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549539","url":null,"abstract":"The benefits of Mobile/Multi-access Edge Computing (MEC) are often discussed for reducing the latency and offloading intense computation for data processing of emerging applications on the user equipment (UE), such as Aug-mented/Virtual Reality (AR/VR), connected car, content delivery, etc., onto edge cloud. On the other hand, the performance of UE is rapidly improving with abundant resources for enabling local data processing. In this paper, we rethink the benefits of MEC by first arguing these benefits are myths, that is, the advancement of UE may defeat the often-assumed benefits of MEC, i.e., offloading computation and reducing latency, and then demystify the myths by carefully summarizing the latency and computational requirements of the existing applications possibly benefiting from MEC by surveying several tens of publications while examining the recent UEs performance improvement. We also attempt to undercover new benefits of MEC. In the light of these observations, we conclude that MEC is not necessarily just required for low-latency and computationally intensive applications, but also brings benefits from the four additional perspectives: (1) Data Scalability, (2) Application Scalability, (3) Intent-driven Networking, (4) Partial offloading of the network functions.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"29 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":"114189675","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":"Mobility Support for Vehicular Cloud Radio-Access-Networks with Edge Computing","authors":"Yonggang Kim, Namwon An, Jaehyoung Park, Hyuk Lim","doi":"10.1109/CloudNet.2018.8549365","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549365","url":null,"abstract":"Vehicular networks provide a variety of data services to vehicles through roadside units (RSUs), and cooperation among multiple RSUs is important to support high mobility of vehicles. However, in conventional vehicular network architectures with independently operating RSUs, coordination of RSUs and mobility support for vehicles are limited as the number of RSUs or vehicles increases. We propose using a vehicular cloud radio access network (vCRAN) with edge computing infrastructure where communication and networking resources are centrally controlled. The proposed vehicular network consists of remote radio heads (RRHs) located at roadsides, mobile edge computing (MEC) servers responsible for signal processing and service management, a cloud server managing MEC servers, and a software-defined network (SDN). This vehicular network provides a mobility support method for seamless inter-Rrhand inter-MEC-server connections for vehicular services.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"117 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":"120977230","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":"Link Capacity Provisioning and Server Location Decision in Server Migration Service","authors":"Y. Fukushima, T. Yokohira, T. Murase","doi":"10.1109/CloudNet.2018.8549545","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549545","url":null,"abstract":"Server migration service (SMS) has been proposed as a new class of service to augment the existing IaaS (Infras-tructure as a Service) cloud service. SMS allows servers (server-side processes of a network application) to dynamically and automatically migrate close to their clients (client-side processes of the network application) in order to reduce the penalty that the SMS provider pays to is SMS subscribers when failing to provide them with the guaranteed level of QoS. In this paper, we tackle a link capacity provisioning and server location decision problem where we consider the sum of link capacity provisioning cost and the penalty as the total expenditure of SMS business, and aim at minimizing the total expenditure. In the problem, we determine how much capacity to add to links, and when and to which location to migrate servers. We formulate the problem as an integer programming model, solve the model, and obtain the optimal link capacities, server locations at each time, and the global optimum value of the total expenditure of SMS business. Numerical examples show that the proposed method decreases the total expenditure of SMS business by up to 49% compared to a conventional method that determines the server locations while fixing the link capacities.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"359 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":"123001177","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}
Takuya Kuwahara, T. Kuroda, Manabu Nakanoya, Yutaka Yakuwa, H. Shimonishi
{"title":"Scalable Declarative IT System Update Automation by A* Search with Critical-Element Heuristics","authors":"Takuya Kuwahara, T. Kuroda, Manabu Nakanoya, Yutaka Yakuwa, H. Shimonishi","doi":"10.1109/CloudNet.2018.8549556","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549556","url":null,"abstract":"As IT systems, including network systems using technologies of software defined networking (SDN) and network function virtualisation (NFV), become larger and more complicated, the cost of system management will also increase rapidly. Declarative system update with state space search is a promising approach to enable automation of consistent system update tasks; however, current algorithms is not scalable enough for practical systems. We propose a heuristic algorithm to greatly reduce computation time to solve the system update planning problem for practical systems. Our heuristic algorithm takes into account the structural bottleneck of system update and conducts advance search to resolve bottlenecks of current system states. We evaluated the proposed algorithm for two examples of NFV systems. The results show that computation time to solve system update planning problem for a system with 100 virtual machines does not exceed several minutes, whereas the conventional algorithm is only applicable for a very small system.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"51 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":"132789545","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":"Resolving Controller Load Imbalanced State in Multiple Controllers Based Software-Defined Network","authors":"Takuna Kaiwa, N. Kitsuwan","doi":"10.1109/CloudNet.2018.8549538","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549538","url":null,"abstract":"This paper proposes a switch migration scheme to balance the load of all controllers in multiple controllers based software-defined network. Several works define the number of requested packets as a controller load. The controller needs to hold the current processing until receiving a response message from the switch before processing a new request. For this reason, the number of requested packets incorporates with the path cost is defined as a controller load. In a multiple controllers approach, a load imbalanced state is recognized if a load of one controller is biased against a load of the other controllers. In the imbalanced state, connections of some switches that belong to a controller with high load are disconnected, and the switches are reconnected to the other controllers with the lower load. This process is called a migration process. The probability of migration and the efficiency of migration are used as a decision to find a switch to be migrated and the other controller to be reconnected. The load imbalanced state is resolved but the aggregate load of all controllers may be increased. In the proposed scheme, the aggregate load of all controllers after the migration is used as an indicator to select the migrated switch and a new controller. A pair of migrated switch and controller with the minimum aggregate load is selected so that the aggregate load is reduced compared to the conventional scheme. Computer simulation result shows that the proposed scheme reduces the aggregate load, compared to the traditional scheme.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"1 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":"129697257","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}
Daisuke Amaya, Y. Sumi, Shunsuke Homma, Toru Okugawa, T. Tachibana
{"title":"VNF Placement with Optimization Problem Based on Data Throughput for Service Chaining","authors":"Daisuke Amaya, Y. Sumi, Shunsuke Homma, Toru Okugawa, T. Tachibana","doi":"10.1109/CloudNet.2018.8549543","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549543","url":null,"abstract":"In service chain technology, each network function is placed as virtual network function (VNF) on the commercial off-the-shelf (COTS) servers. In order to utilize network functions effectively, VNFs can be flexibly added into and removed from the COTS servers. In this case, the data throughput is affected by the amount of CPU resources for each VNF and the bandwidth of each link. In this paper, we propose a VNF placement with an optimization problem to improve the data throughput in service chaining. This method determines (i) the placement of VNFs, (ii) the amount of resources for each VNF, and (iii) the transmission route for each service chain by solving our optimization problem. We solve the optimization problem with CPLEX. We compare our method with Shortest Path (SP) method. From numerical examples, we find that the total data throughput can be maximized by the proposed method. Moreover, it is shown that the proposed method can increase the total data throughput by using the node resources and link bandwidth effectively,","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"10 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":"115392233","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":"Migration for VNF Instances Forming Service Chain","authors":"Koji Sugisono, Aki Fukuoka, Hirofumi Yamazaki","doi":"10.1109/CloudNet.2018.8549194","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549194","url":null,"abstract":"When migrating virtual network function (VNF) instances forming a service chain (SC), huge amount of memory pages dirtied due to packet processing extend the interval between the moments when each VNF instance is suspended due to live migration. The generated dirty pages extend termination of the flows through the SC until the instance moving to the target server completes preparation for packet processing. Moreover, after recovery of the flows, quality of the flows deteriorates since the flows are detoured via the instances split into the distant source-target servers. We propose a VNF instance-migration method for alleviating flow termination and flow-quality degradation. Our method migrates the ingress VNF instance in the source server to exploit the flow termination for facilitating completion of the migration before recovery of the flows. Our method avoids endless migration caused by termination and recovery of the flows as well. Numerical results indicate that our method mitigates the impact of flow termination and flow-quality degradation.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"16 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":"114871116","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}
Mazen Ezzeddine, Raghid Morcel, H. Artail, M. Saghir, Haitham Akkary, Hazem M. Hajj
{"title":"RESTful Hardware Microservices Using Reconfigurable Networked Accelerators in Cloud and Edge Datacenters","authors":"Mazen Ezzeddine, Raghid Morcel, H. Artail, M. Saghir, Haitham Akkary, Hazem M. Hajj","doi":"10.1109/CloudNet.2018.8549544","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549544","url":null,"abstract":"We propose enabling cloud datacenters with Reconfigurable Networked Accelerators RNAs. RNAs are FPGA and memory compute nodes connected to the main network of the datacenter. To enable seamless integration of RNAs, we propose RESTful hardware microservices in cloud datacenters. We show how a front-end model view controller (MVC) web application can issue a call to remote RNA-accelerated RESTful microservices to decrease the latency of a single client query and increase the throughput of clients served. As a use case, we investigate just in time classification of client uploaded media (e.g., images, videos, etc.) against adult or hateful content. The system architecture is implemented using Spring MVC (Spring Boot) and AlexNet convolutional neural network CNN for image classification. Observed results show up to more than 10x improvements in throughput and energy efficiency depending on the target RNA (FPGA) device and the level of optimization of the employed hardware classifier.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","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":"126063267","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}