Buffer-aware adaptive resource allocation scheme in LTE transmission systems

Zhu, R. Y.; Yang, Jian

doi:10.1186/s13638-015-0398-y

Cited by 11 publications

(5 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both DRWA and ARWA take less time to transfer a packet from the source to destination and maintain a less number of packets in user queue at eNodeB. e average packet delay of the ARWA method is slightly more than DRWA, but the packet delay is within the standard QCI limit [5]. e throughput of ARWA is improved by 23.68-35.41% compared to the DRWA method, and the delay of ARWA is reduced by 78.87-90% compared to the autotuning method.…”

Section: Estimation Of Network Congestion At the Receiver Sidementioning

confidence: 99%

“…us, there is overflow of RLC queues due to the large volume of traffic in a short period of time leading to high delay resulting in poor performance. To guarantee high throughput and low delay during congestion, the researchers have proposed various methods such as buffer-aware scheduling [5][6][7][8], active queue management (AQM) techniques [9][10][11][12], receiver window control [13][14][15], loss-based congestion control [16][17][18], delay-based congestion control [16,19,20], rate-based congestion control [4,20,21], admission and congestion control [22][23][24][25], and resource starvation [26][27][28].…”

Section: Introductionmentioning

confidence: 99%

“…Con guration parameters used in simulation[5]. Even if the number of users is increased, the behavior of the network remains the same.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Adaptive Receiver-Window Adjustment for Delay Reduction in LTE Networks

Adesh

Renuka

2019

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

The cellular network keeps the vast capacity of queue space at eNodeBs (base stations) to reduce the queue overflow during the burst in data traffic. However, this adversely affects the delay sensitive applications and user quality of experience. Recently, few researchers have focused on reducing the packet delay, but it has a negative impact on the utilization of network resource by the users. Further, it fails to maintain fairness among the users, when competing for a shared resource in coexistence with conventional TCP or UDP users. Therefore, in this paper, the adaptive receiver-window adjustment (ARWA) algorithm is proposed to efficiently utilize the network resources and ensure fairness among the users in resource competitive environment, which requires slight modification of TCP at both the sender and receiver. The proposed mechanism dynamically varies the receiver window size based on the data rate and delay information of the packets, to enhance the performance of the system. Based on extensive experiments, the results illustrate that the ARWA algorithm reduces the delay of TCP packet and increases fairness among the users. In addition to that, it enhances the packet delivery fraction (PDF) and maintains the throughput of the system. Moreover, it competes with other conventional TCP users for the shared network resources in a fair manner.

show abstract

Section: Estimation Of Network Congestion At the Receiver Sidementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive Receiver-Window Adjustment for Delay Reduction in LTE Networks

Adesh

Renuka

2019

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

show abstract

“…We carry out a simulation in order to investigate the effect of the customized intra-slice resource allocation under the proposed dynamic slice resource provisioning framework in a virtualized radio access network for heterogeneous traffics. In this simulation, the proposed shape-based resource allocation algorithm is benchmarked against MaxSinr scheme [34] and Buffer-Length aware dynamic resource allocation scheme [35] under the common resource slicing scheme proposed in the paper. The slice-level satisfaction ratio is derived by computing the total number of users that have been satisfied divided by the total number of users in each slice in equation (6).…”

Section: Performance Comparison Over User Populationmentioning

confidence: 99%

Dynamic Resource Provisioning and Resource Customization for Mixed Traffics in Virtualized Radio Access Network

et al. 2019

View full text Add to dashboard Cite

The fifth generation (5G) wireless technology is envisioned to support different applications or services on a common substrate infrastructure. To achieve this objective, network virtualization is needed to partition the physical network into various network slices with each slice providing a unique service in the network. In networks with mixed traffics, service operators are required to provide services in isolation since each service has its own defined objective. In such mixed traffics, achieving an efficient and effective resource allocation is a challenging issue. In this paper, we propose a dynamic resource provisioning scheme involving mixed traffics with multiple base stations in a virtualized radio access network. Since users in each slice have varying requirements on satisfaction regarding the delay and data rate, we propose a customized shape-based heuristic algorithm for users to improve resource utilization and QoS fulfilment.The comprehensive system-level simulation is conducted based on OFDMA air-interface design. Simulation results show that the proposed algorithm outperforms baseline algorithms in terms of QoS satisfaction and resource utilization.

show abstract

“…In such scenarios, for reducing buffer overflow incidents, a buffer-aware source rate control mechanism can be exploited to adjust the traffic load in the network [17]. Also, buffer-aware resource allocation methods similar to [18] can be employed to efficiently serve the system queues. Then, considering the discussions presented in this paper as well as the probability of repeated transmissions, the end-to-end packet delay can be investigated for conventional and buffer-aided relaying systems with finite buffer capacities in the BS and relay.…”

Section: Introductionmentioning

confidence: 99%

Buffer-aided relaying improves both throughput and end-to-end delay

Hajipour

Ruby

Mohamed

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

Buffer-aided relaying has recently attracted a lot of attention due to the improvement in the system throughput. However, a side effect usually deemed is that buffering at relay nodes results in the increase of packet delays. In this paper, we study the effect of buffering at relays on the end-to-end delay of users' data, from the time they arrive at the source until delivery to the destination. We use simple discussions to provide an insight on the overall waiting time of the packets in the system, taking into account the queue dynamics both in the source and relay. We analyze the endto-end delay in the relay networks with Bernoulli data arrivals and channel conditions and prove that the data packets experience lower average end-to-end delay in the buffer-aided relaying system compared with the conventional one. Moreover, using intuitive generalizations, we conclude that the use of buffers at relays improves not only throughput but ironically the average end-to-end packet delay. Through extensive simulations, we validate our analytical results for the system when the data arrival and channel condition processes follow Bernoulli distribution. Furthermore, via the simulations under the settings of practical systems, we confirm our intuition for the general scenarios.

show abstract

Buffer-aware adaptive resource allocation scheme in LTE transmission systems

Cited by 11 publications

References 29 publications

Adaptive Receiver-Window Adjustment for Delay Reduction in LTE Networks

Adaptive Receiver-Window Adjustment for Delay Reduction in LTE Networks

Dynamic Resource Provisioning and Resource Customization for Mixed Traffics in Virtualized Radio Access Network

Buffer-aided relaying improves both throughput and end-to-end delay

Contact Info

Product

Resources

About