Scholarlink

<p>In this paper, we analyze the steady-state maximum overlap time distribution in the G/G/1 queue. Our methodology exploits Laplace-Stieltjes transforms with a novel decomposition of the maximum overlap time. Explicit expressions are provided for the special cases of the M/G/1 and G/M/1 queues. We also study the steady-state distribution of the minimum overlap time of a customer with its two adjacent customers. We show a novel relationship between the minimum, maximum and the steady-state waiting time.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Overlap times in the G/G/1 queue via Laplace transforms

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年2月22日

查看全文
  • Onno Boxma,
  • Jamol Pender

摘要

In this paper, we analyze the steady-state maximum overlap time distribution in the G/G/1 queue. Our methodology exploits Laplace-Stieltjes transforms with a novel decomposition of the maximum overlap time. Explicit expressions are provided for the special cases of the M/G/1 and G/M/1 queues. We also study the steady-state distribution of the minimum overlap time of a customer with its two adjacent customers. We show a novel relationship between the minimum, maximum and the steady-state waiting time.