Modelling priority queuing systems with varying service capacity  

作　　者：Mei CHEN Xiaolong JIN Yuanzhuo WANG Xueqi CHENG Geyong MIN 

机构地区：[1]School of Electronic and Information Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China [2]School of Information Science and Engineering, Lanzhou University, Lanzhou 730000, China [3]Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China [4]Department of Computing, School of Informatics, University of Bradford, Bradford BD71DP, UK

出　　处：《Frontiers of Computer Science》2013年第4期571-582,共12页中国计算机科学前沿（英文版）

摘　　要：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 systems may 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.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 systems may 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.

关 键 词：priority queuing analytical modelling variableservice capacity self-similar traffic 

分 类 号：TN92[电子电信—通信与信息系统] TP393.2[电子电信—信息与通信工程]