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

Author

Harris, John M. ; Kumar, Srikanta P.

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA

Volume

2

fYear

1996

Firstpage

751

Abstract

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

Keywords

cellular radio; data communication; delays; exponential distribution; land mobile radio; minimisation; packet radio networks; queueing theory; Poisson arrivals; cellular data networks; cellular packet data networks; dynamic minimum delay algorithm; dynamic queuing delay minimisation; exponential transmission times; minimum delay schedule; packet arrival; packet departure; packet queuing delay; packet schedule; preemption probability reduction; preemption reduction algorithm; Base stations; Bipartite graph; Cellular networks; Costs; Delay effects; Dynamic scheduling; Frequency; Heuristic algorithms; Intelligent networks; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 1996. Mobile Technology for the Human Race., IEEE 46th

ISSN

1090-3038

Print_ISBN

0-7803-3157-5

Type

conf

DOI

10.1109/VETEC.1996.501412

Filename

501412