2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)最新文献

筛选
英文 中文
On Using Flow Classification to Optimize Traffic Routing in SDN Networks 基于流分类的SDN网络流量路由优化研究
2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2020-01-01 DOI: 10.1109/CCNC46108.2020.9045216
Haythem Yahyaoui, Saifeddine Aidi, M. Zhani
{"title":"On Using Flow Classification to Optimize Traffic Routing in SDN Networks","authors":"Haythem Yahyaoui, Saifeddine Aidi, M. Zhani","doi":"10.1109/CCNC46108.2020.9045216","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045216","url":null,"abstract":"Cloud storage services are gaining a widespread popularity thanks to their scalability and performance. Several companies and users are relying on such services to store and retrieve their files. In this context, the file transfer time is critical for users' satisfaction. This time can be minimized by carefully selecting the routing strategy to transfer the flow of packets associated with each file. In this paper, we introduce a novel class-based routing strategy called LUNA that is able to minimize the flow completion time. LUNA classifies the flows into mice and elephants based on their size. Afterwards, it leverages a machine learning technique called association rules to generate the forwarding rules and route each flow based on its class (i.e., mouse or elephant). Experimental results show that LUNA has successfully identified the class of 80% of the flows. Furthermore, its class-based routing outperforms basic routing strategies in terms of flow completion time, throughput and packet loss by almost 47%, 41% and 23%, respectively.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124561902","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}
引用次数: 15
SmartFIB: Low-Replacement Route Storage for Large Name Space Forwarding SmartFIB:用于大名称空间转发的低替换路由存储
2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2020-01-01 DOI: 10.1109/CCNC46108.2020.9045738
Dinh Nguyen, H. Asaeda
{"title":"SmartFIB: Low-Replacement Route Storage for Large Name Space Forwarding","authors":"Dinh Nguyen, H. Asaeda","doi":"10.1109/CCNC46108.2020.9045738","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045738","url":null,"abstract":"We revisit route caching in information-centric networking and propose SmartFIB, a tandem route storage design for dealing with the name forwarding table scalability problem. The proposed route storage not only can quickly adapt to traffic pattern to retain the most frequently referred name prefixes but also is hardware-friendly thanks to its exceptionally low replacement rate. The low replacement, moreover, reduces route lookup rates in settings where centralized name resolution service or scoped route discovery is deployed. Our scheme is lightweight, can enhance route hit rate of small-size fast-memory forwarding information base (FIB), and most remarkably is able to reduce route replacement multiple folds. Evaluated in real-topology networks under a wide variety of parameter settings, the proposed route storage can increase hit rate by 27% compared with a conventional route cache especially with a tiny FIB size, four orders of magnitude smaller than the name prefix space, and more importantly, it can lower route replacement more than 7 times. The results suggest that our proposed scheme is a viable technique to complement route caching in dealing with the name forwarding table scalability problem.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127620046","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
Cache Policy Based on Popularity Dynamics of YouTube Video Content 基于YouTube视频内容流行动态的缓存策略
2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2020-01-01 DOI: 10.1109/CCNC46108.2020.9045318
Koki Nagata, N. Kamiyama, M. Yamamoto
{"title":"Cache Policy Based on Popularity Dynamics of YouTube Video Content","authors":"Koki Nagata, N. Kamiyama, M. Yamamoto","doi":"10.1109/CCNC46108.2020.9045318","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045318","url":null,"abstract":"In recent years, video traffic has rapidly increased, and reducing video traffic is an important issue for network providers. By caching video content at cache servers close to users, network providers can expect to reduce the video traffic in the networks. However, the storage capacity of cache servers is limited, so it is necessary to carefully select contents to be cached to effectively utilize the limited cache resources. In order to make effective use of cache resources, it is important to cache content based on the popularity dynamics of video contents. It is known that video contents have different popularity dynamics in each video category. For example, videos of movie and music categories tend to maintain view counts over long time, whereas the view counts of videos of news and sports categories rapidly decrease. In this paper, we propose a caching method that selects video content to be cached based on the popularity dynamics of video content in each category. To clarify the effectiveness of the proposed caching method, we evaluate the cache hit ratio of the proposed method by a trace-driven simulator using a measured request pattern of YouTube videos. We show that the proposed method improves the cache hit ratio compared with the LRU.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127945496","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
Optimal Power Allocation and Signal Phase Selection in NOMA Wireless Relay Networks NOMA无线中继网络中最优功率分配和信号相位选择
2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2020-01-01 DOI: 10.1109/CCNC46108.2020.9045610
Yen-Chun Liu, Rung-Hung Gau
{"title":"Optimal Power Allocation and Signal Phase Selection in NOMA Wireless Relay Networks","authors":"Yen-Chun Liu, Rung-Hung Gau","doi":"10.1109/CCNC46108.2020.9045610","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045610","url":null,"abstract":"In this paper, we propose a novel approach of optimal power allocation and signal phase selection for NOMA wireless relay networks. Specifically, to optimize the network throughput, the base station and the stronger relay optimally allocate their transmission power, while the weaker relay selects an optimal signal phase. To maximize the end-to-end sum rate, we formulate a non-convex optimization problem and derive novel analytical results. In addition, we propose the four-candidate greedy algorithm for optimal power allocation and signal phase selection in NOMA wireless relay networks. Simulation results show that the proposed greedy algorithm could significantly improve the system performance.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129004676","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
Improving Information Dissemination in Vehicular Opportunistic Networks 改善车载机会网络的信息传播
2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2020-01-01 DOI: 10.1109/CCNC46108.2020.9045314
Leonardo Chancay-Garcia, Jorge Herrera-Tapia, P. Manzoni, Enrique Hernández-Orallo, C. Calafate, Juan-Carlos Cano
{"title":"Improving Information Dissemination in Vehicular Opportunistic Networks","authors":"Leonardo Chancay-Garcia, Jorge Herrera-Tapia, P. Manzoni, Enrique Hernández-Orallo, C. Calafate, Juan-Carlos Cano","doi":"10.1109/CCNC46108.2020.9045314","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045314","url":null,"abstract":"The goal of this paper is to evaluate the dissemination of information using traces of real vehicles from two cities: Rome and San Francisco. Concretely, we perform an analysis of the temporal and spatial characteristics of these traces. Then, using the Epidemic Protocol, we evaluate the diffusion of the information according to the size of the message. As expected, the experiments show that the size of the message has a great impact on the dissemination of these messages. Eventually, we propose an improvement to the Epidemic protocol, called Epidem icX2, which is based on the division of large messages to increase their delivery opportunity. The results show that EpidemicX2 increases the diffusion (number of vehicles receiving the message) reducing the delivery time and the incurred overhead when compared to the Epidemic protocol.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115790101","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
Effective disaster recovery for edge computing against large-scale natural disasters 针对大规模自然灾害的边缘计算有效的灾难恢复
2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2020-01-01 DOI: 10.1109/CCNC46108.2020.9045528
Takuma Tsubaki, Ryota Ishibashi, Takeshi Kuwahara, Yoshikatsu Okazaki
{"title":"Effective disaster recovery for edge computing against large-scale natural disasters","authors":"Takuma Tsubaki, Ryota Ishibashi, Takeshi Kuwahara, Yoshikatsu Okazaki","doi":"10.1109/CCNC46108.2020.9045528","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045528","url":null,"abstract":"With the spread of the Internet of Things (IoT), edge computing (EC) has attracted renewed attention. EC places resources such as CPU and storage closer to the user than cloud computing (CC) to realize low-latency services and/or mitigate network congestion to a cloud. In a telecommunications carrier, resources are placed at telephone central offices (TCOs). At the same time, EC requires disaster recovery for large-scale natural disasters such as earthquakes and tsunami, as TCOs have been damaged by natural disasters in the past. In disaster recovery of CC, data stored in a cloud is backed up to another geographically separated cloud location to prevent data loss due to natural disasters. However, as video IoT which is one of the most popular use cases of EC contains a large amount of data, backing up all data to a cloud causes network congestion to the cloud. Therefore, one way to mitigate network congestion is to back up data utilizing edges (i.e., distributed TCOs). In this paper, we propose disaster recovery for data backup by selecting a data backup location from as many distributed TCOs as possible to mitigate network congestion in EC against large-scale natural disasters. Our proposed method efficiently utilizes resources to prevent data loss due to natural disasters.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116015755","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}
引用次数: 5
Foreseeing Semi-Persistent Scheduling in Mode-4 for 5G enhanced V2X communication 展望5G增强V2X通信模式4的半持久调度
2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2020-01-01 DOI: 10.1109/CCNC46108.2020.9045276
P. J. Honnaiah, N. Maturo, S. Chatzinotas
{"title":"Foreseeing Semi-Persistent Scheduling in Mode-4 for 5G enhanced V2X communication","authors":"P. J. Honnaiah, N. Maturo, S. Chatzinotas","doi":"10.1109/CCNC46108.2020.9045276","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045276","url":null,"abstract":"One of the most dominant applications of Ultra Reliable Low Latency Communication of 5G-NR is V2X communication. For such latency-critical V2X communication, the distributed resource allocation using Semi-Persistent Scheduling (SPS) algorithm designed for out-of-coverage (Mode-4) scenario leads to a high collision probability and requires profuse sensing processes. Therefore, a need for more efficient distributed resource allocation scheme is compelled. In this paper, we investigate the 3GPP proposed SPS scheduling algorithm for its performance and formulate the problem under partial sensing systems. Furthermore, we propose a Foreseeing Semi-Persistent Scheduling (F-SPS) algorithm as an enhancement to the existing methodology, and conclusively, simulations are presented to illustrate the improved performance of the proposed F-SPS scheme in terms of reduced collision probability with an optimised number of sensing processes.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117205797","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
Secrecy Improvement of Cognitive Relay Networks using Modulation Diversity 利用调制分集提高认知中继网络的保密性
2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2020-01-01 DOI: 10.1109/CCNC46108.2020.9045514
Muhammad Ajmal Khan, F. Hassan
{"title":"Secrecy Improvement of Cognitive Relay Networks using Modulation Diversity","authors":"Muhammad Ajmal Khan, F. Hassan","doi":"10.1109/CCNC46108.2020.9045514","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045514","url":null,"abstract":"In this paper, physical-layer security of cognitive relay network under spectrum sharing environment using a decode-and-forward (DF) relay is studied and improved by incorporating modulation diversity into the secondary system. Modulation diversity rotates the signal constellation to make each component of the signal point unique and then interleaves quadrature components of the signal points to affect each component by independent fading channel. Modulation diversity facilitates source and intermediate relay to transmit different symbols to the destination and thus the proposed system transmits two symbols in two time slots compared to the conventional underlay cognitive relay network which transmits one symbol in two time slots. Hence, the secrecy capacity of the proposed system is greater than that of the conventional system. Therefore, the secrecy performance analysis and results of the proposed system are completely different than those of the conventional system. Moreover, it is shown that the secrecy outage probability of the proposed system is improved by 10 times compared to the conventional system. Finally, the closed-form expressions for the secrecy outage probability, probability of non-zero secrecy capacity and probability of intercept of the proposed system are derived and discussed.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117215213","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
Station-centric Access Point Selection Method for Heterogeneous Wi -Fi Environment 异构Wi -Fi环境下以站为中心的接入点选择方法
2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2020-01-01 DOI: 10.1109/CCNC46108.2020.9045347
Shohei Arakaki, Daiki Nobayashi, K. Tsukamoto
{"title":"Station-centric Access Point Selection Method for Heterogeneous Wi -Fi Environment","authors":"Shohei Arakaki, Daiki Nobayashi, K. Tsukamoto","doi":"10.1109/CCNC46108.2020.9045347","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045347","url":null,"abstract":"Wireless LAN access points (APs) and stations (STAs) are widespread. In such an environment, APs with different specifications, such as IEEE 802.11a and 802.11ac, or different settings, such as very high throughput technology, are simultaneously operated in proximity. In this paper, we propose a new STA-centric AP selection method that maximizes the throughput performance while achieving “airtime fairness” on all channels. In our proposed method, each STA dynamically adjusts the frame size based on its own transmission rate for achieving airtime fairness. Furthermore, the STA calculates the predicted throughput of all of available APs, and then selects the AP with the highest predicted throughput for improving the throughput performance. Through simulations, we demonstrated that each STA reliably connects to an AP with better throughput performance, thereby increasing the total throughput performance in a heterogeneous Wi-Fi environment.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115345675","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
An Authorized Access Attack Detection Method for Realtime Intrusion Detection System 一种实时入侵检测系统的授权访问攻击检测方法
2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2020-01-01 DOI: 10.1109/CCNC46108.2020.9045334
Sung-Kwan Youm, Yong-Kab Kim, Kwang-Seong Shin, Eui-Jik Kim
{"title":"An Authorized Access Attack Detection Method for Realtime Intrusion Detection System","authors":"Sung-Kwan Youm, Yong-Kab Kim, Kwang-Seong Shin, Eui-Jik Kim","doi":"10.1109/CCNC46108.2020.9045334","DOIUrl":"https://doi.org/10.1109/CCNC46108.2020.9045334","url":null,"abstract":"Recently, a malicious user breaks into the network and destroys the entire network. In particular, it destroys the whole network through unauthorized access attacks with a contaminated system. In this paper, we propose a fast unauthorized access attack detection method for the real-time intrusion detection system. Conventionally, unauthorized access detection was performed by supervised learning to analyze all collected traffic characteristics. In the proposed method, the normal traffic is classified through unsupervised learning prior to a supervised learning, and the intrusion detection of supervised learning for unauthorized access to the normal traffic is not performed. Here, our scheme makes up arbitrary test traffic to pass through a gateway in order to classify the normal traffic. A supervised learning is performed as to classify unauthorized access attack types on abnormal traffic. Therefore, we verified that the proposed method can classify normal traffic and detect unauthorized access attacks against abnormal traffic and shorten the time than the conventional method by simulation.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114757224","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学术文献互助群
群 号:481959085
Book学术官方微信