scholarly journals A New Swap-Based Frequency-Domain Packet Scheduling Algorithm in OFDMA System with Data Queue Size Constraints

2016 ◽  
Vol 2016 ◽  
pp. 1-7
Author(s):  
Lin Shao ◽  
Yunxiao Zu ◽  
Hanyong Shao
Keyword(s):  
Frequency Domain ◽  
Multiple Access ◽  
Packet Scheduling ◽  
Scheduling Algorithm ◽  
System Throughput ◽  
Queue Size ◽  
Frequency Division ◽  
Ofdma System ◽  
Size Constraints ◽  
Throughput Improvement

This paper aims at the frequency-domain packet scheduling (FDPS) problem in orthogonal frequency division multiple access (OFDMA) system. Under users’ data queue size constraints, a new swap-based FDPS algorithm is proposed to achieve further improvement in system throughput. In this algorithm, the swap of physical resource blocks (PRBs) between different users is introduced to give a comprehensive view of the overall scheduling process. Moreover, the proposed algorithm optimizes the choosing method of swap candidates and always tries to select the user who can maximize the throughput improvement. Simulation results demonstrate that this new algorithm can improve the system throughput significantly as well as reduce the resource waste effectively.

scholarly journals An Adaptive Throughput-First Packet Scheduling Algorithm for DPDK-Based Packet Processing Systems

2021 ◽  
Vol 13 (3) ◽  
pp. 78
Author(s):  
Chuanhong Li ◽  
Lei Song ◽  
Xuewen Zeng
Keyword(s):  
Packet Loss ◽  
High Performance ◽  
Packet Scheduling ◽  
Scheduling Algorithm ◽  
Processing System ◽  
System Throughput ◽  
Packet Processing ◽  
Research Attention ◽  
Continuous Increase ◽  
Packet Scheduling Algorithm

The continuous increase in network traffic has sharply increased the demand for high-performance packet processing systems. For a high-performance packet processing system based on multi-core processors, the packet scheduling algorithm is critical because of the significant role it plays in load distribution, which is related to system throughput, attracting intensive research attention. However, it is not an easy task since the canonical flow-level packet scheduling algorithm is vulnerable to traffic locality, while the packet-level packet scheduling algorithm fails to maintain cache affinity. In this paper, we propose an adaptive throughput-first packet scheduling algorithm for DPDK-based packet processing systems. Combined with the feature of DPDK burst-oriented packet receiving and transmitting, we propose using Subflow as the scheduling unit and the adjustment unit making the proposed algorithm not only maintain the advantages of flow-level packet scheduling algorithms when the adjustment does not happen but also avoid packet loss as much as possible when the target core may be overloaded Experimental results show that the proposed method outperforms Round-Robin, HRW (High Random Weight), and CRC32 on system throughput and packet loss rate.

Subcarrier and Power Allocation Algorithm for Spectral Efficiency Maximization in Superposition Coding OFDMA Systems

2015 ◽  
Vol 24 (05) ◽  
pp. 1550061
Author(s):  
Mateus de Paula Marques ◽  
Taufik Abrão
Keyword(s):  
Power Allocation ◽  
Spectral Efficiency ◽  
Time Complexity ◽  
Multiple Access ◽  
Optimization Problem ◽  
Frequency Division ◽  
Superposition Coding ◽  
Ofdma System ◽  
Transmission Strategy ◽  
Throughput Gain

This paper addresses the optimization problem on subcarrier and power allocation of orthogonal frequency division multiple access (OFDMA) system under spectral efficiency (SE) metric when deploying superposition coding (SC) transmission strategy. An algorithm with polynomial time complexity, of the order of (UN log 2(N)) has been proposed for sub-optimal SE maximization. Results indicate that the system SE increases with the use of SC technique. Besides, the throughput gain with SC adoption increases when the number of users (U) approaches the number of subcarriers (N) available in the system.

scholarly journals Frequency Domain Backoff for Continuous Beamforming Space Division Multiple Access on Massive MIMO Wireless Backhaul Systems

2020 ◽  
Vol 16 (1) ◽  
pp. 1-10
Author(s):  
Kazuki Maruta
Keyword(s):  
Frequency Domain ◽  
Multiple Access ◽  
Random Access ◽  
Packet Delay ◽  
Base Station ◽  
Spatial Multiplexing ◽  
System Throughput ◽  
Space Division Multiple Access ◽  
Wireless Backhaul ◽  
Space Division

This paper newly proposes a frequency domain backoff scheme dedicated to continuous beamforming space division multiple access (CB-SDMA) on massive antenna systems for wireless entrance (MAS-WE). The entrance base station (EBS) has individual base band signal processing units for respective relay stations (RSs) to be accommodated. EBS then continuously applies beamforming weight to transmission/reception signals. CB-SDMA yields virtual point-to-point backhaul link where radio resource control messages and complicated multiuser scheduling are not required. This simplified structure allows RSs to work in a distributed manner. However, one issue remains to be resolved; overloaded multiple access resulting in collision due to its random access nature. The frequency domain backoff mechanism is introduced instead of the time domain one. It can flexibly avoid co-channel interference caused by excessive spatial multiplexing. Computer simulation verifies its superiority in terms of system throughput and packet delay.

Wireless Packet Scheduling Algorithm for OFDMA System based on Time-utility and Channel State

ETRI Journal ◽  
2005 ◽  
Vol 27 (6) ◽  
pp. 777-787 ◽  
Author(s):  
Seungwan Ryu ◽  
Byung-Han Ryu ◽  
Hyunhwa Seo ◽  
Muyong Shin ◽  
SeiKwon Park
Keyword(s):  
Packet Scheduling ◽  
Scheduling Algorithm ◽  
Channel State ◽  
Ofdma System ◽  
Packet Scheduling Algorithm ◽  
Wireless Packet
Sign in / Sign up

Export Citation Format

Share Document