首页> 外文期刊>Systems Engineering and Electronics, Journal of >Computational analysis of (MAP1, MAP2)/(PH1, PH2)/N queues with finite buffer in wireless cellular networks
【24h】

Computational analysis of (MAP1, MAP2)/(PH1, PH2)/N queues with finite buffer in wireless cellular networks

机译:无线蜂窝网络中具有有限缓冲区的(MAP1,MAP2)/(PH1,PH2)/ N队列的计算分析

获取原文
获取原文并翻译 | 示例
           

摘要

This paper studies a queueing model with the finite buffer of capacity K in wireless cellular networks, which has two types of arriving calls-handoff and originating calls, both of which follow the Markov arriving process with different rates. The channel holding times of the two types of calls follow different phase-type distributions. Firstly, the joint distribution of two queue lengths is derived, and then the dropping and blocking probabilities, the mean queue length and the mean waiting time from the joint distribution are gotten. Finally, numerical examples show the impact of different call arrival rates on the performance measures.
机译:本文研究了无线蜂窝网络中容量为K的有限缓冲区的排队模型,该模型具有两种类型的到达呼叫:越区切换和始发呼叫,二者均遵循马尔科夫到达过程,但速率不同。两种呼叫的信道保持时间遵循不同的相位类型分布。首先,得出两个队列长度的联合分布,然后从联合分布中得出丢包概率,阻塞概率,平均队列长度和平均等待时间。最后,数字示例显示了不同呼叫到达率对性能指标的影响。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号