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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
