Analysis of the M/G/1 queue with discriminatory random order service policy
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jeongsim | - |
dc.contributor.author | Kim, Jerim | - |
dc.contributor.author | Kim, Bara | - |
dc.date.accessioned | 2021-09-07T14:26:37Z | - |
dc.date.available | 2021-09-07T14:26:37Z | - |
dc.date.created | 2021-06-14 | - |
dc.date.issued | 2011-03 | - |
dc.identifier.issn | 0166-5316 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/112900 | - |
dc.description.abstract | We consider an M/G/1 queue with different classes of customers and discriminatory random order service (DROS) discipline. The DROS discipline generalizes the random order service (ROS) discipline: when the server selects a customer to serve, all customers waiting in the system have the same selection probability under ROS discipline, whereas customers belonging to different classes may have different selection probabilities under DROS discipline. For the M/G/1 queue with DROS discipline, we derive equations for the joint queue length distributions and for the waiting time distributions of each class. We also obtain the moments of the queue lengths and the waiting time of each class. Numerical results are given to illustrate our results. (c) 2010 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | RELATIVE PRIORITIES | - |
dc.subject | LENGTH DISTRIBUTION | - |
dc.subject | TIMES | - |
dc.title | Analysis of the M/G/1 queue with discriminatory random order service policy | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Bara | - |
dc.identifier.doi | 10.1016/j.peva.2010.12.001 | - |
dc.identifier.scopusid | 2-s2.0-78751645338 | - |
dc.identifier.wosid | 000287466500003 | - |
dc.identifier.bibliographicCitation | PERFORMANCE EVALUATION, v.68, no.3, pp.256 - 270 | - |
dc.relation.isPartOf | PERFORMANCE EVALUATION | - |
dc.citation.title | PERFORMANCE EVALUATION | - |
dc.citation.volume | 68 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 256 | - |
dc.citation.endPage | 270 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | RELATIVE PRIORITIES | - |
dc.subject.keywordPlus | LENGTH DISTRIBUTION | - |
dc.subject.keywordPlus | TIMES | - |
dc.subject.keywordAuthor | M/G/1 queue | - |
dc.subject.keywordAuthor | Discriminatory random order service policy | - |
dc.subject.keywordAuthor | Queue length distribution | - |
dc.subject.keywordAuthor | Waiting time distribution | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.