A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS
スポンサーリンク
概要
- 論文の詳細を見る
This paper considers a, nonpreemptive priority queue with two classes of customers. Customers in each priority class arrive to the system according to a Markovian arrival process (MAP). Since the MAP is weakly dense in the class of stationary point processes, it is a fairly general arrival process. The service times of customers in each priority class are independent and identically distributed according to a general distribution function which may differ among two priority classes. Using both the generating function technique and the matrix analytic method, we derive various formulas for the queue length and waiting time distributions. We also discuss the algorithmic implementation of the analytical results along with numerical examples.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Takine Tetsuya
Department Of Information Systems Engineering Faculty Of Engineering Osaka University
-
Takine Tetsuya
Department Of Applied Mathematics And Physics Faculty Of Engineering Kyoto University
関連論文
- Evolutionary Game Theoretic Approach to Self-Organized Data Aggregation in Delay Tolerant Networks
- Dynamic Contention Window Control Scheme in IEEE 802.11e EDCA-Based Wireless LANs
- Enhanced Fallback+ : An Efficient Multiconstraint Path Selection Algorithm for QoS Routing(Internet)
- Network Map Architecture Using Inter-Agent Communication Techniques for Multiple QoS Routing
- Inferring Traffic Flow Characteristics from Aggregated-flow Measurement(Special Issue on Selected Papers from SAINT 2002(The 2002 Symposium on Applications and the Internet))
- Identifying Heavy-Hitter Flows from Sampled Flow Statistics(Next Generation Network Management)
- MAP/G/1 QUEUES UNDER N-POLICY WITH AND WITHOUT VACATIONS
- ANALYSIS OF A DISCRETE-TIME QUEUE WITH GEOMETRICALLY DISTRIBUTED GATE OPENING INTERVALS
- ON THE M/G/1 QUEUE WITH MULTIPLE VACATIONS AND GATED SERVICE DISCIPLINE
- A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS
- Nonlinear Integer Programming Formulation for Quasi-Optimal Grouping of Clusters in Ferry-Assisted DTNs