Performance Analysis of Markov Modulated 1-Persistent CSMA/CA Protocols with Exponential Backoff Scheduling
| Autor: | Dongjie Yin, Tony T. Lee, Pui King Wong |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2010 |
| Předmět: |
FOS: Computer and information sciences
Exponential backoff Computer Networks and Communications Computer science Retransmission Markov process Throughput Distributed coordination function Topology Scheduling (computing) Computer Science - Networking and Internet Architecture symbols.namesake Computer Science::Networking and Internet Architecture Electrical and Electronic Engineering Queue Networking and Internet Architecture (cs.NI) Queueing theory Computer Science - Performance Markov chain business.industry Network packet ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Performance (cs.PF) Computer Science::Performance symbols business Carrier sense multiple access with collision avoidance Information Systems Computer network |
| Popis: | This paper proposes a Markovian model of 1-persistent CSMA/CA protocols with K-Exponential Backoff scheduling algorithms. The input buffer of each access node is modeled as a Geo/G/1 queue, and the service time distribution of each individual head-of-line packet is derived from the Markov chain of the underlying scheduling algorithm. From the queuing model, we derive the characteristic equation of network throughput and obtain the stable throughput and bounded delay regions with respect to the retransmission factor. Our results show that the stable throughput region of the exponential backoff scheme exists even for an infinite population. Moreover, we find that the bounded delay region of exponential backoff is only a sub-set of its stable throughput region due to the large variance of the service time of input packets caused by the capture effect. All analytical results presented in this paper are verified by simulations. 24 pages including 11 figures |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|