Pub Date : 2020-06-01DOI: 10.1109/ICC40277.2020.9148659
Abdallah Ouhab, Thiago Abreu, Hachem Slimani, A. Mellouk
In the context of large-scale Internet of Things (IoT), one of the main issues comes from the lack of an efficient routing protocol that could handle thousands of devices and provide a low-power forwarding mechanism for huge amounts of data. Furthermore, this routing protocol should cope with the intrinsic device-to-device communications paradigm of IoT, where nodes no longer need an intermediate station for communication and synchronizing, in order to exploit all options to deliver a better quality of service (QoS) for the network. Although many solutions have been proposed to meet QoS requirements for various applications based on IoT, they usually do not provide significant increase on a network performance when the number of nodes becomes too large. Therefore, in this work, we provide a new modelling paradigm, organized on a two-level control mechanism, to overcome this problem. For the first level, we propose a new Routing Protocol for Low-Power and Lossy Networks (RPL) approach based on multi-hop clustering technique (MHC-RPL). It is used as a local control to organize nodes in clusters, in order to reduce energy consumption in the IoT. The second level uses Software Defined Networking (SDN) with Q-routing algorithm for intelligent management of the global network. Our results show that the proposed model provides significant better results in terms of end-to-end delay, packet delivery ratio and energy-consumption than current state-of-the-art.
{"title":"Energy-efficient clustering and routing algorithm for large-scale SDN-based IoT monitoring","authors":"Abdallah Ouhab, Thiago Abreu, Hachem Slimani, A. Mellouk","doi":"10.1109/ICC40277.2020.9148659","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148659","url":null,"abstract":"In the context of large-scale Internet of Things (IoT), one of the main issues comes from the lack of an efficient routing protocol that could handle thousands of devices and provide a low-power forwarding mechanism for huge amounts of data. Furthermore, this routing protocol should cope with the intrinsic device-to-device communications paradigm of IoT, where nodes no longer need an intermediate station for communication and synchronizing, in order to exploit all options to deliver a better quality of service (QoS) for the network. Although many solutions have been proposed to meet QoS requirements for various applications based on IoT, they usually do not provide significant increase on a network performance when the number of nodes becomes too large. Therefore, in this work, we provide a new modelling paradigm, organized on a two-level control mechanism, to overcome this problem. For the first level, we propose a new Routing Protocol for Low-Power and Lossy Networks (RPL) approach based on multi-hop clustering technique (MHC-RPL). It is used as a local control to organize nodes in clusters, in order to reduce energy consumption in the IoT. The second level uses Software Defined Networking (SDN) with Q-routing algorithm for intelligent management of the global network. Our results show that the proposed model provides significant better results in terms of end-to-end delay, packet delivery ratio and energy-consumption than current state-of-the-art.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"382 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":"116328086","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.9149432
Huanzhuo Wu, Yunbin Shen, Jiajing Zhang, I. Tsokalo, H. Salah, F. Fitzek
In time-sensitive applications within industry 4.0, e.g. anomaly detection and human-in-the-loop, the data generated by multiple sources should be quickly separated to give the applications more time to make decisions and ultimately improve production performance. In this paper, we propose a Component-dependent Independent Component Analysis (CdICA) method that can separate multiple randomly mixed signals into independent source signals faster, for further data analysis in time-sensitive applications. Based on the Independent Component Analysis (ICA) algorithm, we first generate an initial separation matrix relying on the known mixture components, so that the separation speed of the traditional ICA can be increased. Our simulative results show that the CdICA method reduces the separation time by 55% to 83% compared to the most notable related work called FastICA and meanwhile it does not diminish the accuracy of the separation.
{"title":"Component-Dependent Independent Component Analysis for Time-Sensitive Applications","authors":"Huanzhuo Wu, Yunbin Shen, Jiajing Zhang, I. Tsokalo, H. Salah, F. Fitzek","doi":"10.1109/ICC40277.2020.9149432","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9149432","url":null,"abstract":"In time-sensitive applications within industry 4.0, e.g. anomaly detection and human-in-the-loop, the data generated by multiple sources should be quickly separated to give the applications more time to make decisions and ultimately improve production performance. In this paper, we propose a Component-dependent Independent Component Analysis (CdICA) method that can separate multiple randomly mixed signals into independent source signals faster, for further data analysis in time-sensitive applications. Based on the Independent Component Analysis (ICA) algorithm, we first generate an initial separation matrix relying on the known mixture components, so that the separation speed of the traditional ICA can be increased. Our simulative results show that the CdICA method reduces the separation time by 55% to 83% compared to the most notable related work called FastICA and meanwhile it does not diminish the accuracy of the separation.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"135 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":"121548853","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}
It has been shown that long pilots should be employed in a Poisson channel with inter-symbol interference to obtain accurate channel estimate, which may reduce the transmission efficiency. In this paper, an iterative data-aided channel estimation and signal detection algorithm is proposed with significant shortened overhead but can approach the bit-error rate performance under perfect channel state information. In this algorithm, periodic pilots are not required and only one short pilot sequence is utilized to obtain a rough initial channel estimate, which will be strengthened and updated by iteratively employing the blockwise data symbols as additional pilots. It is proved that treating the detected data symbols as pilots is a biased estimation, where the bias is proportional to the bit-error rate. Numerical results show that the proposed approach employing only 20 initial pilots can approach the optimal bound. The same bound needs to be achieved by assigning at least 500 pilots using periodic pilot based channel estimation.
{"title":"Data-Aided Channel Estimation for Poisson Channels With Inter-Symbol Interference","authors":"Beiyuan Liu, Chen Gong, Julian Cheng, Zhengyuan Xu","doi":"10.1109/ICC40277.2020.9148723","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148723","url":null,"abstract":"It has been shown that long pilots should be employed in a Poisson channel with inter-symbol interference to obtain accurate channel estimate, which may reduce the transmission efficiency. In this paper, an iterative data-aided channel estimation and signal detection algorithm is proposed with significant shortened overhead but can approach the bit-error rate performance under perfect channel state information. In this algorithm, periodic pilots are not required and only one short pilot sequence is utilized to obtain a rough initial channel estimate, which will be strengthened and updated by iteratively employing the blockwise data symbols as additional pilots. It is proved that treating the detected data symbols as pilots is a biased estimation, where the bias is proportional to the bit-error rate. Numerical results show that the proposed approach employing only 20 initial pilots can approach the optimal bound. The same bound needs to be achieved by assigning at least 500 pilots using periodic pilot based channel estimation.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"75 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":"121554380","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.9149253
Chieh-Yu Yu, Che-Rung Lee, Po-Jui Tsao, Yu-Shiang Lin, T. Chiueh
Fault tolerance is the key technology to achieve high availability for non-stop and long-lasting services, which is usually carried out by the virtualization technology in the era of cloud computing. However, most virtualization-based fault tolerance methods only focus on the resilience of a single server (Individual FT), which can cause great performance degradation for the services that have heavy communication among multiple nodes. One of the solutions is the Group Fault Tolerance (Group FT) technique, which synchronizes a group of VMs within single fault tolerance states to avoid the latency accumulation problem. In this paper, we present an efficient implementation of Group FT, as well as the methods to enhance the performance of Group FT’s failover process. Experiments show that Group FT can reduce 88% system latency of the Individual FT when running the OLTP workload in SysBench. Similar results are also shown for a more complicated synthetic multi-tier architecture. Moreover, the performance of the failover process for Group FT is also optimized so that it is comparable to the performance of Individual FT.
容错是实现不间断、长时间服务高可用性的关键技术，在云计算时代通常通过虚拟化技术来实现。然而，大多数基于虚拟化的容错方法只关注单个服务器(Individual FT)的弹性，这可能会导致在多个节点之间有大量通信的服务的性能下降。其中一种解决方案是组容错(Group Fault Tolerance, Group FT)技术，该技术在单个容错状态下同步一组虚拟机，以避免延迟积累问题。在本文中，我们提出了一种有效的群FT实现方法，以及提高群FT故障转移过程性能的方法。实验表明，在SysBench中运行OLTP工作负载时，Group FT可以将单个FT的系统延迟降低88%。对于更复杂的合成多层体系结构也显示了类似的结果。此外，还对Group FT的故障转移过程的性能进行了优化，使其与Individual FT的性能相当。
{"title":"Efficient Group Fault Tolerance for Multi-tier Services in Cloud Environments","authors":"Chieh-Yu Yu, Che-Rung Lee, Po-Jui Tsao, Yu-Shiang Lin, T. Chiueh","doi":"10.1109/icc40277.2020.9149253","DOIUrl":"https://doi.org/10.1109/icc40277.2020.9149253","url":null,"abstract":"Fault tolerance is the key technology to achieve high availability for non-stop and long-lasting services, which is usually carried out by the virtualization technology in the era of cloud computing. However, most virtualization-based fault tolerance methods only focus on the resilience of a single server (Individual FT), which can cause great performance degradation for the services that have heavy communication among multiple nodes. One of the solutions is the Group Fault Tolerance (Group FT) technique, which synchronizes a group of VMs within single fault tolerance states to avoid the latency accumulation problem. In this paper, we present an efficient implementation of Group FT, as well as the methods to enhance the performance of Group FT’s failover process. Experiments show that Group FT can reduce 88% system latency of the Individual FT when running the OLTP workload in SysBench. Similar results are also shown for a more complicated synthetic multi-tier architecture. Moreover, the performance of the failover process for Group FT is also optimized so that it is comparable to the performance of Individual FT.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"2015 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":"121650708","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}
5G will provide a flexible and programmable infrastructure, allowing different networks to share the same access network. A way to respond to the diverse service requirements of 5G while reducing both CAPEX and OPEX is to adopt cloud-native architectures. In this context, micro-services software design, the corner stone of cloud-native architecture, seems to be ideal for 5G. However, despite its several advantages, micro-services raise new challenges which slow its adoption down in the NFV ecosystem. Indeed, steering the expected 5G traffic between cloud-native network function is extremely challenging and is still under-investigated. In this paper, we address the service function chaining (SFC) in micro-service based network function virtualization (NFV) ecosystem from the view of the traffic steering. Specifically, we design and implement a cloud-native SFC framework offering efficient traffic steering mechanisms while considering the network state of the underlying NFV infrastructure. In this context, an optimized network-aware load balancing strategy is proposed. Based on extensive experiments, the results obtained show that our strategy achieved good results in terms of i) end-to-end latency and ii) deployment time.
{"title":"Cloud-native Service Function Chaining for 5G based on Network Service Mesh","authors":"Boutheina Dab, Ilhem Fajjari, Mathieu Rohon, Cyril Auboin, Arnaud Diquélou","doi":"10.1109/ICC40277.2020.9149045","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9149045","url":null,"abstract":"5G will provide a flexible and programmable infrastructure, allowing different networks to share the same access network. A way to respond to the diverse service requirements of 5G while reducing both CAPEX and OPEX is to adopt cloud-native architectures. In this context, micro-services software design, the corner stone of cloud-native architecture, seems to be ideal for 5G. However, despite its several advantages, micro-services raise new challenges which slow its adoption down in the NFV ecosystem. Indeed, steering the expected 5G traffic between cloud-native network function is extremely challenging and is still under-investigated. In this paper, we address the service function chaining (SFC) in micro-service based network function virtualization (NFV) ecosystem from the view of the traffic steering. Specifically, we design and implement a cloud-native SFC framework offering efficient traffic steering mechanisms while considering the network state of the underlying NFV infrastructure. In this context, an optimized network-aware load balancing strategy is proposed. Based on extensive experiments, the results obtained show that our strategy achieved good results in terms of i) end-to-end latency and ii) deployment time.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"48 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":"124348622","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.9148674
Takumi Takahashi, S. Ibi, Antti Tölli, S. Sampei
This paper deals with mmWave overloaded multiuser multi-input multi-output (MU-MIMO) detection, where the number of receive antennas is less than that of transmitted streams. Belief propagation (BP) is well known strategy for achieving large-scale MU detection (MUD) with low-complexity and high-accuracy. However, in mmWave massive MUD, the BP-based signal detector is subject to ill convergence behavior of iterative detection due to under-determined problem induced by spatial overloading and strong correlation among user channels induced by narrow angular spread of receive signal and line-of-sight (LOS) environments. To alleviate these impairments, we propose a novel iterative MUD approach based on beam-domain subspace marginalized BP (SMBP). Exploiting the approximate sparsity of beam-domain channels, the maximum likelihood (ML) principle is used to combine the strongly correlated signal subspace with reduced dimension while the BP-based detection is used for the remaining complementary subspace. The space partitioning criterion is adaptively determined based on channel state information (CSI) so that the two subspaces are as orthogonal as possible. Numerical results show that the proposed method is able to serve a massive number of wireless connections with low computational complexity even in the LOS environment, while providing excellent BER performance.
{"title":"Subspace Marginalized Belief Propagation for mmWave Overloaded MIMO Signal Detection","authors":"Takumi Takahashi, S. Ibi, Antti Tölli, S. Sampei","doi":"10.1109/ICC40277.2020.9148674","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148674","url":null,"abstract":"This paper deals with mmWave overloaded multiuser multi-input multi-output (MU-MIMO) detection, where the number of receive antennas is less than that of transmitted streams. Belief propagation (BP) is well known strategy for achieving large-scale MU detection (MUD) with low-complexity and high-accuracy. However, in mmWave massive MUD, the BP-based signal detector is subject to ill convergence behavior of iterative detection due to under-determined problem induced by spatial overloading and strong correlation among user channels induced by narrow angular spread of receive signal and line-of-sight (LOS) environments. To alleviate these impairments, we propose a novel iterative MUD approach based on beam-domain subspace marginalized BP (SMBP). Exploiting the approximate sparsity of beam-domain channels, the maximum likelihood (ML) principle is used to combine the strongly correlated signal subspace with reduced dimension while the BP-based detection is used for the remaining complementary subspace. The space partitioning criterion is adaptively determined based on channel state information (CSI) so that the two subspaces are as orthogonal as possible. Numerical results show that the proposed method is able to serve a massive number of wireless connections with low computational complexity even in the LOS environment, while providing excellent BER performance.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"48 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":"121436763","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.9148861
Jiayi Zhang, Jingyi Fan, B. Ai, D. W. K. Ng
This paper considers non-orthogonal multiple access (NOMA) based cell-free massive multiple-input multiple-output (mMIMO) systems over spatially correlated Rician fading channels. Closed-form downlink achievable sum-rate expression is derived by taking into account spatial correlation among multi-antenna access points, inter-cluster interference, intra-cluster pilot contamination, and imperfect successive interference cancellation (SIC). In particular, we propose an intra-cluster power allocation design for improving the system performance. Furthermore, we investigate the downlink performance with both minimum mean-squared error (MMSE) and element-wise MMSE channel estimation. It is interesting to find out that the correlation magnitude has a negligible effect on the system sum-rate in spatially correlated Rician fading channels. The numerical results validate the correctness of the presented results and confirm the effectiveness of the proposed power allocation.
{"title":"NOMA-Based Cell-Free Massive MIMO Over Spatially Correlated Rician Fading Channels","authors":"Jiayi Zhang, Jingyi Fan, B. Ai, D. W. K. Ng","doi":"10.1109/ICC40277.2020.9148861","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148861","url":null,"abstract":"This paper considers non-orthogonal multiple access (NOMA) based cell-free massive multiple-input multiple-output (mMIMO) systems over spatially correlated Rician fading channels. Closed-form downlink achievable sum-rate expression is derived by taking into account spatial correlation among multi-antenna access points, inter-cluster interference, intra-cluster pilot contamination, and imperfect successive interference cancellation (SIC). In particular, we propose an intra-cluster power allocation design for improving the system performance. Furthermore, we investigate the downlink performance with both minimum mean-squared error (MMSE) and element-wise MMSE channel estimation. It is interesting to find out that the correlation magnitude has a negligible effect on the system sum-rate in spatially correlated Rician fading channels. The numerical results validate the correctness of the presented results and confirm the effectiveness of the proposed power allocation.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"47 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":"121744988","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.9149023
Bhawna Ahuja, Deepak Mishra, R. Bose
To address the growing concern of security in advance communication networks like Internet of things (IoT), this work aims to propose an optimisation framework for fair subcarrier allocation to encounter a full duplex (FD) attacker. We first analyse the performance of secure communication in a multi-user IoT system against an FD hybrid attacker possessing the capability of concurrent eavesdropping and jamming. Specifically, a novel analytical expression has been derived for the exact intercept probability considering incomplete information of all ungoverned communication links that include self-interference link along with eavesdropping and jamming ones. The optimisation problem of subcarrier allocation is then formulated as an integer linear program. Finally, a low-complexity suboptimal solution is proposed to circumvent the need for high computational resources for finding the optimal solution to the problem in practice. Numerical results, validating the analytical framework, report the average improvement of more than 25% in secrecy performance over relevant benchmarks. This establishes that the proposed scheme has a potential to mitigate the secrecy outage efficiently for secure and reliable communication in IoT networks.
{"title":"Fairness-aware Subcarrier Allocation to Combat full duplex Eavesdropping and Jamming attacks in IoT","authors":"Bhawna Ahuja, Deepak Mishra, R. Bose","doi":"10.1109/ICC40277.2020.9149023","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9149023","url":null,"abstract":"To address the growing concern of security in advance communication networks like Internet of things (IoT), this work aims to propose an optimisation framework for fair subcarrier allocation to encounter a full duplex (FD) attacker. We first analyse the performance of secure communication in a multi-user IoT system against an FD hybrid attacker possessing the capability of concurrent eavesdropping and jamming. Specifically, a novel analytical expression has been derived for the exact intercept probability considering incomplete information of all ungoverned communication links that include self-interference link along with eavesdropping and jamming ones. The optimisation problem of subcarrier allocation is then formulated as an integer linear program. Finally, a low-complexity suboptimal solution is proposed to circumvent the need for high computational resources for finding the optimal solution to the problem in practice. Numerical results, validating the analytical framework, report the average improvement of more than 25% in secrecy performance over relevant benchmarks. This establishes that the proposed scheme has a potential to mitigate the secrecy outage efficiently for secure and reliable communication in IoT networks.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"316 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":"115869038","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.9148929
An Xie, Huawei Huang, Xiaoliang Wang, Zhuzhong Qian, Sanglu Lu
Software Defined Networking (SDN) is beneficial to many applications, such as intra-datacenter communication, inter-datacenter transportation, etc., due to its centralized control. However, this centralized control frequently makes the controller a bottleneck, due to the large amount of interactions between the controller and switches. In this paper, we characterize such interactions as control traffic, and propose RouteStitch to minimize such kind of traffic. RouteStitch exploits existing route entries in switches to build new paths. To this end, RouteStitch first builds a graph model to describe existing route entries. Then, on such a model, a novel minimum color-alternation routing problem is defined to minimize control traffic, after which an optimal algorithm is proposed on a fixed routing path. For general paths, an $O(log_{2}L)$-competitive online algorithm is designed to build new paths in an online manner that preserves fundamental property of switch Ternary Content Addressable Memory (TCAM) capacity and allowed maximum hop length L. Extensive simulation results based on realistic topology show that RouteStitch has good performance in terms of reducing control traffic, by 40%.
软件定义网络(Software Defined Networking, SDN)由于其集中控制的特点，有利于许多应用，如数据中心内通信、数据中心间传输等。然而，由于控制器和开关之间的大量交互，这种集中控制经常使控制器成为瓶颈。在本文中，我们将这种交互描述为控制流量，并提出了routestich来最小化这类流量。routestich利用交换机中已有的路由项来构建新的路径。为此，routestich首先建立一个图模型来描述现有的路由表项。然后，在此模型上定义了一种新颖的以控制流量最小为目标的最小颜色交替路由问题，并提出了一种固定路径下的最优算法。对于一般路径，设计了$O(log_{2}L)$竞争在线算法，以在线方式构建新路径，保留交换机三元内容可寻址存储器(TCAM)容量的基本属性，并允许最大跳长L。基于现实拓扑的广泛仿真结果表明，RouteStitch在减少控制流量方面具有良好的性能，可减少40%。
{"title":"RouteStitch: Control Traffic Minimization in SDN by Stitching Routes","authors":"An Xie, Huawei Huang, Xiaoliang Wang, Zhuzhong Qian, Sanglu Lu","doi":"10.1109/ICC40277.2020.9148929","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148929","url":null,"abstract":"Software Defined Networking (SDN) is beneficial to many applications, such as intra-datacenter communication, inter-datacenter transportation, etc., due to its centralized control. However, this centralized control frequently makes the controller a bottleneck, due to the large amount of interactions between the controller and switches. In this paper, we characterize such interactions as control traffic, and propose RouteStitch to minimize such kind of traffic. RouteStitch exploits existing route entries in switches to build new paths. To this end, RouteStitch first builds a graph model to describe existing route entries. Then, on such a model, a novel minimum color-alternation routing problem is defined to minimize control traffic, after which an optimal algorithm is proposed on a fixed routing path. For general paths, an $O(log_{2}L)$-competitive online algorithm is designed to build new paths in an online manner that preserves fundamental property of switch Ternary Content Addressable Memory (TCAM) capacity and allowed maximum hop length L. Extensive simulation results based on realistic topology show that RouteStitch has good performance in terms of reducing control traffic, by 40%.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"132 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":"115899172","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.9148810
Kapila W. S. Palitharathna, H. Suraweera, R. Godaliyadda, V. R. Herath, Z. Ding
In this paper, we consider a non-orthogonal multiple access (NOMA) underwater optical wireless communication system in which a full-duplex decode-and-forward relay is used to assist the far user with weak channel conditions. Full-duplex operation introduces interference to the near user with strong channel conditions and our model covers several practical assumptions such as imperfect interference cancellation and random receiver orientation at the near/far user. In particular, we derive the exact outage probability at the near user and far user valid for log-normal weak turbulence conditions. An accurate outage approximation for the near user is also derived in closed-form. The correctness of the analysis has been verified through simulation results where they both match closely. Moreover, the derived expressions are useful to investigate the impact of various system and channel parameters such as the access point/relay transmit power, node locations, strength of the residual interference and random receiver orientation at the near and far user. Our results reveal that the outage probability of the near user is more sensitive to receiver orientation errors as compared to the far user.
{"title":"Impact of Receiver Orientation on Full-Duplex Relay Aided NOMA Underwater Optical Wireless Systems","authors":"Kapila W. S. Palitharathna, H. Suraweera, R. Godaliyadda, V. R. Herath, Z. Ding","doi":"10.1109/ICC40277.2020.9148810","DOIUrl":"https://doi.org/10.1109/ICC40277.2020.9148810","url":null,"abstract":"In this paper, we consider a non-orthogonal multiple access (NOMA) underwater optical wireless communication system in which a full-duplex decode-and-forward relay is used to assist the far user with weak channel conditions. Full-duplex operation introduces interference to the near user with strong channel conditions and our model covers several practical assumptions such as imperfect interference cancellation and random receiver orientation at the near/far user. In particular, we derive the exact outage probability at the near user and far user valid for log-normal weak turbulence conditions. An accurate outage approximation for the near user is also derived in closed-form. The correctness of the analysis has been verified through simulation results where they both match closely. Moreover, the derived expressions are useful to investigate the impact of various system and channel parameters such as the access point/relay transmit power, node locations, strength of the residual interference and random receiver orientation at the near and far user. Our results reveal that the outage probability of the near user is more sensitive to receiver orientation errors as compared to the far user.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"1 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":"131379034","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
扫码关注我们
求助内容：
应助结果提醒方式：