Name
Title | ||
|---|---|---|
Performance analysis of wireless opportunistic schedulers using stochastic Petri nets |
Abstract | ||
|---|---|---|
In this paper, performance of wireless opportunistic schedulers in multiuser systems is studied under a dynamic data arrival setting. Different from the previous studies which mostly focus on the network stability and the worst case scenarios, we emphasize on the average performance of wireless opportunistic schedulers. We first develop a framework based on Markov queueing model and then analyze it by applying decomposition and iteration techniques in the stochastic Petri nets (SPN). Since the size of the state space in our analytical model is small, the proposed framework shows an improved efficiency in computational complexity. Based on the established analytical model, performance of both opportunistic and nonopportunistic schedulers are studied and compared in terms of average queue length, mean throughput, average delay and dropping probability. Analytical results demonstrate that the multiuser diversity effect as observed in the infinite backlog scenario is only valid in the heavy traffic regime. The performance of the opportunistic schedulers in the light traffic regime is worse than that of the non-opportunistic round-robin scheduler, and becomes worse especially with the increase of the number of users. Simulations are also performed to verify the accuracy of the analytical results. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/TWC.2009.080523 | IEEE Transactions on Wireless Communications |
Keywords | Field | DocType |
performance analysis,analytical model,opportunistic schedulers,established analytical model,wireless opportunistic schedulers,average queue length,nonopportunistic schedulers,average performance,average delay,markov queueing model,analytical result,stochastic petri net,stability,servers,stochastic processes,wireless communication,stochastic petri nets,petri nets,steady state,markov processes,computational complexity,dynamic data,dynamic scheduling,state space,algorithm design and analysis,queueing theory | Markov process,Petri net,Markov model,Scheduling (computing),Computer science,Markov chain,Computer network,Real-time computing,Stochastic Petri net,Queueing theory,Throughput,Distributed computing | Journal |
Volume | Issue | ISSN |
8 | 4 | 1536-1276 |
Citations | PageRank | References |
21 | 1.09 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lei Lei | 1 | 860 | 45.31 |
| Chuang Lin | 2 | 3040 | 390.74 |
| Jun Cai | 3 | 373 | 39.29 |
| Xuemin Shen | 4 | 15389 | 928.67 |