Performance Analysis Of Buffered CSMA/CD Systems
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 syst...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | article |
| منشور في: |
2020
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/2528/1/2.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | 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 Bow 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 an 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 iis 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. |
|---|