We study MX/G/1 nonpreemptive and preemptive-resume priority queues with/without vacations under random order of service (ROS) discipline within each class. By considering the conditional waiting times given the states of the system, which an arbitrary message observes upon arrival, we derive the Laplace-Stieltjes transforms of the waiting time distributions and explicitly obtain the first two ...

A new priority queue structure is introduced, for which the amortized time to insert a new element isO(1) while that for the minimumextraction is O(logK). K is the average, taken over all the deleted elements x, of the number of elements that are inserted during the lifespan of x and are still in the heap when x is removed. Several applications of our structure are mentioned.

A Bernoulli schedule is random service discipline for a multi-class priority queueing system which operates as follows: If queue i(l :s i :s N) is not empty just after servicing a message in its queue, a message in queue i is served again with probability Pi, and the highest class message present in the system is served with probability 1-Pi, where 0 :s Pi :s 1. This paper presents an analysis ...

INTRODUCTION Diseases caused by Streptococcus pneumoniae generate substantial morbidity and mortality. Despite official recommendations to vaccinate everyone over the age of 64, the estimated vaccination rate for this target population is around 2%. In Switzerland, pneumococcal vaccinations are for the most part provided by general practitioners (GPs); in addition, a small number of patients ge...

An adaptive resource reservation and handoff priority scheme, which jointly considers the characteristics from the physical, link and network layers, is proposed for a packet switching Multicode (MC)-CDMA cellular network supporting multimedia applications. A call admission region is derived for call admission control (CAC) and handoff management with the satisfaction of quality of service (QoS...

AbstmctA direct application of commonly used synchronization primitives such as semaphores, monitors, or the Ada rendezvous can lead to uncontrolled priority inversion, a situation in which a higher priority job is blocked by lower priority jobs for an indefinite period of time. In this paper, we investigate two protocols belonging to the class of priority inheritance protocols, called the basi...

─ In most of broadband wireless access systems including the cdma2000 1xEV-DO system, a maximum possible data rate prescribed by the channel condition of a terminal is reflected into the priority metric. Particular examples include the proportional fairness and a modified largest weighted delay first (M-LWDF) packet scheduling algorithm. We note that all of these existing algorithms suffer from...

An adaptive handoff priority scheme is proposed for a packet switching multicode (MC)-CDMA cellular network supporting realtime multimedia applications. The scheme jointly considers the physical, link and network layer characteristics, and gives service priority to handoff calls by exploiting the transmission rate adaptability of multimedia calls to the available radio resources. Based on the s...

growth analysis is a valuable method in the study of quantitative of growth, development and crop production. in order to study the physiological growth indices of lentil plant under dry- farming conditions, an experiment was carried out as a randomized complete block design with three replications at the agricultural research station of lorestan university during 2010. in this experiment two c...

In this paper, the channel segregation dynamic channel allocation (CS-DCA) scheme is applied to a multi-hop DS-CDMA virtual cellular network (VCN). After all multi-hop routes are constructed over distributed wireless ports in a virtual cell, the CS-DCA is carried out to allocate the channels to multi-hop up and down links. Each wireless port is equipped with a channel priority table. The transm...