@ARTICLE{Bhat6407:Single,
AUTHOR="U. Narayan Bhat",
TITLE="On Single-Server Bulk-Queueing Processes with Binomial Input",
JOURNAL=or,
VOLUME=12,
NUMBER=4,
PAGES="527-533",
MONTH="July-August",
YEAR=1964,
KEYWORDS="discrete time queue",
ABSTRACT="In this paper, treating time as a discrete variable, we study
the transient behavior of a bulk-service queueing system in which a
number of customers arriving within a fixed time interval follows a
binomial probability distribution. The service times are assumed to be
identically distributed and statistically independent. The busy period
and queue length distributions have been obtained in terms of
probability generating functions.",
}

@BOOK{Good64:Inequalities,
AUTHOR="H. J. Goodwin",
TITLE="Inequalities on Distribution Functions",
PUBLISHER="Charles Griffin",
ADDRESS="London",
YEAR=1964,
KEYWORDS="probability theory",
ABSTRACT="Chebycheff's inequality for various types of intervals;
multinomial case",
}

@ARTICLE{Klei6411:Discrete,
AUTHOR="D. C. Kleinecke",
TITLE="Discrete Time Queues at a Periodic Traffic Light",
JOURNAL=or,
VOLUME=12,
NUMBER=6,
PAGES="809-814",
MONTH="November-December",
YEAR=1964,
KEYWORDS="discrete time queue",
ABSTRACT="The response delay in clearing the queue of automobiles
waiting at a traffic light can be modeled by allowing one car to leave
at the end of each of a series of discrete intervals in time. The
steady-state queue formed at a cycle traffic light is discussed for
general stationary arrival processes. A method of solution for the case
where arrivals are Poisson is described. General formulas are given for
the probability of not clearing the queue during a cycle and for the
expected wait at the light.",
}

@ARTICLE{Welc6409:Generalized,
AUTHOR="Peter D. Welch",
TITLE="On a Generalized {$M/G/1$} Queueing Process in Which the First
Customer of Each Busy Period Receives Exceptional Service",
JOURNAL=or,
VOLUME=12,
NUMBER=5,
PAGES="736-752",
MONTH="September-October",
YEAR=1964,
KEYWORDS="queueing system; vacation system; analysis",
ABSTRACT="The following generalization of the $M/G/1$ queue is
considered. If a customer arrives when the server is busy, his service
time has a distribution function, $G\_b(x)$; while if he arrives when
the server is idle, his service time has a different distribution
function, $G\_e(x)$. Results are obtained that characterize the
transient and asymptotic distributions of the queue size, waiting time,
and waiting-plus-service time. These results are then applied to the
special case of a queue with a single service time distribution
function, but with additional independent delay times that have one
distribution function for the customers arriving when the server is idle
and another for the customers arriving when the server is busy.",
}

@ARTICLE{Jaff64:Markovian,
AUTHOR="Joseph Jaffe and Louis Cassotta and Stanley Feldstein",
TITLE="Markovian model of time patterns of speech",
JOURNAL="Science",
VOLUME=144,
PAGES="884-886",
YEAR=1964,
KEYWORDS="voice source model; silence period; talkspurt",
ABSTRACT="The time pattern of speech is describable as a first-order
Markov process when presence or absence is sampled at a rate of 200
times per minute. Two types of monolog were generated under different
conditions of environmental constraint. Although both fit the model,
estimates of their mean range of statistical dependency differed
slightly.",
}

@ARTICLE{Wagn64:Bestimmung,
AUTHOR="H. Wagner and G. Dietrich",
TITLE="Bestimmung der Verkehrsleistung von Wartesystemen durch
künstlichen Fernsprechverkehr",
JOURNAL=ntz,
VOLUME=17,
PAGES=273,
YEAR=1964,
LANGUAGE="German",
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Bjor64:Practical,
AUTHOR="M. Björklund and A. Elldin",
TITLE="A Practical Method of Calculation for Certain Types of Complex
Common Control Systems",
BOOKTITLE=itc4,
ADDRESS="London, England",
VOLUME=1,
PAGES="1-75",
YEAR=1964,
REFERENCES=25,
KEYWORDS="Delay system; switching system; calculation",
ABSTRACT="A practical method of calculation is outlined and applied to
certain types of complex delay systems as generally used for
commoncontrol systems in which more than one call can be served at a
time. After presentation of the formulae system used for the calculation
of cases with normal loading a simple method of estimating the maximum
call handling capacity is given for overloading cases. Some comparis.
with simulations and measurem. are given.",
}

@INPROCEEDINGS{Cox64:Problems,
AUTHOR="D. R. Cox",
TITLE="Some Problems of Statistical Analysis Connected with Congestion",
BOOKTITLE="Symposium on Congestion Theory",
ADDRESS="Chapel Hill, North Carolina",
VOLUME=8,
PAGES="289-316",
YEAR=1964,
REFERENCES=51,
KEYWORDS="Statistics; analysis; congestion; estimation",
ABSTRACT="Problems of statist. anal. connected with queues are
discussed. First the estimation of parameters in simple queueing models
is described. Next problems arising when there is incomplete
infor-mation are discussed. Methods for the separate analysis of
inputand service mechanism are briefly reviewed, and finally there is an
account of problems connected with the sampling of queueing processes. A
discussion of the paper is appended.",
}

@INPROCEEDINGS{Cole64:Digital,
AUTHOR="Robert Cole and  Thomsen and Brad Williams",
TITLE="Digital computer simulation of switching systems using the
{ALGOL} automatic programming language",
BOOKTITLE=itc4,
ADDRESS="London",
YEAR=1964,
KEYWORDS="Simulation; switching system; performance evaluation",
ABSTRACT="ESP (Elliot simulation package)",
}

@TECHREPORT{Conw64:Priority,
AUTHOR="R. W. Conway",
TITLE="Priority assignment in a job shop model",
INSTITUTION="Rand Corporation",
NUMBER="RM 3789-PR",
YEAR=1964,
KEYWORDS="Priority",
ABSTRACT={Table "priority rules"},
}

@BOOK{Fers64:Zufallsabh,
AUTHOR="F. Ferschl",
TITLE="Zufallsabhängige Wirtschaftsprozesse",
PUBLISHER="Physica Verlag",
ADDRESS="Wien",
YEAR=1964,
LANGUAGE="German",
KEYWORDS="Queueing system; survey",
ABSTRACT="Grundlagen und anwendungen der theorie der wartesysteme.",
}

@BOOK{Golo64:Digital,
AUTHOR="S. W. Golomb and  others",
TITLE="Digital communications with space applications",
SERIES="EE-series",
PUBLISHER="Prentice Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1964,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Klei64:Time,
AUTHOR="L. Kleinrock",
TITLE="Analysis of time-shared processor",
JOURNAL=navres,
VOLUME=11,
PAGES="59-73",
YEAR=1964,
REFERENCES=5,
KEYWORDS="M/M/1; processor sharing; time sharing",
ABSTRACT="This paper analyzes a queueing structure for a time-shared
serv ice facility (or processor) and compares these results with a
straight-forward first-come first-served discipline.",
}

@ARTICLE{Lewi64:Branching,
AUTHOR="Pierre Lewis",
TITLE="A branching process model for the analysis of computer failure
pattern",
JOURNAL=jrss,
VOLUME=26,
PAGES="398-440",
YEAR=1964,
KEYWORDS="Branching process; failure; performance evaluation",
}

@INPROCEEDINGS{Chas64:Study,
AUTHOR="J. Chastang and C. Grandjean",
TITLE="Study of a Problem Concerning 'Entrade' Traffic",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="7/77",
YEAR=1964,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Chri64:Investigation,
AUTHOR="U. Christiansen",
TITLE="An Investigation of Subscribers' Complaints in an Exchange Area
ofa Telephone Administration",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="4/46",
YEAR=1964,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Cohe64:Note,
AUTHOR="J. W. Cohen",
TITLE="A note on queueing processes with group arrival. A variant of the
{M/G/1} delay problem",
BOOKTITLE=itc,
ADDRESS="London",
PAGES="3/32",
YEAR=1964,
KEYWORDS="Delay system",
ABSTRACT="Mathematisches Institut der TH Delft, Niederlande (erschienen
im November und August)",
}

@INPROCEEDINGS{Boer64:Some,
AUTHOR="J. de Boer and J. F. Brouwer and F. de Fremery",
TITLE="Some economic aspects of the planning of local telephone
networks",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="4/43",
YEAR=1964,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Desc64:Variability,
AUTHOR="A. Descloux",
TITLE="On the Variability of the Proportion of Unsuccessful Attempts in
Loss System",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="1/12",
YEAR=1964,
KEYWORDS="Loss system",
}

@ARTICLE{Deut64:Imformationstheorie,
AUTHOR="K. D. Deutrich",
TITLE="Imformationstheorie und Numerierungsstruktur in der
Fernsprechtechnik",
JOURNAL=siemensz,
NUMBER=1,
YEAR=1964,
LANGUAGE="German",
KEYWORDS="Gos",
}

@INPROCEEDINGS{Duer64:Trunking,
AUTHOR="W. T. Duerdoth and E. Walker",
TITLE="Trunking and Traffic Principles of a {PCM} Telephone Exchange",
BOOKTITLE=itc,
ADDRESS="London",
PAGES="223-",
YEAR=1964,
KEYWORDS="TDM; time division multiplex",
}

@INPROCEEDINGS{Ekbe64:Report,
AUTHOR="S. Ekberg",
TITLE="Report from 'The Nomenclature Committee'",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="102-",
YEAR=1964,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Fort64:Study,
AUTHOR="R. Fortet and C. Grandjean",
TITLE="Study of the Congestion in a Loss System",
BOOKTITLE=itc,
ADDRESS="London",
PAGES="2/20",
YEAR=1964,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Free64:Planning,
AUTHOR="A. H. Freeman",
TITLE="Network planning investigation using an electronic computer",
BOOKTITLE=itc4,
ADDRESS="London",
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Harm64:Distribution,
AUTHOR="A. T. Harmston",
TITLE="The Distribution of Overflow Calls when pure Chance Traffic is
offered to a Single Trunk",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="Session 7/71",
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Harm64:Study,
AUTHOR="A. T. Harmston",
TITLE="Study of time of arrival of calls during the busy hour",
BOOKTITLE=itc4,
ADDRESS="London",
YEAR=1964,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Hayw64:Traffic,
AUTHOR="W. S. Hayward",
TITLE="Traffic design and engineering of the switching network for the
No.1 Electronic switching system",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="Session 8/81",
YEAR=1964,
KEYWORDS="Link system",
}

@TECHREPORT{Herz64:Zur,
AUTHOR="U. Herzog",
TITLE="Näherungsverfahren zur Berechnung des Streuwerts von
Überlaufsverkehr hinter unvollkommenen Bündeln",
INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung
der TH Stuttgart",
ADDRESS="Stuttgart",
YEAR=1964,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Hoch64:Grundlagen,
AUTHOR="H. Hochmuth",
TITLE="Grundlagen für das Abtastverfahren bei
Fernsprechverkehrsmessungen",
JOURNAL=ntz,
VOLUME=17,
NUMBER=3,
YEAR=1964,
LANGUAGE="German",
KEYWORDS="Measurement",
ANNOTE="Mitteilung aus dem Wernerwerk für Fernsprechtechnik, Siemens und
Halske AG",
}

@INPROCEEDINGS{Hube64:Congestion,
AUTHOR="M. Huber",
TITLE="On the Congestion in {TDM} Systems",
BOOKTITLE=itc,
ADDRESS="London",
YEAR=1964,
KEYWORDS="TDM; time division multiplex",
ABSTRACT="Institut für Nachrichtenvermittlung und Datenverarbeitung der
Universität Stuttgart,",
}

@ARTICLE{Jost64:Teilnehmerverhalten,
AUTHOR="M. Josten",
TITLE="Teilnehmerverhalten bei Auslandsverbindungen",
JOURNAL=ingdbp,
NUMBER=4,
YEAR=1964,
LANGUAGE="German",
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Karl64:Interconnection,
AUTHOR="S. A. Karlsson",
TITLE="Interconnection System",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="Session 9/94",
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Karl64:Rational,
AUTHOR="S. A. Karlsson",
TITLE="Rational dimensioning of telephone routes",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="Session 9/93",
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Kier64:Verkehrsmesseinrichtung,
AUTHOR="W. Kierner",
TITLE="Eine Verkehrsmesseinrichtung mit Abtastung für
Vermittlungsstellen",
JOURNAL="SEL-Nachrichten",
ADDRESS="Stuttgart",
VOLUME=12,
NUMBER=4,
YEAR=1964,
LANGUAGE="German",
KEYWORDS="Measurement",
}

@INPROCEEDINGS{King64:Heavy,
AUTHOR="J. F. C. Kingman",
TITLE="The Heavy Traffic Approximation in the theory of Queues",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="3/31",
YEAR=1964,
KEYWORDS="Delay system",
}

@INPROCEEDINGS{Knig64:Reliability,
AUTHOR="R. G. Knight and D. G. Bryan",
TITLE="Reliability of Lattice-Interconnected Networks",
BOOKTITLE=itc,
ADDRESS="London",
PAGES="4/45",
YEAR=1964,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Gall64:Traffic,
AUTHOR="P. Le Gall",
TITLE="Traffic variations and grade of service",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="57 (95)",
YEAR=1964,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Lind64:Class,
AUTHOR="G. Lind",
TITLE="On a Class of Markov Processes Applicable to the Control of
Service Quality in Telephone Systems",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="4/47",
YEAR=1964,
KEYWORDS="Gos",
}

@ARTICLE{Linh64:Overflow,
AUTHOR="P. B. Linhart",
TITLE="Overflow Traffic from a Trunk Group with Balking",
JOURNAL=bstj,
VOLUME=63,
NUMBER=1,
PAGES="part 1",
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
}

@MISC{Lotz64:Tabellen,
AUTHOR="A. Lotze",
TITLE="Tabellen für Streuwert und Verlust von einstufigen
Koppelanordnungen mit unvollkommener und vollkommener Erreichbarkeit",
EDITION="1st",
PUBLISHER="Institut für Nachrichtenvermittlung und Datenverarbeitung, TH
Stuttgart",
ADDRESS="Stuttgart",
YEAR=1964,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Lotz64:Traffic,
AUTHOR="A. Lotze",
TITLE="A traffic variance method for gradings of arbitrary type",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="8/80",
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Mart64:General,
AUTHOR="R. Martinez",
TITLE="General criterion to avaluate the quality of a grading. Study of
a family of gradings",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="Session 8/86",
YEAR=1964,
KEYWORDS="Grading",
}

@INPROCEEDINGS{Matt64:Telephone,
AUTHOR="P. C. Matthiessen",
TITLE="Telephone Prognostication from a Stochastic and a Structural
Viewpoint",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="Session 4/48",
YEAR=1964,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Mina64:Solution,
AUTHOR="R. R. Mina",
TITLE="A Solution to the Problem of Smooth Traffic",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="7/76",
YEAR=1964,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Moln64:Aspects,
AUTHOR="I. Molnar",
TITLE="Non-Parametric aspects in the grade of service of
telephonetraffic",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="Session 9/90",
YEAR=1964,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Morr64:Trunking,
AUTHOR="H. Morris and Jr. Smith and J. SMITH",
TITLE="Trunking and traffic theory in the 5005 crossbar system",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="Session 8/84",
YEAR=1964,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Morr64:Bibliography,
AUTHOR="N. H. G. Morris",
TITLE="Bibliography relating to the application of probability theory
totelephone switching systems and similar problems",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="10/101",
YEAR=1964,
KEYWORDS="Gos",
}

@MASTERSTHESIS{Oehm64:Hauptverkehrsstunde,
AUTHOR="F. Oehme",
TITLE="Über die Hauptverkehrsstunde im Fernsprechverkehr",
SCHOOL="Institut für Nachrichtenvermittlung und Datenverarbeitung der TH
Stuttgart",
ADDRESS="Stuttgart, Germany",
YEAR=1964,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Olss64:Accuracy,
AUTHOR="K. M. Olsson",
TITLE="On the accuracy of results from certain types of counters used
fortraffic supervising purposes",
BOOKTITLE=itc4,
ADDRESS="London",
VOLUME="426/1",
YEAR=1964,
KEYWORDS="Measurement",
}

@ARTICLE{Olss64:Simulation,
AUTHOR="K. M. Olsson",
TITLE="Simulation on Computers: A method for determining the
traffic-carrying capacities of telephone systems",
JOURNAL=tele,
VOLUME=4,
YEAR=1964,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Poll64:Method,
AUTHOR="L. K. Pollen",
TITLE="A Method of Reducing the Probability of Blocking in a 3-Stage
Link Connecting Network",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="Session 7/70",
YEAR=1964,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Rapp64:Planning,
AUTHOR="Y. Rapp",
TITLE="Planning of Junction Network in a Multi-Exchange Area",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES=4,
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Rapp64:General,
AUTHOR="Y. Rapp",
TITLE="The General Plan for a Multi-exchange Area",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="Session 4",
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Ruba64:Traffic,
AUTHOR="J. Rubas",
TITLE="Traffic Simulation Studies Using an Electronic Computer",
BOOKTITLE=itc4,
ADDRESS="London",
YEAR=1964,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Sega64:Traffic,
AUTHOR="M. Segal",
TITLE="Traffic Engineering of Communications Network with a General
Classof Routing Schemes",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="2/24",
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Shea64:Computer,
AUTHOR="A. Shea",
TITLE="Computer Simulation of a Private Wire Telephone Network",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="5/51",
YEAR=1964,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Smit64:Erlang,
AUTHOR="N. Smith",
TITLE="{Erlang} Losses and other Parameters for normally distributed
offered Traffics",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="100 (10)",
YEAR=1964,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Smit64:Supplement,
AUTHOR="N. Smith",
TITLE="Supplement to {Erlang} Loss Tables for Variable Input Traffics",
BOOKTITLE=itc4,
ADDRESS="London",
YEAR=1964,
KEYWORDS="Loss system",
}

@ARTICLE{Smit64:More,
AUTHOR="N. Smith",
TITLE="More Accurate Calculation of Overflow Traffic from Link Trunked
crossbar Group Selectors",
JOURNAL=atr,
NUMBER=1,
NOTE="in: Annales des Télécommunications Tome 17, No.7-8, 1962",
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Stel64:Berechnungsverfahren,
AUTHOR="F. K. Stell",
TITLE="Berechnungsverfahren zur Bestimmung der Belastbarkeit
unvollkommener Bündel",
JOURNAL="Wissenschaftliche Zeitschrift der Hochschule für Verkehrswesen
'Friedrich List'",
ADDRESS="Dresden",
VOLUME=11,
NUMBER=3,
YEAR=1964,
LANGUAGE="German",
KEYWORDS="Grading",
}

@INPROCEEDINGS{Stor64:Reliability,
AUTHOR="H. Störmer",
TITLE="The Reliability of Exchanges with Common Control",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="4/42",
YEAR=1964,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Sysk64:Generalized,
AUTHOR="R. Syski",
TITLE="Generalized Congestion Process",
BOOKTITLE=itc4,
ADDRESS="London",
YEAR=1964,
KEYWORDS="Loss system",
}

@ARTICLE{Szyb64:Numerical,
AUTHOR="E. Szybicki",
TITLE="Some Numerical Methods Used for Telephone Traffic Theory
applications",
JOURNAL=ericssont,
NUMBER=2,
YEAR=1964,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Taka64:Ballot,
AUTHOR="L. Takacs",
TITLE="From Ballot Theorems to the Theory of Queues",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="3/33",
YEAR=1964,
KEYWORDS="Delay system",
}

@INPROCEEDINGS{Taka64:Artificial,
AUTHOR="K. Takagi and T. Suzuki",
TITLE="Artificial Traffic Studies in Crossbar Link Systems using a
Digital Computer",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="5/55",
YEAR=1964,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Tang64:Comparative,
AUTHOR="I. Tange and G. Wikell",
TITLE="Comparative Studies of Congestion Values Obtained in Gradings,
when Holding-Times are Constant Respectively Follow the
Negative-Exponent Distribution Law",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="5/53",
YEAR=1964,
KEYWORDS="Grading",
}

@INPROCEEDINGS{Tora64:Measure,
AUTHOR="L. V. Toralballa and L. J. Saporta",
TITLE="A Measure of System Utility",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="3/35",
YEAR=1964,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Vale64:Certain,
AUTHOR="J. G. Valenzuela",
TITLE="On certain types of cyclical gradings for random hunting",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="8/85",
NOTE="also in Ericsson Technics, No.1, 1965",
YEAR=1964,
KEYWORDS="Grading",
}

@INPROCEEDINGS{Boss64:Some,
AUTHOR="J. van Bosse",
TITLE="Some recursive aids for switching network Blocking Computations",
BOOKTITLE=itc4,
ADDRESS="London",
YEAR=1964,
KEYWORDS="Link system",
}

@ARTICLE{Wagn64:Iterationsverfahren,
AUTHOR="H. Wagner",
TITLE="Ein Iterationsverfahren zur Bemessung vierstufiger
Richtungskoppelfelder",
JOURNAL="SEL-Nachrichten",
ADDRESS="Stuttgart",
VOLUME=12,
NUMBER=2,
YEAR=1964,
LANGUAGE="German",
KEYWORDS="Link system",
}

@INPROCEEDINGS{Wagn64:Traffic,
AUTHOR="H. Wagner",
TITLE="Traffic Simulation According to the Time-True Model. Methods and
Results",
BOOKTITLE=itc4,
ADDRESS="London",
YEAR=1964,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Wall64:Distribution,
AUTHOR="B. Wallström",
TITLE="A Distribution Model for Telephone Traffic with varying call
intensity including overflow Traffic",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="7/73",
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
ABSTRACT="Ericsson, Stockholm,20(1964)2",
}

@INPROCEEDINGS{Warm64:Trunking,
AUTHOR="J. B. Warman and D. B. Bear",
TITLE="The Trunking and Traffic Principles of a Sectionalised Exchange
system",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="2/25",
YEAR=1964,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Webe64:Aspects,
AUTHOR="J. H. Weber",
TITLE="Some Aspects of Routing and Control in Communications Networks",
BOOKTITLE=itc4,
ADDRESS="London",
VOLUME=1,
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Webe64:Application,
AUTHOR="R. A. Weber and R. L. Dujack",
TITLE="Application of Digital Simulation to Traffic Engineering in Large
Communication Networks",
BOOKTITLE=itc4,
ADDRESS="London",
YEAR=1964,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Wilk64:Simplified,
AUTHOR="R. I. Wilkinson",
TITLE="Simplified Engineering of Single Stage Alternate Routing
Systems",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="7/75",
YEAR=1964,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Wrig64:Simulation,
AUTHOR="E. P. G. Wright and M. Lawn",
TITLE="Simulation Studies respecting Delays with Common signalling
channels",
BOOKTITLE=itc4,
ADDRESS="London",
PAGES="5/56",
YEAR=1964,
KEYWORDS="Simulation",
}

@ARTICLE{Avi64:Discretionary,
AUTHOR="B. Avi-Itzhak and I. Brosh and P. Naor",
TITLE="On discretionary priority queueing",
JOURNAL="Zeitschrift für angewandte Mathematik und Mechanik (ZAMM)",
VOLUME=44,
NUMBER=6,
PAGES="235-242",
YEAR=1964,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Bank64:Note,
AUTHOR="G. Bankovi",
TITLE="A note on the generation of beta distributed and gamma
distributed random variables",
JOURNAL="Mathematical Institute of the Hungarian Academy of Sciences,
Series B, Fascicle 4",
ADDRESS="Budapest",
VOLUME=9,
PAGES="555-562",
YEAR=1964,
KEYWORDS="random number generation",
}

@ARTICLE{Bank64:Decomposition,
AUTHOR="G. Bankovi",
TITLE="A decomposition-rejection technique for generating exponential
random variables",
JOURNAL="Mathematical Institute of the Hungarian Academy of Sciences,
Series B, Fascicle 4",
ADDRESS="Budapest",
VOLUME=9,
PAGES="573-581",
YEAR=1964,
KEYWORDS="random number generation",
}

@ARTICLE{Beka64:Remarks,
AUTHOR="A. Békassy",
TITLE="Remarks on beta distributed random numbers",
JOURNAL="Mathematical Institute of the Hungarian Academy of Sciences,
Series B, Fascicle 4",
VOLUME=9,
PAGES="565-571",
YEAR=1964,
KEYWORDS="random number generation",
}

@INPROCEEDINGS{Bros64:Optimal,
AUTHOR="I. Brosh and P. Naor",
TITLE="On optimal disciplines in priority queueing",
BOOKTITLE={Bulletin of the International Statistical Institute, Book 2:
Proceedings of the 34th Session"},
ADDRESS="Toronto",
VOLUME=40,
PAGES="593-608",
YEAR=1964,
KEYWORDS="Queueing system; priority; analysis",
}

@INPROCEEDINGS{Gave64:Priority,
AUTHOR="D. P. Gaver",
TITLE="On priority type disciplines in queueing",
BOOKTITLE="Symposium on Congestion Theory",
PUBLISHER="University of North Carolina Press",
ADDRESS="Chapel Hill",
PAGES="228-241",
YEAR=1964,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Gebh64:Generating,
AUTHOR="F. Gebhardt",
TITLE="Generating normally distributed random numbers by inverting the
normal distribution function",
JOURNAL=moc,
VOLUME=18,
NUMBER=78,
PAGES="302-306",
YEAR=1964,
KEYWORDS="random number generation",
}

@ARTICLE{Geis64:Sizes,
AUTHOR="M. A. Geisler",
TITLE="The sizes of simulation samples required to compute certain
inventory characteristics with stated precision and confidence",
JOURNAL=ms,
VOLUME=10,
NUMBER=2,
PAGES="261-286",
YEAR=1964,
KEYWORDS="Simulation; statistical technique; confidence interval",
}

@ARTICLE{Jahn64:Erzeugung,
AUTHOR="M. D. Jähnk",
TITLE="Erzeugung von betaverteilten und gammaverteilten Zufallszahlen",
JOURNAL="Metrika",
VOLUME=8,
NUMBER=1,
PAGES="5-15",
YEAR=1964,
LANGUAGE="German",
KEYWORDS="random number generation",
}

@ARTICLE{Kron64:Pseudorandom,
AUTHOR="R. Kronmal",
TITLE="Evaluation of a pseudorandom normal number generator",
JOURNAL=jacm,
VOLUME=11,
PAGES="357-363",
YEAR=1964,
KEYWORDS="random number generation",
}

@ARTICLE{Mars64:Generating,
AUTHOR="G. Marsaglia",
TITLE="Generating a variable from the tail of the normal distribution",
JOURNAL="Technometrics",
VOLUME=6,
NUMBER=1,
PAGES="101-102",
YEAR=1964,
KEYWORDS="random number generation",
}

@INPROCEEDINGS{Mars64:Random,
AUTHOR="G. Marsaglia",
TITLE="Random variables and computers",
BOOKTITLE="Transactions of the 3rd Praque Conference on Information
Theory, Statistical",
ADDRESS="Prague",
PAGES="499-512",
YEAR=1964,
KEYWORDS="random number generation",
}

@ARTICLE{Mars64:Convenient,
AUTHOR="G. Marsaglia and T. A. Bray",
TITLE="A convenient method for generating normal variables",
JOURNAL="SIAM Review",
VOLUME=6,
NUMBER=3,
PAGES="260-264",
YEAR=1964,
KEYWORDS="random number generation",
}

@ARTICLE{Taka6401:Priority,
AUTHOR="L. Takacs",
TITLE="Priority queues",
JOURNAL=or,
VOLUME=12,
NUMBER=1,
PAGES="63-74",
MONTH="January/February",
YEAR=1964,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Bara6401:Distributed,
AUTHOR="Paul Baran",
TITLE="On distributed communication networks",
JOURNAL=ieeecoms,
VOLUME="CS-12",
NUMBER=1,
PAGES="1-9",
YEAR=1964,
}

@BOOK{Klei64:Communication,
AUTHOR="L. Kleinrock",
TITLE="Communication Nets",
PUBLISHER="McGraw-Hill",
ADDRESS="New York",
YEAR=1964,
}

@INPROCEEDINGS{Ahls64:Duration,
AUTHOR="B. V. M. Ahlstedt",
TITLE="Duration of the congestion state in local telephone traffic",
BOOKTITLE="4th international teletraffic congress",
ADDRESS="London, Great Britain",
YEAR=1964,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Akim64:Optimum,
AUTHOR="H. Akimaru",
TITLE="Optimum design of switching systems",
BOOKTITLE="4th international teletraffic congress",
ADDRESS="London, Great Britain",
VOLUME="10 N.7-8",
YEAR=1964,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Akim64:Derivatives,
AUTHOR="H. Akimaru and T. Nishimura",
TITLE="The Derivatives of Erlang's B Formula",
BOOKTITLE="4th international teletraffic congress",
ADDRESS="London, Great Britain",
PAGES="428-444",
YEAR=1964,
REFERENCES=5,
KEYWORDS="Erlang B formula",
}

@ARTICLE{Bene64:Optimal,
AUTHOR="V. E. Benes",
TITLE="Optimal Rearrangeable Multistage Connecting Networks",
JOURNAL=bstj,
VOLUME=4,
YEAR=1964,
KEYWORDS="Link system",
}

@ARTICLE{Bene6404:Permutation,
AUTHOR="V. E. Benes",
TITLE="Permutation Groups, Complexes and Rearrangeable Connecting
Network",
JOURNAL=bstj,
NUMBER=4,
YEAR=1964,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Best64:Practical,
AUTHOR="C. F. Best",
TITLE="Practical Application of Congestion Theory in Telephone Systems",
BOOKTITLE="4th international teletraffic congress",
ADDRESS="London, Great Britain",
VOLUME="Sess.7/74",
YEAR=1964,
KEYWORDS="Loss system",
}

@ARTICLE{Bhm6403:Mischungspläne,
AUTHOR="J. Böhm",
TITLE="Mischungspläne für Wahlstufen mit verschiedenen
Erreichbarkeiten",
JOURNAL=ntz,
ADDRESS="Germany",
VOLUME=17,
NUMBER=3,
YEAR=1964,
LANGUAGE="German",
KEYWORDS="Grading",
}

@INPROCEEDINGS{Bots64:Internal,
AUTHOR="D. Botsch",
TITLE="Internal traffic and its effect on the congestion in switching
systems",
BOOKTITLE="4th international teletraffic congress",
ADDRESS="London, Great Britain",
VOLUME=3,
YEAR=1964,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Bret64:Modern,
AUTHOR="G. Bretschneider",
TITLE="Modern Concepts Concerning Single and Two-stage Switching Arrays
as Derived from Exact Loss Calculations",
BOOKTITLE="4th international teletraffic congress",
ADDRESS="London, Great Britain",
VOLUME="Sess.2/22",
YEAR=1964,
KEYWORDS="Grading",
}

@INPROCEEDINGS{Brid64:Geometric,
AUTHOR="J. N. Bridgford",
TITLE="The Geometric Group Concept and its Application to the
Dimensioning of Link Access Systems",
BOOKTITLE="4th international teletraffic congress",
ADDRESS="London, Great Britain",
YEAR=1964,
KEYWORDS="Link system",
ABSTRACT="Headquarters, Engineering Planning and Research Division
Australian Post Office,",
}

@INPROCEEDINGS{Benj64:Simulating,
AUTHOR="S. Benjamin",
TITLE="Simulating Mortality Fluctuations",
BOOKTITLE="Transactions of the 17th International Congress of
Actuaries",
PAGES="478-501",
YEAR=1964,
KEYWORDS="Simulation; birth-death process",
}

@ARTICLE{Ekbe64:Measurements,
AUTHOR="S. Ekberg and A. Harmsen",
TITLE="Measurements of Handled traffic Intensity and Occurring Call
Congestion in a Simulated Telephone Exchange",
JOURNAL=tele,
VOLUME=16,
NUMBER="1-3",
YEAR=1964,
KEYWORDS="Traffic intensity; measurement",
}

@ARTICLE{Fort64:Congestion,
AUTHOR="R. Fortet and C. Grandjean",
TITLE="Congestion in a Loss System when Some Calls Want Several Devices
Simultaneously",
JOURNAL=ec,
VOLUME=39,
NUMBER=4,
PAGES="513-526",
NOTE="ITC-4",
YEAR=1964,
KEYWORDS="multiserver",
}

@ARTICLE{Gran6405:NEASIM,
AUTHOR="R. F. Grantges and N. R. Sinowitz",
TITLE="{NEASIM:} A General-Purpose Computer Simulation Program for
Load-Loss Analysis of Multistage Central Office Switching Networks",
JOURNAL=bstj,
VOLUME=43,
NUMBER=5,
PAGES="965-1004",
YEAR=1964,
KEYWORDS="simulation; delay loss model; open queueing network; switching
system",
}

@INPROCEEDINGS{LeGa64:Les,
AUTHOR="P. Le Gall",
TITLE="Les variations du trafic et la qualité de service",
BOOKTITLE="4th international teletraffic congress",
ADDRESS="London, Great Britain",
PAGES=19,
YEAR=1964,
LANGUAGE="French",
}

@ARTICLE{Howa64:System,
AUTHOR="Ronald A. Howard",
TITLE="System Analysis of Semi-Markov Processes",
JOURNAL="IEEE Transactions on Military Electronics",
PAGES="114-124",
YEAR=1964,
KEYWORDS="Semi Markov process",
}

@ARTICLE{Olss64:Bestämning,
AUTHOR="K. M. Olsson",
TITLE="Bestämning av Trafikavverkningsförmågan hos Telefonanläggningar
genom Simulering på Datamaskin",
JOURNAL=tele,
ADDRESS="Sweden",
PAGES="271-294",
YEAR=1964,
LANGUAGE="Swedish",
KEYWORDS="simulation",
}

@INCOLLECTION{Poll64:Concerning,
AUTHOR="F. Pollaczek",
TITLE="Concerning an Analytic Method for the Treatment of Queueing
Problems",
BOOKTITLE="Congestion Theory",
EDITOR="W. L. Smith and W. E. Wilkinson",
PUBLISHER="The University of North Carolina",
PAGES="1-42",
YEAR=1964,
KEYWORDS="Queueing system",
}

@ARTICLE{Rahk64:Elektroninen,
AUTHOR="K. Rahko",
TITLE="Elektroninen puhelinliikenteen mittauslaitteisto",
JOURNAL="Elektroniikka",
ADDRESS="Finland",
PAGES="23-27",
YEAR=1964,
LANGUAGE="Finnish",
}

@ARTICLE{NN64:Report,
AUTHOR="Anonymous",
TITLE="Report of the Proceedings of the Fourth International Teletraffic
Congress, London 1964",
JOURNAL=poeej,
ADDRESS="Great Britain",
PAGES="1-64",
YEAR=1964,
KEYWORDS="Traffic engineering; survey",
}

@BOOK{Rose64:Hrung,
AUTHOR="W. J. Rosenberg and A. I. Prochorow",
TITLE="Einf hrung in die Bedienungstheorie",
PUBLISHER="B.G. Teubner Verlagsgesellschaft Leipzig",
ADDRESS="Leipzig, Germany",
PAGES=185,
YEAR=1964,
LANGUAGE="German",
REFERENCES=39,
KEYWORDS="Queueing theory",
ABSTRACT="Gegenstand der Bedienungstheorie; Grundbegriffe der
Bedienungstheorie; Einige Bedienungsaufgaben und ihre Lösung",
}

@BOOK{Rose64:Hrung,
AUTHOR="W. J. Rosenberg and A. I. Prochorow",
TITLE="Einführung in die Bedienungstheorie",
PUBLISHER="B.G. Teubner Verlagsgesellschaft Leipzig",
ADDRESS="Leipzig, Germany",
PAGES=185,
YEAR=1964,
LANGUAGE="German",
REFERENCES=39,
KEYWORDS="Queueing theory",
ABSTRACT="Gegenstand der Bedienungstheorie; Grundbegriffe der
Bedienungstheorie; Einige Bedienungsaufgaben und ihre Lösung",
}

@ARTICLE{Giam6401:Mathematical,
AUTHOR="T. Giammo",
TITLE="A mathematical method for the automatic scaling of a function",
JOURNAL=jacm,
VOLUME=11,
NUMBER=1,
PAGES="79-83",
MONTH=jan,
YEAR=1964,
KEYWORDS="graphics; scaling; plotting",
ABSTRACT="This paper describes a procedure for producing scales for use
in automatic plotting of data. The scale and associated origin of the
plot produced by this procedure are ``round numbers''. The procedure
itself is independent of the range of the data and so no a priori bounds
on the data are needed.",
}

@ARTICLE{Darr6403:Traffic,
AUTHOR="J. N. Darroch",
TITLE="On the Traffic-Light Queue",
JOURNAL=ams,
VOLUME=35,
NUMBER=1,
PAGES="380-388",
MONTH=mar,
YEAR=1964,
KEYWORDS="queueing theory; vacation system",
ABSTRACT="A formal solution for the stationary distribution of queue
length at a fixed-cycle traffic light is found for a fairly general
distribution of arrivals and a single stream of vehicles which either
all turn left or else all go straight on or turn right. (We assume that
the vehicles are driving on the right of the road.) Some inequalities
are derived for the expected queue length and for the expected delay per
vehicle.",
ANNOTE="server with periodic interruptions.",
}

@ARTICLE{Pott6403:Partial,
AUTHOR="C. Pottle",
TITLE="On the Partial Fraction Expansion of a Rational Function with
Multiple Poles by Digital Computer",
JOURNAL=ieeect,
VOLUME="CT-11",
PAGES="161-162",
MONTH=mar,
YEAR=1964,
KEYWORDS="numerical methods; partial fractions; roots",
ABSTRACT="This communication describes an iterative method for
performing the partial fraction expansion of a rational function. The
scheme is especially designed for computer use and is therefore, as is
the case for most computer algorithms, probably unsuitable for hand
computation. The method has the following advantages: (a) multiple poles
of any order can be treated. (b) If no poles are repeated, the method
reduces to a standard residue evaluation. (c) Complex poles are treated
in pairs. (d) An indication of accuracy is given when multiple poles are
present.",
}

@ARTICLE{Deme6403:Partitioning,
AUTHOR="P. Demetriou and O. Wing",
TITLE="Partitioning a matrix by inspection",
JOURNAL=ieeect,
VOLUME="CT-11",
NUMBER=3,
PAGES=162,
MONTH=mar,
YEAR=1964,
KEYWORDS="matrix algebra",
}

@ARTICLE{Bara6403:Distributed,
AUTHOR="Paul Baran",
TITLE="On Distributed Communications Networks",
JOURNAL=ieeecoms,
VOLUME="CS-12",
PAGES="1-9",
MONTH=mar,
YEAR=1964,
}

@ARTICLE{Bhat6405:Imbedded,
AUTHOR="U. Narayan Bhat",
TITLE="Imbedded Markov Chain Analysis of Single Server Bulk Queues",
JOURNAL=jams,
VOLUME=4,
NUMBER=2,
PAGES="244-263",
MONTH=may,
YEAR=1964,
KEYWORDS="queueing theory",
ABSTRACT="In this paper results from Fluctuation Theory are used to
analyze the imbedded Markov chains of two single server bulk-queueing
systems, (i) with Poisson arrivals and arbitrary service time
distribution and (ii) with arbitrary inter-arrival time distribution and
negative exponential service time. The discrete time transition
probabilities and the equilibrium behaviour of the queue lengths of the
systems have been obtained along with distributions concerning the busy
periods. From the general results several special cases have been
derived.",
ANNOTE="$M^{[x]}/G^{[y]}/1$ and $GI^{[x]}/M^{[y]}/1$.",
}

@ARTICLE{MacL6405:Fast,
AUTHOR="M. D. MacLaren and G. Marsaglia and T. A. Bray",
TITLE="A fast procedure for generating exponential random variables",
JOURNAL=cacm,
VOLUME=7,
NUMBER=5,
PAGES="298-300",
MONTH=may,
YEAR=1964,
KEYWORDS="random number generation",
}

@ARTICLE{Burk6406:Dependence,
AUTHOR="P. J. Burke",
TITLE="The Dependence of Delays in Tandem Queues",
JOURNAL=ams,
VOLUME=35,
NUMBER=2,
PAGES="874-875",
MONTH=jun,
YEAR=1964,
KEYWORDS="queueing theory",
ABSTRACT="Shows that $Pr[W\_2=0,W\_1=0]>1-\rho\_2$ for two-queue tandem
system, where $W\_i$ is waiting time, not including service; proved by
computing time until departure of last customer in queue 2 at time of
arrival of a customer to an empty queue 1 and comparing it to service
time of customer in queue 1; result holds for all queueing disciplines;
for FCFS, provides $Pr[W\_2>t,W\_1>0]$ and $Pr[W\_2>t,W\_1=0]$.",
}

@ARTICLE{Welc6406:Pre,
AUTHOR="Peter D. Welch",
TITLE="On pre-emptive resume priority queues",
JOURNAL=ams,
VOLUME=35,
NUMBER=2,
PAGES="600-612",
MONTH=jun,
YEAR=1964,
KEYWORDS="Queueing system; priority; analysis",
}

@TECHREPORT{Bara6408:Distributed,
AUTHOR="Paul Baran",
TITLE="On Distributed Communications: {I.} Introduction to Distributed
Communications Network",
TYPE="Memorandum",
INSTITUTION="RAND",
ADDRESS="Santa Monica, California",
NUMBER="RM-3420-PR",
MONTH=aug,
YEAR=1964,
KEYWORDS="computer networks; packet switching",
ABSTRACT="This Memorandum briefly reviews the distributed communications
network concept and compares it to the hierarchical or more centralized
systems.  The payoff in terms of survivability for a distributed
configuration in the cases of enemy attacks directed against nodes,
links, or combinations of nodes and links is demonstrated.  The
requirements for a future all-digital-data distributed network which
provides common user service for a wide range of users having different
requirements is considered.  The use of a standard format message block
permits building relatively simple switching mechanisms using an
adaptive store-and-forward routing policy to handle all forms of digital
data including ``real-time'' voice.  This network rapidly responds to
changes in the network status.  Recent history of measured network
traffic is used to modify path selection.  Simulation results are shown
to indicate that highly efficient routing can be performed by local
control without the necessity for any central--and therefore
vulnerable--control point.  A comparison is made between ``diversity of
assignment'' and ``perfect switching'' in distributed networks.  The
high degree of connectivity afforded allows the use of low-cost links so
unreliable as to be unusable in present type networks.",
URL="http://www.rand.org/publications/RM/RM3420/",
}

@TECHREPORT{Smit6408:Determination,
AUTHOR="Jr. Smith",
TITLE="Determination of Path-Lengths in a Distributed Network",
TYPE="Technical Report",
INSTITUTION="The RAND Corporation",
ADDRESS="Santa Monica, California",
NUMBER="RM-3578-PR",
MONTH=aug,
YEAR=1964,
ABSTRACT="Continues model simulation reported in Vol. II. The program
was rewritten in a more powerful computer language allowing examination
of larger networks. Modification of the routing doctrine by
intermittently reducing the input data rate of local traffic reduced to
a low level the number of message blocks taking excessively long paths.
The level was so low that a deterministic equation was required in lieu
of Monte Carlo to examine the now rare event of a long message block
path. The results of both the simulation and the equation agreed in the
area of overlapping validity.",
URL="http://www.rand.org/publications/RM/RM3578",
}

@TECHREPORT{Bara6408:Priority,
AUTHOR="Paul Baran",
TITLE="Priority, Precedence, and Overload",
TYPE="Technical Report",
INSTITUTION="The RAND Corporation",
ADDRESS="Santa Monica, California",
NUMBER="RM-3638-FR",
MONTH=aug,
YEAR=1964,
ABSTRACT="The creation of dynamic or flexible priority and precedence
structures within a conununication system handling a inixture of traffic
with different data rate, urgency, and importance levels is discussed.
The goal chosen is optimum utilization of the communications resource
within a seriously degraded and overloaded network.",
URL="http://www.rand.org/publications/RM/RM3638",
}

@TECHREPORT{Bara6408:History,
AUTHOR="Paul Baran",
TITLE="History, Alternative Approaches, and Comparisons",
TYPE="Technical Report",
INSTITUTION="The RAND Corporation",
ADDRESS="Santa Monica, California",
NUMBER="RM-3097-PR",
MONTH=aug,
YEAR=1964,
ABSTRACT="A background paper acknowledging the efforts of people in many
fields working toward the development of large communications systems
where system reliability and survivability are mandatory. A
consideration of terminology is designed to acquaint the reader with the
diverse, sometimes conflicting, definitions used. The evolution of the
distributed network is traced, and a number of earlier hardware
proposals are outlined.",
URL="http://www.rand.org/publications/RM/RM3097",
}

@TECHREPORT{Bara6408:Mini,
AUTHOR="Paul Baran",
TITLE="Mini-Cost Microwave",
TYPE="Technical Report",
INSTITUTION="The RAND Corporation",
ADDRESS="Santa Monica, California",
NUMBER="RM-3762-PR",
MONTH=aug,
YEAR=1964,
ABSTRACT="The technical feasibility of constructing an extremely
low-cost, all-digital, X- or Ku - band microwave relay system, operating
at a multi-megabit per second data rate, is examined. The use of newly
developed varactor multipliers permits the design of a miniature,
all-solid-state microwave repeater powered by a thermoelectric converter
burning L-P fuel.",
URL="http://www.rand.org/publications/RM/RM3762",
}

@TECHREPORT{Bara6408:Tentative,
AUTHOR="Paul Baran",
TITLE="Tentative Engineering Specifications and Preliminary Design for a
High-Data-Rate Distributed Network Switching Node",
TYPE="Technical Report",
INSTITUTION="The RAND Corporation",
ADDRESS="Santa Monica, California",
NUMBER="RM-3763-PR",
MONTH=aug,
YEAR=1964,
ABSTRACT="High-speed, or ``hot-potato,'' store-and-forward message block
relaying forms the heart of the proposed information transmission
system.  The Switching Nodes are the units in which the complex
processing takes place.  The node is described in sufficient engineering
detail to estimate the components required.  Timing calculations,
together with a projected implementation scheme, provide a strong
roundation for the belief that the construction and use of the node is
practical.",
URL="http://www.rand.org/publications/RM/RM3763",
}

@TECHREPORT{Bara6408:Multiplexing,
AUTHOR="Paul Baran",
TITLE="The Multiplexing Station",
TYPE="Technical Report",
INSTITUTION="The RAND Corporation",
ADDRESS="Santa Monica, California",
NUMBER="RM-3764-PR",
MONTH=aug,
YEAR=1964,
ABSTRACT="A description of the Multiplexing Stations which connect
subscribers to the Switching Nodes. The presentation is in engineering
detail, demonstrating how the network will simultaneously process
traffic from up to 1024 separate users sending a mixture of start-stop
teletypewriter, digital voice, and other synchronous signals at various
rates.",
URL="http://www.rand.org/publications/RM/RM3764",
}

@TECHREPORT{Bara6408:Security,
AUTHOR="Paul Baran",
TITLE="Security, Secrecy, and Tamper-Free Considerations",
TYPE="Technical Report",
INSTITUTION="The RAND Corporation",
ADDRESS="Santa Monica, California",
NUMBER="RM-3765-PR",
MONTH=aug,
YEAR=1964,
ABSTRACT="Considers the security aspects of a system of the type
proposed, in which secrecy is of paramount importance.  Describes the
safeguards to be built into the network, and evaluates the premise that
the existence of ``spies'' within the supposedly secure system must be
anticipated.  Security provisions are based on 'the belief that
protection is best obtained by raising the ``price'' of espied
information to a level which becomes excessive.  The treatment of the
subject is itself unclassified.",
URL="http://www.rand.org/publications/RM/RM3765",
}

@TECHREPORT{Bara6408:Cost,
AUTHOR="Paul Baran",
TITLE="Cost Estimate",
TYPE="Technical Report",
INSTITUTION="The RAND Corporation",
ADDRESS="Santa Monica, California",
NUMBER="RM-3766-PR",
MONTH=aug,
YEAR=1964,
ABSTRACT="A detailed cost estimate for the entire proposed system, based
on an arbitrary network configuration of 400 Switching Nodes, servicing
100,000 simultaneous users via 200 Multiplexing Stations. Assuming a
usable life of ten years, all costs, including operating costs, are
estimated at about \$60,000,000 per year.",
URL="http://www.rand.org/publications/RM/RM3766",
}

@TECHREPORT{Bara6408:Summary,
AUTHOR="Paul Baran",
TITLE="Summary Overview",
TYPE="Technical Report",
INSTITUTION="The RAND Corporation",
ADDRESS="Santa Monica, California",
NUMBER="RM-3767-PR",
MONTH=aug,
YEAR=1964,
ABSTRACT="Summarizes the system proposal, highlighting the more
important features. Considers the particular advantages of the
distributed network, and cournents on disadvantages. An outline is given
of the manner in which future research aimed at an actual implementation
of the network might be conducted. Together with the introductory
volume, it provides a general description of the entire system
concept.",
URL="http://www.rand.org/publications/RM/RM3767",
}

@TECHREPORT{Boeh6408:Simulation,
AUTHOR="Sharla P. Boehm and Paul Baran",
TITLE="Digital Simulation of Hot-Potato Routing in a Broadband
Distributed Communications Network",
TYPE="Technical Report",
INSTITUTION="The RAND Corporation",
ADDRESS="Santa Monica, California",
NUMBER="RM-3103-PR",
MONTH=aug,
YEAR=1964,
ABSTRACT="Describes a computer simulation of the message routing scheme
proposed. The basic routing doctrine permitted a network to suffer a
large number of breaks, then reconstitute itself by rapidly relearning
to make best use of the surviving links.",
URL="http://www.rand.org/publications/RM/RM3103",
}

@ARTICLE{Haso6411:Distribution,
AUTHOR="A. M. Hasofer",
TITLE="On the Distribution of the Time to First Emptiness of a Store
with Stochastic Input",
JOURNAL=jams,
VOLUME=4,
NUMBER=4,
PAGES="506-517",
MONTH=nov,
YEAR=1964,
KEYWORDS="stochastic processes; dam model",
}

@ARTICLE{Alan6412:Tables,
AUTHOR="J. D. Alanen and D. E. Knuth",
TITLE="Tables of finite fields",
JOURNAL="Indian journal of statistics, series A",
VOLUME=26,
MONTH=dec,
YEAR=1964,
REFERENCES=11,
KEYWORDS="Mathematics",
}