Results 251 to 260 of about 906,917 (283)
Some of the next articles are maybe not open access.
Queueing Systems, 2023
The \textit{Markovian bulk-arrival and bulk-service queues with general state-dependent control}, recently introduced and studied by \textit{A. Chen} et al. [Queueing Syst. 95, No. 3--4, 331--378 (2020; Zbl 1461.60073)], is a special bulk queue model defined on the state space \(\{0,1,2,\ldots\}\).
Xiaohan Wu, Anyue Chen
openaire +2 more sources
The \textit{Markovian bulk-arrival and bulk-service queues with general state-dependent control}, recently introduced and studied by \textit{A. Chen} et al. [Queueing Syst. 95, No. 3--4, 331--378 (2020; Zbl 1461.60073)], is a special bulk queue model defined on the state space \(\{0,1,2,\ldots\}\).
Xiaohan Wu, Anyue Chen
openaire +2 more sources
Bounding aggregations on bulk arrivals for performance analysis of clouds
2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA), 2015Considering a cloud system, we propose in this paper to apply bounding aggregations for mathematical analysis of a data center. Modeled as a hysteresis queueing system, a data center is characterized by forward and backward thresholds which allow to represent its dynamic behavior.
Farah Aït-Salaht, Hind Castel
openaire +2 more sources
Buffer Behavior with Poisson Arrivals and Bulk Geometric Service
IEEE Transactions on Communications, 1976Summary: This correspondence considers a buffered system with Poisson arrivals and \(m\) output channels subjected to geometrically distributed interruptions. The generating function of the buffet occupancy is derived and is a transcendental function. An example demonstrates the results.
openaire +1 more source
Arrival and departure state distributions in the general bulk-service queue
Naval Research Logistics, 1999Summary: We give an explicit relation between steady-state probability distributions of the buffer occupancy at customer entrance and departure epochs, for the classical single-server system \(G/G^{[N]}/1\) with batch services and for the finite capacity case. The method relies on level-crossing arguments.
Hébuterne, Gérard +1 more
openaire +3 more sources
Approximate, Closed Form Moment Formulas for Bulk Arrival, Bulk Service Queues
Transportation Science, 1986Traditional analysis of bulk queues has relied on classical transform methods, which requires the determination of the complex zeroes of a given function, or iterative numerical techniques. In this research, transform results are used to help find approximate closed form expressions for the mean and variance of the length of the queue at departure ...
openaire +3 more sources
The processor-sharing queue with bulk arrivals and phase-type services
Performance Evaluation, 2007In this paper, we consider a queue with compound Poisson arrivals, phase type required service times in which a single processor serves according to the processor-sharing discipline. For this queue, we derive a system of equations for the transform of the queue-length and obtain the moments of the queue-length as a solution of linear equations. We also
Jeongsim Kim, Bara Kim
openaire +1 more source
Approximate analysis for bulk arrival queueing system with bulk departure
Electronics and Communications in Japan (Part I: Communications), 1991AbstractA bulk arrival queueing model with bulk departure is presented for information and communication processing systems where each transaction requires different memory size; moreover, each transaction cannot be divided and is analyzed. This model is characterized by customers arriving in bulks to a system that consists of a finite number of ...
openaire +1 more source
Analysis of Vehicle Holding and Cancellation Strategies in Bulk Arrival, Bulk Service Queues
Transportation Science, 1985A general class of vehicle dispatching strategies for bulk arrival, bulk service queues is examined which consist of some combination of vehicle holding and cancellation strategies. The moments of the length of the queue at vehicle departure instants and in continuous time are solved for exactly using transform methods.
openaire +1 more source
International Journal of Mathematics in Operational Research, 2016
Summary: This paper studies a single server queue with variable batch size general service, Poisson bulk arrival and multiple working vacations where the server works with different rate rather than completely stops the service during the vacation period.
S. Jeyakumar, B. Senthilnathan
openaire +2 more sources
Summary: This paper studies a single server queue with variable batch size general service, Poisson bulk arrival and multiple working vacations where the server works with different rate rather than completely stops the service during the vacation period.
S. Jeyakumar, B. Senthilnathan
openaire +2 more sources
Time-Dependent Solution of a Priority Queue with Bulk Arrival
Operations Research, 1965The time-dependent distribution of the number of customers in the queue and the lapsed service time is obtained, in terms of Laplace transforms, for a head-of-the-line priority queue in which both classes of customer arrive in bunches. From this we obtain the equilibrium distribution and the distribution of the number of customers left behind a ...
openaire +1 more source