Priority schemes for packet data and multi-slot operation on EDGE

In this paper we propose a priority-based algorithm for data communication over EDGE considering the length of the packet. For long packets we consider their time of transmission to be very long and therefore we put them on top of the queue. On the other hand, short packets have a short time of transmission and hence, can support a longer waiting time so they are put on the bottom of the queue. We propose two priority schemes: a simple priority scheme and a multi-slot priority scheme that improves considerably performance of the EDGE. Since the number of large packets affects directly the delay of the short packets, it is necessary to maintain this number low, so the number of large packets is optimized depending on the traffic load of the system. We find the optimum size to consider a packet as a long packet for the different arrival rates of the users to the system. This priority schemes, we achieve up to 0.4 seconds less for the normalized delay depending on the arrival rate.