Performance Modelling of Finite Capacity Queues with Complete Buffer Partitioning Scheme for Bursty Traffic

Finite buffer queues under complex management schemes are of great importance towards effective congestion control and quality of service (QoS) provision in the telecommunication networks. This paper analyses a single server G/G/1/N censored queue with R (R ges 2) traffic classes under complete buffer partitioning scheme and first come first served (FCFS) service discipline. A finite capacity vector, N, represents the capacity of partitions for each class (N₁, N₂, ..., N_R). The forms of the state probabilities, as well as basic performance measures such as blocking probability are analytically established at equilibrium via appropriate mean value constraints based on the principle of maximum entropy (ME). Typical numerical experiments are included to illustrate the credibility of the proposed analysis in the context of generalised exponential (GE)-type queues