首页> 外文会议>International Scientific-Practical Conference Problems of Infocommunications Science and Technology >Conditional Average Value of Queues in Queuing Systems with Bath Request Flows
【24h】

Conditional Average Value of Queues in Queuing Systems with Bath Request Flows

机译:浴室请求流排队系统的队列条件平均值

获取原文

摘要

The article describes queuing systems (QS) with batch request flows, typical for modern multiservice telecommunication networks. It contains generalization of Pollaczek-Khinchin formula for systems with common type flows. We have examined the dependencies of mean queue size at low duty ratio. We have introduced the concept of conditional mean queue size, which is a mean provided that an intervals of processor downtime are absent. We propose algorithm of approximation dependencies queues size in queuing systems with batch requests flows. We consider time delay in queues. We set the ultimate load levels which provide the established queue sizes and time delays.
机译:本文介绍了具有批处理流程的排队系统(QS),典型的现代多业务电信网络。它含有Pollaczek-khinchin公式的概括,用于具有通用类型流的系统。我们已经检查了低占空比的平均队列大小的依赖关系。我们引入了条件平均队列大小的概念,这是一个均值,条件是不存在处理器停机的间隔。我们提出了近似依赖性队列队列大小的批量,其中批量请求流程。我们考虑队列的时间延迟。我们设置了终极负载级别,提供了已建立的队列大小和时间延迟。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号