Pub Date : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063501
Marko Skomersic, M. Matijasevic, I. Gojmerac
Mobile and fixed network operators, as well as Internet service providers, are increasingly using IP packet eXchange (IPX) for IP interconnection, but more pervasive adoption of IPX is hindered by the reality of highly competitive market relationships. In the IPX market, the network topology and quality characteristics within each IPX provider's domain are considered a trade secret, and the terms for interconnection are traditionally specified through fairly rigid service level agreements. This paper addresses the challenge of enabling more flexible, end-to-end, service- and quality-aware IPX provider (IPXP) agreements, while obviating the need for disclosing actual measured values for the relevant quality of service (QoS) parameters and key performance indicators (KPIs). A concept under investigation is outlined, based on two ideas: 1) a centralized facility to measure, collect, process, and exchange end-to-end network quality parameters in a trusted manner, while not revealing the QoS/KPIs referring to individual IPXPs in the service delivery chain; and 2) a new service-aware metric, called Network Quality Indicator (NQI), which is derived from the actual measured QoS/KPI values on a given end-to-end path, for a given service (e.g, messaging, video, voice) transported through the IPX domain. Standardizing NQIs and their use has the potential to facilitate adoption of IPX networks as a regular interconnection model.
{"title":"Specification and delivery of quality indicators in IP packet eXchange networks","authors":"Marko Skomersic, M. Matijasevic, I. Gojmerac","doi":"10.1109/GLOCOMW.2014.7063501","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063501","url":null,"abstract":"Mobile and fixed network operators, as well as Internet service providers, are increasingly using IP packet eXchange (IPX) for IP interconnection, but more pervasive adoption of IPX is hindered by the reality of highly competitive market relationships. In the IPX market, the network topology and quality characteristics within each IPX provider's domain are considered a trade secret, and the terms for interconnection are traditionally specified through fairly rigid service level agreements. This paper addresses the challenge of enabling more flexible, end-to-end, service- and quality-aware IPX provider (IPXP) agreements, while obviating the need for disclosing actual measured values for the relevant quality of service (QoS) parameters and key performance indicators (KPIs). A concept under investigation is outlined, based on two ideas: 1) a centralized facility to measure, collect, process, and exchange end-to-end network quality parameters in a trusted manner, while not revealing the QoS/KPIs referring to individual IPXPs in the service delivery chain; and 2) a new service-aware metric, called Network Quality Indicator (NQI), which is derived from the actual measured QoS/KPI values on a given end-to-end path, for a given service (e.g, messaging, video, voice) transported through the IPX domain. Standardizing NQIs and their use has the potential to facilitate adoption of IPX networks as a regular interconnection model.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"361 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134323521","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063435
Yu-Chieh Chen, Jen-Wei Chang, Hung-Yu Wei
In recent years, the growth and success of video streaming applications (Apps) have dominated global Internet traffic accompanied by a number of quality of experience (QoE) issues. The purpose of this study is to improve the QoE of video streaming apps by constructing a multi-level framework, which contains (1) two-level quality of system (QoS) metrics: network quality of service (NQoS) and application quality of service (AQoS) as well as (2) two-level QoE metrics: user cognition quality of experience (CQoE) and user behavior quality of experience (BQoE). We first identified and selected QoS metrics through Kano model analysis, and then conducted a user experiment to collect users QoE under various QoS settings. Eventually, a utility function was proposed to describe a generic quantitative relationship between QoE and QoS. The contribution of this framework is to assist video streaming Apps researchers and streaming service operators to identify relationship between QoS and QoE. The proposed approach not only allows streaming system developers and operators to enhance their system designs performance, but provides valuable helps in effectively making decisions between multiple trade-off situations (ex. cost-performance trade-off) in the product or service development phase. Moreover, the respective prediction error of the proposed approach and traditional approach were compared. The results showed our approach outperformed the traditional one in the significant minimization of the prediction error. The practical and theoretical implications were also introduced.
{"title":"A multi-level QoE framework for smartphone video streaming applications","authors":"Yu-Chieh Chen, Jen-Wei Chang, Hung-Yu Wei","doi":"10.1109/GLOCOMW.2014.7063435","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063435","url":null,"abstract":"In recent years, the growth and success of video streaming applications (Apps) have dominated global Internet traffic accompanied by a number of quality of experience (QoE) issues. The purpose of this study is to improve the QoE of video streaming apps by constructing a multi-level framework, which contains (1) two-level quality of system (QoS) metrics: network quality of service (NQoS) and application quality of service (AQoS) as well as (2) two-level QoE metrics: user cognition quality of experience (CQoE) and user behavior quality of experience (BQoE). We first identified and selected QoS metrics through Kano model analysis, and then conducted a user experiment to collect users QoE under various QoS settings. Eventually, a utility function was proposed to describe a generic quantitative relationship between QoE and QoS. The contribution of this framework is to assist video streaming Apps researchers and streaming service operators to identify relationship between QoS and QoE. The proposed approach not only allows streaming system developers and operators to enhance their system designs performance, but provides valuable helps in effectively making decisions between multiple trade-off situations (ex. cost-performance trade-off) in the product or service development phase. Moreover, the respective prediction error of the proposed approach and traditional approach were compared. The results showed our approach outperformed the traditional one in the significant minimization of the prediction error. The practical and theoretical implications were also introduced.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131725021","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063468
M. Kulkarni, T. Thomas, F. Vook, Amitava Ghosh, E. Visotsky
Higher frequency bands (>6 GHz) look promising to meet the proposed 5G data rates, given the large amount of available spectrum in these bands. However, a rigorous understanding of some fundamental tradeoffs like network densification, sectorization, and bandwidths has only begun to be investigated at millimeter wave (mmW) bands. In this work, we investigate the coverage and rate performance of cellular networks with sectorized access points (APs) operating at high frequency bands, using tools of stochastic geometry. We observe that sectorizing the APs can significantly improve the data rates and thus can be used in conjunction with network densification, in order to achieve the 5G data rate requirements. However, the increased data rates come at the expense of increased interference in the network. We investigate the interference effects on a typical moderate (200 MHz) bandwidth network at 28 GHz and a high (2 GHz) bandwidth network at 72 GHz carrier frequency, with 4 sector APs and validate the trends observed with the help of detailed system-level simulations using METIS-like scenarios.
{"title":"Coverage and rate trends in moderate and high bandwidth 5G networks","authors":"M. Kulkarni, T. Thomas, F. Vook, Amitava Ghosh, E. Visotsky","doi":"10.1109/GLOCOMW.2014.7063468","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063468","url":null,"abstract":"Higher frequency bands (>6 GHz) look promising to meet the proposed 5G data rates, given the large amount of available spectrum in these bands. However, a rigorous understanding of some fundamental tradeoffs like network densification, sectorization, and bandwidths has only begun to be investigated at millimeter wave (mmW) bands. In this work, we investigate the coverage and rate performance of cellular networks with sectorized access points (APs) operating at high frequency bands, using tools of stochastic geometry. We observe that sectorizing the APs can significantly improve the data rates and thus can be used in conjunction with network densification, in order to achieve the 5G data rate requirements. However, the increased data rates come at the expense of increased interference in the network. We investigate the interference effects on a typical moderate (200 MHz) bandwidth network at 28 GHz and a high (2 GHz) bandwidth network at 72 GHz carrier frequency, with 4 sector APs and validate the trends observed with the help of detailed system-level simulations using METIS-like scenarios.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131758826","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063645
Yuhan Zhou, Wei Yu
This paper studies the optimization of transmit beamforming and backhaul compression strategies for the uplink of cloud radio access networks (C-RAN), in which multi-antenna user terminals communicate with a cloud-computing based central processor (CP) through multi-antenna base-stations (BSs) serving as relay nodes. The BSs perform compress-and-forward strategy to quantize the received signals and send the quantization bits to the CP via capacity-limited backhaul links for decoding. In contrast to the previous works on the uplink C-RAN, which mostly focus on the backhaul compression strategies only, this paper proposes the joint optimization of the transmit beamformers and the quantization noise covariance matrices at the BSs for maximizing the benefit brought by the C-RAN architecture. A weighted sum-rate maximization problem is formulated under the user power and backhaul capacity constraints. A novel weighted minimum-mean-square-error successive convex approximation (WMMSE-SCA) algorithm is developed for finding a local optimum solution to the problem. This paper further proposes a low-complexity approximation scheme consisting of beamformers matching to the strongest channel vectors at the user side along with per-antenna scalar quantizers with uniform quantization noise levels across the antennas at each BS. This simple separate design strategy is derived by exploring the structure of the optimal solution to the sum-rate maximization problem under successive interference cancellation (SIC) while assuming high signal-to-quantization-noise ratio (SQNR). Simulation results show that with optimized beamforming and backhaul compression, C-RAN can significantly improve the overall performance of wireless cellular networks. With SIC, the proposed separate design performs very close to the optimized joint design in the SQNR regime of practical interest.
{"title":"Optimized beamforming and backhaul compression for uplink MIMO cloud radio access networks","authors":"Yuhan Zhou, Wei Yu","doi":"10.1109/GLOCOMW.2014.7063645","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063645","url":null,"abstract":"This paper studies the optimization of transmit beamforming and backhaul compression strategies for the uplink of cloud radio access networks (C-RAN), in which multi-antenna user terminals communicate with a cloud-computing based central processor (CP) through multi-antenna base-stations (BSs) serving as relay nodes. The BSs perform compress-and-forward strategy to quantize the received signals and send the quantization bits to the CP via capacity-limited backhaul links for decoding. In contrast to the previous works on the uplink C-RAN, which mostly focus on the backhaul compression strategies only, this paper proposes the joint optimization of the transmit beamformers and the quantization noise covariance matrices at the BSs for maximizing the benefit brought by the C-RAN architecture. A weighted sum-rate maximization problem is formulated under the user power and backhaul capacity constraints. A novel weighted minimum-mean-square-error successive convex approximation (WMMSE-SCA) algorithm is developed for finding a local optimum solution to the problem. This paper further proposes a low-complexity approximation scheme consisting of beamformers matching to the strongest channel vectors at the user side along with per-antenna scalar quantizers with uniform quantization noise levels across the antennas at each BS. This simple separate design strategy is derived by exploring the structure of the optimal solution to the sum-rate maximization problem under successive interference cancellation (SIC) while assuming high signal-to-quantization-noise ratio (SQNR). Simulation results show that with optimized beamforming and backhaul compression, C-RAN can significantly improve the overall performance of wireless cellular networks. With SIC, the proposed separate design performs very close to the optimized joint design in the SQNR regime of practical interest.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130868623","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063532
Kianoush Hosseini, Wei Yu, R. Adve
This paper studies the downlink ergodic capacity of a network multiple-input multiple-output (MIMO) system. The system model includes base-stations (BSs) randomly distributed with a fixed density, each equipped with M antennas, scheduling K single-antenna users, and forming cooperating clusters via perfect backhaul links. Intra-cluster interference is eliminated by joint transmission using zero-forcing beamforming assuming perfect channel state information (CSI), while inter-cluster interference remains. This paper shows that although coordinating a large cluster of BSs eliminates strong interferers, the coordination gain depends on the network load factor, defined as the relative ratio of M and K. In particular, we show that with M = K, increasing the coordination cluster size is only beneficial for the cluster-edge users, while degrading the ergodic capacity of the users located close to the cluster center. In contrast, when M > K, increasing the cluster size potentially improves every user's ergodic capacity. In the second part of this paper, we use tools from stochastic geometry to account for random BS locations in characterizing the performance of network MIMO systems. In this setting, we model the BS locations according to a homogeneous Poisson point process with a fixed density, and propose tractable, yet accurate, distribution functions for the signal and inter-cluster interference powers. We then derive an efficiently computable expression for the user ergodic capacity as a function of the distance between a user and the cluster center.
{"title":"Modeling and analysis of ergodic capacity in network MIMO systems","authors":"Kianoush Hosseini, Wei Yu, R. Adve","doi":"10.1109/GLOCOMW.2014.7063532","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063532","url":null,"abstract":"This paper studies the downlink ergodic capacity of a network multiple-input multiple-output (MIMO) system. The system model includes base-stations (BSs) randomly distributed with a fixed density, each equipped with M antennas, scheduling K single-antenna users, and forming cooperating clusters via perfect backhaul links. Intra-cluster interference is eliminated by joint transmission using zero-forcing beamforming assuming perfect channel state information (CSI), while inter-cluster interference remains. This paper shows that although coordinating a large cluster of BSs eliminates strong interferers, the coordination gain depends on the network load factor, defined as the relative ratio of M and K. In particular, we show that with M = K, increasing the coordination cluster size is only beneficial for the cluster-edge users, while degrading the ergodic capacity of the users located close to the cluster center. In contrast, when M > K, increasing the cluster size potentially improves every user's ergodic capacity. In the second part of this paper, we use tools from stochastic geometry to account for random BS locations in characterizing the performance of network MIMO systems. In this setting, we model the BS locations according to a homogeneous Poisson point process with a fixed density, and propose tractable, yet accurate, distribution functions for the signal and inter-cluster interference powers. We then derive an efficiently computable expression for the user ergodic capacity as a function of the distance between a user and the cluster center.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132830265","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063429
Yongyi Ran, E. Yang, Youkang Shi, Shuangwu Chen, Jian Yang
Service composition provides a flexible way of building customized service procedure by composing distributed atomic service components dynamically to provide new functionalities or support service chaining. Previous researches mainly focus on node mapping, composability, QoS-awareness, and load balancing, etc., and the networking support generally contains the connectivity and network capacity. Supporting specific networking functions or routing services between compute-related components is always neglected and still a challenging task for service composition, which actually needs fundamental upgrade to the existing network infrastructure. Software-defined networking has emerged as a promising network technology capable of supporting the next-generation services and networks. Therefore, in this paper, a framework for service composition enabling Network as a Service (NaaS) in software-defined networking environment is designed, which can provide customized networking services (e.g. multipath, multicast, multi-domain) between compute-related components to achieve a better and more flexible networking utility. We further implement a prototype for the service composition of an adaptive streaming service to illustrate the feasibility of the proposed framework. The experiment results are also presented to show its effectiveness.
{"title":"A NaaS-enabled framework for service composition in software defined networking environment","authors":"Yongyi Ran, E. Yang, Youkang Shi, Shuangwu Chen, Jian Yang","doi":"10.1109/GLOCOMW.2014.7063429","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063429","url":null,"abstract":"Service composition provides a flexible way of building customized service procedure by composing distributed atomic service components dynamically to provide new functionalities or support service chaining. Previous researches mainly focus on node mapping, composability, QoS-awareness, and load balancing, etc., and the networking support generally contains the connectivity and network capacity. Supporting specific networking functions or routing services between compute-related components is always neglected and still a challenging task for service composition, which actually needs fundamental upgrade to the existing network infrastructure. Software-defined networking has emerged as a promising network technology capable of supporting the next-generation services and networks. Therefore, in this paper, a framework for service composition enabling Network as a Service (NaaS) in software-defined networking environment is designed, which can provide customized networking services (e.g. multipath, multicast, multi-domain) between compute-related components to achieve a better and more flexible networking utility. We further implement a prototype for the service composition of an adaptive streaming service to illustrate the feasibility of the proposed framework. The experiment results are also presented to show its effectiveness.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132730112","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063553
A. Mohamad, R. Visoz, A. Berthet
In this paper, we investigate cooperative strategies for the slow fading Orthogonal Multiple Access Multiple Relay Channel (OMAMRC), defined as follows: (1) Independent sources communicate with a single destination in the presence of multiple relays; (2) Each relay is half-duplex; (3) Orthogonal multiple access schemes (e.g., time-division based) are used by the sources and the relays; (4) The links between the different nodes of the MAMRC are subject to slow fading and additive white Gaussian noise. The cooperative strategies are based on Joint Network Channel Coding and Decoding (JNCC/JNCD) and Selective Decoding and Forward (SDF) relaying. SDF is a variant of Decode and Forward (DF) where the relays forward a deterministic function of the correctly decoded sources' packets. JNCC/JNCD fully exploits the spatial diversity and redundancy residing in both channel and network codes. The receivers at the relays and at the destination are designed in such away that they benefit from the signals of the previously activated relays to better decode the sources. Simulations show the effectiveness of the proposed approach.
{"title":"Practical joint network-channel coding schemes for slow-fading orthogonal multiple-access multiple-relay channels","authors":"A. Mohamad, R. Visoz, A. Berthet","doi":"10.1109/GLOCOMW.2014.7063553","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063553","url":null,"abstract":"In this paper, we investigate cooperative strategies for the slow fading Orthogonal Multiple Access Multiple Relay Channel (OMAMRC), defined as follows: (1) Independent sources communicate with a single destination in the presence of multiple relays; (2) Each relay is half-duplex; (3) Orthogonal multiple access schemes (e.g., time-division based) are used by the sources and the relays; (4) The links between the different nodes of the MAMRC are subject to slow fading and additive white Gaussian noise. The cooperative strategies are based on Joint Network Channel Coding and Decoding (JNCC/JNCD) and Selective Decoding and Forward (SDF) relaying. SDF is a variant of Decode and Forward (DF) where the relays forward a deterministic function of the correctly decoded sources' packets. JNCC/JNCD fully exploits the spatial diversity and redundancy residing in both channel and network codes. The receivers at the relays and at the destination are designed in such away that they benefit from the signals of the previously activated relays to better decode the sources. Simulations show the effectiveness of the proposed approach.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127808224","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063525
S. H. Won, Hyojin Lee, Jinyoung Oh, S. Cho, Younsun Kim, Juho Lee
This paper demonstrates if the utilization of short-term channel information, i.e. channel state information (CSI) feedback, is beneficial in the coordination of multiple evolved Node Bs (eNBs) even with the practical non-ideal backhaul. Two CSI feedback delivery schemes, namely user equipment-specific and cell-specific CSI process configuration schemes, are addressed and compared. From the comparison, it is observed that the cell-specific CSI process configuration scheme exhibits acceptable performance with small overheads. Based on the cell-specific CSI process configuration, it is shown that the short-term channel information conveyance through the non-ideal backhaul is factually feasible. In addition, simulation results comparing performance of the inter-eNB coordinated multi point (CoMP) operations with short-term/long-term channel information and only with long-term channel information, verify that the use of the short-term channel information is advantageous. Finally, a signaling model for inter-eNB CoMP using short-term/long-term channel information is illustrated based on the X2 application protocol.
{"title":"Coordination of multiple eNBs using short-term channel information","authors":"S. H. Won, Hyojin Lee, Jinyoung Oh, S. Cho, Younsun Kim, Juho Lee","doi":"10.1109/GLOCOMW.2014.7063525","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063525","url":null,"abstract":"This paper demonstrates if the utilization of short-term channel information, i.e. channel state information (CSI) feedback, is beneficial in the coordination of multiple evolved Node Bs (eNBs) even with the practical non-ideal backhaul. Two CSI feedback delivery schemes, namely user equipment-specific and cell-specific CSI process configuration schemes, are addressed and compared. From the comparison, it is observed that the cell-specific CSI process configuration scheme exhibits acceptable performance with small overheads. Based on the cell-specific CSI process configuration, it is shown that the short-term channel information conveyance through the non-ideal backhaul is factually feasible. In addition, simulation results comparing performance of the inter-eNB coordinated multi point (CoMP) operations with short-term/long-term channel information and only with long-term channel information, verify that the use of the short-term channel information is advantageous. Finally, a signaling model for inter-eNB CoMP using short-term/long-term channel information is illustrated based on the X2 application protocol.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124242716","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063638
D. Behnke, N. Goddemeier, Jens Mollmer, C. Wietfeld
Innovative mobility algorithms for autonomous robots have been developed to address civil applications such as disaster relief in the past. Using sophisticated development methodologies such as combinations of model-based as well as Software- and Hardware-in-the-Loop simulations help to reduce the gap between simulations and real world scenarios. An open issue regarding the mobility is to find the optimal parametrization considering multiple optimization goals. In this research work, we introduce and analyze the Mobility Evaluation and Parameter Optimizer (MobEPO). Multiobjective optimization algorithms are used to find optimal parameter sets. We present the approach and a proof-of-concept evaluation in a common exploration scenario. We compare three suitable optimization algorithms and describe their use for prospective steering algorithm design.
{"title":"Comparison of multiobjective optimization algorithms for mobility behaviors in autonomous robot systems","authors":"D. Behnke, N. Goddemeier, Jens Mollmer, C. Wietfeld","doi":"10.1109/GLOCOMW.2014.7063638","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063638","url":null,"abstract":"Innovative mobility algorithms for autonomous robots have been developed to address civil applications such as disaster relief in the past. Using sophisticated development methodologies such as combinations of model-based as well as Software- and Hardware-in-the-Loop simulations help to reduce the gap between simulations and real world scenarios. An open issue regarding the mobility is to find the optimal parametrization considering multiple optimization goals. In this research work, we introduce and analyze the Mobility Evaluation and Parameter Optimizer (MobEPO). Multiobjective optimization algorithms are used to find optimal parameter sets. We present the approach and a proof-of-concept evaluation in a common exploration scenario. We compare three suitable optimization algorithms and describe their use for prospective steering algorithm design.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124422852","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 : 2014-12-01DOI: 10.1109/GLOCOMW.2014.7063495
M. Kühlewind, David P. Wagner, Juan Manuel Reyes Espinosa, B. Briscoe
Data Center TCP (DCTCP) is an Explicit Congestion Notification (ECN)-based congestion control and Active Queue Management (AQM) scheme. It has provoked widespread interest because it keeps queuing delay and delay variance very low. There is no theoretical reason why Data Center TCP (DCTCP) cannot scale to the size of the Internet, resulting in greater absolute reductions in delay than achieved in data centres. However, no way has yet been found for DCTCP traffic to coexist with conventional TCP without being starved. This paper introduces a way to deploy DCTCP incrementally on the public Internet that could solve this coexistence problem. Using the widely deployed Weighted Random Early Detection (WRED) scheme, we configure a second AQM that is applied solely to ECN-capable packets. We focus solely on long-running flows, not because they are realistic, but as the critical gating test for whether starvation can occur. For the non-ECN traffic we use TCP New Reno; again not to seek realism, but to check for safety against the prevalent reference. We report the promising result that, not only does the proposed AQM always avoid starvation, but it can also achieve equal rates. We even derived how the sharing ratio between DCTCP and conventional TCP traffic depends on the various AQM parameters. The next step beyond this gating test will be to quantify the reduction in queuing delay and variance in dynamic scenarios. This will support the standardization process needed to define new ECN semantics for DCTCP deployment that the authors have started at the IETF.
数据中心TCP (DCTCP)是一种基于显式拥塞通知(ECN)的拥塞控制和主动队列管理(AQM)方案。它使排队延迟和延迟方差保持在很低的水平，引起了广泛的关注。数据中心TCP (DCTCP)不能扩展到Internet的规模，这在理论上是没有理由的，它比在数据中心实现的延迟减少的绝对幅度更大。然而，目前还没有办法让DCTCP流量与传统TCP共存而不被饿死。本文介绍了一种在公共互联网上增量部署DCTCP的方法，可以解决这一共存问题。使用广泛部署的加权随机早期检测(WRED)方案，我们配置了第二个AQM，该AQM仅适用于具有ecn功能的数据包。我们只关注长时间运行的流，不是因为它们是现实的，而是作为是否会发生饥饿的关键门控测试。对于非ecn流量，我们使用TCP New Reno;同样，不是为了寻求现实主义，而是为了根据普遍的参考来检查安全。我们报告了令人鼓舞的结果，所提出的AQM不仅总是避免饥饿，而且还可以实现相等的速率。我们甚至推导出DCTCP和传统TCP流量之间的共享比率如何取决于各种AQM参数。在此门控测试之后的下一步将是量化动态场景中排队延迟和方差的减少。这将支持为DCTCP部署定义新的ECN语义所需的标准化过程，作者已经在IETF上启动了该过程。
{"title":"Using data center TCP (DCTCP) in the Internet","authors":"M. Kühlewind, David P. Wagner, Juan Manuel Reyes Espinosa, B. Briscoe","doi":"10.1109/GLOCOMW.2014.7063495","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063495","url":null,"abstract":"Data Center TCP (DCTCP) is an Explicit Congestion Notification (ECN)-based congestion control and Active Queue Management (AQM) scheme. It has provoked widespread interest because it keeps queuing delay and delay variance very low. There is no theoretical reason why Data Center TCP (DCTCP) cannot scale to the size of the Internet, resulting in greater absolute reductions in delay than achieved in data centres. However, no way has yet been found for DCTCP traffic to coexist with conventional TCP without being starved. This paper introduces a way to deploy DCTCP incrementally on the public Internet that could solve this coexistence problem. Using the widely deployed Weighted Random Early Detection (WRED) scheme, we configure a second AQM that is applied solely to ECN-capable packets. We focus solely on long-running flows, not because they are realistic, but as the critical gating test for whether starvation can occur. For the non-ECN traffic we use TCP New Reno; again not to seek realism, but to check for safety against the prevalent reference. We report the promising result that, not only does the proposed AQM always avoid starvation, but it can also achieve equal rates. We even derived how the sharing ratio between DCTCP and conventional TCP traffic depends on the various AQM parameters. The next step beyond this gating test will be to quantify the reduction in queuing delay and variance in dynamic scenarios. This will support the standardization process needed to define new ECN semantics for DCTCP deployment that the authors have started at the IETF.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117000028","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
扫码关注我们
求助内容：
应助结果提醒方式：