In this paper, we present a transient analysis of the system contents in a two-class priority queue with single-slot service times. In particular, we derive an expression for the generating function of the transient system contents of both classes. Performance measures are calculated from this generating function. Finally, by means of a numerical example we investigate the impact of the traffic...

We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a nonpreemptive M/P H/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate the first two moments of the waiting time per class given that all servers are occupied. These wait...

Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and ExtractMin in logarithmic time. Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research on priority queues has taken the last 50 years.

In this paper, we describe an elementary combinatorial approach for deriving the waiting and response time distributions in a few classical priority queueing models. Bymaking use of lattice paths that are linked in a natural way to the stochastic processes analyzed, the proposed method offers new insights and complements the results previously obtained by inverting the associated Laplace transf...

In this work, we investigate service differentiation under IP for the transport of both real-time and non real-time user traffic in the UMTS Terrestrial Radio Access Network (UTRAN). Therein, stringent delay bounds are to be met for both types of traffic, albeit tighter for the voice traffic. For the sake of simplicity, we suggest, model and analyze the use of priority queuing, as an efficient ...

In this work, we measure Wireless Local Area Network (WLAN) voice performance and capacity. While most WLAN applications today are data centric, the growing popularity of Voice over IP (VoIP) applications and the trend towards convergence with cellular networks will catalyze increased voice traffic. Since voice applications compete not only with each other, but also with data applications for W...

In typical applications, a priority queue is used to execute a sequence of n insert , m decrease, and n delete-min operations, starting with an empty structure. We study the performance of different priority queues for this type of operation sequences both theoretically and experimentally. In particular, we focus on weak heaps, weak queues, and their relaxed variants. We prove that for relaxed ...

The inter-contact time between mobile human-carried devices is one of the key metrics in studying the mobility-assisted routing paradigms for wireless mobile networks. Recent studies on this topic are focused on the aggregated distribution integrating all the device pairs’ inter-contact times. In this work, we study real-world inter-contact times from a new aspect. By dividing the device pairs ...

This article presents an hybrid priority queuing model based scheduler for real-time traffic differentiation. The proposed scheduler is designed as a mechanism to provide queuing delay differentiation among real-time traffic classes. The novel characteristic of the presented scheduler is the capability to simultaneously try to achieve an upper time limit for queuing delays and, under heavy load...

This paper presents the application of the PPQ Dijkstra approach for solving 2D path planning problems. The approach is a Dijkstra process whose priority queue (PQ) is implemented through a Pseudo Priority Queue (PPQ) also known as Untidy PQ. The performance of the optimization process is dramatically improved by the application of the PPQ. This modification can be used for a family of problems...