首页 | 本学科首页   官方微博 | 高级检索  
     检索      

动态优先级队列的离散时间排队分析
引用本文:孟坤,朱翼隽.动态优先级队列的离散时间排队分析[J].科学技术与工程,2008,8(24).
作者姓名:孟坤  朱翼隽
作者单位:江苏大学理学院,镇江,212013
基金项目:国家自然科学基金  
摘    要:动态优先级队列能够较好地满足多媒体网络业务流的多种QoS需求。采用离散时间的D-MAP/PH/1排队模型来研究动态优先级队列,并应用矩阵分析的方法,对该排队模型的稳态分布进行分析,得到了系统的主要性能指标:两类业务流的平均队长、阻塞概率和平均延时等结果。

关 键 词:动态优先级队列  离散时间排队  矩阵几何解

Performance Evaluation of Dynamic Priority Queue Based on Discrete Time Queue
MENG Kun,ZHU Yi-juan.Performance Evaluation of Dynamic Priority Queue Based on Discrete Time Queue[J].Science Technology and Engineering,2008,8(24).
Authors:MENG Kun  ZHU Yi-juan
Institution:MENG Kun,ZHU Yi-juan(Faculty of Science,Jiangsu University,Zhenjiang 212013,P.R.China)
Abstract:Dynamic priority queue can meet the various QoS requirements of the traffic in multimedia networks.Discrete time queue model was applied in the study of dynamic priority queue in multimedia networks.The steady-state distribution of the queue was analysed by using method of matrix analysis,and the main performance measure were obtained such as average queue length,blocking probability and average delay time of the two traffic.
Keywords:D-MAP/PH/1
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号