The heap-on-top (hot) priority queue data structure 6] improves on the best known times for Dijkstra's shortest path algorithm. It also has very good practical performance and is robust over a wide range of graph types. The heart of Dijkstra's algorithm is a monotone priority queue, that is, a priority queue where no element on the queue ever becomes smaller than the most recently extracted ele...

A Combined Input and Output Queued (CIOQ) switch with a certain speedup of S (1<S<N) can achieve 100% throughput and offer QoS guarantees. In this paper, we present the deployment of Random Early Detection (RED) on a CIOQ switch that has priority queues with shared buffer (class based switch). We first give an estimated model to concrete that one RED controller per output port is sufficient for...

This paper evaluates four mechanisms for providing service differentiation in IEEE 802.11 wireless LANs. The evaluated schemes are the Point Coordinator Function (PCF) of IEEE 802.11, the Enhanced Distributed Coordinator Function (EDCF) of the proposed IEEE 802.11e extension to IEEE 802.11, Distributed Fair Scheduling (DFS), and Blackburst. The evaluation was done using the ns-2 simulator. Furt...

This paper is concerned with the stability of a preemptive repeat priority queueing system with multiple types of customers and customer transfers between queues. Using the mean-drift method and matrix-analytic methods, simple conditions for the queueing system to be stable or instable are found. The conditions indicate that system stability depends only on the service rate of customers of the ...

We obtain an essentially optimal tradeoff between the amortized cost of the three basic priority queue operations insert, delete and find-min in the comparison model. More specifically, we show that A(find-min) = Ω ( n (2 + )A(insert)+A(delete) )

We consider a single stage multi-product manufacturing facility producing a large number of end-products for delivery within a service constraint for the customer lead-time. The manufacturing facility is modeled as a multi-product, multi-priority queuing system. In order to reduce inventory costs, an efficient priority allocation between items consists in producing some items according to a Mak...

This paper studies and gives an analysis of a particular queuing model. It considers a non-preemptive priority queuing system with K ( ≥ 2 ) classes of jobs. The system consists of a single processor. It represents the model of discrete dynamic scheduling problems associated with M k / Gk / 1 / ∞ endogenous priority queues. The processor schedule jobs arriving according to a Markov arrival proc...

The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and non-preemptive priority scheduling disciplines. Two classes of traffic are considered, high-prior...

In order to overcome the problem of flow collision of the integrative information transmission in the switched Ethernet for substation process-level (SESPL), this paper proposed a novel priority-based transfer scheme in the end-nodes based on the information model, in which different priorities are assigned according to different information types by using the user priority field defined in the...

CPU scheduling is one of the most crucial operations performed by operating systems. Different conventional algorithms like FCFS, SJF, Priority, and RR (Round Robin) are available for CPU Scheduling. The effectiveness of Priority and Round Robin scheduling algorithm completely depends on selection of priority features of processes and on the choice of time quantum. In this paper a new CPU sched...