Modelling priority queuing systems with varying service capacity
- 157 Downloads
Many studies have been conducted to investigate the performance of priority queuing (PQ) systems with constant service capacity. However, due to the time-varying nature of wireless channels in wireless communication networks, the service capacity of queuing systemsmay vary over time. Therefore, it is necessary to investigate the performance of PQ systems in the presence of varying service capacity. In addition, self-similar traffic has been discovered to be a ubiquitous phenomenon in various communication networks, which poses great challenges to performance modelling of scheduling systems due to its fractal-like nature. Therefore, this paper develops a flow-decomposition based approach to performance modelling of PQ systems subject to self-similar traffic and varying service capacity. It specifically proposes an analytical model to investigate queue length distributions of individual traffic flows. The validity and accuracy of the model is demonstrated via extensive simulation experiments.
Keywordspriority queuing analytical modelling variable service capacity self-similar traffic
Unable to display preview. Download preview PDF.
- 2.Li C P, Neely M J. Delay and rate-optimal control in a multi-class priority queue with adjustable service rates. In: Proceedings of the 31st Annual IEEE International Conference on Computer Communications (INFOCOM’12). 2012, 2976–2980Google Scholar
- 3.Mandjes M, Mannersalo P, Norros I. Priority queues with Gaussian input: a path-space approach to loss and delay asymptotics. In: Proceedings of the 19th International Teletraffic Congress (ITC-19). 2005, 1135–1144Google Scholar
- 9.Ge X, Yang Y, Wang C X, Liu Y Z, Liu C, Xiang L. Characteristics analysis and modeling of frame traffic in 802.11 wireless networks. Wireless Communications and Mobile Computing, 2009Google Scholar
- 12.Oliveira C, Kim J B, Suda T. Long-range dependence in IEEE 802. 11b wireless LAN traffic: an empirical study. In: Proceedings of the 2003 IEEE 18th Annual Workshop on Computer Communications (CCW’03). 2003, 17–23Google Scholar
- 28.Millan G, Kaschel H, Lefranc G. A simple model for the generation of LRD self-similar traffic using piecewise affine chaotic onedimensional maps. Studies in Informatics and Control, 2010, 19(1): 67–78Google Scholar
- 37.Norros I, Mannersalo P, Wang J L. Simulation of fractional Brownian motion with conditionalized random midpoint displacement. Advances in Performance Analysis, 1999, 2: 77–101Google Scholar