• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Mathematical Problems in Engineering >A Fast Simulation Model Based on Lindley's Recursion for the G/G/1/K Queue
【24h】

A Fast Simulation Model Based on Lindley's Recursion for the G/G/1/K Queue

机译：基于Lindley的G / G / 1 / K队列递归的快速仿真模型

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

There are many applications where it is necessary to model queuing systems that involve finite queue size. Most of the models consider traffic with Poisson arrivals and exponentially distributed service times. Unfortunately, when the traffic behavior does not consider Poisson arrivals and exponentially distributed service times, closed-form solutions are not always available or have high mathematical complexity. Based on Lindley's recursion, this paper presents a fast simulation model for an accurate estimation of the performance metrics of G/G/1/K queues. One of the main characteristics of this approach is the support for long-range dependence traffic models. The model can be used to model queuing systems in the same way that a discrete event simulator would do it. This model has a speedup of at least two orders of magnitude concerning implementations in conventional discrete event simulators.
机译：有许多应用程序需要模拟涉及有限队列大小的排队系统。大多数模型考虑使用泊松港的流量和指数分布的服务时间。不幸的是，当流量行为不考虑泊松港和指数分布的服务时间时，封闭式解决方案并不总是可用的或具有高的数学复杂性。基于林德利的递归，本文提出了一种快速仿真模型，用于准确估计G / G / 1 / K队列的性能度量。这种方法的主要特征之一是对远程依赖性交通模型的支持。该模型可以用来以与离散事件模拟器这样的方式相同的方式模拟排队系统。该模型的加速至少有两个关于传统离散事件模拟器中的实现的至少两个数量级。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号