We study a new scheme for provision of priorities within the framework of a MAC protocol which is a potential candidate of the (as yet unpublished) IEEE 802.14 standard. A comprehensive simulation study, based on real traffic traces, shows that this new method provides better protection for the high priority traffic than an earlier proposed scheme. Except for physical and MAC layer overheads, t...

This study aims to determine the transient behavior of blended queue. Priority customers arrive over time and benefit from a threshold reservation policy, while non-priority ones can be contacted at any time. We show how compute Laplace transforms probabilities. Using uniformization technique, we prove some monotonicty properties expected number in queue, explaining why optimal should lower tha...

The distance join is a spatial join that finds pairs of closest objects in the order of distance by associating two spatial data sets. The distance join stores node pairs in a priority queue, from which node pairs are retrieved while traversing R-trees in top-down manners in the order of distance. This paper first shows that a priority strategy for the tied pairs in the priority queue during di...

The priority queue discussed in this talk is an abstract data type supporting theoperations INSERT and DELETEMIN, which transforms an input permutation σ oflength n to an output permutation τ . Atkinson and Thiyagarajah [2] proved that suchpairs (σ, τ) are counted by (n + 1)n−1. This is also well known as Cayley’s formulain graph theory, which counts the number of labeled trees ...

In this paper we introduce a new deadline driven disk scheduling algorithm designed for multimedia servers. The proposed algorithm supports real time requests with multiple priorities, e.g., those for di erent object classes in digital library applications. The proposed algorithm enhances utilization of disk bandwidth by (a) maintaining one queue for all requests, and (b) optimizing the seek ti...

A priority queue (pq) is said to be monotone if the value of the smallest element stored in the priority queue is a non-decreasing function of time. We consider the problem of maintaining a monotone priority queue on a set of integers in the range 0 : :2 w ? 1 on a unit-cost RAM with word size w bits. We give a monotone pq that, starting with an empty collection of items, processes a sequence o...

We analyze queueing model with priority scheduling by supplementary variable method. Customers are classified into two types ( type-1 and type-2 ) according to their characteristics. Customers of each type arrive by independent Poisson processes, and all customers regardless of type have same general service time. The service order of each type is determined by the queue length of type-1 buffer...

We study a first passage time problem for a class of spectrally positive Lévy processes. By considering the special case where the Lévy process is a compound Poisson process with negative drift, we obtain the Laplace-Stieltjes transform of the steady-state waiting time distribution of low-priority customers in a twoclass M/GI/1 queue operating under a dynamic non-preemptive priority discipline....

In this paper we demonstrate how tree-like processes can be used to analyze a general class of priority queues with three service classes, creating a new methodology to study priority queues. The key result is that the operation of a 3-class priority queue can be mimicked by means of an alternate system that is composed of a single stack and queue. The evolution of this alternate system is redu...

This paper introduces the Stellar Simplification scheme, a fast implementation of the Four–Face Cluster algorithm. In this scheme, a probabilistic optimization heuristic substitutes the priority queue of the original algorithm, which results in a 40% faster algorithm with the same order of distortion. This implementation uses a very concise data structure which consists only of two arrays of in...