A decomposition approach for stochastic reward net models
Performance Evaluation
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Modeling and performance analysis of QoS-aware load balancing of web-server clusters
Computer Networks: The International Journal of Computer and Telecommunications Networking
On Petri nets with deterministic and exponentially distributed firing times
Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
Fixed point iteration using stochastic reward nets
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
User-level performance of channel-aware scheduling algorithms in wireless data networks
IEEE/ACM Transactions on Networking (TON)
Instability of the proportional fair scheduling algorithm for HDR
IEEE Transactions on Wireless Communications
Queuing with adaptive modulation and coding over wireless links: cross-Layer analysis and design
IEEE Transactions on Wireless Communications
Analysis of multiuser diversity in time-varying channels
IEEE Transactions on Wireless Communications
Centralized Wireless Data Networks With User Arrivals and Departures
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Hi-index | 0.01 |
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.