抄録
Carrier Sense Multiple Access with Collision Detection (CSMA/CD) protocol is one of remarkable access protocol on Local Area Network (LAN). The recent interest in the application of LAN is the communication for the demand of immediacy and continuity. Furthermore, each terminal connected to LAN has multi-tasks by multi-users. So the system that each terminal has some buffer is efficient. Up to the present, a number of studies on the analysis for buffered CSMA/CD has already appeared. But these are restricted or complicated or unpractical analysis. In this paper, using embedded Markov chain, we analyze non-persistent CSMA/CD protocol that each terminal possesses finite buffer. We present a practical analysis by describing all status of backlogged packest in buffers. Especially this paper focuses on the throughput-delay tradeoff and rejection probability. This analytical results are very close to the simulation results, for example, on the condition that bus type LAN consists of ten terminals, each possessing 1, 2, and 3 buffers.
