A linear programming model for design of communications networks with time varying probabilistic demands

In this paper marginal investment costs are assumed known for two kinds of equipment stocks employed to supply telecommunications services: trunks and switching facilities. A network hierarchy is defined which includes important cases occurring in the field and also appearing in the literature. A different use of the classical concept of the marginal capacity of an additional trunk at prescribed blocking probability leads to a linear programming supply model which can be used to compute the sizes of all the high usage trunk groups. The sizes of the remaining trunk groups are approximated by the linear programming models, but can be determined more accurately by alternate methods once all high usage group sizes are computed. The approach applies to larger scale networks than previously reported in the literature and permits direct application of the duality theory of linear programming and its sensitivity analyses to the study and design of switched probabilistic communications networks with multiple busy hours during the day. Numerical results are presented for two examples based on field data, one of which having been designed by the multi-hour engineering method.     

A model in which component failure rates depend on the working set

We consider a multicomponent system in which the failure rate of a given component at any time depends on the set of working components at that time. Sufficient conditions are presented under which such a system has a life distribution of specified type. The Laplace transform of the time until all components are down is derived. When repair is allowed, conditions under which the resulting process is time reversible are presented.     

Some results of the queueing system E/M/c

This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed.     

A note on duality in homogeneous fractional programming

For a linear fractional programming problem, Sharma and Swarup have constructed a dual problem, also a linear fractional program, in which the objective functions of both primal and dual problems are the same. Craven and Mond have extended this result to a nonlinear fractional programming problem with linear constraints, and a dual problem for which the objective function is the same as that of the primal. This theorem is now further extended from linear to differentiable convex constraints.     

A queueing system with multiple service time distributions

This paper explores a modification of the output discipline for the Poisson input, exponential output, single channel, first-come, first-served queueing system. Instead, the service time distribution of customers beginning service when alone in the system is considered different from that governing service times of all other customers. More specifically, the service times of lone customers are governed by a one parameter gamma distribution, while the service times of all other customers are exponentially ajstributed. The generating function for the steady-state probsbilities, n_j = Pr { j customers in system at an arbitrary point of departure}, of the imbedded chain, {X_n/X_n = number in system after nth customer is serviced}, is obtained, and the steady-state probabilities, themselves, are found in closed form.     

A decomposition procedure for convex quadratic programs

This article deals with the solution of convex quadratic programs by iteratively solving a master problem and a subproblem as proposed previously by Sacher. The approach has the advantage that the subproblems are linear programs so that advantage can be taken of existing schemes for solving large linear problems. At each step in solving the master problem, a closed-form solution can be specified so that the procedure is well suited for solving large quadratic programs and can take advantage of the constraint structure.