A unified approach to analyze multiple access protocols for buffered finite users

(2004) A unified approach to analyze multiple access protocols for buffered finite users. Journal of Network and Computer Applications, 27. pp. 49-76. ISSN 1084-8045

This is the latest version of this item.

Full text not available from this repository.


In this paper, a new approach is proposed to analyze the performance of buffered random multiple access protocols called tagged user analysis (TUA). In TUA, each user is modeled as an independent queueing system, which operates at its own equilibrium probability. As a result, the classical queueing theory can be employed to analyze the queueing behavior of each user. On the basis of the behavior of the tagged user, the performance of the whole system is analyzed. TUA is a unified method of analyzing most of random access methods including the heterogeneous random multiple access techniques that are difficult to analyze otherwise. Furthermore, TUA can also handle those systems where user terminals may have arbitrary packet size (in slots) distribution, arbitrary arrival processes such as batch packet arrivals in Bernoulli, arbitrary service principle such as priority queueing, last came first served, and random service. In this paper, in addition to analyzing for the distributions of several performance indices, their mean values are obtained.

Item Type: Article
Subjects: Electrical
Department: College of Engineering and Physics > Electrical Engineering
Depositing User: ANKAR (g200603940) (g200603940)
Date Deposited: 23 Mar 2008 06:27
Last Modified: 01 Nov 2019 13:24
URI: http://eprints.kfupm.edu.sa/id/eprint/533

Available Versions of this Item