This paper identifies various parametrized dynamic priority queue disciplines from literature which are complete in two class M/G/1 queue. Equivalence between these queue disciplines is established by obtaining non linear transformation in closed form. Motivation behind these completeness and equivalence results is discussed from optimal control perspective. Some comments on global FCFS policy ...

This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure is used to construct an efficient packet approximation of General Processor Sharing (GPS). This scheduler is the first of its kind by combining all desirable properties without any residual catch. In contrast to previ...

In this paper, we analyze a discrete-time preemptive repeat priority queue with resampling. High-priority packets have preemptive repeat priority, and interrupted low-priority packets are subjected to independent retransmission attempts. Both classes contain packets with generally distributed transmission times. We show that the use of generating functions is beneficial for analyzing the system...

In discrete event simulation, very often the future event set is represented by a priority queue. The data structure used to implement the queue and the way operations are performed on it are often crucial to the execution time of a simulation. In this paper a new priority queue implementation strategy, the Lazy Queue, is presented. It is tailored to handle operations on the pending event set e...

Based on the groundbreaking result of Gittins on the multiarmed bandit problem we provide a characterization of the optimal nonanticipating scheduling policy in a multi-class single-server queue. We apply Gittins’ framework to characterize the optimal policy when the service time distribution of the various classes belong to the set of Decreasing Hazard Rate (DHR) distributions, like Pareto or ...

For wireless networks operating during emergency conditions, emergency, handoff, and new calls are the main kinds of demand. Different operators will have different policies about which should have higher priority, and how to implement that kind of priority. This paper focuses on applying queuing methods for admission control for the above three types of calls. A Weighted Earliest Deadline sche...

Priority scheduling for packets is a hot topic, as interactive (voice,video) services are being integrated in existing data networks. In this paper, we consider a discrete-time queueing system with nonpreemptive (or Head-Of-the-Line) priority scheduling and a general number of priority classes. Packets of variable length arrive in the queueing system. We derive expressions for the probability g...

Priority scheduling for packets is a hot topic, as interactive (voice,video) services are being integrated in existing data networks. In this paper, we consider a discrete-time queueing system with a non-preemptive (or Head-Of-the-Line) priority scheduling discipline and a general number of priority classes. Packets of variable length arrive in the queueing system. We derive expressions for the...

In this paper, we consider a discrete-time queueing system with head-of-line (HOL) priority. First, we will give some general results on a GI-1-1 queue with priority scheduling. In particular, we will derive expressions for the Probability Generating Function of the system contents and the cell delay. Some performance measures (such as mean, variance and approximate tail distributions) of these...

TIT&S, Bhiwani TIT&S, Bhiwani TIT&S, Bhiwani TIT&S, Bhiwani Summary Since the advent of Operating system, the focus of the work is aimed at better resource scheduling. Handling of multiple tasks at a single time by single processor is old story now. Today is the time of multitasking as well as multiprocessing. The scheduling of processes or tasks have taken a whirlwind after the concept of mult...