Mean Approximate Formulas for GI/G/1 Processor-Sharing System

スポンサーリンク

概要

• 論文の詳細を見る

• The processor-sharing (PS) rule arises as a natural paradigm in a variety of practical situations, including time-shared computer systems. Although there has been much work on Poisson-input queueing analysis for the PS rule, there have been few results for renewal-input GI/G/1 (PS) systems. We consider the GI/G/1 (PS) system to provide develop a two-moment approximation for the mean performance measures. We derive the relationship between the mean unfinished work and the conditional mean sojourn time for the GI/G/1 (PS) system. Using this relationship, we derive approximate formulas for the mean conditional sojourn time, mean sojourn time, and the mean number of customers in the GI/G/1 (PS) system. Numerical examples are presented to compare the approximation with exact and simulated results. We show that the proposed approximate formulas have good accuracy.

• （社）電子情報通信学会の論文
• 2011-08-01

著者

• Komatsu Naohisa

  Faculty Of Science And Engineering School Of Fundamental Science And Engineering Waseda University

• Takahashi Yoshitaka

  Faculty Of Commerce Waseda University

• Hoshi Kentaro

  Faculty Of Fundamental Science And Engineering Waseda University

• SHIKATA Yoshiaki

  Faculty of Informatics for Arts, Shobi University

• Shikata Yoshiaki

  Faculty Of Informatics For Arts Shobi University

• KOMATSU Naohisa

  Faculty of Science and Engineering, Waseda University

関連論文

• Mean delay approximation for the mean waiting time in the GI/GI/1 queueing system (コミュニケーションクオリティ)
• A Note on the Random Oracle Methodology
• Public-Key Encryptions with Invariant Security Reductions in the Multi-User Setting
• Secure Public-Key Encryption from Random Oracle Transformation
• Mean Approximate Formulas for GI/G/1 Processor-Sharing System

スポンサーリンク