首页> 外文会议>The 5th International Conference on Queueing Theory and Network Applications. >A Dual Tandem Queueing System with a Finite Intermediate Buffer and Cross Traffic
【24h】

A Dual Tandem Queueing System with a Finite Intermediate Buffer and Cross Traffic

机译:具有有限中间缓冲区和交叉流量的双串联排队系统

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

摘要

We analyze a dual tandem queue having a single server queueing system with infinite buffer at the first station and a multi-server queueing system with a finite buffer at the second station. Arrival flow is described by the Batch Marko vian Arrival Process (BMAP). Service time at the first station is generally distributed while at the second station it is exponentially distributed. In situation when the intermediate buffer between the stations is full at the service completion of a customer at the first station,this customer is lost or blocks the server until service completion in one of the servers at the second station. Besides the customers,which got service at the first station,an additional MAP flow (cross traffic) arrives to the second station directly,not entering the first station. Ergodicity condition for this system is derived. Stationary state distribution of the system at embedded and arbitrary time epochs is computed as well as the main performance measures of the system. Numerical results show possibility of optimization of the system operation by means of appropriate choosing the capacity of an intermediate buffer and the intensity of cross traffic. Necessity of the account of correlation in the arrival processes is illustrated.
机译:我们分析了双串联队列,该双串联队列在第一个站点具有一个具有无限缓冲区的单服务器排队系统,在第二个站点具有一个有限缓冲区的多服务器排队系统。到达流程由批处理市场到达流程(BMAP)描述。通常在第一站分配服务时间,而在第二站按指数分配时间。在第一个站点的客户完成服务时,站点之间的中间缓冲区已满时,此客户将丢失或阻塞服务器,直到第二个站点中的一个服务器中的服务完成为止。除了在第一个站点获得服务的客户外,其他MAP流(交叉流量)也直接到达第二个站点,而不进入第一个站点。得出该系统的遍历条件。计算了嵌入式和任意时间周期内系统的静态状态分布,以及系统的主要性能指标。数值结果表明,通过适当选择中间缓冲区的容量和交叉通信的强度,可以优化系统操作。说明了到达过程中相关性考虑的必要性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号