Discrete-time analysis of a finite capacity queue with an ’all or nothing policy’ to reduce burst loss

Abstract

Many new and old applications have to split the information into smaller units while transmitted through a network. If not the whole packet is able to get through to the destination the fraction transmitted is of no value. Several areas within the tele-and data communication field ~here this applies are pointed out. Further a discrete time model with bursty arrivals is introduced and analyzed. The result shows the advantage of the 'All or Nothing Policy' for the burst loss probability and the waiting time.