A Novel Queueing Access Scheme with Variable Service Probability for Multiple Access Applications

Abstract Queueing access systems have many applications in daily life, industry, and technology, i.e., bank counter, supermarkets, parts process, router, CPU scheduling, I/O access arrangements, etc. When multiple services are required to match the level of demand for a limited access resource, a multitasking server is needed to release the queueing access problems. In this paper, a multiple queueing access scheme with both fair and enhanced throughput characteristic is available, which can avoid both service conflicts for more throughputs and meet fair service opportunity for each user simultaneously. The proposed scheme represented as M/M/1*/∞ with multiple virtual servers (superscript with 1*) will also provide flexibility for arranging VSPs for users with priority or specific quality of services. Moreover, the proposed scheme will be also exemplified, formulated, and compared with conventional M/M/1/∞ queuing access approach. The system performance and characteristics are also presented with the specified queuing parameters and VSP. It shows that the expected probability and user number in service (not in queue) are enhanced with the proposed scheme.