scholarly journals GIX/MY/1 systems with resident server and generally distributed arrival and service groups

1996 ◽  
Vol 9 (2) ◽  
pp. 159-170
Author(s):  
Alexander Dukhovny
Keyword(s):  
Group Size ◽  
Generating Function ◽  
Riemann Boundary Value Problem ◽  
Riemann Boundary ◽  
Queueing Process ◽  
Imbedded Markov Chain ◽  
Special Cases ◽  
Necessary And Sufficient ◽  
Service Groups ◽  
Steady State Probabilities

Considered are bulk systems of GI/M/1 type in which the server stands by when it is idle, waits for the first group to arrive if the queue is empty, takes customers up to its capacity and is not available when busy. Distributions of arrival group size and server's capacity are not restricted. The queueing process is analyzed via an augmented imbedded Markov chain. In the general case, the generating function of the steady-state probabilities of the chain is found as a solution of a Riemann boundary value problem. This function is proven to be rational when the generating function of the arrival group size is rational, in which case the solution is given in terms of roots of a characteristic equation. A necessary and sufficient condition of ergodicity is proven in the general case. Several special cases are studied in detail: single arrivals, geometric arrivals, bounded arrivals, and an arrival group with a geometric tail.

Tandem Conveyor Queues

1989 ◽  
Vol 3 (4) ◽  
pp. 517-536
Author(s):  
F. Baccelli ◽  
E.G. Coffman ◽  
E.N. Gilbert
Keyword(s):  
Boundary Value Problem ◽  
Joint Distribution ◽  
Queueing System ◽  
The Other ◽  
Riemann Boundary Value Problem ◽  
Riemann Boundary ◽  
Special Cases ◽  
A Cell ◽  
Service Times ◽  
Input Position

This paper analyzes a queueing system in which a constant-speed conveyor brings new items for service and carries away served items. The conveyor is a sequence of cells each able to hold at most one item. At each integer time, a new cell appears at the queue's input position. This cell holds an item requiring service with probability a, holds a passerby requiring no service with probability b, and is empty with probability (1– a – b). Service times are integers synchronized with the arrival of cells at the input, and they are geometrically distributed with parameter μ. Items requiring service are placed in an unbounded queue to await service. Served items are put in a second unbounded queue to await replacement on the conveyor in cells at the input position. Two models are considered. In one, a served item can only be placed into a cell that was empty on arrival; in the other, the served item can be placed into a cell that was either empty or contained an item requiring service (in the latter case unloading and loading at the input position can take place in the same time unit). The stationary joint distribution of the numbers of items in the two queues is studied for both models. It is verified that, in general, this distribution does not have a product form. Explicit results are worked out for special cases, e.g., when b = 0, and when all service times are one time unit (μ = 1). It is shown how the analysis of the general problem can be reduced to the solution of a Riemann boundary-value problem.

scholarly journals Generating Function Approach to the Derivation of Higher-Order Iterative Methods for Solving Nonlinear Equations

2018 ◽  
Vol 173 ◽  
pp. 03024
Author(s):  
Tugal Zhanlav ◽  
Ochbadrakh Chuluunbaatar ◽  
Vandandoo Ulziibayar
Keyword(s):  
Iterative Methods ◽  
Generating Function ◽  
Generating Functions ◽  
Order Of Convergence ◽  
Sufficient Conditions ◽  
Optimal Order ◽  
Eighth Order ◽  
New Family ◽  
Special Cases ◽  
Necessary And Sufficient

In this paper we propose a generating function method for constructing new two and three-point iterations withp(p= 4, 8) order of convergence. This approach allows us to derive a new family of optimal order iterative methods that include well known methods as special cases. Necessary and sufficient conditions forp-th (p= 4, 8) order convergence of the proposed iterations are given in terms of parameters τnand αn. We also propose some generating functions for τnand αn. We develop a unified representation of all optimal eighth-order methods. The order of convergence of the proposed methods is confirmed by numerical experiments.

scholarly journals Markov chains with quasitoeplitz transition matrix

1989 ◽  
Vol 2 (1) ◽  
pp. 71-82 ◽  
Author(s):  
Alexander M. Dukhovny
Keyword(s):  
Steady State ◽  
Boundary Value Problem ◽  
Markov Chains ◽  
Generating Functions ◽  
Transition Matrix ◽  
Queueing Systems ◽  
Riemann Boundary Value Problem ◽  
Riemann Boundary ◽  
Steady State Probabilities ◽  
Transient And Steady State

This paper investigates a class of Markov chains which are frequently encountered in various applications (e.g. queueing systems, dams and inventories) with feedback. Generating functions of transient and steady state probabilities are found by solving a special Riemann boundary value problem on the unit circle. A criterion of ergodicity is established.

Analysis of a two-queue model with Bernoulli schedules

1997 ◽  
Vol 34 (1) ◽  
pp. 176-191 ◽  
Author(s):  
Duan-Shin Lee
Keyword(s):  
Integral Equation ◽  
Boundary Value Problem ◽  
Queueing System ◽  
Boundary Value ◽  
Single Server ◽  
Riemann Boundary Value Problem ◽  
Riemann Boundary ◽  
Numerical Examples ◽  
Special Cases ◽  
Queue Model

In this paper we analyze a single server two-queue model with Bernoulli schedules. This discipline is very flexible and contains the exhaustive and 1-limited disciplines as special cases. We formulate the queueing system as a Riemann boundary value problem with shift. The boundary value problem is solved by exploring a Fredholm integral equation around the unit circle. Some numerical examples are presented at the end of the paper.

Analysis of a two-queue model with Bernoulli schedules

1997 ◽  
Vol 34 (01) ◽  
pp. 176-191 ◽  
Author(s):  
Duan-Shin Lee
Keyword(s):  
Integral Equation ◽  
Boundary Value Problem ◽  
Queueing System ◽  
Boundary Value ◽  
Single Server ◽  
Riemann Boundary Value Problem ◽  
Riemann Boundary ◽  
Numerical Examples ◽  
Special Cases ◽  
Queue Model

In this paper we analyze a single server two-queue model with Bernoulli schedules. This discipline is very flexible and contains the exhaustive and 1-limited disciplines as special cases. We formulate the queueing system as a Riemann boundary value problem with shift. The boundary value problem is solved by exploring a Fredholm integral equation around the unit circle. Some numerical examples are presented at the end of the paper.

scholarly journals Riemann boundary value problem for hyperanalytic functions

2005 ◽  
Vol 2005 (17) ◽  
pp. 2821-2840 ◽  
Author(s):  
Ricardo Abreu Blaya ◽  
Juan Bory Reyes ◽  
Dixan Peña Peña
Keyword(s):  
General Solution ◽  
Boundary Value Problem ◽  
Singular Integral ◽  
Boundary Value ◽  
Sufficient Conditions ◽  
Singular Integral Equations ◽  
Cauchy Kernel ◽  
Riemann Boundary Value Problem ◽  
Riemann Boundary ◽  
Necessary And Sufficient

We deal with Riemann boundary value problem for hyperanalytic functions. Furthermore, necessary and sufficient conditions for solvability of the problem are derived. At the end the explicit form of general solution for singular integral equations with a hypercomplex Cauchy kernel in the Douglis sense is established.

The use of Riemann problems in solving a class of transcendental equations

1973 ◽  
Vol 73 (1) ◽  
pp. 111-118 ◽  
Author(s):  
E. E. Burniston ◽  
C. E. Siewert
Keyword(s):  
Boundary Value Problem ◽  
Closed Form ◽  
Boundary Value ◽  
Explicit Solutions ◽  
Riemann Boundary Value Problem ◽  
Riemann Problems ◽  
Riemann Boundary ◽  
Canonical Solution ◽  
Transcendental Equations ◽  
Explicit Expressions

AbstractA method of finding explicit expressions for the roots of a certain class of transcendental equations is discussed. In particular it is shown by determining a canonical solution of an associated Riemann boundary-value problem that expressions for the roots may be derived in closed form. The explicit solutions to two transcendental equations, tan β = ωβ and β tan β = ω, are discussed in detail, and additional specific results are given.

scholarly journals Complex-analytic and matrix-analytic solutions for a queueing system with group service controlled by arrivals

2000 ◽  
Vol 13 (4) ◽  
pp. 415-427
Author(s):  
Lev Abolnikov ◽  
Alexander Dukhovny
Keyword(s):  
Block Size ◽  
Iteration Process ◽  
Analytic Solutions ◽  
Analytic Method ◽  
Service Time Distribution ◽  
Matrix Analytic Method ◽  
Queueing Process ◽  
The Matrix ◽  
Matrix Iteration ◽  
Necessary And Sufficient

A bulk M/G/1 system is considered that responds to large increases (decreases) of the queue during the service act by alternating between two service modes. The switching rule is based on two “up” and “down” thresholds for total arrivals over the service act. A necessary and sufficient condition for the ergodicity of a Markov chain embedded into the main queueing process is found. Both complex-analytic and matrix-analytic solutions are obtained for the steady-state distribution. Under the assumption of the same service time distribution in both modes, a combined complex-matrix-analytic method is introduced. The technique of “matrix unfolding” is used, which reduces the problem to a matrix iteration process with the block size much smaller than in the direct application of the matrix-analytic method.

Sign in / Sign up

Export Citation Format

Share Document