An algorithm for dynamically minimizing the queuing delay of packets in cellular data networks

Customers in cellular packet data networks are sensitive to delay. This paper presents an algorithm which dynamically minimizes the delay of the packets in a cellular packet data network. This algorithm assumes Poisson arrivals and exponential transmission times. Each time a packet arrival or departure occurs, the dynamic minimum delay algorithm (DMDA)presented, adjusts the packets in the current packet schedule (PS) to form a new PS which is a minimum delay schedule (MDS). The DMDA may need to preempt a packet in order to obtain a new MDS after a departure. The preemption reduction algorithm (PRA), also presented, reduces the probability of preemption.