منابع مشابه
Second Moment of Queue Size with Stationary Arrival Processes and Arbitrary Queue Discipline
In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...
متن کاملThe Approach of Convergence to Stationary State of Multi Server Queue with Balking (TECHNICAL NOTE)
This investigation deals with multi server queue with balking. The customers arrive in poisson fashion and independent of time, under the assumption that system is initially empty. The number of customers in the system is stochastically increasing and distributed in steady state (stationary state) as required. The expressions for the measure of the speed of convergence from transient state to s...
متن کاملOn the GGS Conjecture
In the 1980’s, Belavin and Drinfeld classified solutions r of the classical YangBaxter equation (CYBE) for simple Lie algebras g satisfying 0 6= r + r21 ∈ (S 2g)g [1]. They proved that all such solutions fall into finitely many continuous families and introduced combinatorial objects to label these families, Belavin-Drinfeld triples. In 1993, Gerstenhaber, Giaquinto, and Schack attempted to qua...
متن کاملProof of the Ggs Conjecture
We prove the GGS conjecture [GGS] (1993), which gives a particularly simple explicit quantization of classical r-matrices for Lie algebras gl(n), in terms of a matrix R ∈ Matn(C) ⊗ Matn(C) which satisfies the quantum YangBaxter equation (QYBE) and the Hecke condition, whose quasiclassical limit is r. The r-matrices were classified by Belavin and Drinfeld in the 1980’s in terms of combinatorial ...
متن کاملStationary analysis of the shortest queue first service policy
We analyze the so-called Shortest Queue First (SQF) queueing discipline whereby a unique server addresses queues in parallel by serving at any time that queue with the smallest workload. Considering a stationary system composed of two parallel queues and assuming Poisson arrivals and general service time distributions, we first establish the functional equations satisfied by the Laplace transfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Stochastic Analysis
سال: 1998
ISSN: 1048-9533,1687-2177
DOI: 10.1155/s1048953398000057