Priority scheduling for packets is becoming a hot topic, as attempts are being made to integrate voice services in existing data networks. In this paper, we consider a discrete-time queueing system with head-of-line (HOL) non-preemptive priority scheduling. Two classes of traffic will be considered, i.e., high-priority and low-priority traffic, which both generate variablelength packets. We wil...

We study static repair priorities in a system consisting of one repair shop and one stockpoint, where spare parts of multiple repairables are kept on stock to serve an installed base of technical systems. Demands for ready-for-use parts occur according to Poisson processes, and are accompanied by returns of failed parts. The demands are met from stock if possible, and otherwise they are backord...

We consider a queue with finite buffer where the buffer size limits the amount of work that can be stored in the queue. The arrival process is a Poisson or a Markov modulated Poisson process. The service times (packet lengths) are iid with a general distribution. Our queue models the systems in the Internet more realistically than the usual M/GI/1/K queue which restricts the number of packets i...

We introduce a new number system that we call the strictlyregular system, which efficiently supports the operations: digit-increment, digit-decrement, cut, concatenate, and add. Compared to other number systems, the strictly-regular system has distinguishable properties. It is superior to the regular system for its efficient support to decrements, and superior to the extended-regular system for...

In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preemptive resume priority over customers of the other. Both classes contain customers with generally distributed service times. We show that the use of probability generating functions is beneficial for analyzing the system ...

One of the challenges that must be overcome to realize the practical benefits of ad hoc networks is quality of service (QoS). However, the IEEE 802.11 standard, which undeniably is the most widespread wireless technology of choice for WLANs and ad hoc networks, does not address this issue. In order to support applications with QoS requirements, the upcoming IEEE 802.11e standard enhances the or...

This paper studies the behavior of a discrete queueing system which accepts synchronized arrivals and provides synchronized services. The number of arrivals occurring at an arriving point may follow any arbitrary discrete distribution possessing finite first moment and convergent probability generating function in I z [ ~< 1 + e with e > O. The system is equipped with an infinite buffer and one...

This paper introduces Stellar Simplification, a fast implementation of the Four–Face Cluster algorithm. In our version of this mesh simplification scheme, we adopt a probabilistic heuristic that substitutes the priority queue of the original algorithm. This made our version, in average, 40% faster. In our implementation, we adopt a very concise data structure which uses only two arrays of integ...

Skew heaps are an amazingly simple and lightweight implementation of priority queues. They were invented by Sleator and Tarjan [1] and have logarithmic amortized complexity. This entry provides executable and verified functional skew heaps. The amortized complexity of skew heaps is analyzed in the AFP entry Amortized Complexity.

Exploiting cognition to the cache-enabled deviceto-device (D2D) communication underlaying the multi-channel cellular network is the main focus of this paper. D2D pairs perform direct communications via sensing the available cellular channels, bypassing the base station (BS). Dynamic service is considered and the network performance is evaluated with the stochastic geometry. Node locations are f...