The Experts below are selected from a list of 15696 Experts worldwide ranked by ideXlab platform
Paolo Baracca - One of the best experts on this subject based on the ideXlab platform.
-
Traffic Profile based clustering for dynamic tdd in dense mobile networks
Vehicular Technology Conference, 2016Co-Authors: Paolo BaraccaAbstract:The Traffic Profile of future mobile networks is foreseen as becoming more variable both in time and among base stations (BSs) due to the widespread heterogeneity in applications and services. Dynamic time division duplex (TDD) has been recognized as an important enabler to cope with this Traffic variability, especially in dense networks with many BSs and a small number of user equipments (UEs) served by each BS. In this context, one of the main issues is to develop an incisive scheme to manage the BS-to-BS and UE-to- UE interference that arises. In this work, we propose a novel long-term BS clustering scheme that groups BSs that have a similar Traffic Profile and would be characterized, without clustering, by strong BS-to-BS interference. Due to the complexity of the optimal solution, we propose a heuristic algorithm which solves the optimization problem efficiently. Numerical evaluations in a dense homogeneous pico BS network show that the proposed scheme strongly outperforms even the baseline dynamic TDD without clustering by ensuring a reduction in packet delay of up to 55% and a gain in the UE packet throughput of about 75%.
-
VTC Fall - Traffic Profile Based Clustering for Dynamic TDD in Dense Mobile Networks
2016 IEEE 84th Vehicular Technology Conference (VTC-Fall), 2016Co-Authors: Paolo BaraccaAbstract:The Traffic Profile of future mobile networks is foreseen as becoming more variable both in time and among base stations (BSs) due to the widespread heterogeneity in applications and services. Dynamic time division duplex (TDD) has been recognized as an important enabler to cope with this Traffic variability, especially in dense networks with many BSs and a small number of user equipments (UEs) served by each BS. In this context, one of the main issues is to develop an incisive scheme to manage the BS-to-BS and UE-to- UE interference that arises. In this work, we propose a novel long-term BS clustering scheme that groups BSs that have a similar Traffic Profile and would be characterized, without clustering, by strong BS-to-BS interference. Due to the complexity of the optimal solution, we propose a heuristic algorithm which solves the optimization problem efficiently. Numerical evaluations in a dense homogeneous pico BS network show that the proposed scheme strongly outperforms even the baseline dynamic TDD without clustering by ensuring a reduction in packet delay of up to 55% and a gain in the UE packet throughput of about 75%.
Yun Peng - One of the best experts on this subject based on the ideXlab platform.
-
throughput maximization with Traffic Profile in wireless mesh network
Computing and Combinatorics Conference, 2008Co-Authors: Hejiao Huang, Yun PengAbstract:Wireless mesh networks (WMNs) are becoming increasingly common for applications, according to its multi-radio and multi-channel advantage over their counterpart, wireless LANs. In WMNs, multiple simultaneous communications over multi-radios using orthogonal channels further improve Traffic throughput. Certainly, effective routing and channel assignment are critical, at the same time. Recently, a number of Profile-based routing algorithms have emerged, using multi-commodity network flow. Traffic Profile used in them records the QoS requirements. But expectant bandwidth requirements may not be assured in wireless condition. Hence, in this paper, we demonstrate a scheme to compute the maximal possible guaranteed bandwidth. Our evaluation demonstrates that our algorithm performs much better than the famous Shortest Path Routing algorithm in routing Traffic Profile on Grid networks.
-
COCOON - Throughput Maximization with Traffic Profile in Wireless Mesh Network
Lecture Notes in Computer Science, 1Co-Authors: Hejiao Huang, Yun PengAbstract:Wireless mesh networks (WMNs) are becoming increasingly common for applications, according to its multi-radio and multi-channel advantage over their counterpart, wireless LANs. In WMNs, multiple simultaneous communications over multi-radios using orthogonal channels further improve Traffic throughput. Certainly, effective routing and channel assignment are critical, at the same time. Recently, a number of Profile-based routing algorithms have emerged, using multi-commodity network flow. Traffic Profile used in them records the QoS requirements. But expectant bandwidth requirements may not be assured in wireless condition. Hence, in this paper, we demonstrate a scheme to compute the maximal possible guaranteed bandwidth. Our evaluation demonstrates that our algorithm performs much better than the famous Shortest Path Routing algorithm in routing Traffic Profile on Grid networks.
Hejiao Huang - One of the best experts on this subject based on the ideXlab platform.
-
throughput maximization with Traffic Profile in wireless mesh network
Computing and Combinatorics Conference, 2008Co-Authors: Hejiao Huang, Yun PengAbstract:Wireless mesh networks (WMNs) are becoming increasingly common for applications, according to its multi-radio and multi-channel advantage over their counterpart, wireless LANs. In WMNs, multiple simultaneous communications over multi-radios using orthogonal channels further improve Traffic throughput. Certainly, effective routing and channel assignment are critical, at the same time. Recently, a number of Profile-based routing algorithms have emerged, using multi-commodity network flow. Traffic Profile used in them records the QoS requirements. But expectant bandwidth requirements may not be assured in wireless condition. Hence, in this paper, we demonstrate a scheme to compute the maximal possible guaranteed bandwidth. Our evaluation demonstrates that our algorithm performs much better than the famous Shortest Path Routing algorithm in routing Traffic Profile on Grid networks.
-
COCOON - Throughput Maximization with Traffic Profile in Wireless Mesh Network
Lecture Notes in Computer Science, 1Co-Authors: Hejiao Huang, Yun PengAbstract:Wireless mesh networks (WMNs) are becoming increasingly common for applications, according to its multi-radio and multi-channel advantage over their counterpart, wireless LANs. In WMNs, multiple simultaneous communications over multi-radios using orthogonal channels further improve Traffic throughput. Certainly, effective routing and channel assignment are critical, at the same time. Recently, a number of Profile-based routing algorithms have emerged, using multi-commodity network flow. Traffic Profile used in them records the QoS requirements. But expectant bandwidth requirements may not be assured in wireless condition. Hence, in this paper, we demonstrate a scheme to compute the maximal possible guaranteed bandwidth. Our evaluation demonstrates that our algorithm performs much better than the famous Shortest Path Routing algorithm in routing Traffic Profile on Grid networks.
Sakir Sezer - One of the best experts on this subject based on the ideXlab platform.
-
Mobility Conference - Delay-bound preservation through packet scheduling at wireless access point nodes
Proceedings of the 3rd international conference on Mobile technology applications & systems - Mobility '06, 2006Co-Authors: Steven Walsh, E Garcia, Sakir SezerAbstract:Wireless packet schedulers have concentrated for the most part on preserving fairness in a network environment where channels are subject to location-dependent errors. By recording the lost service and compensating flows after an error period, long-term throughput and long-term fairness can be maintained. This paper stresses that what is most pertinent to current wireless QoS however, is the preservation of delay guarantees for sessions in the face of channel errors. A Traffic Profile and priority based wireless fair queuing (TPP-WFQ) scheduling approach is proposed, which utilizes all available residue bandwidth in the system to allow sessions to catch up to their error-free service as quickly as possible. In addition, a bandwidth management platform that adjusts session weights for use by the scheduler is presented. Priority is given to real-time Traffic with strict delay bounds for both bandwidth utilization and compensation. Simulated results illustrate how maintaining short-term delay guarantees in this way does not affect long term fairness and throughput guarantees for other sessions more tolerant to delay.
-
A framework for Traffic-Profile based wireless fair queuing for next generation wireless networks
Irish Signals and Systems Conference 2004, 2004Co-Authors: Steven Walsh, Emi Garcia-palacios, Sakir SezerAbstract:Despite the many wireline and wireless scheduling algorithms in existence today, there is no emphasis on implementing a practical scheduling algorithm, which can be realised on existing hardware architectures. It is the aim of this paper to present an algorithm which schedules IP packets at the network layer using current state-of-the-art fair queuing techniques and a weight based method of compensation for lagging flows. Furthermore, the wireless fair scheduling algorithms that have been published to date have failed to consider the influence of Traffic patterns on compensating channels, which have lost service due to channel errors. This paper highlights the importance of these Traffic patterns and presents a new framework for a Traffic-Profile based wireless fair queuing (TBWFQ) algorithm. This algorithm is implemented using Xilinx FPGA design techniques.
-
Knowledge-based wireless fair queuing using a Traffic-Profile compensation technique for broadband fixed wireless applications
2005 IEEE 61st Vehicular Technology Conference, 1Co-Authors: Steven Walsh, E Garcia, Sakir SezerAbstract:Despite the many wireless scheduling algorithms that have been proposed to date, there are a number of practical wireless scheduling issues which have yet to be provided for. This paper asserts that an intelligent wireless scheduler must be knowledge-based. To make practical decisions on which flows should receive what degree of compensation when links experience channel errors, it is essential to have knowledge of two individual metrics; a bandwidth metric and Traffic metric. The current aggregate system bandwidth changes continuously according to the 'atmospheric conditions experienced and adaptive methods employed on a per channel basis. The Traffic Profile of each flow also changes depending on the burstiness of individual channels. These two parameters have a significant impact on how compensation should be issued. Also, a wireless scheduling algorithm should be realizable on existing hardware technology. It is the aim of this research to present an algorithm which schedules IP packets at the network layer using current state-of-the-art fair queuing techniques and a weight based method of compensation for lagging flows. The proposed algorithm is highly adaptable taking into account the current Traffic Profile as well as the constantly varying channel conditions and system bandwidth capacity in order to compensate lagging flow's. Results presented in this paper show how compensation is provided to error channels on a knowledge-based principle.
Armin Dekorsy - One of the best experts on this subject based on the ideXlab platform.
-
impact of varying Traffic Profile on phantom cell concept energy savings schemes
Vehicular Technology Conference, 2015Co-Authors: Emmanuel Ternon, Patrick Agyapong, Armin DekorsyAbstract:Sleep mode techniques can provide energy savings in Phantom Cell Concept (PCC) systems. However, the impact of the Traffic Profile on the performance of these energy savings schemes is not well understood. In this paper, we evaluate the influence of the size of transmitted files on the network performance. Contrary to previous findings, we show that for smaller file sizes the connection latencies associated with different energy savings schemes do have a non-negligible impact on system performance. However, as the file size increases, the influence of the connection delays associated with different schemes becomes negligible. The particular file size inflection point depends on the ratio of bandwidth resources on the small cell and the macro cell.
-
VTC Spring - Impact of Varying Traffic Profile on Phantom Cell Concept Energy Savings Schemes
2015 IEEE 81st Vehicular Technology Conference (VTC Spring), 2015Co-Authors: Emmanuel Ternon, Patrick Agyapong, Armin DekorsyAbstract:Sleep mode techniques can provide energy savings in Phantom Cell Concept (PCC) systems. However, the impact of the Traffic Profile on the performance of these energy savings schemes is not well understood. In this paper, we evaluate the influence of the size of transmitted files on the network performance. Contrary to previous findings, we show that for smaller file sizes the connection latencies associated with different energy savings schemes do have a non-negligible impact on system performance. However, as the file size increases, the influence of the connection delays associated with different schemes becomes negligible. The particular file size inflection point depends on the ratio of bandwidth resources on the small cell and the macro cell.