Queueing analysis of early message discard policy

We consider in this paper packets which arrive according to a Poisson process into a finite queue. A group of consecutive packets forms a frame (or a message) and one then considers not only the quality of service (QoS) of a single packet but also that of the whole message. In order to improve the required QoS, either on the frame loss probabilities or on the delay, discarding mechanisms have to be used. We analyze in this paper the performance of the early message discard (EMD) policy at the buffer, which consists of (1) rejecting an entire message if upon the arrival of the first packet of the message, the buffer occupancy exceeds a threshold K, and (2) if a packet is lost, then all subsequent arrivals that belong to the same message are discarded.