@BOOK{Kost73:Stochastic, AUTHOR="L. Kosten", TITLE="Stochastic Theory of Service Systems", PUBLISHER="Pergamon Press", ADDRESS="Oxford", YEAR=1973, KEYWORDS="queueing theory", ANNOTE="general introductory text; sections on batch arrivals with exponential holding time and batch service with constant holding time; transient behavior of $M/M/c/K$ queue and $M/G/1$ system delay.", } @ARTICLE{Kucz7305:Loss, AUTHOR="Anatol Kuczura", TITLE="Loss Systems with Mixed Renewal and Poisson Inputs", JOURNAL=or, VOLUME=21, NUMBER=3, PAGES="787-795", MONTH="May-June", YEAR=1973, KEYWORDS="queueing theory; loss system", ABSTRACT="When two independent streams of customers compete for the same servers, as happens for example when first-routed and overflow traffic streams share a single trunk group, the state of the system seen by the two different types of arriving customers will in general be different. In a loss system with mixed renewal and Poisson inputs, the blocking experienced by the renewal-type customers can be markedly different from that seen by the Poissonian customers. This paper derives the distribution of the number of busy servers seen by the two streams, and outlines a numerical procedure for computing the distributions. Examples of blocking probabilities for two cases of the renewal stream are given.", } @INPROCEEDINGS{Magi73:Adaptive, AUTHOR="D. T. Magill", TITLE="Adaptive speech compression for packet communication systems", BOOKTITLE=ntc, PAGES="29D-1-29D-5", YEAR=1973, KEYWORDS="packet voice; LPC; variable-rate coder; speech coding", ABSTRACT="Packet communication systems offer many significant advantages for low duty factor user populations. These advantages can be applied to voice communication. Additional data compression beyond that achievable with the new linear predictive encoding techniques can be obtained by exploiting the asynchronous character of the packet communication channel. The adaptive data compression algorithm DELCO achieves a compression factor greater than 2 while maintaining high quality.", } @ARTICLE{Slat73:Steady, AUTHOR="N. B. Slater and T. C. T. Kotiah", TITLE="The steady state of a multi-server mixed queue", JOURNAL=aap, VOLUME=5, PAGES="614-631", YEAR=1973, REFERENCES=6, KEYWORDS="M/M/s; geometric distribution; z-transform", ANNOTE="In a multi-server queueing system in which the customers are of several different types, it is useful to define states which specify the types of customers being served as well as the toatl number present. Analogies with some problems in statistical mechanics are found fruitful. Certain generating functions are defined in such a way that they satisfy a system of linear equations. Solutions of the associated eigenvector problem shows that the", } @ARTICLE{Spir73:New, AUTHOR="P. M. Spira", TITLE="A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time $O(n\log n)$", JOURNAL=sicomp, VOLUME=2, PAGES="28-32", YEAR=1973, REFERENCES=4, KEYWORDS="Shortest path", ANNOTE="We present a new algorithm for finding the shortest path between each pair of nodes in a directed nonnegatively weighted graph. Our algorithm has average running time $O(n\log n)$ where the graph has $n$ nodes in contrast to previous algorithms in the literature, all of whose average running times are for this problem.", } @ARTICLE{Toot73:Asymptotically, AUTHOR="J. P. R. Tootill and W. D. Robinson and D. J. Eagle", TITLE="An asymptotically random Tausworthe sequence", JOURNAL=jacm, VOLUME=20, PAGES="469-481", YEAR=1973, REFERENCES=9, KEYWORDS="Tausworthe generator; shift register sequences; random number generation; test", ANNOTE="The theoretical limitations on the orders of equidistribution attainable by tausworthe sequences are derived from first principles and are stated in the form of a criterion to be achieved. A second criterion, extending these limitations to multidimensi onal uniformity, is also defined. A sequence possessing both properties is said to be asymptotically random as no other sequence of the same period could be more random in these respects.", } @ARTICLE{Slyk73:Avoiding, AUTHOR="R. van Slyke and Wu Chou and H. Frank", TITLE="Avoiding simulation in simulating computer communication networks", JOURNAL=afips, VOLUME=42, PAGES="165-169", YEAR=1973, REFERENCES=11, KEYWORDS="communication network; simulation; design", ABSTRACT="In order to obtain useable results careful attention must be paid to determining the key features of the system to be considered before the simulation is designed and approximating. In this paper, we discuss three approaches. The first technique takes advantage of situations where the significant events occur infrequently. A common example is in studies involving infrequent data errors or equipment failures. The second idea is the conve", } @ARTICLE{Watk73:Masked, AUTHOR="S. L. Watkins", TITLE="Masked three-dimensional plot program with rotations", JOURNAL=cacm, VOLUME=17, PAGES="520-523", YEAR=1973, KEYWORDS="Fortran; graphics; application; method; human factors", } @BOOK{Whit73:Course, AUTHOR="E. T. Whittaker and G. N. Watson", TITLE="A course of modern analysis", PUBLISHER="Cambridge University Press", PAGES="1-608", YEAR=1973, KEYWORDS="Survey; function theory", ANNOTE="An introduction to the general theory of infinite processes and of analytic functions; with an account of the principal transcendental functions.", } @ARTICLE{Wign73:Priority, AUTHOR="T. K. Wignall", TITLE="Priority queueing systems with and without feedback", JOURNAL=or, VOLUME=21, PAGES="764-786", YEAR=1973, REFERENCES=5, KEYWORDS="Hol priority; feedback; M/G/1", ANNOTE="Such results as those determining the amount of storage to allocate to each service, and assessing whether the system can cope with the expected number of arriving customers are independent of the priority set, so that these results have very wide applicability.", } @ARTICLE{Wolf73:Zur, AUTHOR="D. Wolf", TITLE="Zur Genauigkeit der Bestimmung der {AKF} aus der Polaritätskorrelationsfunktion", JOURNAL=aeu, VOLUME=27, PAGES="279-", YEAR=1973, LANGUAGE="German", KEYWORDS="Time series analysis; autocorrelation", } @ARTICLE{Wolf73:Verteilungsdichte, AUTHOR="D. Wolf and H. Brehm", TITLE="Die Verteilungsdichte der Zeitintervalle zwischen Nulldurchgängen bei Gaußschen stochastischen Signalen", JOURNAL=aeu, VOLUME=27, PAGES="477-", YEAR=1973, LANGUAGE="German", KEYWORDS="Time series analysis", } @ARTICLE{Yage73:Minimum, AUTHOR="B. Yaged", TITLE="Minimum Cost Routing for Dynamic Network Models", JOURNAL=networks, VOLUME=3, PAGES="193-224", YEAR=1973, REFERENCES=9, KEYWORDS="Routing algorithm; dynamic routing", ANNOTE="This paper presents a heuristic technique which attempts to minimize the present worth of first cost (PWFC) needed to satisfy the growth in point-to-point flow requirements for a dynamic (in time) model of the long-haul communications network which spans the United States. This extends earlier work on the design of static (in time) multicommodity flow networks in which each link cost function is a concave function of the link flow. The cost", } @INPROCEEDINGS{Caba73:Optimization, AUTHOR="P. A. Caballero and F. Diaz Lopez", TITLE="Optimization of networks of hierarchical structure with non-coincident busy hours", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", PAGES="421/1-421/6", YEAR=1973, REFERENCES=3, KEYWORDS="Optimization; iterative method; hierarchical network", ANNOTE="A method for the economic optimization of hierarchical organizedtelephone networks with alternative routing and non-coincident busy hours is described. The proposed method uses the gradient iterative algorithm for the optimization process. It is shown inthis paper that the computation of the gradient components can be done in a recurrent way by always using the same basic equation.", } @INPROCEEDINGS{Fred73:Traffic, AUTHOR="G. Fredrikson", TITLE="Performance of traffic concentrators in data communication systems", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", PAGES="444/1-444/7", YEAR=1973, REFERENCES=14, KEYWORDS="Analysis; discrete time queue; single server; B/D/1; FIFO", ANNOTE="An analysis of the discrete-time queuing problem: binomial input, constant message length, infinite queue length, one server, iscarried out. The state probabilities are calculated using the method of imbedded Markov chains, and the results are applied tothe problem of determining characteristic features in the performance of traffic concentrators.", } @INPROCEEDINGS{Gosz73:Full, AUTHOR="G. Gosztony", TITLE="Full availibility one-way and both-way trunk groups with delay and loss type traffic, finite number of traffic sources, and limited queue length", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", PAGES="341/1-341/8", YEAR=1973, REFERENCES=11, KEYWORDS="Delay loss model; calculation; method; finite source", ABSTRACT="An exact method was developed for the calculation of full availibility single stage trunk groups with delay type and loss type traffic supposing random input, exponentially distributed holdingtimes, finite number of traffic sources and a limited queue length. For both-way trunk groups the state probability may be given if the holding times of delay and loss calls are equal. For the one-way trunk group they should determined numerically (linear equations).", } @INPROCEEDINGS{Hatt73:Traffic, AUTHOR="N. Hattori and K. Yamada", TITLE="Traffic characteristics of the international telex calls", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", PAGES="443/1-443/8", YEAR=1973, REFERENCES=5, KEYWORDS="analysis; traffic measurement; telex", ANNOTE="This paper reports results of measurements of the traffic characteristics in the existing international telex trunk circuits, and the analysis of these traffic characteristics along with mathematical discussions, in comparison with such characteristics of the other main international public communications.", } @ARTICLE{Isph73:Wahrscheinlichkeitsverteilungen, AUTHOR="U. Isphording", TITLE="Wahrscheinlichkeitsverteilungen zur Synchronisierungszeit bei der Blocksynchronisation in Zeitmultiplexsystemen", JOURNAL=aeu, VOLUME=27, NUMBER=6, PAGES="253-257", YEAR=1973, LANGUAGE="German", REFERENCES=3, KEYWORDS="Analysis; probability; distribution; synchronization; PCM", ANNOTE={Here the probability distribution is deduced for the number of "dummy" synchronization words simulated by message bits the receiver may detect before a genuine synchronization word arrives. This distribution allows data to be obtained for the synchronization time and conclusions to be drawn as to the most suitable block size and length of the synchronization word. The numericalexamples were calculated on the basis of the devised formulas.}, } @INPROCEEDINGS{Mizu73:Uncertainty, AUTHOR="M. Mizuki", TITLE="Uncertainty theory applicable to traffic models", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", PAGES="226/1-226/5", YEAR=1973, REFERENCES=8, KEYWORDS="Queueing theory; traffic model", } @INPROCEEDINGS{Nive73:Methods, AUTHOR="K. Nivert and C. von Schantz", TITLE="Some methods for improving the efficiency of simulation programs", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", PAGES="214/1-214/5", YEAR=1973, REFERENCES=4, KEYWORDS="Regression analysis; simulation; loss system; statistics", ANNOTE="Two techniques that are applicable in simulation of loss systemsare described. The first consists of an application of statisti-cal sequential analysis by which the observed blocking of the simulation is directed towards a given value. The second techni-que is the use of regression analysis in compiling dimensioning tables for gradings.", } @ARTICLE{Sche73:Entwurf, AUTHOR="K. D. Schenkel", TITLE="Entwurf eines integrierten digitalen Nachrichtensystems mit Vielfachzugriff für ein beliebig verzweigtes Breitbandnetz", JOURNAL=aeu, VOLUME=27, NUMBER=4, PAGES="168-176", YEAR=1973, LANGUAGE="German", REFERENCES=9, KEYWORDS="Integrated network; digital; communication network; LAN", ANNOTE="Der Artikel zeigt ein Vielfachzugriffsverfahren mit Informationsrückführung für Nachrichtenübertragung in einem beliebigen verzweigten Breitbandnetz auf. Darüberhinaus wird eine Übersicht über Multiplexverfahren gegeben.", } @INPROCEEDINGS{Sole73:General, AUTHOR="R. R. Solem", TITLE="A general principle of traffic distribution", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", PAGES="143/1-143/4", YEAR=1973, KEYWORDS="Traffic distribution; traffic flow analysis; calculation", ANNOTE="A method is developed by which it is possible to calculate the most probable traffic flow within a network of exchanges, these being treated as sources and/or sinks of traffic. The basis of the calculations is the total traffic generated and terminated in each exchange area. The important case of a partially known traffic matrix is considered, and an outline of the calculating procedure for a network with transit exchanges is offered.", } @INPROCEEDINGS{Gran73:Traffic, AUTHOR="C. Grandjean", TITLE="Traffic Calculations in Saturation Routing with Priorities", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", PAGES="442/1-442/8", YEAR=1973, REFERENCES=3, KEYWORDS="Saturation routing; priority; performance evaluation", ANNOTE="Analysis of a channel performance in a saturation routing network. The channel is loaded with calls of various priorities.", } @BOOK{Mend73:Mathematical, AUTHOR="William Mendenhall and Richard L. Scheaffer", TITLE="Mathematical statistics with applications", ISBN="0-87872-047-2", PUBLISHER="Duxbury Press", ADDRESS="North Scituate, Massachusetts", YEAR=1973, KEYWORDS="statistics", } @ARTICLE{Abra73:Packet, AUTHOR="N. Abramson", TITLE="Packet switching with satellites", JOURNAL=afips, VOLUME=42, PAGES="695-702", NOTE="Reproduced in \cite[p. 68-75]{Chu74:Advances} \cite[p. 501-508]{Gele74:Computer}", YEAR=1973, REFERENCES=20, KEYWORDS="Packet switching; satellite radio; ALOHA; channel capacity", ABSTRACT="A proposal is given for using a satellite channel for a packet switched communication link. Some formulas are presented for the channel capacity.", } @ARTICLE{Adir73:Multiprogramming, AUTHOR="I. Adiri and M. Hofri and M. Yadin", TITLE="A multiprogramming queue", JOURNAL=jacm, VOLUME=20, NUMBER=4, PAGES="589-603", YEAR=1973, REFERENCES=10, KEYWORDS="Queueing system; priority", ANNOTE="Description of a simple computer system (CPU, I/O unit) which works in a multiprogramming manner under a heavy load. The incoming queue is never empty and the service times are exponentially distributed independent random variables. Head of the line priority of programs which are being processed over newcomers is considered. The system is compared with two others: one working in ``batch mode'' and another multiprogramming system.", } @ARTICLE{Ali73:Distribution, AUTHOR="H. Ali", TITLE="Distribution of the mean queue size for the time-dependent queue", JOURNAL=or, VOLUME=21, PAGES="636-638", YEAR=1973, REFERENCES=2, KEYWORDS="GI/G/1; queue length; instationary process; time dependent queueing system", ANNOTE="This paper derives the Laplace-Stieltjes transform of the mean queue size for the time-dependent GI/G/1 queue, with an arrival at $t=0$. It also obtains the probability of the queue being empty at time $t$. These results are based on the departure process for this queue.", } @ARTICLE{Ande73:Simulation, AUTHOR="L. G. Anderson", TITLE="A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system", JOURNAL=ieeecom, VOLUME="COM-21", PAGES="1294-1301", YEAR=1973, KEYWORDS="MAT; DCA; dynamic channel assignment; simulation", ANNOTE="Channel borrowing", } @ARTICLE{Avi73:Approximate, AUTHOR="B. Avi-Itzhak and D. P. Heyman", TITLE="Approximate queueing models for multiprogramming computer systems", JOURNAL=or, VOLUME=21, PAGES="1212-1230", YEAR=1973, REFERENCES=7, KEYWORDS="Closed queueing network; queueing approximation; model; computer system; multiprogramming", ABSTRACT="In a multiprogramming computer system several jobs may be handled simultaneously by utilizing the central processing unit in processing one job while other jobs are being served by the peripheral devices. Our analysis of such a computer system proceeds in the following way. First we view the system as a closed queueing network with a fixed number of jobs, and obtain exact results for customer cycle times and server utilization.", } @ARTICLE{Bair73:APET, AUTHOR="R. Baird", TITLE="{APET} - a versatile tool for estimating computer application performance", JOURNAL=spe, VOLUME=3, PAGES="385-395", YEAR=1973, KEYWORDS="Performance evaluation; software; measurement; benchmark", ANNOTE="This article describes a technique for controlling computer system activity in order to measure selected hardware or software functions, as they interact within an application under real operating conditions. Apet is an approach for manufacturing synthetic benchmark or yardstick programs that exercise the computer system.", } @ARTICLE{Bell73:Efficient, AUTHOR="C. E. Bell", TITLE="Efficient operation of optimal-priority queueing systems", JOURNAL=or, VOLUME=21, PAGES="777-786", YEAR=1973, REFERENCES=5, KEYWORDS="M/G/1; HOL priority; cost", ANNOTE="This paper studies an M/G/1 queueing system with two classes of customers. The cost per unit time of holding a customer differs for the two classes. The server has the option of serving the first customer in line at no extra charge or paying a fee to earn the rightto serve any higher-class customer further back in the queue. The paper finds an optimal policy for the simple case where this fee is independent of the position in the queue of the", } @ARTICLE{Berk73:Minimum, AUTHOR="A. J. Berkhout", TITLE="On the Minimum Phase Criterion of Sampled Signals", JOURNAL="IEEE transactions on Geoscience Electronics", VOLUME="GE-11", PAGES="186-198", YEAR=1973, REFERENCES=18, KEYWORDS="Mathematics", } @BOOK{Clar73:Designing, AUTHOR="C. R. Clare", TITLE="Designing logic systems using state machines", PUBLISHER="McGraw Hill", ADDRESS="New York", YEAR=1973, KEYWORDS="Microprogramming", } @INPROCEEDINGS{Clos73:Packet, AUTHOR="F. Closs", TITLE="Packet arrival and buffer statistics in a packet switching node", BOOKTITLE="3rd IEEE Data Communication Symposium on Data Networks Analysis and Design", ADDRESS="St. Petersburg", PAGES="12-17", YEAR=1973, REFERENCES=10, KEYWORDS="Packet switching; arrival process; diffusion approximation; performance evaluation", } @ARTICLE{Cohe73:Asymptotic, AUTHOR="J. W. Cohen", TITLE="Asymptotic relations in queueing theory", JOURNAL="Stochastic Processes and their Applications", VOLUME=1, PAGES="107-123", YEAR=1973, REFERENCES=14, KEYWORDS="GI/G/1; queueing approximation; heavy traffic approximation; iffusion approximation; waiting time; busy period; queue length; relaxation time; regular variation; exponential tail; limit theorem; extreme value theorem", ANNOTE="For the GI/G/1 queueing system a number of asymptotic results are reviewed. Discussed are asymptotics related to the time parameter for $T$ to infinite, relaxation times, heavy traffic theory, restricted accessibility with large bounds, approximation by diffusion processes, exponential and regular variation of the tail of the waiting time distribution, limit theorems and extreme value theorems.", } @INPROCEEDINGS{Cohe73:Aspects, AUTHOR="J. W. Cohen", TITLE="Some aspects of queueing theory", BOOKTITLE=itc7, ADDRESS="Stockholm", PAGES="321-327", YEAR=1973, KEYWORDS="Queueing system", ANNOTE="Overview", } @ARTICLE{Cole73:ACCNET, AUTHOR="M. L. Coleman", TITLE="{ACCNET} - a corporate computer network", JOURNAL=afips, VOLUME=42, PAGES="133-140", YEAR=1973, REFERENCES=56, KEYWORDS="computer network; private network", ANNOTE="This paper explains the concept of a network and gives examples of existing networks. It discusses the justifications for a corporate computer network, outlines a proposed stage by stage development, and analyzes and proposes solutions for several of the problems inherent in such a network. These include: software and hardware interfaces, movement of files between dissimilar machines and file security.", } @ARTICLE{Cox73:Increasing, AUTHOR="Donald Cox and D. O. Reudink", TITLE="Increasing Channel Occupancy in Large Scale Mobile Radio Systems: dynamic channel reassignment", JOURNAL=ieeecom, VOLUME="COM-21", PAGES="1302-1306", YEAR=1973, KEYWORDS="MAT; DCA; dynamic channel assignment; simulation", ANNOTE="refinement of hybrid methods: first application of channel reassignment", } @ARTICLE{Smit73:Some, AUTHOR="J. de Smit", TITLE="Some general results for many server queues", JOURNAL=aap, VOLUME=5, PAGES="153-169", YEAR=1973, REFERENCES=12, KEYWORDS="G/G/N; waiting time; virtual waiting time; busy period; queue length; output process", ANNOTE="Pollaczek's theory for the many server queue is generalized and extended. Pollaczek (1961) found the distribution of the actual waiting times in the model G/G/S as a solution of a set of integral equations. We give a somewhat more general set of integral equations from which the joint distribution of the actual waiting time and some other random variables may be found. With this joint distribution we can obtain distributions of a number of cha", } @ARTICLE{Smit73:Many, AUTHOR="J. de Smit", TITLE="On the many server queue with exponential service times", JOURNAL=aap, VOLUME=5, PAGES="170-182", YEAR=1973, REFERENCES=8, KEYWORDS="G/M/N; waiting time; virtual waiting time; busy period; queue length; output process", ABSTRACT="The general theory for the many server queue due to Pollaczek (1961) and generalized by the author (de Smit (1973)) is applied to the system with exponential service times. In this way many explicit results are obtained for the distributions of characteristic quantities, such as the actual waiting time, the virtual waiting time, the queue length, the number of busy servers, the busy period and the busy cycle. Most of these results are new, even", } @ARTICLE{Coul73:Pseudorandom, AUTHOR="F. de Coulon and P. A. Rumley", TITLE="Pseudorandom Poisson-process generator", JOURNAL=elet, VOLUME=9, PAGES="466-467", YEAR=1973, REFERENCES=5, KEYWORDS="design; realization; method; shift register sequences; Poisson distribution", ABSTRACT="A method for generating an impulse train or a binary signal (random telegraph waveform) with pseudorandom poisson statistics is described. It uses the properties of the binomial distribution to approach the poisson distribution in the limit. A simple digital-hardware implementation, based on this method, is presented, and some test results are given.", } @INPROCEEDINGS{Diet73:Telephone, AUTHOR="G. Dietrich", TITLE="Telephone traffic model for common control investigations", BOOKTITLE=itc7, ADDRESS="Stockholm", PAGES=331, YEAR=1973, KEYWORDS="Circuit switching; SPC; switching system", } @INPROCEEDINGS{Enom73:Mixtures, AUTHOR="O. Enomoto and H. Miyamoto", TITLE="An analysis of mixtures of multiple bandwidth traffic on time division switching networks", BOOKTITLE=itc7, ADDRESS="Stockholm", PAGES=635, YEAR=1973, KEYWORDS="Computer network; performance evaluation; multichannel", ANNOTE="Full availability; limited availability", } @ARTICLE{Fell73:Statistische, AUTHOR="J. Fellinger and H. Gutsche", TITLE="Statistische Toleranz-Analyse elektrischer Netzwerke", JOURNAL="Frequenz", VOLUME=27, NUMBER=8, PAGES="214-217", YEAR=1973, LANGUAGE="German", KEYWORDS="approximation; method; Pearson family distribution; linear network", ANNOTE="The probability distributions for the values of system functions of electrical networks are calculated for given distributions of the component parameters in their tolerance areas. The algorithm is based on the system of pearson's curves and the moments of the wanted distribution are supposed to be known. As an example the proposed method for tolerance analysis is applied to a lowpass filter of degree seven. In connection with the computation", } @BOOK{Fish73:Concepts, AUTHOR="G. S. Fishman", TITLE="Concepts and methods in discrete event digital simulation", ISBN="0-471-26155-6", PUBLISHER="John Wiley", ADDRESS="New York", PAGES=385, YEAR=1973, REFERENCES=208, KEYWORDS="Discrete event simulation", ANNOTE="THE first book on simulation!", } @ARTICLE{Forn73:Viterbi, AUTHOR="G. D. Forney", TITLE="The Viterbi algorithm", JOURNAL=ieeeproc, VOLUME=61, PAGES="268-278", YEAR=1973, KEYWORDS="Coding theory; Viterbi", } @ARTICLE{Frat73:Flow, AUTHOR="L. Fratta and M. Gerla and L. Kleinrock", TITLE="The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design", JOURNAL=networks, VOLUME=3, PAGES="97-133", YEAR=1973, REFERENCES=30, KEYWORDS="Routing algorithm; packet switching; network flow; optimization", ANNOTE="Two problems relevant to the design of a store-and-forward communication network (the message routing problem and the channel capacity assignment problem) are formulated and are recognized to be essentially non-linear, unconstrained multicommodity flow problems. A ``Flow Deviation'' method for the solution of these non-linear, unconstrained multicommodity flow problems is described which is quite similar to the gradient method for functions of", } @ARTICLE{Gaug73:Coding, AUTHOR="A. Gaugg and H. Weinrichter", TITLE="Coding of special m-sequences by digital data scramblers", JOURNAL=ntz, VOLUME=26, PAGES="234-236", YEAR=1973, KEYWORDS="Shift register sequences", } @ARTICLE{Gaug73:Grenzen, AUTHOR="A. Gaugg and others", TITLE="Grenzen der Eignung von Pseudozufallsfolgen für statistische Tests", JOURNAL=aeu, VOLUME=27, PAGES="30-", YEAR=1973, LANGUAGE="German", KEYWORDS="Shift register sequences; random number generation; statistics", } @PHDTHESIS{Gerl73:Store, AUTHOR="M. Gerla", TITLE="The design of store-and-forward {(S/F)} networks for computer-communications", SCHOOL="University of California", ADDRESS="Los Angeles, California", PAGES=300, YEAR=1973, REFERENCES=66, KEYWORDS="Computer network; store-and-forward; channel capacity; routing; network delay; ARPAnet; math. programming technique", ANNOTE="THE emphasis of this research is on the development of mathematical programming tools for the design of s/f communication networks. an analytical model for the system is first presented and discussed. the design variables, (routing of messages, channel capacities, topology, etc.) are then defined and proper design CRITERIA (delay, cost, throughput, etc.) are established and expressed in terms of the variables. next, various design problems are def", } @INPROCEEDINGS{Gerl73:Deterministic, AUTHOR="M. Gerla", TITLE="Deterministic and Adaptive Routing Policies in Packet-Switched Computer Networks", BOOKTITLE="3 rd Data Communication Symposium", ADDRESS="Petersburg, Fl", PAGES="23-28", YEAR=1973, REFERENCES=13, KEYWORDS="Routing algorithm; packet switching; adaptive routing; deterministic routing", ANNOTE="Efficient routing policies are required for both design and operation of distributed, packet-switched computer networks. In the network design process, deterministic policies are generally used. For the routing of packets in a real network, on the other hand, adaptive policies, which can adjust to traffic fluctuations and component failures are implented. Therefore, a computer network is typically optimized with respect to a deterministic", } @BOOK{Gned73:Elementare, AUTHOR="B. W. Gnedenko and A. J. Chintschin", TITLE="Elementare Einführung in die Wahrscheinlichkeitsrechnung", PUBLISHER="VEB Verlag der Wissenschaften", ADDRESS="Berlin", PAGES=174, YEAR=1973, LANGUAGE="German", REFERENCES=25, KEYWORDS="Stochastic process; probability theory", } @ARTICLE{Gree73:Distribution, AUTHOR="I. Greenberg", TITLE="Distribution-free analysis of {M/G/1} and {G/M/1} queues", JOURNAL=or, VOLUME=21, PAGES="629-635", YEAR=1973, REFERENCES=14, KEYWORDS="M/G/1; G/M/1; sampling", ANNOTE="The substantial gap between the state of the art of queueing theory and its application to real-world problems has been commented on by several authors: existing queueing models are either too specialized to be applied to a general problem or too generalized (usually in terms of Laplace transforms and/or generating functions) to be applied to a specific problem. This paper bridges this gap by constructing queueing models without making assumpti", } @ARTICLE{Guts73:Beitrag, AUTHOR="H. Gutsche", TITLE="Ein Beitrag zur Berechnung der Wahrscheinlichkeitsdichten von Sy stemfunktionen elektrischer Netzwerke", JOURNAL="Frequenz", VOLUME=27, NUMBER=2, PAGES="45-51", YEAR=1973, LANGUAGE="German", REFERENCES=11, KEYWORDS="Approximation; method; Laguerre polynomial; Hermite polynomial; linear network", ANNOTE="For linear electrical networks, the system functions whose tolerance distributions are to be determined for given distributions of the component parameters are represented by approximations of second order. For these approximations the probability moments are determined from which the probability distributions are calculated by series expansions in terms of laguerre and hermite polynomials or by using a polynomial approximation.", } @ARTICLE{Hein73:Wartezeiten, AUTHOR="O. Hein", TITLE="Wartezeiten für beliebige Verteilungsfunktionen der Bedienzeiten", JOURNAL=aninf, NUMBER=7, PAGES="281-289", YEAR=1973, LANGUAGE="German", REFERENCES=11, KEYWORDS="Queueing system; M/G/1; waiting time", } @BOOK{Hofm73:Informationstheorie, AUTHOR="K.-D. Hofmann", TITLE="Einführung in die Informationstheorie", PUBLISHER="Pädagogischer Verlag Schwann", ADDRESS="Düsseldorf", PAGES="1-80", YEAR=1973, LANGUAGE="German", REFERENCES=40, KEYWORDS="Information theory; survey; bibliography; solved exercise", ANNOTE="A. Einleitung: gegenstand und methoden der informationstheorie b. Das informationsmass: 1. Zeichen und signal 2. Die entropie eines endlichen wahrscheinlichkeitsraumes. 3. Der eindeutigkeits satz. 4. Eigenschaften des informationsmasses. 5. Probleme der textcodierung. C. übertragungssysteme: 1. Informationsquellen 2. Der satz von mcmillan.3. Kanäle.4. übertragungsgeschwindigkeit und kanalkapazität.5.", } @ARTICLE{Kamp73:Simulation, AUTHOR="G. Kampe and P. J. Kühn and M. Langenbach-Belz", TITLE="Simulation in der Nachrichtenverkehrstheorie: Problemstellungen und Programmiersprachen", JOURNAL="Fachgespräch über Methodik der rechnergestützten Simulation", ADDRESS="Karlsruhe", PAGES="240-263", YEAR=1973, LANGUAGE="German", REFERENCES=32, KEYWORDS="Discrete event simulation; programming language", } @ARTICLE{Kapa73:K, AUTHOR="A. S. Kapadia", TITLE="A K-server queue with phase input and service distribution", JOURNAL=or, VOLUME=21, PAGES="623-628", YEAR=1973, REFERENCES=7, KEYWORDS="PH/PH/N; number of idle servers", ANNOTE="This paper obtains a simple expression for the expected number of idle servers in the steady state for a queue with $k$ servers, and a phase input and service distribution. No assumption is made regarding the order in which customers are served, except that the servers cannot sit idle as long as there are customers waiting to be served.", } @INPROCEEDINGS{Klei73:Packet, AUTHOR="L. Kleinrock and S. S. Lam", TITLE="Packet-switching in a slotted satellite channel", BOOKTITLE="AFIPS", VOLUME=42, PAGES="703-710", NOTE="also in \cite[p. 76-84]{Chu74:Advances}", YEAR=1973, REFERENCES=13, KEYWORDS="Packet switching; satellite radio; slotted ALOHA; TDMA; time division multiple access", ANNOTE="In this paper we have analyzed the performance of a slotted satellite system for packet-switching. In our first model, we have displayed the trade-off between average delay and average throughput and have shown that in the case of traffic consisting of a large number of small users, the limiting throughput of the channel $(1/e)$ can be approached fairly closely without an excessive delay. This performance can be achieved at relatively small value", } @ARTICLE{Klim73:Algorithm, AUTHOR="Eugene M. Klimko", TITLE="An algorithm for calculating indices in Faa di Bruno's formula", JOURNAL="BIT", VOLUME=13, PAGES="38-49", YEAR=1973, REFERENCES=2, KEYWORDS="Faa di bruno; realization; fortran", ANNOTE="An algorithm forthe calculation of Faa di Bruno's indices along with a Fortran-subroutine is given.", } @INPROCEEDINGS{Kram73:Total, AUTHOR="K. Wolfgang", TITLE="Total waiting time distribution function and the fate of a customer in a system with two queues in series", BOOKTITLE=itc7, ADDRESS="Stockholm", PAGES="1-8", YEAR=1973, REFERENCES=12, KEYWORDS="tandem queue; waiting time; distribution; interdependence", ANNOTE="This paper is concerned especially with a system of two unlimited queues in series, when poisson traffic is offered to the first stage and the service times in the two stages are independent of each other and negative exponentially distributed. The first stage includes one service-unit, while the second stage allowed to be a multiserver queuing system. In this paper, by pursuing a particular customer (call or request) at his walk through the", } @ARTICLE{Kuhn73:Impact, AUTHOR="P. J. Kühn", TITLE="The impact of queueing theory on the optimization of communications and computer systems", JOURNAL="Institute of Managemement Science", ADDRESS="Tel Aviv", PAGES="559-568", YEAR=1973, REFERENCES=60, KEYWORDS="Computer network; optimization; system design", ANNOTE="The paper gives a short review of typical queueing problems in communications and computer systems emphasizing those questions which are most important from the viewpoint of applications. Three examples are reported which refer to various types of optimization criteria characterized by quantitive aspects as well as qualitative aspects. In connection with these examples, some typical analysis methods of queueing theory are outlined to demons", } @INPROCEEDINGS{Lang73:Vergleich, AUTHOR="M. Langenbach-Belz", TITLE="Vergleich zweier Warteschlangenmodelle für Realzeitrechner-Systeme mit Interruptgesteuerter bzw. taktgesteuerter Übernahme von Anforderungen aus der Peripherie", BOOKTITLE="3. GI-Jahrestagung", ADDRESS="Hamburg", YEAR=1973, LANGUAGE="German", KEYWORDS="Queueing system", } @ARTICLE{Lewi73:Generalized, AUTHOR="T. G. Lewis and W. G. Payne", TITLE="Generalized feedback shift register pseudorandom number algorithm", JOURNAL=jacm, VOLUME=20, PAGES="456-", YEAR=1973, KEYWORDS="Shift register sequences", ANNOTE="Feedback configurations for SR's of length > 45", } @ARTICLE{Mark73:State, AUTHOR="B. I. Marks", TITLE="State probabilities of {M/M/1} priority queues", JOURNAL=or, VOLUME=21, PAGES="974-987", YEAR=1973, REFERENCES=12, KEYWORDS="M/M/1; PREHOL priority; steady state probability; HOL priority", ANNOTE="This paper considers a preemptive priority and a nonpreemptive priority queueing model in the steady state. Each model assumes two priority levels, a single-service channel, no queue-length limit, and negative exponential interarrival-time and service-time distributions. The paper develops a set of computationally efficient recursion formulas that allow exact calculation of the state probabilities. In the nonpreemptive-priority case, this is", } @ARTICLE{Noe73:Macro, AUTHOR="J. D. Noe and G. J. Nutt", TITLE="Macro E-nets for representation of parallel systems", JOURNAL=ieeetc, VOLUME="C-22", YEAR=1973, KEYWORDS="Simulation; Petri net; Evaluation net", } @INPROCEEDINGS{Petr73:Kombinatorischen, AUTHOR="G. Petrich", TITLE="Möglichkeiten der kombinatorischen Analyse von Simulationsmodellen", BOOKTITLE="Methodik der rechnergestützten Simulation Kernforschungszentrum", ADDRESS="Karlsruhe", YEAR=1973, LANGUAGE="German", KEYWORDS="Simulation", } @BOOK{Pfei73:Applied, AUTHOR="P. E. Pfeiffer and D. A. Schum", TITLE="Introduction to Applied Probability", PUBLISHER="Academic Press", YEAR=1973, KEYWORDS="Mathematics", } @INPROCEEDINGS{Pouz73:Identification, AUTHOR="L. Pouzin", TITLE="Identification: network design philosophies", BOOKTITLE="Infotech - State of the art report", PAGES="134-156", NOTE=24, YEAR=1973, KEYWORDS="design; communication network; CYCLADES", } @BOOK{Pugh73:DYNAMO, AUTHOR="A. L. Pugh", TITLE="{DYNAMO,} users manual", PUBLISHER="MIT Press", ADDRESS="Cambridge, Massachusetts", YEAR=1973, KEYWORDS="Continuous simulation", ANNOTE="Club of Rome simulator --> industrial dynamics", } @INPROCEEDINGS{Roge73:TETRASIM, AUTHOR="T. Rogeberg and B. Stenseth", TITLE="{TETRASIM} - a general purpose program for the simulation of telephone systems", BOOKTITLE=itc, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Simulation; telephony", } @PHDTHESIS{Rosc73:Laterale, AUTHOR="R. Rosch", TITLE="Über die laterale Zündausbreitung in Leistungsthyristoren", SCHOOL="RWTH Aachen", ADDRESS="Aachen, Germany", YEAR=1973, LANGUAGE="German", KEYWORDS="Thyristor; power electronics", ANNOTE="Doktorand Inst. Prof. Wasserab", } @ARTICLE{Rose73:Length, AUTHOR="S. I. Rosenlund", TITLE="On the length and number of served customers of the busy period of a generalised {M/G/1} queue with finite waiting room", JOURNAL=aap, VOLUME=5, PAGES="379-389", YEAR=1973, REFERENCES=5, KEYWORDS="M/G/1/S; busy period; covariance", ANNOTE="Customers arrive in groups to a single server queue with finite waiting room. Two-dimensional distributions for times and numbers of served customers between occurrences of states in the embedded Markov chain are obtained by linear algebra giving systems of equations for joint Laplace-Stieltjes transforms. For M/M/1 a simple recursion relation for the joint transform of the two varaibles in the title is derived and used to obtained the first", } @ARTICLE{Roth73:Anwendung, AUTHOR="D. Roth", TITLE="Anwendung der Theorie Markoff'scher Ketten bei der Umcodierung", JOURNAL=aeu, VOLUME=27, PAGES="409-", YEAR=1973, LANGUAGE="German", KEYWORDS="Markov chain; coding theory", } @PHDTHESIS{Sonn73:Verfahren, AUTHOR="H. Sonnen", TITLE="Verfahren zur Darstellung zweiwertiger logischer Funktionen durch bestimmte reellwertige Funktionen und die entsprechende zweistufige technische Realisierung", SCHOOL="RWTH Aachen", ADDRESS="Aachen, Germany", YEAR=1973, LANGUAGE="German", KEYWORDS="Maxwell theory", } @ARTICLE{Wein73:Shortest, AUTHOR="A. Weintraub", TITLE="The Shortest and the K-Shortest Routes as Assignment Problems", JOURNAL=networks, VOLUME=3, PAGES="61-73", YEAR=1973, REFERENCES=13, KEYWORDS="Routing algorithm; shortest path", ANNOTE="The problem of finding a shortest route in a network with unrestricted costs is approached through solving an assignment problem associated to the network. The upper bound on the number of elementary calculations required for the solution is However, in most cases, the actual number of computations is considerably less and depends on different network characteristics than Dynamic Programming algorithms do. A parametric analysis is presented", } @ARTICLE{Mitc73:Variance, AUTHOR="B. Mitchell", TITLE="Variance Reduction by Antithetic Variates in {GI/G/1} Queuing Simulations", JOURNAL=or, VOLUME=21, NUMBER=2, PAGES="988-997", YEAR=1973, REFERENCES=5, KEYWORDS="Variance reduction; antithetic simulation; GI/G/1; simulation", ANNOTE="This paper considers the use of antithetic variates to reduce the variance of estimates obtained in the simulation of a GI/G/1queue. Two experimental configurations are considered. Experimental results are given for M/M/1 queueing simulations to illustrate the magnitude of the variance reduction.", } @ARTICLE{Muth73:Production, AUTHOR="E. J. Muth", TITLE="The Production Rate of a Series of Work Stations with Variable service Times", JOURNAL=ijpr, VOLUME=1, NUMBER=2, PAGES="155-169", YEAR=1973, REFERENCES=11, KEYWORDS="Manufacturing system; production rate; variable rate", ANNOTE="A mathematical model for the interdemand time at the first stati a production line with stochastic service times is presented. Production rate is expressed as the reciprocal of mean interdematime. The analysis is not restricted to the assumption of exponedistributed service times.", } @INPROCEEDINGS{Goke73:Banyan, AUTHOR="L. R. Goke and G. J. Lipovski", TITLE="Banyan Networks for Partitioning Multiprocessor Systems", BOOKTITLE="1st Annual Symposium on Computer Architecture", PAGES="21-28", YEAR=1973, REFERENCES=21, KEYWORDS="Multistage interconnection network; Banyan network", } @INPROCEEDINGS{Cohe73:Storage, AUTHOR="J. W. Cohen", TITLE="Analysis of Storage Hierarchy", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @ARTICLE{Cole73:Verkehrsstaerke, AUTHOR="R. D. Coleman", TITLE="Verkehrsstärke--use of a Gate to Reduce the Variance of Delays in Queues with Random Service", JOURNAL=bstj, VOLUME=52, PAGES="1403-1422", YEAR=1973, KEYWORDS="Delay system", } @INPROCEEDINGS{Cors73:Common, AUTHOR="P. Corsi and R. Ricciarelli and O. Casalotti", TITLE="Common Control Performance of Switching Systems in Hierarchical Networks", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Dais73:Vemaus, AUTHOR="G. Daisenberger", TITLE="{Vemaus-A} General Purpose Program System for Editing and Evaluatingand Analysing the Results of Traffic Load Measurements", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Measurement", } @ARTICLE{Boer73:Comparison, AUTHOR="J. de Boer", TITLE="Comparison of random selection and selection with fixed starting position in a multi-stage link network", JOURNAL=ptr, VOLUME=31, NUMBER=3, PAGES="148-155", NOTE="also in Proc. 7th ITC", YEAR=1973, KEYWORDS="Switching network; link system", ANNOTE="Fester Wahlanfang, mehrstufige Zwischenleitungsanordnung, Verkehrsverarbeitungskapazität, Computerbelastung;", } @INPROCEEDINGS{Desc73:Fluctuations, AUTHOR="A. Descloux", TITLE="Fluctuations of Load Measurements", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Loss system", } @ARTICLE{Desc73:Traffic, AUTHOR="A. Descloux", TITLE="Traffic Measurement Biases Induced by Partial Sampling", JOURNAL=bstj, VOLUME=52, NUMBER=8, PAGES="1375-1402", YEAR=1973, KEYWORDS="Measurement", } @INPROCEEDINGS{Dine73:Calculation, AUTHOR="M. E. Fakhr and L. Peiram", TITLE="Calculation of the Traffic Capacity of a Private Data Network", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", NOTE="also in Ericson Technics 30 (1974) 2, 6B, 5T, 3Q, pp. 85-108", YEAR=1973, KEYWORDS="Delay system", } @INPROCEEDINGS{Dobr73:Computation, AUTHOR="R. L. Dobrushin and Y. M. Sukhov", TITLE="Computation of a Starlike Switching Network with a Large Number of Radial Rays", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Delay system", } @INPROCEEDINGS{Duer73:Quasi, AUTHOR="W. T. Duerdoth and C. A. Seymour", TITLE="A Quasi-Non-Blocking {TDM} Switch", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="TDM; time division multiplex", } @INPROCEEDINGS{Elld73:Dependence, AUTHOR="A. Elldin", TITLE="On the Dependence between Traffic and Tariff", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Enns73:Busy, AUTHOR="G. E. Enns and T. K. Wignall", TITLE="The Busy Period and the Probability that a Particular Queue is in Service in a Single Server Queueing System with {$N$} Queues, Arbitrary Priorities, and a General Probabilistic Inter-Queue Transition", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Delay system", } @INPROCEEDINGS{Ersh73:Determination, AUTHOR="V. A. Ershov and O. E. Lyashko", TITLE="Determination of Blocking Situations in the Three-Stage Connection Systems with Limited Number of Rearrangements", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Espv73:Simulation, AUTHOR="O. Espvik", TITLE="Simulation Experiments with {GASP} {II}", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Ever73:Measurement, AUTHOR="R. Evers", TITLE="Measurement of Subscriber Reaction to Unsuccessful Call Attempts and the Influence of Reasons", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Measurement", } @ARTICLE{Fran73:Overload, AUTHOR="R. L. Franks and R. W. Rishel", TITLE="Overload Model of Telephone Network Operation", JOURNAL=bstj, VOLUME=52, NUMBER=9, YEAR=1973, KEYWORDS="Simulation", } @INPROCEEDINGS{Garm73:Batch, AUTHOR="V. A. Garmash", TITLE="Batch Switching Systems : Structures and Procedures", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Gato73:Relations, AUTHOR="E. Gatos", TITLE="Relations between redundance and reliability in the transmission and Processing of information in switching and transmission Systems", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Loss system", } @INPROCEEDINGS{Gaus73:Extensive, AUTHOR="O. Gaustad and A. Flo and R. L. Dadswell", TITLE="Extensive traffic investigation in a local telephone exchange", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @ARTICLE{Gerk73:Besondere, AUTHOR="P. Gerke", TITLE="Besondere Merkmale des Elektonischen Fernsprech-Wählsystems der {DBP}", JOURNAL=siemensz, ADDRESS="München", VOLUME=47, NUMBER=8, YEAR=1973, LANGUAGE="German", KEYWORDS="Link system", } @ARTICLE{Gerk73:Elektronische, AUTHOR="P. Gerke", TITLE="Elektronische Verfahren in der Vermittlungstechnik", JOURNAL="Elektronik", VOLUME=22, NUMBER=1, PAGES="3-6", YEAR=1973, LANGUAGE="German", KEYWORDS="Link system", ANNOTE="Vermittlungstechnik, Rechnersteuerung, Abfrage, Wegesuche", } @INPROCEEDINGS{Gers73:Peak, AUTHOR="S. B. Gershwin and R. V. Laue and E. Wolman", TITLE="Peak-Load Traffic Administration of a Rural Line-Concentrator", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Loss system", } @INPROCEEDINGS{Gned73:Statistical, AUTHOR="B. W. Gnedenko and M. A. Sneps-Sneppe", TITLE="Statistical Problems in the Teletraffic Theory", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Loss system", } @ARTICLE{Gosz73:Engset, AUTHOR="G. Gosztony and M. Agosthazi and E. Uxa", TITLE="Engset charts - For the design of loss systems with a finite number of traffic sources and full availability", JOURNAL="Budavox Telecommunication Review", YEAR=1973, KEYWORDS="Loss system", } @INPROCEEDINGS{Hala73:Funktionalalgorithmen, AUTHOR="W. I. Halaschew and M. I. Dimtschew", TITLE="Funktionalalgorithmen des automatischen Telefonapparates und des automatischen Telefonsekretärs", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, LANGUAGE="German", KEYWORDS="Gos", } @INPROCEEDINGS{Halv73:Simulation, AUTHOR="Q. Halvorsen and H. Kvaase", TITLE="A Simulation Study of a Network with Six Exchanges", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Simulation", } @INPROCEEDINGS{Harr73:Concepts, AUTHOR="R. J. Harris", TITLE="Concepts of Optimality in Alternate Routing Networks", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Hash73:Queueing, AUTHOR="O. Hashida and M. Fujiki", TITLE="Queueing Models for Buffer Memory in Store-and-Forward Systems", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Delay system", } @ARTICLE{Heff73:First, AUTHOR="H. Heffes", TITLE="Analysis of First-Come First-Served Queueing Systems with Peaked Inputs", JOURNAL=bstj, VOLUME=52, NUMBER=7, PAGES="1215-1228", YEAR=1973, KEYWORDS="Delay system", ANNOTE="Verkehrsspitze, 'Schlange' System", } @ARTICLE{Heff73:Peakedness, AUTHOR="H. Heffes", TITLE="Peakedness of Traffic Carried by a Finite Trunk Group with Renewal Input", JOURNAL=bstj, VOLUME=52, NUMBER=9, PAGES="1617-1642", YEAR=1973, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Herz73:Message, AUTHOR="U. Herzog", TITLE="Message Switching Networks with Alternate Routing", BOOKTITLE=itc7, ADDRESS="Stockholm", NOTE="also Elektronische Rechenanlagen 1974 (5), 174-181", YEAR=1973, KEYWORDS="Overload control; flow control; communication network", } @TECHREPORT{Herz73:Simulation, AUTHOR="U. Herzog and G. Kampe and M. Langenbach-Belz", TITLE="Simulation von Rechnernetzen mit getakter Informationsübernahme", INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung der Universität Stuttgart", ADDRESS="Stuttgart", VOLUME="Mai", YEAR=1973, LANGUAGE="German", KEYWORDS="Simulation", } @INPROCEEDINGS{Holt73:Accuracy, AUTHOR="J. M. Holtzmann", TITLE="The Accuracy of the Equivalent Random Method with Renewal Inputs", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Huss73:Simulation, AUTHOR="B. Husstad and T. Thornes", TITLE="Simulation of the Group Selector Stage in the {ITT} '8 {B'} Exchange", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Simulation", } @INPROCEEDINGS{Inos73:PCM, AUTHOR="H. Inose and T. Saito and Y. Yanagisawa", TITLE="Evaluation of {PCM} toll switching networks with partial access pulse shifters", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="TDM; time division multiplex", } @INPROCEEDINGS{Iver73:Traffic, AUTHOR="V. B. Iversen", TITLE="Analysis of Traffic Processes Based on Data Obtained by the Scanning Method", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Loss system", } @ARTICLE{Iver73:Analyses, AUTHOR="V. B. Iversen", TITLE="Analyses of Real Teletraffic Process Beased on Computerized Measurements", JOURNAL=ericssont, VOLUME=29, NUMBER=1, YEAR=1973, KEYWORDS="Measurement", } @INPROCEEDINGS{Jens73:Arrival, AUTHOR="E. Lykke Jensen", TITLE="On Arrival Processes for Overflow Calls", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Joel73:Nodal, AUTHOR="A. E. Joel", TITLE="Nodal Switching Networks", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{John73:Inherent, AUTHOR="E. M. Johnson", TITLE="Inherent Load Balance in Link Systems with Random Slip Multiples", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Joni73:Fully, AUTHOR="G. L. Jonin and J. J. Sedol", TITLE="Fully Availability Groups with Repeated Calls and Time of Advanced Service", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Joys73:Calculation, AUTHOR="L. A. Joys", TITLE="Calculation of Simple O`Dell Gradings Using an {Erlang} Type Loss Formula", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Grading; loss system", } @TECHREPORT{Joys73:Use, AUTHOR="L. A. Joys", TITLE="The Use of the Engset and {Erlang} Formulae for Probability Density in Loss Systems", INSTITUTION="Research Establishment, The Norwegian Telecommunications Administration", VOLUME="apr", NUMBER="6/73", YEAR=1973, KEYWORDS="Loss system", } @INPROCEEDINGS{Jung73:Call, AUTHOR="M. M. Jung", TITLE="Call Congestion and Distribution of Number of Engaged Outlets in a Given Split of Gradings with Random Routing", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Grading", } @INPROCEEDINGS{Kapp73:Efficient, AUTHOR="J. G. Kappel", TITLE="Design of Efficient Link Systems with Concentration Stages", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Karl73:Control, AUTHOR="B. Karlander", TITLE="Control of Central Processor Load in a {SPC} System", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="TDM; time division multiplex", } @INPROCEEDINGS{Katz73:Long, AUTHOR="S. S. Katz", TITLE="Long-Range Planning of Hierarchical Trunk Networks with Re-Arrangement Costs", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @ARTICLE{Katz73:Experimental, AUTHOR="L. Katzschner and W. Lörcher and H. Weisschuh", TITLE="An Experimental Local {PCM-Switching} system", JOURNAL=ieeecom, VOLUME="COM-21", NUMBER=10, YEAR=1973, KEYWORDS="TDM; time division multiplex", } @INPROCEEDINGS{Kell73:Impact, AUTHOR="P. T. Kelly", TITLE="Impact of the Growth in Data Transmission on Network Planning", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Khar73:Results, AUTHOR="A. D. Kharkevich", TITLE="Some Results on Simulation of Communication Network with the Usualand Constant Alternate Routing", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Klei73:Continium, AUTHOR="L. Kleinrock and J. Hsu", TITLE="A Continium of Computer Processor-Sharing Queueing Models", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Delay system", } @INPROCEEDINGS{Kope73:Modelling, AUTHOR="K. Koperniczky", TITLE="Modelling of Telephone Services", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Kuhn73:Waiting, AUTHOR="P. J. Kühn", TITLE="Waiting Time Distribution on Multi-Queue Delay Systems with Gradings", BOOKTITLE=itc7, ADDRESS="Stockholm", NOTE="also in AEÜ, 2, 1975, p. 54-61", YEAR=1973, KEYWORDS="Delay system", } @ARTICLE{Kuhn73:Entwicklungstendenzen, AUTHOR="P. J. Kühn", TITLE="Entwicklungstendenzen in der Nachrichtenverkehrstheorie", JOURNAL=ntz, PUBLISHER="VDE-Verlag", NUMBER=8, YEAR=1973, LANGUAGE="German", KEYWORDS="Loss system", } @INPROCEEDINGS{Kvaa73:Investigation, AUTHOR="H. Kvaase and R. Löchen", TITLE="An Investigation of the Effect of Alternative Hunting Rules in a Group of Code Receivers with Limited Availability", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Grading", } @INPROCEEDINGS{Kyme73:System, AUTHOR="R. C. Kyme", TITLE="A System for Telephone Traffic Measurement and Routing Analysis by Computer", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Lajt73:Traffic, AUTHOR="G. Lajtha and A. Mazgon", TITLE="Traffic and Economic Design of Networks Based on Time-Slot Switching", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="TDM; time division multiplex", } @TECHREPORT{Lang73:Getaktete, AUTHOR="M. Langenbach-Belz", TITLE="Getaktete Wartesysteme bei Rechnern und zentralgesteuerten Nachrichtenvermittlungsanlagen", INSTITUTION="Institut f. Nachrichtenvermittlung und Datenverarbei-tung, Ber. ü. vt. Arbeiten", ADDRESS="Stuttgart", VOLUME=19, YEAR=1973, LANGUAGE="German", KEYWORDS="Delay system", } @INPROCEEDINGS{Laza73:Approach, AUTHOR="W. G. Lazarev", TITLE="An Approach to the Network Management", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Lee73:Unserviceable, AUTHOR="L. Lee", TITLE="The Unserviceable Probability of an Interoffice Trunk Group", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Loss system", } @INPROCEEDINGS{Gall73:Random, AUTHOR="P. Le Gall", TITLE="Random Processes Applied to Traffic Theory and Engineering", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Loss system", } @INPROCEEDINGS{Leig73:Standards, AUTHOR="R. B. Leigh", TITLE="Standards for the Economic Provision of Direct Routes", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Loke73:Congestion, AUTHOR="B. Löken", TITLE="Congestion Studies in an Incomplete Link System", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Lorc73:Point, AUTHOR="W. Lörcher", TITLE="Point-to-Point Selection in Link Systems", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", ANNOTE="also AEÜ 1.1, 1975, p. 24", } @PHDTHESIS{Lörc73:Exakte, AUTHOR="W. Lörcher", TITLE="Exakte Berechnung der Zustandswahrscheinlichkeiten und der charakteristischen Verkehrsgrößen mehrstufiger Durchschaltung", SCHOOL="Institut für Nachrichtenvermittlung und Datenverarbeitung Universität Stuttgart", ADDRESS="Stuttgart, Germany", VOLUME=20, YEAR=1973, LANGUAGE="German", KEYWORDS="Link system", } @INPROCEEDINGS{Macu73:Management, AUTHOR="W. B. Macurdy", TITLE="Network Management in the United States-Problems and Progress", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Mane73:Trunking, AUTHOR="L. Manera and R. Pellegrini", TITLE="Trunking Studies for a {TDM} Terminal Exchange", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="TDM; time division multiplex", } @INPROCEEDINGS{Marc73:Bounds, AUTHOR="M. J. Marcus", TITLE="Bounds for the Growth of the Number of Contacts in Connecting networks", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Mase73:Computer, AUTHOR="G. Masetti and G. Miranda", TITLE="Computer Aided Forecasting for Point-to-Point Traffic Offered to an Automatic Toll Network", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Meli73:Structure, AUTHOR="E. Melik-Gaikazova", TITLE="The Structure of Multigroup Connecting Networks", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Mich73:Comparison, AUTHOR="J. Michaux and L. de Raedt and E. Jacquemi", TITLE="A Comparison between Classical, Calculated and Artificially measured Distributions in a Particular Link System", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Mira73:Criteria, AUTHOR="G. Miranda and P. Pallotta", TITLE="On Design Criteria for a Telephone Toll Network with Respect to Overload Protection", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Mysk73:Statistical, AUTHOR="A. Myskja and O. Walman", TITLE="A Statistical Study of Telephone Traffic Data, with Emphasis on subscriber Behaviour", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Naka73:Flexible, AUTHOR="U. Nakagome and H. Mori", TITLE="Flexible Routing in the Global Communication Network", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Neim73:Binary, AUTHOR="V. I. Neiman", TITLE="Some Binary Connecting Networks and their Traffic Characteristics", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Niet73:Revision, AUTHOR="N. A. M. Nieto and M. J. Parra", TITLE="Revision of the Busy Hour Concept in the Calculation of Common control Telephone Exchanges", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Ober73:Test, AUTHOR="E. Oberer and G. W. Rieß", TITLE="Test Calling: Experience, Theory, Prospects", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Loss system", } @INPROCEEDINGS{Ohta73:Efficiency, AUTHOR="T. Ohta", TITLE="Network Efficiency and Network Planning Considering Telecommunication Traffic Influenced by Time Difference", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @ARTICLE{Olss73:Report, AUTHOR="K. M. Olsson and M. Anderberg and G. Lind", TITLE="Report on the 7th International Teletraffic Congress in Stockholm, June 13-20, 1973", JOURNAL=ericssont, VOLUME=3, YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Parv73:Calculation, AUTHOR="A. Parviala", TITLE="Calculation of the Optimum Number of Trunk Lines Based on Moe's principle", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Parv73:Local, AUTHOR="A. Parviala and M. Nurminen and L. Heiskanen", TITLE="Local Network Planning Computerized: Forecasting the Number of subscriber Lines in any Building as a function if its Characteristicscteristics, Using Correlation Analysis", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Pecc73:Satellite, AUTHOR="A. Pecchinotti", TITLE="Satellite Communication Traffic Demand Assignment Experiments", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Pede73:Measurement, AUTHOR="O. A. Pedersen", TITLE="Measurement of Within-Busy-Hour Traffic Variations", BOOKTITLE=itc7, ADDRESS="stockholm", YEAR=1973, KEYWORDS="Loss system", } @INPROCEEDINGS{Pell73:Observations, AUTHOR="G. Pellieux", TITLE="Observations sur le comportement de l'abonné au téléphone \`a forttrafic en cas d'échec", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, LANGUAGE="French", KEYWORDS="Gos", } @INPROCEEDINGS{Pils73:One, AUTHOR="E. Pilschikov and M. M. Sharipova", TITLE="On One of the Approaches to the Systhesis of Structures on information Exchange System", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Pins73:Complexity, AUTHOR="M. S. Pinsker", TITLE="On the Complexity of a Concentrator", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @ARTICLE{Praz73:Le, AUTHOR="L. Praz", TITLE="Le Traffic de Débordement", JOURNAL="Technische Mitteilungen PTT", VOLUME=51, NUMBER=10, YEAR=1973, LANGUAGE="French", KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Rahk73:Congestion, AUTHOR="K. Rahko", TITLE="Congestion as a Stochastic Process", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Loss system", } @INPROCEEDINGS{Rahk73:Traffic, AUTHOR="K. Rahko and T. Erke", TITLE="Traffic Routing and Control in a Network", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Robi73:Teletraffic, AUTHOR="J. M. Robins", TITLE="A Teletraffic Problem Arising from the Design of Large Message Switches", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Delay system", } @INPROCEEDINGS{Rodr73:Calculation, AUTHOR="A. Rodriguez and B. Fontana and G. D. Fagoaga", TITLE="A Calculation Method to Study in a Full Availability Group the Influence of Time-Outs", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Ruba73:Dimensioning, AUTHOR="J. Rubas", TITLE="Dimensioning of Manual Operating Position in {PABX`s}", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Delay system", } @INPROCEEDINGS{Rudi73:Approximate, AUTHOR="Harry Rudin", TITLE="An Approximate Model and Analysis for a Queue with Highly clustered Arrivals", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Delay system", } @INPROCEEDINGS{Scha73:Investigation, AUTHOR="R. A. Schassberger", TITLE="Investigation of Queueing and Related Systems with the Phase Method", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Delay system", } @TECHREPORT{Sche73:Berechnung, AUTHOR="R. Schehrer", TITLE="Über die Berechnung von Überlaufsystemen mit vollkommenden erreichbaren Bündeln bei endlicher Zahl", INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung", ADDRESS="Stuttgart, Germany", NUMBER="16. Bericht über ve", YEAR=1973, LANGUAGE="German", KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Schw73:Serving, AUTHOR="H. Schwärtzel", TITLE="Serving Strategies of Batch Arrivals in Common Control Switching Systems", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Link system", ANNOTE="also NTZ 9, 1974, Seite 341-345", } @ARTICLE{Schw73:Verbindungswegenetzwerke, AUTHOR="H. J. Schwertfeger", TITLE="Verbindungswegenetzwerke in raumgeteilten Vermittlungssystemen mitindirekter Steuerung", JOURNAL=fernmeldetechnik, VOLUME=13, NUMBER=2, PAGES="64-67", YEAR=1973, LANGUAGE="German", KEYWORDS="Link system", ANNOTE="Inhalt: Koppelanordnungen, Verteilungsfunktion, Expansionsfunktion", } @INPROCEEDINGS{Sega73:Operator, AUTHOR="M. Segal", TITLE="The Operator Scheduling Problem - a Network Flow Approach", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Skog73:Iterative, AUTHOR="E. Skogan", TITLE="An Iterative Method to Calculate Traffic Losses in Grading Systems", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Grading", } @ARTICLE{Stat73:Evolution, AUTHOR="E. Stathopoulos and Z. Georgieou", TITLE="Evolution of the average number of local calls per subscriber", JOURNAL="Telecommunication Horizon", ADDRESS="Athens", NUMBER=2, YEAR=1973, KEYWORDS="Measurement", } @INPROCEEDINGS{Stra73:Reliability, AUTHOR="K. Strandberg", TITLE="Reliability Prediction in Telephone Systems Engineering", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Szyb73:Approximate, AUTHOR="E. Szybicki", TITLE="Approximate Method for Determination of Overload Ability in Local Telephone Systems", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Taka73:Numerical, AUTHOR="K. Takagi", TITLE="A Numerical Solution Method of Simplified Equations of State and its Application to Grading Groups", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Grading", } @INPROCEEDINGS{Tayl73:Computing, AUTHOR="A. Taylor and N. G. Batty", TITLE="Computing Aspects of a Traffic Prediction Model of a Telephone Exchange Network", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Tole73:Analytical, AUTHOR="G. F. Toledano and M. de los", TITLE="An Analytical Model to Describe the Influence of the Repeated Call Attempts", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Urmo73:Delay, AUTHOR="W. Urmoneit", TITLE="Delay and Loss Systems with Early Departure Calls", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Delay system", } @INPROCEEDINGS{Vill73:Extension, AUTHOR="J. E. Villar and M. de los", TITLE="An Extension of the Roulette Model to Simulate Speech and signalling Networks", BOOKTITLE=itc7, ADDRESS="Stockholm", NOTE="also Elektronisches Nachrichtenwesen 49, 4, 1974", YEAR=1973, KEYWORDS="Simulation", } @INPROCEEDINGS{Vill73:Approximate, AUTHOR="J. E. Villar and G. H. Gonzales Soto", TITLE="An Approximate Calculation Method to Estimate Processor Capacity in {SPC} Switching Systems", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="TDM; time division multiplex", } @INPROCEEDINGS{Wall73:Loss, AUTHOR="B. Wallström", TITLE="Loss Calculation in certain Overflow Systems where the Holding times in Cuccessive Groups have Different Means", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Overload control; flow control; communication network", } @ARTICLE{Wall7304:Loss, AUTHOR="B. Wallström", TITLE="Loss Calculation in certain Overflow Systems where the Holding times in Cuccessive Groups have Different Means", JOURNAL=ericssont, VOLUME=29, NUMBER=4, PAGES="177-192", YEAR=1973, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Wean73:Management, AUTHOR="O. Wean", TITLE="Network Management Strategies", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Weis73:Theoretical, AUTHOR="H. Weisschuh", TITLE="Theoretical Aspects of Finite Source Input Process Simulation", BOOKTITLE=itc7, ADDRESS="Stockholm", NOTE="also in Angewandte Informatik 17 (1975), pp. 5-8", YEAR=1973, KEYWORDS="Simulation", } @INPROCEEDINGS{Woll73:Queueing, AUTHOR="E. Wollner", TITLE="A Queueing Problem in Data Transmission", BOOKTITLE=itc7, ADDRESS="Stockholm", YEAR=1973, KEYWORDS="Delay system", } @ARTICLE{Bril73:Estimation, AUTHOR="D. R. Brillinger", TITLE="Estimation of the mean of a stationary time series by sampling", JOURNAL=jap, VOLUME=10, NUMBER=2, PAGES="419-431", YEAR=1973, KEYWORDS="Simulation; statistical technique", } @ARTICLE{Chan73:Multiserver, AUTHOR="W. C. Chan and W. K. Chung and D. Y. Maa", TITLE="Multiserver computer-controlled queuing system with pre-emptive priorities and feedback", JOURNAL=ieeeproc, VOLUME=120, NUMBER=11, PAGES="1331-1336", YEAR=1973, KEYWORDS="Queueing system; priority; analysis", } @ARTICLE{Diet73:Combinatorial, AUTHOR="U. Dieter and J. Ahrens", TITLE="A combinatorial method for the generation of normally distributed random numbers", JOURNAL=comp, VOLUME=11, NUMBER=2, PAGES="137-146", YEAR=1973, KEYWORDS="random variate generation", } @ARTICLE{Fish73:Statistical, AUTHOR="G. S. Fishman", TITLE="Statistical analysis for queueing simulations", JOURNAL="Management Science, Series A (Theory)", VOLUME=20, NUMBER=3, PAGES="363-369", YEAR=1973, KEYWORDS="Simulation; statistical technique", } @ARTICLE{Harr73:Limit, AUTHOR="J. M. Harrison", TITLE="A limit theorem for priority queues in heavy traffic", JOURNAL=jap, VOLUME=10, NUMBER=4, PAGES="907-912", YEAR=1973, KEYWORDS="Queueing system; priority; analysis", } @BOOK{Knut73:Art1, AUTHOR="D. E. Knuth", TITLE="The Art of Computer Programming, Volume 1: Fundamental Algorithms.", PUBLISHER="Second Edition, Addison-Wesley Publishing Company, Reading", YEAR=1973, KEYWORDS="Programming; algorithm", } @BOOK{Knut73:Art3, AUTHOR="D. E. Knuth", TITLE="The Art of Computer Programming, Volume 3: Sorting and Seraching", PUBLISHER="Addison-Wesley Publishing Company, Reading", YEAR=1973, KEYWORDS="Programming; algorithm", } @ARTICLE{Mari73:High, AUTHOR="D. G. Maritsas", TITLE="A high speed and accuracy digital gaussian generator of pseudorandom numbers", JOURNAL=ieeetc, VOLUME="C-22", NUMBER=7, PAGES="629-634", YEAR=1973, KEYWORDS="random variate generation", } @ARTICLE{Neav73:Using, AUTHOR="H. R. Neave", TITLE="On using the Box-Müller transformation with multiplicative congruential pseudo-random number generators", JOURNAL=as, VOLUME=22, NUMBER=1, PAGES="92-97", YEAR=1973, KEYWORDS="random variate generation", } @TECHREPORT{Reis73:Recursive, AUTHOR="M. Reiser and H. Kobayashi", TITLE="Recursive Algorithms for General Queuing Networks with Exponential Servers", INSTITUTION="IBM Research Report RC-4254, Yorktown Heights, New York, Mar.", PAGES="1-25", YEAR=1973, KEYWORDS="Queueing network; product form; analysis", } @INCOLLECTION{Wall73:Algebraic, AUTHOR="V. L. Wallace", TITLE="Algebraic techniques for numerical solution of queueing networks", BOOKTITLE="Lecture Notes in Economics and Mathematical Systems", EDITOR="A. B. Clarke", PUBLISHER="Springer-Verlag, Berlin", VOLUME=98, PAGES="295-305", YEAR=1973, KEYWORDS="Queueing network; analysis", } @TECHREPORT{Ever73:Structure, AUTHOR="R. Evers", TITLE="The Structure of Traffic Offered by Different Groups of Users", INSTITUTION="Heinrich-Hertz-Institut", ADDRESS="Berlin-Charlottenburg", YEAR=1973, KEYWORDS="Traffic model; traffic offered", } @INPROCEEDINGS{Aupp73:Merit, AUTHOR="E. Aupperle", TITLE="Merit network re-examined", BOOKTITLE=compcon, PAGES="25-30", NOTE="also in \cite{Abra80:Computer}", YEAR=1973, } @INPROCEEDINGS{Chri73:Development, AUTHOR="R. D. Christman", TITLE="Development of the {LASL} Computer Network", BOOKTITLE=compcon, PAGES="239-242", NOTE="also in \cite{Thur81:Tutorial}", YEAR=1973, } @INPROCEEDINGS{Crow73:System, AUTHOR="William R. Crowther and others", TITLE="A system for broadcast communication: Reservation-Aloha", BOOKTITLE="in 6th Hawaii International Conference system science", PAGES="371-374", YEAR=1973, } @INPROCEEDINGS{Mimn73:Terminal, AUTHOR="N. W. Mimno and others", TITLE="Terminal access to the {ARPA} network: experience and improvements", BOOKTITLE=compcon, PAGES="39-43", NOTE="also in \cite{Abra80:Computer}", YEAR=1973, } @INCOLLECTION{Robe73:ARPA, AUTHOR="L. G. Roberts and B. D. Wessler", TITLE="The {ARPA} Network", BOOKTITLE="Computer Communication Networks", EDITOR="N. Abramson and F. F. Kuo", PUBLISHER="Prentice-Hall", ADDRESS="Englewood Cliffs, NJ", PAGES="485-500", YEAR=1973, URL="http://www.packet.cc/files/arpa-net.html", } @INPROCEEDINGS{Rose73:Local, AUTHOR="S. Rosen and J. M. Steele", TITLE="A Local Computer Network", BOOKTITLE=compcon, PAGES="129-132", NOTE="also in \cite{Thur81:Tutorial}", YEAR=1973, } @INCOLLECTION{Schw73:Multiple, AUTHOR="J. W. Schwartz and M. Muntner", TITLE="Multiple-access communications for computer nets", BOOKTITLE="Computer Communication Networks", EDITOR="N. Abramson and F. F. Kuo", PUBLISHER="Prentice-Hall", ADDRESS="Englewood Cliffs, NJ", PAGES="269-294", YEAR=1973, } @ARTICLE{Holl7302:Genetic, AUTHOR="J. H. Holland", TITLE="Genetic algorithms and the optimal allocation of trials", JOURNAL=sicomp, VOLUME=2, NUMBER=2, PAGES="88-105", YEAR=1973, ABSTRACT="This study gives a formal setting to the difficult optimisation problems characterised by the conjunction of 1) substantial complexity and initial uncertainty, 2) the necessity of acquiring new information rapidly to reduce the uncertainty and 3)a requirement that the new information be exploited as acquired so that average performance increases at a rate consistent with th rate of acquisition of information. The setting has as its basis a set A of structures to be searcged or tried and a performance function u: A->real numbers. Within this setting it is determined how to allocate trials to a set of random variables so as to maximise expected performances. This result is then transformed into a critereon against which to measure the performance of a robust and easily implemented set of algorithms called reproductive plans. It is shown that reproductive plans can in fact surpass the critereon because of a phenomenon called intrinsic parallelism - a single trial (individual) simultaneously tests and exploits many random variables.", } @INPROCEEDINGS{Baje73:ComputerImagery, AUTHOR="R. Bajesy and M. Tavakoli", TITLE="A computer recognition of bridges, islands, rivers and lakes from satellite imagery", BOOKTITLE="on machine processing of remotely sensed data", ADDRESS="Purdue University, West Lafayette, Indiana", YEAR=1973, } @INPROCEEDINGS{Baje73:Computer, AUTHOR="R. Bajesy", TITLE="Computer description of textured surfaces", BOOKTITLE="third international joint conference on AI", PAGES="572-579", YEAR=1973, } @BOOK{Duda73:Pattern, AUTHOR="R. O. Duda and P. E. Hart", TITLE="Pattern classification and scene analysis", PUBLISHER="Wiley", ADDRESS="New York", YEAR=1973, } @ARTICLE{Hara7306:Textural, AUTHOR="R. M. Haralick and K. S. Shanmugan and I. Dunstein", TITLE="Textural features for image classification", JOURNAL=ieeesmc, VOLUME=3, NUMBER=6, PAGES="610-621", YEAR=1973, } @ARTICLE{Harl73:Radiographic, AUTHOR="C. A. Harlow and S. A. Eisenbeis", TITLE="The analysis of radiographic images", JOURNAL=ieeetc, VOLUME=22, PAGES="678-688", YEAR=1973, } @ARTICLE{Bach73:Programmer, AUTHOR="Charles W. Bachman", TITLE="The Programmer as Navigator", JOURNAL=cacm, VOLUME=16, NUMBER=11, YEAR=1973, REFERENCES=11, ABSTRACT="Copernicus completely reoriented our view of astronomical phenomea when he suggested that the earth revolves about the sun. There is a growing feeling that data processing people would benefit if they were to accept a radically new point of view, one that would liberate the application programmer's thinking from the centralism of core storage and allow him the freedom to act like a navigator within a database. To do this, he must first learn the various navigational skills; then he must learn the rules for the road to avoid conflict with other programmers as they jointly navigate the database information space. This reorientation will cause as much anguish among programmers as the heliocentric theory did among the ancient astronomers and theologians.", } @BOOK{Bron73:Taschenbuch, AUTHOR="Bronstein-Semendjajew", TITLE="Taschenbuch der Mathematik", PUBLISHER="Verlag H. Deutsch", ADDRESS="Frankfurt/M, Germany", YEAR=1973, LANGUAGE="German", KEYWORDS="Mathematics", } @PHDTHESIS{Herz73:Verkehrsfluß, AUTHOR="U. Herzog", TITLE="Verkehrsfluß in Datennetzen", TYPE="Habilitation", SCHOOL="Universität Stuttgart", ADDRESS="Stuttgart, Germany", YEAR=1973, LANGUAGE="German", KEYWORDS="Queueing system; communication network", } @BOOK{Niem73:Systemsimulation, AUTHOR="G. Niemeyer", TITLE="Systemsimulation", ISBN="3-400-00281-X", PUBLISHER="Akademische Verlagsgesellschaft", ADDRESS="Frankfurt am Main, Germany", YEAR=1973, LANGUAGE="German", KEYWORDS="Simulation; RNG; RVG", ABSTRACT="1. Systemsimulation 2. Die Simulation stochastischer Systeme 3. Symulation mit stetigen Modellen 4. System dynamics 5. Systemsimulation mit diskreten Modellen 6. Organisation und Auswertung von Simulationsstudien", } @INPROCEEDINGS{Ande73:Optimization, AUTHOR="M. Anderberg and T. Fried and A. Rudberg", TITLE="Optimization of Exchange Locations and Boundaries in Local Telephone Networks", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Asge73:Dimensioning, AUTHOR="C. Asgersen", TITLE="Dimensioning of Trunk Networks According to a Uniform Overload capcity Criterion", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Bchl73:Calculation, AUTHOR="A. Bächle", TITLE="On the Calculation of Full Available Groups with offered Smoothed Traffic", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Loss system", } @INPROCEEDINGS{Barn73:Customer, AUTHOR="D. H. Barnes and W. O. Reutelhuber", TITLE="Customer Line use Characteristics", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Gos", } @ARTICLE{Bart7302:Teilnehmerbetrieb, AUTHOR="W. Bartussek", TITLE="Teilnehmerbetrieb, Warteschlangentheorie, Warteordnungen, Analyse von Planungsmodellen für Time-Sharing", JOURNAL=aninf, ADDRESS="Germany", VOLUME=15, NUMBER=2, PAGES="61-67", YEAR=1973, LANGUAGE="German", KEYWORDS="Simulation", } @INPROCEEDINGS{Bass73:Number, AUTHOR="L. A. Bassalygo", TITLE="On a Number of Reswitching in a Three-Stage Connecting Network", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Link system", } @ARTICLE{Baur7304:Ortsvermittlungs, AUTHOR="H. Baur", TITLE="Ortsvermittlungs-Fernsprechsystem, rechnergesteuerte Vermittlung Das Elektronische Fernsprech-Wählsystem der Deutschen Bundespost", JOURNAL="Siemens-Zeitung", ADDRESS="Germany", VOLUME=47, NUMBER=4, PAGES="185-188", YEAR=1973, LANGUAGE="German", KEYWORDS="Link system", } @INPROCEEDINGS{Bazl73:Link, AUTHOR="D. Bazlen", TITLE="Link Systems with Both-Way Connections and Outgoing Finite-Source Traffic", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", NOTE="also NTZ 9, 1974, p. 334-340", YEAR=1973, KEYWORDS="Link system", } @PHDTHESIS{Bazl73:Mehrstufige, AUTHOR="D. Bazlen", TITLE="Mehrstufige doppelt gerichtete Koppelanordnung der Vermittlungstechnik mit Intern- und Externverkehr", SCHOOL="Institut für Nachrichtenvermittlung und Datenverarbeitung, University of Stuttgart", ADDRESS="Germany", VOLUME=18, NOTE="18. Bericht über verkehrstheoretische Arbeiten", YEAR=1973, LANGUAGE="German", KEYWORDS="Link system", } @INPROCEEDINGS{Bazl73:Nachrichtenverkehrstheorie, AUTHOR="D. Bazlen and others", TITLE="Nachrichtenverkehrstheorie", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Queueing theory", } @INPROCEEDINGS{Bazl73:Influence, AUTHOR="D. Bazlen and G. Kampe and A. Lotze", TITLE="On the Influence of Hunting Mode and Link Wiring on the loss of Link Systems", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", VOLUME="232/1/12", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Bear73:Theories, AUTHOR="D. B. Bear", TITLE="Some Theories of Telephone Traffic Distribution: A Critical Survey", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Loss system", } @INPROCEEDINGS{Bear73:Traffic, AUTHOR="D. B. Bear and C. A. Seymour", TITLE="A Traffic Prediction Model for a Telephone Exchange Network", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Gos", } @INPROCEEDINGS{Bene73:Semilattice, AUTHOR="V. E. Benes", TITLE="Semilattice Characterization of Non-Blocking networks", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Berg73:Sensitivity, AUTHOR="Michael S. Berger and S. R. Neal", TITLE="A Sensitivity Study of Traffic-Parameter Estimation Procedures Used for Engineering Trunk Groups", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Measurement", } @INPROCEEDINGS{Birc73:Economic, AUTHOR="L. A. Birch and J. B. Cole", TITLE="Economic Considerations in the Development of Traffic Data Gathering Programs", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Measurement", } @INPROCEEDINGS{Bona73:Class, AUTHOR="M. Bonatti and P. G. Kubanski and P. Popoli", TITLE="A Class of Common Control Circuits Systems: Single-Stage and Two-Stage Arrangements with Waiting", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Link system", } @INPROCEEDINGS{Brea73:Long, AUTHOR="D. Breary and J. F. Gates", TITLE="A long term Study of the United Kingdom Trunk Network", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, KEYWORDS="Measurement", } @INPROCEEDINGS{Bret73:Extension, AUTHOR="G. Bretschneider", TITLE="Extension of the Equivalent Random Method to Smooth Traffics", BOOKTITLE=itc7, ADDRESS="Stockhholm, Sweden", YEAR=1973, KEYWORDS="Overload control; flow control; communication network", } @ARTICLE{Cole73:Verkehrsstärke, AUTHOR="R. D. Coleman", TITLE="Verkehrsstärke - use of a Gate to Reduce the Variance of Delays in Queues with Random Service", JOURNAL="Technical Journal", NUMBER=52, PAGES="1403-1422", YEAR=1973, KEYWORDS="Delay system", } @INPROCEEDINGS{Gall73:Sur, AUTHOR="P. Le Gall", TITLE="Sur l`utilisation et l`observation du taux d`efficacité du trafic téléphonique", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", YEAR=1973, LANGUAGE="french", KEYWORDS="GOS", } @PHDTHESIS{Sche73:Über, AUTHOR="R. Schehrer", TITLE="Über die Berechnung von Überlaufsystemen mit vollkommenden erreichbaren Bündeln bei endlicher Zahl", SERIES="Bericht über verkehrstheoretische Arbeiten", SCHOOL="Institut für Nachrichtenvermittlung und Datenverarbeitung, Universität Stuttgart", ADDRESS="Stuttgart, Germany", VOLUME=16, YEAR=1973, LANGUAGE="German", KEYWORDS="Overload control; flow control; communication network", } @BOOK{Knut73:Art, AUTHOR="D. E. Knuth", TITLE="The Art of Computer Programming, Volume 1: Fundamental Algorithms", PUBLISHER="Second Edition, Addison-Wesley Publishing Company, Reading", YEAR=1973, KEYWORDS="Programming; algorithm", } @ARTICLE{Agos73:Engset, AUTHOR="M. Agosthazi and G. Gosztony and E. Uxa", TITLE="Engset Charts", JOURNAL="Budavox Telecommunication Review", ADDRESS="Budapest, Hungary", PAGES=32, NOTE="Special Edition", YEAR=1973, KEYWORDS="table; Engset formula", } @ARTICLE{Arno73:Characterizations, AUTHOR="B. C. Arnold", TITLE="Some Characterizations of the Exponential Distribution by Geometric Compounding", JOURNAL=siapp, VOLUME=24, NUMBER=2, PAGES="242-244", YEAR=1973, KEYWORDS="Exponential distribution; geometric modeling", } @PHDTHESIS{Bäch73:Berechnung, AUTHOR="A. Bächle", TITLE="Die Berechnung der Blockierungs- und Verlustwahrscheinlichkeit vollkommener Bündel für geglättete Verkehrsangebote 1. oder 2. Art", SCHOOL="NVDV, Universität Stuttgart", ADDRESS="Stuttgart, Germany", VOLUME=17, PAGES=172, YEAR=1973, LANGUAGE="German", KEYWORDS="blocking; loss probability; calculation", } @INPROCEEDINGS{Bask73:Networks, AUTHOR="F. Baskett and R. R. Muntz", TITLE="Networks of Queues", BOOKTITLE="7th annual Conference on Information Science and Systems", ADDRESS="Princeton, USA", PAGES="428-434", YEAR=1973, KEYWORDS="Queueing network", } @ARTICLE{Behb73:Information, AUTHOR="J. Behboodian", TITLE="Information Matrix for a Mixture of Two Exponential Distributions", JOURNAL="Journal Statistical Computer Simulation", VOLUME=2, PAGES="1-16", YEAR=1973, KEYWORDS="Exponential distribution; method", } @ARTICLE{Cede73:Optimal, AUTHOR="I. Cederbaum and I. Paz", TITLE="On Optimal Routing Through Communication Nets", JOURNAL=ieeecom, VOLUME="COM-21", PAGES="936-941", YEAR=1973, KEYWORDS="Routing; Optimization", } @ARTICLE{Enge73:Statistically, AUTHOR="J. S. Engel and M. M. Peritsky", TITLE="Statistically - Optimum Dynamic Server Assignment in Systems with Interfering Servers", JOURNAL=ieeevt, VOLUME="VT-22", NUMBER=4, PAGES="203-209", YEAR=1973, KEYWORDS="cellular system; mobile radio", } @ARTICLE{Fluh73:Switching, AUTHOR="Z. C. Fluhr and E. Nussbaum", TITLE="Switching Plan for a Cellular Mobile Telephone System", JOURNAL=ieeevt, VOLUME="VT-22", NUMBER=2, PAGES="197-202", YEAR=1973, KEYWORDS="cellular system; mobile radio", } @ARTICLE{Fran73:Optimum, AUTHOR="R. L. Franks and R. W. Rishel", TITLE="Optimum Network Call-Carrying Capacity", JOURNAL=bstj, VOLUME=52, NUMBER=7, PAGES="1195-1214", YEAR=1973, KEYWORDS="Switching System; Congestion; Optimization; Call Processor Capacity", ABSTRACT="A telephone network with switching and trunk congestion is considered. An optimization problem expressed in terms of mean number of calls and mean rates of flows of calls in various cartegories of service throughout the network is formulated. The maximum mean number of talking calls given by this optimization problem is an upper bound on the mean number of talking calls which could be carried by the network using theoreti", } @ARTICLE{Guly73:Connection, AUTHOR="V. I. Gulyaev", TITLE="The Connection Between the Sojourn Time and State Probabilities in Mass Service Systems", JOURNAL=ec, VOLUME=11, NUMBER=1, PAGES="81-89", YEAR=1973, KEYWORDS="Queueing System; Delay Model; Steady State Probability", } @ARTICLE{Harv73:Queueing, AUTHOR="C. Harvey and D. J. Songhurst", TITLE="Queueing Problems in the Cordless Switchboard System No 1", JOURNAL=poeej, VOLUME=66, PAGES="225-230", YEAR=1973, KEYWORDS="Mobile radio; switching system; queueing system", } @TECHREPORT{Hert73:Några, AUTHOR="S. Hertzberg", TITLE="Några Modeller för Otillförlitliga Väntsystem", INSTITUTION="Helsinki University of Technology Telecommunication Laboratory", ADDRESS="Helsinki, Finland", NUMBER=6, PAGES=22, YEAR=1973, LANGUAGE="Swedish", } @ARTICLE{Keid7306:Growth, AUTHOR="N. Keiding and J. E. Nielsen", TITLE="The Growth of Supercritical Branching Processes with Random Environments", JOURNAL="The Annals of Probability", VOLUME=1, NUMBER=6, PAGES="1065-1067", YEAR=1973, KEYWORDS="Stochastic process", } @ARTICLE{Kucz73:Piecewise, AUTHOR="Anatol Kuczura", TITLE="Piecewise Markov Processes", JOURNAL=siapp, ADDRESS="Philadelphia, USA", VOLUME=24, PAGES="169-181", YEAR=1973, KEYWORDS="Markov process", } @ARTICLE{Kucz7301:Batch, AUTHOR="Anatol Kuczura", TITLE="Batch Input to a Multiserver Queue with Constant Service Times", JOURNAL=bstj, VOLUME=52, NUMBER=1, PAGES="83-99", YEAR=1973, KEYWORDS="Queueing system; multiserver; batch arrival", } @ARTICLE{Lane73:Spectral, AUTHOR="R. N. Lane", TITLE="Spectral and Economic Efficiencies of Land Mobile Radio Systems", JOURNAL=ieeevt, VOLUME="VT-22", NUMBER=4, PAGES="93-103", YEAR=1973, KEYWORDS="cellular system; mobile radio", } @TECHREPORT{Lind73:Upptagetsannolikhet, AUTHOR="G. Lind", TITLE="Upptagetsannolikhet då anropsintensiteten mot viss abonnent är proportional mot dennes inkommande trafik", TYPE="Internal Report", INSTITUTION="L M Ericsson AB", ADDRESS="Stockholm, Sweden", NUMBER="Dtm 3194-12-23", PAGES=12, YEAR=1973, LANGUAGE="Swedish", KEYWORDS="Telephony; traffic source model", ABSTRACT="B-Busy; Subscriber behaviour", } @ARTICLE{Maal7306:Approximations, AUTHOR="E. Maal e", TITLE="Approximations Formulae for Estimation of Waiting-time in Multiple-Channel Queueing System", JOURNAL=ms, VOLUME=19, NUMBER=6, PAGES="703-710", YEAR=1973, KEYWORDS="Queueing system; multiserver", } @ARTICLE{Neal7306:Theory, AUTHOR="S. R. Neal and Anatol Kuczura", TITLE="A Theory of Traffic-Measurement Errors for Loss Systems with Renewal Input", JOURNAL=bstj, VOLUME=52, NUMBER=6, PAGES="967-990", YEAR=1973, KEYWORDS="Loss system; traffic measurement; accuracy", } @ARTICLE{Nive73:Simulering, AUTHOR="K. Nivert and C. von Schantz", TITLE="Simulering av upptagetsystem - Några metoder att öka effektiviteten i simuleringsprogram. Paper presented at {ITC-7,} Stockholm 1973", JOURNAL=tele, ADDRESS="Sweden", VOLUME=4, PAGES="42-46", YEAR=1973, LANGUAGE="Swedish", KEYWORDS="Simulation method", } @ARTICLE{Peri73:Traffic, AUTHOR="M. M. Peritsky", TITLE="Traffic Engineering of Combined Mobile Telephone and Dispatch Systems", JOURNAL=ieeevt, VOLUME="VT-22", NUMBER=4, PAGES="223-225", YEAR=1973, KEYWORDS="delay loss model", ABSTRACT="Mixed loss delay system", } @TECHREPORT{Pohl73:Multicyclic, AUTHOR="P. Pohl", TITLE="The Multicyclic Vector Method of Generating Pseudo-Random Numbers. Theoretical Background, Description of the method and Algebraic Analysis", INSTITUTION="The Royal Institute of Technology, Department of Information Processing and Computer Science", ADDRESS="Stockholm", NUMBER="TRITA-NA-7307", PAGES=36, YEAR=1973, KEYWORDS="random number", ABSTRACT="KTH", } @ARTICLE{Poyn7304:Steady, AUTHOR="C. D. Poyntz and R. R. P. Jackson", TITLE="The Steady-State Solution for the Queueing Process Ek/Em/r", JOURNAL="Operational Research Quarterly", VOLUME=24, NUMBER=4, PAGES="615-625", YEAR=1973, KEYWORDS="Queueing system", ABSTRACT="The Ek/Em/r queue is analysed using a single generating function with many associated variables. Augmenting equations are derived which, when added to the steady state equations, give sufficient conditions to solve for the state probabilities of the system.", } @ARTICLE{Shne7305:Accuracy, AUTHOR="M. Shneps-Shneppe and Y. I. Shkol'nyy", TITLE="On the Accuracy of Statistical Simulation of Queueing Systems Described by Semi-Markov Birth-and-Death Processes", JOURNAL=ec, ADDRESS="SU", VOLUME=11, NUMBER=5, PAGES="762-766", YEAR=1973, KEYWORDS="Queueing system; simulation; time series analysis; accuracy", } @ARTICLE{Thom7301:Queueing, AUTHOR="N. T. Thomopoulos and P. M. McManamon and R. V. Janc and B. I. Marks", TITLE="A Queueing Model for Radio Nets. Part {II:} Results", JOURNAL=ieeecom, VOLUME="COM-21", NUMBER=1, PAGES="14-22", YEAR=1973, KEYWORDS="Mobile radio", } @ARTICLE{Uhli73:Fernsprech, AUTHOR="E. Uhlig", TITLE="Fernsprech-Nebenstellenanlagen", JOURNAL=ntz, PUBLISHER="VDE-Verlag", ADDRESS="Berlin, Germany", NUMBER=13, PAGES=28, YEAR=1973, LANGUAGE="German", KEYWORDS="Pabx", } @ARTICLE{Wike73:Den, AUTHOR="G. Wikell", TITLE="Den Svenska Trafikmaskinen", JOURNAL=tele, ADDRESS="Sweden", VOLUME=3, PAGES="40-44", YEAR=1973, LANGUAGE="Swedish", KEYWORDS="Simulation; traffic machine", } @ARTICLE{Jage73:Three, AUTHOR="P. Jagers and T. Lindvall", TITLE="Three Theorems on the Thinning of Point Processes", JOURNAL=aap, VOLUME=5, PAGES="14-15", YEAR=1973, KEYWORDS="Stochastic process", } @ARTICLE{Janc7301:Queueing, AUTHOR="R. V. Janc and N. T. Thomopoulos and B. I. Marks and P. M. McManamon", TITLE="A Queueing Model for Radio Nets. Part {I:} Methodology", JOURNAL=ieeecom, VOLUME="COM-21", NUMBER=1, PAGES="6-13", YEAR=1973, KEYWORDS="Mobile radio; queueing network; modeling", } @INPROCEEDINGS{Jens73:Conny, AUTHOR="A. Jensen", TITLE="Conny Palm and teletraffic theory", BOOKTITLE=itc7, ADDRESS="Stockholm, Sweden", PAGES="13-20", YEAR=1973, KEYWORDS="Traffic theory; history", } @ARTICLE{Palm73:Metoder, AUTHOR="C. Palm", TITLE="Metoder f”r bed”mning av sp„rningsol„genheten", JOURNAL=tele, ADDRESS="Sweden", VOLUME=4, PAGES="189-208", YEAR=1973, LANGUAGE="Swedish", KEYWORDS="Traffic measurement", } @ARTICLE{Robe73:Dynamic, AUTHOR="L. G. Roberts", TITLE="Dynamic allocation of satellite capacity through packet reservation", JOURNAL=afips, VOLUME=42, PAGES="711-716", NOTE="also in \cite[p. 85-90]{Chu74:Advances}", YEAR=1973, REFERENCES=10, KEYWORDS="Satellite radio; packet switching; access protocol; TDMA; time division multiple access", ANNOTE="If one projects the growth of computer communication networks like the ARPAnet to a worldwide situation, satellite communication is attractive for intercommunicating between the widespread geographic areas. For this variable demand, multi-station, data traffic situation, satellites are uniquely qualified in that they are theoretically capable of statistically averaging the load in total at the satellite rather than requiring each station", } @ARTICLE{Palm73:Metoder, AUTHOR="C. Palm", TITLE="Metoder för bedömning av spörningsolgenheten", JOURNAL=tele, ADDRESS="Sweden", VOLUME=4, PAGES="189-208", YEAR=1973, LANGUAGE="Swedish", KEYWORDS="Traffic measurement", } @ARTICLE{Liu7301:Scheduling, AUTHOR="Chao-Ming Liu and James W. Layland", TITLE="Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment", JOURNAL=jacm, VOLUME=20, NUMBER=1, PAGES="46-61", MONTH=jan, YEAR=1973, } @ARTICLE{Hill7301:Algorithm, AUTHOR="G. W. Hill and A. W. Davis", TITLE="Algorithm 442: Normal deviate {[S14].}", JOURNAL=cacm, VOLUME=16, NUMBER=1, PAGES="51-52", MONTH=jan, YEAR=1973, KEYWORDS="random variate generation", } @ARTICLE{Knop7301:Algorithm, AUTHOR="R. Knop", TITLE="Algorithm 441: Random samples from the dipole distribution {[G5].}", JOURNAL=cacm, VOLUME=16, NUMBER=1, PAGES=51, MONTH=jan, YEAR=1973, KEYWORDS="random variate generation", } @INPROCEEDINGS{Davi7302:Computing, AUTHOR="R. H. Davis", TITLE="Computing networks: a powerful national force: Keynote Speech", BOOKTITLE=compcon, NOTE="also in Computer, 6 (April 1973); \cite{Abra80:Computer}", MONTH=feb, YEAR=1973, } @INPROCEEDINGS{Kuo7302:Advances, AUTHOR="F. F. Kuo and N. Abramson", TITLE="Some advances in radio communication for computers", BOOKTITLE=compcon, PAGES="57-60", NOTE="also in \cite[203--206]{Chu74:Advances}", MONTH=feb, YEAR=1973, } @INPROCEEDINGS{Tjur7302:Det, AUTHOR="T. Tjur", TITLE="Det matematiske Grundlag for Sandsynlighedsregningen", BOOKTITLE="Foredrag i Dansk Selskab for Teoretisk Statistik", ADDRESS="Denmark", PAGES=22, DAYS=27, MONTH=feb, YEAR=1973, LANGUAGE="Danish", KEYWORDS="Statistics", } @ARTICLE{Kucz7303:Interrupted, AUTHOR="Anatol Kuczura", TITLE="The Interrupted Poisson Process as an Overflow Process", JOURNAL=bstj, VOLUME=52, NUMBER=3, PAGES="437-448", MONTH=mar, YEAR=1973, KEYWORDS="queueing theory; loss systems; IPP", ABSTRACT="Traffic overflowing a first-choice trunk group can be approximated accurately by a simple renewal process called an interrupted Poisson process - a Poisson process which is alternately turned on for an exponentially distributed time and then turned off for another (independent) exponentially distributed time. The approximation is obtained by matching either the first two or three moments of an interrupted Poisson process to those of an overflow process. Numerical investigation of errors in the approximation and subsequent experience has shown that this method of generating overflow traffic is accurate and very useful in both simulations and analyses of traffic systems.", } @ARTICLE{Lipp7303:Semi, AUTHOR="Steven A. Lippman", TITLE="Semi-Markov Decision Processes with Unbounded Rewards", JOURNAL=ms, VOLUME=19, NUMBER=7, PAGES="717-731", MONTH=mar, YEAR=1973, KEYWORDS="stochastic optimization", } @ARTICLE{Pack7303:Effect, AUTHOR="C. D. Pack", TITLE="The effect of multiplexing on a computer-communication system", JOURNAL=cacm, VOLUME=16, PAGES="161-168", MONTH=mar, YEAR=1973, } @ARTICLE{Sing7304:Queue, AUTHOR="V. P. Singh", TITLE="Queue-Dependent Servers", JOURNAL=jem, VOLUME=7, NUMBER=2, PAGES="123-126", MONTH=apr, YEAR=1973, KEYWORDS="queueing theory", ABSTRACT="A Markovian queue with number of servers depending upon queue length is discussed. Whenever the queue in front of the first server reaches a certain length, the system stars another server. There are costs associated with the opening of a new server and the waiting of the customers. A relationship among the costs, traffic intensity and the queue size is obtained.", } @ARTICLE{Hope7304:Architectural, AUTHOR="L. Hopewell and Wu Chou and H. Frank", TITLE="Analysis of architectural strategies for a large message-switching network: a case study", JOURNAL=ieeecomp, VOLUME=6, PAGES="26-34", NOTE="also in \cite{Abra80:Computer}", MONTH=apr, YEAR=1973, } @INCOLLECTION{Bhat7305:Problems, AUTHOR="U. Narayan Bhat", TITLE="Some Problems in Finite Queues", BOOKTITLE="Mathematical Methods in Queueing Theory --- a Conference at Western Michigan University", EDITOR="A. B. Clarke", SERIES="Springer Lecture Notes in Economics and Mathematical Systems", PUBLISHER="Springer Verlag", VOLUME=98, PAGES="139-156", MONTH=may, YEAR=1973, KEYWORDS="queueing theory; bounded wait", ANNOTE="Finite capacity $M/G/1$ and $G/M/s$.", } @INPROCEEDINGS{Weis7305:Logische, AUTHOR="H. Weisschuh", TITLE="Logische und funktionelle Simulation einer komplexen Hardware-Steuerung zur Datenvorverarbeitung", BOOKTITLE="GI-Workshop über Methodik der rechnergestützten Simulation", INSTITUTION="NVDV, Universit Stuttgart", ADDRESS="Karlsruhe, Germany", PAGES=8, MONTH=may, YEAR=1973, LANGUAGE="German", KEYWORDS="Simulation; control system", } @ARTICLE{Mysk7306:Investigation, AUTHOR="A. Myskja and O. Walman", TITLE="An Investigation of Telephone User Habits by Means of Computer Technics", JOURNAL=ieeecom, VOLUME=21, NUMBER=6, PAGES="663-671", MONTH=jun, YEAR=1973, KEYWORDS="Measurement", } @ARTICLE{Hsu7306:General, AUTHOR="J. Hsu", TITLE="A General Queueing Model for Buffer Storage Problems", JOURNAL=ieeecom, VOLUME="COM-21", NUMBER=6, PAGES="744-747", MONTH=jun, YEAR=1973, KEYWORDS="queueing theory", ABSTRACT="A mathematical model for a general telecommunication system with the output channel available only periodically is constructed and analyzed in this paper. Under the assumptions that certain system parameters are continuous variables, it is shown that the probability density functions for the peaks and valleys of the buffer content are exactly the same as the density for the response time and waiting time, respectively, for a $GI/G/1$ queueing system, with the density functions for the arrival process $GI$ and the service process $G$ obtained from the statistical functions for the parameters of the original buffered system.", ANNOTE="Server with interruptions; infinite buffer.", } @ARTICLE{Klim7306:Single, AUTHOR="Eugene M. Klimko and M. F. Neuts", TITLE="The Single Server Queue in Discrete Time -- Numerical Analysis {II}", JOURNAL=navres, VOLUME=20, NUMBER=2, PAGES="305-319", MONTH=jun, YEAR=1973, KEYWORDS="discrete time queue", ANNOTE="Computation of higher-order moments of the busy period.", } @ARTICLE{Neut7306:Single, AUTHOR="M. F. Neuts", TITLE="The Single Server Queue in Discrete Time -- Numerical Analysis I", JOURNAL=navres, VOLUME=20, NUMBER=2, PAGES="297-304", MONTH=jun, YEAR=1973, KEYWORDS="discrete time queue", } @INPROCEEDINGS{Katz7306:Service, AUTHOR="L. Katzschner", TITLE="Service Protection for Direct Final Traffic in {DDD-Networks}", BOOKTITLE=itc7, ADDRESS="Stockholm", PAGES="413/1-413/6", MONTH=jun, YEAR=1973, REFERENCES=15, KEYWORDS="Traffic Engineering", } @INPROCEEDINGS{McDo7306:Computer, AUTHOR="M. H. McDougall and J. S. McAlpine", TITLE="Computer simulation with {ASPOL}", BOOKTITLE="Symposium on the simulation of computer systems", MONTH=jun, YEAR=1973, KEYWORDS="Simulation", } @ARTICLE{Ensl7308:Legal, AUTHOR="Jr. Enslow", TITLE="Non-technical issues in network design-economic, legal, social, and other considerations", JOURNAL=ieeecomp, VOLUME=6, PAGES="20-30", NOTE="also in \cite{Abra80:Computer}", MONTH=aug, YEAR=1973, } @ARTICLE{Pyke7308:Computer, AUTHOR="R. Pyke and R. P. Blanc", TITLE="Computer networking technology --- a state of the art review", JOURNAL=ieeecomp, VOLUME=6, PAGES="12-19", NOTE="also in \cite{Abra80:Computer}", MONTH=aug, YEAR=1973, } @ARTICLE{Neut7309:Single, AUTHOR="M. F. Neuts", TITLE="The Single Server Queue in Discrete Time -- Numerical Analysis {III}", JOURNAL=navres, VOLUME=20, NUMBER=3, PAGES="557-567", MONTH=sep, YEAR=1973, KEYWORDS="discrete time queue", ANNOTE="Stationary analysis of finite, single-server queue. Queue length distributions at various time points.", } @ARTICLE{Buze7309:Computational, AUTHOR="J. P. Buzen", TITLE="Computational Algorithms for Closed Queueing Networks with Exponential Servers", JOURNAL=cacm, VOLUME=16, NUMBER=9, PAGES="527-531", MONTH=sep, YEAR=1973, KEYWORDS="queueing theory; queueing networks; equilibrium distribution; steady state distributions; convolution algorithm", ABSTRACT="Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers. Expressions for various marginal distributions are also derived. The computational algorithm are based on two-dimensional iterative techniques which are highly efficient and quite simple to implement. Implementation considerations such as storage allocation strategies and order of evaluation are examined in some detail.", } @ARTICLE{Bagc7310:Finite, AUTHOR="T. P. Bagchi and J. G. C. Templeton", TITLE="Finite waiting space bulk queueing systems", JOURNAL=jem, VOLUME=7, NUMBER=4, PAGES="313-317", MONTH=oct, YEAR=1973, KEYWORDS="Queueing theory", ABSTRACT="The paper extends earlier work on the stationary queue length distribution of a bulk service system with finite waiting space by considering two queueing systems. The first system incorporates the feature of batch arrivals with group service; it has compound Poisson input, general service times and a single server with variable batch capacity. The second system has individually arriving customers with Erlangian interarrival time distribution, general service times and a single server with variable batch capacity.", } @ARTICLE{Lewa7310:Algorithm, AUTHOR="C. R. Lewart", TITLE="Algorithm 463: Algorithms {SCALE1,} {SCALE2,} and {SCALE3} for determination of scales on computer generated plots", JOURNAL=cacm, VOLUME=16, NUMBER=10, PAGES="639-640", MONTH=oct, YEAR=1973, KEYWORDS="plotting; scaling for plotting; axes; graphics", ABSTRACT="It is often desirable to plot computer generated output or obtain discrete distribution functions such as histograms automatically. In general the raw data does not lend itself directly to an easily readable presentation. The three related algorithms as presented here obtain readable linear or logarithmic scales with uniform interval sizes for users of various plot routines.", } @ARTICLE{Ahre7310:Extensions, AUTHOR="J. Ahrens and U. Dieter", TITLE="Extensions of Forsythe's method for random sampling from the normal distribution", JOURNAL=moc, VOLUME=27, NUMBER=124, PAGES="927-937", MONTH=oct, YEAR=1973, KEYWORDS="random variate generation", } @ARTICLE{Kret7310:New, AUTHOR="E. R. Kretzmer", TITLE="The new look in data communications", JOURNAL=blr, PAGES="259-265", NOTE="also in \cite[p. 197-204]{Gree75:Computer}", MONTH=oct, YEAR=1973, } @TECHREPORT{Pouz7310:Interconnection, AUTHOR="L. Pouzin", TITLE="Interconnection of Packet Switched Networks", INSTITUTION="INWG", NUMBER=42, MONTH=oct, YEAR=1973, } @ARTICLE{Anon7310:Third, AUTHOR="Anonymous", TITLE="Third Data Communications Symposium--Preview", JOURNAL=ccr, VOLUME=3, NUMBER="1--4", MONTH=oct, YEAR=1973, } @PHDTHESIS{Gaug7311:Signalverarbeitung, AUTHOR="A. Gaugg", TITLE="Signalverarbeitung in linearen binären Systemen", SCHOOL="TH Wien", ADDRESS="Vienna, Austria", MONTH=nov, YEAR=1973, LANGUAGE="German", KEYWORDS="Shift register sequences", } @ARTICLE{Ande7311:Approximating, AUTHOR="H. A. Anderson", TITLE="Approximating pre-emptive priority dispatching in a multiprogramming model", JOURNAL=ibmjrd, VOLUME=17, NUMBER=6, PAGES="533-539", MONTH=nov, YEAR=1973, } @INPROCEEDINGS{Herz7311:Efficient, AUTHOR="U. Herzog", TITLE="Efficient priority strategies for switching centers in communication networks", BOOKTITLE="2nd Texas Conference on Computing Systems", ADDRESS="Austin, Tx", PAGES="1-7 (4.5) (paper 5)", MONTH=nov, YEAR=1973, KEYWORDS="Queueing system; priority; analysis", } @INPROCEEDINGS{Reis7311:Numerical, AUTHOR="M. Reiser and H. Kobayashi", TITLE="Numerical solution of semiclosed exponential server queuing networks", BOOKTITLE="7th Asilomar Conference on Circuits, Systems, and Computers", EDITOR="S. R. Parker", ADDRESS="Asilomar", PAGES="308-312", MONTH=nov, YEAR=1973, KEYWORDS="Queueing network; product form; analysis", } @INPROCEEDINGS{Chou7311:Unified, AUTHOR="Wu Chou and A. Kershenbaum", TITLE="A unified algorithm for designing multidrop teleprocessing networks", BOOKTITLE="3rd Data Communication Symposium", ADDRESS="Florida", PAGES="148-156", NOTE="also in \cite[p. 283--291]{Chu74:Advances}", MONTH=nov, YEAR=1973, } @INPROCEEDINGS{Badr7311:General, AUTHOR="F. M. Badran", TITLE="A General Algorithm for Service Processes Leading to Erlang's Loss formula", BOOKTITLE="National Telecommunications Conference", PAGES=14, MONTH=nov, YEAR=1973, KEYWORDS="Erlang b formula; algorithm", } @INPROCEEDINGS{Schu7311:Optimizing, AUTHOR="D. M. Schutzer and F. J. Ricci", TITLE="Optimizing a Communication Systems Performance Through the Use of Adaptive Control", BOOKTITLE="National Telecommunications Conference", ADDRESS="Atlanta, Georgia", PAGES="2A.1-8", MONTH=nov, YEAR=1973, KEYWORDS="Communication system; optimization", } @ARTICLE{Neut7312:Single, AUTHOR="M. F. Neuts", TITLE="The Single Server Queue in Discrete Time -- Numerical Analysis {IV}", JOURNAL=navres, VOLUME=20, NUMBER=4, PAGES="753-766", MONTH=dec, YEAR=1973, KEYWORDS="discrete time queues", ANNOTE="I.i.d. Batch arrivals $\leq K$, i.i.d. service time $\leq L\_2$, unbounded and bounded $L\_1$ queue. Busy period for unbounded queue.", } @INPROCEEDINGS{Bhan7312:Markov, AUTHOR="D. P. Bhandarkar and S. H. Fuller", TITLE="Markov chain models for analyzing memory interference in multiprocessor computer systems", BOOKTITLE="1st Annual Symposium Computer Architecture", PAGES="1-6", MONTH=dec, YEAR=1973, REFERENCES=14, KEYWORDS="Markov chain; continuous time process; discrete time process; memory interference; multiprocessor system; analysis; diffusion approximation", }