首页> 外文期刊>Quality Control, Transactions >Queues With the Dropping Function and Non-Poisson Arrivals
【24h】

Queues With the Dropping Function and Non-Poisson Arrivals

机译:随着滴滴功能和非泊松抵达的队列

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

摘要

We deal with the single-server queueing system, in which an arriving job (packet, customer) is not allowed to the queue with the probability depending on the queue size. Such a rejected job is lost and never returns to the queue. The study is motivated, but not limited to, active queue management in Internet routers. The exponential service times and general interarrival times are assumed, what makes the model to be a generalization of classic G/M/1 and G/M/1/N queueing models. Firstly, a replacement for the rho < 1 stability condition, which is too excessive in the considered system, is proven. Then, several popular performance characteristics are derived, including the distribution of the queue size, waiting time, workload and the time to reach a given level, as well as the loss ratio. Finally, numerical examples are presented, demonstrating the impact of the standard deviation of the interarrival time on the system performance, as well as the performance of the system for different parameterizations of the dropping function.
机译:我们处理单服务器排队系统,其中不允许到达作业(数据包,客户),根据队列大小,概率不允许队列。这样拒绝的作业丢失,永远不会返回队列。该研究具有动力,但不限于互联网路由器中的活动队列管理。假设指数服务时间和一般的参数时间,是什么使模型成为经典G / M / 1和G / M / 1 / n排队模型的概念。首先,证明了在考虑系统中过多过量的RHO <1稳定条件的替代品。然后,导出了几种流行的性能特征,包括队列大小的分布,等待时间,工作量以及达到给定级别的时间,以及损耗比。最后,提出了数值示例,展示了对运动时间对系统性能的标准偏差的影响,以及用于丢弃功能的不同参数化的系统的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号