Evaluation of the Waiting Time in a Finite Capacity Queue with Bursty Input and a Generalized Push-Out Strategy

Author:

Blondia Chris

Abstract

In this paper, we study a finite capacity queue where the arrival process is a special case of the discrete time Markov modulated Poisson process, the service times are generally distributed, and the server takes repeated vacations when the system is empty. The buffer acceptance strategy is based on a generalized push-out scheme: when the buffer is full, an arriving customer pushes out the Nth customer in the queue, where N takes values between 2 and the capacity of the system, and the arriving customer joins the end of the queue. Such a strategy is important when, as well as short waiting times for served customers, the time a pushed-out customer occupies a buffer space is also an important performance measure. The Laplace transform of the waiting time of a served customer is determined. Numerical examples show the influence of the bustiness of the input process and also the trade-off between the average waiting time of served customers and the occupancy of the buffer space of pushed-out customers.

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3