Controlling Packet Loss of Bursty and Correlated Traffics in a Variant of Multiple Vacation Policy
This paper presents a finite-buffer single server queue where packets arrive according to a batch Markovian arrival process (BMAP). Partial batch acceptance strategy has been analyzed in which the incoming packets of a batch are allowed to enter the buffer as long as there is space. When the buffer is full, remaining packets of a batch are discarded. The server serves till system is emptied and after that it takes a maximum H number of vacations until it either finds at least one packet in the queue or the server has exhaustively taken all the vacations. We obtain some important performance measures such as probability of blocking for the first-, an arbitrary- and the last-packet of a batch, mean queue lengths and mean waiting time of packet. The burstiness of the correlated traffic influences the probability of packet loss which makes buffer management to satisfy the Quality of Service (QoS) requirements.
KeywordsBuffer management correlated arrivals variant of multiple vacation policy packet loss probability
Unable to display preview. Download preview PDF.