On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue
This paper identifies two different parametrized dynamic priority queue disciplines, earliest due date (EDD) based and head of line priority jump (HOL-PJ), which are found to be mean waiting time complete in two class M/G/1 queue. An explicit one-to-one non linear transformation is obtained between...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
European Alliance for Innovation (EAI)
2015-11-01
|
| Series: | EAI Endorsed Transactions on Internet of Things |
| Subjects: | |
| Online Access: | https://eudl.eu/pdf/10.4108/icst.valuetools.2014.258212 |
| _version_ | 1798044647002472448 |
|---|---|
| author | Manu Gupta Nandyala Hemachandra Jayendran Venkateswaran |
| author_facet | Manu Gupta Nandyala Hemachandra Jayendran Venkateswaran |
| author_sort | Manu Gupta |
| collection | DOAJ |
| description | This paper identifies two different parametrized dynamic priority queue disciplines, earliest due date (EDD) based and head of line priority jump (HOL-PJ), which are found to be mean waiting time complete in two class M/G/1 queue. An explicit one-to-one non linear transformation is obtained between earliest due date and delay dependent priority policy. Mean waiting time equivalence between these queue disciplines is established. Motivation behind the mean completeness and equivalence results is discussed from optimal control perspective. Notion of minmax fairness is introduced and it is argued that a simple global FCFS policy is the only solution for minmax fairness problem in two class by exploiting completeness in the structure of EDD based dynamic priority. Further, these completeness results are used to propose a simpler way for developing optimal control policy in celebrated c/ρ rule for two class M/G/1 queues. |
| first_indexed | 2024-04-11T23:07:38Z |
| format | Article |
| id | doaj.art-8b452f93d9a3469396018b5d152f6ed5 |
| institution | Directory Open Access Journal |
| issn | 2414-1399 |
| language | English |
| last_indexed | 2024-04-11T23:07:38Z |
| publishDate | 2015-11-01 |
| publisher | European Alliance for Innovation (EAI) |
| record_format | Article |
| series | EAI Endorsed Transactions on Internet of Things |
| spelling | doaj.art-8b452f93d9a3469396018b5d152f6ed52022-12-22T03:57:57ZengEuropean Alliance for Innovation (EAI)EAI Endorsed Transactions on Internet of Things2414-13992015-11-011310.4108/icst.valuetools.2014.258212On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queueManu Gupta0Nandyala Hemachandra1Jayendran Venkateswaran2IIT BombayIIT BombayIIT BombayThis paper identifies two different parametrized dynamic priority queue disciplines, earliest due date (EDD) based and head of line priority jump (HOL-PJ), which are found to be mean waiting time complete in two class M/G/1 queue. An explicit one-to-one non linear transformation is obtained between earliest due date and delay dependent priority policy. Mean waiting time equivalence between these queue disciplines is established. Motivation behind the mean completeness and equivalence results is discussed from optimal control perspective. Notion of minmax fairness is introduced and it is argued that a simple global FCFS policy is the only solution for minmax fairness problem in two class by exploiting completeness in the structure of EDD based dynamic priority. Further, these completeness results are used to propose a simpler way for developing optimal control policy in celebrated c/ρ rule for two class M/G/1 queues.https://eudl.eu/pdf/10.4108/icst.valuetools.2014.258212parametrized dynamic priority optimal control multi-class queue achievable region |
| spellingShingle | Manu Gupta Nandyala Hemachandra Jayendran Venkateswaran On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue EAI Endorsed Transactions on Internet of Things parametrized dynamic priority optimal control multi-class queue achievable region |
| title | On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue |
| title_full | On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue |
| title_fullStr | On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue |
| title_full_unstemmed | On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue |
| title_short | On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue |
| title_sort | on mean waiting time completeness and equivalence of edd and hol pj dynamic priority in 2 class m g 1 queue |
| topic | parametrized dynamic priority optimal control multi-class queue achievable region |
| url | https://eudl.eu/pdf/10.4108/icst.valuetools.2014.258212 |
| work_keys_str_mv | AT manugupta onmeanwaitingtimecompletenessandequivalenceofeddandholpjdynamicpriorityin2classmg1queue AT nandyalahemachandra onmeanwaitingtimecompletenessandequivalenceofeddandholpjdynamicpriorityin2classmg1queue AT jayendranvenkateswaran onmeanwaitingtimecompletenessandequivalenceofeddandholpjdynamicpriorityin2classmg1queue |