@ARTICLE{Ahre74:Computer,
AUTHOR="J. Ahrens and U. Dieter",
TITLE="Computer Methods for Sampling from Gamma, Beta, Poisson and
Binomial Distributions",
JOURNAL=comp,
VOLUME=12,
NUMBER=3,
PAGES="223-246",
YEAR=1974,
KEYWORDS="simulation",
}
@BOOK{Zuwa74:General,
AUTHOR="Fadil H. Zuwaylif",
TITLE="General Applied Statistics",
EDITION="2nd",
PUBLISHER="Addison-Wesley",
ADDRESS="Reading, Massachusetts",
YEAR=1974,
}
@ARTICLE{Stid74:Last,
AUTHOR="S. Stidham",
TITLE="A last word on $L=\lambda {W$}",
JOURNAL=or,
VOLUME=22,
NUMBER=1,
PAGES="417-421",
YEAR=1974,
REFERENCES=11,
KEYWORDS="Number of elements in system; time in system; traffic;
Little's law",
ABSTRACT="This note gives a rigorous proof of the queueing formula
$L=\lambda W$, using as hypotheses only that the limiting averages,
$\lambda$ and W, exist and are finite. The proof is related to one
given in a previous paper by the author that used a discounted analogue
and tauberian theorems. The proof in the present paper, however, is
direct and avoids the use of transforms.",
}
@ARTICLE{Suur74:Disjoint,
AUTHOR="J. W. Suurballe",
TITLE="Disjoint Paths in a Network",
JOURNAL=networks,
ADDRESS="New York, New York",
VOLUME=4,
PAGES="125-145",
YEAR=1974,
REFERENCES=10,
KEYWORDS="Graph theory; disjoint path; routing algorithm",
ANNOTE="Routes between two given nodes of a network are called
diversified if they are node-disjoint, except at the terminals.
Diversified routes are required for reliability in communication, and an
additional criterion is that their total cost, assumed to be the sum if
individual arc lengths or costs, is minimum. An algorithm and related
theory is described for a general number $K$ of node-disjoint paths with
minimum total length. The algorithm applies",
}
@ARTICLE{Taka74:Single,
AUTHOR="L. Takacs",
TITLE="A single-server queue with limited virtual waiting time",
JOURNAL=jap,
VOLUME=11,
PAGES="612-617",
YEAR=1974,
REFERENCES=4,
KEYWORDS="M/G/1; waiting time; virtual waiting time; distribution",
ANNOTE="The limiting distributions of the actual waiting time and the
virtual waiting time are determined for a single-server queue with
poisson input and general service times in the case where there are two
types of services and no customer can stay in the system longer than an
interval of length m.",
}
@INPROCEEDINGS{Talb74:New,
AUTHOR="A. Talbot",
TITLE="A new method for numerical inversion of Laplace transforms",
BOOKTITLE="IEEE ISCAS",
PAGES="130-133",
YEAR=1974,
REFERENCES=6,
KEYWORDS="Laplace transform; numeric calculation",
}
@ARTICLE{Temb74:Optimal,
AUTHOR="S. V. Tembe and R. W. Wolff",
TITLE="The optimal order of service in tandem queues",
JOURNAL=or,
VOLUME=22,
PAGES="824-832",
YEAR=1974,
REFERENCES=9,
KEYWORDS="Tandem queue; minimization; waiting time; service time",
ANNOTE="This paper considers tandem queues for which the order of
performing service tasks can be changed, the service times being
independent of this order. It determines the optimal order of service
when either the service times of different tasks are nonoverlapping or,
for two queues in tandem, the service time of one task is constant. For
the optimal ordering, the waiting time of every customer is
stochastically smaller than for any other.",
}
@INPROCEEDINGS{Thom74:Implications,
AUTHOR="G. B. Thompson",
TITLE="Network implications of intelligent peripherals",
BOOKTITLE=compcon,
PAGES="125-126",
YEAR=1974,
REFERENCES=3,
KEYWORDS="Communication network; special terminal; future outlook",
}
@ARTICLE{Tijm74:Control,
AUTHOR="H. Tijms",
TITLE="A control policy for a priority queue with removable server",
JOURNAL=or,
VOLUME=22,
PAGES="833-837",
YEAR=1974,
REFERENCES=10,
KEYWORDS="M/G/1; hol priority; removable server",
ANNOTE="This paper studies a control policy for an M/G/1
nonpreemptive-priority queueing system with removable server and two
priority classes. This policy turns off the server when the system is
empty and turns him on when a given linear combination of the numbers of
class 1 and class 2 customers in the system exceeds a certain value.
Expressions for the long-run average numbers of class 1 and class 2
customers in the system are derived.",
}
@ARTICLE{Wash74:Multiserver,
AUTHOR="A. Washburn",
TITLE="A multiserver queue with no passing",
JOURNAL=or,
VOLUME=22,
PAGES="428-434",
YEAR=1974,
REFERENCES=2,
KEYWORDS="M/M/S; arrival time dependent",
ANNOTE="This note deals with a queueing situation where customers must
leave the system in the same order in which they arrive, owing to a
physical constraint that prohibits passing. Poisson input and
(basically) exponential service times are assumed, and the mean waiting
time in the steady state is derived.",
}
@ARTICLE{Will74:Approximate,
AUTHOR="T. R. Willemain",
TITLE="Approximate analysis of a hierarchical queueing network",
JOURNAL=or,
VOLUME=22,
PAGES="522-544",
YEAR=1974,
REFERENCES=8,
KEYWORDS="Simulation; hierarchical network; M/G/1",
ANNOTE="A hierarchical queueing network is a layered network of queues
in which all arrivals receive initial service from a primary server, and
some customers receive additional service jointly from a primary and a
secondary server.",
}
@ARTICLE{Wu74:Rearrangeable,
AUTHOR="F. F. Wu",
TITLE="Rearrangeable connecting networks",
JOURNAL=iscas,
VOLUME=7,
PAGES="333-336",
YEAR=1974,
REFERENCES=3,
KEYWORDS="Switching network",
}
@ARTICLE{Elia74:Topological,
AUTHOR="D. Elias and M. J. Ferguson",
TITLE="Topological Design of Multipoint Teleprocessing Networks",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=11,
PAGES="1753-1762",
YEAR=1974,
REFERENCES=8,
KEYWORDS="Design; multipoint connection; network; multidrop; model",
ABSTRACT="This paper is concerned with the problem of designing a
minimum-cost network of acceptable performance that connects several
remote terminals to a central processor using multidrop lines. A simple
model of the network is used to derive performance con-straints for the
design procedure. A new heuristic design proce-dure is proposed and
compared to other heuristic methods and is found superior in some
cases.",
}
@INPROCEEDINGS{Herz74:Message,
AUTHOR="U. Herzog",
TITLE="Message-switching networks with alternate routing Netze mit
Speichervermittlungen und alternativer Leitweglenkung",
BOOKTITLE=itc7,
ADDRESS="Stockholm, Sweden",
PAGES="174-181",
YEAR=1974,
REFERENCES=20,
KEYWORDS="alternate routing; store-and-forward; network; overflow",
ANNOTE="This paper shows, how to dimension store-and-forward networks
with alternate routing, taking into account the special properties of
overflow traffic. Artificial traffic trials show the good accordance
between simulated and calculated traffic values.",
}
@TECHREPORT{Herz74:Optimal,
AUTHOR="U. Herzog",
TITLE="Optimal scheduling strategies for real-time computers",
INSTITUTION="IBM Research",
PAGES=38,
YEAR=1974,
REFERENCES=14,
KEYWORDS="analysis; real time; preemptive priority; computer system",
ANNOTE="In order to fulfil response-time constraints in real-time
systems, demands are often handled by means of sophisticated scheduling
strategies. This paper first shows how to describe and analyzearbitrary
combinations of preemptive and non-preemptive (head-of-the-line)
priority strategies. An algorithm is next presented which yields the
optimal priority strategy, taking into conside-ration constraints on the
response-time.",
}
@ARTICLE{Kers74:Unified,
AUTHOR="A. Kershenbaum and Wu Chou",
TITLE="A Unified Algorithm for Designing Multidrop Teleprocessing
Networks",
JOURNAL=ieeecom,
VOLUME="COM-22",
NUMBER=11,
PAGES="1762-1772",
YEAR=1974,
REFERENCES=18,
KEYWORDS="Algorithm; multidrop; network planning; design",
ANNOTE="The problem of designing minimum-cost multidrop lines which
con-nect remote terminals to a concentrator or a central data-pro-
cessing computer is studied. For the solution of this problem a unifying
modification of Kruskal's MST algorithm is developed. An extension of
the algorithm to the solution of an associated problem of partitioning
the terminals with respect to a predetermined set of hardware units
(central computer) is also derived.",
}
@ARTICLE{Ohba74:Packet,
AUTHOR="H. Ohba and Y. Yoshida and T. Nakajo and T. Nagata",
TITLE="On the Packet-Interleaved Interface Between Packet-Switched
Network and Computers",
JOURNAL=ieeecom,
VOLUME="COM",
PAGES="1671-1675",
YEAR=1974,
REFERENCES=6,
KEYWORDS="Control; packet switching; network; data link; HDLC",
ANNOTE="This paper describes a transmission control procedure for
computer-to-computer and computer-to-terminal communication through a
public packet-switched network. By introducing the concept of a data
link and a process number, a transmission control method and a call
control method between packet-switched network and computers are
proposed for the packet-interleaved communication on the basis of the
HDLC procedure.",
}
@ARTICLE{Papo74:Estimation,
AUTHOR="A. Papoulis",
TITLE="Estimation of the Average Density of a Nonuniform Poisson
Process",
JOURNAL=ieeecom,
VOLUME="COM-22",
NUMBER=2,
PAGES="162-167",
YEAR=1974,
REFERENCES=8,
KEYWORDS="Statistics; estimation; Poisson distribution; process",
ANNOTE="The average density $\Lambda(t)$ of a Poisson Process is
estimated by a nonstationary shot noise process $s(t)$. The process
$s(t)$ is generated by a time-varying system whose impulse response
$h(t,a)$ is so determined as to minimize the mean-square (MS) estimation
error. It is shown that under realistic assumptions, $h(t,a)$ is
atruncated parabola in the variable. The analysis is extended to
two-dimensional processes.",
}
@ARTICLE{Boss74:Inequality,
AUTHOR="J. van Bosse",
TITLE="On an Inequality for the Congestion in Switching Networks",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=10,
PAGES="1675-1677",
YEAR=1974,
REFERENCES=5,
KEYWORDS="Congestion; inequality; switching network",
ANNOTE="A basic inequality of le Gall, involving the congestion in
four-stage switching networks, is generalized. The basic inequality
remains valid in the case of arbitrary occupancy distributions on all
link groups in the network.",
}
@ARTICLE{Hafn74:Digital,
AUTHOR="E. R. Hafner and Z. Nenadal and M. Tschanz",
TITLE="A Digital Loop Communication System",
JOURNAL=ieeecom,
VOLUME=22,
PAGES="877-881",
YEAR=1974,
REFERENCES=9,
KEYWORDS="Performance evaluation; loop system; communication system",
ANNOTE="The concept of a local loop communication system with
distributed control is described.",
}
@ARTICLE{Aber74:Precise,
AUTHOR="O. Aberth",
TITLE="A precise numerical analysis program",
JOURNAL=cacm,
VOLUME=17,
PAGES="509-513",
YEAR=1974,
REFERENCES=11,
KEYWORDS="Method; realization; numerical method; optimization;
information system; program construction; error control; interval
arithmetic",
ANNOTE="A description is given of a program for computing the solution
to a small number of standard numerical analysis problems to any
specified accuracy, up to a limit of 2000 correct decimal places. Each
computed number is bounded in an interval with a multiple precision
midpoint. Arithmetic operations involving these numbers are executed
according to interval arithmetic concepts, with non-significant digits
automatically discarded.",
}
@ARTICLE{Adir74:Optimal,
AUTHOR="I. Adiri and U. Yechiali",
TITLE="Optimal priority-purchasing and pricing decisions in nonmonopoly
and monopoly queues",
JOURNAL=or,
VOLUME=22,
PAGES="1051-1066",
YEAR=1974,
REFERENCES=8,
KEYWORDS="M/M/1; priority; cost; optimization; balking",
ABSTRACT="An M/M/1 service station (computer center) consists of m
separate queues. The $i$-th $(i=1,2,\ldots,m)$ queue has priority over
the $j$-th iff $i