The M/G/1 queueing model with preemptive random priorities

Journal Title: EAI Endorsed Transactions on Internet of Things - Year 2015, Vol 1, Issue 3

Abstract

For the M/G/1 model, we look into a preemptive priority scheme in which the priority level is decided by a lottery. Such a scheme has no effect on the mean waiting time in the non-preemptive case (in comparison with the First Come First Served (FCFS) regime, for example). This is not the case when priority comes with preemption. We derived the resulting mean waiting time (which is invariant with respect to the lottery performed) and show that it lies between the corresponding means under the FCFS and the Last Come First Served with Preemption Resume (LCFS-PR) (or equivalently, the Egalitarian Processor Sharing (EPS)) schemes. We also derive an expression for the Laplace-Stieltjes transform for the time in the system in this model. Finally, we show how this priority scheme may lead to an improvement in the utilization of the server when customer decide whether or not to join.

Authors and Affiliations

Moshe Haviv

Keywords

Related Articles

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...

A heuristic procedure for compact Markov representation of PH distributions

The minimal Markovian representation of PH distributions is an open research problem, which was actively investigated during the last two decades. We present a numerical method for finding small Markovian representation...

IoT-F2CDM-LB: IoT Based Fog-to-Cloud and Data-in-Motion Architectures with Load Balancing

The work in this paper tries to enhance the performance of IoT by modifying the Cloud based architecture in terms of storage, processing, and Load Balancing (LB). The assumption is as follows: In a single Fog server, hig...

Authorization-based Approach for Customized Automated Resource Provisioning Services

Combining the concept of software control with existing legacy network technology promotes new networking services with low capital expenditure. Currently, many testbeds and academic operators provide bandwidth on demand...

An Information-Centric Platform for Social- and Location-Aware IoT Applications in Smart Cities

Recent advances in Smart City infrastructures and the Internet of Things represent a significant opportunity to improve people’s quality of life. Corresponding research often focuses on Cloud-centric network architecture...

Download PDF file
  • EP ID EP46461
  • DOI http://dx.doi.org/10.4108/icst.valuetools.2014.258240
  • Views 524
  • Downloads 0

How To Cite

Moshe Haviv (2015). The M/G/1 queueing model with preemptive random priorities. EAI Endorsed Transactions on Internet of Things, 1(3), -. https://europub.co.uk/articles/-A-46461