On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue
Journal Title: EAI Endorsed Transactions on Internet of Things - Year 2015, Vol 1, Issue 3
Abstract
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.
Authors and Affiliations
Manu Gupta, Nandyala Hemachandra, Jayendran Venkateswaran
Keywords
Related Articles
- EP ID EP46462
- DOI http://dx.doi.org/10.4108/icst.valuetools.2014.258212
- Views 410
- Downloads 0
Crowdsensing Solutions in Smart Cities towards a Networked Society
The goal of the paper is to give an overview of the most relevant aspects of mobile crowdsensing that are already utilized by the society. The paper focuses on best practices applied in smart cities today, how these appl...
Managing HeterogeneousWSNs in Smart Cities: Challenges and Requirements
The dramatic advances in wireless communications and electronics have enabled the development of Wireless Sensor Networks (WSNs). WSNs consist of many a ordable and portable sensor nodes for collecting data from the envi...
End-to-End Delay Bounds for Variable Length Packet Transmissions under Flow Transformations
A fundamental contribution of network calculus is the convolution-form representation of networks which enables tight end-to-end delay bounds. Recently, this has been extended to the case where the data flow is subject t...
Parkinson’s disease as a Working Model for Global Healthcare Restructuration: The Internet of Things and Wearables Technologies
With the rapid growth and increased life expectancy of the world’s population, the prevalence of chronic disorders such as Parkinson’s disease (PD) is also increasing. This challenges the current healthcare system in ter...
Drone Package Delivery: A Heuristic approach for UAVs path planning and tracking
In this paper we propose a new approach based on a heuristic search for UAVs path planning with terrestrial wireless network tracking. In a previous work we proposed and exact solution based on an integer linear formulat...