@ARTICLE{Kucz7207:Queues,
AUTHOR="Anatol Kuczura",
TITLE="Queues with Mixed Renewal and Poisson Inputs",
JOURNAL=bstj,
VOLUME=51,
NUMBER=6,
PAGES="1305-1326",
MONTH="July--August",
YEAR=1972,
KEYWORDS="queueing theory",
ABSTRACT="In a queueing system with two independent input streams, as
exists, for example, when first-routed and overflow traffic streams are
offered to a common sender-group, the state of the system encountered by
the two different types of customers upon their arrival will in general
be different. Consequently, in a system where delayed customers wait for
service, the service rendered to the individual streams may also be
different. The delay distribution in a single-server queue for each type
of customer is derived under the assumption that one stream is
Poissonian and the other is described by a renewal process. The
difference in service received by the two streams is examined with the
aid of numerical examples for two interarrival time distributions of the
renewal stream. We show for two cases that a practical indicator of
service received by the renewal customers is the coefficient of
variation of their interarrival time distribution. If the coefficient is
less than unity, then the renewal customers receive better service than
the Poissonian customers. The converse is true when the coefficient
exceeds unity. The stationary distribution of the number of busy servers
in an infinite-server system as seen by the two types of customers is
also derived.",
}
@BOOK{Page72:Queueing,
AUTHOR="E. S. Page",
TITLE="Queueing Theory in {OR}",
PUBLISHER="Butterworth",
ADDRESS="London",
YEAR=1972,
KEYWORDS="queueing theory",
}
@INPROCEEDINGS{Wrig72:One,
AUTHOR="Thomas Wright",
TITLE="A one pass hidden line remover for computer drawn three-space
objects",
BOOKTITLE=ssc,
ADDRESS="San Diego, California",
PAGES="261-267",
YEAR=1972,
KEYWORDS="computer graphics; perspective drawing; hidden-line removal;
solid modeling",
ABSTRACT="Computer drawing of three-dimensional objects for real time
simulation and architectural modeling has received much attention, but
little work has been done on developing methods for plotting output from
three-dimensional physics simulations such as weather and wind tunnel
models. In developing a method to graph these types of outputs, a
line-drawing algorithm was produced that can be applied to any
hidden-line type problem. This algorithm processes pictures stored in a
data structure more compatible with three-dimensional models and quite
different from previous formats. This format may be well suited to many
other problems as well. The method used is basically non-mathematical
and in many ways more closely simulates the way a solid object conceals
its hidden parts from an observer. The algorithm can take advantage of
saving three-space to two-space transformations so that movies can be
made efficiently. Half-tone implementations of this method are also
possible, but may not be woth the effort, as the line drawing version
produces a shading effect.",
}
@INPROCEEDINGS{Turo72:Party,
AUTHOR="Murray Turoff",
TITLE="Party-Line and Discussion: Computerized Conferencing Systems",
BOOKTITLE="Computer Communications: Impacts and Implications",
EDITOR="S. Winkler",
PUBLISHER="ACM",
ADDRESS="New York, New York",
PAGES="161-171",
NOTE="First International Conference on Computer Communications",
YEAR=1972,
KEYWORDS="computer conferencing",
}
@ARTICLE{Spra72:Loop,
AUTHOR="J. D. Spragins",
TITLE="Loop transmission systems -- mean value analysis",
JOURNAL=ieeecom,
VOLUME="COM-20",
YEAR=1972,
KEYWORDS="Loop system; LAN; performance evaluation",
}
@ARTICLE{Wald72:System,
AUTHOR="D. C. Walden",
TITLE="A system for interprocess communication in a resource sharing
computer network",
JOURNAL=cacm,
VOLUME=15,
PAGES="221-230",
YEAR=1972,
REFERENCES=10,
KEYWORDS="Resource management; computer network; time sharing",
ABSTRACT="also in \cite[p. 340-349]{Chu74:Advances}",
ANNOTE="A system of communication between processes in a time-sharing
system is described and the communication is extended so that it may be
used between processes distributed throughout a computer network. The
hypothetical application of the system to an existing network is
discussed.",
}
@ARTICLE{Will72:Hidden,
AUTHOR="H. Williamson",
TITLE="Hidden-line plotting",
JOURNAL=cacm,
VOLUME=15,
PAGES="100-102",
YEAR=1972,
KEYWORDS="Fortran; graphics; iterative method; application; method",
}
@ARTICLE{Wrig72:Visible,
AUTHOR="Thomas Wright",
TITLE="Visible surface plotting",
JOURNAL=cacm,
VOLUME=17,
PAGES="152-157",
YEAR=1972,
KEYWORDS="Fortran; graphics; application; method; human factors",
}
@ARTICLE{Yuen72:Upper,
AUTHOR="Chris Yuen",
TITLE="Upper bounds on Walsh-transforms",
JOURNAL=ieeetc,
VOLUME="C-21",
YEAR=1972,
KEYWORDS="Walsh-transform",
}
@ARTICLE{Baye72:Minimum,
AUTHOR="A. J. Bayes",
TITLE="A Minimum Variance Sampling Technique for Simulation Models",
JOURNAL=jacm,
VOLUME=19,
NUMBER=4,
PAGES="734-741",
YEAR=1972,
REFERENCES=4,
KEYWORDS="Simulation; simulation model; Markov chain; variance",
ANNOTE="A sampling theory of Markov chains is developed which allows
some statistics of the Markov state frequencies to be estimated with
minimum variance for a given sampling effort. A technique is presented
to allow the sampling frequency of the states of the simulation to be
independent of their natural frequency. By representing a simulation
model as a Markov chain, the theory is applied to estimate some
statistics of the simulation.",
}
@ARTICLE{Dell72:Features,
AUTHOR="F. R. E. Dell",
TITLE="Features of a Proposed Synchronous Data Network",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=3,
PAGES="499-503",
YEAR=1972,
KEYWORDS="Data network; hybrid switching; TDM; time division multiplex",
ANNOTE="A hybrid network is proposed which utilizes synchronous digital
transmission with a processor-controlled TDM switching structure.
Extensive multiplexing is used to increase transmission utiliza-tion and
reduce local area transmission costs.",
}
@ARTICLE{Hans72:Fast,
AUTHOR="E. Hänsler",
TITLE="A Fast Recursive Algorithm to Calculate the Reliability of a
Communication Network",
JOURNAL=ieeecom,
ADDRESS="Zürich, Switzerland",
VOLUME="COM-20",
NUMBER=3,
PAGES="637-640",
YEAR=1972,
REFERENCES=3,
KEYWORDS="Reliability; algorithm; communication network",
ANNOTE="This paper describes a recursive algorithm to calculate the
pro-bability that all paths between two nodes in a given network
areinterrupted. The probability that two nodes are disconnected is
expressed in terms of the probability that pairs of nodes are
disconnected in subnetworks smaller than the original one.
Thesesubnetworks can be considerably simplified, so that the computing
time decreases.",
}
@ARTICLE{Harr72:Note,
AUTHOR="C. R. Harris and P. G. Marlin",
TITLE="A Note on Feedback Queues with Bulk Service",
JOURNAL=jacm,
VOLUME=19,
NUMBER=4,
PAGES="727-733",
YEAR=1972,
REFERENCES=4,
KEYWORDS="Analysis; feedback queue; bulk service; ergodicity; state",
ANNOTE="This note provides some extensions of recent work by Delbrouck,
which dealt with a queuing model of a feedback system with
queue-dependent service times. The emphasis of this present work is upon
necessary and sufficient conditions for ergodicity, the re-lationship fo
the imbedded and general-time queuing processes, and the relaxation of
the extent of state dependence for the service times.",
}
@ARTICLE{Heac72:Two,
AUTHOR="H. C. Heacox and P. W. Purdom",
TITLE="Analysis of Two Time-Sharing Queueing Models",
JOURNAL=jacm,
VOLUME=19,
NUMBER=1,
PAGES="70-91",
YEAR=1972,
REFERENCES=8,
KEYWORDS="Analysis; time sharing; queueing system; model; round",
ANNOTE="Two time-sharing models are described. One is the conventional
round-robin model. The second model is a modification of the round-robin
system in which the amount of service per pass depends on the rate at
which programs arrive in the system. The models are analzyed under the
assumption of constant, nonzero overhead when the processor swaps one
program for another. Expressions are derived for the mean waiting time
and system cost.",
}
@ARTICLE{Hemm72:Analytical,
AUTHOR="J. G. Hemmady",
TITLE="An Analytical Methodology for Solving Complex Stochastic Network
Problems",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=2,
PAGES=87,
YEAR=1972,
REFERENCES=8,
KEYWORDS="Stochastic system; network; delay analysis; Laplace",
ANNOTE="An analytical methodology (GERT) using the linear signal flow-
graph topology is recommended for solution of problems related to
complex stochastic networks, as a convenient alternative to commonly
used Monte Carlo simulation technique. The novelty of this paper is in
the use Laplace transforms in defining the $w$ function associated with
each branch of the network, which permits solution of the network in its
entirety.",
}
@ARTICLE{Konh72:Service,
AUTHOR="A. G. Konheim and Bernd Meister",
TITLE="Service in a Loop System",
JOURNAL=jacm,
VOLUME=19,
NUMBER=1,
PAGES="92-108",
YEAR=1972,
REFERENCES=6,
KEYWORDS="Loop system; queue length; virtual waiting time; random",
ANNOTE="The statistical behaviour of a loop service system is studied.
The system consists of a main station, a server and $N$ stations
arranged on a loop. Customers arrive at each station according to a
random process. The server makes successive tours along theloop bringing
customers from the $N$ stations to the main station. Two related
measures of the grade of service are considered: theaverage queue length
and virtual waiting time at each station.",
}
@ARTICLE{Moor72:Computational,
AUTHOR="F. R. Moore",
TITLE="Computational Model of a Closed Queuing Network with Exponential
Servers",
JOURNAL=ibmjrd,
VOLUME=16,
PAGES="567-572",
YEAR=1972,
REFERENCES=4,
KEYWORDS="Closed queueing network; multiserver; model; exponential",
ANNOTE="A simplification and extension to Gordon and Newell's approach
to closed queueing networks is derived. The equations, valid
forexponential servers, with one server being a multiserver, greatly
reduce the computation time required by the former approach. In
addition, simplified equations for the details of the queueing network
are derived.",
}
@ARTICLE{Rech72:Queuing,
AUTHOR="R. N. Rechtschaffen",
TITLE="Queuing simulation using a random number generator",
JOURNAL=ibmsj,
VOLUME=3,
PAGES="255-271",
YEAR=1972,
REFERENCES=4,
KEYWORDS="Queueing system; simulation; random number generation; real
time",
ANNOTE="This paper discusses the application of a random number
generator to the simulaton of waiting-line (queueing) phenomena in
real-time computer systems. Introduced are the principles of random
number generator simulation together with examples, the results of which
are compared with theoretical results.",
}
@ARTICLE{West72:Loop,
AUTHOR="L. P. West",
TITLE="Loop-Transmission Control Structures",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=3,
PAGES="531-539",
YEAR=1972,
REFERENCES=3,
KEYWORDS="Communication network; loop system; transmission; control",
ABSTRACT="For a communication loop connecting a multiplicity of
terminals to a central processing location, alternative data-link
control techniques are defined. An upper bound on allowable loadingof
the loop is established for each of these and compared to that of a
perfect data-link control.",
}
@ARTICLE{Ande72:Modeling,
AUTHOR="H. A. Anderson and R. G. Sargent",
TITLE="Modeling, evaluation, and performance measurements of
time-sharingcomputer systems",
JOURNAL=acmcr,
PAGES="603-608",
YEAR=1972,
REFERENCES=264,
KEYWORDS="Time sharing; measurement; performance evaluation; modeling;
prediction; bibliography",
ANNOTE="This bibliography is divided into five sections: bibliographies
and survey articles on time-sharing systems modeling and evaluation
dissertations on time-sharing systems modeling and evaluation references
on modeling time-sharing-systems references on performance measurement
and evaluation of time-sharing systems books published on time-sharing
systems.",
}
@ARTICLE{Ande72:Simulated,
AUTHOR="R. R. Anderson and J. F. Hayes and D. N. Sherman",
TITLE="Simulated performance of a ring-switched data network",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=3,
PAGES="576-591",
YEAR=1972,
REFERENCES=11,
KEYWORDS="Computer network; LAN; ring; performance evaluation;
simulation",
ANNOTE="The report describes a simulation study of a single ring of
users undertaken for the dual purpose to observe and evaluate such
quantities as message delay, buffer occupancy and busy-idle periods. The
study focused on homogenous users although other user populations are
discussed. Other aspects examined are effects of quantization of message
segments, line utilization, and system capture by competing communities
of users.",
}
@ARTICLE{Baha72:Multilevel,
AUTHOR="E. Bahary and P. Kolesar",
TITLE="Multilevel bulk service queues",
JOURNAL=or,
VOLUME=20,
PAGES="406-420",
YEAR=1972,
REFERENCES=12,
KEYWORDS="M/GX/1; queue length; imbedded Markov chain; bulk service;
service level; stationary process",
}
@PHDTHESIS{Bans72:Optimal,
AUTHOR="P. P. Bansal",
TITLE="Optimal network flow capacity expansion under concave cost",
SCHOOL="University Microfilms, Ann Arbor, Michigan, USA",
PAGES=105,
YEAR=1972,
REFERENCES=13,
KEYWORDS="Network flow; optimization",
ANNOTE="The problem of optimally allocating is given budget to the
various arcs of a single source and sink directed network for the
purpose of maximizing the network flow capacity is considered. The
initial capacity of each arc is given, and upon incrementing the
capacity of an arc by a positive amount, a cost is incurred. These
incremental capacity cost function are assumed to be concave and not
linear.",
}
@ARTICLE{Bhat72:Two,
AUTHOR="U. Narayan Bhat",
TITLE="Two measures for describing queue behavior",
JOURNAL=or,
VOLUME=20,
PAGES="357-372",
YEAR=1972,
REFERENCES=6,
KEYWORDS="M/G/1; GI/M/1; utilization; transient behaviour;
effectiveness",
ANNOTE="This paper defines two finite time measures that describe the
transient behavior of queueing systems and investigates their
convergence properties in some detail. These measures are: (i) a
utilization factor that gives the fraction of time during which the
system is expected to be busy, and (ii) an effectiveness factor that
gives the ratio of the lengths of time during which the system is
expected to be busy and idle, respectively.",
}
@ARTICLE{Bhat72:Statistical,
AUTHOR="U. Narayan Bhat and S. V. Rao",
TITLE="A statistical technique for the control of traffic intensity in
the queueing systems {M/G/1} and {GI/M/1}",
JOURNAL=or,
VOLUME=20,
PAGES="955-966",
YEAR=1972,
REFERENCES=8,
KEYWORDS="M/G/1; GI/M/1; traffic intensity; control",
ANNOTE="This paper presents a statistical technique for the control of
the traffic intensity in single-server queueing systems with (i) poisson
arrivals and general service times and (ii) recurrent arrivals and
exponential service times. The procedure is such that the system is
readjusted only if the number of customers in the system either falls
and stays beyond the upper control limit longer than a preassigned
number of consecutive transitions or fal",
}
@ARTICLE{Bloo72:Low,
AUTHOR="P. Bloomfield and D. R. Cox",
TITLE="A low traffic approximation for queues",
JOURNAL=jap,
VOLUME=9,
PAGES="832-840",
YEAR=1972,
REFERENCES=6,
KEYWORDS="low traffic approximation; busy period; waiting time",
ANNOTE="A general procedure is outlined for obtaining lower bounds and
approximations to the amount of congestion in queues with low traffic.
Some detailed formulae are given for a number of single-server systems
and compared with exact solutions where available. Results are also
given for a discrete time system in which departures clash with new
arrivals.",
}
@ARTICLE{Brec72:Zyklische,
AUTHOR="W. Brecht",
TITLE="Zyklische Schieberegister",
JOURNAL=ntz,
PAGES="408-",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Shift register sequences; RNG",
}
@ARTICLE{Brum72:Generalization,
AUTHOR="S. L. Brumelle",
TITLE="A generalization of {L=LAMBDA*W} to moments of queue length and
waiting times",
JOURNAL=or,
VOLUME=20,
PAGES="1127-1136",
YEAR=1972,
REFERENCES=8,
KEYWORDS="GI/G/N; queue length; waiting time; moment; Little's formula",
ANNOTE="The well known formula $L=\Lambda*W$ relates the time-average
number in queue to the expected wait in queue of a customer. This paper
specializes a more general formula, denoted by $H=\Lambda*G$, in order
to obtain relations between moments of $L$ and $W$ other than the first.
The basic queue considered is G/G/K with stationary input. The special
case where the arrival times form a renewal process and the more special
case where they are a Poisson proces",
}
@ARTICLE{Cant72:Switching,
AUTHOR="D. G. Cantor",
TITLE="On non-blocking switching networks",
JOURNAL=networks,
VOLUME=1,
PAGES="367-377",
YEAR=1972,
REFERENCES=2,
KEYWORDS="Switching network",
}
@ARTICLE{Cart72:Queues,
AUTHOR="G. M. Carter and R. B. Cooper",
TITLE="Queues with service in random order",
JOURNAL=or,
VOLUME=20,
NUMBER=1,
PAGES="389-405",
YEAR=1972,
REFERENCES=16,
KEYWORDS="Random; GI/M/N; M/G/1; waiting time; distribution",
ANNOTE="We consider two models, the GI/M/S queue and the M/G/1 queue, in
which waiting customers are served in random order. For each model we
derive expressions for the calculation of the stationary waiting-time
distribution function. Our methods differ from those of previous authors
in that we do not use transforms, and consequently our results may be
better suited for calculation. We illustrate our methods by deriving
previously known results for",
}
@INPROCEEDINGS{Chea72:Laboratory,
AUTHOR="T. E. Cheatham and B. Wegbreit",
TITLE="A laboratory for the study of automating programming",
BOOKTITLE=sjcc,
VOLUME=40,
PAGES="11-21",
YEAR=1972,
REFERENCES=39,
KEYWORDS="Software; program construction; runtime/storage efficiency;
theorem prover; database; program transformation",
ANNOTE="We are concerned in this paper with facilities, tools, and
techniques for automating programming.",
}
@ARTICLE{Chu72:Buffer,
AUTHOR="Wesley W. Chu and Leo C. Liang",
TITLE="Buffer behaviour for mixed input traffic and single constant
output rate",
JOURNAL=ieeecom,
VOLUME="COM-20",
PAGES="230-235",
YEAR=1972,
REFERENCES=6,
KEYWORDS="Buffer memory; MB/D/1; approximation; method; loss system",
ANNOTE="A queueing model with limited waiting room (buffer), mixed input
traffic (poisson and compound poisson arrivals), and constant service
rate is studied.",
}
@ARTICLE{Cohn72:Random,
AUTHOR="C. E. Cohn",
TITLE="The performance of random-bit generators",
JOURNAL="Simulation",
PAGES="234-",
YEAR=1972,
KEYWORDS="Rng",
}
@ARTICLE{Cole72:Measurements,
AUTHOR="G. D. Cole",
TITLE="Performance Measurements on the {ARPA} Computer Network",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=3,
PAGES="630-636",
YEAR=1972,
KEYWORDS="network measurement; measurement tool; data gathering;
reduction",
}
@ARTICLE{Cox72:Dynamic,
AUTHOR="Donald Cox and D. O. Reudink",
TITLE="Dynamic Channel Assignment in Two-Dimensional Large-Scale Mobile
radio Systems",
JOURNAL=bstj,
VOLUME=51,
NUMBER=7,
PAGES="1611-1629",
YEAR=1972,
KEYWORDS="MAT; DCA; dynamic channel assignment; simulation",
ANNOTE="classical DCA investigation",
}
@INCOLLECTION{Cox72:Statistical,
AUTHOR="D. R. Cox",
TITLE="The statistical analysis of dependencies in point processes",
BOOKTITLE="Stochastic Processes",
EDITOR="P. A. W.",
PUBLISHER="Wiley",
ADDRESS="New York",
PAGES="55-66",
YEAR=1972,
REFERENCES=6,
KEYWORDS="Point process; renewal process; stochastic process; regression
coefficient",
ABSTRACT="A class of point processes is considered in which the simple
hazard function of a renewal process or of a Poisson process is
perturbed by a factor depending on quantities thought to influence the
probability of occurrence, each quantity being combined with an unknown
regression coefficient. Inference about the unknown regression
coefficients is achieved via a conditional likelihood, leading in
particular to asymptotic significance tests",
}
@BOOK{Cox72:Theory,
AUTHOR="D. R. Cox and H. D. Miller",
TITLE="The theory of stochastic processes",
PUBLISHER="Chapman and Hall",
YEAR=1972,
KEYWORDS="Statistics; time series analysis",
}
@ARTICLE{Dahi72:Goodness,
AUTHOR="R. C. Dahiya and J. Gurland",
TITLE="Goodness of fit tests for the gamma and exponential
distributions",
JOURNAL="Technometrics",
VOLUME=14,
NUMBER=3,
PAGES="791-801",
YEAR=1972,
REFERENCES=7,
KEYWORDS="random number generation; method; random variate generation;
exponential distribution; Gamma distribution; statistical test",
ANNOTE="Goodness of fit tests based on generalized minimum chi**2
techniques are developed for the gamma and exponential distributions.
The power of these tests has been found for several alternative families
of distributions by utilizing the asymptotic non-null distribution of
the test statistic. The tests behave very well for the types of
alternatives considered here. Applications to some failure data of
Proschan (1963) are included for illustrative",
}
@ARTICLE{Dahm72:Erzeugung,
AUTHOR="U. Dahm",
TITLE="Die Erzeugung von normalverteilten Zufallszahlen",
JOURNAL=aninf,
PAGES="466-",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Rng",
}
@ARTICLE{Fran72:Topological,
AUTHOR="H. Frank and Wu Chou",
TITLE="Topological optimization of computer networks",
JOURNAL=ieeeproc,
VOLUME=60,
NUMBER=11,
PAGES="1385-1397",
YEAR=1972,
REFERENCES=59,
KEYWORDS="Computer network; network topography; arpanet",
ANNOTE="Modeling, analysis, and design problems and methodologies for
centralized and distributed computer-communication networks ar e
discussed. The basic problem is to specify the location and capacity of
each communication link within the network. The design objective is to
provide a low-cost network which satisfies constraints on response time,
throughput, reliability, and other parameters. Fundamental network
models for queueing and reliability",
}
@PHDTHESIS{Fult72:Adaptive,
AUTHOR="G. L. Fultz",
TITLE="Adaptive routing techniques for message switching
computer-communication networks",
SCHOOL="University of california",
ADDRESS="Los Angeles, California",
PAGES=417,
YEAR=1972,
REFERENCES=100,
KEYWORDS="Computer network; routing algorithm; ARPAnet; network flow;
network delay; message switching; adaptive routing",
ANNOTE="this report considers adaptive routing techniques applicable to
message switching computer-communication networks such as the a rpa
network. the emphasis of this research is on the prediction of average
message delay and the specification, implementation and evaluation of
various classes of message routing procedures.",
}
@ARTICLE{Gall72:Waiting,
AUTHOR="Donald A. Gall and H. R. Mueller",
TITLE="Waiting-Time Distributions and Buffer Overflow in Priority
Systems",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=5,
PAGES="865-877",
YEAR=1972,
REFERENCES=19,
KEYWORDS="Superposition; Analysis; Priority",
}
@BOOK{Gerk72:Rechnergesteuerte,
AUTHOR="P. Gerke",
TITLE="Rechnergesteuerte Vermittlungssysteme",
PUBLISHER="Springer-Verlag",
ADDRESS="Berlin",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Switching system; switching network",
}
@ARTICLE{Grah72:Perspective,
AUTHOR="N. Y. Graham",
TITLE="Perspective drawing of surfaces with hidden line elimination",
JOURNAL=bstj,
VOLUME=51,
NUMBER=4,
PAGES="843-861",
YEAR=1972,
REFERENCES=7,
KEYWORDS="Design; method; process interaction; graphics;
three-dimensional plot; iterative method; polynomial; efficient computer
algorithm",
ANNOTE={An efficient computer algorithm is described for the perspective
drawing of a wide class of surfaces. The algorithm automatically
computes and eliminates "hidden lines". The number of computations in
the algorithm growth linearly with the number of sample points on the
surface to be drawn. An analysis of the algorithm is presented, and
extensions to certain multi-valued functions are indicated. The
algorithm is implemented and tested on two},
}
@INPROCEEDINGS{Grie72:Experience,
AUTHOR="J. Griesmer and R. Jenks",
TITLE="Experience with an online symbolic math. system {SCRATCHPAD}",
BOOKTITLE="Online",
YEAR=1972,
KEYWORDS="Formula manipulation",
}
@ARTICLE{Hash72:Multiqueue,
AUTHOR="O. Hashida",
TITLE="Analysis of multiqueue",
JOURNAL=recl,
VOLUME=20,
PAGES="189-199",
YEAR=1972,
REFERENCES=9,
KEYWORDS="Queueing system; polling; gated service; exhaustive service",
}
@ARTICLE{Hash72:Line,
AUTHOR="O. Hashida and K. Ohara",
TITLE="Line accommodation capacity of a communication control unit",
JOURNAL=recl,
VOLUME=20,
PAGES="231-239",
YEAR=1972,
REFERENCES=3,
KEYWORDS="Queueing system; polling",
}
@ARTICLE{Herz72:Preemption,
AUTHOR="U. Herzog",
TITLE="Preemption-distance priorities in real-time computer systems",
JOURNAL=ntz,
VOLUME=25,
PAGES="201-203",
YEAR=1972,
KEYWORDS="Queueing system; priority; M/EK/1; preHOL priority; queue
length; waiting time",
ANNOTE="For operating real-time computer systems it is necessary to
serve special pressing demands with preemptive priorities. On the other
hand, there are a lot of demands being less urgent which do not justify
preemption. Sometimes even preemptive priorities are nonsensical.",
}
@TECHREPORT{Herz72:Klassifizierung,
AUTHOR="U. Herzog and P. J. Kühn and A. Zeh",
TITLE="Klassifizierung und Analyse von Verkehrsmodellen für das
Ablaufgeschehen in Rechensystemen",
INSTITUTION="Inst. NVDV, Universität Stuttgart und Nachrichtentechnische
Fachberichte, Darmstadt, 1972",
ADDRESS="Stuttgart",
PAGES="1-18",
YEAR=1972,
LANGUAGE="German",
REFERENCES=73,
KEYWORDS="Classification; model; survey; Queueing network; performance
evaluation; time sharing; queueing discipline; bibliography",
ANNOTE="Die vielfalt der Probleme, die bei modernen Rechnersystemen au
ftreten, kann man nur dann befriedigend lösen, wenn bei der Entwicklung
von Hardwarestrukturen und Softwarestrukturen verkehrsmässige
Gesichtspunkte berücksichtigt werden. Verkehrsmässige Untersuchungen
ermöglichen eine Bestimmung maschineninterner Engpässe sowie Angaben
über die Gesamtleistungsfähigkeit eines Rechnersystems.",
}
@TECHREPORT{Hill72:Tables,
AUTHOR="F. S. Hillier and F. D. Lo",
TITLE="Tables for multiple-server queueing systems involving {Erlang}
distributions",
INSTITUTION="Department of Operations Research and Department of
statistics, Stanford University",
ADDRESS="Stanford, California",
NUMBER=149,
PAGES="1-200",
YEAR=1972,
REFERENCES=12,
KEYWORDS="Queueing theory; Erlang distribution; reference; table",
ANNOTE="Recent theoretical work has provided the means whereby numeric
al results can be obtained on the steady-state behavior of mult
iple-server queueing systems involving Erlang (gamma) distributions.
This report presents the results of a comprehensive computational
project undertaken to obtain these data. One set of tables gives the
complete probability distribution of the number of customers in the
system for 16 different values of $\rho$ (utilization)",
}
@ARTICLE{Hook72:Priority,
AUTHOR="J. A. Hooke",
TITLE="A priority queue with low-priority arrivals general",
JOURNAL=or,
VOLUME=20,
PAGES="373-380",
YEAR=1972,
REFERENCES=17,
KEYWORDS="PREHOL priority; G/G/1; M/G/1; waiting time; heavy traffic
approximation",
ANNOTE="This paper considers a single-server queue with two priority
classes of customers. High-priority arrivals are assumed to be poisson,
but interarrival times for low-priority customers are allowed to have a
general distribution. Under either the head-of-the line or
preemptive-resume discipline, a formal solution is obtained for the
Laplace-Stieltjes transform of the steady-state distribution of the
low-priority waiting time. A limit theorem for",
}
@ARTICLE{Hook72:Heavy,
AUTHOR="J. A. Hooke",
TITLE="Some heavy-traffic limit theorems for a priority queue with
general arrivals",
JOURNAL=or,
VOLUME=20,
PAGES="381-388",
YEAR=1972,
REFERENCES=21,
KEYWORDS="PREHOL priority; G/G/1; heavy traffic approximation",
ANNOTE="This paper considers a single-server queue with two priority
classes of customers. Interarrival times and service times for the two
classes of customers are assumed to form four mutually independent
renewal processes determined by general distributions. In two cases for
which a steady state does not exist, limit theorems are obtained for the
low-priority waiting time and for the total uncompleted service time of
all customers in the system at",
}
@ARTICLE{Hwan72:Rearrangeability,
AUTHOR="F. K. Hwang",
TITLE="Rearrangeability of multi-connection three-stage Clos networks",
JOURNAL=networks,
VOLUME=2,
PAGES="301-310",
YEAR=1972,
REFERENCES=6,
KEYWORDS="Switching network; CLOS; rearrangement",
}
@ARTICLE{Kaba72:Scheduling,
AUTHOR="I. W. Kabak",
TITLE="On scheduling the delivery of babies",
JOURNAL=or,
VOLUME=20,
NUMBER=1,
PAGES="19-23",
YEAR=1972,
REFERENCES=3,
KEYWORDS="M/Ek/1; application",
ANNOTE="With the advent of elective induction of labor, the management
of an obstetrical practice has assumed the problem of scheduling the
delivery of babies. The problem can be thought of as a delay queueing
system with a modified finite-source arrival pattern. This paper
analyzes the case of a single server to determine the probability of
interference (viz. the obstetrician must serve two or more patients
simultaneously), solves the special case of",
}
@ARTICLE{Klei72:Tight,
AUTHOR="L. Kleinrock and R. R. Muntz and J. Hsu",
TITLE="Tight bounds on the average response time for time-shared
computer systems",
JOURNAL="Information Processing",
PUBLISHER="North Holland",
VOLUME=71,
PAGES="124-133",
YEAR=1972,
REFERENCES=14,
KEYWORDS="Queueing system; time in system; queueing discipline; M/G/1;
feedback; M/E2/1; M/H2/1; M/U/1; solved exercise; conservation law;
monotony",
ANNOTE="In this paper, some fundamental properties are established which
apply to the average response time functions for all time-shared
computer systems. The first property is one of monotonicity. The second
is a conservation law which provides insight into the trade-offs
available as one varies the response time function by changing the
scheduling algorithm. The main thrust of the paper is to establish tight
upper and lower bounds on the average res",
}
@TECHREPORT{Kuhn72:Berechnung,
AUTHOR="P. J. Kühn",
TITLE="Über die Berechnung der Wartezeiten in Vermittlungssystemen und
Rechnersystemen",
TYPE="UniS-IND-Bericht",
INSTITUTION="University of Stuttgart",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Queueing system",
}
@INPROCEEDINGS{Lang72:Sampled,
AUTHOR="M. Langenbach-Belz",
TITLE="Sampled queuing systems",
BOOKTITLE="symposium on computer communications networks and
teletraffic",
ADDRESS="Brooklyn, New York",
YEAR=1972,
KEYWORDS="Queueing system",
}
@ARTICLE{Mill72:Bibliography,
AUTHOR="E. F. Miller",
TITLE="Bibliography on techniques of computer performance analysis",
JOURNAL=ieeecomp,
PAGES="39-47",
YEAR=1972,
REFERENCES=130,
KEYWORDS="Bibliography; performance evaluation; hardware monitor;
computer system; method; simulation; operating system; software;
benchmark; parallel computing; measurement; system design; instruction
mix; mathematical model; statistical technique",
}
@ARTICLE{Mill72:Detectors,
AUTHOR="John M. Miller and J. B. Thomas",
TITLE="Detectors for discrete-time signals in non-Gaussian noise",
JOURNAL=ieeeit,
VOLUME="IT-18",
PAGES="241-250",
YEAR=1972,
REFERENCES=16,
KEYWORDS="Distribution function; normal distribution; signal detection",
ANNOTE="The structure and performance of a class of nonlinear detectors
for discrete-time signals in additive white noise are investigated. The
detectors considered consist of a zero-memory nonlinearity (ZNL)
followed by a linear filter whose output is compared with a threshold.
That this class of detectors is a reasonable one to study is apparent
from the fact that both the neyman-pearson optimum and the locally
optimum (i.e., weak-signal optimum) det",
}
@ARTICLE{Nanc72:Bibliography,
AUTHOR="R. E. Nance and C. Overstreet",
TITLE="A bibliography on random number generation",
JOURNAL=acmcr,
VOLUME=13,
PAGES="495-508",
YEAR=1972,
REFERENCES=491,
KEYWORDS="random number generation; bibliography",
}
@ARTICLE{Nied72:Strukturelle,
AUTHOR="J. Niedereichholz and I. Bey",
TITLE="Strukturelle Eigenschaften von Simulationsmodellen",
JOURNAL=aninf,
PAGES="97-",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Simulation; modeling",
}
@ARTICLE{ODon72:Queue,
AUTHOR="T. M. O'Donovan",
TITLE="The queue {M/G/1} with the semipreemptive-priority queueing
discipline",
JOURNAL=or,
VOLUME=20,
PAGES="434-439",
YEAR=1972,
REFERENCES=6,
KEYWORDS="M/G/1; preemptive priority; SRPT; shortest remaining
processing time",
ANNOTE="This paper studies a priority queueing model in which the
processing times of jobs are known upon arrival and preemption without
loss of time or processing already accomplished is possible. Jobs are
classified into $K$ types according to their lengths, priority is
assigned to them according to type and the length of processing
remaining, and the paper obtains the expected conditional response times
for jobs of each type.",
}
@ARTICLE{Oswa72:Haupttechniken,
AUTHOR="B. Oßwald",
TITLE="Haupttechniken der Leistungsmessung einer {EDVA} und ihre
Bewertung",
JOURNAL=aninf,
PAGES="373-378",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Simulation; measurement",
}
@ARTICLE{Parn72:Criteria,
AUTHOR="D. L. Parnas",
TITLE="On the criteria to be used in decomposing systems into modules",
JOURNAL=cacm,
VOLUME=15,
PAGES="1053-1058",
YEAR=1972,
KEYWORDS="Software engineering",
}
@BOOK{Rohl72:PASCAL,
AUTHOR="H. Rohlfing",
TITLE="{PASCAL}",
PUBLISHER="BI Hochschultaschenbuch",
VOLUME=756,
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Programming language; PASCAL",
}
@INPROCEEDINGS{Rudi72:Buffer,
AUTHOR="Harry Rudin",
TITLE="Buffer packet-switching: a queue with clustered arrivals",
BOOKTITLE=iss,
PAGES="259-265",
YEAR=1972,
REFERENCES=8,
KEYWORDS="Computer network; packet switching; simulation; buffer
length",
ANNOTE="This paper describes an analysis (relying heavily on simulation
techniques) of the performance of the collection- (or lowest
hierarchical level- ) node in a data-transmission network using the
technique of buffered packet-switching. The goal was to ascertain how
significant the savings in message-transmission time and nodal storage
capacity might be if an incoming message were sent in piecewise fashion
(i.e., packet by packet) to the next node.",
}
@ARTICLE{Schr72:Solving,
AUTHOR="L. Schrage",
TITLE="Solving resource-constrained network problems by implicit
enumeration-preemptive case",
JOURNAL=or,
VOLUME=20,
PAGES="668-677",
YEAR=1972,
REFERENCES=9,
KEYWORDS="Network theory; resource management; process management;
preemptive scheduling",
ANNOTE="This paper treats the scheduling problem that has both
precedence constraints (of a general form as in pert-cpm problems) and
resource constraints (of the form in the general job-shop scheduling
problem). Preemptive-resume without changeover times is allowed. An
efficient procedure for enumerating all active schedules is given. For
the objective of minimizing the project length, a branch-and-bound
algorithm is developed by adding a bounding",
}
@ARTICLE{Schr72:Bildverkehr,
AUTHOR="F. Schreiber",
TITLE="Bildverkehr Mensch-Rechner für Dialog und Dokumentauskunft",
JOURNAL=er,
VOLUME=14,
NUMBER=2,
PAGES="53-61",
YEAR=1972,
LANGUAGE="German",
REFERENCES=28,
KEYWORDS="Graphics; presentation layer; information system",
ANNOTE="Nach einem überblick über ein Rechensystem für Bildverkehr
werden verschiedene zu übertragende Bildarten klassifiziert:
alpha-numerischer text, Symbolgraphik und Kurvengraphik sowie
Grauwertbilder (photos).",
}
@ARTICLE{Stid72:L,
AUTHOR="S. Stidham",
TITLE="{L=LAMBDA*W:} A discounted analogue and a new proof",
JOURNAL=or,
VOLUME=20,
PAGES="1115-1126",
YEAR=1972,
REFERENCES=24,
KEYWORDS="GI/G/N; queue length; waiting time; Little's formula; proof",
ANNOTE="This paper presents a discounted analogue to $L=\Lambda*W$,
together with an application to a queueing optimization problem. This
discounted analogue is used to construct a new proof of the classical
(limiting average) version of $L=\Lambda*W$, using as hypotheses only
that the limiting averages of Lambda and $W$ exist and are finite.",
}
@ARTICLE{Bula72:Ubersichtsschaltbild,
AUTHOR="A. V. Bulanov and O. N. Ivanova",
TITLE="Übersichtsschaltbild und Gruppierungsschema einer
quasielektronischen automatischen Vermittlungszentrale großer
Kapazität",
JOURNAL=fernmeldetechnik,
VOLUME=12,
NUMBER=4,
PAGES="194-196",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Link system",
}
@ARTICLE{Coha72:Planung,
AUTHOR="P. Cohausz",
TITLE="Planung, Unterlagen, Leitweglenkung, Gebührenerfassung - Die
Fernsprechanlagen der Robert Bosch {GmbH} in Stuttgart",
JOURNAL="Siemens Informationen Fernsprech-Vermittlungstechnik",
ADDRESS="München",
VOLUME=8,
NUMBER=1,
PAGES="29-35",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
}
@ARTICLE{Fuji72:Queueing,
AUTHOR="M. Fujiki",
TITLE="Queueing-Delay Formula for Common-Channel Signaling Systems",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=4,
YEAR=1972,
KEYWORDS="Delay system",
}
@ARTICLE{Grab72:Telecommunications,
AUTHOR="E. A. Grabhorn and A. B. Kamman and S. L. Mathison and H. L.
Pastan",
TITLE="What {US} telecommunications can learn from other countries",
JOURNAL="Telephony",
VOLUME=17,
NUMBER=2,
PAGES="22-23, 26-27",
YEAR=1972,
KEYWORDS="Loss system",
ANNOTE="Vermittlungssysteme; Vergleiche",
}
@MASTERSTHESIS{Henr72:Untersuchung,
AUTHOR="L. Henrich",
TITLE="Untersuchung zur Erstellung von Dimensionierungsrichtlinien für
Codewahlsätze und Codewahlübertragungen",
SCHOOL="Institut für elektr. Nachrichtentechnik der Rheinisch
Westfälischen Technischen Hochschule Aachen",
ADDRESS="Aachen, Germany",
VOLUME="aug",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
}
@ARTICLE{Hofs72:Einflu,
AUTHOR="H. Hofstetter and E. Rokitta",
TITLE="Der Einfluß des Wegeauswahlverfahrens auf die Verkehrsleitstung
eines {PCM-Koppelnetzes}",
JOURNAL=ntz,
VOLUME=25,
NUMBER=2,
YEAR=1972,
LANGUAGE="German",
KEYWORDS="TDM; time division multiplex",
}
@ARTICLE{Inos72:Time,
AUTHOR="H. Inose and T. Saito and K. Ichijo",
TITLE="Time-Division Switching Network With Partial-Access Pulse
Shifters Performing Serial-Parallel Conversion",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=4,
PAGES="762-768",
YEAR=1972,
KEYWORDS="TDM; time division multiplex",
ANNOTE="Fernsprechtechnik, Netzwerkoptimierung,
Blockierungswahrscheinlichkeit, Zeitvielfach-Vermittlungstechnik",
}
@ARTICLE{Isph72:Model,
AUTHOR="U. Isphording",
TITLE="A Model for Calculating the Reliability of Supervised Systems",
JOURNAL=siemensfe,
VOLUME="1/1/3B/2Q",
PAGES="133-138",
YEAR=1972,
KEYWORDS="Gos",
ANNOTE="Betriebszuverlässigkeit, Bertriebsüberwachung, ansehen",
}
@ARTICLE{John72:Betriebssystem,
AUTHOR="H. H. Johnson and B. R. Shearer",
TITLE="Ein Betriebssystem für verschiedenartige, parallel anfallende
Programme",
JOURNAL="Regelungstechnische Praxis und Prozessrechentechnik",
VOLUME=14,
NUMBER=4,
PAGES="119-125",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Data traffic; computer network",
ANNOTE="Betriebssystem, Fernsprechvermittlung, Warteschlangentheorie",
}
@ARTICLE{Jung72:Comparison,
AUTHOR="M. M. Jung and J. de Boer",
TITLE="Comparison of the traffic handling capacity of subscriber
transpositions",
JOURNAL=ptr,
ADDRESS="Eindhoven",
VOLUME=30,
NUMBER=4,
PAGES="167-172",
YEAR=1972,
KEYWORDS="Link system",
ANNOTE="Verkehrsleistung, Transpositionsschaltungen, Berechnung,
Nachbildungen",
}
@ARTICLE{Katz72:Koppelanordnung,
AUTHOR="L. Katzschner",
TITLE="Koppelanordnung zur Realisierung von Prioritäten in
Verlustsystemen der Vermittlungstechnik",
JOURNAL=ntz,
VOLUME=25,
NUMBER=1,
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Delay system",
}
@ARTICLE{Kumm72:Model,
AUTHOR="K. K mmerle",
TITLE="A Model for the I/O-Channel Traffic in Computer Systems",
JOURNAL=ntz,
NUMBER=3,
YEAR=1972,
KEYWORDS="Delay system",
}
@ARTICLE{Neal72:Equivalent,
AUTHOR="S. R. Neal",
TITLE="The Equivalent Group Method for Estimating the Capacity of
Partial-Access Service Systems, which Carry Overflow traffic",
JOURNAL=bstj,
VOLUME=51,
NUMBER=3,
YEAR=1972,
KEYWORDS="Overload control; flow control; communication network",
}
@ARTICLE{Pall72:Elektronische,
AUTHOR="R. Pallini and M. Buchmayer",
TITLE="Elektronische Verkehrsmeßeinrichtung {MET} 2",
JOURNAL=ericssonr,
VOLUME=49,
NUMBER=3,
PAGES="86-91",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Measurement",
}
@ARTICLE{Pots72:Generatoren,
AUTHOR="K. Potschka",
TITLE="Generatoren für Zufallszahlen",
JOURNAL=aninf,
VOLUME=14,
NUMBER=6,
PAGES="263-268",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Simulation; RNG",
ANNOTE="Inhalt: Simulation, Zufallsgenerator, Mathematische Methoden,
Programmierung",
}
@ARTICLE{Sanc72:Methode,
AUTHOR="F. B. Sanchis",
TITLE="Eine Methode zur Formulierung von Blockierungsfunktionen für
Koppelnetz-Graphen",
JOURNAL=en,
VOLUME=47,
NUMBER=4,
PAGES="235-240",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Link system",
}
@ARTICLE{Arna72:Simple,
AUTHOR="A. N. Arnason",
TITLE="Simple, exact, efficient methods for generating beta and
Dirichlet variates",
JOURNAL="Utilitas Mathematica",
VOLUME=1,
PAGES="249-290",
YEAR=1972,
KEYWORDS="random variate generation",
}
@ARTICLE{Fish72:Bias,
AUTHOR="G. S. Fishman",
TITLE="Bias considerations in simulation experiments",
JOURNAL=or,
VOLUME=20,
NUMBER=4,
PAGES="785-790",
YEAR=1972,
KEYWORDS="Simulation; statistical technique",
}
@ARTICLE{Fors72:Von,
AUTHOR="G. E. Forsythe",
TITLE="Von Neumann's comparison method for random sampling from the
normal and other distributions",
JOURNAL=moc,
VOLUME=26,
NUMBER=120,
PAGES="817-826",
YEAR=1972,
KEYWORDS="random variate generation",
}
@TECHREPORT{Munt72:Poisson,
AUTHOR="R. R. Muntz",
TITLE="Poisson Departure Processes and Queueing Networks",
INSTITUTION="IBM Research Report RC-4145, Yorktown Heights, New York,
Dec.",
ADDRESS="Yorktown Heights",
PAGES="1-28",
YEAR=1972,
KEYWORDS="Queueing network; product form",
}
@ARTICLE{Norm72:Computer,
AUTHOR="J. E. Norman and L. E. Cannon",
TITLE="A computer program for the generation of random variables from
any discrete distribution",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=1,
PAGES="331-348",
YEAR=1972,
KEYWORDS="random variate generation",
}
@ARTICLE{Smit72:Algorithm,
AUTHOR="Babington Smith and R. R. Hocking",
TITLE="Algorithm {AS} 53: Wishart variate generator",
JOURNAL=as,
VOLUME=21,
NUMBER=3,
PAGES="341-345",
YEAR=1972,
KEYWORDS="random variate generation",
}
@ARTICLE{Sowe72:Chronological,
AUTHOR="E. R. Sowey",
TITLE="A chronological and classified bibliography on random number
generation and testing",
JOURNAL="International Statistical Review",
VOLUME=40,
NUMBER=3,
PAGES="355-371",
YEAR=1972,
KEYWORDS="random number generation; bibliography",
}
@INPROCEEDINGS{Akko72:Operating,
AUTHOR="E. A. Akkoyunlu and others",
TITLE="An operating system for a network environment",
BOOKTITLE="Symposium on computer communication networks and
teletraffic",
ADDRESS="Brooklyn, New York",
PAGES="529-538",
YEAR=1972,
}
@ARTICLE{Aupp72:MERIT,
AUTHOR="E. Aupperle",
TITLE="{MERIT} Computer network, hardware considerations",
EDITOR="R. Rustin",
JOURNAL=cn,
PAGES="49-64",
YEAR=1972,
}
@INPROCEEDINGS{Bahl72:Optimization,
AUTHOR="L. R. Bahl and D. T. Tang",
TITLE="Optimization of concentrator locations in teleprocessing
networks",
BOOKTITLE="Symposium on computer communication networks and
teletraffic",
ADDRESS="Brooklyn",
PAGES="355-362",
YEAR=1972,
}
@INPROCEEDINGS{Butr72:Routing,
AUTHOR="A. V. Butrimenko",
TITLE="Routing technique for message switching networks with message
outdating",
BOOKTITLE="Symposium on computer communication networks and
teletraffic",
ADDRESS="Brooklyn, New York",
PAGES="257-262",
YEAR=1972,
}
@INPROCEEDINGS{Chou72:Routing,
AUTHOR="Wu Chou and H. Frank",
TITLE="Routing strategies for computer network design",
BOOKTITLE="Symposium on computer communication networks and
teletraffic",
ADDRESS="Brooklyn",
PAGES="301-310",
YEAR=1972,
}
@INPROCEEDINGS{Citr72:Model,
AUTHOR="R. Citrenbaum",
TITLE="An on-line model for computer communication network: analysis and
tradeoff studies",
BOOKTITLE="Symposium on computer communication networks and
teletraffic",
ADDRESS="Brooklyn",
PAGES="613-634",
YEAR=1972,
}
@ARTICLE{Coca72:MERIT,
AUTHOR="A. Cocanower",
TITLE="{MERIT} computer network: Software considerations",
EDITOR="R. Rustin",
JOURNAL=cn,
PAGES="65-78",
YEAR=1972,
}
@INPROCEEDINGS{DeMe72:Canadian,
AUTHOR="J. DeMercado and others",
TITLE="The Canadian Universities computer network topological
considerations",
BOOKTITLE=iccc,
PAGES="220-225",
NOTE="also in \cite[p. 197-202]{Chu74:Advances}",
YEAR=1972,
}
@ARTICLE{Farb72:Data,
AUTHOR="D. Farber",
TITLE="Data ring oriented computer networks",
EDITOR="R. Rustin",
JOURNAL=cn,
PAGES="79-94",
YEAR=1972,
}
@INPROCEEDINGS{Hans72:Exact,
AUTHOR="E. Hansler and others",
TITLE="Exact calculation of computer network reliability",
BOOKTITLE=fjcc,
VOLUME=41,
PAGES="49-54",
NOTE="also in \cite[p. 413-419]{Chu74:Advances}",
YEAR=1972,
}
@ARTICLE{Klei72:Analytical,
AUTHOR="L. Kleinrock",
TITLE="Survey of analytical methods in queuing networks",
EDITOR="R. Rustin",
JOURNAL=cn,
PAGES="185-205",
YEAR=1972,
}
@ARTICLE{Luth72:Conceptual,
AUTHOR="W. J. Luther",
TITLE="Conceptual bases of {CYBERNET}",
EDITOR="R. Rustin",
JOURNAL=cn,
PAGES="111-146",
YEAR=1972,
}
@ARTICLE{McKa72:IBM,
AUTHOR="D. B. McKay and D. P. Karp",
TITLE="{IBM} Computer Network/440",
EDITOR="R. Rustin",
JOURNAL=cn,
PAGES="27-44",
YEAR=1972,
}
@INPROCEEDINGS{McQu72:Improvements,
AUTHOR="J. M. McQuillan and others",
TITLE="Improvements in the design and performance of the {ARPA}
network",
BOOKTITLE=fjcc,
VOLUME=41,
PAGES="741-754",
YEAR=1972,
}
@ARTICLE{Mend72:OCTOPUS,
AUTHOR="S. F. Mendicino",
TITLE="{OCTOPUS} The Lawrence Radiation Laboratory Network",
EDITOR="R. Rustin",
JOURNAL=cn,
PAGES="95-110",
YEAR=1972,
}
@INPROCEEDINGS{Metc72:Strategies,
AUTHOR="Robert M. Metcalfe",
TITLE="Strategies for interprocessor communication in a distributed
computing system",
BOOKTITLE="Symposium on Computer commun. Networks and Teletraffic",
ADDRESS="Brooklyn",
PAGES="519-526",
YEAR=1972,
}
@ARTICLE{Kahn72:Flow,
AUTHOR="R. E. Kahn and William R. Crowther",
TITLE="Flow Control in Resource Sharing Computer Networks",
JOURNAL=ieeecom,
VOLUME=20,
PAGES="539-546",
YEAR=1972,
}
@ARTICLE{Baum72:Maximization,
AUTHOR="L. E. Baum and T. Petrie and G. Soules and N. Weiss",
TITLE="A maximization technique occuring in the statistical analysis of
probabilistic functions of Markov chains.",
JOURNAL=ams,
VOLUME=41,
PAGES="164-171",
YEAR=1972,
}
@ARTICLE{Cran7204:Suitability,
AUTHOR="R. B. Crane and W. A. Malia and W. Richardson",
TITLE="Suitability of the normal density assumption for processing {MSS}
data",
JOURNAL=ieeegeo,
VOLUME=10,
NUMBER=4,
PAGES="158-165",
YEAR=1972,
}
@INPROCEEDINGS{Duda72:Use,
AUTHOR="R. O. Duda and P. E. Hart",
TITLE="Use of the Hough transforms to detect lines and curves in
pictures",
BOOKTITLE="ACM",
PAGES="11-15",
NOTE="Published as Proc. ACM, volume 15, number 1",
YEAR=1972,
ABSTRACT="Hough has proposed an interesting and efficient procedure for
detecting lines in pictures. This paper points out that the use of
angle-radius rather than slope-intercept parameters simplifies the
computation further. It also shows how the method can be used for more
general curve fitting, and gives alternative interpretations that
explain the source of its efficiency.",
}
@BOOK{Fuku72:Statistical,
AUTHOR="K. Fukunaga",
TITLE="Introduction to statistical pattern recognition",
PUBLISHER="Academic press",
ADDRESS="New York",
YEAR=1972,
}
@ARTICLE{Wood7202:Two,
AUTHOR="J. W. Woods",
TITLE="Two dimensional discrete Markovian fields",
JOURNAL=ieeeit,
VOLUME=18,
NUMBER=2,
PAGES="232-240",
YEAR=1972,
ABSTRACT="A definition of discrete Markovian random fields is formulated
analogously to a definition for the continuous case given by Levy. This
definition in the homogeneous Gaussian case leads to a difference
equation that sets forth the state of the field in terms of its values
on a band of minimum width $P$, where $P$ is the order of the process.
The state of the field at position $(i,j)$ is given by the set of values
of the nearest neighbours within distance $P$ of the point $(i,j)$.
Conversely, given a difference equation satisfying certain conditions
relating to stability, there corresponds a homogeneous disrete Markov
random field. This theory is applied to the problem of obtaining
spectral estimates of a 2-D field, given observation over a limited
aperture.",
}
@ARTICLE{Baye72:Symmetric,
AUTHOR="R. Bayer",
TITLE="Symmetric Binary B-Trees: Data Structure and Maintenance
Algorithms",
JOURNAL=acta,
VOLUME=1,
YEAR=1972,
REFERENCES=7,
ABSTRACT="A class of binary trees is described for maintaining ordered
sets of data. Random insertions, deletions, and retrievals of keys can
be done in time proportional to $ \log N $ where $N$ is the cardinality
of the data-set. Symmetric B-Trees are modification of B-trees described
previously by Bayer and McCreight. This class of trees properly contains
the balanced trees.",
}
@ARTICLE{Baye72:Organization,
AUTHOR="R. Bayer and McCreight E.",
TITLE="Organization and Maintenance of Large Ordered Indexes",
JOURNAL=acta,
VOLUME=1,
YEAR=1972,
REFERENCES=4,
ABSTRACT="Organization and maintenance of an index for a dynamic random
access file is considered. It is assumed that the index must be kept on
some pseudo random access backup store like a disc or a drum. The index
organization described allows retrieval, insertion, and deletion of keys
in time proportional to $\log\_k I$ where $I$ is the size of the index
and $k$ is a device dependent natural number such that the performance
of the schemes becomes near optimal. Storage utilization is at least
50\% but generally much higher. The pages of the index are organized in
a special data-structure, so-called B-trees. The scheme is analyzed,
performance bounds are obtained, and a near optimal $k$ is computed.
Experiments have been performed with indexes up to 100000 keys. An index
of size 15000 (100000) can be maintained with an average of 9 (at least
4) transactions per second on an IBM 360/14 with 2311 disc.",
}
@ARTICLE{Bazl7201:Dimensioning,
AUTHOR="D. Bazlen",
TITLE="The Dimensioning of Trunk Groups for Standard Gradings of the
German {GPO} in Case of Finite Number of Traffic Sources",
JOURNAL=ntz,
ADDRESS="Germany",
NUMBER=1,
PAGES="50-52",
YEAR=1972,
KEYWORDS="Loss system",
}
@ARTICLE{Bazl7201:Dimensionierung,
AUTHOR="D. Bazlen",
TITLE="Die Dimensionierung von Leitungsbündeln hinter Normmischungen der
Deutschen Bundespost bei endlicher Zahl von Verkehrsquellen",
JOURNAL=ntz,
ADDRESS="Germany",
VOLUME=25,
NUMBER=1,
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Loss system",
}
@ARTICLE{Grab7202:What,
AUTHOR="E. A. Grabhorn and A. B. Kamman and S. L. Mathison and H. L.
Pastan",
TITLE="What {U.S.} telecommunications can learn from other countries",
JOURNAL="Telephony",
VOLUME=17,
NUMBER=2,
PAGES="22-23, 26-27",
YEAR=1972,
KEYWORDS="Loss system",
}
@TECHREPORT{Mysk72:Investigation,
AUTHOR="A. Myskja and O. Walman",
TITLE="An Investigation of Telephone User Habits by Means of
ComputerTechnics",
INSTITUTION="The Electronics Research Laboratory,The Norwegian Institute
of Technology",
ADDRESS="Norway",
NOTE="see \cite{Mysk7306:Investigation}",
YEAR=1972,
KEYWORDS="Measurement",
}
@TECHREPORT{Bert72:Datamatstyret,
AUTHOR="O. Bertram",
TITLE="Datamatstyret Scannerudstyr - Et Nyt Dataopsamlingssystem",
INSTITUTION="KTAS-Nyt",
ADDRESS="Copenhagen, Denmark",
NUMBER=1,
PAGES="5-7",
YEAR=1972,
LANGUAGE="Danish",
KEYWORDS="traffic measurement",
}
@ARTICLE{Chai72:Extension,
AUTHOR="J. M. Chaiken and E. Ignall",
TITLE="An Extension of Erlang's Formulas which Distinguishes Individual
Servers",
JOURNAL=jap,
VOLUME=9,
PAGES="192-197",
YEAR=1972,
KEYWORDS="Erlang B formula",
}
@ARTICLE{Eben72:ITT,
AUTHOR="H. Ebenberger",
TITLE="Das {ITT-Fernsprechsystem} {11E}",
JOURNAL="ITT Austria Technische Mitteilungen",
ADDRESS="Austria",
VOLUME=19,
NUMBER=24,
PAGES=12,
YEAR=1972,
LANGUAGE="German",
KEYWORDS="switching system",
}
@TECHREPORT{Ever72:Verhalten,
AUTHOR="R. Evers",
TITLE="Das Verhalten der Teilnehmer einer Nebenstellenanlage. Teil 3:
Belegungsdauer, Belegungsabstände und Wiederholungsabstände",
INSTITUTION="Heinrich Hertz Institut",
ADDRESS="Berlin, Germany",
NUMBER=158,
PAGES=34,
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Traffic source model; traffic measurement; PABX",
ABSTRACT="Subscriber behaviour",
}
@INPROCEEDINGS{Fost72:Stochastic,
AUTHOR="F. G. Foster",
TITLE="Stochastic Processes",
BOOKTITLE="IFORS Conference VI",
ADDRESS="Dublin, IRL",
PAGES=24,
YEAR=1972,
KEYWORDS="Stochastic Process; Theory; Survey",
}
@ARTICLE{Gole72:Measurement,
AUTHOR="H. M. G. Golesworthy and R. C. Kyme and J. A. T. Rowe",
TITLE="The Measurement of Telephone Traffic",
JOURNAL=poeej,
VOLUME=64,
PAGES="227-233",
YEAR=1972,
KEYWORDS="traffic measurement",
}
@MASTERSTHESIS{Host72:Trafikanalyse,
AUTHOR="I. Host Pedersen",
TITLE="Trafikanalyse ved Hjælp af Minidatamat",
TYPE="Eksamensprojekt",
SCHOOL="Kobenhavns Teknikum",
ADDRESS="Copenhagen, Denmark",
PAGES=86,
YEAR=1972,
LANGUAGE="Danish",
KEYWORDS="Measurement; computer tool",
}
@TECHREPORT{Hert72:Jonotusjärjestelmistä,
AUTHOR="S. Hertzberg",
TITLE="Jonotusjärjestelmistä",
INSTITUTION="Helsinki University of Technology, Telecommunication
Laboratory",
ADDRESS="Helsinki, Finland",
NUMBER=13,
PAGES=141,
YEAR=1972,
LANGUAGE="Finnish",
KEYWORDS="traffic measurement",
}
@ARTICLE{Joys72:Teletrafikkproblemer,
AUTHOR="L. A. Joys",
TITLE="Teletrafikkproblemer für og nå, et personligt inntrykk",
JOURNAL="Teletronikk",
ADDRESS="Denmark",
VOLUME="2-3",
PAGES="160-164",
YEAR=1972,
LANGUAGE="Danish",
}
@ARTICLE{Joys72:En,
AUTHOR="L. A. Joys",
TITLE="En sammenligning av analytiske metoder og simulering for
dimensjonering av telesystemer",
JOURNAL="Teletronikk",
ADDRESS="Norway",
VOLUME="2-3",
PAGES="165-172",
YEAR=1972,
LANGUAGE="Norwegian",
KEYWORDS="Network optimization; analytical model; simulation",
}
@ARTICLE{Joys72:Anvendelse,
AUTHOR="L. A. Joys",
TITLE="Anvendelse av Engsets og Erlangs formler for
sannsynlighetstetthet i tapssystem",
JOURNAL="Teletronik",
ADDRESS="Norway",
VOLUME="2-3",
PAGES="173-189",
YEAR=1972,
LANGUAGE="Norwegian",
ABSTRACT="Comments: Errata to 'Comments on the Engset and Erlang Formulæ
for Telephone Traffic Losses'. Report TF. no 25/71. Teletronikk, 1972,
No 2-3, p. 190.",
}
@TECHREPORT{Kilv72:Datamaskinstyrte,
AUTHOR="K. A. Kilvik",
TITLE="Datamaskinstyrte Telefonsentraler",
INSTITUTION="Licentiatafhandling ved Institutt for Teletrafiksystemer,
Norges tekniske Hogskole",
ADDRESS="Oslo, Norway",
PAGES=247,
YEAR=1972,
LANGUAGE="Norwegian",
KEYWORDS="switching",
}
@ARTICLE{Klei7208:Processor,
AUTHOR="L. Kleinrock and R. R. Muntz",
TITLE="Processor Sharing Queueing Models of Mixed Scheduling Disciplines
for Time Shared Systems",
JOURNAL=jacm,
VOLUME=19,
NUMBER=3,
PAGES="464-482",
YEAR=1972,
KEYWORDS="Processor sharing",
}
@ARTICLE{Koop7204:Air,
AUTHOR="B. O. Koopman",
TITLE="Air-Terminal Queues under Time-Dependent Conditions",
JOURNAL=or,
VOLUME=20,
NUMBER=4,
PAGES="1089-1114",
YEAR=1972,
KEYWORDS="Queueing system; instationary process; intensity variations",
ABSTRACT="The queues formed by aircraft in stacks awaiting landing
clearance have usually been treated either by machine simulation, or
analytically as stochastic processes with time-independent transition
probabilities (posessing stationary solutions). In contrast to such
methods, the present paper regards the queue developing process in
question as strongly time-dependent, often with a diurnal (24-hour)
period.",
}
@ARTICLE{Kucz72:Accuracy,
AUTHOR="Anatol Kuczura and S. R. Neal",
TITLE="The Accuracy of Call-Congestion Measurements for Loss Systems
with Renewal Input",
JOURNAL=bstj,
VOLUME=51,
NUMBER=10,
PAGES="2197-2208",
YEAR=1972,
KEYWORDS="traffic measurement",
}
@PHDTHESIS{Kuhn72:Über,
AUTHOR="P. J. Kühn",
TITLE="Über die Berechnung der Wartezeiten in Vermittlungs- und
Rechnersystemen. (On the Calculation of Waiting Times in Switching and
Computer Systems)",
TYPE="Habilitation",
SCHOOL="NVDV, Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
VOLUME=15,
PAGES=190,
NOTE="15. Bericht über verkehrstheoretische Arbeiten",
YEAR=1972,
KEYWORDS="Queueing system",
}
@TECHREPORT{Kühn72:Controlling,
AUTHOR="R. A. Kühn",
TITLE="Controlling Telephone Costs",
INSTITUTION="American Management Association",
NUMBER="0-8144-2151-2",
PAGES=34,
YEAR=1972,
KEYWORDS="Telephony; charging",
}
@INPROCEEDINGS{Lass72:Modelling,
AUTHOR="E. R. Lassettre and A. L. Scherr",
TITLE="Modelling the Performance of the {OS/360} Time-sharing Option
{(TSO)}",
BOOKTITLE="Statistical Computer Performance Evaluation",
EDITOR="W. Freiberger",
ADDRESS="Providence, Rhode Island",
PAGES="57-72",
YEAR=1972,
KEYWORDS="Operating system",
}
@ARTICLE{Maal72:Ventetid,
AUTHOR="E. Maal e",
TITLE="Ventetid i K for Fler-Kanal-Systemer",
JOURNAL="Erhvervs konomisk Tidsskrift",
ADDRESS="Denmark",
PAGES="11-16",
YEAR=1972,
LANGUAGE="Danish",
}
@ARTICLE{Mend7201:Analyse,
AUTHOR="M.-J. Menditte",
TITLE="Analyse et Mesure du Trafic Téléphonique",
JOURNAL="Journal de la Société de Statistique de Paris",
ADDRESS="Parsi, France",
VOLUME=113,
NUMBER=1,
PAGES="21-38",
YEAR=1972,
LANGUAGE="French",
KEYWORDS="traffic measurement",
}
@ARTICLE{Mess72:Proof,
AUTHOR="E. J. Messerli",
TITLE="Proof of a Convexity Property of the {Erlang} B Formula",
JOURNAL=bstj,
VOLUME=51,
PAGES="951-953",
YEAR=1972,
KEYWORDS="Erlang B formula",
}
@ARTICLE{Naka7203:Waiting,
AUTHOR="G. Nakamura and Y. Murao and K. Tsukamoto",
TITLE="Analysis of Waiting Time Distribution for {TSS} Round-Robin
Scheduling Scheme",
JOURNAL=recl,
ADDRESS="Japan",
VOLUME=20,
NUMBER="3-4",
PAGES="210-219",
YEAR=1972,
KEYWORDS="Round robin; waiting time",
ABSTRACT="Recently considerable effort has been directed to the
development of time sharing computer systems and several analyses have
been made for relevant queueing models. This paper considers a simple
round-robin time sharing service system and derives the
Laplace-Stieltjes (L-S) transform of waiting time distribution in a
recurrence form. The mean and the second moment of waiting time are then
calculated.",
}
@PROCEEDINGS{Anon72:Nachrichten,
TITLE="Nachrichtenübertragung mit Laser. Kurzfassungen der Vorträge der
{NTG-Fachtagung} Nachrichtenübertragung mit Laser",
EDITOR="Anonymous",
SERIES="NTZ-Report",
PUBLISHER="VDE-Verlag, Berlin",
ADDRESS="Ulm, Germany",
NUMBER=14,
PAGES=48,
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Transmission system",
}
@ARTICLE{Oves72:Pr,
AUTHOR="P. Ovesen",
TITLE="Pr vedrift av den elektroniske telefonsentral {TITIL} i det
offentlige tele-nett",
JOURNAL="Elektroteknisk Tidsskrift",
ADDRESS="Denmark",
VOLUME=85,
NUMBER=13,
PAGES="20-22",
YEAR=1972,
LANGUAGE="Danish",
KEYWORDS="Switching system; PABX",
ABSTRACT="Switching, PABX",
}
@TECHREPORT{Rahk72:Trafikforskning,
AUTHOR="K. Rahko",
TITLE="Trafikforskning och trafikmätningar i Finland - Resultat och
idéer",
INSTITUTION="Helsinki University of Technology, Telecommunications
Laboratory",
ADDRESS="Helsinki, Finland",
NUMBER=2,
PAGES=36,
NOTE="Foredrag i Trondheim 10-12/1 1972",
YEAR=1972,
LANGUAGE="Finnish",
KEYWORDS="traffic measurement",
}
@ARTICLE{Rasc72:Objektivitet,
AUTHOR="G. Rasch",
TITLE="Objektivitet i Samfundsvidenskaberne. Et Metodeproblem",
JOURNAL="National konomisk Tidsskrift",
ADDRESS="Denmark",
VOLUME="3-4",
PAGES="161-196",
YEAR=1972,
LANGUAGE="danish",
KEYWORDS="Statistics",
}
@ARTICLE{Rder72:Steuerung,
AUTHOR="H. Röder",
TITLE="Die Steuerung de Vermittlungssystems {IBM} 2750 durch ein
kernspeicherresidentes Programm",
JOURNAL="Computer-Praxis",
ADDRESS="Germany",
VOLUME=1,
PAGES="1-6",
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Spc",
}
@ARTICLE{Taka7211:Optimum,
AUTHOR="K. Takagi",
TITLE="Optimum Channel Graph of Link System and Switching Network
Design",
JOURNAL=recl,
ADDRESS="Japan",
VOLUME=20,
NUMBER="11-12",
PAGES="962-985",
YEAR=1972,
KEYWORDS="Switching network; link system",
}
@INPROCEEDINGS{Thyr72:Bayesian,
AUTHOR="P. Thyregod",
TITLE="Bayesian Single Sampling Acceptance Plans for Life-Testing",
BOOKTITLE="Colloquia Mathematica Societatis János Bolyai. 9th European
meeting of Statisticians",
ADDRESS="Budapest, H",
PAGES="831-841",
YEAR=1972,
KEYWORDS="Statistics",
}
@ARTICLE{Tsuk7207:TSS,
AUTHOR="K. Tsukamoto and G. Nakamura",
TITLE="Analysis of the {TSS} Round-Robin Scheduling Scheme Queue Size",
JOURNAL=recl,
ADDRESS="Japan",
VOLUME=20,
NUMBER="7-8",
PAGES="669-681",
YEAR=1972,
KEYWORDS="Time sharing; round robin",
ABSTRACT="In recent years, considerable efforts have been devoted to the
development of time-sharing systems (TSS). The round-robin scheduling
scheme (RR) is one of the fundamental TSS scheduling schemes. Several
studies have been made on RR, but the effect of the setup time has not
been investigated in detail yet. In this paper, it is assumed that the
distribution of the setup time on each slice of service of a call
depends upon w",
}
@ARTICLE{Viga72:Computer,
AUTHOR="C. D. Vigar",
TITLE="A Computer-Controlled Traffic Recorder",
JOURNAL=poeej,
VOLUME=64,
PAGES="234-237",
YEAR=1972,
KEYWORDS="traffic measurement",
}
@ARTICLE{Woll72:Multicommodity,
AUTHOR="R. D. Wollmer",
TITLE="Multicommodity Networks with Resource Constraints: The
Generalized Multicommodity Flow Problem",
JOURNAL=networks,
VOLUME=1,
PAGES="245-263",
YEAR=1972,
KEYWORDS="Network planning; routing",
}
@ARTICLE{Yosh7201:Number,
AUTHOR="Y. Yoshida and K. Kawashima",
TITLE="Analysis of Number of Calls in the System on a Multi-Level
Feedback Queueing Model",
JOURNAL=recl,
ADDRESS="Japan",
VOLUME=20,
NUMBER="1-2",
PAGES="1-11",
YEAR=1972,
KEYWORDS="Feedback queue",
ABSTRACT="This paper presents a mathematical study of the number of
calls in the system on a multi-level feedback queueing model that is one
of the scheduling methods in time-sharing systems (TSS). A generating
function for the number of calls in the system, in which all calls have
the same priority at arrival, is studied. The method to derive moments
of the number of calls in the system is stated and explicit formulae of
mean numb",
}
@ARTICLE{Itoh7203:Round,
AUTHOR="M. Itoh",
TITLE="An Analysis of Round-Robin Queueing Model with Multi-Class
Priorities",
JOURNAL=recl,
ADDRESS="Japan",
VOLUME=20,
NUMBER="3-4",
PAGES="220-230",
YEAR=1972,
KEYWORDS="Queueing system; priority; round robin",
ABSTRACT="Round-Robin discipline with multi-class, non-preemptive
priorities, one of the scheduling algorithms for time-sharing computer
system, is analyzed. Assuming for each priority its own exponential
inter-arrival and service times, the distribution of queue length and
the waiting times for each priority, conditional and nonconditional on
the required service time, are obtained. Numerical examples are also
shown.",
}
@ARTICLE{Hask7201:Buffer,
AUTHOR="B. G. Haskell",
TITLE="Buffer and Channel Sharing by Several Interframe Picturephone
Coders",
JOURNAL=bstj,
VOLUME=51,
NUMBER=1,
PAGES="261-289",
MONTH=jan,
YEAR=1972,
KEYWORDS="packet video; source models; picturephone",
ABSTRACT="Simulations are described which test the feasibility of
several conditional replenishment type Picturephone coders sharing the
same transmission channel. Channel sharing takes advantage of the fact
that many different users are rarely in rapid motion at the same time.
Thus, when the data from several sources is averaged together prior to
transmission, it is much more uniform than that from a single source.
Since the peaks in the averaged data are smaller than with a single
source, less buffering is required, and the channel rate for
transmission is much closer to the average data rate generated. Results
indicate that by combining twelve sources prior to transmission, a 2:1
reduction in the bit rate of the system described by Candy, et al., can
be obtained. This means that twelve Picturephone sources could share a
12 megabits per second (one way) transmission facility.",
}
@ARTICLE{Limb7201:Buffering,
AUTHOR="J. O. Limb",
TITLE="Buffering of Data Generated by the Coding of Moving Images",
JOURNAL=bstj,
VOLUME=51,
NUMBER=1,
PAGES="239-259",
MONTH=jan,
YEAR=1972,
KEYWORDS="packet video; video source models",
ABSTRACT="Data are generated at a fairly uneven rate when video
telephone signals are coded by transmitting only the parts of the
picture that change from frame to frame. Complete smoothing of this data
is impracticable because of the size of the required buffer. Obviously,
even a small buffer provides some advantage however. The object of this
paper is to explore the relation between the buffer requirements and
channel rate under varying experimental conditions. The study was made
by recording three minutes of data (covering a range of action) on a
digital computer and simulating buffer behavior for various channel
rates and operating conditions. With little or no buffering, a large
rate is necessary. As the size of the buffer is increased, the required
channel rate typically decreases quite rapidly until the buffer is large
enough to smooth the data over an entire field. Beyond this point there
is relatively little improvement until the buffer is large enough to
smooth the data generated by a moving user from one movement to the
next. At times data are generated at a faster rate than can be handled
by the buffer-channel combination. Reduction of the rate of data
generation during these periods can be controlled either by using the
amount of activity in the picture as a control or by using the state of
the buffer as a control. Both methods have distinctly different effects
on the buffer-size versus channel-rate curve. The two modes of control
can be effectively combined in developing a successful control strategy.
The buffer size required to achieve within-field smoothing can be
reduced dramatically if the data within the field are not taken in the
order in which these data are generated but instead are interleaved in a
systematic manner; this is because of the nonuniform rate of data
generation within a field.",
}
@ARTICLE{Roes7201:Finite,
AUTHOR="P. B. M. Roes",
TITLE="The Finite Dam with Discrete Additive Input",
JOURNAL=jem,
VOLUME=6,
NUMBER=1,
PAGES="37-45",
MONTH=jan,
YEAR=1972,
ABSTRACT="The transient behaviour of a finite discrete dam with additive
input and release at unit rate is derived from that of the analogous
infinite dam. The method employed is based on Feller's Theory of
Recurrent Events. Various (taboo) first entrance and surpassage times
are derived for the infinite dam from which the first entrance times for
the finite dam are deduced. These lead immediately to the result
mentioned. The approach actually affords the determination of joint
distributions involving total input and dry time during relevant time
intervals as well. Several intermediate results are of interest in their
own right. It would seem possible to find the transient behaviour of the
Holdaway dam using an analogous approach to the one given (see Moran).",
ANNOTE="Stochastic processes. Reservoirs.",
}
@ARTICLE{Sing7201:Addendum,
AUTHOR="V. P. Singh",
TITLE="Addendum to the paper: Finite Waiting Space Bulk Service System",
JOURNAL=jem,
VOLUME=6,
NUMBER=1,
PAGES="85-88",
MONTH=jan,
YEAR=1972,
KEYWORDS="queueing theory",
ANNOTE="\cite{Sing7110:Finite}",
}
@ARTICLE{Anon7201:Second,
AUTHOR="Anonymous",
TITLE="Second Symposium on Data Communications--Preview",
JOURNAL=ccr,
VOLUME=2,
NUMBER=1,
MONTH=jan,
YEAR=1972,
}
@ARTICLE{Meis7202:Optimization,
AUTHOR="Bernd Meister and H. R. Müller and Harry Rudin",
TITLE="On the Optimization of Message Switching Networks",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=1,
PAGES="8-14",
MONTH=feb,
YEAR=1972,
REFERENCES=6,
ABSTRACT="Criteria recently developed by the authors for optimum
capacity assignment in message-switching networks are applied to a
network model which now contains nodal processors as well as
interconnecting links. Linear and stepped cost functions are examined
and various performance and cost-performance curves are presented. An
efficient design procedure is described for the tedious case of stepped
cost functions. For general continuous cost functions and the minimax
design the distribution functions of all point-to-point delays can be
easily calculated.",
}
@ARTICLE{Fari7202:Novel,
AUTHOR="E. Fariello",
TITLE="A novel speech detector for improving effective satellite
capacity",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=2,
PAGES="55-60",
MONTH=feb,
YEAR=1972,
KEYWORDS="packet voice; silence detection",
ABSTRACT="A probabilistic analysis has been done by comparing cumulative
distributions of voice and typical phone-line noise, and the
characteristics of voice waveform have been investigated in order to
determine a new criterion for distinguishing the two signals. This
digital speech detector is extremely sensitive to the onset of voice but
much less sensitive to typical telephone-line noise. The system operates
on PCM-coded signals. A peak detector was set at -25 dBm0. A good value
for the number of consecutive peaks to trigger a talkspurt was found to
be four. A sign-detector triggers if there have been a set number of
consecutive sign changes (say, 16 PCM words). Finally, a semivowel
detector checks whether the PCM words change sign only once in a period
of 2.5 ms to 3.0 ms. The rms voice power sufficient to trigger the
speech detector is 8 to 15 dB below the rms noise power.",
}
@ARTICLE{Doll7202:Telecomunications,
AUTHOR="D. R. Doll",
TITLE="Telecomunications turbulence and the computer network evolution",
JOURNAL=ieeecomp,
VOLUME=7,
PAGES="13-22",
NOTE="also in \cite{Abra80:Computer}",
MONTH=feb,
YEAR=1972,
}
@MASTERSTHESIS{Afan7202:Untersuchung,
AUTHOR="I. Afani",
TITLE="Untersuchung von Wartezeiten bei belastungsabhängiger
Belegungsdauer",
SCHOOL="Institut für Nachrichtentechnik der Rheinland-Westfälischen
Technischen Hochschule Aachen",
ADDRESS="Aachen, Germany",
MONTH=feb,
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Delay system",
}
@TECHREPORT{Wall7202:Noggrannheten,
AUTHOR="B. Wallström",
TITLE="Noggrannheten hos uppmätta trafiker",
INSTITUTION="TTS, Lunds Tekniske Hojskole",
ADDRESS="Lund, Sweden",
NUMBER=3,
PAGES=24,
MONTH=feb,
YEAR=1972,
LANGUAGE="Swedish",
KEYWORDS="traffic measurement",
}
@ARTICLE{Smir7203:Distribution,
AUTHOR="T. S. Smirnova and G. N. Feofanov",
TITLE="Distribution of Service Waiting Times in Systems with a {LIFO}
Queue Discipline",
JOURNAL=arc,
VOLUME=33,
NUMBER="3, part 2",
PAGES="482-485",
MONTH=mar,
YEAR=1972,
KEYWORDS="queueing theory; M/M/1/K; LIFO",
}
@INPROCEEDINGS{Katz72:Experimental,
AUTHOR="L. Katzschner and W. Lörcher and H. Weisschuh",
TITLE="On an Experimental Local {PCM} Switching Network",
BOOKTITLE="Zürich-Seminar",
ADDRESS="Zürich",
MONTH=mar,
YEAR=1972,
KEYWORDS="TDM; time division multiplex",
}
@MISC{Edwa72:Notes,
AUTHOR="Aled Edwards",
TITLE="Notes on Likelihood",
PUBLISHER="Foredrag i Dansk Selskab for Teoretisk Statistik",
ADDRESS="Copenhagen, Denmark",
PAGES=15,
MONTH=mar,
YEAR=1972,
KEYWORDS="Statistics",
}
@INPROCEEDINGS{Burk7204:Output,
AUTHOR="P. J. Burke",
TITLE="Output Processes and Tandem Queues",
BOOKTITLE="Symposium on Computer-Communications Networks and
Teletraffic",
EDITOR="Jerome Fox",
PUBLISHER="Polytechnic Press",
ADDRESS="Brooklyn, New York",
PAGES="419-428",
NOTE="Vol. 22 in Microwave Research Institute Symposia Series",
MONTH=apr,
YEAR=1972,
KEYWORDS="queueing theory",
ABSTRACT="This is a survey of results published from 1954 until the
present. The principle emphasis is placed on equilibrium queues with
Poisson input and exponential service time. The output process of such a
queue has properties which make possible stage-by-stage analysis of
these queues in tandem. Further, the sojourn time (delay plus service
time) of a customer in such a queue with order-of-arrival service is
independent of the departure process previous to the departure of the
customer in question, which result makes possible an easy computation of
the distribution of the time necessary to transit two such queues --- or
any number of single-server queues --- in tandem. Other work discusses
is mainly confined to properties of the output process of
infinite-server and single-server queues with general service-time
distribution.",
}
@ARTICLE{Chu7204:Buffer,
AUTHOR="Wesley W. Chu and Leo C. Liang",
TITLE="Buffer Behavior for Mixed Input Traffic and Single Constant
Output Rate",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=2,
PAGES="230-235",
MONTH=apr,
YEAR=1972,
KEYWORDS="discrete time queue",
ABSTRACT="A queueing model with limited waiting room (buffer), mixed
input traffic (Poisson and compound Poisson arrivals), and constant
service rate is studied. Using average burst length, traffic intensity,
and input traffic mixture rate as parameters, the authors obtain
relationships among buffer size, overflow probabilities, and expected
message-queueing delay due to buffering. These relationships are
portrayed on graphs that can be used as a guide in buffer design.
Although this study arose in the design of statistical multiplexors, the
queueing model developed is quite general and may be useful for other
industrial applications.",
}
@INPROCEEDINGS{Herz7204:Comparison,
AUTHOR="U. Herzog and P. J. Kühn",
TITLE="Comparison of Some Multiqueue Models with Overflow and
Load-Sharing Strategies for Data Transmission and Computer Systems",
BOOKTITLE="Symposium on Computer-Communications Networks and
Teletraffic",
EDITOR="Jerome Fox",
SERIES="Microwave Research Institute Symposia Series",
PUBLISHER="Polytechnic Press",
ADDRESS="New York, New York",
PAGES="449-472",
MONTH=apr,
YEAR=1972,
KEYWORDS="queueing theory",
ABSTRACT="This paper deals with different routing strategies for data
transmission as well as different load-sharing and reliability
configurations for computer systems. Starting from two separate service
systems without mutual overflow, a review of different overflow systems
is given considering three types of overflow strategies applicable to
data transmission. Furthermore, systems of two and more computers are
inspected with various configurations and operating strategies. For
reasons of simplicity, all multiqueue models are demonstrated by example
of systems with two (limited) queues. A comparison between the models of
both application areas shows a close similarity with respect to system
structure and operating strategies. Therefore, the models of both areas
can be treated by the same mathematical methods. The analysis of the
different systems with respect to the service quality is carried out on
the basis of the state equations under Markovian assumptions. Finally,
the most important models will be compared with each other with respect
to various traffic criteria.",
}
@INPROCEEDINGS{Lang7204:Sampled,
AUTHOR="M. Langenbach-Belz",
TITLE="Sampled Queueing Systems",
BOOKTITLE="Symposium on Computer-Communications Networks and
Teletraffic",
EDITOR="Jerome Fox",
PUBLISHER="Polytechnic Press",
ADDRESS="Brooklyn, New York",
PAGES="157-176",
NOTE="Vol. 22 in Microwave Research Institute Symposia Series",
MONTH=apr,
YEAR=1972,
KEYWORDS="queueing theory",
ABSTRACT="Two models of sampled queueing systems are treated, one with
batch service in fixed intervals and another one with batch arrivals in
fixed intervals. For each of these two models the characteristic traffic
values, i.e., probabilities of state, mean queue length, mean waiting
time, probability of waiting, and waiting time distribution are derived.
Exact and approximate numerical values are given as a support for
practical applications.",
}
@INPROCEEDINGS{Adir7204:Queuing,
AUTHOR="I. Adiri",
TITLE="Queuing models for multiprogrammed computers",
BOOKTITLE="Symposium on computer communication networks and
teletraffic",
ADDRESS="Brooklyn",
PAGES="441-448",
MONTH=apr,
YEAR=1972,
REFERENCES=18,
KEYWORDS="Queueing system; priority",
}
@INPROCEEDINGS{Herz7204:Overflow,
AUTHOR="U. Herzog and P. J. Kühn",
TITLE="Overflow- and load-sharing strategies",
BOOKTITLE="symposium on computer communications and teletraffic",
ADDRESS="Brooklyn, New York",
MONTH=apr,
YEAR=1972,
KEYWORDS="Queueing system",
}
@INPROCEEDINGS{Sche72:Calculation,
AUTHOR="R. Schehrer",
TITLE="On the Calculation of Overflow Systems with a Finite Number of
Sources and Full Available Groups",
BOOKTITLE="Symposium on computer communication networks and
teletraffic",
ADDRESS="Brooklyn, New York",
MONTH=apr,
YEAR=1972,
KEYWORDS="Overload control; flow control; communication network",
}
@INPROCEEDINGS{Rahk7204:Influence,
AUTHOR="K. Rahko and S. Hertzberg and L. Melamies",
TITLE="The Influence of Faults on the Calculation of the Number of
Devices for Nonpoisson Traffic",
BOOKTITLE="Symposium on Computer Networks and Teletraffic",
ADDRESS="New York",
PAGES="277-293",
MONTH=apr,
YEAR=1972,
KEYWORDS="Loss system",
}
@INPROCEEDINGS{Orns7205:Terminal,
AUTHOR="S. M. Ornstein and F. E. Heart and William R. Crowther and H. K.
Rising and S. B. Russell",
TITLE="The terminal {IMP} for the {ARPA} computer network",
BOOKTITLE=sjcc,
ORGANIZATION="IEEE",
ADDRESS="Atlantic City, New Jersey",
PAGES="243-254",
MONTH=may,
YEAR=1972,
KEYWORDS="computer networks; ARPAnet; IMP",
ANNOTE="Provides historical perspective on ARPAnet.",
}
@INPROCEEDINGS{Croc7205:Function,
AUTHOR="S. D. Crocker and John F. Heafner and Robert M. Metcalfe and J.
B. Postel",
TITLE="Function-oriented protocols for the {ARPA} computer network",
BOOKTITLE=sjcc,
ORGANIZATION="IEEE",
ADDRESS="Atlantic City, New Jersey",
PAGES="271-279",
MONTH=may,
YEAR=1972,
KEYWORDS="computer networks; ARPAnet; IMP",
ANNOTE="Provides historical perspective on ARPAnet.",
}
@INPROCEEDINGS{Fran7205:Computer,
AUTHOR="H. Frank and R. E. Kahn and L. Kleinrock",
TITLE="Computer communication network design --- experience with theory
and practice",
BOOKTITLE=sjcc,
ORGANIZATION="IEEE",
ADDRESS="Atlantic City, New Jersey",
PAGES="255-270",
NOTE="also in \cite[p. 257-269]{Chu74:Advances}",
MONTH=may,
YEAR=1972,
KEYWORDS="computer networks; ARPAnet; IMP",
ANNOTE="Provides historical perspective on ARPAnet, with extensive
bibliography.",
}
@ARTICLE{Chan7206:Buffering,
AUTHOR="John H. Chang",
TITLE="An Analysis of Buffering Techniques in Teleprocessing Systems",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=3,
PAGES="619-630",
MONTH=jun,
YEAR=1972,
KEYWORDS="congestion control; queueing theory",
ABSTRACT="Core buffers are used in teleprocessing systems for handling
queueing and transfer of messages between all communication lines and
queueing media. Management of data buffers for incoming and outgoing
messages is an important task in running a real-time system at optimal
efficiency. There are several factors that a system designer must
consider in weighing the tradeoff of time and main storage. This paper
deals with the analysis of several practical buffering techqiques and
provides procedures for determining the buffer size, which satisfies a
prespecified probability of overflow.",
ANNOTE="Static, dynamic, semidynamic allocation.",
}
@ARTICLE{Chu7206:Modeling,
AUTHOR="Wesley W. Chu",
TITLE="On the Analysis and Modeling of a Class of Computer Communication
Systems",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=3,
PAGES="645-660",
MONTH=jun,
YEAR=1972,
KEYWORDS="queueing theory",
ABSTRACT="Recent advances in computer communications are discussed
including computer-traffic and channel error characteristics, optimal
fixed message block size, statistical multiplexing, and loop systems. A
unified model is developed and then used to analyze the queueing
behavior of the star and loop systems. Numerical results for selected
traffic intensities and message lengths, given in graphical form,
provide insight into the performance of these systems.",
}
@ARTICLE{Davi7206:Control,
AUTHOR="Donald W. Davies",
TITLE="The Control of Congestion in Packet-Switching Networks",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=3,
PAGES="546-550",
MONTH=jun,
YEAR=1972,
KEYWORDS="congestion control",
ABSTRACT="Any communication network has a finite traffic capacity and if
it is offered traffic beyond the limit it must reject some of it. The
data-communication network studied here is one employing packet
switching, like the Advanced Research Project Agency (ARPA) network. It
handles blocks of data, called packets, and longer messages are
subdivided, rather in the same way that store in a computer is allocated
in pages. A method of controlling congestion is proposed in which there
is a finite number of packet carriers in the whole network. When a
packet of data is delivered to its destination node the ``empty'' packet
is available for reuse. The empties move randomly around the network and
new data must capture an empty packet carrier before being launched into
the network. Various elaborations are described that avoid delay in
normal conditions. This so-called ``isarithmic'' method of congestion
control supplements and does not replace end-to-end flow control.",
}
@ARTICLE{Herb7206:Infinite,
AUTHOR="H. G. Herbert",
TITLE="An Infinite Discrete Dam with Independent Inputs",
JOURNAL=jap,
VOLUME=9,
NUMBER=2,
PAGES="405-413",
MONTH=jun,
YEAR=1972,
KEYWORDS="discrete time queues",
ABSTRACT="This paper is concerned with an infinite discrete dam fed by
inputs which form a moving average sequence. Generating functions are
derived for the joint time dependent distribution of the content,
accumulated input and total dry time, the distribution of first
emptiness, and the stationary content distribution. Also investigated is
the problem of first emptiness before overflow for the finite dam.",
}
@ARTICLE{Kahn7206:Flow,
AUTHOR="R. E. Kahn and William R. Crowther",
TITLE="Flow Control in a Resource-Sharing Computer Networks",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=3,
PAGES="539-546",
NOTE="also in \cite[p. 230-237]{Chu74:Advances}",
MONTH=jun,
YEAR=1972,
KEYWORDS="congestion control",
ABSTRACT="The paper discusses flow control in a resource-sharing
computer network. The resources consist of a set of inhomogeneous
computers called hosts that are geographically distributed and are
interconnected by a store-and-forward communications subnet. In the
communication process, messages pass between hosts via the subnet. A
protocol is used to control the flow of messages in such a way as to
efficiently utilize the subnet and the host resources. The nature of the
flow control required and its relation to the host flow control and
subnet performance is examined in some detail.",
}
@ARTICLE{Moha7206:Queues,
AUTHOR="S. G. Mohanty",
TITLE="On Queues Involving Batches",
JOURNAL=jap,
VOLUME=9,
NUMBER=2,
PAGES="430-435",
MONTH=jun,
YEAR=1972,
KEYWORDS="queueing theory",
ABSTRACT="It has been demonstrated by Takács in a series of papers and
in his book that combinatorial methods can be successfully applied to
derive certain probability distributions in queueing processes. In this
paper, we further illustrate the usefulness of combinatorial techniques
and determine the stochastic law of the busy period in two queueing
systems particularly involving batches. It may be of interest to note
that queues involving batches have been dealt with in other papers by
Mohanty and Takács.",
}
@ARTICLE{Birk7206:State,
AUTHOR="Dennis M. Birke",
TITLE="State-transition programming techniques and their use in
producing teleprocessing device-control programs",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=3,
PAGES="569-575",
MONTH=jun,
YEAR=1972,
KEYWORDS="network protocol; software engineering; protocol
implementation; operating system; state diagram; protocol verification",
ABSTRACT="A method of using state-transition diagrams for writing and
implementing control programs for teleprocessing devices is presented.
Currently used techniques are briefly compared with this method. The
simple example of reading a teletype is discussed. The technique is
evaluated solely upon ease of program preparation and resource
optimization is not considered. Generalizations and extensions of the
technique are suggested. A detailed example of a state-transition
program controlling an IBM S/360 channel-to-channel adapter is presented
in the Appendix.",
}
@ARTICLE{Prol7206:Remark,
AUTHOR="L. G. Proll",
TITLE="Remark on algorithm 370 {[G5].}",
JOURNAL=cacm,
VOLUME=15,
NUMBER=6,
PAGES="467-468",
MONTH=jun,
YEAR=1972,
KEYWORDS="random variate generation",
}
@ARTICLE{Bech7206:Communications,
AUTHOR="W. D. Bechae and E. Aupperle",
TITLE="The communications computer hardware of the {MERIT} computer
network",
JOURNAL=ieeecom,
VOLUME="COM-20",
PAGES="516-526",
MONTH=jun,
YEAR=1972,
}
@ARTICLE{Chu7206:Demultiplexing,
AUTHOR="Wesley W. Chu",
TITLE="Demultiplexing considerations for statistical multiplexors",
JOURNAL=ieeecom,
VOLUME="COM-20",
PAGES="603-609",
NOTE="also in \cite[p. 54-60]{Chu74:Advances} \cite[p.
285-291]{Gree75:Computer}",
MONTH=jun,
YEAR=1972,
}
@ARTICLE{Kasp7206:Communications,
AUTHOR="D. Kasp and S. Seroussi",
TITLE="A Communications interface for computer networks",
JOURNAL=ieeecom,
VOLUME="COM-20",
PAGES="550-556",
MONTH=jun,
YEAR=1972,
}
@ARTICLE{Pier7206:Far,
AUTHOR="John R. Pierce",
TITLE="How far can data loops go?",
JOURNAL=ieeecom,
VOLUME="COM-20",
PAGES="527-530",
NOTE="also in \cite[p. 114-117]{Chu74:Advances}, \cite[p.
563-566]{Gree75:Computer}",
MONTH=jun,
YEAR=1972,
}
@ARTICLE{Spra7206:Simulation,
AUTHOR="J. D. Spragins",
TITLE="Simulation of a communication processor under extreme loading
conditions",
JOURNAL=ieeecom,
VOLUME="COM-20",
PAGES="609-619",
MONTH=jun,
YEAR=1972,
}
@ARTICLE{Wilk7206:Reliable,
AUTHOR="R. S. Wilkov",
TITLE="Analysis and design of reliable computer networks",
JOURNAL=ieeecom,
VOLUME="COM-20",
PAGES="660-678",
NOTE="also in \cite[p. 382-400]{Chu74:Advances}",
MONTH=jun,
YEAR=1972,
}
@TECHREPORT{Rahk7206:Verkehrstheoretische,
AUTHOR="K. Rahko",
TITLE="Verkehrstheoretische Anwendungen des Erneuerungsprozesses",
INSTITUTION="Telephone Laboratory, Technical University of Helsinki",
ADDRESS="Berlin, Germany",
PAGES=14,
NOTE="Vortrag in Berlin",
MONTH=jun,
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Renewal process",
}
@INPROCEEDINGS{Rahk72:Grade,
AUTHOR="K. Rahko and S. Hertzberg and T. Rahko",
TITLE="Grade of Service and Human Factors",
BOOKTITLE="6th International Sympposium on Human Factors in
Telecommunication",
ADDRESS="Stockholm, Sweden",
PAGES="I.5 (11)",
NOTE="Technical University of Helsinki, Telecommunications Laboratory
Report No. 8/1972. Sähkö - Electricity in Finland. No 10, 1972. 5
pp.",
DAYS=26,
MONTH=jun,
YEAR=1972,
KEYWORDS="GOS; QOS",
}
@ARTICLE{Neav7207:Random,
AUTHOR="H. R. Neave",
TITLE="A random number package",
JOURNAL="Computer Applications in the Natural and Social Sciences",
NUMBER=14,
PAGES="1-55",
MONTH=jul,
YEAR=1972,
KEYWORDS="random variate generation",
}
@ARTICLE{Phil7207:Procedures,
AUTHOR="D. T. Phillips and C. S. Beightler",
TITLE="Procedures for generating gamma variates with non-integer
parameter sets",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=1,
NUMBER=3,
PAGES="197-208",
MONTH=jul,
YEAR=1972,
KEYWORDS="random variate generation",
}
@ARTICLE{Fras7207:Interface,
AUTHOR="A. G. Fraser",
TITLE="On the interface between computers and data communications
systems",
JOURNAL=cacm,
VOLUME=15,
PAGES="566-573",
NOTE="also in \cite[p. 246-253]{Chu74:Advances}",
MONTH=jul,
YEAR=1972,
}
@INPROCEEDINGS{Mads7207:Connection,
AUTHOR="O. B. G. Madsen",
TITLE="The Connection Between Decomposition Algorithms and Optimal
Degree of Decomposition",
BOOKTITLE="NATO Institute on Decomposition",
ADDRESS="Cambridge, Great Britain",
PAGES=10,
MONTH=jul,
YEAR=1972,
KEYWORDS="Decomposition",
}
@ARTICLE{Chri7208:Teletrafikundervisningen,
AUTHOR="G. Christiernin",
TITLE="Teletrafikundervisningen inom {KTH}",
JOURNAL="Elektronik",
ADDRESS="Sweden",
PAGES="7-15",
MONTH=aug,
YEAR=1972,
LANGUAGE="Swedish",
}
@TECHREPORT{Munt7208:Open,
AUTHOR="R. R. Muntz and F. Baskett",
TITLE="Open, Closed, and Mixed Networks of Queues with Different Classes
of Customers",
INSTITUTION="Digital Systems Laboratory, Stanford University",
MONTH=aug,
YEAR=1972,
KEYWORDS="queueing network",
}
@ARTICLE{Greg7209:Comparison,
AUTHOR="J. Gregory",
TITLE="A comparison of floating point summation methods",
JOURNAL=cacm,
VOLUME=15,
NUMBER=9,
PAGES=838,
MONTH=sep,
YEAR=1972,
KEYWORDS="Simulation; statistics; numeric calculation",
}
@ARTICLE{Rell7209:Simple,
AUTHOR="D. A. Relles",
TITLE="A simple algorithm for generating binomial random variables when
N is large",
JOURNAL=jams,
VOLUME=67,
NUMBER=339,
PAGES="612-613",
MONTH=sep,
YEAR=1972,
KEYWORDS="random variate generation",
}
@ARTICLE{Ahre7210:Computer,
AUTHOR="J. Ahrens and U. Dieter",
TITLE="Computer methods for sampling from the exponential and normal
distributions",
JOURNAL=cacm,
VOLUME=15,
NUMBER=10,
PAGES="873-882",
MONTH=oct,
YEAR=1972,
KEYWORDS="simulation; exponential distribution; normal distribution;
random numbers; pseudorandom; numerical analysis",
ABSTRACT="Various methods are known for transforming uniformly
distributed random numbers into exponentially and normally distributed
quantities. The most efficient ones are compared, in terms of memory
requirements and speed, with some new algorithms. A number of procedures
convert Taylor series expansions directly into sampling steps, an
approach which may be used for sampling from any continuous
distribution. For the exponential distribution a definite recommendation
can be made, whereas in the case of the normal distribution there
remains a choice between slower and shorter algorithms and faster but
space consuming methods.",
}
@ARTICLE{Gall7210:Waiting,
AUTHOR="Donald A. Gall and H. R. Mueller",
TITLE="Waiting-Time Distributions and Buffer Overflow in Priority
Queueing Systems",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=5,
PAGES="865-877",
MONTH=oct,
YEAR=1972,
KEYWORDS="discrete time queue",
ABSTRACT="This paper presents a numerical technique for the solution of
a class of queueing problems having fixed priority assignment,
synchronous service, constant service time, and finite number of
sources. The analysis yields waiting time distributions, namely, the
probabilities of waiting exactly $nW$ service cycles or longer. It
applies to scanners, multiplexer channels, loop configurations, etc. It
is especially useful for worst case design in that it permits the
calculation of overflow probabilities. Results are given in the form of
curves and are compared with those for exponential service times. A
priority scheme is outlined that allows partial elimination of the
geometrical priorities inherent to loop multiplexers.",
}
@ARTICLE{Rick7210:Delay,
AUTHOR="Walter C. Rickard",
TITLE="Delay Performance of a Buffered Communication Network",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=5,
PAGES="1008-1015",
MONTH=oct,
YEAR=1972,
KEYWORDS="queueing theory",
ABSTRACT="A model is developed to estimate the passage time of a block
of data through a group of tandem buffered switches of a buffered data
network. In particular, the first two moments and the distribution
function of this block passage time are estimated.",
}
@TECHREPORT{Siem7210:Statistische,
AUTHOR="Siemens and S. E. L",
TITLE="Statistische Angaben über den Fernsprechverkehr und das
Teilnehmer-Verhalten 1972",
INSTITUTION="Interner Bericht EWS1/0717/1-2",
MONTH=oct,
YEAR=1972,
LANGUAGE="German",
KEYWORDS="Telephony; traffic model; blocking",
}
@INPROCEEDINGS{Ande7210:Aspects,
AUTHOR="M. Anderberg",
TITLE="Some Aspects on Traffic Theory in Telecommunication Systems
Engineering",
BOOKTITLE="International Meeting of Communications and Transports",
ADDRESS="Genua",
PAGES=17,
MONTH=oct,
YEAR=1972,
KEYWORDS="Traffic theory; system design",
}
@TECHREPORT{Rahk7210:Telefontrafiksymposiet,
AUTHOR="K. Rahko and A. Myskja and others",
TITLE="Telefontrafiksymposiet",
INSTITUTION="Helsinki University of Technology. Telecommunication
Laboratory",
ADDRESS="Helsinki, Finland",
NUMBER=14,
PAGES=122,
NOTE="12 papers",
MONTH=oct,
YEAR=1972,
LANGUAGE="Finnish",
KEYWORDS="Traffic engineering; telephony",
}
@ARTICLE{Doll7211:Multiplexing,
AUTHOR="D. R. Doll",
TITLE="Multiplexing and concentration",
JOURNAL=ieeeproc,
VOLUME=60,
NOTE="also in \cite{Abra80:Computer}",
MONTH=nov,
YEAR=1972,
}
@ARTICLE{Fano7211:Social,
AUTHOR="R. M. Fano",
TITLE="On the social role of computer communications",
JOURNAL=ieeeproc,
VOLUME=60,
PAGES="1249-1253",
NOTE="also in \cite{Abra80:Computer}",
MONTH=nov,
YEAR=1972,
}
@ARTICLE{Fran7211:Topological,
AUTHOR="M. Frank and Wu Chou",
TITLE="Topological optimization of computer network",
JOURNAL=ieeeproc,
VOLUME=60,
PAGES="1385-1397",
NOTE="also in \cite[p. 270-282]{Chu74:Advances}, \cite[p.
583-594]{Gree75:Computer}",
MONTH=nov,
YEAR=1972,
}
@ARTICLE{Gray7211:Line,
AUTHOR="J. P. Gray",
TITLE="Line control procedures",
JOURNAL=ieeeproc,
VOLUME=60,
PAGES="1301-1312",
NOTE="also in \cite{Abra80:Computer}",
MONTH=nov,
YEAR=1972,
}
@ARTICLE{Knig7211:Case,
AUTHOR="J. R. Knight",
TITLE="A Case Study: Airlines Reservation System",
JOURNAL=ieeeproc,
PAGES="1423-1481",
NOTE="also in \cite{Abra80:Computer}",
MONTH=nov,
YEAR=1972,
}
@ARTICLE{Mill7211:Communication,
AUTHOR="D. L. Mills",
TITLE="Communication software",
JOURNAL=ieeeproc,
VOLUME=60,
PAGES="1333-1341",
NOTE="also in \cite{Abra80:Computer}",
MONTH=nov,
YEAR=1972,
}
@ARTICLE{Newp7211:Communication,
AUTHOR="C. B. Newport and J. Ryzlak",
TITLE="Communication processors",
JOURNAL=ieeeproc,
VOLUME=60,
PAGES="1321-1332",
NOTE="also in \cite{Abra80:Computer}",
MONTH=nov,
YEAR=1972,
}
@ARTICLE{Schw7211:Terminal,
AUTHOR="M. Schwartz and R. R. Boorstyn and R. L. Pickholtz",
TITLE="Terminal-oriented computer communications networks",
JOURNAL=ieeeproc,
VOLUME=60,
PAGES="1408-1423",
NOTE="also in \cite{Abra80:Computer}",
MONTH=nov,
YEAR=1972,
}
@ARTICLE{Balm7212:Single,
AUTHOR="D. W. Balmer",
TITLE="A Single Server Queue in Discrete Time with Customers Served in
Random Order",
JOURNAL=jap,
VOLUME=9,
NUMBER=4,
PAGES="862-867",
MONTH=dec,
YEAR=1972,
KEYWORDS="Discrete-time queues",
ABSTRACT="This paper aims at showing that for the discrete time analogue
of the $M/G/1$ queueing model with service in random order and with a
traffic intensity $\rho>0$, the condition $\rho<\infty$ is sufficient in
order that every customer joining the queue be served eventually, with
probability one (Theorem 2).",
}
@ARTICLE{Stut7212:Data,
AUTHOR="B. W. Stutzman",
TITLE="Data communication control procedures",
JOURNAL=acmcs,
VOLUME=4,
PAGES="197-220",
MONTH=dec,
YEAR=1972,
}