Delay analysis of an asymmetric, buffered random access system

Abstract

A random multiple access system with a finite population of buffered, asymmetric users is studied. An upper bound is found to the mean total delay experienced by a user, including the queuing delay. The analysis facilitates an understanding of the interrelationship among delay, burstiness, the degree of asymmetry, and the number of users. The role of asymmetry is also studied and it is shown that the delay in an asymmetric system is smaller than the delay in a symmetric system for the same total arrival rate.<>