Scholarlink

<p>We study two-station closed queueing network models where jobs cyclically visit a non-preemptive last-come first-serve (LCFS-NP) station and a last-come first-serve preemptive-resume (LCFS-PR) station. Jobs belong to multiple classes and receive at both stations exponential service times with arbitrary means. Even though multiclass LCFS-NP stations are not quasi-reversible, we show that the considered models still admit a product-form solution. A feature of the new product-form expression is to include factors that relate the mean service times at the LCFS-NP queue with the positions occupied by the jobs at both stations. To account for job positions, we propose a strategy to compute the normalizing constant of the state probabilities using permanents which, for a fixed number of classes, solves the model exactly in polynomial time as the total number of jobs grows. A mean-value analysis algorithm is also derived, using a recursion on networks where the job holding the last position at the LCFS-PR queue is removed from the model.</p>

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

A family of multiclass LCFS networks with a novel product-form solution

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年5月24日

查看全文
  • Giuliano Casale

摘要

We study two-station closed queueing network models where jobs cyclically visit a non-preemptive last-come first-serve (LCFS-NP) station and a last-come first-serve preemptive-resume (LCFS-PR) station. Jobs belong to multiple classes and receive at both stations exponential service times with arbitrary means. Even though multiclass LCFS-NP stations are not quasi-reversible, we show that the considered models still admit a product-form solution. A feature of the new product-form expression is to include factors that relate the mean service times at the LCFS-NP queue with the positions occupied by the jobs at both stations. To account for job positions, we propose a strategy to compute the normalizing constant of the state probabilities using permanents which, for a fixed number of classes, solves the model exactly in polynomial time as the total number of jobs grows. A mean-value analysis algorithm is also derived, using a recursion on networks where the job holding the last position at the LCFS-PR queue is removed from the model.