Showing papers on "Server published in 1974"

Work Rates in Closed Queuing Networks with General Independent Servers

Abstract: Closed queuing networks are composed of interconnected service stages serving a fixed number of customers. Each stage consists of a queue and identical parallel servers. The path of a customer’s progress throughout the network is described by a finite Markov chain over the stage names. Service times are assumed to be mutually independent with arbitrary distribution functions. The work rate for a stage, defined as the long-run time-average amount of service time rendered by the stage, is shown to exist with probability one. Explicit expressions relating the work rates of different stages and explicit expressions for the asymptotic work rates as the number of customers becomes large are derived. Work rates are shown to depend continuously on the service-time distributions.

Approximate Analysis of a Hierarchical Queuing Network

Abstract: A hierarchical queuing network is a layered network of queues in which all arrivals receive initial service from a primary server, and some customers receive additional service jointly from a primary and a secondary server. This paper considers the simplest such network, involving two levels and a single secondary server who functions as a consultant to several primary servers and always works in conjunction with the primary server who refers the customer to him. An approximate analysis of this hierarchical queuing network is carried out for three operating disciplines governing the consultation process. The analytical results compare favorably with the results of computer simulations and are therefore used to explore several important issues in the design of such networks. Hierarchical queues are common in public-service systems, including new medical-care systems known as "telemedicine."

Alexis Lichine's New encyclopedia of wines & spirits

Abstract: alexis lichines new encyclopedia of wines spirits is available in our digital library an online access to it is set as public so you can get it instantly. Our book servers hosts in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the alexis lichines new encyclopedia of wines spirits is universally compatible with any devices to read.

Equivalence and decomposition methods with application to a model of a time-sharing virtual memory system

Abstract: Queueing network models have been applied by several authors to the analysis and the prediction of computer system performance [I], [2], ~], [4], [5] , [17]. The results obtained from these models appear to match well measurements done on real systems[Ill4] . The basic result for queueing networks has been given by JACKSON [6] . He considers open and closed networks of arbitrarily interconnected exponential servers. The mean service time of a server is allowed to be an almost arbitrary function of the number of customers in the queue of the server (such a server will be called henceforth a Jackson server). A customer leaving a server has constant probabilities of directing itself to any server of the network (or of leaving the system in an open network). In open networks the arrival process is assumed to be Poisson ; its parameter may be an almost arbitrary function of the current total number of customers in the system. For closed (i.e. with no arrivals from outside and no departures) networks the stationary probability distribution for the number of customers at each server always exists and is given by k. s J e. P(kl,...,kl)=G ~ ~ __Z__ j=! i=I uj(i)

Technical Note—The Expected Number of Idle Servers in a Queuing System

Abstract: This note derives a simple expression for the expected number of idle servers in a queue under very general conditions.

Some Problems in Finite Queues

Abstract: In this paper computationally convenient analytic methods are developed for the analysis of two classes of finite queueing systems with (1) arrivals with Poisson properties, general state dependent service time distribution and a single server and (2) general state dependent inter-arrival times, exponential service times and s(≥ 1) servers.

November, 1974, survey of New-Protocol Telnet servers

Abstract: An earlier poll of Telnet server implementation status. Updates RFC 702; see also RFCs 703 and 679.

Computer-controlled queuing system with feedback and swap times

Abstract: The paper presents a detailed investigation of a computer-controlled queuing system with Poisson input, multiple exponential servers, first-come first-served queue discipline, feedback and fixed finite swap times. The swap time is the time needed for the allocated server to acquire necessary information about the customer to be served and set up a necessary connection. A generating function for the stationary state probabilities of, and the necessary and sufficient condition for, the existence of statistical equilibrium for the system are derived. Further, a formula for the determination of the waiting-time distribution in the system is obtained by the use of the theory of Markov chains.