PSEUDO-CONSERVATION LAW FOR DISCRETE-TIME MULTI-QUEUE SYSTEMS WITH PRIORITY DISCIPLINES

スポンサーリンク

概要

• 論文の詳細を見る

• We consider a discrete-time cyclic-service system consisting of multiple stations visited by a single server. Customers from several priority classes arrive at an individual station according to independent batch Bernoulli processes. We assume a non-preemptive priority rule and non-zero switch-over times of the server between consecutive stations. We derive an exact expression for a weighted sum of the mean waiting times for the individual priority classes: a pseudo-conservation law. Taking the limit of our result as the length tends to zero yields previously obtained continuous-time results.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Takahashi Yoshitaka

  Performance Evaluation Research Group Network Traffic Laboratory

• Kumar B.krishna

  Department Of Mathematics College Of Engineering Anna University

関連論文

• RELATIONSHIP BETWEEN QUEUE-LENGTH AND WAITING TIME DISRIBUTIONS IN A PRIORITY QUEUE WITH BATCH ARRIVALS
• PSEUDO-CONSERVATION LAW FOR DISCRETE-TIME MULTI-QUEUE SYSTEMS WITH PRIORITY DISCIPLINES
• ON A SET OF INTERDEPARTURE TIME DISTRIBUTIONS OF THE M/G/1 QUEUE WITH SERVER VACATIONS

スポンサーリンク