Study on the Resource Scheduling Algorithm for LTE-Advanced Downlink Systems

2014 ◽  
Vol 577 ◽  
pp. 1017-1021
Author(s):  
Hong Zhuo Wang ◽  
Zheng Hai Sun ◽  
Jun Wang ◽  
Fang Liu
Keyword(s):  
Power Allocation ◽  
Scheduling Algorithm ◽  
Resource Scheduling ◽  
Carrier Aggregation ◽  
High Complexity ◽  
Proportional Fair ◽  
Lte Advanced ◽  
Simulation Results ◽  
Equal Power Allocation ◽  
Equal Power

In the paper, the resource scheduling algorithm in the downlink of LTE-Advanced (LTE-A) assuming equal power allocation among subcarriers which adopted the technology of carrier aggregation (CA) is investigated. When the independent scheduling (INS) scheme is applied, the LTE users will acquire few resources because they cannot support CA technology. And the fairness of the system is disappointing. Focusing on the problem, a novel proportional fair (PF) scheduling algorithm based on INS is proposed. In the proposed method, the system fairness is well improved without bringing high complexity to the system. And also, we design a weigh factor which is related to the number of the carriers and the percentage of LTE users in the method. The simulation results show that the proposed algorithm can effectively increase the throughput of LTE users and improve the system fairness.

scholarly journals Randomized scheduling algorithm for virtual output queuing switch at the presence of non-uniform traffic

2019 ◽  
Vol 8 (1) ◽  
pp. 50
Author(s):  
Ali Ghiasian ◽  
Majid Jamali
Keyword(s):  
Randomized Algorithms ◽  
High Speed ◽  
Time Slot ◽  
Scheduling Algorithm ◽  
Superior Performance ◽  
High Complexity ◽  
Maximum Weight ◽  
Switch Architecture ◽  
Simulation Results ◽  
Maximum Weight Matching

<span>Virtual Output Queuing (VOQ) is a well-known queuing discipline in data switch architecture that eliminates Head Of Line (HOL) blocking issue. In VOQ scheme, for each output port, a separate FIFO is maintained by each input port. Consequently, a scheduling algorithm is required to determine the order of service to virtual queues at each time slot. Maximum Weight Matching (MWM) is a well-known scheduling algorithm that achieves the entire throughput region. Despite of outstanding attainable throughput, high complexity of MWM makes it an impractical algorithm for implementation in high-speed switches. To overcome this challenge, a number of randomized algorithms have been proposed in the literature. But they commonly perform poorly when input traffic does not uniformly select output ports. In this paper, we propose two randomized algorithms that outperform the well-known formerly proposed solutions. We exploit a method to keep a parametric number of heavy edges from the last time matching and mix it by randomly generated matching to produce a new schedule. Simulation results confirm the superior performance of the proposed algorithms.</span>

Repetition Coding and Equal Power Allocation Scheme for JPEG Image Transmission over MIMO Systems

2016 ◽  
Vol 8 (3) ◽  
pp. 10-19
Author(s):  
Mujeeb Ahmed
Keyword(s):  
Power Allocation ◽  
Mimo Systems ◽  
Spatial Multiplexing ◽  
Quality Data ◽  
Smart Devices ◽  
Allocation Scheme ◽  
Repetition Coding ◽  
Equal Power Allocation ◽  
Equal Power ◽  
Antenna Systems

Multiple transmit and receive antenna systems have improved the reliability as well as data rate in a wireless communication system. Such advanced wireless architectures have empowered smart devices to fulfill the demand of multimedia content. Image is a major user generated content in wide range of applications, hence reliable transmission of image is an important research problem. New transmission and coding schemes that explore advantages of multiple antenna systems matched with source statistics have been developed. Based on a similar idea, an equal power allocation scheme for transmission of compressed images over multiple-input multiple-output (MIMO) systems employing partial repetition coding is proposed. The JPEG compression algorithm divides image into different quality layers. The proposed system repeats transmission of high quality data from more than one antenna as compared to the lower quality data which is transmitted using one antenna at most, in a particular time slot. A heuristic spatial multiplexing scheme is also proposed to optimally divide the bit stream chunks for transmission. Extensive simulations have shown that equal power allocation and repetition coding scheme is better as compared to reference schemes.

Research on Resource Scheduling Algorithm Integrating Task Weight and Multi-QoS Constraint

2011 ◽  
Vol 52-54 ◽  
pp. 1125-1130
Author(s):  
Jing Chen ◽  
Ming Xin Liu
Keyword(s):  
Scheduling Algorithm ◽  
Resource Scheduling ◽  
Grid Resource ◽  
Resource Information ◽  
Grid Resource Scheduling ◽  
Utilization Ratio ◽  
Simulation Results ◽  
And Task

To improve the utilization ratio of resources and the complete number of tasks, a kind of a new grid resource scheduling algorithm TWMQC (based on Task Weight and Multi-QoS Constraint) integrating multi-QoS constraint with task weight was proposed. The accomplished process of grid resource scheduling algorithm was transformed multi attribute constraints of resource and task, according to the parametric resource information and task information, classified different task weight sets based on the priority of tasks. Multi-QoS constraints of deadline of gridlets, bandwidth and CPU were defined, and the correlative algorithms were simulated by the GridSim toolkits. The simulation results show that algorithm TWMQC, which integrating multi-QoS constraint and tasks weight is superior in solving such kind of issues by comparing and analyzing the result data.

Sign in / Sign up

Export Citation Format

Share Document