2018 27th International Conference on Computer Communication and Networks (ICCCN)最新文献

An Optimal Checkpointing Model with Online OCI Adjustment for Stream Processing Applications 流处理应用中具有在线OCI调整的最优检查点模型

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1002/cpe.5347

Zhuang Yuan, Xiaohui Wei, Hongliang Li, Yongfang Wang, Xubin He

{"title":"An Optimal Checkpointing Model with Online OCI Adjustment for Stream Processing Applications","authors":"Zhuang Yuan, Xiaohui Wei, Hongliang Li, Yongfang Wang, Xubin He","doi":"10.1002/cpe.5347","DOIUrl":"https://doi.org/10.1002/cpe.5347","url":null,"abstract":"Checkpoint-based fault tolerant method has been widely used to enhance the reliability of Distributed Stream Processing Engines (DSPEs), but a checkpointing process usually introduces considerable overhead. It is a critical issue to choose the Optimal Checkpoint Interval (OCI) that maximizes the processing efficiency. Traditional OCI models consider the recovery time only related to the execution time from the last checkpoint to the moment of the failure. They are not suitable for stream processing jobs because the recovery time is related to the reprocessing workload, which depends on the realtime input data before a failure. A new model is needed to choose the OCI for stream processing applications. Moreover, the input data rate of an stream processing job fluctuates over time. The OCI of an application should also be adjusted dynamically according to the input workload. To solve these problems, we present a novel DSPS Optimal Checkpoint Interval (DOCI) model in this paper. We prove that it maximizes the processing efficiency for a given time period. We propose an approach to dynamically adjust the OCI for an application to accommodate the realtime workload fluctuations. We conduct simulation experiments to verify the effectiveness of DOCI model and the efficiency of the online OCI adjustment algorithm. Experimental results with a real-world dataset show DOCI achieves an improvement on system efficiency by up to 40%, comparing with existing fault-tolerant approaches.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116765950","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}

引用次数: 12

Group-Query-as-a-Service for Secure Low-Latency Opportunistic RF Spectrum Access in Mobile Edge Computing Enabled Wireless Networks 支持移动边缘计算的无线网络中安全低延迟机会性射频频谱接入的组查询即服务

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487432

Abdulhamid A. Adebayo, D. Rawat, Lina Ni, Min Song

{"title":"Group-Query-as-a-Service for Secure Low-Latency Opportunistic RF Spectrum Access in Mobile Edge Computing Enabled Wireless Networks","authors":"Abdulhamid A. Adebayo, D. Rawat, Lina Ni, Min Song","doi":"10.1109/ICCCN.2018.8487432","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487432","url":null,"abstract":"For enhancing the utilization of radio frequency (RF) bands, dynamic spectrum access has been considered to be an emerging paradigm where unlicensed secondary users access the licensed RF spectrum opportunistically without causing harmful interference to licensed primary users. In order to access idle channels, secondary users are required either to sense channels or search the geolocation based spectrum database before starting their actual communications. Note that the database searching approach has been proven to be more effective than the channel sensing approach since the sensing based approach results in higher sensing uncertainties. When a large number of secondary users query the spectrum database for finding idle channels at the same time, the spectrum server could be overwhelmed that could result in (unintentional) Denial-of-Service attack. In this paper, we investigate group-query-as- aservice for searching idle channels in database driven dynamic spectrum access where selected secondary users (aka grid leaders who are selected based on the interactive trust levels, location and resources in their grids) query on behalf of the other secondary users (aka grid followers). In this approach, secondary users are associated with the contours created based on same idle channels with the help of spectrum sensors and mobile edge computing (MEC) servers at each base station. The performance of the proposed group-query-as-a-service is evaluated using numerical results obtained from Monte Carlo simulation. We found that the proposed approach results in less delay with increase edge hit rate and higher throughput than the individual query based approach.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"170 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121241342","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

Coalition-Based Cooperative Routing in Cognitive Radio Networks 认知无线网络中基于联盟的协同路由

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487426

Chowdhury Sayeed Hyder, Li Xiao, G. Xing

{"title":"Coalition-Based Cooperative Routing in Cognitive Radio Networks","authors":"Chowdhury Sayeed Hyder, Li Xiao, G. Xing","doi":"10.1109/ICCCN.2018.8487426","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487426","url":null,"abstract":"Cooperative relaying in cognitive radio networks offers time and space diversity and thereby, provides an effective technique to improve spectrum utilization. Most of the existing research has been focused on adopting this technique in single hop communication which may not fully exploit the benefits of cooperative transmissions. Recently, multi-hop cooperative relaying has been explored in routing path formation between primary transmitter-receiver pairs. In this approach, each user handles one cooperation request at a time and takes part in at most one routing path, which makes the model unscalable and limits the benefits of cooperation. Also, primary users dictate the cooperation terms with no or limited involvement from the participating secondary users. This model, therefore, cannot capture the dynamics when both the primary and secondary users require to make cooperation decisions considering the tradeoffs of multiple offers. As a result, the essence of multi-hop cooperative relaying cannot be realized from the existing approach and calls for further investigation. In this work, we consider a network of coexisting primary and secondary users in which their intention to improve throughput via mutual cooperation is formulated as an overlapping coalition formation game. Based on the analysis of the game, we devise mcRoute, a distributed multi-hop coalition based cooperative routing and scheduling algorithm that forms stable coalitions satisfying users' mutual interest. A primary user constructs its routing path in the form of a coalition with secondary users relaying its packet. A secondary user takes part in one or more coalitions by relaying corresponding primary packets and accessing their channels for its own transmission. Finally, we analyze the performance of the algorithm through extensive numerical simulations.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127213046","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

Distributed Device Caching for Information Updating in Emergency Communications 用于紧急通信中信息更新的分布式设备缓存

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487407

Jiazhen Zhou, C. Beard, Y. Qian

{"title":"Distributed Device Caching for Information Updating in Emergency Communications","authors":"Jiazhen Zhou, C. Beard, Y. Qian","doi":"10.1109/ICCCN.2018.8487407","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487407","url":null,"abstract":"On time information is the basis of coordination and decision making for emergency responses during or after disasters. However, accurate information about disaster scenarios, which usually comes from the monitoring devices or people in disaster areas, is often unavailable since the communication network is congested or even damaged. The information centric network (ICN) paradigm could be employed in this situation to help reduce the download traffic that needs to go through the bottlenecks. However, the regular ICN does not handle frequent information uploading, which posts a new challenge for integrating ICN into the emergency communication network. In this paper, we propose to use edge caches as the foundation of caching systems that support information updating. There are two major design work involved: the local cache placement and across access networks synchronization of the local writing caches in the disaster area. For cache synchronization, we present three different schemes and analyze their system capacity in supporting update traffic from the system's perspective and individual local cache's perspective. For local cache placemen, we propose schemes with flexible scale up and scale down abilities, and present performance analysis on each scheme.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124819798","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}

引用次数: 3

2018 ICCCN Message from the Program Co-Chairs 2018 ICCCN项目联合主席致辞

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/icccn.2018.8487305

引用次数: 0

HFCC: An Adaptive Congestion Control Algorithm Based on Explicit Hybrid Feedbacks 基于显式混合反馈的自适应拥塞控制算法

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487318

Xianliang Jiang, Guang Jin, H. Chen

{"title":"HFCC: An Adaptive Congestion Control Algorithm Based on Explicit Hybrid Feedbacks","authors":"Xianliang Jiang, Guang Jin, H. Chen","doi":"10.1109/ICCCN.2018.8487318","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487318","url":null,"abstract":"The high-throughput, low-latency, and reliable data delivery are fundamental demands of many networked applications, e.g. BitTorrent and Skype. But the inappropriate congestion control of TCPs, caused by the reactive and coarse- grained congestion feedbacks, brings the low link utilization, high queuing delay and frequent packet loss in high bandwidth-delay product network. To mitigate this issue, TCP variants have been developed. Thereinto, the load factor based congestion control (LFCC), e.g. VCP, BMCC, have shown the powerful capabilities to achieve better performances in terms of high link utilization, low persistent queue length, negligible packet loss, and fairness. However, due to the conservative increase and synchronized feedbacks, LFCC faces the slow convergence of the link utilization and inter-flow fairness. This could incur the large flow completion time of new-coming flows indirectly. To solve the issue of existing LFCCs, an asynchronous congestion control based on hybrid feedbacks, called HFCC, is proposed to achieve the faster convergence while keeping the features of LFCCs in this paper. Specifically, HFCC decreases the congestion window when the bottleneck link is in the high-load region and the flow rate exceeds the fair share of the bottleneck bandwidth, or the bottleneck link is in overload region. Otherwise, HFCC increases the congestion window. Note that an overlay coding method is developed in HFCC. To reduce the flow completion time, HFCC adopts an available bandwidth estimation method to speed up the data delivery in low-load region. The simulation results indicate that HFCC has the better performance and faster convergence than VCP, MLCP, and BMCC.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125372128","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

Can Machine Learning Techniques Be Effectively Used in Real Networks against DDoS Attacks? 机器学习技术可以有效地用于真实网络中对抗DDoS攻击吗?

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487445

Jarrod N. Bakker, Bryan K. F. Ng, Winston K.G. Seah

{"title":"Can Machine Learning Techniques Be Effectively Used in Real Networks against DDoS Attacks?","authors":"Jarrod N. Bakker, Bryan K. F. Ng, Winston K.G. Seah","doi":"10.1109/ICCCN.2018.8487445","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487445","url":null,"abstract":"The threat of distributed denial of service (DDoS) attacks has worsened recently with the proliferation of unsecured Internet of Things (IoT) devices. Detecting these attacks is often difficult when using a traditional networking paradigm as network information and control are decentralised. We study the effectiveness of using machine learning (ML) to detect DDoS attacks, facilitated by Software-Defined Networking (SDN), a recent paradigm that aims to improve network management by centralising network information and control. In this study, ML algorithms are implemented on nmeta2, an SDN-based traffic classification architecture, and evaluated on a physical network testbed to demonstrate their efficacy during a DDoS attack scenario, especially in accurately classifying non-malicious traffic. This is unlike most approaches that aim to identify/classify malicious traffic but also misclassify non-malicious traffic, inadvertently leading to degraded performance for legitimate network traffic. Furthermore, there is potentially considerable data loss during DDoS attacks that can further degrade classification performance. We examine these issues that arise when using ML to detect DDoS attacks in live network scenarios.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114946688","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}

引用次数: 20

A Stop-Wait Collaborative Charging Scheme for Mobile Wireless Rechargeable Sensor Networks 移动无线可充电传感器网络的停止-等待协同充电方案

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487391

He Li, Tian Xiao, Yihua Lan, Qinglei Qi, Quan Liu, Jinjiang Liu

引用次数: 0

Malware Detection Using Machine Learning Based on the Combination of Dynamic and Static Features 基于动态与静态特征结合的机器学习恶意软件检测

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487459

Jingling Zhao, Suo-Juan Zhang, Bohan Liu, Baojiang Cui

引用次数: 9

EVN: An Elastic Virtual Network Supporting NFV Customized and Rapid Migration EVN:弹性虚拟网络，支持NFV定制和快速迁移

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487380

Jian Zou, Jingyu Wang, Q. Qi, Haifeng Sun, Zhenguang Yu, Jun Xu

引用次数: 0