||In an LTE (Long-Term Evolution) network, HARQ (Hybrid Automatic Repeat reQuest) is used to reduce the error probability of retransmitted packets. However, HARQ cannot guarantee delay constraints for real-time traffic when RBs (Resource Blocks) are allocated improperly. To avoid the retransmitted real-time packets exceeding their delay constraints, we propose an HARQ scheduling scheme based on RTT (Round-Trip-Time) estimation. In this scheme, traffic are classified into real-time and non-real-time queues in which real-time queue are further classified into four sub-queues according to their retransmission times; i.e., the first transmission queue,|
the first retransmission queue, the second retransmission queue, and the third retransmission queue. For the four real-time queues, we estimate RTT and compute the number of RBs required satisfying the delay constraints. To prevent from starvation of non-real-time traffic, after allocating the RBs for real-time traffic, the remaining RBs are allocated for non-real-time traffic according to their MBR
(Minimum Bit Rate). To analyze the proposed scheduling scheme, we build a mathematical model to derive the successful probability of retransmitted packets and the expected value of packet retransmission times. Finally, we compute average packet delay, average packet loss rate, and the throughput for both real-time and none-real-time traffic by varying packet error probability and the delay constraints of real-time traffic.