Low run-time overhead, self-adapting storage policies for priority queues called Smart Priority Queue (SPQ) techniques are developed and evaluated. The proposed SPQ policies employ a lowcomplexity linear queue for near-head activities and a rapid-indexing variable bin-width calendar queue for distant events. The SPQ configuration is determined by monitoring queue access behavior using cost-scor...

This paper presents formulas for calculating waiting time for customers in a queue with combined preemptive and head-ofline (nonpreemptive) priority scheduling disciplines and describes the reasoning behind them. This work has been applied in the development of programmable terminal control units. Introduction The development of programmable terminal control units has created the need for a new...

This p p e r considers a nunpreemptive priority queue with two classes of customers. Customers in each priority class arrive to the system according to a Markovian arrival process (MAP). Since the MAP is weakly dense in the class of stationary point processes, it is a fairly general arrival process. The service times of custcomers in ea,ch priority class are independent and identically distribu...

The IEEE 802.11e EDCF mechanism cannot guarantee the QOS of highpriority traffic as the bandwidth consumption of the low-priority traffic increases. Also, in the presence of high priority traffic dampen link utilization of low priority traffic. To overcome these problems, we propose the Novel mechanism in our research that extends IEEE 802.11e EDCF by introducing a Super Slot and Virtual Collis...

We present the transient analysis of the system content in a two-class discrete-time M X /D/1 priority queue. In particular, we derive an expression for the generating function of the transient system contents of both classes at the beginning of slots. Performance measures are calculated from this generating function. To illustrate our approach we conclude with some examples. c © 2008 Elsevier ...

In this paper we present a scalable and recursive class of banyan switching architectures called the Shared-Tree Banyan Networks (STBN). For ATM networks STBN can be engineered between two extremes: (1) a low-cost banyan with internal and external conflicts, or (2) a high-cost conflict-free fully-connected network with multiple outlets. STBN scalability is based on: (1) scalable concentrator ba...

To reconstruct an object surface from a set of surface points, a fast, practical, and efficient priority driven algorithm is presented. The key idea of the method is to consider the shape changes of an object at the boundary of the mesh growing area and to create a priority queue to the advanced front of the mesh area according to the changes. The mesh growing process is then driven by the prio...

Priority trees are a data structure used for priority queue administration. Under the model that all permutations of the numbers 1, . . . , n are equally likely to construct a priority tree of size n we give a detailed averagecase analysis of insertion cost measures: we study the recursion depth and the number of key comparisons when inserting an element into a random size-n priority tree. For ...

In this note, we consider a two-class priority queueing system with Poisson arrivals, general service time distribution and one server, in which customers that are not currently being served may leave the queue according to exponentially distributed patience times, i.e., a M1, M2/G/1 + M system using a generalised Kendall’s notation. We expand the classic methodology to derive analytical formul...