2018 IEEE 7th International Conference on Cloud Networking (CloudNet)最新文献

筛选
英文 中文
Real-Time Management and Control of Monitoring Elements In Dynamic Cloud Network Systems 动态云网络系统中监控要素的实时管理与控制
2018 IEEE 7th International Conference on Cloud Networking (CloudNet) Pub Date : 2018-10-01 DOI: 10.1109/CloudNet.2018.8549443
F. Tusa, S. Clayman, A. Galis
{"title":"Real-Time Management and Control of Monitoring Elements In Dynamic Cloud Network Systems","authors":"F. Tusa, S. Clayman, A. Galis","doi":"10.1109/CloudNet.2018.8549443","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549443","url":null,"abstract":"This paper explores new scenarios where Cloud Network Service Providers take advantage of using more flexible resource management and orchestration solutions in the form of dynamic virtualised compute, network and storage resources. The main focus of this work is to analyse how those challenges will considerably impact the requirements of the monitoring process. A framework in the context of 5G is here presented to support the dynamic on-demand management, configuration and control of a monitoring subsystem which: can easily scale up / down according to the number of running entities in the system as result of the instantiation / termination of multiple services; can provide mechanisms to dynamically activate / deactivate its constituent elements on-demand according to the type of services to be monitored; and can provide mechanisms to dynamically adjust the configuration if its elements. Experimental outcomes, where a Monitoring Controller was used to adjust the measurement collection / sending rate of the probes in the monitoring subsystem on the-fly are also presented. The paper shows how this prevented the transmission of vast amounts of data when the number of virtual entities and related monitoring probes in the system scaled up to hundreds of elements.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"6 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":"132218759","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
Implementation and Testing of Failure Recovery Based on Backup Resource Sharing Model for Distributed Cloud Computing System 基于备份资源共享模型的分布式云计算系统故障恢复的实现与测试
2018 IEEE 7th International Conference on Cloud Networking (CloudNet) Pub Date : 2018-10-01 DOI: 10.1109/CloudNet.2018.8549455
Takehiro Sato, Fujun He, E. Oki, T. Kurimoto, S. Urushidani
{"title":"Implementation and Testing of Failure Recovery Based on Backup Resource Sharing Model for Distributed Cloud Computing System","authors":"Takehiro Sato, Fujun He, E. Oki, T. Kurimoto, S. Urushidani","doi":"10.1109/CloudNet.2018.8549455","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549455","url":null,"abstract":"A cost-effective backup resource allocation model for cloud computing systems based on a probabilistic protection guarantee was presented. This paper implements the backup resource allocation model and tests its failure recovery performance. A prototype cloud system is implemented by using the existing capabilities of OpenStack framework. We observe that a failed virtual machine is successfully recovered by using a shared backup machine in single- and multi-site environments.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"2 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":"116722016","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}
引用次数: 10
Adaptive In-network Guidance Dissemination from Hot-Spot Nodes of Queries in Breadcrumbs-Based Information-Centric Networks 基于面包屑的信息中心网络查询热点节点自适应网内引导传播
2018 IEEE 7th International Conference on Cloud Networking (CloudNet) Pub Date : 2018-10-01 DOI: 10.1109/CloudNet.2018.8549190
H. Tode, Ken-Ichi Hashimoto, Y. Tanigawa
{"title":"Adaptive In-network Guidance Dissemination from Hot-Spot Nodes of Queries in Breadcrumbs-Based Information-Centric Networks","authors":"H. Tode, Ken-Ichi Hashimoto, Y. Tanigawa","doi":"10.1109/CloudNet.2018.8549190","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549190","url":null,"abstract":"For several years, server access load and network traffic have greatly increased in content distribution networks because of growing content-sizes and higher request-frequencies. Breadcrumbs (BC) is an architecture that provides guidance information that directs a user to a node holding cached content. The target contents retrieved by this approach have the generalized meanings; videos, functions (programs), files, and any kinds of data, which are duplicated inside network, and also computing resources like CPU time and memory space. The BC is designed for reducing the loads of original servers and for forming autonomous information-centric networks. We have proposed extended methods for BC, called, “Active BC” and “User-Side Flooding,’ These methods provided higher nearby user-cache utilization. However, there still remains technical challenges to enhance BC hit ratio for queries, whereby they often could not provide sufficient guidance information. Thus, in this paper, we develop a BC method that adaptively creates new guidance information from hot-spot nodes to which more queries are routed.","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":"129325074","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}
引用次数: 0
Purging-Aware Content Placement in Fog-Based Content Delivery Networks 基于雾的内容交付网络中的清除感知内容放置
2018 IEEE 7th International Conference on Cloud Networking (CloudNet) Pub Date : 2018-10-01 DOI: 10.1109/CloudNet.2018.8549459
Sepideh Malektaji, Somayeh Kianpisheh, R. Glitho
{"title":"Purging-Aware Content Placement in Fog-Based Content Delivery Networks","authors":"Sepideh Malektaji, Somayeh Kianpisheh, R. Glitho","doi":"10.1109/CloudNet.2018.8549459","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549459","url":null,"abstract":"Fog-based Content Delivery Network can cache contents in fog-enabled devices like set-top boxes. This enhanced proximity helps to reduce latency. Efficient content placement is required for the efficient usage of cache resources, both in the cloud and in the fog. The content purging that may occur due to storage scarcity at the edge sides must be considered in an efficient content placement strategy. In this paper, we model the content placement problem in a hierarchical fog-based CDN as an optimization problem that minimizes the overall content access latency. Factors such as content purging, content popularity, and end-user priority have been taken into account. We propose a genetic-based algorithm to solve this problem. Simulation results show the proposed algorithm has a lower latency in comparison with the greedy approach.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"57 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":"130047531","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}
引用次数: 1
COFRD: A Code Offloading Framework for Rapid Deployment of Android Applications COFRD:用于快速部署Android应用程序的代码卸载框架
2018 IEEE 7th International Conference on Cloud Networking (CloudNet) Pub Date : 2018-10-01 DOI: 10.1109/CloudNet.2018.8549381
Feng Lu, Liwen Shao, Mingliang Wang, Hai Jin
{"title":"COFRD: A Code Offloading Framework for Rapid Deployment of Android Applications","authors":"Feng Lu, Liwen Shao, Mingliang Wang, Hai Jin","doi":"10.1109/CloudNet.2018.8549381","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549381","url":null,"abstract":"In recent years, mobile cloud computing is considered as a promising approach for addressing the challenges of limited computing capability and battery life of mobiles phones. However, some negative characteristics of the existing code offloading framework hinder the popularity and further development of code offloading. In this paper, we introduce the COFRD, a code offloading framework that could rapidly develop and deploy Android applications on native Android runtime environment. With its help, mobile application developers can implement code offloading using one-line annotation. Moreover, we evaluate COFRD with six typical Android applications downloaded from Google Play whose source codes are gotten from Github. The results show that the execution time of application can be reduced by 60% on average and the battery power can be saved by more than 90% in different terminal applications and network scenarios. It means that not only can COFRD easily deploy the general applications on popular Android devices, but also the performance of COFRD has already reached the mainstream level.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"65 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":"130684662","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}
引用次数: 0
Selective In-band Network Telemetry for Overhead Reduction 选择性带内网络遥测减少开销
2018 IEEE 7th International Conference on Cloud Networking (CloudNet) Pub Date : 2018-10-01 DOI: 10.1109/CloudNet.2018.8549351
Youngho Kim, Dongeun Suh, Sangheon Pack
{"title":"Selective In-band Network Telemetry for Overhead Reduction","authors":"Youngho Kim, Dongeun Suh, Sangheon Pack","doi":"10.1109/CloudNet.2018.8549351","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549351","url":null,"abstract":"In-band network telemetry (INT) in programming protocol-independent packet processor (P4) is an emerging network monitoring framework that allows data packets to query different switch-internal states. Meanwhile, the existing INT monitors all data packets and thus significant network overhead can be caused by per-packet INT header and the monitoring engine can be overloaded. To address these issues, we proposed a selective INT (sINT) where the ratio of packets to be monitored can be adjusted depending on the frequency of significant changes in network information. The preliminary results show that sINT can detect all the significant data plane events while reducing the network overhead and the monitoring engine load.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"38 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":"125214769","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}
引用次数: 32
Situational Awareness in Virtual Networks: The ASTRID Approach 虚拟网络中的态势感知:ASTRID方法
2018 IEEE 7th International Conference on Cloud Networking (CloudNet) Pub Date : 2018-10-01 DOI: 10.1109/CloudNet.2018.8549540
A. Carrega, M. Repetto, Fulvio Risso, S. Covaci, A. Zafeiropoulos, Thanassis Giannetsos, Orazio Toscano
{"title":"Situational Awareness in Virtual Networks: The ASTRID Approach","authors":"A. Carrega, M. Repetto, Fulvio Risso, S. Covaci, A. Zafeiropoulos, Thanassis Giannetsos, Orazio Toscano","doi":"10.1109/CloudNet.2018.8549540","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549540","url":null,"abstract":"Cloud-based services often follow the same logical structure of private networks. The lack of physical boundaries and the dependence on third party's infrastructural security mechanisms often undermine the confidence in the overall security level of virtualized applications. Integrating software instances of common security middleboxes into cloud networks helps overcome most suspicions, but leads to inefficient solutions. In this paper, we describe the vision behind the ASTRID project. The novelty of our concept lies in decoupling detection algorithms from monitoring and inspection tasks, seeking better integration with virtualization frameworks. We briefly elaborate on the overall conceptual architecture and the foundation of its implementation components. Additionally, we give insights on the expected impacts and opportunities brought by this novel paradigm over the existing approaches.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"9 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":"127301326","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
Cut-Through Optimization with Migration Using N-by-M Circuit Switchboard 采用n × m电路交换机的带迁移的直通优化
2018 IEEE 7th International Conference on Cloud Networking (CloudNet) Pub Date : 2018-10-01 DOI: 10.1109/CloudNet.2018.8549551
M. Zhanikeev
{"title":"Cut-Through Optimization with Migration Using N-by-M Circuit Switchboard","authors":"M. Zhanikeev","doi":"10.1109/CloudNet.2018.8549551","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549551","url":null,"abstract":"The focus in recent literature has shifted to the fact that performance of bulk transfer can reach its upper physical limit when the cut-through mode is provided for all hops on an end-to-end path. Flows in cut-through mode can enjoy all the benefits of circuit switching without having to enforce the switching technique at physical layer. This paper introduces a new angle at the problem by focusing only on the input ports to the switching matrix - referred to as the switchboard in this paper. The proposed Switchboard method models multi-port physical connectivity between two locations as an N-by-M switching matrix where N is the number of physical ports and M is the number of slots contending for access to each port in N. When formulating the problem, this paper allows for and specifically focuses on migration of slots within the matrix, where performance results prove that this feature has positive effect.","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":"124878303","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}
引用次数: 0
A Weighted ECMP Load Balancing Scheme for Data Centers Using P4 Switches 基于P4交换机的数据中心加权ECMP负载均衡方案
2018 IEEE 7th International Conference on Cloud Networking (CloudNet) Pub Date : 2018-10-01 DOI: 10.1109/CloudNet.2018.8549549
Jin-Li Ye, Chien Chen, Yu-Huang Chu
{"title":"A Weighted ECMP Load Balancing Scheme for Data Centers Using P4 Switches","authors":"Jin-Li Ye, Chien Chen, Yu-Huang Chu","doi":"10.1109/CloudNet.2018.8549549","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549549","url":null,"abstract":"This paper proposes a weighted Equal-cost multipath (W-ECMP) scheme in datacenters using a Programmable Data plane. Nowadays, data center networks face ongoing challenges for higher performance and greater efficiency. Equal-cost multi-path (ECMP) routing, the most common load-balancing scheme used on data center networks, tries to balance the traffic without awareness of the network congestion. To overcome this problem, CONGA and HULA are proposed successively. CONGA has implemented customized ASIC as a part of the switch fabric to collect congestion information distributively. Nevertheless, ASICs solution shows a lack of scalability and flexibility. However, although HULA solves some problems of CONGA by using p4 switch, best path selection strategy in HULA only selects and records the best path, which makes it easy to congest the best path, and HULA uses probes that waste bandwidth and deteriorate the performance. To solve the problems of HULA, W-ECMP chooses a path with a weighted probability to avoid congesting a path quickly. W-ECMP encapsulates the path congestion information into the normal traffic similar to the concept of Inband Network Telemetry (INT) in P4, which increases updating speed as the network loading increases. From experimental results, W - ECMP performs better than HULA does in average flow completion time (FCT).","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"23 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":"123755794","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}
引用次数: 28
Autonomous Data Transmission Control Based on Node Density for Multiple Spatio-Temporal Data Retention 基于节点密度的多时空数据保留自主数据传输控制
2018 IEEE 7th International Conference on Cloud Networking (CloudNet) Pub Date : 2018-10-01 DOI: 10.1109/CloudNet.2018.8549521
Daiki Nobayashi, K. Tsukamoto, T. Ikenaga
{"title":"Autonomous Data Transmission Control Based on Node Density for Multiple Spatio-Temporal Data Retention","authors":"Daiki Nobayashi, K. Tsukamoto, T. Ikenaga","doi":"10.1109/CloudNet.2018.8549521","DOIUrl":"https://doi.org/10.1109/CloudNet.2018.8549521","url":null,"abstract":"Although countless services can now be accessed via the Internet, some specific services such as local traffic conditions and limited-time sale advertisements are strongly dependent on geographical locations and times. Information of this type, which is commonly referred to as spatio-temporal data (STD), is not readily available online. Since the paradigm of local production and consumption of STDs can be effective for location-dependent applications, we previously proposed an STD data retention system that uses vehicular networks to create a mobile cloud. Unfortunately, effective data retention is difficult when multiple STDs exist in the same area because channel interference will result from the increased number of data transmissions. To resolve this issue, we herein propose an autonomous data transmission control method based on node density for multiple STD retention that facilitates a highly reliable coverage rate while limiting the individual data transmissions for each STD. Then, through simulations, we show that our proposed method is effective for simultaneously retaining multiple STDs.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"134 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":"116384495","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信