In this paper, we consider a discrete-time non-preemptive priority queueing model with priority jumps. Two classes, real-time (high priority) and non-real time (low priority), of traffic will be considered with providing jumps from lower priority traffic to the queue of high priority traffic. We derive expressions for the joint probability generating function of the system contents of the high ...

Ab.rfra(:tWe suggest that satisfactory statistical performance guarantees for streaming flows can be fulfilled when their packets recei~e expedited forwarding in non-preemptive priority queues. This relies on the conjecture that jitter remains negligible in the network such that performance measures can be bounded by assuming flows constitute Poisson arrival processes of MTU sized packets. We p...

This paper introduces the notion of primary image segmentation which serves as a well defined link between lowand high-level image analysis. A general algorithmic framework based on priority queues is proposed that allows for the integration of a variety of different segmentation algorithms. A seeded region growing approach, along with a number of improved seed selection methods and foveation o...

We introduce a new number system that supports increments with a constant number of digit changes. We also give a simple method that extends any number system supporting increments to support decrements using the same number of digit changes. In the new number system the weight of the ith digit is 2−1, and hence we can implement a priority queue as a forest of heap-ordered complete binary trees...

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

A priority queue is presented that supports the operations insert and find-min in worst-case constant time, and delete and deletemin on element x in worst-case O(lg(min{wx, qx} + 2)) time, where wx (respectively qx) is the number of elements inserted after x (respectively before x) and are still present at the time of the deletion of x. Our priority queue then has both the working-set and the q...

We give a generalization of binomial queues involving an arbitrary sequence (mk)k=0;1;2;::: of integers greater than one. Diierent sequences lead to diierent worst case bounds for the priority queue operations, allowing the user to adapt the data structure to the needs of a speciic application. Examples include the rst priority queue to combine a sub-logarithmic worst case bound for Meld with a...

We propose a new approach to analyze multiclass queueing systems in heavy traffic based on what we consider as fundamental laws in queueing systems, namely distributional and conservation laws. Methodologically, we extend the distributional laws from single class queueing systems to multiple classes and combine them with conservation laws to find the heavy traffic behavior of the following syst...

We present priority queues that support the operations MakeQueue, FindMin, Insert and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(logn). They can be implemented on the pointer machine and require linear space. The time bounds are optimal for all implementations where Meld takes worst case time o(n). To our knowledge this is the first priority queue implementation ...