Pub Date : 2020-06-01DOI: 10.1109/ICC40277.2020.9149451
Roshith Sebastian, G. Giambene, Tomaso de Cola
The expansion of the maritime industry with the increase of ship data traffic calls for the support of satellite communications not only for bandwidth-hungry applications for passengers and crew but also for Internet of Things applications. In this paper, we address the problem of efficiently managing the distribution of the vast amount of sensor data from ships to remote control centers and harbor authorities. An efficient solution to tackle this problem is adopting an Information-Centric Networking (ICN) approach. ICN is based here on Named Data Networking (NDN), which is one of the most efficient ICN approaches. We propose an efficient naming scheme for NDN, where the processing of local data from sensors allows improving the mean delay to deliver the sensor data. A simulation approach has allowed us to validate our proposed approach against the hierarchical naming scheme of NDN.
{"title":"Information-Centric Networking Application to Maritime Satellite Communications","authors":"Roshith Sebastian, G. Giambene, Tomaso de Cola","doi":"10.1109/ICC40277.2020.9149451","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9149451","url":null,"abstract":"The expansion of the maritime industry with the increase of ship data traffic calls for the support of satellite communications not only for bandwidth-hungry applications for passengers and crew but also for Internet of Things applications. In this paper, we address the problem of efficiently managing the distribution of the vast amount of sensor data from ships to remote control centers and harbor authorities. An efficient solution to tackle this problem is adopting an Information-Centric Networking (ICN) approach. ICN is based here on Named Data Networking (NDN), which is one of the most efficient ICN approaches. We propose an efficient naming scheme for NDN, where the processing of local data from sensors allows improving the mean delay to deliver the sensor data. A simulation approach has allowed us to validate our proposed approach against the hierarchical naming scheme of NDN.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114843549","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}
As massive research efforts are poured into server-side DNS security enhancement in online cloud service platforms, sophisticated APTs tend to develop client-side DNS attacks, where defenders only have limited resources and abilities. The collaborative DNS attack is a representative newest client-side paradigm to stealthily undermine user cache by falsifying DNS responses. Different from existing static methods, in this paper, we propose a moving target defense solution named multi-vNIC intelligent mutation to free defenders from arduous work and thwart elusive client-side DNS attack in the meantime. Multiple virtual network interface cards are created and switched in a mutating manner. Thus attackers have to blindly guess the actual NIC with a high risk of exposure. Firstly, we construct a dynamic game-theoretic model to capture the main characteristics of both attacker and defender. Secondly, a reinforcement learning mechanism is developed to generate adaptive optimal defense strategy. Experiment results also highlight the security performance of our defense method compared to several state-of-the-art technologies.
{"title":"Multi-vNIC Intelligent Mutation: A Moving Target Defense to thwart Client-side DNS Cache Attack","authors":"Zan Zhou, Changqiao Xu, Tengchao Ma, Xiaohui Kuang","doi":"10.1109/ICC40277.2020.9148655","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148655","url":null,"abstract":"As massive research efforts are poured into server-side DNS security enhancement in online cloud service platforms, sophisticated APTs tend to develop client-side DNS attacks, where defenders only have limited resources and abilities. The collaborative DNS attack is a representative newest client-side paradigm to stealthily undermine user cache by falsifying DNS responses. Different from existing static methods, in this paper, we propose a moving target defense solution named multi-vNIC intelligent mutation to free defenders from arduous work and thwart elusive client-side DNS attack in the meantime. Multiple virtual network interface cards are created and switched in a mutating manner. Thus attackers have to blindly guess the actual NIC with a high risk of exposure. Firstly, we construct a dynamic game-theoretic model to capture the main characteristics of both attacker and defender. Secondly, a reinforcement learning mechanism is developed to generate adaptive optimal defense strategy. Experiment results also highlight the security performance of our defense method compared to several state-of-the-art technologies.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115074863","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}
Pub Date : 2020-06-01DOI: 10.1109/ICC40277.2020.9149368
Wentao Zhang, M. Dong, K. Ota, Jianhua Li, Wu Yang, Jun Wu
Standardization facilitates the management of Internet of Things (IoT) and expedites the generation of IoT big data. However, there is not yet a big data management architecture matching such IoT. Current methodologies, which mainly adopts Simple Network Management Protocol (SNMP), is defective in the following two aspects. First, facing ubiquitous sensor and actuator nodes, timeliness and scalability can hardly be assured by the centralized paradigm. Second, existing management infrastructure cannot perform data analysis and is thus not smart enough, which wastes the value of big data. To address these issues, we propose a big data management architecture for standardized IoT. First, we design a scalable and smart SNMP, which has a hierarchical and decentralized paradigm, and is embedded with edge MapReduce to perform distributed big data analysis. Second, we put forward an Edge MapReduce-based Random Matrix Model (RMM) algorithm for anomaly detection in IoT, which is parallelized and particularly suitable for high-dimensional big data. Third, we conduct a case study of smart grids, where the architecture is implemented using virtual machines and deployed to detect malfunctions in electrical grids. Experiment results demonstrate that the architecture has good performance in terms of timeliness and scalability.
{"title":"A Big Data Management Architecture for Standardized IoT Based on Smart Scalable SNMP","authors":"Wentao Zhang, M. Dong, K. Ota, Jianhua Li, Wu Yang, Jun Wu","doi":"10.1109/ICC40277.2020.9149368","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9149368","url":null,"abstract":"Standardization facilitates the management of Internet of Things (IoT) and expedites the generation of IoT big data. However, there is not yet a big data management architecture matching such IoT. Current methodologies, which mainly adopts Simple Network Management Protocol (SNMP), is defective in the following two aspects. First, facing ubiquitous sensor and actuator nodes, timeliness and scalability can hardly be assured by the centralized paradigm. Second, existing management infrastructure cannot perform data analysis and is thus not smart enough, which wastes the value of big data. To address these issues, we propose a big data management architecture for standardized IoT. First, we design a scalable and smart SNMP, which has a hierarchical and decentralized paradigm, and is embedded with edge MapReduce to perform distributed big data analysis. Second, we put forward an Edge MapReduce-based Random Matrix Model (RMM) algorithm for anomaly detection in IoT, which is parallelized and particularly suitable for high-dimensional big data. Third, we conduct a case study of smart grids, where the architecture is implemented using virtual machines and deployed to detect malfunctions in electrical grids. Experiment results demonstrate that the architecture has good performance in terms of timeliness and scalability.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116887665","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}
Pub Date : 2020-06-01DOI: 10.1109/ICC40277.2020.9149348
Yilei Lin, T. He, Shiqiang Wang, Kevin S. Chan
Traditional network topology inference aims at reconstructing the routing trees rooted at each probing source from end-to-end measurements. However, due to emerging technologies such as network function virtualization, software defined networking, and segment routing, many modern networks are capable of supporting generalized forwarding that can create complex routing topologies different from routing trees. In this work, we take a first step towards closing this gap by proposing methods to infer the routing topology (referred to as 1-1-N topology) from a single source to multiple destinations, where routes may be required to traverse a given waypoint. We first thoroughly study the special case of 1-1-2 topologies, showing that even this seemingly simple case is highly nontrivial with 36 possibilities. We then demonstrate how the solution to the special case can be used as building blocks to infer 1-1-N topologies. The inferred topology is proved to be equivalent to the ground truth up to splitting/combining edges in the same category.
{"title":"Waypoint-based Topology Inference","authors":"Yilei Lin, T. He, Shiqiang Wang, Kevin S. Chan","doi":"10.1109/ICC40277.2020.9149348","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9149348","url":null,"abstract":"Traditional network topology inference aims at reconstructing the routing trees rooted at each probing source from end-to-end measurements. However, due to emerging technologies such as network function virtualization, software defined networking, and segment routing, many modern networks are capable of supporting generalized forwarding that can create complex routing topologies different from routing trees. In this work, we take a first step towards closing this gap by proposing methods to infer the routing topology (referred to as 1-1-N topology) from a single source to multiple destinations, where routes may be required to traverse a given waypoint. We first thoroughly study the special case of 1-1-2 topologies, showing that even this seemingly simple case is highly nontrivial with 36 possibilities. We then demonstrate how the solution to the special case can be used as building blocks to infer 1-1-N topologies. The inferred topology is proved to be equivalent to the ground truth up to splitting/combining edges in the same category.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116894955","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}
Pub Date : 2020-06-01DOI: 10.1109/ICC40277.2020.9149313
Chih-Yen Chen, Chih-Hang Wang, Sheng-Hao Chiang, De-Nian Yang, W. Liao
With the emergence of innovative applications for Virtual Reality (VR) in touring, E-commerce, and social activities, high-quality VR video streaming becomes essential. To support numerous wireless VR users, this paper aims to leverage video synthesis techniques to effectively reduce the multicast bandwidth consumption. It synthesizes the view in the video for a user from the one of a nearby user with similar Field of View (FoV), under the virtual distance and view angle constraints. We first formulate a new optimization problem, named VR Content Sharing and Multicasting (VCSM), and prove the NP-hardness. Then, we propose View Sharing Relation Graph (VSRG) to model the synthesis relation between each pair of views. We then design a new algorithm, named Bandwidth-Efficient Multicast with Synthesis (BEMS) to select multicast views and the corresponding MCS in wireless networks. Simulation results show that BEMS can effectively reduce bandwidth consumption by more than 50% compared with state-of-the-art wireless transmission schemes.
{"title":"Multicast with View Synthesis for Wireless Virtual Reality","authors":"Chih-Yen Chen, Chih-Hang Wang, Sheng-Hao Chiang, De-Nian Yang, W. Liao","doi":"10.1109/ICC40277.2020.9149313","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9149313","url":null,"abstract":"With the emergence of innovative applications for Virtual Reality (VR) in touring, E-commerce, and social activities, high-quality VR video streaming becomes essential. To support numerous wireless VR users, this paper aims to leverage video synthesis techniques to effectively reduce the multicast bandwidth consumption. It synthesizes the view in the video for a user from the one of a nearby user with similar Field of View (FoV), under the virtual distance and view angle constraints. We first formulate a new optimization problem, named VR Content Sharing and Multicasting (VCSM), and prove the NP-hardness. Then, we propose View Sharing Relation Graph (VSRG) to model the synthesis relation between each pair of views. We then design a new algorithm, named Bandwidth-Efficient Multicast with Synthesis (BEMS) to select multicast views and the corresponding MCS in wireless networks. Simulation results show that BEMS can effectively reduce bandwidth consumption by more than 50% compared with state-of-the-art wireless transmission schemes.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117139382","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}
Pub Date : 2020-06-01DOI: 10.1109/ICC40277.2020.9149225
Haifan Yin, Haiquan Wang, Yingzhuang Liu, D. Gesbert
Massive MIMO is a key technology for 5th generation (5G) mobile communications. The large excess of base station (BS) antennas brings unprecedented spectral efficiency. However, during the initial phase of industrial testing, a practical challenge arises which undermines the actual deployment of massive MIMO and is related to mobility. In fact, testing teams reported that in moderate-mobility scenarios, e.g., 30 km/h of UE speed, the performance may drop 50% compared to the low-mobility scenario, a problem not foreseen by theoretical papers on the subject. In order to deal with this challenge, we propose a Prony-based angular-delay domain (PAD) prediction method, which is built on exploiting the angle-delay-Doppler structure of the multipath. Our theoretical analysis shows that when the number of base station antennas and the bandwidth are large, the prediction error of our PAD algorithm converges to zero for any UE velocity level, provided that only two accurate enough previous channel samples are available. Simulation results show that under the realistic channel model of 3GPP in rich scattering environment, our proposed method even approaches the performance of stationary scenarios where the channels do not vary at all.
{"title":"Dealing with the Mobility Problem of Massive MIMO using Extended Prony’s Method","authors":"Haifan Yin, Haiquan Wang, Yingzhuang Liu, D. Gesbert","doi":"10.1109/ICC40277.2020.9149225","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9149225","url":null,"abstract":"Massive MIMO is a key technology for 5th generation (5G) mobile communications. The large excess of base station (BS) antennas brings unprecedented spectral efficiency. However, during the initial phase of industrial testing, a practical challenge arises which undermines the actual deployment of massive MIMO and is related to mobility. In fact, testing teams reported that in moderate-mobility scenarios, e.g., 30 km/h of UE speed, the performance may drop 50% compared to the low-mobility scenario, a problem not foreseen by theoretical papers on the subject. In order to deal with this challenge, we propose a Prony-based angular-delay domain (PAD) prediction method, which is built on exploiting the angle-delay-Doppler structure of the multipath. Our theoretical analysis shows that when the number of base station antennas and the bandwidth are large, the prediction error of our PAD algorithm converges to zero for any UE velocity level, provided that only two accurate enough previous channel samples are available. Simulation results show that under the realistic channel model of 3GPP in rich scattering environment, our proposed method even approaches the performance of stationary scenarios where the channels do not vary at all.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116448215","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}
Pub Date : 2020-06-01DOI: 10.1109/ICC40277.2020.9149212
E. D. Souza, Omid Ardakanian, I. Nikolaidis
The growing adoption of Distributed Energy Re-sources (DER) in low-voltage distribution grids calls for new feedback control algorithms that rely on quasi-real-time data collected by remote sensors. The design and evaluation of such algorithms necessitates a prudent and comprehensive approach since these algorithms require a tight integration of power and communication systems. A simple link failure or a sophisticated cyberattack launched against the grid's monitoring, communication, and control infrastructure could rapidly grow out of control, making the grid unstable. We investigate the design and implementation of a high-fidelity smart grid simulation platform which integrates a network simulator and a power flow simulator using the Mosaik co-simulation framework. The platform allows for evaluating the performance of new control algorithms and understanding dynamics of modern distribution grids. Example case studies are presented to validate the proposed platform.
{"title":"A Co-simulation Platform for Evaluating Cyber Security and Control Applications in the Smart Grid","authors":"E. D. Souza, Omid Ardakanian, I. Nikolaidis","doi":"10.1109/ICC40277.2020.9149212","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9149212","url":null,"abstract":"The growing adoption of Distributed Energy Re-sources (DER) in low-voltage distribution grids calls for new feedback control algorithms that rely on quasi-real-time data collected by remote sensors. The design and evaluation of such algorithms necessitates a prudent and comprehensive approach since these algorithms require a tight integration of power and communication systems. A simple link failure or a sophisticated cyberattack launched against the grid's monitoring, communication, and control infrastructure could rapidly grow out of control, making the grid unstable. We investigate the design and implementation of a high-fidelity smart grid simulation platform which integrates a network simulator and a power flow simulator using the Mosaik co-simulation framework. The platform allows for evaluating the performance of new control algorithms and understanding dynamics of modern distribution grids. Example case studies are presented to validate the proposed platform.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123448187","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}
Pub Date : 2020-06-01DOI: 10.1109/ICC40277.2020.9148812
P. Santini, Massimo Battaglioni, F. Chiaraluce, M. Baldi, Edoardo Persichetti
We introduce a new family of linear block codes over $mathbb{Z}_{q}$ that we name low-Lee-density parity-check (LLDPC) codes. These codes, which are embedded with the Lee metric, are characterized by a parity-check matrix whose rows and columns have low Lee weight. We propose general constructions of LLDPC codes and devise an efficient iterative decoding algorithm for them, with complexity that grows linearly with the code length. We assess the error rate performance of these codes through numerical simulations.
{"title":"Low-Lee-Density Parity-Check Codes","authors":"P. Santini, Massimo Battaglioni, F. Chiaraluce, M. Baldi, Edoardo Persichetti","doi":"10.1109/ICC40277.2020.9148812","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148812","url":null,"abstract":"We introduce a new family of linear block codes over $mathbb{Z}_{q}$ that we name low-Lee-density parity-check (LLDPC) codes. These codes, which are embedded with the Lee metric, are characterized by a parity-check matrix whose rows and columns have low Lee weight. We propose general constructions of LLDPC codes and devise an efficient iterative decoding algorithm for them, with complexity that grows linearly with the code length. We assess the error rate performance of these codes through numerical simulations.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122052326","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}
Pub Date : 2020-06-01DOI: 10.1109/ICC40277.2020.9148968
G. Giambene, Md. Saifur Rahman, A. Vinel
Today’s vehicles are expected to interact with each other to improve road safety and efficiency. We refer here to the LTE-V standard defined by 3GPP Release 14. In particular, we consider the platoon scenario where a vehicle, acting as a leader, coordinates the movement of a group of vehicles. LTE-V Mode 3 is assumed where the eNB has the control of the allocation of V2V transmission resources to the platoon. V2V communications adopt the underlay mode, reusing the resources of common cellular users. This paper provides an analytical model to determine the V2V link outage probability, the Cooperative Awareness Message (CAM) loss probability after a generic number of reattempts, and the mean number of transmission attempts to deliver the CAM message successfully, taking shadowing correlation effects into account. This model has been validated using simulations.
{"title":"Analysis of V2V Sidelink Communications for Platoon Applications","authors":"G. Giambene, Md. Saifur Rahman, A. Vinel","doi":"10.1109/ICC40277.2020.9148968","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148968","url":null,"abstract":"Today’s vehicles are expected to interact with each other to improve road safety and efficiency. We refer here to the LTE-V standard defined by 3GPP Release 14. In particular, we consider the platoon scenario where a vehicle, acting as a leader, coordinates the movement of a group of vehicles. LTE-V Mode 3 is assumed where the eNB has the control of the allocation of V2V transmission resources to the platoon. V2V communications adopt the underlay mode, reusing the resources of common cellular users. This paper provides an analytical model to determine the V2V link outage probability, the Cooperative Awareness Message (CAM) loss probability after a generic number of reattempts, and the mean number of transmission attempts to deliver the CAM message successfully, taking shadowing correlation effects into account. This model has been validated using simulations.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122106400","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}
Pub Date : 2020-06-01DOI: 10.1109/icc40277.2020.9148657
Anqi Wei, Tong Ye, Guangqiang He, J. He
In recent years, Ethernet passive optical network (EPON) has been considered as a promising candidate of mobile front-haul networks, since it can provide high capacity for bandwidth-hungry enhanced mobile broadband (eMBB) traffic. However, the EPON cannot support ultra-reliable and low latency communication (uRLLC) traffic, which is sporadic, highly unpredictable, and delay-sensitive. To address this problem, this paper devises a hybrid dynamic bandwidth allocation (DBA) algorithm, which treats the uRLLC traffic as high-priority traffic. In particular, the hybrid DBA algorithm schedules the uRLLC traffic in a competitive manner every other fixed time interval and polls the eMBB traffic in a round-robin manner. Our simulation results show that the hybrid DBA algorithm can work very well in the network with 16 ONUs.
近年来，以太网无源光网络(EPON)被认为是一种很有前途的移动前传网络，因为它可以为带宽紧张的增强型移动宽带(eMBB)业务提供高容量。但是，由于uRLLC (ultra-reliable and low latency communication)是一种零星的、高度不可预测的、对延迟敏感的业务，所以EPON不支持uRLLC (ultra-reliable and low latency communication)业务。为了解决这一问题，本文设计了一种混合动态带宽分配(DBA)算法，该算法将uRLLC流量视为高优先级流量。特别是，混合DBA算法每隔一个固定的时间间隔以竞争的方式调度uRLLC流量，并以轮询的方式轮询eMBB流量。仿真结果表明，混合DBA算法在有16个onu的网络中可以很好地工作。
{"title":"A Hybrid DBA Algorithm for EPON-based Mobile Front-haul Networks","authors":"Anqi Wei, Tong Ye, Guangqiang He, J. He","doi":"10.1109/icc40277.2020.9148657","DOIUrl":"https://doi.org/10.1109/icc40277.2020.9148657","url":null,"abstract":"In recent years, Ethernet passive optical network (EPON) has been considered as a promising candidate of mobile front-haul networks, since it can provide high capacity for bandwidth-hungry enhanced mobile broadband (eMBB) traffic. However, the EPON cannot support ultra-reliable and low latency communication (uRLLC) traffic, which is sporadic, highly unpredictable, and delay-sensitive. To address this problem, this paper devises a hybrid dynamic bandwidth allocation (DBA) algorithm, which treats the uRLLC traffic as high-priority traffic. In particular, the hybrid DBA algorithm schedules the uRLLC traffic in a competitive manner every other fixed time interval and polls the eMBB traffic in a round-robin manner. Our simulation results show that the hybrid DBA algorithm can work very well in the network with 16 ONUs.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116868775","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：