@INPROCEEDINGS{Bacc81:Queues, AUTHOR="François Baccelli and Gérard Hebuterne", TITLE="On Queues with Impatient Customers", BOOKTITLE="Performance", EDITOR="F. J. Kylstra", PUBLISHER="North Holland", PAGES="159-179", YEAR=1981, KEYWORDS="queueing theory", ANNOTE="bounded wait; $GI/G/1$ queue with arbitrary time-out/deadline distribution.", } @BOOK{Bron81:Taschenbuch, AUTHOR="I. N. Bronstein and K. A. Semendjajew", TITLE="Taschenbuch der Mathematik", EDITION="19th", PUBLISHER="Verlag Harri Deutsch", ADDRESS="Thun und Frankfurt/Main", YEAR=1981, } @BOOK{Karl81:Second, AUTHOR="Samuel Karlin and Howard M. Taylor", TITLE="A Second Course in Stochastic Processes", PUBLISHER="Academic Press", ADDRESS="San Diego, California", YEAR=1981, KEYWORDS="stochastic processes; probability theory", } @BOOK{Koba81:Modeling, AUTHOR="Hisashi Kobayashi", TITLE="Modeling and Analysis: An Introduction to System Performance Evaluation Methodology", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1981, KEYWORDS="performance evaluation", } @ARTICLE{Lawr81:New, AUTHOR="A. J. Lawrence and Pierre Lewis", TITLE="A new Autoregressive Time Series Model in Exponential Variables {(NEAR(1))}", JOURNAL=aap, VOLUME=13, PAGES="826-845", YEAR=1981, KEYWORDS="simulation", } @BOOK{Neut81:Matrix, AUTHOR="Marcel F. Neuts", TITLE="Matrix-Geometric Solutions in Stochastic Models", PUBLISHER="The Johns Hopkins University Press", ADDRESS="Baltimore, Maryland", YEAR=1981, KEYWORDS="queueing theory", } @BOOK{Saue81:Computer, AUTHOR="Charles H. Sauer and K. M. Chandy", TITLE="Computer systems performance modeling", ISBN="0-13-165175-7", PUBLISHER="Prentice-Hall", ADDRESS="Princeton, New Jersey", YEAR=1981, KEYWORDS="performance evaluation; simulation; queueing theory", } @INPROCEEDINGS{Jana8111:Multiplexing, AUTHOR="N. Janakiraman and Bernard Pagurek and J. E. Neilson", TITLE="Multiplexing voice sources", BOOKTITLE=ntc, ORGANIZATION="IEEE", ADDRESS="New Orlean, Louisiana", PAGES="G4.3.1-G4.3.5", MONTH="November/December", YEAR=1981, KEYWORDS="TDMA; multiplexer; integrated services", ABSTRACT="In this paper the performance analysis of a synchronous time division multiplexer (STDM) which transmits data during silent periods of voice is given. It is also shown, by simple mathematical formulation, that the interrupted single server model of a previous investigation cannot be realistically applied to the voice-data STDM system.", ANNOTE="argues that superposition of voice sources does not approach Poisson process", } @TECHREPORT{John81:Evolution, AUTHOR="P. Johnson-Lenz", TITLE="The Evolution of a Tailored Communications Structure: The Topics System", INSTITUTION="New Jersey Institute of Technology", ADDRESS="Newark, NJ", NUMBER=14, YEAR=1981, KEYWORDS="computer conferencing", } @TECHREPORT{Hilt81:Impact, AUTHOR="Starr Roxanne Hiltz", TITLE="The Impact of a Computerized Conferencing System on Scientific Research Communities", TYPE="Research Report", INSTITUTION="New Jersey Institute of Technology", NUMBER=15, NOTE="Final Report to the National Science Foundation", YEAR=1981, KEYWORDS="computer conferencing", } @PHDTHESIS{Parn81:Learning, AUTHOR="Robert A. Parnes", TITLE="Learning to {CONFER:} The Interplay of Theory and Practice in Computer Conferencing", SCHOOL="University of Michigan", PAGES=353, YEAR=1981, KEYWORDS="computer conferencing", ABSTRACT="This dissertation presents a description and analysis of CONFER, a computer conferencing and multi-purpose communications system designed and developed over the past half dozen years at The University of Michigan. Chapter 1 deals with the group communications context from which CONFER emerged: the face-to-face meeting. The time, technological, psychological, and cost constraints which are problems governing traditional face-to-face group communication are discussed. The theoretical ``solution'' is presented as a cluster of elements of a model communications system. In this system all individuals are able to control their input and output and the style of their interactions, time and space constraints are eliminated, anonymous behavior is possible, and participation is facilitated. In Chapter 2, the methods and procedures used to develop the CONFER system are discussed. The context from which CONFER emerged, a concern with small group governance in both its communications and decision making dimensions, is described, as are the principles operationalized in the CONFER system: individual equality, freedom, privacy and flexibility, and the facilitation of individual participation. The historical development of a unique feature of CONFER, the ``vote,'' is presented in Chapter 3. This operationalizes the emphasis placed on interactivity and feedback in the system. The premise that underlies this permeating feature of the system is that the individual participant should continually alternate between being a producer and being a consumer of communications. In Chapter 4, the results of actual CONFER use are set forth via the construction of a typology of CONFER conferences drawn from an examination of actual conference usage. The typology is based on three independent variables: ``who'' participates--whether a ``well-defined'' or ``ill-defined'' set of individuals; ``when'' the conference takes place--whether for a ``fixed'' or ``indefinite'' duration; and ``how'' the content is approached--whether the agenda is of a ``focused'' or ``full-scope'' nature. Eight conference types are identified and described. Descriptions of actual conferences of each type are presented and analyzed. CONFER's future, sketched from the perspective of the constraints potentially impinging on its dissemination is the subject of Chapter 5. These constraints are identified as falling into two general categories: the technical and the conceptual. The former are viewed as being more or less automatically correcting. The latter are seen as being more profound and therefore more critical. They have to do with the seemingly simple but profoundly difficult matter of people understanding that computer conferencing is a genuinely new communications medium, not the augmentation of old forms of communication.", } @BOOK{Vian81:Knowledge, AUTHOR="Kathleen Vian and Robert Johansen", TITLE="Knowledge Synthesis and Computer-Based Communications Systems: Changing Behaviors and Concepts", PUBLISHER="Position Paper for National Institute of Education", PAGES=24, YEAR=1981, KEYWORDS="computer conferencing; electronic mail", ABSTRACT="Patterns of use of computer-based communication technologies in knowledge synthesis area described by looking at the way groups use the synthesis. A chart of basic options for communication through computers is provided: generic class of system, examples of specific systems, groups size, form of communications, record keeping access, and complexity. Eight basic patterns of communication are identified and discussed: 1) lots of interpersonal interaction, 2) emphasis on the group, 3) more interaction between users and producers, 4) a valuing of chance, 5) asynchronous communication and asynchronous thought, 6) divergence, 7) informality, and 8) technology.", } @BOOK{McCu81:Digital, AUTHOR="Lyle B. McCurdy and Albert L. McHenry", TITLE="Digital Logic Design and Applications", PUBLISHER="Prentice-Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1981, } @ARTICLE{Shoc81:Mutual, AUTHOR="John F. Shoch and Danny Cohen and Edward A. Taft", TITLE="Mutual encapsulation of internetwork protocols", JOURNAL=cn, VOLUME=5, NUMBER=4, PAGES="287-300", YEAR=1981, REFERENCES=16, KEYWORDS="Communication network; communication protocol; ARPAnet", ANNOTE={Encapsulation is a key concept in developing a layered architecture for communication protocols: objects from one layer can be "encapsulated" for transmission through a lower layer in the architecture. This approach can be used to combine different incompatible networks into a single "internetwork": packets from a unified internet protocol are encapsulated within the network-speci fic formats and protocols associated with each individual networ}, } @ARTICLE{Sieg81:Using, AUTHOR="H. J. Siegel and Robert McMillen", TITLE="Using the augmented data manipulator network in {PASM}", JOURNAL=ieeecomp, VOLUME=14, NUMBER=2, PAGES="25-33", YEAR=1981, REFERENCES=44, KEYWORDS="Network architecture; network throughput; reliability", ANNOTE="The ADM network, with its multiple paths between given inputs and outputs, could bring fast, cost-effective communications to PASM and other distributed/parallel systems.", } @ARTICLE{Spro81:Routing, AUTHOR="D. E. Sproule and F. Mellor", TITLE="Routing flow, and congestion control in the {DATAPAC} network", JOURNAL=ieeecom, VOLUME="COM-29", PAGES="386-391", YEAR=1981, REFERENCES=8, KEYWORDS="Packet switching; DATAPAC; routing algorithm; network", ANNOTE="Datapac is the transcanada telephone system's public packet-switched network, based on the northern telecom sl-10 packet switching system. The primary packet-switched communications facility offered by the sl-10 in datapac is a virtual circuit service for which several types of customer interfaces are available. The virtual circuit service relies on a datagram facility for basic internodal communications.", } @INPROCEEDINGS{Stau81:Protocol, AUTHOR="W. Staudinger", TITLE="Protocol architecture and its application for {CCITT} standardized services", BOOKTITLE="computer message systems IFIP", PUBLISHER="North Holland", YEAR=1981, KEYWORDS="Protocol; CCITT; standardization", } @ARTICLE{Stev81:Proposed, AUTHOR="Dan Stevenson", TITLE="A proposed standard for binary floating point arithmetic", JOURNAL=ieeecom, PAGES="51-62", YEAR=1981, KEYWORDS="Standardization; computer arithmetic; IEEE 754; floating", ANNOTE="Offered here for public comment, this proposed standard facilitates transportation of numerically oriented programs and encourages development of high-quality numerical software.", } @ARTICLE{Stou81:Coming, AUTHOR="D. R. Stoutemyer", TITLE="The coming revolution in scientific computation", JOURNAL="Computer Education", VOLUME=5, NUMBER=1, PAGES="53-55", YEAR=1981, KEYWORDS="Symbolic algebraic computation; microprocessor software", ANNOTE="A symbolic mathematical system is available on Z80 and TRS80.", } @TECHREPORT{Südh81:Benutzerverhalten, AUTHOR="H.-D. Südhofen", TITLE="Benutzerverhalten in Fernverarbeitungssystemen - Dokumentation wichtiger Meßergebnisse", INSTITUTION="Lehrstuhl AE und DFV RWTH Aachen", ADDRESS="Aachen, Germany", PAGES="1-30", YEAR=1981, LANGUAGE="German", REFERENCES=12, KEYWORDS="measurement; man-machine interaction; stochastic analysis", ABSTRACT="Im Rahmen des Forschungsprojektes ``Messung des Zufallsverhaltens peripherer Datenstationen in Fernverarbeitungssystemen'' wurden in den Jahren 1974-1978 fünf Messungen durchgefuehrt. Die wichtigsten der dabei erzielten Ergebnisse sind in dieser schrift dokumentiert.", } @ARTICLE{Tane81:Protocols, AUTHOR="Andrew Tanenbaum", TITLE="Network protocols", JOURNAL=acmcs, VOLUME=13, PAGES="453-489", YEAR=1981, REFERENCES=80, KEYWORDS="survey; bibliography; communication network; OSI; ISO", ANNOTE="During the last ten years, many computer networks have been designed, implemented, and the put into service in the united states, canada, europe, japan, and elsewhere. From the experience obtained with these networks, certain key design principles have begun to emerge, principles that can be used to design new computer networks in a more structured way than has traditionally been the case. Chief among these principles is the notion of structuri", } @ARTICLE{Tiet81:Anpassungsschnittstelle, AUTHOR="W. Tietz", TITLE="Anpassungsschnittstelle {X.28/X.29}", JOURNAL=infspec, VOLUME=4, NUMBER=4, PAGES=271, YEAR=1981, LANGUAGE="German", REFERENCES=3, KEYWORDS="standard; packet switching; interface processor; X.28", } @TECHREPORT{Totz81:Mittelwertanalyse, AUTHOR="G. Totzauer", TITLE="Mittelwertanalyse von Warteschlangennetzen mit offenen und geschlossenen Ketten", TYPE="Interner Bericht", INSTITUTION="Institut für Informatik III", ADDRESS="Karlsruhe, Germany", NUMBER="12/81", PAGES="1-37", YEAR=1981, LANGUAGE="German", REFERENCES=4, KEYWORDS="Closed queueing network; open queueing network; MVA; BCMP", ANNOTE="Die Mittelwertanalyse ist ein rekursives Verfahren, das die Berechnung von Durchsätzen, mittleren Verweilzeiten und mittleren Kundenzahlen in Netzen mit ausschliesslich geschlossenen Ketten ermöglicht. In diesem Bericht wird gezeigt, wie dieses Verfahren erweitert werden kann, um damit gemischte Netze sowohl mit geschlossenen als auch mit offenen Ketten analysieren zu können.", } @ARTICLE{Toue81:Complexity, AUTHOR="S. Toueg and K. Steiglitz", TITLE="Some complexity results in the design of deadlock-free packet switching networks", JOURNAL=sicomp, VOLUME=10, NUMBER=4, PAGES="702-712", YEAR=1981, KEYWORDS="Packet switching; complexity measure; network flow", } @INPROCEEDINGS{Tran81:Modelling, AUTHOR="Phuoc Tran-Gia", TITLE="Modelling and analysis of software resources in modular {SPC} switching systems - some aspects of dimensioning and overload control", BOOKTITLE="4th International Conference on Software Engineering for", ADDRESS="Warwick, England", YEAR=1981, KEYWORDS="Queueing system; switching system; overload control", ANNOTE="A queueing model for two software machines handling calls in tandem is presented. Software machines are components of stored program controlled (spc) switching systems with modular software structure. Dimensioning and overload control aspects are discussed and a call acceptance and ragulation method, which increases the call completion rate of the switching system, is developed and investigated. Numerical results are given for dimensioning purp", } @INPROCEEDINGS{Tran81:Queueing, AUTHOR="David R. Manfield and Phuoc Tran-Gia", TITLE="Queueing analysis of scheduled communications phases in distributed processing systems", BOOKTITLE="International Symposium on Computer Performance Modelling", ADDRESS="Amsterdam, Holland", VOLUME=8, PAGES=18, YEAR=1981, REFERENCES=11, KEYWORDS="Distributed system; performance evaluation; Queueing", } @ARTICLE{Tran81:Dependency, AUTHOR="Phuoc Tran-Gia and M. van Hoorn", TITLE="Dependency of service time on waiting time in switching systems -- a queueing analysis with aspects of overload control", JOURNAL=ieeecom, VOLUME="COM-34", NUMBER=4, PAGES="357-365", YEAR=1981, REFERENCES=12, KEYWORDS="Queueing system; switching system; overload control", } @BOOK{Trop81:Local, AUTHOR="C. Tropper", TITLE="Local computer network technologies", PUBLISHER="Academic Press", ADDRESS="New York, New York", PAGES=144, YEAR=1981, REFERENCES=2, KEYWORDS="LAN; ring network; multipoint connection; arbitration", } @ARTICLE{Tros81:Modellierung, AUTHOR="S. Trosch", TITLE="Modellierung und Leistungsbewertung eines Betriebssystems durch Simulation", JOURNAL="Informatik Fachberichte", PUBLISHER="Springer-Verlag", ADDRESS="Berlin, Germany", VOLUME=41, PAGES="294-308", YEAR=1981, LANGUAGE="German", KEYWORDS="Simulation; operating system; model; performance", ANNOTE="Das time-sharing Betriebssystem BS2000 arbeitet mit virtuellem Speicher und unterstuetzt Teilnehmer-Batch-Tasks sowie Teilhaber Prozesse. Mit dem Programm ASIBS2 wurde ein Modell zur Simulation dieses Betiebssystems entwickelt.", } @ARTICLE{Wyk81:Graphics, AUTHOR="C. van Wyk", TITLE="A graphics typesetting language", JOURNAL=sigplan, VOLUME=16, NUMBER=6, PAGES="99-107", YEAR=1981, REFERENCES=21, KEYWORDS="Application; data structure; diagram manipulation; design; graphics; interactive mode; programming language; text processing; human factors; command language; graphics language; interpreter; formula interpretation; information system", ABSTRACT="We present a new programming language ideal in which two-dimensional figures can be expressed. The language is intended to work with existing text-formatting systems so that text and figures can be typeset at the same time. We discuss good algorithms for implementing ideal when the constraints are expressed as a special kind of nonlinear system and the pictures are composed of straight lines and circular arcs. The language has been implemented \ldots", } @INPROCEEDINGS{Walk81:Static, AUTHOR="B. Walke", TITLE="A static priority queue with piecewise Markovian distributed service time and waiting-time optimal discipline", BOOKTITLE="Performance", ADDRESS="New York, New York", PAGES="285-300", YEAR=1981, REFERENCES=15, KEYWORDS="M/g/1; prehol priority; waiting time; expectation", ANNOTE="An infinite queue single server model with preemptive resume priorities is considered. Customers with priority $i(1<=i<=n)$ arrive according to a poisson process, join the i-th priority level and demand service according to a general distribution function. In each level the service discipline may be either fcfs of mlfcfs (multi-level fcfs). In the mlfcfs discipline customers are assigned to different important sublevels within a priority level, d", } @INPROCEEDINGS{Wang81:Round, AUTHOR="Yu Wang", TITLE="An analysis of a round-robin schedule with preemptive priorities", BOOKTITLE="Performance", ADDRESS="New York, New York", PAGES="147-157", YEAR=1981, REFERENCES=19, KEYWORDS="M/M/1; round robin; PREHOL priority", ANNOTE="We consider a class of process schedules which assigns static preemptive priorities to processes and uses timeslicing (quantum) mechanism to favor processes with shorter service requirements. The Laplace-Stieltjes transform of the conditional response time distribution of processes at a given priority is presented. Numerical results are given for the conditional mean and variance. Comparisons are also made with a priority-driven round-robin sch", } @ARTICLE{Wang81:Overload, AUTHOR="Yu Wang", TITLE="Analysis of some overload control strategies for queuing systems with delayed feedback", JOURNAL=pe, VOLUME=1, PAGES="305-319", YEAR=1981, KEYWORDS="Priority; queueing system; feedback; process scheduling", ANNOTE="We consider a priority queuing system which consists of two queues sharing the central processor and in which there is delayed feedback. Such a model arises from systems which employ a prority assignment scheme to achieve overload control. In particular, we analyze the class of overload control strategies which give active jobs higher priority over the jobs waiting to be initialized at the central processor.", } @ARTICLE{Wats81:Configuration, AUTHOR="B. W. Watson", TITLE="Configuration-dependent performance of a prioritized {CSMA} broadcast network", JOURNAL=ieeecomp, VOLUME=14, NUMBER=2, PAGES="51-58", YEAR=1981, REFERENCES=14, KEYWORDS="Network architecture; network delay; network throughput", ANNOTE="The interaction of node placement and contention mechanism is crucial to network performance. These experiments suggest that elaborate contention schemes have but little advantage over simpler ones.", } @ARTICLE{Webe81:Numerical, AUTHOR="H. Weber", TITLE="Numerical computation of the Fourier transform using Laguerre functions and the first Fourier transform", JOURNAL="Numerical Mathematics", VOLUME=36, NUMBER=2, PAGES="197-209", YEAR=1981, KEYWORDS="Characteristic function; Laplace transform; Laguerre", } @INPROCEEDINGS{Whit81:Basic, AUTHOR="L. J. White", TITLE="Basic mathematical definitions and results in testing", BOOKTITLE="computer program testing", PUBLISHER="North Holland", PAGES="13-24", YEAR=1981, KEYWORDS="Switching system; test tool", } @ARTICLE{Whit81:Stochastic, AUTHOR="Ward Whitt", TITLE="On stochastic bounds for the delay distribution in the {GI/G/s} queue", JOURNAL=or, VOLUME=29, PAGES="604-608", YEAR=1981, KEYWORDS="Queueing system; GI/G/s; delay; approximation", } @ARTICLE{Winz81:Comparison, AUTHOR="G. Winzer and H. Witte", TITLE="Comparison of fiber-optic bus networks", JOURNAL=siemensfe, VOLUME=10, NUMBER=1, PAGES="9-15", YEAR=1981, REFERENCES=14, KEYWORDS="Data network; multipoint connection; fiber optics", ANNOTE="The present report compares the two basic fiber-optic data bus network configurations as well as their hybrid forms along with their fibers and optical tapping elements on the basis of empirically determined operating parameters.", } @ARTICLE{Witt81:Hidden, AUTHOR="M. Wittram", TITLE="Hidden-line algorithm for scenes of high complexity", JOURNAL="Computer Aided Design", VOLUME=13, NUMBER=4, PAGES="187-192", YEAR=1981, KEYWORDS="Graphics; fortran; hidden line algorithm; three-dimensional", ANNOTE="A new approach to the hidden-line problem is presented. The main tools of the method are calculation of edge intersections, test on appearance or disappearance of edges, and record sort. Special treatment of coherence and singularities is required. The programs are written in fortran and are very short and simple. The computation time of the algorithm is short enough to handle scenes of high complexity.", } @ARTICLE{Wolf81:Modellierungssystem, AUTHOR="Bernd E. Wolfinger", TITLE="Das Modellierungssystem {MOSAIC} zur Analyse mit Optimierung hierarchisch organisierter Kommunikationsprotokolle in Rechnernetzen", JOURNAL=er, VOLUME=23, PAGES="199-211", YEAR=1981, LANGUAGE="German", REFERENCES=27, KEYWORDS="Simulation; model; communication network; communication", ANNOTE="Die generalisierten Simulativen modelle, die Mosaic zugrunde liegen, gestatten eine präzise Beschreibung des Verhaltens von Kommunikationsprotokollen und ihrer Hierarchien unter gleichzeitiger Miteinbeziehung der Betriebsmittelzuteilung in den kommunizierenden Rechnern. Mittels eines graphischen Benutzerinterfaces lässt sich aus diesen Modellen ein ablauffähiges Simulationsprogramm konfigurieren.", } @ARTICLE{Yuil81:Modeling, AUTHOR="S. J. Yuill and Raymond L. Pickholtz", TITLE="Performance modeling for packet networks with satellite overflow channels", JOURNAL=ieeecom, VOLUME="COM-29", PAGES="808-815", YEAR=1981, REFERENCES=10, KEYWORDS="Packet switching; satellite communication; overflow", ANNOTE="In a packet network using medium speed terrestrial connectivity, average end-to-end delay can be reduced by using high-speed satellite overflow channels despite their propagation delay. To investigate networks of this type analytically, we derive a new basic queueing model for overflow systems with buffered traffic.", } @ARTICLE{Yum81:Semidynamic, AUTHOR="Tak-Shing Yum", TITLE="The design and analysis of a semidynamic deterministic routing rule", JOURNAL=ieeecom, VOLUME="COM-29", PAGES="498-504", YEAR=1981, REFERENCES=14, KEYWORDS="Routing algorithm; store-and-forward; computer network", ANNOTE="The best deterministic rule, newly proposed in this paper is similar in nature to the best stochastic rule, except that 1) a maximum traffic bifurcation flow distribution is chosen and 2) deterministic routing sequences are used. Analysis shows that the best deterministic rule always gives better delay performance than the best stochastic rule. A semidynamic version of this rule is introduced for use in a varying traffic rate environment.", } @ARTICLE{Yum81:Join, AUTHOR="Tak-Shing Yum and Mischa Schwartz", TITLE="The join-biased-queue rule and its application to routing in computer communication networks", JOURNAL=ieeecom, VOLUME="COM-29", PAGES="505-511", YEAR=1981, REFERENCES=19, KEYWORDS="Routing algorithm; store-and-forward; computer network", ANNOTE="A routing rule similar in nature to delta-routing is studied in this paper. The approach is to superimpose local adaptivity on top of a fixed traffic flow distribution. The fixed flow distribution we choose is obtained from the best stochastic (bs) rule. The adaptive part is called the join-biased-queue (jbq) rule. The resultant jbq-bs rule is analyzed on small networks and is shown to provide 10-27 percent delay improvement over the bs rule.", } @ARTICLE{Zaho81:Solution, AUTHOR="J. L. Zahorjan and Eric Wong", TITLE="The solution of separable queueing network models using mean value analysis", JOURNAL=per, VOLUME=10, PAGES="80-85", YEAR=1981, REFERENCES=17, KEYWORDS="Queueing network; open queueing network; mva", ANNOTE="Because it is more intuitively understandable than the previously existing convolution algorithms, mean value analysis (mva) has gained great popularity as an exact solution technique for se parable queueing networks. However, the derivations of mva presented to date apply only to closed queueing network models. Additionally, the problem of the storage requirement of mva has not been dealt with statisfactorilly. In this paper we address both t", } @ARTICLE{Feng81:Fault, AUTHOR="T. Feng and Ch. Wu", TITLE="Fault-Diagnosis for a Class of Multistage Interconnection Networks", JOURNAL=ieeetc, VOLUME="C-30", NUMBER=10, PAGES="743-758", YEAR=1981, KEYWORDS="Multistage interconnection network; parallel computing", ANNOTE="To study the fault-diagnosis method for a class of multistage interconnection networks a general failt model is first construct ed. Specific steps for diagnosing single faults and detecting multiple faults in interconnection networks such as the indirectbinary n-cube network and the flip network are then developed. The following results are derived in this study: 1) independent of the network size, only four tests are required for detecting.", } @ARTICLE{Lev81:Fast, AUTHOR="G. Lev and N. Pippenger and L. Valiant", TITLE="A Fast Parallel Algorithm for Routing in Permutation Networks", JOURNAL=ieeetc, VOLUME="C-30", NUMBER=2, PAGES="93-100", YEAR=1981, KEYWORDS="Interconnection network; parallel computing; routing", ANNOTE="An algorithm is given for routing in permutation networks, that is, for computing the switch settings that implement a given permutation. The algorithm takes serial time or parallel time. The time bounds may be reduced by a further logarithmic factor when all of the switch sizes are integral powers of two.", } @ARTICLE{Nass81:Self, AUTHOR="D. Nassimi and Sartaj Sahni", TITLE="A Self-Routing Benes Network and Parallel Permutation Algorithms", JOURNAL=ieeetc, VOLUME="C-30", NUMBER=4, PAGES="332-340", YEAR=1981, KEYWORDS="Interconnection network; permutation network; complexity", ANNOTE="A Benes permutationnetwork capable of setting its own switches dynamically is presented. The total switch setting and delay ti me for the $N$ input/output self-routing networks is $0(\log N)$. It is shown that the network is capable of performing a rich class of permutations. The self-routing scheme leads to efficient parallel algorithms to perform the same class of permutations on cu be connected and perfect shuffle computers.", } @ARTICLE{Than81:Interference, AUTHOR="S. Thanawastien and V. Nelson", TITLE="Interference Analysis of Shuffle/Exchange Networks", JOURNAL=ieeetc, VOLUME="C-30", NUMBER=8, PAGES="545-556", YEAR=1981, KEYWORDS="Blocking; interconnection network; performance evaluation", ANNOTE="The use of shuffle/exchange interconnection networks in multiprocessor systems has been proposed for several applications. In order to evaluate the potential performance and reliability of such systems, the effects of conflicts involving switch and memory contention should be determined. This paper presents a discrete Markov chain model to study the effects of such contention for S/E networks used in random access application environments.", } @ARTICLE{Witt81:Communication, AUTHOR="L. D. Wittie", TITLE="Communication Structures for Large Networks of Microcomputers", JOURNAL=ieeetc, VOLUME="C-30", NUMBER=4, PAGES="264-273", YEAR=1981, KEYWORDS="Multiprocessor system; interconnection network; computer", ANNOTE={This paper compares nine network interconnection schemes and introduces " dual-bus hyperkubes", a cost-effective method of connecting thousands of dual-port single-chip microcomputers into a room-sized information processing system, a "network computer". Each network node is a chip containing memory and a pair of processor for tasks and input/output. Nodes are linked by shared communication buses, each conceptually spanning a dimensional.}, } @ARTICLE{Wu81:Universality, AUTHOR="Cheng-Shong Wu and T. Feng", TITLE="The Universality of the Shuffle-Exchange Network", JOURNAL=ieeetc, VOLUME="C-30", NUMBER=5, PAGES="324-332", YEAR=1981, KEYWORDS="Interconnection network; omega network; parallel computing", ANNOTE="This paper has focused on the realization of every arbitrary permutation with the shuffle-exchange network. Permutation properties os shuffle-exchange networks are studied and are used to demonstrate several universal networks. It is concluded that $3(\log N)-1$ passes trough a single-stage regular shuffle exchange network are sufficient to realize every arbitrary permutation where $N$ is networks size.", } @ARTICLE{Wu81:Cluster, AUTHOR="S. Felix Wu and Mingyan Liu", TITLE="A Cluster Structure as an Interconnection Network for Large Multimicrocomputer Systems", JOURNAL=ieeetc, VOLUME="C-30", NUMBER=4, PAGES="254-264", YEAR=1981, KEYWORDS="Multiprocessor system; interconnection network; delay", ANNOTE="This paper presents a cluster structure, characterized by a set of structure parameters and a set of interconnection functions, as a conceptual interconnection scheme for large multimicrocomputer systems. It is shown that theree popular interconnection struktures are examples of the cluster structure. Two communication problems, which may result in interconnection limitation to a particular structure, are analyzed.", } @ARTICLE{Delb81:Unified, AUTHOR="L. E. N. Delbrouck", TITLE="A unified approximate evaluation of congestion functions for smooth and peaky traffics", JOURNAL=ieeecom, VOLUME=29, NUMBER=2, PAGES="85-91", YEAR=1981, REFERENCES=13, KEYWORDS="Loss System; GI/M/S; peak load; approximation", } @ARTICLE{Ackl81:Edge, AUTHOR="B. D. Ackland and N. H. Weste", TITLE="The edge flag algorithm --- a fill method for raster scan displays", JOURNAL=ieeetc, VOLUME="C-30", PAGES="41-47", YEAR=1981, REFERENCES=8, KEYWORDS="Method; display; realization; two-dimensional plot; three-dimensional plot; graphics; frame store; polygon fill; raster scan; computer animation", ANNOTE="Contour (polygon) filling is a primitive required in many application areas of raster scan graphics. The bit-map memory in a frame-store display is computationally well suited to this task, as it provides a large scratch pad working space. In this paper, a number of contour filling algorithms based on the read/write properties of the frame-store memory are compared with the classical ``ordered-edge-list'' approach.", } @MISC{Adam81:Special, AUTHOR="N. R. Adam and R. E. Nance and others", TITLE="Special issue on simulation modeling and statistical computing", PUBLISHER="cacm", VOLUME=24, PAGES="171-286", YEAR=1981, REFERENCES=270, KEYWORDS="Special issue; simulation model; output analysis; simulation", } @ARTICLE{Ahre81:Computer, AUTHOR="J. Ahrens and K. D. Kohrt", TITLE="Computer methods for efficient sampling from largely arbitrary statistical distributions", JOURNAL=comp, VOLUME=26, PAGES="19-31", YEAR=1981, KEYWORDS="Transform; table-look-up method; random number generation", ANNOTE="The inverse function transform method is a well-known method for generating random variables on a computer, but it does require the inverse of the distribution function to be known. This paper describes a numerical procedure for calculating the inverse assuming only a knowledge of the density function. Applications to discrete distributions are described, but the emphasis is on continuous distributions", } @ARTICLE{Akim81:Asymptotic, AUTHOR="H. Akimaru and H. Takahashi", TITLE="Asymptotic expansion for {Erlang} loss function and its derivative", JOURNAL=ieeecom, VOLUME="COM-29", PAGES="1257-1260", YEAR=1981, REFERENCES=4, KEYWORDS="Loss system; approximation; method; loss calculation; Erlang B formula", ANNOTE="This paper reveals the general structure of the asymptotic expansion for the Erlang loss function and its derivative. A recursive formula for the coefficients in the expansion is given and some of numerical examples are presented.", } @TECHREPORT{Akyi81:Analytic, AUTHOR="Ian Akyildiz and G. Bolch", TITLE="Analytic solution techniques for queueing network models of computer systems", INSTITUTION="Institut für Mathematische Maschinen und Datenverarbeitung (Informatik), F. Alexander Universität", ADDRESS="Erlangen-Nürnberg, Germany", VOLUME=14, NUMBER=4, PAGES="1-226", YEAR=1981, REFERENCES=90, KEYWORDS="Queueing network; survey; numerical method; approximation; method; product form; network; operational analysis; MVA", ANNOTE="The main objective of this work is to show in detail the development of queueing network theory and the different solution techniques to analyze queueing network models of computer systems.", } @ARTICLE{Alle81:PEN, AUTHOR="T. Allen and R. Nix and A. Perlis", TITLE="{PEN:} a hierarchical document editor", JOURNAL=sigplan, VOLUME=16, NUMBER=6, PAGES="74-81", YEAR=1981, REFERENCES=14, KEYWORDS="Data structure; text processing; interactive mode; graphics", ANNOTE="Three terms in common usage in computerized text processing are text-editing, word-processing, and computer controlled typesetting. This paper deals with a fourth term, manuscript preparation, that has important intersections with the above three. A computerized manuscript preparation system is one that supports an author in the preparation of a manuscript. In what follows we deal with one such, the PEN system, directed towards the preparation", } @ARTICLE{Altm81:Nebenstellenanlagen, AUTHOR="W. Altmeier", TITLE="Nebenstellenanlagen mit Durchwahl", JOURNAL="Unterrichtsblätter der Deutschen Bundespost", VOLUME=34, PAGES="368-374", YEAR=1981, LANGUAGE="German", KEYWORDS="Telephony; PABX", } @ARTICLE{Ash81:Optimization, AUTHOR="G. R. Ash and R. H. Cardwell and R. P. Murray", TITLE="Design and optimization of networks with dynamic routing", JOURNAL=bstj, VOLUME=60, NUMBER=8, PAGES="1787-1820", YEAR=1981, REFERENCES=6, KEYWORDS="Network flow; dynamic routing; circuit switching; communication network", ANNOTE="Network models are described that illustrate the savings inherent in designing networks for dynamic, nonhierarchical routing. An algorithm for engineering such networks is discussed, and the comparative advantages of various path-routing and progressive-routing techniques are illustrated. A particularly simple implementation of dynamic routing called two-link dynamic routing with crankback is discussed and is show to yield benefits comparable", } @ARTICLE{Ash81:Servicing, AUTHOR="G. R. Ash and A. H. Kafker and Kris Krishnan", TITLE="Servicing and real-time control of networks with dynamic routing", JOURNAL=bstj, VOLUME=60, NUMBER=8, PAGES="1821-1845", YEAR=1981, REFERENCES=14, KEYWORDS="Circuit switching; network flow; dynamic routing", ANNOTE="Load uncertainties arising from errors in the forecast and from daily variations in network load give rise to reserve or idle network capacity not immediately needed by current network demands. The reserve capacity can be reduced by the use of more flexible dynamic routing methods, which allow routing flexibility to help control network flow under load uncertainties.", } @ARTICLE{Auge81:Algorithmus, AUTHOR="G. Augele", TITLE="Algorithmus und Implementierung eines dezentralen, fairen und fehllertoleranten Bus-Arbiters", JOURNAL="Elektronik", VOLUME=9, PAGES="79-84", YEAR=1981, KEYWORDS="Bus; arbiter; multiprocessor system", ANNOTE="Langsam, nur für Blocktransfers geeignet", } @ARTICLE{Aziz81:Me, AUTHOR="S. A. Azizi", TITLE="Meßtechnische Anwendung der {FFT}", JOURNAL=ntz, VOLUME=34, PAGES="152-158", YEAR=1981, LANGUAGE="German", KEYWORDS="FFT; fast Fourier transform", } @ARTICLE{Bakr81:Teletraffic, AUTHOR="S. H. Bakry", TITLE="Teletraffic analysis for single-Cell mobile radio telephone systems", JOURNAL=ieeecom, VOLUME="COM-29", PAGES="298-304", YEAR=1981, KEYWORDS="Queueing system; MAT; mobile radio; cellular system; loss system; telephone channel; Erlang B formula; Engset formula", ANNOTE="Formulas are derived for the congestion in single-cell mobile radio systems in which there are both land-to-mobile and mobile-to-mobile calls and in which mobile-to-mobile calls go via the base station. Two approaches are used. The first yields modified forms of the familiar Erlang and Engset formulas. The second gives more complicated but more accurate formulas. The results of computer simulations to establish the accuracy of the formulas are", } @ARTICLE{Ball81:Strip, AUTHOR="D. H. Ballard", TITLE="Strip trees: a hierarchical representation for curves", JOURNAL=cacm, VOLUME=24, PAGES="310-321", YEAR=1981, REFERENCES=16, KEYWORDS="Method; graphics; two-dimensional plot; information system; data structure", ANNOTE="The use of curves to represent two-dimensional structures is an important part of many scientific investigations. Because of the very large amount of data involved and the need to perform operations on this data efficiently, the representation of such curves is a crucial issue. A hierarchical representation consisting of binary trees with a special datum at each node is described. This datum is called a strip and the tree that contains such", } @ARTICLE{Behr81:Subscriber, AUTHOR="J. P. Behr and Ulrich Killat and J. Krüger and M. Maisel and D. Riekmann", TITLE="Subscriber station for a digital integrated network with decentralized exchange", JOURNAL=aeu, VOLUME=35, PAGES="105-110", YEAR=1981, REFERENCES=12, KEYWORDS="Switching; loop system; digital network; PCM; concentrator; Laguerre transform; decentralized control", ANNOTE="Function and basic configuration of a subscriber station in a network with decentralized exchange are described. Emphasis is given to the actual realization of a concentrator-type station which interfaces numerous users to the subscriber loop.", } @TECHREPORT{Beil81:Algorithms, AUTHOR="H. Beilner", TITLE="Algorithms for evaluating separable, mixed, state-independent queueing networks or improving (slightly) on mean value analysis", INSTITUTION="Universität Dortmund", ADDRESS="Dortmund", PAGES="O1-L1", YEAR=1981, REFERENCES=13, KEYWORDS="queueing network; simulation model; method; MVA", ANNOTE="Several algorithms for evaluating expected population numbers and normalization constants of separable, state-independent queueing networks with mixed (i.e., open and closed) load chains including class-switching are introduced. One of the algorithms is pu rsued in detail; formulae for deriving performance characteristics such as response/cycle times, utilisations, throughputs from the algorithm's results are provided. The new algorithm is in th", } @TECHREPORT{Beil81:Note, AUTHOR="H. Beilner and D. Grillo", TITLE="A note on {COPE:} A software tool for modelling and evaluating the performance of computing systems", INSTITUTION="Universität Dortmund", ADDRESS="Dortmund", PAGES="1-42", YEAR=1981, REFERENCES=4, KEYWORDS="Performance evaluation; analytical model; simulation model; queueing network; realization; COPE", } @TECHREPORT{Beil81:Zuverlässigkeitsanalyse, AUTHOR="H. Beilner and B. Müller", TITLE="Zuverlässigkeitsanalyse mit Instrumenten zur Leistungsanalyse", INSTITUTION="Universität Dortmund", ADDRESS="Dortmund", PAGES="1-12", YEAR=1981, REFERENCES=20, KEYWORDS="Performance evaluation; simulation model; queueing network; realization; cope", ANNOTE="This report tries to assess the applicability of one such tool, the modelling package, cope, for reliability problems. Cope provides the possibility of easy specification of the problem under study whereupon an automatic analysis (via simulative or analytical modelling) is undertaken. The use of the tool is exemplified by a reliability study of the well-known fault-tolerant multiprocessor system, prime.", } @INPROCEEDINGS{Bela81:Measurements, AUTHOR="P. Belanger and C. Hankins and Nikhil Jain", TITLE="Performance Measurements of a Local Microcomputer Network", BOOKTITLE="Local Networks for Computer Communications", ORGANIZATION="IFIP", YEAR=1981, REFERENCES=3, KEYWORDS="LAN; datagram; reliable datagram; comparison; performance metrics; workload", ANNOTE="reliable datagram is superior", } @ARTICLE{Bemm81:Formulierung, AUTHOR="H.-B. Bemmann", TITLE="Formulierung von Abbruchbedingungen bei der Simulation von Zuverlässigkeitsproblemen", JOURNAL=nte, VOLUME=31, PAGES="169-172", YEAR=1981, LANGUAGE="German", KEYWORDS="Reliability; simulation; method; moment; confidence interval; simulation model", ANNOTE="Für die Berechnung der Zuverlässigkeit komplizierter technischer Strukturen kann die Simulation insbesondere dann vorteilhaft angewendet werden, wenn eine exakte mathematische Beschreibung des Problems schwierig oder überhaupt nicht möglich ist. Neben der Frage der erreichten Genauigkeit der Simulationsergebnisse interessieren Kriterien für den Abbruch der simulation. Die Möglichkeiten zur Formulierung einiger Kriterien sollen hier näher", } @ARTICLE{Bene81:Blocking, AUTHOR="V. E. Benes", TITLE="Blocking states in connecting networks made of square switches arranged in stages", JOURNAL=bstj, VOLUME=60, NUMBER=4, PAGES="511-521", YEAR=1981, REFERENCES=6, KEYWORDS="Circuit switching; routing algorithm; blocking", ABSTRACT="Since the probability of blocking is a prinicpal measure of the performance of a network, this paper examines the blocking states of a network. For two-sided connecting networks made of square switches arranged in stages, a parallel pair (pp) is a pair of paths through the network that meet at no switch. The blocking states of the network are closely related to those that have a busy parallel pair. In particular, a routing algorithm can avoid all the blocking", } @ARTICLE{Bent81:FPLA, AUTHOR="A. Bentley", TITLE="{FPLA} arbiter concept adapts to application needs", JOURNAL=comp_design, PAGES="149-155", YEAR=1981, KEYWORDS="Bus arbitration; multiprocessor system", } @ARTICLE{Bhar81:New, AUTHOR="Kadaba Bharath-Kumar and Joseph Jaffe", TITLE="A new approach to performance-oriented flow-control", JOURNAL=ieeecom, VOLUME="COM-29", PAGES="427-435", YEAR=1981, REFERENCES=11, KEYWORDS="Packet switching; network flow; flow control; Greedy algorithm", ANNOTE="Flow control is proposed as a means of obtaining an ``optimal tradeoff'' between low delay and high throughput in computer networks. Several versions of ``optimal tradeoff'' are defined based on network power. A class of algorithms which attempt to optimize network performance are investigated. These algorithms operate on the design principles of dynamic, distributed execution and use of local information. These design principles force the algorith", } @ARTICLE{Blac81:Two, AUTHOR="J. H. Blackstone and G. L. Hogg and D. T. Phillips", TITLE="A two-list synchronisation procedure for discrete event simulation", JOURNAL=cacm, VOLUME=24, PAGES="825-829", YEAR=1981, KEYWORDS="Simulation; time control; synchronization", } @INPROCEEDINGS{Boch81:Construction, AUTHOR="Gregor V. Bochmann and Philip M. Merlin", TITLE="On the construction of communication protocols", BOOKTITLE=iccc, YEAR=1981, REFERENCES=11, KEYWORDS="Protocol specification", } @ARTICLE{Bong81:Optimum, AUTHOR="Giancarlo Bongiovanni and D. Coppersmith and Chak Nam Wong", TITLE="An optimum time slot assignment algorithm for an {SS/TDMA} system with variable number of transponders", JOURNAL=ieeecom, VOLUME="COM-29", PAGES="721-726", YEAR=1981, REFERENCES=11, KEYWORDS="Satellite radio; time slot; traffic matrix; TDMA; time division multiple access", ANNOTE="In this paper we consider an SS/TDMA system with $M$ uplink beams, $N$ downlink beams, and $K$, $1