Random trees in queueing systems with deadlines
نویسندگان
چکیده
منابع مشابه
Queueing systems with pre-scheduled random arrivals
We consider a point process i + ξi, where i ∈ Z and the ξi’s are i.i.d. random variables with variance σ. This process, with a suitable rescaling of the distribution of ξi’s, converges to the Poisson process in total variation for large σ. We then study a simple queueing system with our process as arrival process, and we provide a complete analytical description of the system. Although the arri...
متن کاملQueueing Systems in a Random Environment
Queueing networks with product-form steady-state distribution have found many fields ofapplications, e.g. production systems, telecommunications, and computer system model-ing. The success of this class of models and its relatives stems from the simple structureof the steady-state distribution which provides access to easy performance evaluationprocedures. Starting from the ...
متن کاملOn Stability of Queueing Networks with Job Deadlines
In this paper, we consider a single-server queue with stationary input, where each job joining the queue has an associated deadline. The deadline is a time constraint on job sojourn time and may be finite or infinite. If the job does not complete service before its deadline expires, it abandons the queue and the partial service it may have received up to that point is wasted. When the queue ope...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملOn Finite-source Queueing Systems Operating in Random Environments
The simulation tool lcpSim can be used to investigate special level crossing problems of queueing systems of type HYPOk / HYPOr / 1 / /n embedded in different Markovian environments (recently referred to as Markov modulated ones). Our observed system consists of n heterogeneous machines (requests) and a server that "repairs" the broken machines according to the most commonly used service discip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00282-n