Pub Date : 2015-06-08DOI: 10.1109/ICCW.2015.7247304
Kang Song, Baofeng Ji, Yongming Huang, Ming Xiao, Shi Jin, Luxi Yang
We investigate the downlink performance of relay-aided heterogeneous networks (HetNet). An interference cancellation scheme employed at macro base stations is first proposed based on the cancellation of cross-tier interference from the macro base station to small cell users. Then, we derive the expressions of the probability density function (PDF) and cumulative distribution function (CDF) of the received SINRs of both macro and small cell users, and provide the closed-form average bit error rate (BER) and outage probability of the system. Through the derivation and simulation, we show the overall performance improvement of HetNet with interference cancellation in mathematical expression. The numerical results closely follow our analysis.
{"title":"Performance analysis of relay-aided heterogeneous networks with interference cancellation","authors":"Kang Song, Baofeng Ji, Yongming Huang, Ming Xiao, Shi Jin, Luxi Yang","doi":"10.1109/ICCW.2015.7247304","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247304","url":null,"abstract":"We investigate the downlink performance of relay-aided heterogeneous networks (HetNet). An interference cancellation scheme employed at macro base stations is first proposed based on the cancellation of cross-tier interference from the macro base station to small cell users. Then, we derive the expressions of the probability density function (PDF) and cumulative distribution function (CDF) of the received SINRs of both macro and small cell users, and provide the closed-form average bit error rate (BER) and outage probability of the system. Through the derivation and simulation, we show the overall performance improvement of HetNet with interference cancellation in mathematical expression. The numerical results closely follow our analysis.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74638906","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247317
Minhyun Kim, Junho Lee, Gye-Tae Gil, Y. H. Lee
We consider channel estimation for massive multiple-input multiple-output (MIMO) systems operating in frequency division duplexing (FDD) mode. By exploiting the sparsity of significant propagation paths in massive MIMO channels, we develop a compressed sensing (CS) based channel estimator that can reduce the pilot overhead as compared with the conventional least squares (LS) and minimum mean square error (MMSE) estimators. The proposed scheme is based on the oblique matching pursuit (ObMP), an extension of the orthogonal matching pursuit (OMP), that can exploit prior information about the sparse signal vector. Given the channel covariance matrix, we obtain the incidence probability that each quantized angle coincides with the angle-of-departure (AoD) and use the incidence probability for deriving the oblique operator of the proposed scheme. The pilot sequence is designed to minimize the MSE of the oracle estimator. The simulation results demonstrate the advantage of the proposed scheme over various existing methods including the LS, MMSE and OMP estimators.
{"title":"Channel estimation via oblique matching pursuit for FDD massive MIMO downlink","authors":"Minhyun Kim, Junho Lee, Gye-Tae Gil, Y. H. Lee","doi":"10.1109/ICCW.2015.7247317","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247317","url":null,"abstract":"We consider channel estimation for massive multiple-input multiple-output (MIMO) systems operating in frequency division duplexing (FDD) mode. By exploiting the sparsity of significant propagation paths in massive MIMO channels, we develop a compressed sensing (CS) based channel estimator that can reduce the pilot overhead as compared with the conventional least squares (LS) and minimum mean square error (MMSE) estimators. The proposed scheme is based on the oblique matching pursuit (ObMP), an extension of the orthogonal matching pursuit (OMP), that can exploit prior information about the sparse signal vector. Given the channel covariance matrix, we obtain the incidence probability that each quantized angle coincides with the angle-of-departure (AoD) and use the incidence probability for deriving the oblique operator of the proposed scheme. The pilot sequence is designed to minimize the MSE of the oracle estimator. The simulation results demonstrate the advantage of the proposed scheme over various existing methods including the LS, MMSE and OMP estimators.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73398217","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247603
M. Emre, Gürkan Gür, S. Bayhan, Fatih Alagöz
Cognitive Radio (CR) with the capability of discovering the unused spectrum promises higher spectrum efficiency - a pressing requirement for 5G networks. However, CR owes this capability to power-hungry tasks, most particularly to spectrum sensing. Given that advances in battery capacity has a slower pace compared to advances in device capabilities and traffic growth, it is paramount to develop energy-efficient CR protocols. To this end, we focus on spectrum sensing and access from an energy efficiency perspective. Our proposal CooperativeQ lets each CR decide with an energy efficiency objective on its actions based on its buffer occupancy, buffer capacity, and its observations about the primary channel states. Different than traditional reinforcement learning, CooperativeQ facilitates CRs to share their local knowledge with others periodically. With this information, CR chooses which action to take for the current time slot: (i) idling, (ii) sensing, and (iii) if channel is decided to be idle adapting transmission power to one of the power levels. We evaluate the performance of our proposal under various PU channel types, idling penalty coefficient, and information sharing period. Our results show that CooperativeQ outperforms greedy throughput-maximizing approach or a random channel selection owing to its adaptation and learning capability as well as cooperative mode of operation.
{"title":"CooperativeQ: Energy-efficient channel access based on cooperative reinforcement learning","authors":"M. Emre, Gürkan Gür, S. Bayhan, Fatih Alagöz","doi":"10.1109/ICCW.2015.7247603","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247603","url":null,"abstract":"Cognitive Radio (CR) with the capability of discovering the unused spectrum promises higher spectrum efficiency - a pressing requirement for 5G networks. However, CR owes this capability to power-hungry tasks, most particularly to spectrum sensing. Given that advances in battery capacity has a slower pace compared to advances in device capabilities and traffic growth, it is paramount to develop energy-efficient CR protocols. To this end, we focus on spectrum sensing and access from an energy efficiency perspective. Our proposal CooperativeQ lets each CR decide with an energy efficiency objective on its actions based on its buffer occupancy, buffer capacity, and its observations about the primary channel states. Different than traditional reinforcement learning, CooperativeQ facilitates CRs to share their local knowledge with others periodically. With this information, CR chooses which action to take for the current time slot: (i) idling, (ii) sensing, and (iii) if channel is decided to be idle adapting transmission power to one of the power levels. We evaluate the performance of our proposal under various PU channel types, idling penalty coefficient, and information sharing period. Our results show that CooperativeQ outperforms greedy throughput-maximizing approach or a random channel selection owing to its adaptation and learning capability as well as cooperative mode of operation.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73762645","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247248
Yiyang Ni, Shi Jin, Wei Xu, M. Matthaiou, S. Shao, Hongbo Zhu
We investigate device-to-device (D2D) communication underlaying cellular networks with M-antenna base stations. We consider both beamforming (BF) and interference cancellation (IC) strategies under quantized channel state information (CSI), as well as, perfect CSI. We derive tight closed-form approximations of the ergodic achievable rate which hold for arbitrary transmit power, location of users and number of antennas. Based on these approximations, we derive insightful asymptotic expressions for three special cases namely high signal-to-noise (SNR), weak interference, and large M. In particular, we show that in the high SNR regime a ceiling effect exists which depends on the received signal-to-interference ratio and the number of antennas. Moreover, the achievable rate scales logarithmically with M. The ergodic achievable rate is shown to scale logarithmically with SNR and the antenna number in the weak interference case. When the BS is equipped with large number of antennas, we find that the ergodic achievable rate under quantized CSI reaches a saturated value, whilst it scales as log2M under perfect CSI.
{"title":"Beamforming and interference cancellation schemes for D2D communications","authors":"Yiyang Ni, Shi Jin, Wei Xu, M. Matthaiou, S. Shao, Hongbo Zhu","doi":"10.1109/ICCW.2015.7247248","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247248","url":null,"abstract":"We investigate device-to-device (D2D) communication underlaying cellular networks with M-antenna base stations. We consider both beamforming (BF) and interference cancellation (IC) strategies under quantized channel state information (CSI), as well as, perfect CSI. We derive tight closed-form approximations of the ergodic achievable rate which hold for arbitrary transmit power, location of users and number of antennas. Based on these approximations, we derive insightful asymptotic expressions for three special cases namely high signal-to-noise (SNR), weak interference, and large M. In particular, we show that in the high SNR regime a ceiling effect exists which depends on the received signal-to-interference ratio and the number of antennas. Moreover, the achievable rate scales logarithmically with M. The ergodic achievable rate is shown to scale logarithmically with SNR and the antenna number in the weak interference case. When the BS is equipped with large number of antennas, we find that the ergodic achievable rate under quantized CSI reaches a saturated value, whilst it scales as log2M under perfect CSI.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79263931","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247166
Katerina Smiljkovikj, L. Gavrilovska, P. Popovski
This paper analyzes two-tier heterogeneous cellular network with decoupled downlink and uplink access. The basic performance benefits of uplink/downlink decoupling have been recently introduced. Here we provide a more elaborate treatment of the decoupling mechanism by analyzing spectral and energy efficiency of the system, as the joint improvement of these two features is crucial for the upcoming 5G systems. We analyze two-tier user domain, where users' transmit power depends purely on the association process. The derived joint association probabilities and the distributions of the distance to the serving base station give deeper insight into the fundamentals of a system with decoupled access. The rigorous theoretical analysis shows that decoupling of downlink and uplink with two-level uplink power adaptation improves both, spectral and energy efficiency of the system.
{"title":"Efficiency analysis of downlink and uplink decoupling in heterogeneous networks","authors":"Katerina Smiljkovikj, L. Gavrilovska, P. Popovski","doi":"10.1109/ICCW.2015.7247166","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247166","url":null,"abstract":"This paper analyzes two-tier heterogeneous cellular network with decoupled downlink and uplink access. The basic performance benefits of uplink/downlink decoupling have been recently introduced. Here we provide a more elaborate treatment of the decoupling mechanism by analyzing spectral and energy efficiency of the system, as the joint improvement of these two features is crucial for the upcoming 5G systems. We analyze two-tier user domain, where users' transmit power depends purely on the association process. The derived joint association probabilities and the distributions of the distance to the serving base station give deeper insight into the fundamentals of a system with decoupled access. The rigorous theoretical analysis shows that decoupling of downlink and uplink with two-level uplink power adaptation improves both, spectral and energy efficiency of the system.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85065231","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}
To enhance the performance of a heterogeneous network, where many small cells are deployed in a macro cell, we consider two technical challenges. First, seamless handover between the same or different types of cells should be supported with a low handover failure rate. Second, small cells should use their radio resources as much as possible to maximize a cell splitting gain. It was well known that there is a trade-off between the low handover failure rate and the high small cell utilization. To find a better operation considering such a trade-off, we propose a state-dependent handover decision algorithm. In the proposed scheme, a user sets a “state” for each small cell, and performs a “state transition” to distinguish between macro-to-small and small-to-macro handovers, and then uses suitable handover parameters for each handover type. Through simulation, we observe that the proposed scheme can reduce the handover failure rate significantly without degrading the small cell utilization and the throughput experienced by the user.
{"title":"On the trade-off between handover failure and small cell utilization in heterogeneous networks","authors":"Jungmin Moon, Jungsoo Jung, Sungjin Lee, Anshuman Nigam, Sunheui Ryoo","doi":"10.1109/ICCW.2015.7247521","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247521","url":null,"abstract":"To enhance the performance of a heterogeneous network, where many small cells are deployed in a macro cell, we consider two technical challenges. First, seamless handover between the same or different types of cells should be supported with a low handover failure rate. Second, small cells should use their radio resources as much as possible to maximize a cell splitting gain. It was well known that there is a trade-off between the low handover failure rate and the high small cell utilization. To find a better operation considering such a trade-off, we propose a state-dependent handover decision algorithm. In the proposed scheme, a user sets a “state” for each small cell, and performs a “state transition” to distinguish between macro-to-small and small-to-macro handovers, and then uses suitable handover parameters for each handover type. Through simulation, we observe that the proposed scheme can reduce the handover failure rate significantly without degrading the small cell utilization and the throughput experienced by the user.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81881606","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247279
The Dang Huynh, Chung Shue Chen, Siu-Wai Ho
Indoor positioning system is a key component for developing various location based services such as indoor navigation in large complex buildings (e.g., commercial center and hospital). Meanwhile, it is challenging to design a cost effective solution which is able to provide high accuracy. A new method, namely Two-Step Movement (2SM), was proposed in [1] to demonstrate how to build a positioning system which requires only one Reference Point (RP) by exploiting user movement. The method can offer good precision and minimize the number of RPs required so as to reduce system implementation cost. Built on 2SM, here we first improve the positioning performance through multi-sampling technique to combat measurement noise. Secondly, we propose the Generalized Two-Step Movement (G2SM) method for device-to-device (D2D) systems in which both the mobile terminal (MT) and RP can be mobile device. The mobile user's position can be derived analytically and given in simple closed-form expression. Its effectiveness in the presence of noise is shown in simulation results.
室内定位系统是开发大型复杂建筑(如商业中心和医院)室内导航等各种定位服务的关键组成部分。同时，设计一种具有成本效益且能够提供高精度的解决方案具有挑战性。文献[1]提出了一种新的方法，即两步移动(Two-Step Movement, 2SM)，该方法利用用户的移动来构建一个只需要一个参考点(Reference Point, RP)的定位系统。该方法可以提供良好的精度和最小化所需rp的数量，从而降低系统的实现成本。在2SM的基础上，我们首先通过多采样技术来对抗测量噪声，从而提高定位性能。其次，针对移动终端(MT)和RP都可以是移动设备的设备到设备(D2D)系统，提出了广义两步移动(G2SM)方法。移动用户的位置可以解析导出，并以简单的封闭形式表示。仿真结果表明了该方法在噪声存在下的有效性。
{"title":"Localization method for device-to-device through user movement","authors":"The Dang Huynh, Chung Shue Chen, Siu-Wai Ho","doi":"10.1109/ICCW.2015.7247279","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247279","url":null,"abstract":"Indoor positioning system is a key component for developing various location based services such as indoor navigation in large complex buildings (e.g., commercial center and hospital). Meanwhile, it is challenging to design a cost effective solution which is able to provide high accuracy. A new method, namely Two-Step Movement (2SM), was proposed in [1] to demonstrate how to build a positioning system which requires only one Reference Point (RP) by exploiting user movement. The method can offer good precision and minimize the number of RPs required so as to reduce system implementation cost. Built on 2SM, here we first improve the positioning performance through multi-sampling technique to combat measurement noise. Secondly, we propose the Generalized Two-Step Movement (G2SM) method for device-to-device (D2D) systems in which both the mobile terminal (MT) and RP can be mobile device. The mobile user's position can be derived analytically and given in simple closed-form expression. Its effectiveness in the presence of noise is shown in simulation results.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81892628","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247155
J. Lessmann, Yong Cheng, Stefan Pfeiffer, X. Costa
Since traffic load in mobile networks typically changes significantly over time, time-varying routing, where routing changes in certain time intervals, seems an obvious solution. Yet multiple researchers have claimed independently in the past, that time-varying routing does not lead to worthwhile benefits given its overhead. In this paper, we study this issue in a systematic way. We argue that previous claims are due to focusing on too narrow optimization metrics and demonstrate the poor expressiveness of such metrics using real mobile backhaul topologies. We propose a novel traffic engineering metric, capacity variation, and on that basis, prove that time-varying routing can in fact have great benefits, particularly in terms of infrastructure CAPEX costs. A quantitative evaluation on the benefits is provided based on real mobile backhaul data from a European operators.
{"title":"On the benefits of time-varying routing in realistic mobile backhaul networks","authors":"J. Lessmann, Yong Cheng, Stefan Pfeiffer, X. Costa","doi":"10.1109/ICCW.2015.7247155","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247155","url":null,"abstract":"Since traffic load in mobile networks typically changes significantly over time, time-varying routing, where routing changes in certain time intervals, seems an obvious solution. Yet multiple researchers have claimed independently in the past, that time-varying routing does not lead to worthwhile benefits given its overhead. In this paper, we study this issue in a systematic way. We argue that previous claims are due to focusing on too narrow optimization metrics and demonstrate the poor expressiveness of such metrics using real mobile backhaul topologies. We propose a novel traffic engineering metric, capacity variation, and on that basis, prove that time-varying routing can in fact have great benefits, particularly in terms of infrastructure CAPEX costs. A quantitative evaluation on the benefits is provided based on real mobile backhaul data from a European operators.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81947851","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247393
H. Tode, Masashi Takada, Y. Tanigawa
In the Wavelength Division Multiplexing (WDM) based optical circuit switching network, it takes longer time to set up the intermediate optical cross-connecting devices on the route. Thus, pre-computed routing approaches are desirable to instantly set up the connection. Most of their research works are based on the K Shortest Path (KSP) algorithm or it's variants considering route disjointness, because of load balancing effect in network, its simplicity, and quick response caused by heuristic approach. However, it essentially remains some issues to be solved, especially on the capability for various QoS support and fairer load balancing. In particular, the set of K shortest paths independently selected between any two nodes is insufficient for entire network load balancing. Specifically, sequential selection of the K routes for each source-destination (S-D) pair causes the unfairness and unbalance in network load among all S-D pairs. In the paper, to tackle the above problems, we propose multi-tiers route design method, which provides more enhanced load balancing by selecting QoS specific multiple routes for each node pair, coordinating with the routes for other node pairs. The proposed method is not the improvement of the KSP algorithm and it's variants themselves, but the framework to find a limited number (K') of adequate paths from the K (K' ≤ K) routes pre-computed by KSP based algorithms for each S-D pair and each QoS level, taking spatial relationship between routes into account. Thus, the proposed method has complementary relationship with the KSP based algorithms themselves.
{"title":"Multi-tiers route design coordinating QoS-specific K shortest paths over optical network","authors":"H. Tode, Masashi Takada, Y. Tanigawa","doi":"10.1109/ICCW.2015.7247393","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247393","url":null,"abstract":"In the Wavelength Division Multiplexing (WDM) based optical circuit switching network, it takes longer time to set up the intermediate optical cross-connecting devices on the route. Thus, pre-computed routing approaches are desirable to instantly set up the connection. Most of their research works are based on the K Shortest Path (KSP) algorithm or it's variants considering route disjointness, because of load balancing effect in network, its simplicity, and quick response caused by heuristic approach. However, it essentially remains some issues to be solved, especially on the capability for various QoS support and fairer load balancing. In particular, the set of K shortest paths independently selected between any two nodes is insufficient for entire network load balancing. Specifically, sequential selection of the K routes for each source-destination (S-D) pair causes the unfairness and unbalance in network load among all S-D pairs. In the paper, to tackle the above problems, we propose multi-tiers route design method, which provides more enhanced load balancing by selecting QoS specific multiple routes for each node pair, coordinating with the routes for other node pairs. The proposed method is not the improvement of the KSP algorithm and it's variants themselves, but the framework to find a limited number (K') of adequate paths from the K (K' ≤ K) routes pre-computed by KSP based algorithms for each S-D pair and each QoS level, taking spatial relationship between routes into account. Thus, the proposed method has complementary relationship with the KSP based algorithms themselves.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79821704","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247071
J. Baranda, José Núñez-Martínez, J. Mangues‐Bafalluy
The expected higher complexity of upcoming 5G wireless backhauls suggests the need to evolve towards a software defined networking (SDN) paradigm to increase the degree of programmability of these networks. Within the context of software defined wireless backhaul, one important issue is the provision of an even resource consumption of both network and IT resources. Backpressure policies have shown their ability to balance resource consumption in traditional (non-SDN) wireless backhauls. This paper analyzes two use cases in which backpressure policies can be integrated in software-defined wireless backhaul to manage network and IT resources. The first use case proposes an SDN application based on a centralized backpressure policy to balance network resources in the wireless backhaul. Simulation results reveal how the granularity of routing decisions in the SDN application significantly affects the data plane performance, suggesting a trade-off between data plane performance and overload in the control plane. The second use case proposes a distributed backpressure policy to deal with the management of computing resources by balancing the processing load caused by OpenFlow (OF) switch requests among the available distributed SDN controllers. Simulation results demonstrate how a dynamic and distributed backpressure policy can balance the processing load amongst different SDN controllers, hence, leading to significant improvements with respect to static mapping policies.
{"title":"Applying backpressure to balance resource usage in software-defined wireless backhauls","authors":"J. Baranda, José Núñez-Martínez, J. Mangues‐Bafalluy","doi":"10.1109/ICCW.2015.7247071","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247071","url":null,"abstract":"The expected higher complexity of upcoming 5G wireless backhauls suggests the need to evolve towards a software defined networking (SDN) paradigm to increase the degree of programmability of these networks. Within the context of software defined wireless backhaul, one important issue is the provision of an even resource consumption of both network and IT resources. Backpressure policies have shown their ability to balance resource consumption in traditional (non-SDN) wireless backhauls. This paper analyzes two use cases in which backpressure policies can be integrated in software-defined wireless backhaul to manage network and IT resources. The first use case proposes an SDN application based on a centralized backpressure policy to balance network resources in the wireless backhaul. Simulation results reveal how the granularity of routing decisions in the SDN application significantly affects the data plane performance, suggesting a trade-off between data plane performance and overload in the control plane. The second use case proposes a distributed backpressure policy to deal with the management of computing resources by balancing the processing load caused by OpenFlow (OF) switch requests among the available distributed SDN controllers. Simulation results demonstrate how a dynamic and distributed backpressure policy can balance the processing load amongst different SDN controllers, hence, leading to significant improvements with respect to static mapping policies.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79847430","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
扫码关注我们
求助内容：
应助结果提醒方式：