@ARTICLE{Royd53:Bounds,
AUTHOR="H. L. Royden",
TITLE="Bounds on a Distribution Function when Its First $n$ Moments are
Given",
JOURNAL=ams,
VOLUME=24,
PAGES="361-376",
YEAR=1953,
REFERENCES=9,
KEYWORDS="distribution function; upper bound; lower bound; moment;
Chebychev inequality; Hamburger moment problem; general random variable;
Stieltjes moment problem (non-negative random variable)",
ABSTRACT="A solution to the Stieltjes moment problem is given which
corresponds to the classical Tchebycheff inequalities for the Hamburger
moment problem, and these general results are applied to obtain the
Cantelli inequalities. Also the problem of determining sharp upper and
lower bounds for a distribution given thefirst two (absolute) moments
about the mode is solved. Sharp bounds for unimodal distributions given
first two moments are provided.",
}

@ARTICLE{Smit53:Distribution,
AUTHOR="W. L. Smith",
TITLE="On the distribution of queueing times",
JOURNAL="Proceedings Cambridge Philosophical Society",
VOLUME=49,
PAGES="449-461",
YEAR=1953,
REFERENCES=13,
KEYWORDS="Queueing system; waiting time; distribution; G/G/1",
ABSTRACT="The hypothetical model that we shall be considering in this
paper is referred to as the single-server queue and the details of this
model are given in a recent paper by lindley. The present treatment
involves exactly the same assumptions as lindley has given already, and
we refer to his paper for a rigorous statement of them. Briefly, we
shall be assuming general independent service times and general
independent input or arrival times.",
}

@ARTICLE{Wilk53:Microprogramming,
AUTHOR="M. V. Wilkes",
TITLE="Microprogramming and the design of the control circuits in an
electronic digital computer",
JOURNAL="Proceedings Cambridge Philosophical Society",
VOLUME=49,
PAGES="230-",
YEAR=1953,
KEYWORDS="Microprogramming",
}

@ARTICLE{Fost53:Stochastic,
AUTHOR="F. G. Foster",
TITLE="On the stochastic matrices associated with certain queuing
processes",
JOURNAL=ams,
VOLUME=24,
PAGES="355-360",
YEAR=1953,
REFERENCES=5,
KEYWORDS="Queueing theory; M/G/1; G/M/1; Markov chain; stochastic",
ABSTRACT="The paper is concerned with an irreducible Markov chain. Some
general theorems which provide criteria for determining whether the
system is transient, recurrentnull or ergodic are applied tothe Markov
chains associated with queueing processes recently studied by D. G.
Kendall. The main purpose of this paper is to illustrate the
applications of general theorems to this type of problem.",
}

@INPROCEEDINGS{Agar53:Partial,
AUTHOR="R. P. Agarwal",
TITLE="On the partial sums of series of hypergeometric type",
BOOKTITLE="Cambridge Philosophical Society",
VOLUME=49,
PAGES=5,
YEAR=1953,
REFERENCES=14,
KEYWORDS="Hypergeometric function; partial sum",
ABSTRACT="The object of this paper is to make a systematic study of the
transformations connecting partial sums of series of hypergeometric type
and to generalize all the above known results.",
}

@INPROCEEDINGS{Bart53:Recurrence,
AUTHOR="M. S. Bartlett",
TITLE="Recurrence and first passage times",
BOOKTITLE="Cambridge Philosophical Society",
VOLUME=49,
PAGES="263-275",
YEAR=1953,
REFERENCES=11,
KEYWORDS="First passage; recurrent process",
ABSTRACT="The theoretical problem of the probable time of recurrence of
a given state of a physical system which changes according to a
specified random or stochastic process is in general not a very
tractable one, but many situations are covered by the more particular
methods and formulae given in this paper.",
}

@INPROCEEDINGS{Broa53:Telephone,
AUTHOR="S. W. Broadhurst and  Harmston",
TITLE="Studies of telephone traffic with the aid of a machine",
BOOKTITLE="IEE",
PAGES="259-",
YEAR=1953,
KEYWORDS="Traffic machine",
}

@ARTICLE{Clos53:Study,
AUTHOR="C. Clos",
TITLE="A study of non-blocking switching networks",
JOURNAL=bstj,
VOLUME=32,
PAGES="406-424",
YEAR=1953,
KEYWORDS="Switching network; blocking; evaluation; link system;
communication network; circuit switching",
ABSTRACT="This paper describes a method of designing arrays of
crosspoints for use in telephone switching systems in which it will
always be possible to establish a connection from an idle inlet to an
idle outlet regardless of the number of calls served by the system.",
}

@ARTICLE{Cox53:Superposition,
AUTHOR="D. R. Cox and W. L. Smith",
TITLE="The superposition of several strictly periodic sequences of
events",
JOURNAL=biometrika,
VOLUME=40,
PAGES="1-11",
YEAR=1953,
KEYWORDS="Statistics; source model",
}

@ARTICLE{Fros53:Throwdown,
AUTHOR="Victor S. Frost and  Keister and  Ritchie",
TITLE="A throwdown machine for telephone traffic studies",
JOURNAL=bstj,
VOLUME=32,
YEAR=1953,
KEYWORDS="Traffic machine",
}

@ARTICLE{Kend53:Stochastic,
AUTHOR="D. G. Kendall",
TITLE="Stochastic processes occurring in the theory of queues and their
analysis by the method of the imbedded Markov chain",
JOURNAL=ams,
VOLUME=24,
PAGES="338-354",
YEAR=1953,
REFERENCES=30,
KEYWORDS="imbedded Markov chain; process; queueing system",
ABSTRACT="The stochastic processes bwhich occur in the theory of queues
are in general not Markovian and special methods are required for their
analysis. In many cases the problem can be greatly simplified by
restricting attention to an imbedded Markov chain. In this paper some
recent work on single-server queues is first reviews from this
standpoint, and the method is then applied to the analysis of many-
server queuing-system.",
}

@INPROCEEDINGS{Reut53:Differential,
AUTHOR="G. E. H. Reutter and W. Ledermann",
TITLE="On the differential equations for the transition probabilities of
Markov processes with enumerably many states",
BOOKTITLE="Cambridge Philosophical Society",
VOLUME=49,
YEAR=1953,
REFERENCES=11,
KEYWORDS="Markov process; stochastic differential equation;
chapman-kolmogorov equation",
}

@ARTICLE{Rior53:Delay,
AUTHOR="J. Riordan",
TITLE="Delay curves for calls served at random",
JOURNAL=bstj,
PAGES="100-119",
YEAR=1953,
REFERENCES=6,
KEYWORDS="M/M/N; random; waiting time",
ABSTRACT="This paper presents curves and tables for the probabilty of
delay of calls served by a simple trunk group with assignment of delayed
calls to the trunks at random and with purc chance call input. These are
contrasted with the classic results of Erlang (``Erlang C'') which are
based on service in order of arrival. Trunk holding times for both have
an exponential distribution. The theoretical development for computation
of the curves is directed to",
}

@ARTICLE{Lotz53:Gefahrenzeit,
AUTHOR="A. Lotze",
TITLE="Gefahrenzeit oder Verlust als Maß für die Betriebsgüte im
Fernsprechverkehr",
JOURNAL=ftz,
VOLUME=6,
NUMBER=12,
YEAR=1953,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Rohd53:Durchla,
AUTHOR="K. Rohde and H. Störmer",
TITLE="Durchlaßwahrscheinlichkeit bei Vermittlungseinrichtungen der
Fernmeldetechnik",
JOURNAL="Mitteilungsblatt für Mathematische Statistik",
ADDRESS="München",
VOLUME=5,
NUMBER="2/3",
YEAR=1953,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Sysk53:Theory,
AUTHOR="R. Syski",
TITLE="The Theory of Congestion in Lost - Call Systems",
JOURNAL=ate,
VOLUME=9,
NUMBER=4,
PAGES=182,
YEAR=1953,
KEYWORDS="Loss system",
}

@ARTICLE{Wilk53:Working,
AUTHOR="R. I. Wilkinson",
TITLE="Working Curves for Delayed Exponential Calls served in Random
order",
JOURNAL=bstj,
VOLUME=32,
PAGES="360-383",
YEAR=1953,
KEYWORDS="Delay system",
}

@ARTICLE{Ekbe53:Teletrafikmaskiner,
AUTHOR="S. Ekberg",
TITLE="Teletrafikmaskiner",
JOURNAL="Teknisk Tidsskrift",
ADDRESS="Stockholm, Sweden",
VOLUME=27,
PAGES="553-559",
YEAR=1953,
LANGUAGE="Swedish",
KEYWORDS="traffic machine; simulation",
}

@ARTICLE{Ever53:State,
AUTHOR="J. L. Everett",
TITLE="State Probabilities in Congestion Problems Characterized by
Constant Holding Times",
JOURNAL=jors,
VOLUME=1,
PAGES="279-285",
YEAR=1953,
KEYWORDS="Congestion; probability",
}

@ARTICLE{Gilt53:Rangeringen,
AUTHOR="J. Giltay",
TITLE="Over Rangeringen bij de Automatische Telefonie. {I.} Exacte
Behandeling der Rangeringen",
EDITOR="A. Descloux and",
JOURNAL="De Ingenieur. E. Electrotechniek",
ADDRESS="Netherlands",
VOLUME=9,
NUMBER=23,
PAGES=54,
NOTE="presented at ITC 9, Torremolinos 1979 (``On Gradings in Automatic
Telephony'')",
YEAR=1953,
LANGUAGE="Dutch",
KEYWORDS="Grading; loss system; performance evaluation; algorithm",
ABSTRACT="This paper deals with channels accessible to different groups
of subscribers, the accessibility of a channel in each state being
defined by a scheme, the arrangement.  Certain coefficients occurring in
expressions for the state probabilities are proven to be always
positive.",
}

@ARTICLE{Lism53:Frequency,
AUTHOR="J. H. C. Lisman",
TITLE="The Frequency Distribution of the Duration of toll and Trunk
Calls",
JOURNAL="Het PTT-Bedrijf",
VOLUME=5,
NUMBER=2,
PAGES=7,
YEAR=1953,
KEYWORDS="service time; distribution",
}

@ARTICLE{Lund5302:General,
AUTHOR="K. Lundkvist",
TITLE="General Theory for Telephone Traffic",
JOURNAL=ericssont,
ADDRESS="Sweden",
VOLUME=9,
NUMBER=2,
PAGES="111-140",
YEAR=1953,
KEYWORDS="Telephony; traffic engineering",
}

@ARTICLE{Rode5303:Problems,
AUTHOR="N. Rodenburg",
TITLE="Some Problems Relating to a Telephone System Employing Non-Homing
Selectors",
JOURNAL=ptr,
ADDRESS="Netherlands",
VOLUME=13,
NUMBER=3,
PAGES="69-116",
YEAR=1953,
KEYWORDS="Switching system",
}

@ARTICLE{Jens5303:Markoff,
AUTHOR="A. Jensen",
TITLE="Markoff Chains as an Aid in the Study of Markoff Processes",
JOURNAL="Skandinavisk Aktuarietidsskrift",
ADDRESS="Denmark",
PAGES="87-91",
MONTH=mar,
YEAR=1953,
KEYWORDS="Markov process; Markov chain; analysis",
}