Performance analysis of multiple access protocols
Performance analysis of multiple access protocols
An efficient solution to finite buffer non-persistent carrier sense multiple access protocol
Computer Networks and ISDN Systems
Automatic Control Systems: Basic Analysis and Design
Automatic Control Systems: Basic Analysis and Design
A unified approach to analyze multiple access protocols for buffered finite users
Journal of Network and Computer Applications
Performance analysis of buffered R-ALOHA systems using tagged user approach
Journal of Network and Computer Applications
On the applicability of the number of collisions in p-persistent CSMA/CD protocols
Computers and Operations Research
| Hi-index | 0.00 |
This paper presents a new approximation approach, called tagged user approach (TUA), for the queueing analysis of slotted CSMA/CD systems with a finite user population having either finite or infinite user buffer capacity. By assuming a symmetric channel, the performance analysis of the overall system is determined by the performance of an arbitrarily selected user, called the tagged user. With the further assumption that each user always operates with its equilibrium probability, the packet service time distribution can be obtained using a state flow graph by studying the channel contention scheme. The obtained packet service time distribution is then applied to the queueing analysis of the tagged user using the standard queueing theory. That is, the analysis of the channel contention scheme and the analysis of the user queueing behavior are decoupled in this paper. Hence, TUA can be applied to complicated systems such as those where each user buffer may have bulk packet arrivals and random service discipline as long as the corresponding queueing theory is available. Since a state transition probability matrix is not required in TUA, the required amount of computation is quite small. Simulation results verify the high accuracy of the analysis.