@INCOLLECTION{Dosh82:Comparison, AUTHOR="Bharat Doshi and E. H. Lipper", TITLE="Comparison of Service Disciplines in a Queueing System with Delay Dependent Customer Behavior", BOOKTITLE="Applied Probability --- Computer Science: The Interface", EDITOR="R. L. Disney and Teunis Ott", PUBLISHER="Birkhauser", ADDRESS="Cambridge, Massachusetts", VOLUME=2, YEAR=1982, } @BOOK{Efro82:Jackknife, AUTHOR="Bradley Efron", TITLE="The Jackknife, the Bootstrap and Other Resampling Plans", SERIES="CBMS-NSF Regional Conference Series in Applied Mathematics", PUBLISHER="Society for Industrial and Applied Mathematics (SIAM)", ADDRESS="Philadelphia, Pennsylvania", VOLUME=38, YEAR=1982, KEYWORDS="statistics", } @BOOK{Fran82:Queues, AUTHOR="Peter Franken and Dieter König and Ursula Arndt and Volker Schmidt", TITLE="Queues and Point Processes", PUBLISHER="John Wiley", ADDRESS="Chichester, New York", YEAR=1982, KEYWORDS="queueing theory", } @BOOK{Law82:Simulation, AUTHOR="Averill M. Law and W. David Kelton", TITLE="Simulation Modeling and Analysis", ISBN="0-07-036696-9", PUBLISHER="McGraw-Hill", ADDRESS="New York, New York", YEAR=1982, KEYWORDS="simulation; performance evaluation", } @BOOK{Parz82:Mathematical, AUTHOR="William R. Parzynski and Philip W. Zipse", TITLE="Introduction to Mathematical Analysis", PUBLISHER="McGraw-Hill", ADDRESS="New York, New York", YEAR=1982, KEYWORDS="real analysis", } @BOOK{Sriv82:Special, AUTHOR="H. M. Srivastava and B. R. K. Kashyap", TITLE="Special Functions in Queueing Theory", PUBLISHER="Academic Press", ADDRESS="New York, New York", YEAR=1982, KEYWORDS="queueing theory", } @ARTICLE{Corn8205:1A, AUTHOR="R. G. Cornell and Jonathan M. Smith", TITLE="{1A} Voice Storage System: Architecture and Physical Design", JOURNAL=bstj, VOLUME=61, NUMBER=5, PAGES="841-859", MONTH="May--June", YEAR=1982, KEYWORDS="telephone switching", ABSTRACT="To provide new basic capabilities associated with the Custom Calling Services II (CCS II) feature package, a new system has been developed. This system, the 1A Voice Storage System (1A VSS), is a generalized resource with the ability to receive, store, administer, compose, and deliver voice messages or announcements. The capacity of this system is such that it can provide CCS II services on hundreds of simultaneous calls and serve tens of thousands of concurrent subscribers. In this article, the circuit architecture and physical design of the 1A VSS is described.", } @ARTICLE{Nuss8205:1A, AUTHOR="E. Nussbaum", TITLE="{1A} Voice Storage System: voice storage in the network -- perspective and history", JOURNAL=bstj, VOLUME=61, NUMBER=5, PAGES="811-813", MONTH="May--June", YEAR=1982, KEYWORDS="voice processing; voice storage", } @ARTICLE{Worr8205:1A, AUTHOR="D. P. Worrall", TITLE="{1A} Voice Storage System: New Custom Calling Services", JOURNAL=bstj, VOLUME=61, NUMBER=5, PAGES="821-837", MONTH="May--June", YEAR=1982, KEYWORDS="voice processing; voice storage; call waiting; call forwarding; call answering; custom announcement; three-way calling; speed calling; advance calling", ABSTRACT="In creating new customer services, systems engineers traditionally conduct market needs analysis, engineering feasibility studies, and project economic analysis. Finally, they prepare development requirements. In addition, systems engineering designs the service from the customer's point of view. This article describes new custom calling services as the customer sees them and highlights some interesting features of the services.", } @ARTICLE{Gate8205:1A, AUTHOR="G. W. Gates and R. F. Kranzmann and L. D. Whitehead", TITLE="{1A} Voice Storage System: Software", JOURNAL=bstj, VOLUME=61, NUMBER=5, PAGES="863-883", MONTH="May--June", YEAR=1982, KEYWORDS="voice processing; voice storage", ABSTRACT="The new Custom Calling Services II (CCS II) have been provided by adding a 1A voice storage system (1A VSS) as a new node in the stored program control network. Software and a new trunk circuit are required in the No. 1/1A ESS to provide call control, call filtering, and routing to a 1A VSS. The 1A VSS accepts the call and provides the package of voice services known as CCS II. The software required to provide these services is described.", } @BOOK{Morr82:Computer, AUTHOR="Michael F. Morris", TITLE="Computer performance evaluation: tools and techniques for effective analysis", PUBLISHER="Van Nostrand Reinhold", YEAR=1982, } @ARTICLE{Wolf8203:Poisson, AUTHOR="Ronald W. Wolff", TITLE="Poisson arrivals see time averages", JOURNAL=or, VOLUME=30, NUMBER=2, PAGES="223-231", MONTH="March--April", YEAR=1982, KEYWORDS="Poisson process; PASTA; stochastic processes; queueing theory", ABSTRACT="In many stochastic models, particularly in queueing theory, Poisson arrivals both observe (see) a stochastic process and interact with it. In particular cases and/or under restrictive assumptions it has been shown that the fraction of arrivals that see the process in some state is equal to the fraction of time the process is in that state. In this paper, we present a proof of this result under one basic assumption: the process being observed cannot anticipate the future jumps of the Poisson process.", } @INPROCEEDINGS{Limb8211:Distributed, AUTHOR="John Limb and Lois E. Flamm", TITLE="A distributed local area network packet protocol for combined voice and data transmission", BOOKTITLE=globecom, ORGANIZATION="IEEE", ADDRESS="Miami, Florida", PAGES="303-308 (B2.5)", MONTH="November/December", YEAR=1982, KEYWORDS="packet voice; local area networks; integrated services", ABSTRACT="Local area networks designed to carry a variety of traffic such as data, voice, facsimile, and video should be able to implement low latency virtual circuits to meet the demands of periodic traffic. We have designed a partially distributed algorithm to efficiently schedule voice traffic on a unidirectional bus system called Fasnet. Virtual channels are allocated for the duration of a talk spurt and relinquished during the intervening silence intervals. Conversations already in progress, but without an assigned circuit, take precedence over newly arriving calls. Simulations of the system indicate that performance is close to that obtained by an ideal TASI multiplexer. While the algorithm is unfair, this is not a significant factor unless the network is loaded very heavily.", ANNOTE="see \cite{Limb83:Distributed}", } @INPROCEEDINGS{Toba8203:CSMA, AUTHOR="Fouad Tobagi and Noel Gonzalez-Cawley", TITLE="On {CSMA-CD} local networks and voice communication", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="Las Vegas, Nevada", PAGES="122-127", MONTH="March/April", YEAR=1982, KEYWORDS="Ethernet; CSMA/CD; packet voice; local area networks; integrated services", ABSTRACT="We consider in this paper local networks of the CSMA-CD broadcast bus type, exemplified by Ethernet, and investigate their performance when supporting voice communication. For such real-time application, we define network performance as the maximum number of voice source accomodated for a given maximum delay requirement and a tolerable packet loss rate. We study the effect on this performance of various system parameters such as channel bandwidth, vocoder rate, delay requirement and packet loss rate.", } @INCOLLECTION{Prin82:Algorithm, AUTHOR="Rainer Prinoth", TITLE="An algorithm to construct distributed systems from state machines", BOOKTITLE="Protocol specification, testing, and verification", EDITOR="C. A. Sunshine", PUBLISHER="North-Holland", PAGES="261-282", YEAR=1982, KEYWORDS="protocol verification; finite state machines; network protocols; distributed systems", ABSTRACT="In this paper a system is specified by a finite set of atomic actions (input alphabet) and a set of concatenations of these atomic actions (words of a language). Each element of the latter set defines a process. If we assume that the set of atomic actions is distributed in space then we have to solve the problem of constructing a distributed system which will generate the same language as in the non-distributed case.", } @INCOLLECTION{Rice82:Communication, AUTHOR="Ronald E. Rice", TITLE="Communication Networking in Computer Conferencing Systems: A Longitudinal Study of Group Roles and System Structure.", BOOKTITLE="Communication Yearbook~6", EDITOR="Michael Burgoon", PUBLISHER="Sage Publications", ADDRESS="Beverly Hills", PAGES="925-944", YEAR=1982, KEYWORDS="CSWC; electronic mail; computer conferencing; group roles", } @ARTICLE{Koch82:Communities, AUTHOR="Manfred Kochen", TITLE="On-line communities for conflict management", JOURNAL="Human Systems Management", ADDRESS="Mental Health Research Institute, University of Michigan, Ann Arbor, MI, 48109, USA", VOLUME=3, PAGES="129-135", YEAR=1982, KEYWORDS="conflict management; on-line communities", ABSTRACT="Conflict appears to be concomitant with all forms of life. It can enhance survival and quality of life if it is not excessive and remains under control. A model of conflict and its management is used to derive conditions favoring, inhibiting, controlling or regulating conflict. The idea is to divert energy from engaging in conflict and its dissipation toward constructive goal revision and the formation of a new community of interest around the revised goal. Computer conferencing is proposed as a catalyst in this communication process. The possibility of maintaining an action-oriented community of inquiry that would sustain debate toward new goals at or above an acceptable level and keep conflict-related energy dissipation below acceptable limits is an empirically testable hypothesis on which further research is suggested.", } @INBOOK{Vall82:Revolution, AUTHOR="Jacques Vallee", TITLE="The Network Revolution : Confessions of a computer scientist", ISBN="0-915904-76-4", PUBLISHER="{AND/OR} Press, Inc", ADDRESS="Berkeley, California", PAGES="193-200", YEAR=1982, KEYWORDS="computer conferencing", ABSTRACT="This chapter describes the use of computer conferencing in the earth sciences, especially with regard to cost effectiveness compared to other tele-conferencing and video-conferencing methods. While the rhetoric is a little heady, the message is clear.", } @ARTICLE{Turo82:Delphi, AUTHOR="Murray Turoff", TITLE="Delphi conferencing: Computer-based conferencing with anonymity", JOURNAL="Technological Forecasting and Social Change", VOLUME=2, YEAR=1982, KEYWORDS="computer conferencing", } @BOOK{Kerr82:Computer, AUTHOR="Elaine B. Kerr and Starr Roxanne Hiltz", TITLE="Computer-Mediated Communication Systems: Status and Evaluation", PUBLISHER="Academic Press", ADDRESS="New York", PAGES=212, YEAR=1982, KEYWORDS="computer conferencing", ABSTRACT="Quite detailed review of methodology and impacts of conferencing using EIES (Electronic Information Exchange System) as the primary example. Both authors are sociologists and have been involved in several conferencing evaluations from the early days. Various conferencing features (e.g., voting, menu vs command) are reviewed and earlier studies regarding impacts are summarized. Factors which make ``acceptance'' of conferencing better are identified (as well as some minor effect factors like typing skill). Specific effects on individuals, groups, and organizations are listed. The effects were developed by literature review, expert panels, and experimental results. Overall effects were heavily positive.", } @PHDTHESIS{Rice82:Human, AUTHOR="Ronald E. Rice", TITLE="Human Communication Networking in a Teleconferencing Environment", SCHOOL="Stanford University", PAGES=360, YEAR=1982, KEYWORDS="computer conferencing", ABSTRACT="The objectives of this dissertation are (1) to study the communication networks of groups operating in a computer-conferencing environment, (2) to portray how these patterns change over time, (3) to describe the nature of group- and system-level structure, and (4) to discuss what implications these changes have for telecommunications design and policy. The chapters review and analyze topics such as telecommunications impacts, varieties of computer-mediated communication systems, the development of communication theory to consider longitudinal networks, and the range of analytical procedures appropriate for such research. The primary procedures used to detect and describe the communication patterns of interest, over time, include longitudinal plots of useful communication ratios, log-linear models of group structure, and transition matrices showing patterns of development in system structure. Additional procedures include clustering and multidimensional scaling. Overall, system stability in a large-scale telecommunications system comes to depend upon reciprocal information exchanges. Communication activity in such a system provides indices which could be used to detect groups' potential patterns of development. System structure changes over time as groups occupy different roles which are based on the flows of information within the system. For example, initial usage levels are not good indicators of eventual usage levels; and ``electronic migration'' from group to group seems common. Whether the nature of the user group is task-or non-task-oriented appears to influence how the groups occupy these roles. Finally, computer-monitored longitudinal data and the network analysis program used seem to offer advantages and insights unavailable from traditional data and methods.", } @ARTICLE{Shed82:Simulation, AUTHOR="G. S. Shedler and J. Southard", TITLE="Simulation for passage times in closed, multiclass networks of queues with unrestricted priorities", JOURNAL=pe, VOLUME=2, PAGES="257-267", YEAR=1982, REFERENCES=11, ABSTRACT={Regenerative simulation for passage times in networks of queues with priorities among job classes (and one or more job types) can be based on observation of a fully augmented job stack process which maintains the position of each of the jobs in a linear "job stack", an enumeration of the jobs by service center and job class. In this paper we develop an estimation procedure for passage times through a subnetwork of queues. Observed passage times}, } @ARTICLE{Sher82:Using, AUTHOR="Matthew Sherman and Harry Rudin", TITLE="Using automated validation techniques to detect lockups in packet-switched networks", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="1762-1767", YEAR=1982, REFERENCES=18, KEYWORDS="Packet switching; communication protocol; lockup", ABSTRACT={The existence of a program for automatically examining the syntax of a protocol for the absence of various undesired properties, such as deadlock, raises the question whether the classical "lockups" described in the early packet-switched data network literature could be detected by such a program. This concise paper answers this question in the affirmative.}, } @ARTICLE{Sher82:Distributed, AUTHOR="R. H. Sherman and M. G. Gable and A. W. Chung", TITLE="Distributed virtual hosts and networks: measurement and control", JOURNAL=per, VOLUME=11, PAGES="130-136", YEAR=1982, REFERENCES=10, KEYWORDS="Network layer; lan; measurement; logical network structure", ABSTRACT="Diverse network application requirements bring about local networks of various size, degree of complexity and architecture. The purpose of this paper is to present a network protocol layer which is used to provide a homogeneous operating environment and to ensure the availability of network resources. The network layer process probes the underlying local network to discover its properties and then adapts to changing network conditions. The pr", } @INBOOK{Smit82:Optimal, AUTHOR="Donald Smith", TITLE="Optimal Flow Algorithms", BOOKTITLE="Network Optimization Practice", CHAPTER=4, PUBLISHER="Ellis Harwood Ltd.", PAGES="94-111", YEAR=1982, KEYWORDS="Max flow", } @ARTICLE{Span82:Konzepte, AUTHOR="O. Spaniol", TITLE="Konzepte und Bewertungsmethoden für lokale Rechnernetze", JOURNAL=infspec, VOLUME=5, PAGES="152-170", YEAR=1982, LANGUAGE="German", REFERENCES=52, KEYWORDS="Distributed system; LAN; topology; access protocol; IEEE", } @INPROCEEDINGS{Spie82:Testing, AUTHOR="B. R. Spiegelhalter and C. G. Miller", TITLE="Testing Packet Switched Networks", BOOKTITLE=iccc, PUBLISHER="North Holland", ADDRESS="London, England", PAGES="999-1004", YEAR=1982, REFERENCES=3, KEYWORDS="Packet switching; test tool; performance evaluation", } @ARTICLE{Spir82:Modeling, AUTHOR="J. R. Spirn", TITLE="Network modeling with bursty traffic and finite buffer space", JOURNAL=per, VOLUME=11, PAGES="21-27", YEAR=1982, REFERENCES=4, KEYWORDS="Analytical; model; loss system; buffer length; MB/M/1/*/W", ABSTRACT="Although there have been very significant advances recently in the state of the art of solvable queueing networks, there are still many phenomena of interest to computer network designers which are not well handled by such methods. Much computer network traffic is bursty, and therefore poorly approximated by a poisson process, but only poisson arrivaly are admissible for solvable queueing networks. In this respect, conventional queueing network", } @ARTICLE{Suns82:Specification, AUTHOR="C. A. Sunshine and Dean Thompson and others", TITLE="Specification and verification of communication protocols in affirm using state transition models", JOURNAL=ieeese, VOLUME="SE-8", PAGES="460-489", YEAR=1982, REFERENCES=50, KEYWORDS="Protocol specification; protocol verification; STATE", ABSTRACT="This paper describes a technique for communication protocol verification which combines a finite-state transition model with an axiomatization of the model and computerassisted proof verification. The paper is well written, and describes the various techniques used in this approach to verify that protocols function correctly", } @ARTICLE{Terp82:Reporting, AUTHOR="K. Terplan", TITLE="Network performance reporting", JOURNAL=per, VOLUME=11, PAGES="156-170", YEAR=1982, REFERENCES=10, KEYWORDS="Monitoring; survey; method; performance evaluation; network", ABSTRACT="Managing networks using network administration centers is increasingly considered. After introducing the information demand for operational, tactical and strategic network management the paper is dealing with the investigation of the applicability of tools and techniques for these areas. Network monitors and software problem determination tools are investigated in greater detail. Also implementation details for a multihost-multinode network inc", } @ARTICLE{Toba82:Distributions, AUTHOR="Fouad Tobagi", TITLE="Distributions of packet delay and interdeparture time in slotted {ALOHA} and carrier sense multiple access", JOURNAL=jacm, VOLUME=29, PAGES="907-927", YEAR=1982, REFERENCES=11, KEYWORDS="Distribution; time in system; interdeparture time", ABSTRACT="Packet communication systems of the multiaccess/ broadcast type, ion which all communicating devices share a common channel that is multiaccessed in some random fashion, are considered. Among the various multiaccess schemes known, two prominent ones are considered: slotted aloha and carrier sense multiple access (csma) unfortunately, average performance is not adequate when designing communication systems intended for real-time a", } @ARTICLE{Toba82:CSMA, AUTHOR="Fouad Tobagi", TITLE="{CSMA} with message-based priority functions", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="185-200", YEAR=1982, KEYWORDS="CSMA; carrier sense multiple access; priority", ANNOTE="Reference", } @ARTICLE{Toda82:Parallel, AUTHOR="A. Toda and M. Imai and others", TITLE="A parallel processing simulator for a network system using multimicroprocessors", JOURNAL="Microprocessors and Microsystems", VOLUME=6, PAGES="15-20", YEAR=1982, REFERENCES=2, KEYWORDS="Application; discrete event simulation; Distributed", ABSTRACT="A parallel processing simulator, newts, has been developed for network systems. This simulator consists of a number of microprocessors, which are interconnected with one another by hierarchical common buses and which execute simulation programs concurrently. This simulator is far cheaper than a general-purpose large computer and enables carrying out efficient and high speed network simulations. This simulator has been applied to a telephone net", } @ARTICLE{Tows82:Window, AUTHOR="Don Towsley and G. Venkatesh", TITLE="Window random access protocols for local computer networks", JOURNAL=ieeetc, VOLUME="C-31", PAGES="715-722", YEAR=1982, REFERENCES=11, KEYWORDS="LAN; CSMA; carrier sense multiple access; Ethernet; multiple access", ABSTRACT="In this paper we consider a local computer network in which users communicate with each other over a single bus. We develop window search algorithms with which to implement random access protocols on the bus. Two protocols, one nonadaptive and the other adaptive are described. The maximum throughputs and troughput-del ay tradeoffs are provided for both. These protocols show significant improvement over previous random access protocols used in l", } @INPROCEEDINGS{Tran82:Clocked, AUTHOR="Phuoc Tran-Gia and H. Jans", TITLE="Clocked event transfer protocol in distributed processing systems - a performance analysis", BOOKTITLE=iccc, ADDRESS="London, England", PAGES=6, YEAR=1982, REFERENCES=9, KEYWORDS="distributed system; processing system; performance", } @ARTICLE{Trip82:Characterizing, AUTHOR="Satish K. Tripathi and Ashok K. Agrawala", TITLE="On characterizing the inter-departure process of a server", JOURNAL=pe, VOLUME=2, PAGES="251-255", YEAR=1982, REFERENCES=9, KEYWORDS="G/M/1; interdeparture time; output process; time in system", ABSTRACT="A technique for computing the inter-departure time distribution for single server queues is presented. The method is applicable for both the steady state and the transient characterizations. Example of its use in several situations are presented. An explicit expression for the interdeparture time distribution of a steady state g/m/1 queues is obtained.", } @ARTICLE{Trip82:Two, AUTHOR="Satish K. Tripathi and A. Harbitter", TITLE="An analysis of two flow control techniques", JOURNAL=per, VOLUME=11, PAGES="241-249", YEAR=1982, KEYWORDS="Packet switching; computer network; flow control; ARPAnet", ABSTRACT="Queuing models can be useful tools in comparing the performance charakteristics of different flow control techniques. In this paper the window control mechanism, incorporated in protocols suchas X.25 is compared to the ARPAnet buffer reservation scheme. Multiclass queuing models are used to examine message throughput and delay characteristics. The analysis highlights the interaction of long and short message transmitters under the two flow con.", } @ARTICLE{Ueco82:Proposal, AUTHOR="G. Uecoluk and A. Hacinliyan and E. Karabudak", TITLE="A proposal for extensions to {REDUCE}", JOURNAL=sigsam, VOLUME=16, NUMBER=2, PAGES="4-14", YEAR=1982, KEYWORDS="REDUCE", ABSTRACT="Three classes of extensions are proposed for reduce: a facility for evaluating arbitrary functions of matrices; a facility for grouping, modifying or restoring the status of various flags in reduce; further extensions and modifications for separating terms, coefficients of expressions, concatenation, and noncommuting algebra. These proposals have been implemented on the univac 1100 reduce system", } @ARTICLE{Wang82:Delay, AUTHOR="Jianguo Wang", TITLE="Delay and throughput analysis for computer communications with balanced {HDLC} procedures", JOURNAL=ieeetc, VOLUME="C-31", PAGES="739-746", YEAR=1982, REFERENCES=12, KEYWORDS="Hdlc; time in system; modeling; prediction; queueing", ABSTRACT="A series of explicit expressions are presented in this paper which describe the delay and throughput performances in computer communications with balanced HDLC procedures (HDLC ABM or X.25 LAPB).", } @ARTICLE{Weng82:Codierung, AUTHOR="G. Wengenroth", TITLE="Die Codierung von Farbfernseh- und Bildfernsprechsignalen in einem digitalen optischen Teilnehmeranschluß", JOURNAL=ntzarchiv, VOLUME=4, PAGES="103-107", YEAR=1982, LANGUAGE="German", KEYWORDS="BISDN; video coding", } @BOOK{Wess82:Digitale, AUTHOR="G. Wessels", TITLE="Digitale Sprachübertragung in paketvermittelten Netzen", ISBN="3-597-10143-7", PUBLISHER="Minerva Publikation", ADDRESS="Bremen, Germany", PAGES=137, YEAR=1982, LANGUAGE="German", REFERENCES=69, KEYWORDS="Packet switching; data; traffic source model; packet voice", } @INPROCEEDINGS{Wilb82:Outline, AUTHOR="S. R. Wilbur and Zhengxiang Ma", TITLE="An Outline of Network Measurements in Project {UNIVERSE}", BOOKTITLE=iccc, PUBLISHER="North Holland", ADDRESS="London, England", YEAR=1982, REFERENCES=3, KEYWORDS="WAN; LAN; X.25; satellite; reliability; traffic pattern", } @PROCEEDINGS{Will82:Proceedings, TITLE="iccc", EDITOR="W. A. Williams", PUBLISHER="North Holland", ADDRESS="London, England", YEAR=1982, KEYWORDS="Computer communication", } @ARTICLE{Wong82:Queueing2, AUTHOR="Jackson Wong and Simon Lam", TITLE="Queueing Network Models of Packet Switching Networks Part 2: Networks with Population Size Constraints", JOURNAL=pe, VOLUME=2, PAGES="161-180", YEAR=1982, KEYWORDS="Queueing network; packet switching; flow control", ABSTRACT="An overview of the application of product-form queueing networksto the performance analysis of store-and-forward packet communication networks is presented. Queueing network models with closedchains and other forms of population size constrains are considered. The modeling and analysis of networks with window flow controlled virtual channels are describet first.", } @ARTICLE{Wong82:Study, AUTHOR="Jackson Wong and J. P. Sauve and J. A. Field", TITLE="A study of fairness in packet-switching networks", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="346-353", YEAR=1982, REFERENCES=18, KEYWORDS="Packet switching; FIFO; HOL priority; queueing network", ABSTRACT="The use of channel scheduling to improve a measure of fairness in packet-switching networks is investigated. This fairness measure is based on mean end-to-end delays derived from Kleinrock's classical model. The network designer can incorporate any desired relative delay among user classes into this fairness measure. The results are applicable to both fixed and random routing and are found to be relatively insensitive to fluctuations in traffic.", } @ARTICLE{Wust82:AKF, AUTHOR="G. Wustmann", TITLE="{AKF} of filtered p-level m-sequences", JOURNAL=ieeetc, VOLUME="C-31", PAGES="75-77", YEAR=1982, KEYWORDS="Shift register sequences; autocorrelation", } @ARTICLE{Yan82:Delay, AUTHOR="T.-Y. Yan", TITLE="On the delay analysis of a {TDMA} channel with finite buffer capacity", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="1937-1942", YEAR=1982, REFERENCES=9, KEYWORDS="Packet switching; M/G/1; imbedded Markov chain; buffer", ABSTRACT="The troughput performance of a tdma channel with finite buffer capacity for transmitting data messages is considered. Each station has limited message buffer capacity and has poisson message arrivals. Message arrivals will be blocked if the buffers are congested. Using the embedded Markov chain model, the solution procedure for the limiting system-size probabilities is presented in a recursive fashion. Numerical examples are given", } @ARTICLE{Zedl82:Quellencodierung, AUTHOR="G. Zedler", TITLE="Quellencodierung für digitale Fernsehübertragung", JOURNAL=ntz, VOLUME=35, NUMBER=4, PAGES="230-233", YEAR=1982, LANGUAGE="German", REFERENCES=3, KEYWORDS="Video coding; Bitrate reduction", } @ARTICLE{Hatt82:Integrated, AUTHOR="Shimmi Hattori and Kazutaka Murakami and T. Katsuyama", TITLE="Integrated Digital Switching System with Queueing Storage Facility", JOURNAL=ieeecom, VOLUME="COM-30", NUMBER=8, PAGES="1900-1905", YEAR=1982, REFERENCES=2, KEYWORDS="Voice/data integration; ISDN", ABSTRACT="This paper outlines the features of a new integrated switching system for voice and data. It is composed of integrated subscriber terminals, integrated subscriber lines, an integrated digitial switching system, and integrated storage facilities. This paper shows that the introduction of the integrated storage facility can create various new service utilities and improve the trafficcapacity of the system.", } @ARTICLE{Ross82:Hybrid, AUTHOR="Myron J. Ross and Osama A. Mowafi", TITLE="Performance Analysis of Hybrid Switching Concepts for Integrated Voice/Data Communications", JOURNAL=ieeecom, VOLUME="C0M-30", NUMBER=5, PAGES="1073-1087", YEAR=1982, REFERENCES=24, KEYWORDS="Voice/data integration; routing algorithm; flow control", ABSTRACT="This paper describes and evaluates variations of a generic hybrid switching concept for integrated voice and data communications. Concepts examined include the Slotted ENvelope NETwork approach, the enhanced hybrid (SENET with time assignment speech interpolation/time assignment data interpolation), the flexible hybrid, and the variable length frame/packet approach.", } @ARTICLE{Rump82:Computer, AUTHOR="S. M. Rump", TITLE="Computer und Rechengenauigkeit", JOURNAL=er, VOLUME=24, NUMBER=6, PAGES="268-277", YEAR=1982, LANGUAGE="German", REFERENCES=9, KEYWORDS="Accuracy; computer system; computer arithmetic", } @ARTICLE{Sowa82:Data, AUTHOR="M. Sowa and T. Murata", TITLE="A Data Flow Computer Architecture with Program and Token Memories", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=9, PAGES="820-824", YEAR=1982, REFERENCES=11, KEYWORDS="Data flow machine; multiprocessor system; architecture", ABSTRACT="This paper presents a new data flow computer architecture using two types of memory: program memory (PM) and token memory (TM). The PM stores a data flow program or graph indicating data dependencies among instructions. The TM stores mainly currently needed data values and plays a role similar to accumulators or registers in conventional computers.", } @MISC{Turn82:Fast, AUTHOR="Jonathan S. Turner", TITLE="Fast packet switching system", ADDRESS="Murray Hill, New Jersey", PAGES=48, NOTE="United States Patent 4494230 Applied 393112", YEAR=1982, REFERENCES=16, KEYWORDS="Fast packet switching; switching system; ATM", ABSTRACT="A communication method and packet switching system in which packets comprising logical addresses and voice/data information are communicated through the system by packet switching networks which are interconnected by high-speed digital trunks with each of the latter being directly terminated on both ends by trunk controllers. During initial call setup of a particular call, central processors associated with each network in the desired route", } @ARTICLE{Arde82:Regular, AUTHOR="B. Arden and Hoon Lee", TITLE="A Regular Network for Multicomputer Systems", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=1, PAGES="60-69", YEAR=1982, KEYWORDS="Parallel computing; interconnection network", ABSTRACT="As a result of recent technological developments there is an increasing interest in the interconnection of microcomputers throu gh networks. For general computation the interconnection graphs should have short internode communication paths and should be oflow degree, systematically structured, and incrementally extensible. A family of graphs, called multitree structured having the se properties is presented.", } @ARTICLE{Chu82:Optimal, AUTHOR="Wesley W. Chu and Paul Hurley", TITLE="Optimal Query Processing for Distributed Database Systems", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=9, PAGES="835-850", YEAR=1982, KEYWORDS="Database; relational database; model", ABSTRACT="A model is developed for determining the optimal policy for processing a given relational model query. The model is based on operating cost, which is a function of selection of sites for processing query operations, sequence of operations, file size, and data reduction functions. The optimal policy specifies the site selection and sequence of operations that yield minimum operating cust.", } @ARTICLE{Heid82:Queueing, AUTHOR="P. Heidelberger and Kishor Trivedi", TITLE="Queueing Network Models for Parallel Processing with Asynchronous Tasks", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=11, PAGES="1099-1109", YEAR=1982, KEYWORDS="Approximation; queueing network; performance evaluation", ABSTRACT="Computer performance models of parallel processing systems in which a job subdivides into two or more tasks at some point duringits execution are considered. Except for queueing effects, the tasks execute independently of one another and do not require synchronization. An approximate solution method is developed andresults of the approximation are compared to those of simulatio ns. Bounds on the performance improvement due to overlap are der", } @ARTICLE{Ajmo82:Comparative, AUTHOR="Marco {Ajmone Marsan} and G. Balbo and G. Conte", TITLE="Comparative Performance Analysis of Single Bus Multiprocessor Architectures", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=12, PAGES="1179-1191", YEAR=1982, KEYWORDS="Multiprocessor system; Bus; architecture; performance", ABSTRACT="Markovian models are developed for the performance analysis and comparison of several single bus multiprocessor architectures. Processors are assumed to cooperate in a message passing fashion, and messages are exchanged through common memory areas. Four architectures are considered in memory modules. Contention for shared resources is modeled and the corresponding efficiency loss is studied.", } @ARTICLE{McMi82:Routing, AUTHOR="Robert McMillen and H. J. Siegel", TITLE="Routing Schemes for the Augmented Data Manipulator Network in an {MIMD} System", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=12, PAGES="1202-1214", YEAR=1982, KEYWORDS="Multiprocessor system; routing algorithm; interconnection", ABSTRACT="There have been many multistage interconnection networks propos ed in the literature for interconnecting the processors that comprise large parallel processing systems. In this paper, the useof the ADM and IADM multistage networks in the MIMD mode of operation is considered. A tag based routing scheme which allows distributed control of either network is proposed.", } @ARTICLE{Nass82:Parallel, AUTHOR="D. Nassimi and Sartaj Sahni", TITLE="Parallel Algorithms to Set Up the Benes Permutation Network", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=2, PAGES="148-154", YEAR=1982, KEYWORDS="Multiprocessor system; SIMD; interconnection network", ABSTRACT="A parallel algorithm to determine the switch setting for a Benespermutation network is developed. This algorithm can determine the switch settings for an input/output Benes network in time wh en a fully intrconnected parallel computer with processing elements is used . The algorithm runs in time on both a cube connected and a perfect shuffle computer with processing elements. It runs in time on cube connected and perfect shuffle computers.", } @ARTICLE{Rile82:Synchronous, AUTHOR="D. Riley and R. Baron", TITLE="Design and Evaluation of a Synchronous Triangular Interconnection Scheme for Interprocessor Communications", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=2, PAGES="110-118", YEAR=1982, KEYWORDS="Interconnection network; routing algorithm; multiprocessor", ABSTRACT="A message orinted interprocessor communikation network is proposed that utilizes a simple fixed algorithm to store-and-forward short messages over directed data lines. The modular design of the network permits message transmission along a variabl number of processors. Simulations of the network's performance indicatethat for appropriate message loads the network transmits messag es in time proportional to the square root of the number of proc", } @ARTICLE{Demi82:Experience, AUTHOR="J. Deminet", TITLE="Experience with Multiprocessor Algorithms", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=4, PAGES="278-288", YEAR=1982, KEYWORDS="Multiprocessor system; parallel computing; speedup", ABSTRACT="This paper presents results of experiments with parallel algorithms. Several versions of four different programs, each representing a class of aplications, were tested. All experiments were performed on Cm, a 50-processor computer with a hierarchical structure. The results show that when the structure of an algorithm corresponds well to the structure of the computer, a close-to linear spedup may be achieved.", } @ARTICLE{Iran82:Methodology, AUTHOR="K. B. Irani and N. Khabbaz", TITLE="A Methodology for the Design of Communication Networks and the distribution of data in distributed supercomputer systems", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=5, PAGES="419-434", YEAR=1982, KEYWORDS="Computer network; distributed database; availability", ABSTRACT="In this paper the combined problem of communication network networks. The network topology is restricted to be maximally connected and of minimal diameter in order to enhance network reliability as well as to reduce communication cost and delay. A model is proposed to determine an optimal communication network and to alloca te files that minimize the total cost of file storage and of the", } @ARTICLE{Pate82:Multiprocessors, AUTHOR="J. H. Patel", TITLE="Analysis of Multiprocessors with Private Cache Memories", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=4, PAGES="296-304", YEAR=1982, KEYWORDS="Multiprocessor system; cache memory; performance", ABSTRACT="This paper presents an approximate analytical model for the performance of multiprocessors with private cache memories and a single shared main memory. The accuracy of the model is compared with simulation results and is found to be very good over a broad range of parameters. The parameters of the model are the size ofthe size of the multiprocessor, the size and type of the interconnection network, the cache miss-ratio, and the cache block tra.", } @ARTICLE{Sieg82:Parallel, AUTHOR="L. Siegel and H. J. Siegel and A. Feather", TITLE="Parallel Processing Approaches to Image Correlation", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=3, PAGES="208-218", YEAR=1982, KEYWORDS="Multiprocessor system; parallel computing", ABSTRACT="Image correlation is representative of wide variety of window-based image processing tasks. The way in which multimicroprocessorsystems can use SIMD parallelism to perform image correlation isexamined. Two fundamental algorithm strategies are explored. In one approach, all of the data that will be needed in a processorare transferred to the processor and operated on there. In the other, each processor performs all possible operations on its lo", } @INPROCEEDINGS{Schm82:Systemanalyse, AUTHOR="Bertil Schmidt", TITLE="Systemanalyse und Modellbildung", BOOKTITLE="1. Symposium Simulationstechnik", ADDRESS="Berlin, Germany", VOLUME=56, PAGES="106-115", YEAR=1982, LANGUAGE="German", REFERENCES=13, KEYWORDS="simulation; discrete event simulation; simulation language", ABSTRACT="Short introduction to modeling and system design.", } @ARTICLE{Port82:New, AUTHOR="Richard Porter", TITLE="The New Approach to Wilderness Preservation through Benefit-Cost Analysis", JOURNAL="Journal of Environmental Economics and Management", VOLUME=9, PAGES="59-82", YEAR=1982, } @ARTICLE{Ackr82:Skinner, AUTHOR="M. H. Ackroyd and R. Kanyangarara", TITLE="Skinner's method for computing bounds on distributions and the numerical solution of continuous-time queueing", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="1746-1749", YEAR=1982, REFERENCES=9, KEYWORDS="M/G/1; numerical integration; discrete convolution; waiting time; algorithm", ABSTRACT="Skinner's method provides a means of computing, numerically, upper and lower bounds on a cumulative distribution function resulting from the convolution of probability density functions. The method thus provides approximate numerical results whose accuracy is known precisely. This paper provides an exposition of Skinner's methods. It shows how the method can be applied to the computation of numerical solutions of other problems, as well as", } @INPROCEEDINGS{Adam82:Protocol, AUTHOR="C. J. Adams and G. C. Adams and A. G. Waters and Ian Leslie and M. Kirk", TITLE="Protocol Architecture of the {UNIVERSE} Project", BOOKTITLE=iccc, ADDRESS="London", PAGES="379-383", YEAR=1982, REFERENCES=3, KEYWORDS="LAN; internetworking; protocol; service characterization; broadcast; satellite radio", } @ARTICLE{Afsh82:Modeling, AUTHOR="P. V. Afshari and S. C. Bruell and R. Y. Kain", TITLE="Modeling a new technique for accessing shared buses", JOURNAL=per, VOLUME=11, PAGES="4-13", YEAR=1982, REFERENCES=18, KEYWORDS="Analytical model; network unit; M/M/N; parallel queue; data transmission; shared bus; load balancing; resource sharing", ABSTRACT="Consider a queueing system in which customers (or jobs) arrive to one of $q$ separate queues to await service from one of $s$ identical servers. Once a job enters a queue it does not leave that queue until it has been selected for service. Any server can serve any job from any queue. A job selected for service cannot be preempted. In this paper we consider jobs to be in a single class. We assume once a queue has been selected, job scheduling from", } @ARTICLE{Agra82:Aggregate, AUTHOR="Sandeep Agrawal and J. P. Buzen", TITLE="The aggregate server method for analyzing serialization delays in computer systems", JOURNAL=tocs, VOLUME=1, PAGES="116-143", YEAR=1982, KEYWORDS="Queueing approximation; process management; aggregate server method; serialization; resource allocation", ABSTRACT="An approximate, iterative method is presented to estimate the delays caused by programs waiting to enter critical sections and other software control structures in which mutual exclusion is enforced (i.e., one-at-a-time or serialized processing). Some common shares of such serialization delays include routines that perform resource allocation, modify internal data structures, or update external files and databases.", } @ARTICLE{Agra82:Exponential, AUTHOR="Ashok K. Agrawala and Satish K. Tripathi", TITLE="On an exponential server with general cyclic arrivals", JOURNAL=acta, VOLUME=18, PAGES="319-334", YEAR=1982, REFERENCES=13, KEYWORDS="G/M/1; arrival process", ABSTRACT="A En/M/1 queue is defined as a single server queue with exponential sevice time and general cyclic arrival distributions of cycle length n. The waiting time distribution for such a queue is proved to be a sum of $n$ exponential terms; this is a generalization of G/M/1 queue results. Based on this a method for obtaining the steady-state waiting time distributions for En/M/1 queues is introduced. An example is presented to show an application.", } @ARTICLE{Agra82:Adaptive, AUTHOR="Ashok K. Agrawala and Satish K. Tripathi and G. Ricart", TITLE="Adaptive routing using a virtual waiting time technique", JOURNAL=ieeese, VOLUME="SE-8", PAGES="76-81", YEAR=1982, REFERENCES=2, KEYWORDS="Virtual waiting time; GI/G/N; routing algorithm; comparison; ervice time dependent", ABSTRACT="an unrealizable ideal system they call ``Ideal A'' in which the controller ``can guess perfectly the service time for each arrival'' and uses this information in marking the assignment; but assuming an actual application, is the overhead requirement of vwtt low enough to make it a practical technique?", } @ARTICLE{Ahre82:Generating, AUTHOR="J. Ahrens and U. Dieter", TITLE="Generating Gamma variates by a modified rejection technique", JOURNAL=cacm, VOLUME=25, NUMBER=1, PAGES="47-54", YEAR=1982, REFERENCES=24, KEYWORDS="random number generation; probability; statistics; distribution; gamma distribution; Poisson distribution; variance; normal distribution", ABSTRACT="A suitable square root transformation of a gamma random variable with mean a>=1 yields a probability density close to the standard normal density. A modification of the rejection technique then begins by sampling from the normal distribution, being able to accept and transform the initial normal observation quickly at least 85 percent of the time (95 percent if a>=4). When used with efficient subroutines for sampling from the normal and exponen", } @ARTICLE{Ajmo82:Markov, AUTHOR="Marco {Ajmone Marsan} and Mario Gerla", TITLE="Markov models for multiple bus multiprocessor systems", JOURNAL=ieeetc, VOLUME="C-31", PAGES="239-248", YEAR=1982, REFERENCES=14, KEYWORDS="Markov process; multiprocessor system; simulation; performance evaluation; approximation; method; multipoint connection; memory interference; analysis", ABSTRACT="Markovian models are developed for the performance analysis of multiprocessor systems intercommunicating via a set of buses. The performance index is the average number of active processors, called processing power.", } @ARTICLE{Albi82:Poisson, AUTHOR="S. L. Albin", TITLE="On Poisson approximations for superposition arrival processes in queues", JOURNAL=ms, VOLUME=28, PAGES="126-137", YEAR=1982, REFERENCES=12, KEYWORDS="Approximation; method; arrival process; Poisson distribution; renewal process; GI/M/1; comparison; traffic intensity; utilization; superposition", ABSTRACT="We report on simulations of sum gii/m/1 queues; the arrival process is the superposition (sum) of up to 1024 i.i.d. renewal processes and there is a single exponential server. As one might anticipate, the simulation estimate of the expected number of customers in a sum gii/m/1 queueing system approaches the expected number in an m/m/1 queueing system as the number of arrivals processes, n, increases. However, for a given n, the difference betwe", } @ARTICLE{Aldi82:Simulation, AUTHOR="M. Aldinger", TITLE="Die Simulation des Mobilfunk-Kanals auf einem Digitalrechner", JOURNAL="Frequenz", PAGES="145-152", YEAR=1982, LANGUAGE="German", REFERENCES=13, KEYWORDS="MAT; channel simulation; mobile radio; Rayleigh fading; lognormal fading", } @ARTICLE{Aleh82:Determination, AUTHOR="A. Aleh and K. Dan Levin", TITLE="The determination of upper bounds for economically effective compression in packet switching networks", JOURNAL=per, VOLUME=11, PAGES="64-72", YEAR=1982, REFERENCES=6, KEYWORDS="Runtime/storage efficiency; cost; packet switching; upper bound; data reduction", ABSTRACT="When people and organizations pay to communicate by the word, number, line or page, the decimal system and the english language suddenly become very inefficient. This holds true for data communication networks, where different methods can be used to get the same message across the network, in compact form without losing the information content. Many techniques have been developed since 1948, when Claude E. Shannon mathematically derived the", } @ARTICLE{Amer82:Measurement, AUTHOR="Paul Amer", TITLE="A measurement center for the {NBS} local area computer network", JOURNAL=ieeetc, VOLUME="C-31", PAGES="723-729", YEAR=1982, REFERENCES=17, KEYWORDS="LAN; monitoring; CSMA; carrier sense multiple access; multiple access channel; broadcast; communication; CSMA/CD", ABSTRACT="This paper describes a measurement center for the NBSNET, a distributed, broadcast local area computer network (LAN) at the National Bureau of Standards. Artificial traffic generator, a monitoring system, an data analysis software", } @TECHREPORT{Andr82:Two, AUTHOR="R. W. Andrews and T. J. Schriber", TITLE="Two {ARMA-based} confidence-interval procedures for the analysis of simulation output", INSTITUTION="Division of Research, Administration, University of Michigan", ADDRESS="Michigan", PAGES="1-47", YEAR=1982, REFERENCES=24, KEYWORDS="Time series analysis; spectral analysis; autoregressive analysis; output analysis; regression analysis", ABSTRACT="Two methods are presented for building interval estimates on the mean of a stationary stochastic process. both methods fit an autoregressive moving-average (arma) model to observations on the process. the model is used to estimate the variance of the sample mean and the applicable degrees of freedom of the $t$ statistic. Fitting of the arma model is totally automated. the arma-based confidence intervals perform well with data generated from arma", } @ARTICLE{Arth82:Bounding, AUTHOR="E. Arthurs and B. W. Stuck", TITLE="Bounding mean throughput rate and mean delay in office systems", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="12-18", YEAR=1982, KEYWORDS="Queueing system; MVA", } @TECHREPORT{Augu82:Cox, AUTHOR="R. Augustin", TITLE="Die Cox-Verteilung: Untersuchung der Kenngrößen", TYPE="Forschungsbericht", INSTITUTION="Universität Dortmund", NUMBER=134, YEAR=1982, LANGUAGE="German", KEYWORDS="random number generation; random variate generation", } @ARTICLE{Augu82:Characteristics, AUTHOR="R. Augustin and K.-J. Buescher", TITLE="Characteristics of the Cox-distribution", JOURNAL=per, VOLUME=12, NUMBER=1, PAGES="22-32", YEAR=1982, REFERENCES=9, KEYWORDS="Markov process; continuous time process; hypo distribution; hyper distribution; moment; phase concept; method", ABSTRACT="This study presents a new approach to analyse the cox-distribution, which is often used in computer systems performance evaluation to describe random variables, e.e. service times. Taking aside special cases, however, there are only few published results on the characteristics of this distribution, like moments and central moments. Further-on procedures are given to calculate the parameters of a cox-distribution from its characteristics, which", } @ARTICLE{Bare82:Mikroprogrammierte, AUTHOR="M. Barel", TITLE="Mikroprogrammierte Bit-Slice-Computer", JOURNAL="Elektronik", VOLUME=9, PAGES="69-75", YEAR=1982, LANGUAGE="German", REFERENCES=4, KEYWORDS="Design; realization; application; microprocessor; performance evaluation; survey; bit-slice family; small computer; hardware simulator", ABSTRACT="Beim Entwurf eines Computersystems hat der Entwickler heute drei prinzipielle Möglichkeiten: er kann festverdrahtete Logik, Mikroprozessoren oder Bit-Slice-Prozessoren einsetzen. Bit-Slice-Prozessoren bieten dann Vorteile, wenn lange Adress- und Datenwörter erforderlich sind, wenn ein spezieller Befehlssatz gewünscht wird oder wenn anspruchsvolle Echtzeitaufgaben zu lösen sind. Von Computern in festverdrahteter Logik unterscheiden", } @TECHREPORT{Beil82:Simulative, AUTHOR="H. Beilner and J. Mäter", TITLE="Simulative and analytical modelling of computing system performance using the software tool {COPE}", INSTITUTION="Universität Dortmund", ADDRESS="Dortmund", PAGES="1-13", YEAR=1982, REFERENCES=11, KEYWORDS="performance evaluation; analytical model; simulation model; Queueing network; realization; cope", ABSTRACT="The software tool, cope, serves for supporting the solution of performance evaluation problems, in the model domain. The tool - offers a particular language, cospel, for problem description purposes (i.e., for specifying system configurations, system loads and performance quantities); - employs modelling techniques of the simulative and analytical types for automatic problem solution; - assists the user in the model building, model evaluation a", } @ARTICLE{Bemm82:Anwendung, AUTHOR="H.-B. Bemmann", TITLE="Anwendung der Laguerreschen Polynome zur näherungsweisen Darstellung von Verteilungsfunktionen", JOURNAL=nte, VOLUME=32, PAGES="518-520", YEAR=1982, LANGUAGE="German", KEYWORDS="Probability; statistics", } @MISC{Berg82:Special, AUTHOR="G. D. Bergland and R. C. Cheung and others", TITLE="Special issue on communication software", PUBLISHER="ieeecom", VOLUME="COM-30", PAGES="1265-1455", YEAR=1982, KEYWORDS="Special issue; communication network; software; programming language; program construction; CHILL", ANNOTE="Software methodology ccitt programming languages software tools switching software architecture communication software for computers", } @BOOK{Bert82:Optimal, AUTHOR="Dimitri Bertsekas", TITLE="Optimal Routing and Flow Control Methods for Communication Networks", PUBLISHER="Analysis and Optimization of Systems, Bensoussan and Lions, Springer-Verlag", PAGES="615-643", YEAR=1982, REFERENCES=23, KEYWORDS="Flow control; optimization; routing algorithm", ABSTRACT="In this expository paper we consider some aspects of routing and flow control for long-haul wire data networks in which the communication resource is scarce (as opposed to local networks such as Ethernet where it is not), and where there are no issues of contention resolution due to random access of a broadcast medium (as in some satellite, local, and packet radio networks). We place primary emphasis on optimal procedures since these offe", } @ARTICLE{Blum82:Formal, AUTHOR="T. P. Blumer and R. L. Tenney", TITLE="A formal specification technique and implementation method for protocols", JOURNAL=cn, VOLUME=6, PAGES="201-217", YEAR=1982, REFERENCES=26, KEYWORDS="Protocol engineering", } @BOOK{Bolc82:Analyse, AUTHOR="G. Bolch and Ian Akyildiz", TITLE="Analyse von Rechensystemen", ISBN="3-519-02359-8", PUBLISHER="Teubner-Verlag Studienbücher Informatik", ADDRESS="Stuttgart", PAGES=269, YEAR=1982, LANGUAGE="German", REFERENCES=140, KEYWORDS="Queueing system; MVA", } @ARTICLE{Bolc82:Zur, AUTHOR="G. Bolch and W. Jarschel", TITLE="Zur Leistungsanalyse von symmetrischen Mehrprozessorsystemen", JOURNAL=er, VOLUME=24, PAGES="3-7", YEAR=1982, LANGUAGE="German", KEYWORDS="Queueing system; operational analysis", ANNOTE="Survey", } @ARTICLE{Both82:Lokale, AUTHOR="R. Both", TITLE="Lokale Netzwerke, Theorie und Praxis", JOURNAL=nte, VOLUME=36, NUMBER=7, YEAR=1982, LANGUAGE="German", KEYWORDS="Lan", } @ARTICLE{Bric82:Network, AUTHOR="R. Brice and W. Alexander", TITLE="A network performance analyst's workbench", JOURNAL=per, VOLUME=11, PAGES="138-146", YEAR=1982, REFERENCES=15, KEYWORDS="Performance evaluation; data collection; method; data analysis", ABSTRACT="Performance measurement and analysis of the behavior of a computer network usually requires the application of multiple software and hardware tools. The location, functionality, data requirements, and other properties of the tools often reflect the distribution of equipment in the network. We describe how we have attempted to organize a collection of tools into a single system that spans a broad subset of the measurement and analysis activities", } @ARTICLE{Bux82:Data, AUTHOR="W. Bux and K. K mmerle and Hong Linh Truong", TITLE="Data link control performance: results comparing {HDLC} operational modes", JOURNAL=cn, VOLUME=6, NUMBER=1, PAGES="37-51", YEAR=1982, REFERENCES=14, KEYWORDS="HDLC; performance evaluation; simulation; model; link layer; RM=normal response mode; ABM; asynchronous balanced mode", ABSTRACT="The objective of this paper is to compare the performance of the different operational modes of the standard data link-control procedure HDLC: The normal response mode (NRM), an unbalanced procedure with primary and secondary stations which have different functional capabilities, and the asynchronous balanced mode (ABM), a balanced procedure with functionally equivalent, so-called combined stations. Performance is measured in terms of:", } @ARTICLE{Cara82:Fast, AUTHOR="G. Carayannis and N. Kalouptsidis and D. G. Manolakis", TITLE="Fast recursive algorithms for a class of linear equations", JOURNAL=ieeeassp, VOLUME="ASSP-30", PAGES="227-239", YEAR=1982, REFERENCES=28, KEYWORDS="Method; matrix; recursion method; signal processing; linear equation; Hankel matrix; Toeplitz matrix; ARMA", ABSTRACT="In many signal processing applications, one often seeks the solution of a linear system of equations by means of fast algorithms. The special form of the matrix associated with the linear system may permit the development of algorithms requiring O(P2) or fewer operations. Hankel and Toeplitz matrices provide well known examples and various fast schemes have been developed in the literature to cover these cases.", } @INPROCEEDINGS{Cham82:Response, AUTHOR="J. Chammas", TITLE="Response Times over Packet Switched Networks - Some Performance Issues", BOOKTITLE=iccc, PUBLISHER="North Holland", ADDRESS="London", YEAR=1982, REFERENCES=14, KEYWORDS="Packet switching; response time; communication network; gamma function; distribution function; round robin", } @ARTICLE{Chou82:Cellular, AUTHOR="Gagan Choudhury and S. Rappapart", TITLE="Cellular communication schemes using generalized fixed channel assignment and collision type request channles", JOURNAL=ieeevt, VOLUME="VT-31", PAGES="53-65", YEAR=1982, KEYWORDS="MAT; control channel", } @BOOK{Cohe82:Single, AUTHOR="J. W. Cohen", TITLE="The single server queue", PUBLISHER="North Holland", ADDRESS="Amsterdam", PAGES=694, YEAR=1982, REFERENCES=450, KEYWORDS="Queueing system; G/G/1; M/M/1; G/M/1; G/G/2; bibliography; reference; single server", ABSTRACT="This monograph focuses on the basic queueing model, the single server queue. Its intent is to describe the various mathematical methods which can be used to solve this type of queueing problem. A revision of prof. Cohen's 1969 monograph, it includes notes presented in his earlier work and contributions made in the subsequent ten years.", } @ARTICLE{Dave82:Fast, AUTHOR="J. H. Davenport", TITLE="Fast {REDUCE:} the trade-off between efficiency and generality", JOURNAL=sigsam, VOLUME=16, NUMBER=1, PAGES="8-11", YEAR=1982, REFERENCES=6, KEYWORDS="Reduce; runtime/storage efficiency", ABSTRACT="This short note describes various changes the author has made to reduce, which, by reducing the power of the reduce system, increase its performance", } @ARTICLE{Diaz82:Modeling, AUTHOR="Michel Diaz", TITLE="Modeling and Analysis of Communication and Cooperation Protocols Using Petri Net Based Models", JOURNAL=cn, VOLUME=6, PAGES="419-441", YEAR=1982, REFERENCES=109, KEYWORDS="Protocol Specification; Petri Net", } @ARTICLE{Didi82:Simulation, AUTHOR="M. Didic and Bernd E. Wolfinger", TITLE="Simulation of a local computer network architecture applying a unified modelling system", JOURNAL=cn, VOLUME=6, PAGES="75-91", YEAR=1982, KEYWORDS="Discrete event simulation; SIMULA; MOSAIC; LAN", ANNOTE="Kienzle-LAN (KINET)", } @ARTICLE{Dona82:Passage, AUTHOR="L. Donatiello and G. Iazeolla and Salvatore Tucci", TITLE="Passage times in computer communication networks with non-deterministic routing", JOURNAL=per, VOLUME=11, PAGES="30-37", YEAR=1982, REFERENCES=9, KEYWORDS="Passage time; first passage; routing algorithm; simulation; performance evaluation; dynamic routing", ABSTRACT="Passage times are the times for a job or a message to traverse a portion of the network. Networks with dynamic routing can be modeled by the use of mathematical models based on the theory of queueing networks. This theory allows the derivation of performance indices for certain passage times called response times (or the times for a job to traverse the entire network). This is generally unsatisfactory for multistation system architectures, wh", } @ARTICLE{Dubo82:Hierarchical, AUTHOR="D. F. Dubois", TITLE="A hierarchical modeling system for computer networks", JOURNAL=per, VOLUME=11, PAGES="147-155", YEAR=1982, REFERENCES=22, KEYWORDS="Realization; computer network; performance evaluation; analytical model; simulation model; hierarchical modeling", ABSTRACT="This paper describes the hierarchical modeling system (hms). Hms is a tool - a unified and expandable system - which supports the development of analytic and simulator models of computer networks. The same system and workload descriptions can be interpreted as analytic queueing models with optimization techniques or as discrete event simulation models. The rationale behind the development of hms is that high level analyses incorporating ana", } @ARTICLE{Elsa82:Time, AUTHOR="M. Y. Elsanadidi and Wesley W. Chu", TITLE="An analysis of a time window multiaccess protocol with collision size feedback {(WCSF)}", JOURNAL=per, VOLUME=11, PAGES="112-118", YEAR=1982, REFERENCES=14, KEYWORDS="LAN; window mechanism; CSMA; carrier sense multiple access; performance evaluation; network throughput", ABSTRACT="We analyze the performance of a window multiaccess protocol with collision size feedback. We obtain bounds on the throughput and the expected packet delay, and access the sensitivity of the performance to collision recognition time and packet transmission time. The WCSF protocol, which requires more information than csma-cd, is shown to have at least 30 channels; that is, when packet transmission time is comparable to propagation delay. The", } @ARTICLE{Elsa82:Study, AUTHOR="M. Y. Elsanadidi and W. W. C. H. U", TITLE="Study of acknowledgement schemes in a star multi-access network", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="1657-1667", YEAR=1982, REFERENCES=9, KEYWORDS="Packet switching; CSMA; carrier sense multiple access; ARPAnet; broadcast; communication; star network; ALOHA; radio channel", ABSTRACT="In distributed random access communication, collision occurs when two or more transmissions overlap in time. We study the effect of acknowledgements on the performance of a star broadcast network. Our study reveals that the split channel has the highest capacity, and that the high-power scheme provides an attractive economical alternative when data packets are short.", } @TECHREPORT{Fish82:Sampling, AUTHOR="G. S. Fishman and L. R. Moore", TITLE="Sampling from a discrete distribution while preserving monotonic ity", INSTITUTION="University of North Carolina at Chapel Hill", ADDRESS="Chapel Hill", NUMBER="81-7", YEAR=1982, REFERENCES=11, KEYWORDS="random variate generation; method; runtime/storage efficiency; sampling; aliasing; cutpoint method; shift register sequences", ABSTRACT="This paper describes a cutpoint method for sampling from an n-point discrete distribution that preserves the monotone relationship between a uniform deviate and the random variate it generates. This property is useful when developing a sampling plan to reduce variance in a Monte Carlo or simulation study. The alias sampling method genrally lacks this property and requires 2n storage locations while the proposed cutpoint sampling method requires", } @ARTICLE{Fred82:Class, AUTHOR="A. Fredericks", TITLE="A class of approximations for the waiting time distribution in a {GI/G/1} queueing system", JOURNAL=bstj, VOLUME=61, NUMBER=3, PAGES="295-325", YEAR=1982, REFERENCES=13, KEYWORDS="GI/G/1; FIFO; approximation; method; Lindley integral equation; heavy traffic approximation; low traffic approximation; waiting time; moment matching", ABSTRACT="The basic idea is to choose a functional form for an approximation WA(X) to a delay distribution, say, W(X), and use the well-known Lindley integral equation to find the undetermined coefficients. For the case where WA(X) is exponential - WA(X) = 1-CE-AX - We have used this technique to develop servel approximations, some of which make use of the explicit structure of the relevant service and interarrival time distributions, while others requir", } @ARTICLE{Furu82:Document, AUTHOR="R. Furuta and J. Scofield and A. Shaw", TITLE="Document formatting systems: survey, concepts, and issues", JOURNAL=acmcs, VOLUME=14, NUMBER=3, PAGES="417-472", YEAR=1982, REFERENCES=95, KEYWORDS="Text processing; survey; bibliography; design; human factors; method", ABSTRACT="Formatting systems are concerned with the physical layout of a document for hard- and soft-copy media. This paper characterizes the formatting problem and its relation to other aspects of document processing, describes and evaluates several representative and seminal systems, and discusses some issues and problems relevant to future systems. The emphasis is on topics related to the specification of document formats; these include the underlying", } @ARTICLE{Gelb82:Funkkanalsimulation, AUTHOR="H-J. Gelbrich and K. Löw and R. W. Lorenz", TITLE="Funkkanalsimulation und Bitfehler-Strukturmessungen an einem digitalen Kanal", JOURNAL="Frequenz", PAGES="130-138", YEAR=1982, LANGUAGE="German", REFERENCES=16, KEYWORDS="Digital transmission; Mobile radio; MAT; Bit error; multipath", } @INPROCEEDINGS{Gent82:Programming, AUTHOR="W. M. Gentleman", TITLE="Programming languages for symbolic algebra and numerical analysis", BOOKTITLE="IFIP TC2", EDITOR="J. K. Reid", PUBLISHER="Elsevier North-Holland", ADDRESS="New York", PAGES="131-141", YEAR=1982, KEYWORDS="Symbolic algebraic computation; symbolic algebraic language; umerical method", ABSTRACT="Numerical analysts often have to do a lot of tedious algebra, and one would expect symbolic algebra systems to be very helpful to them. This paper examines some reasons why reality falls short of expectation. A basic problem is that symbolic systems are best at handling exact equations, analytic functions, and scalars, while the analyst often deals with approximations and inequalities, nonanalytic functions such as splines, and matrices.", } @ARTICLE{Geor82:Collision, AUTHOR="Leonidas Georgiadis and P. Papantoni-Kazakos", TITLE="A collision resolution protocol for random access channels with energy detectors", JOURNAL=ieeecom, VOLUME="COM-32", PAGES="2413-2420", YEAR=1982, REFERENCES=14, KEYWORDS="Packet switching; random multiple access; communication protocol; collision detection; time slot", ABSTRACT="In this paper, we consider the random accessing of a single slotted channel by a large number of packet-transmitting, bursty us ers. We assume that feedback broadcasting is available where some different information, in addition to the information assumed by the capetanais, gallager, messey, etc., models, is included in the feedback. In particular, we assume that the existence of energy detectors permits the broadcasting of the number of collid", } @ARTICLE{Gerk82:Menschliche, AUTHOR="P. Gerke", TITLE="Das menschliche Gehirn im nachrichtentechnischen Modell", JOURNAL=ntz, VOLUME=35, NUMBER=5, PAGES="306-312", YEAR=1982, LANGUAGE="German", REFERENCES=9, KEYWORDS="human factors; Communication Model", } @ARTICLE{Gilo82:Prinzip, AUTHOR="W. K. Giloi and R. Güth", TITLE="Das Prinzip der Datenstruktur-Architekturen und seine Realisierung im {STARLET-Rechner}", JOURNAL=infspec, PAGES="21-37", YEAR=1982, LANGUAGE="German", KEYWORDS="Data flow machine", } @ARTICLE{Gopa82:Minimizing, AUTHOR="I. Gopal and D. Coppersmith and Chak Nam Wong", TITLE="Minimizing packet waiting time in a multibeam satellite system", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="305-316", YEAR=1982, REFERENCES=15, KEYWORDS="Packet switching; satellite radio; time slot; TDMA; time division multiple access; heuristics", ABSTRACT="In this paper, we examine the problem of time-slot assignment in an SS/TDMA system operating in a packet-switched environment. We seek to assign time slots in order to minimize average packet waiting time and in order to maximize transponder utilization we show that an assignment which achieves both objectives exists and develop a branch-and-bound alogrithm to find it. In addition, we suggest several heuristics which require much less compution", } @BOOK{Gree82:Computer, AUTHOR="P. E. Green", TITLE="Computer network architectures and protocols", PUBLISHER="PLENUM PRESS", ADDRESS="New York", PAGES="1-718", YEAR=1982, KEYWORDS="survey; bibliography; network architecture; ISO reference model", ABSTRACT={The book is organized along the lines of the "layered" view which is a always used today in dissecting network function and which will be introduced in part}, } @ARTICLE{Grie82:Plädoyer, AUTHOR="I. Grieger", TITLE="Ein Plädoyer für deutsche Begriffe in der graphischen Datenverarbeitung", JOURNAL=aninf, VOLUME=24, PAGES="307-319", YEAR=1982, LANGUAGE="German", REFERENCES=5, KEYWORDS="Survey; graphics; classification; graphics language; interactive mode; graphics terminology", ABSTRACT="Dieser Beitrag befasst sich mit der deutschen Begriffsbildung in der graphischen Datenverarbeitung. Es ist das Ziel, diese zum Teil neuen Benennungen der Öffentlichkeit vorzustellen und auf eine einheitliche Fachsprache hinzuwirken. Damit soll auch verhindert werden, dass verschiedene Benennungen für den gleichen Begriff verwendet werden. Eine deutsche Begriffswelt ist nicht nur für übersetzer, sondern auch für die Aus- und Weiterbildung", } @ARTICLE{Hac82:Computer, AUTHOR="Anna Hac", TITLE="Computer system simulation in {PASCAL}", JOURNAL=spe, VOLUME=12, NUMBER=8, PAGES="777-784", YEAR=1982, REFERENCES=7, KEYWORDS="Simulation; PASCAL; SIMPAS", } @ARTICLE{Hack82:Berechnung, AUTHOR="K.-D. Hackbarth", TITLE="Berechnung kürzester Wege in Netzen", JOURNAL=fernmelde, VOLUME=36, NUMBER=7, PAGES=43, YEAR=1982, LANGUAGE="German", REFERENCES=38, KEYWORDS="Graph theory; routing algorithm; network design; shortest path", ABSTRACT="This paper describes important algorithms used to calculate shortest paths in networks and gives examples of their application. Appropriate procedures based on algorithms for the calculation of shortest paths are indicated for a number of extensions or modifications of the shortest-path problem. Moreover, the question of the computation time and the required storage capacity is discussed as a function of the network size. For several selected", } @ARTICLE{Hage82:Gespeicherte, AUTHOR="Joachim Hagenauer and W. Papke", TITLE="Der gespeicherte Kanal Erfahrungen mit einem Simulationsverfahren für Fading-Kanäle", JOURNAL="Frequenz", PAGES="122-129", YEAR=1982, LANGUAGE="German", REFERENCES=12, KEYWORDS="Satellite radio; MAT; channel simulation; Mobile radio; fading", } @ARTICLE{Hama82:Access, AUTHOR="V. C. Hamacher and G. S. Shedler", TITLE="Access response on a collision-free local bus network", JOURNAL=cn, VOLUME=6, PAGES="93-103", YEAR=1982, KEYWORDS="LAN; two-wire bus; priority", } @ARTICLE{Harb82:Model, AUTHOR="A. Harbitter and Satish K. Tripathi", TITLE="A model of transport level flow control", JOURNAL=jacm, VOLUME=11, PAGES="222-232", YEAR=1982, KEYWORDS="ARPAnet; packet switching; transport layer; flow control", ABSTRACT="A Markov decision process model is developed to analyze buffer assignment at the transport level of the ARPAnet protocol. The result of the analysis is a method for abtaining an assignment policy which is optimal with respect to a delay/throughput/overhead reward function. The nature of the optimal policy is investigated by varying parameters of the reward.", } @ARTICLE{Hatt82:Model, AUTHOR="Shimmi Hattori and others", TITLE="A design model for a real-time voice storage system", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="53-57", YEAR=1982, KEYWORDS="Voice coding; voice storage; digital signal processing", } @ARTICLE{Hatt82:Digital, AUTHOR="T. Hattori and others", TITLE="Digital signalling scheme on 800 {MHz} land mobile telephone communication with all digital radio link control", JOURNAL=recl, VOLUME=30, PAGES="150-157", YEAR=1982, KEYWORDS="MAT; signalling", } @ARTICLE{Hayn82:Highly, AUTHOR="L. S. Haynes and others", TITLE="A survey of highly parallel computing", JOURNAL=ieeecomp, PAGES="9-24", YEAR=1982, KEYWORDS="Parallel computing", } @ARTICLE{Heat82:Note, AUTHOR="D. C. Heath and W. L. Maxwell", TITLE="A note on the performance of limited entry queuing systems", JOURNAL=orl, VOLUME=1, NUMBER=3, PAGES="91-95", YEAR=1982, REFERENCES=5, KEYWORDS="Queueing system; G/D/1; M/D/1; performance evaluation", } @ARTICLE{Heff82:Moment, AUTHOR="H. Heffes", TITLE="Moment formulae for a class of mixed multi-job-type queueing networks", JOURNAL=bstj, VOLUME=61, NUMBER=5, PAGES="709-745", YEAR=1982, REFERENCES=35, KEYWORDS="Queueing network; computer network; performance evaluation; QUEUE LENGTH; waiting time; TIME IN system; MOMENT; bibliography; LITTLE'S FORMULA", } @ARTICLE{Hent82:Untersuchungen, AUTHOR="S. Hentschke", TITLE="Untersuchungen und Entwürfe von hochintegrierbaren Echo-Kompensationsverfahren zur Duplexübertragung", JOURNAL="Frequenz", VOLUME=36, PAGES="302-309", YEAR=1982, LANGUAGE="German", KEYWORDS="Telephony; echo canceller", } @ARTICLE{Hent82:Leistungsverhalten, AUTHOR="S. Hentschke and R. Meierl and P. Wildenauer", TITLE="Leistungsverhalten eines über einen gemeinsamen Bus kommunizierenden Mehrmikrorechner-Systems", JOURNAL=er, VOLUME=24, PAGES="255-262", YEAR=1982, LANGUAGE="German", KEYWORDS="Performance evaluation; parallel computing", } @ARTICLE{Hohn82:Bayes, AUTHOR="H. D. Höhne", TITLE="Bayes-Grenzen und Gipfel in der Mischung zweier Normalverteilungen", JOURNAL="Frequenz", VOLUME=36, PAGES="199-202", YEAR=1982, LANGUAGE="German", REFERENCES=9, KEYWORDS="Compound distribution; normal distribution; limit theorem; Bayes statistics", ABSTRACT="The existence of Bayes limits and of two modes in the mixture of two normally distributed components may be regarded as criteria to use these components for representing classes in unsupervised learning. A geometric interpretation given by G. Doetsch (1936) and J. Behboodian (1970) is suitable as well for graphical as for iterative numerical solution. The geometric interpretation is, to find the modes as intersecting points of a transcendental", } @ARTICLE{Huan82:Redundant, AUTHOR="Hao Huang", TITLE="Redundant microcomputer-controlled 3-stage Clos network for system-availability enhancement", JOURNAL=ieeer, VOLUME="R-31", PAGES="182-184", YEAR=1982, REFERENCES=4, KEYWORDS="Switching network; CLOS; nonblocking", } @ARTICLE{Inab82:System, AUTHOR="H. Inaba and Kenji Nakagawa and T. Ooi", TITLE="System description on 800 {MHz} land mobile telephone communication with all digital radio control scheme", JOURNAL=recl, VOLUME=30, PAGES="143-149", YEAR=1982, KEYWORDS="Mat", } @ARTICLE{Jaff82:Responsive, AUTHOR="Joseph Jaffe and F. H. Moss", TITLE="A responsive distributed routing algorithm for computer networks", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="1758-1762", YEAR=1982, REFERENCES=7, KEYWORDS="Packet switching; Markov process; routing algorithm; computer network; ethernet; ARPAnet; LAN", ABSTRACT="A new distributed algorithm is presented for dynamically determining weighted shortest paths used for message routing in computer networks. The major features of the algorithm are that the paths defined do not from transient loops when weights change. The worst case recovery time is proportional to the largest number of hops h.", } @ARTICLE{Jais82:Perfomance, AUTHOR="N. K. Jaiswal", TITLE="Perfomance evaluation studies for time-sharing computer systems", JOURNAL=pe, VOLUME=2, PAGES="223-236", YEAR=1982, REFERENCES=74, KEYWORDS="Performance evaluation; response time; time sharing; process management; M/G/1; processor sharing; round robin; priority", ABSTRACT="This paper reviews the work carried out in evaluating the performance of time-sharing computer systems in terms of performance measures such as response time, cpu efficiency, cpu productivity, etc. The review indicates that most of the work is limited to processor-sharing systems in which the quantum size tends to zero. Models with finite state-dependent quantum size needs to be developed further to be useful for system designers and operations", } @ARTICLE{Jond82:Hilbert, AUTHOR="Friedrich Jondral", TITLE="The Hilbert Transform of a sampled random signal", JOURNAL=ntzarchiv, VOLUME=4, NUMBER=8, PAGES="227-232", YEAR=1982, REFERENCES=6, KEYWORDS="Hilbert transform; random signal", } @ARTICLE{Jung82:Verallgemeinerte, AUTHOR="P. Jung", TITLE="Verallgemeinerte Zuverlässigkeitsbeschreibung von Nachrichtensystemen", JOURNAL=ntzarchiv, VOLUME=4, PAGES="381-385", YEAR=1982, LANGUAGE="German", KEYWORDS="Reliability", } @ARTICLE{Kadz82:Analytische, AUTHOR="G. Kadzioch", TITLE="Analytische Bestimmung der mittleren Lebensdauer und der stationären Verfügbarkeit bei (m von n)-Sytemen mit Reparatur", JOURNAL=ntz, VOLUME=4, NUMBER=6, PAGES="153-158", YEAR=1982, LANGUAGE="German", REFERENCES=4, KEYWORDS="Reliability; availability; repair; mean lifetime", } @ARTICLE{Kame82:Finite, AUTHOR="Hisao Kameda", TITLE="A finite-source queue with different customers", JOURNAL=jacm, VOLUME=29, PAGES="478-491", YEAR=1982, REFERENCES=15, KEYWORDS="Time sharing; model; multiprogramming; processor sharing; FIFO; priority; finite source", ABSTRACT="A finite-source queueing model, which has often been used in analyzing time-sharing sytems and multiprogrammed computer system s, is investigated. The model studied here has two service stations, a processor (single server) and peripherals (infinite server), and a finite number of customers (or jobs) that have a distinct service rate at the processor. The model is in equilibrium. It is shown that the utilization factor of the processor can be", } @ARTICLE{Kamm82:Auswahl, AUTHOR="K. Kammerlander", TITLE="Auswahl des digitalen Übertragungsverfahrens unter den Bedingungen des beweglichen Landfunks", JOURNAL="Frequenz", PAGES="99-104", YEAR=1982, LANGUAGE="German", KEYWORDS="MAT; transmission; radio channel", } @INBOOK{Kaub82:Discrete, AUTHOR="W. H. Kaubisch and C. A. R. Hoare", TITLE="Discrete event simulation based on communicating sequential processes", BOOKTITLE="oretical foundations of programming methodology", PUBLISHER="D. Reidel Publ. Co.", ADDRESS="Hingham, MA", PAGES="625-642", YEAR=1982, KEYWORDS="Discrete event simulation; event sequencing", ABSTRACT="The paper under review suggests a minimal set of primitive concepts required in the construction of algorithms for discrete event simulation. The concepts that are embedded in the design and construction of algorithms are the communicating sequential process (often referred to as CSP). This CSP is reinterpreted as a quasi parallel process, operating in simulated time. This excellent paper has an interesting simulation model which can be", } @TECHREPORT{Kies82:New, AUTHOR="W. M. Kiesel and P. J. Kühn", TITLE="A new access protocol with dynamic priorities for distributed systems", INSTITUTION="Dept. of Communications, Uni. of Siegen", PAGES="181-191", YEAR=1982, REFERENCES=13, KEYWORDS="Access Protocol; Distributed system; queueing system; LAN", } @ARTICLE{Kitt82:Analoge, AUTHOR="L. Kittel", TITLE="Analoge und diskrete Kanalmodelle für die Signalübertragung beimbeweglichen Funk", JOURNAL="Frequenz", PAGES="153-160", YEAR=1982, LANGUAGE="German", REFERENCES=26, KEYWORDS="MAT; data transmission; fading; channel; model; Markov chain", } @TECHREPORT{Klei82:Stochastische, AUTHOR="W. Kleinöder", TITLE="Stochastische Bewertung von Aufgabenstrukturen für hierarchische Mehrrechnersysteme", TYPE="Arbeitsberichte IMMD", INSTITUTION="Universität Erlangen Nürnberg", ADDRESS="Erlangen, Germany", VOLUME=15, NUMBER=10, PAGES=162, YEAR=1982, LANGUAGE="German", REFERENCES=50, KEYWORDS="Parallel computing; load sharing", ANNOTE="EGPA; Erlangen general purpose array", } @ARTICLE{Klei82:Packet, AUTHOR="Leonard Kleinrock", TITLE="Packet switching principles", JOURNAL=ericssonr, NUMBER=3, PAGES="121-124", YEAR=1982, KEYWORDS="Packet switching", } @ARTICLE{Knor82:Indexieren, AUTHOR="G. Knorz", TITLE="Indexieren als Erkennen von Dokument-Deskriptor-Beziehungen. Kon zept und Ergebnisse", JOURNAL=aninf, VOLUME=24, NUMBER=1, PAGES="1-10", YEAR=1982, LANGUAGE="German", REFERENCES=18, KEYWORDS="Information system; classification; literature system", ABSTRACT="The concept of a weighted automatic indexing for information retrieval is introduced. The assignment descriptors is formulated as a recognition problem of document-descriptor relationship. Based on vector descriptions of these relationships, polynomical classifiers adapted in the mean square sense are used for a decision theory approach. Indexing results, respective for about 33000 abstracts, prove the usefulness of the concept.", } @ARTICLE{Kuch82:Statistische, AUTHOR="H.-P. Kuchenbecker", TITLE="Statistische Eigenschaften von Schwund- und Verbindungsdauer beim Mobilfunk-Kanal", JOURNAL="Frequenz", PAGES="138-144", YEAR=1982, LANGUAGE="German", REFERENCES=16, KEYWORDS="Mobile radio; MAT; fading", } @ARTICLE{Lam82:Dynamic, AUTHOR="Simon Lam", TITLE="Dynamic scaling and growth behavior of queueing network normalization constants", JOURNAL=jacm, VOLUME=29, PAGES="492-513", YEAR=1982, REFERENCES=15, KEYWORDS="Queueing network; poisson distribution; output process; product form; network; normalization constant; numerical evaluation; local balance", ABSTRACT="A simple dynamic scaling technique is shown that avoids both the overflow and underflow problems that are often encountered in the evaluation of normalization constants of closed product-form queueing networks.", } @ARTICLE{Lam82:Optimal, AUTHOR="Simon Lam and Y.-C. L. Lien", TITLE="Optimal routing in networks with flow-controlled virtual channels", JOURNAL=per, VOLUME=11, PAGES="38-46", YEAR=1982, REFERENCES=28, KEYWORDS="Routing algorithm; network flow; virtual channel; window mechanism; model; queueing network; optimization", ABSTRACT="Packet switching networks with flow-controlled virtual channels are naturally modeled as queueing networks with closed chains. Available network design and analysis techniques, however, are mostly based upon an open-chain queueing network model. In this paper, we first examine the traffic conditions under which an open-chain model accurately predicts the mean end-to-end delays of a closed-chain model having the same chain throughputs.", } @ARTICLE{Lang82:Mehrwegeresistente, AUTHOR="U. Langewellpott", TITLE="Mehrwegeresistente Datenübertragung mit hohen Raten im Mobilfunk bei 1 {GHz}", JOURNAL="Frequenz", PAGES="105-109", YEAR=1982, LANGUAGE="German", REFERENCES=11, KEYWORDS="Mobile radio; MAT; multipath; spread spectrum; TDMA; time division multiple access", } @TECHREPORT{Lave82:Statistical, AUTHOR="S. S. Lavenberg and T. L. Moeller and Peter D. Welch", TITLE="Statistical results on control variables with application to queueing network simulation", INSTITUTION="IBM Watson Research Center", ADDRESS="Yorktown Heights, NY", YEAR=1982, REFERENCES=19, KEYWORDS="Method; application; simulation; confidence interval; variance; queueing network", ABSTRACT="The development and application of control variables for variance reduction in the simulation of a wide class of closed queueing networks is discussed. These networks allow multiple types of customers, priorities and blocking. Alternative methods of generating confidence intervals from independent replications of a simulation are investigated. A result is given which quantifies the loss in variance reduction caused by the estimation of the opti", } @TECHREPORT{Lave82:Variance, AUTHOR="S. S. Lavenberg and Peter D. Welch", TITLE="Variance reduction techniques", INSTITUTION="IBM WATSON RESEARCH CENTER", ADDRESS="Yorktown Heigths, NY", YEAR=1982, REFERENCES=9, KEYWORDS="Application; method; confidence interval; variance; simulation; variance reduction", ABSTRACT="Anyone having a problem simulating rare events or having a simulation which is terminated by some frequently occuring event before a rarer event can occur should look over these papers.", } @ARTICLE{Laza82:Optimal, AUTHOR="Aurel A. Lazar", TITLE="Optimal control of a {M/M/M} queue", JOURNAL=per, VOLUME=11, PAGES="14-20", YEAR=1982, REFERENCES=7, KEYWORDS="M/M/N/S; window mechanism; optimal control", ABSTRACT="The problem of optimal control of a M/M/M queueing system is investigated. As in the M/M/1 case the optimum control is shown to be a window type mechanism. The window size $L$ depends on the maximum allowable time delay $T$ and can be explicitly computed. The throughput time delay function of the M/M/M system is briefly discussed.", } @ARTICLE{Leon82:Methods, AUTHOR="Alberto Leon-Garcia and Raymond Kwong and G. Williams", TITLE="Performance Evaluation Methods for an Integrated Voice/Data Link", JOURNAL=ieeecom, VOLUME="COM-30", NUMBER=8, PAGES="1848-1858", YEAR=1982, REFERENCES=17, KEYWORDS="Approximation; packet voice; circuit switching; packet switching; queueing system; performance evaluation; voice/data integration", ABSTRACT="This paper presents an approximation method for estimating the average number of data packets in a SENET-concept integrated voice and dat system. The method is simple to use and its estimates are found to be in good agreement with simulation results. In general, the method applies to any system that integrates packet traffic with a more slowly varying traffic class that can preempt a portion of the packet transmission capacity.", } @ARTICLE{Leun82:Complexity, AUTHOR="J. Y.-T. Leung and J. Whitehead", TITLE="On the complexity of fixed-priority scheduling of periodic, real-time tasks", JOURNAL=pe, VOLUME=2, PAGES="237-250", YEAR=1982, REFERENCES=8, KEYWORDS="Priority; multiprocessing; process management; fixed-priority scheduling; real time; NP problem", ABSTRACT="We consider the complexity of determining whether a set of periodic, real-time tasks can be scheduled on m>1 identical processors with respect to fixed-priority scheduling. It is shown that the problem is NP-hard in all but one special case. The complexity of optimal fixed-priority scheduling algorithm is also discussed.", } @ARTICLE{Li82:Shortest, AUTHOR="Lianyuan Li and Herman Hughes and L. H. Greenberg", TITLE="Performance analysis of a shortest-delay protocol", JOURNAL=cn, VOLUME=6, PAGES="189-200", YEAR=1982, REFERENCES=14, KEYWORDS="Protocol engineering; delay; performance evaluation", } @MISC{Limb82:Special, AUTHOR="John Limb", TITLE="Special issue communications in the automated office", PUBLISHER="ieeecom", VOLUME="COM-30", PAGES="1-125", YEAR=1982, KEYWORDS="Packet switching; LAN; CSMA; carrier sense multiple access; PABX; private network; information system; text processing; special issue; cost; future outlook; survey; bibliography; office automation; facsimile; voice storage", ABSTRACT="Contributions to this issue: local networks: 1 paper; communication models: 3 papers; electronic mail: 4 papers; managing communications: 3 papers; message preparation: 3 papers; human-machine communication: 2 papers", } @ARTICLE{Limb82:Description, AUTHOR="John Limb and C. Flores", TITLE="Description of {FASNET} - a unidirectional local-area communications network", JOURNAL=bstj, VOLUME=61, NUMBER=7, PAGES="1413-1440", YEAR=1982, REFERENCES=16, KEYWORDS="LAN; ring network; communication protocol; Ethernet; packet switching; token system", ABSTRACT="Fasnet is an implicit token-passing, local-area network aimed at supporting high data rates and carrying a wide mix of traffic (data, voice, video, and facsimile). Transmission is unidirectional with stations attaching to the medium passively via directional couplers. A link consists of two lines, one to carry traffic in each direction.", } @INPROCEEDINGS{Lin82:X, AUTHOR="Wen-Tsung Lin and Cheng-Shong Wu", TITLE="Design of a $2x2$ Fault-Tolerant Switching Element", BOOKTITLE="9th Annual Symposium on Computer Architecture", PAGES="181-189", YEAR=1982, REFERENCES=18, KEYWORDS="Interconnection Network", } @ARTICLE{Livn82:Load, AUTHOR="M. Livny and M. Melman", TITLE="Load balancing in homogeneous broadcast distributed systems", JOURNAL=per, VOLUME=11, PAGES="47-55", YEAR=1982, REFERENCES=10, KEYWORDS="CSMA; carrier sense multiple access; analytical model; broadcast; communication; simulation; load balancing", ABSTRACT="Three different load balancing algorithms for distributed syst ems that consist of a number of identical processors and a CSM A communication system are presented in this paper. Some of the properties of a multi-resource system and the balancing process are demonstrated by an analytic model. Simulation is used as a mean for studying the interdependency between the parameters of the distributed system and the behaviour of the balancing algor", } @ARTICLE{Low82:Berechnung, AUTHOR="K. Löw and R. W. Lorenz", TITLE="Berechnung der Versorgung von Funkzonen für den Mobilfunk mit Hilfe einer topographischen Datenbank", JOURNAL="Frequenz", PAGES="116-121", YEAR=1982, LANGUAGE="German", REFERENCES=10, KEYWORDS="Mobile radio; MAT; topographical database", } @ARTICLE{Luna82:Mobile, AUTHOR="R. S. Lunayach and others", TITLE="Analysis of a mobile radio communication system with two types of customers and priority", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="2470-2475", YEAR=1982, KEYWORDS="Queueing theory; nonpreemptive priority; M/M/N; cut-off priority; loss system", ANNOTE="Remarks by K. Kawashima", } @ARTICLE{Ma82:Impact, AUTHOR="Jian Ma", TITLE="On the impact of {HDLC} zero insertion and deletion on link utilization and reliability", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="375-381", YEAR=1982, REFERENCES=4, KEYWORDS="HDLC; communication protocol; channel utilization; reliability", ABSTRACT="In HDLC, a zero is inserted after every five consecutive ``ones'' in order to resolve ambiguity about the location of delimiters. In this paper. We generalize the number ``five'' as an arbitrary positive integer $n$ and study the impacts of $n$ on the link utilization for a noiseless channel and on the reliability for a noisy channel.", } @ARTICLE{Mann82:Entwurf, AUTHOR="R. Männer and W. Saaler and T. Sauer and P. v Walter and B. Deluigi", TITLE={Entwurf und Realisation des schnellen, flexiblen und fehlertoleranten Polyprozessors "Heidelberger Polyp"}, JOURNAL=er, VOLUME=24, PAGES="157-175", YEAR=1982, LANGUAGE="German", KEYWORDS="Parallel computing; fault tolerance; reliability", } @ARTICLE{Maxe82:Variation, AUTHOR="Nick Maxemchuk", TITLE="A variation on {CSMA/CD} that yields movable tdm slots in integrated voice/data local networks", JOURNAL=bstj, VOLUME=61, NUMBER=7, PAGES="1527-1550", YEAR=1982, REFERENCES=17, KEYWORDS="LAN; CSMA; carrier sense multiple access; packet switching; mixed voice and data network", ABSTRACT="A variation on the carrier-sense, multiple-access/ collision-detection (csma/cd) protocol for local area, random access broadca st networks is presented. The new protocol supports any mix of voice and data traffic, and has an upper bound on the delay of periodic traffic. In conventional csma/cd systems, statistical f'uctuations in the transmission delay may cause distributions in reconstructed voice waveforms. This does not occur with the new p", } @BOOK{McNa82:Technical, AUTHOR="J. E. McNamara", TITLE="Technical aspects of data communications", EDITION=2, PUBLISHER="Digital Press", ADDRESS="Bedford, Massachusetts", PAGES="1-330", YEAR=1982, KEYWORDS="Reference; data transmission", } @ARTICLE{McGr82:Concentrator, AUTHOR="P. McGregor", TITLE="Concentrator modeling with pipelining arrivals compensation", JOURNAL=per, VOLUME=11, PAGES="73-94", YEAR=1982, REFERENCES=39, KEYWORDS="Model; performance evaluation; concentrator; performance measure; M/M/N/S; overflow; network delay", ABSTRACT="A general model of intelligent communications concentrating devices (ICCD) is presented and analyzed for delay and overflow performance with compensation for the pipelining effect of message arrivals extending over time. The results of the analysis indicate that, for the same trunk utilization, the trend towards buffered terminals with longer messages requires substantially greater buffering in the ICCD.", } @ARTICLE{McKe82:Integral, AUTHOR="J. McKenna and Debasis Mitra", TITLE="Integral representations and asymptotic expansions for closed Markovian queueing networks: normal usage", JOURNAL=bstj, VOLUME=61, NUMBER=5, PAGES="661-683", YEAR=1982, REFERENCES=26, KEYWORDS="Markov process; exponential queueing network; closed queueing network; computer network; integral representation; asymptotic expansion", ABSTRACT="In designing a computer system, it is vitally important to be able to predict the performance of the system. However, until now the computations involved were not feasible for large systems which call for models with many processing centers and many jobs distributed over many classes. We give a radically new approach for handling such large networks - an approach that begins with a representation of the quantities of interest as ratios of integ", } @ARTICLE{Meye82:Computing, AUTHOR="M. H. Meyers", TITLE="Computing the distribution of a random variable via {Gaussian} quadrature rules", JOURNAL=bstj, VOLUME=61, NUMBER=9, PAGES="2245-2261", YEAR=1982, REFERENCES=20, KEYWORDS="method; moment approximation; quadrature rule; distribution; approximation", ABSTRACT="Using the technique of gaussian quadrature rules, a new estimator is proposed for approximating the distribution of a random variable given only a finite number of its moments. The estimator is shown by numerous examples to be accurate on the tails of both continuous and discrete distributions.", } @ARTICLE{Mink82:Modular, AUTHOR="A. Mink and C. B. Silio", TITLE="Modular expansion in a class of homogeneous networks", JOURNAL=per, VOLUME=11, PAGES="95-100", YEAR=1982, REFERENCES=15, KEYWORDS="Computer network; closed queueing network; performance measure; model; resource sharing; modular expansion", ABSTRACT="We consider a special class of homogeneous computer network comprising several essentially identical but independent computing systems (icss) sharing a single resource. Of interest here are the effects of modularly expanding the network by adding icss. We use a previously presented approximate queueing network model to analyze modular expansion in this class of network. The performance measure used in this analysis is the mean cycle time, which", } @ARTICLE{Moll82:Using, AUTHOR="M. K. Molloy", TITLE="Performance analysis using stochastic Petri nets", JOURNAL=ieeetc, ADDRESS="Austin", VOLUME="C-31", PAGES="913-917", YEAR=1982, REFERENCES=21, KEYWORDS="Petri net; modeling; prediction; Markov process; alternating bit protocol; performance evaluation; TPN; timed Petri net; Markov system", ABSTRACT="An isomorphism between the behaviour of Petri nets with exponentially distributed transition rates and Markov processes is presented. In particular, k-bounded Petri nets are isomorphic to finite Markov processes and can be solved by standard techniques if $k$ is not too large. As a practical example, we solve for the steady state average message delay and throughput on a communication link when the alternating bit protocol is used for error", } @ARTICLE{More82:Robust, AUTHOR="J. P. Moreland", TITLE="A robust sequential projection algorithm for traffic load forecasting", JOURNAL=bstj, VOLUME="jan", PAGES="15-38", YEAR=1982, REFERENCES=7, KEYWORDS="Carried traffic; network theory; forecasting; Kalman filter", ABSTRACT="Forecasts of busy season trunk group traffic loads are required for planning the Bell system's message network.", } @ARTICLE{Morr82:Traffic, AUTHOR="J. A. Morrison and Paul Wright", TITLE="A traffic overflow system with a large primary queue", JOURNAL=bstj, VOLUME=61, NUMBER=7, PAGES="1487-1517", YEAR=1982, REFERENCES=8, KEYWORDS="M/M/N; overflow; queueing network; buffer length", ABSTRACT="We analyze a traffic overflow system that consists of two groups of trunks, with waiting spaces for each group, and some overflow capability from the primary to the secondary group. We consider the case in which the number of waiting spaces in the primary queue is large compared to the corresponding number in the secondary queue and to the number of trunks in the secondary groups.", } @ARTICLE{Nayl82:Stream, AUTHOR="W. E. Naylor and Leonard Kleinrock", TITLE="Stream traffic communication in packet switched networks: destination buffering considerations", JOURNAL=ieeecom, VOLUME="COM-30", PAGES="2527-2534", YEAR=1982, REFERENCES=11, KEYWORDS="Packet switching; buffer memory; buffer length; stream traffic; packet voice; jitter", ABSTRACT="In this paper we consider the problem of sending a stream of data (speech, for example) trough a packet-switched network which introduces variable source-to-destination delays for different packets of the stream. Ideally, this delay difference should be smoothed so as to preserve the continuity of the stream. We investigate an adaptive destination buffering scheme which may be used to achieve the smoothing of the output stream. The schemen us", } @BOOK{Newe82:Applications, AUTHOR="G. F. Newell", TITLE="Applications of queueing theory", PUBLISHER="Chapman and Hall", ADDRESS="London", PAGES=303, YEAR=1982, REFERENCES=100, KEYWORDS="Queueing system", } @MISC{Anon82:NTG, AUTHOR="N. T. Z Fachausschuss 6 und der 30 NTG", TITLE="{NTG-Empfehlung} 3004: Zuverlässigkeitsbegriffe im Hinblick auf komplexe Software und Hardware", VOLUME=35, PAGES="325-333", YEAR=1982, LANGUAGE="German", KEYWORDS="Reliability", } @BOOK{INRI82:Abstracts, AUTHOR="I. N. RIA", TITLE="Abstracts", PUBLISHER="INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE", ADDRESS="Le Chesnay Cedex", PAGES="1-117", YEAR=1982, LANGUAGE="English, French", REFERENCES=250, KEYWORDS="Bibliography; communication network; information system; satellite radio; packet switching", ABSTRACT="The attached listing presents abstract of selected reports produced within the Cyclades, Sirius, Kayak, Sol, Nadir and Rhin projects, and some other useful reports.", } @ARTICLE{Sigs82:KWIC, AUTHOR="S. I. GSAM", TITLE="{KWIC} index of {SIGSAM} bulletin abstracts (1978-1981)", JOURNAL=sigsam, VOLUME=16, PAGES="15-36", YEAR=1982, KEYWORDS="bibliography; symbolic algebraic computation; REDUCE", } @BOOK{Nuss82:Fast, AUTHOR="H. J. Nussbaumer", TITLE="Fast Fourier Transform and Convolution Algorithms", PUBLISHER="Springer-Verlag", YEAR=1982, KEYWORDS="Mathematics", } @ARTICLE{Oklo82:Square, AUTHOR="V. G. Oklobdzija and M. D. Ercegovac", TITLE="An on-line square root algorithm", JOURNAL=ieeetc, VOLUME="C-31", PAGES="70-75", YEAR=1982, REFERENCES=17, KEYWORDS="floating point; application; method", ABSTRACT="In this correspondence a systematic derivation of an on-line square root algorithm is presented. The algorithm operates on variables represented in the normalized radix $r$ floating-point system in a digit-by-digit fashion with an on-line delay of 1. The approach used in deriving the square root algorithm is described in detail. The basic characteristics of hardware-level implementation are also discussed.", } @PHDTHESIS{Over82:Model, AUTHOR="C. Overstreet", TITLE="Model specification and analysis for discrete event simulation", SCHOOL="Virginia Polytechnic Institute and State University", ADDRESS="New York", PAGES=379, YEAR=1982, KEYWORDS="Distributed simulation", ABSTRACT="Several authors assert that any significant improvement iefficiency in the development and utilization of simulation moderequires the assistance of a Model Management System to much of the process. This work develops one aspect of such systetools fundamental to the specification and analysis of dievent models. A model specification language is developed allows analysis of a model specification as the specification", } @ARTICLE{Pack82:Kalman, AUTHOR="C. D. Pack and B. A. Whitaker", TITLE="Kalman filter models for network forecasting", JOURNAL=bstj, VOLUME="jan", PAGES="1-14", YEAR=1982, REFERENCES=15, KEYWORDS="Network planning; forecasting; Kalman filter; estimation", ABSTRACT="The Bell system has recently completed studies that are expected to result in substantially improved forecasts for use in networkplanning.", } @ARTICLE{Paus82:Weg, AUTHOR="H. Pausch", TITLE="Der Weg zur weltweiten Numerierung", JOURNAL=fernmelde, VOLUME=36, NUMBER=1, YEAR=1982, LANGUAGE="German", KEYWORDS="Switching system; telephony", } @ARTICLE{Pave82:Computer, AUTHOR="R. Pavelle and M. Rothstein and J. Fitch", TITLE="Computer-Algebra", JOURNAL="Spektrum der Wissenschaft", PAGES="70-78", YEAR=1982, LANGUAGE="German", KEYWORDS="Survey; symbolic algebraic language; symbolic algebraic computation", ABSTRACT="Populärwissenschaftliche darstellung: Sinn und Zweck der Computer-Algebra; wie ein Algebra-Programm vorgeht; Darstellung algebraischer Ausdruecke im Computer; das Problem der unbegrenzten Genauigkeit; Typen von Computer-Algebra-Programmen; Anwendungsgebiete.", } @ARTICLE{Pern82:Funkfernsprechnetz, AUTHOR="F. Pernice", TITLE="Das Funkfernsprechnetz C der {DBP}", JOURNAL="Frequenz", VOLUME=36, PAGES="90-99", YEAR=1982, LANGUAGE="German", KEYWORDS="Mat", } @ARTICLE{Pode82:Measure, AUTHOR="R. L. Podell", TITLE="A Measure of Effectiveness for Telecommunications", JOURNAL=jtn, PAGES="371-384", YEAR=1982, REFERENCES=17, KEYWORDS="Communication network; performance evaluation", } @ARTICLE{Rama82:Overview, AUTHOR="K. K. Ramakrishnan and Debasis Mitra", TITLE="An overview of {PANACEA,} a software package for analyzing Markovian queueing networks", JOURNAL=bstj, VOLUME=61, NUMBER=10, PAGES="2849-2872", YEAR=1982, REFERENCES=25, KEYWORDS="Exponential queueing network; Markov process; numerical integration; product form", ABSTRACT="PANACEA is a software package that significantly extends the range of Markovian queueing networks that are computationally tractable. It solves multi-class closed, open, and mixed queueing networks. Based on an underlying theory of integral representations and asymptotic expansions, PANACEA solves queueing networks that are orders of magnitude large than can be solved by other established algorithms.", } @ARTICLE{Rama82:Slotted, AUTHOR="D. V. Ramana and V. V. S. Sarma", TITLE="Performance of slotted {ALOHA} satellite channels with finite buffer", JOURNAL="IEE proceedings part F", VOLUME=29, NUMBER=1, PAGES="19-24", YEAR=1982, KEYWORDS="Packet radio; slotted ALOHA; performance evaluation", } @ARTICLE{Rao82:Monitoring, AUTHOR="Srinivasan Rao and others", TITLE="Performance monitoring of the {EC} 1030 system by a microprocessor-based monitor", JOURNAL="Microprocessors-microcomputers", VOLUME=6, PAGES="183-188", YEAR=1982, KEYWORDS="Hardware monitor; microprocessor", } @ARTICLE{Rein82:Analytische, AUTHOR="K. Reinschke", TITLE="Analytische Behandlung von Mehrzustands-Zuverlässigkeitsmodellenbei nicht exponentialverteilten Verweildauern in den einzelnen Zuständen", JOURNAL=nte, VOLUME=32, NUMBER=12, PAGES="513-520", YEAR=1982, LANGUAGE="German", REFERENCES=7, KEYWORDS="Stochastic Process; Reliability; non-Markov Process", } @ARTICLE{Robe82:Packet, AUTHOR="L. G. Roberts", TITLE="Packet switching economics", JOURNAL=ericssonr, VOLUME=3, PAGES="128-128", YEAR=1982, KEYWORDS="Packet switching", } @ARTICLE{Rohr82:Local, AUTHOR="K. M. Röhr and H. Sadlowski", TITLE="Performance analysis of local communication loops", JOURNAL=per, VOLUME=11, PAGES="119-129", YEAR=1982, REFERENCES=7, KEYWORDS="ring network; performance evaluation; utilization; overflow; oss probability; overhead", ABSTRACT="The communication loops analyzed here provide an economic way of attaching many different terminals which may be some kilometers away from a host processor. Main potential bottlenecks were found to be the loop transmission speed, the loop adapter processing rate, and the buffering capability, all of which are analyzed in detail. The buffer overrun probabilities are found by convolving individual buffer usage densities and by assuming over the t", } @ARTICLE{Rubi82:Improved, AUTHOR="J. Rubin and C. H. West", TITLE="An Improved Protocol Validation Technique", JOURNAL=cn, VOLUME=6, NUMBER=2, PAGES="65-73", YEAR=1982, REFERENCES=14, KEYWORDS="Protocol Specification", } @INPROCEEDINGS{Runk82:Experience, AUTHOR="D. Runkel", TITLE="Experience with and performance measurements of the packet switching network in the Federal Republic of Germany", BOOKTITLE=iccc, PAGES="253-257", YEAR=1982, KEYWORDS="Packet switching; DATEX-P", } @ARTICLE{Rusc82:Job, AUTHOR="M. Ruschitzka", TITLE="The performance of job classes with distinct policy functions", JOURNAL=jacm, VOLUME=29, PAGES="514-526", YEAR=1982, REFERENCES=10, KEYWORDS="M/G/1; processor sharing; time in system; priority; queueing discipline; policy function", ABSTRACT="Policy function schedulers provide a flexible framework for specifying the response behavior of a system. The latter is often expressed in terms of a response function, the equilibrium residence time of a job conditioned on its service requirement. Jobs of different classes typically require different responses and thus different policy functions. The relation between a set of policy functions (one per class) and the resulting set of response f", } @ARTICLE{Same82:Note, AUTHOR="C. L. Samelson and W. G. Bulgren", TITLE="A note on product-form solution for queuing networks with Poisson arrivals and general service-time distributions with finite means", JOURNAL=jacm, VOLUME=29, PAGES="830-840", YEAR=1982, KEYWORDS="Queueing network; product form; network; local balance", ABSTRACT="The steady-state joint probability distribution of queue lengths is obtained for queuing networks with possion arrivals in which some of the service-time distribution functions are general (e.g., not even differentiable). In particular, an analytical model for queuing networks which is more general than those considered to date is produced by using the concept of generalized function. Previous results on the relationships between the properties", } @TECHREPORT{Saue82:Research, AUTHOR="C. H. Sauer and E. A. Mac Nair and James F. Kurose", TITLE="The research queueing package - past, present and future", INSTITUTION="IBM T. Watson Research Center", ADDRESS="Yorktown Heights, New York", YEAR=1982, REFERENCES=22, KEYWORDS="Survey; simulation; queueing network; programming language; design; human factors; future outlook; modeling", ABSTRACT="Queueing networks are important as performance models of systems where performance is principally affected by contention for resources. Such systems include computer systems, communication networks, office systems and manufacturing lines. In order to effectively use queueing networks as performance models, appropriate software necessary for definition of the networks to be solved, for solution of the networks (by numerical, approximate and/or s", } @ARTICLE{Saul82:Funk, AUTHOR="G. Saulich", TITLE="Funkübertragung im Frequenzbereich 800-950 {MHz} für mobile Anwendungen", JOURNAL="Frequenz", PAGES="110-115", YEAR=1982, LANGUAGE="German", REFERENCES=16, KEYWORDS="MAT; transmission system", } @ARTICLE{Schm82:Batch, AUTHOR="B. W. Schmeiser", TITLE="Batch size effects in the analysis of simulation output", JOURNAL=or, VOLUME=30, PAGES="556-568", YEAR=1982, KEYWORDS="Output analysis; fundamentals in statistics; time series analysis", ABSTRACT="Batching is a commonly used method for calculating confidence intervals on the mean of a sequence of correlated observations arising from a simulation experiment. Serval recent papers have considered the effect of using batch sizes too small to satisfy assumptions of normality and/or independence, and the rsulting incorrect probabilities of the confidence interval covering the mean. This paper quantifies the effects of using batch sizes larger", } @ARTICLE{Schm82:Bestimmung, AUTHOR="Bertil Schmidt", TITLE="Die Bestimmung der Konfidenzintervalle in der Simulation", JOURNAL=er, VOLUME=24, NUMBER=3, PAGES="118-124", YEAR=1982, LANGUAGE="German", REFERENCES=9, KEYWORDS="Simulation; GPSS-Fortran; confidence interval; statistics", } @ARTICLE{Schr82:Generalized, AUTHOR="F. Schreiber", TITLE="Generalized equations for the objective empirical distribution function", JOURNAL=aeu, VOLUME=36, PAGES="168-172", YEAR=1982, REFERENCES=9, KEYWORDS="Statistics; Bayes statistics", } @ARTICLE{Schu82:Innere, AUTHOR="M. Schumann", TITLE="Die innere Blockierung von Koppelnetzen mit hohem Multiplexfaktor für 280 Mbit/s", JOURNAL=ntz, VOLUME=4, NUMBER=8, PAGES="247-251", YEAR=1982, LANGUAGE="German", REFERENCES=3, KEYWORDS="Switching network; blocking; TDM; time division multiplex", } @MISC{Shan82:Priority, AUTHOR="J. G. Shanthikumar and others", TITLE="A priority cutoff flow control scheme for integrated voice-data multiplexers", PAGES="8-13", YEAR=1982, REFERENCES=22, KEYWORDS="Flow control; multiplexer; queueing theory; performance evaluation; voice/data integration", } @ARTICLE{Shor82:Information, AUTHOR="J. E. Shore", TITLE="Information theoretic approximations for {M/G/1} and {G/G/1} queuing systems", JOURNAL=acta, VOLUME=17, PAGES="43-61", YEAR=1982, REFERENCES=34, KEYWORDS="M/G/1; G/G/1; information theory; queueing approximation", ABSTRACT="This paper presents new results concerning the use of information theoretic inference techniques in system modeling and concerning the widespread applicability of certain simple queuing theory formulas. For the case when an m/g/1 queue provides a reasonable system model but when information about the service time probability density is limited to knowledge of a few moments, entropy maximization and cross-entropy minimization are used to derive", } @INPROCEEDINGS{Swob82:Leistungsvergleich, AUTHOR="J. Swoboda", TITLE="Leistungsvergleich lokaler Netze für die digitale, dienstintegrierte Kommunikation", BOOKTITLE="Online", ADDRESS="Düsseldorf, Germany", YEAR=1982, LANGUAGE="German", KEYWORDS="LAN; performance evaluation", } @ARTICLE{Thar82:Updating, AUTHOR="A. K. Thareja and Satish K. Tripathi and R. A. Upton", TITLE="On updating buffer allocation", JOURNAL=per, VOLUME=11, PAGES="101-110", YEAR=1982, REFERENCES=9, KEYWORDS="Carried traffic; buffer memory; performance evaluation; resource sharing; buffer; allocation", ABSTRACT="Most of the analysis of buffer sharing schemes has been aimed at obtaining the optimal operational parameters under stationary load situations. It is well known that in most operating environments the traffic load changes. In this paper, we address the problem of updating buffer allocation as the traffic load at a network node changes. We investigate the behavior of a complete partitioning buffer sharing scheme to gain insight into the dependen", } @TECHREPORT{Tran82:Uberlastprobleme, AUTHOR="Phuoc Tran-Gia", TITLE="Überlastprobleme in rechnergesteuerten Fernsprechvermittlungssystemen --- Modellbildung und Analyse", TYPE="Bericht über verkehrstheoretische Arbeiten, IND", INSTITUTION="Universität-GH Siegen", ADDRESS="Siegen", NUMBER=36, PAGES=173, YEAR=1982, LANGUAGE="German", REFERENCES=75, KEYWORDS="Queueing system; overload control; switching system; modeling", } @ARTICLE{Hoor82:Approximations, AUTHOR="M. van Hoorn and H. Tijms", TITLE="Approximations for the waiting time distribution of the {M/G/C} queue", JOURNAL=pe, VOLUME=2, PAGES="22-28", YEAR=1982, REFERENCES=1, KEYWORDS="M/G/N; queueing approximation; waiting time; distribution", ABSTRACT="Van Hoorn and Tijms present an approximate analysis of the waiting time distribution of the M/G/C queue. The most important results used during their derivation is an approximation for the queue size probabilitiy of the M/G/C queue, published in their earlier paper. The approximation for the waiting time distribution is given in the form of a defective renewal equation. The authors include a discussion of a numerical procedure to solve this equation.", } @ARTICLE{Whit82:Approximating, AUTHOR="Ward Whitt", TITLE="Approximating a Point Process by a Renewal Process, {I:} Two basic Methods", JOURNAL=or, VOLUME=30, PAGES="125-147", YEAR=1982, REFERENCES=63, KEYWORDS="Analysis; Queueing system; superposition; point process; stochastic process", } @ARTICLE{Wong82:Queueing1, AUTHOR="Jackson Wong and Simon Lam", TITLE="Queueing Network Models of Packet Switching Networks Part 1: Open Networks", JOURNAL=pe, VOLUME=2, PAGES="9-21", YEAR=1982, KEYWORDS="Queueing network; packet switching; routing algorithm; end-to-end delay; capacity assignment; fairness", ABSTRACT="An overview of the application of product-form queuing network models to the performance analysis of store-and-for ward packet -switching networks is presented. Multiple routing chains are used to model the different routing behaviors of data packets . Queuing networks with open chains are considered in this paper. Kleinrock`s formula for the mean end-to-end delay of packets is first derived.", } @ARTICLE{Ma82:Task, AUTHOR="P. R. Ma and E. Lee and M. Tsuchiya", TITLE="A Task Allocation Model for Distributed Computing Systems", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=1, PAGES="41-59", YEAR=1982, KEYWORDS="Parallel computing; interprocess communication; load balancing; NP problem; pipeline processing", ABSTRACT="This paper presents a task allocation model that allocates application tasks among processors in distributed computing systems satisfying: 1) minimum interprocessor communication cost, 2) balanced utilization of each processor, and 3) all engineering application requirements.", } @ARTICLE{Adam82:Extra, AUTHOR="G. C. Adams and H. J. Siegel", TITLE="The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems", JOURNAL=ieeetc, VOLUME="C-31", NUMBER=5, PAGES="443-454", YEAR=1982, KEYWORDS="Multiprocessor system; fault tolerance; interconnection network; omega network; parallel computing", ABSTRACT="The Extra Stage Cube interconnection network, a fault-tolerant structure, is proposed for use in large-scale parallel and distributed supercomputer systems. It has all of the interconnecting capabilites of the multistage cube-type networks that have been proposed for many supersystems. The ESC is derived from the Generalized cube network by the addition of one stage of interchangeboxes and a bypass capability for two stages.", } @MISC{Bezi82:Adapting, AUTHOR="J. Bézivin and H. Imbert", TITLE="Adapting a Simulation Language to a Distributed Environment", PAGES="596-603", YEAR=1982, REFERENCES=11, KEYWORDS="distributed simulation", ABSTRACT="The simulation language Simone (a Pascal based parallel simulation language) is presented. It differs from other distributed simulation schemes because we propose a global approach allowing to write a simulation program without regard to the actual configuration on which it will run, an anticipation mechanism that maximizes the parallel execution of simulation processes and a distributed algorithm with low overhead.", } @ARTICLE{Czaj82:Optimierung, AUTHOR="R. Czajor and N. Mehlhorn", TITLE="Optimierung und Effektivitätsvergleich von leitungsvermittelten und paketvermittelten Datennetzen", JOURNAL="Mitteilungen aus dem I.P.F.", PAGES="12-21 (H.3)", YEAR=1982, LANGUAGE="German", KEYWORDS="packet switching", } @ARTICLE{Dahm82:EDV, AUTHOR="U. Dahm", TITLE="{EDV-Programm} zur Lösung der {MPJ-Verlustformel}", JOURNAL=fernmeldepraxis, VOLUME=59, NUMBER=5, YEAR=1982, LANGUAGE="German", KEYWORDS="Grading", } @ARTICLE{Eing82:Neues, AUTHOR="H. M. S. Eing and H. J. Wilhelm", TITLE="Das {SP-Netz:} ein neues, vielversprechendes lokales Netzwerk {(LAN)}", JOURNAL="Elektronik", VOLUME=8, NUMBER=23, YEAR=1982, LANGUAGE="German", KEYWORDS="Overload control; flow control; communication network", } @ARTICLE{Kash82:Effects, AUTHOR="A. Kashper and S. M. Rocklin and C. R. Szelag", TITLE="Effects of Day-to-Day Load Variation on Trunk Group Blocking", JOURNAL=bstj, VOLUME=61, NUMBER=2, YEAR=1982, KEYWORDS="Gos", } @ARTICLE{Mase82:Adaptive, AUTHOR="Kenichi Mase and M. Mose", TITLE="An Adaptive Capacity Allocation scheme in Telephone Networks", JOURNAL=ieeecom, VOLUME="COM-30", NUMBER=2, YEAR=1982, KEYWORDS="Gos", } @ARTICLE{Maus82:Voraussch, AUTHOR="M. Mauser", TITLE="Die Vorausschätzung der Verkehrswerte und des Leitungsbedarfs in Ortsnetzen", JOURNAL=fernmeldepraxis, VOLUME=59, NUMBER=15, YEAR=1982, LANGUAGE="German", KEYWORDS="Overload control; flow control; communication network", } @ARTICLE{Rose82:Integration, AUTHOR="K.-H. Rosenbrock", TITLE="Integration von Diensten im {ISDN} der Deutschen Bundespost", JOURNAL=ntz, VOLUME=35, NUMBER=6, YEAR=1982, LANGUAGE="German", KEYWORDS="Overload control; flow control; communication network", } @ARTICLE{Veld82:Betrachtungen, AUTHOR="M. Velden", TITLE="Betrachtungen zum Fernwählnetz der Deutschen Bundespost", JOURNAL=fernmeldepraxis, VOLUME=59, NUMBER=10, YEAR=1982, LANGUAGE="German", KEYWORDS="Overload control; flow control; communication network", } @ARTICLE{Will82:Mathematisches, AUTHOR="H. Willie", TITLE="Mathematisches Modell von Vermittlungsnetzen mit hierarchischem und nichthierarchischem Verbindungsaufbau", JOURNAL=ntzarchiv, PUBLISHER="VDE-Verlag", VOLUME=4, NUMBER=5, YEAR=1982, LANGUAGE="German", KEYWORDS="Overload control; flow control; communication network", } @ARTICLE{Adir8201:Single, AUTHOR="I. Adiri and I. Domb", TITLE="A single server queueing system working under mixed priority disciplines", JOURNAL=or, VOLUME=30, NUMBER=1, PAGES="97-115", MONTH="January/February", YEAR=1982, KEYWORDS="Queueing system; priority; analysis", } @ARTICLE{Atki82:Simulation, AUTHOR="A. C. Atkinson", TITLE="The simulation of generalized inverse gaussian and hyperbolic random variables", JOURNAL="SIAM Journal on Scientific and Statistical Computing", VOLUME=3, NUMBER=4, PAGES="502-515", YEAR=1982, KEYWORDS="random variate generation", } @ARTICLE{Barb82:Computer, AUTHOR="G. Barbu", TITLE="On computer generation of [a] random variables by transformations of uniform variables", JOURNAL="Societatea de stiinte Matematice din Republica Socialista Romania", VOLUME=26, NUMBER=2, PAGES="129-139", YEAR=1982, KEYWORDS="random variate generation", } @INPROCEEDINGS{Chan82:Updating, AUTHOR="Tat Keung Chan and G. H. Golub and R. J. LeVeque", TITLE="Updating formulae and a pairwise algorithm for computing sample variances", BOOKTITLE="COMPSTAT , Part I: in Computational Statistics", PUBLISHER="Physica-Verlag, Wien", PAGES="30-41", YEAR=1982, KEYWORDS="Simulation; statistics; numeric calculation", } @ARTICLE{Devr82:Note, AUTHOR="L. Devroye", TITLE="A note on approximations in random variate generation", JOURNAL="Journal of Statistical Computation and Simulation", VOLUME=14, PAGES="149-158", YEAR=1982, KEYWORDS="random variate generation", } @ARTICLE{Eage82:Bound, AUTHOR="Derek Eager and Kenneth Sevcik", TITLE="Performance bound hierarchies for queuing networks (extended abstract)", JOURNAL=per, VOLUME=11, NUMBER=4, PAGES="213-214", MONTH="Winter", YEAR=1982, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Faki82:Expected, AUTHOR="D. Fakinos", TITLE="The expected remaining service time in a single server queue", JOURNAL=or, VOLUME=30, NUMBER=5, PAGES="1014-1018", YEAR=1982, } @ARTICLE{Funk82:Message, AUTHOR="G. Funk", TITLE="Message error detecting properties of {HDLC} protocols", JOURNAL=ieeecom, VOLUME="COM-30", NUMBER=1, PAGES="252-257", YEAR=1982, KEYWORDS="Performance evaluation; link layer; HDLC", } @BOOK{Gerk82:Neue, AUTHOR="P. Gerke", TITLE="Neue Kommunikationsnetze", PUBLISHER="Springer-Verlag", ADDRESS="Berlin", YEAR=1982, LANGUAGE="German", KEYWORDS="Communication network; ISDN", } @ARTICLE{Gree82:Limit, AUTHOR="L. Green", TITLE="A limit theorem on subintervals of interrenewal times", JOURNAL=or, VOLUME=30, NUMBER=1, PAGES="210-216", YEAR=1982, } @ARTICLE{John82:Developments, AUTHOR="N. L. Johnson", TITLE="Developments in discrete distributions, 1969-1980", JOURNAL="International Statistical Review", VOLUME=50, NUMBER=1, PAGES="71-101", YEAR=1982, KEYWORDS="random variate generation", } @ARTICLE{Koen82:Twenty, AUTHOR="E. Koenigsberg", TITLE="Twenty five years of cyclic queues and closed queue networks: A review.", JOURNAL=jors, VOLUME=33, NUMBER=7, PAGES="605-619", YEAR=1982, KEYWORDS="Queueing network; product form", } @ARTICLE{Krit82:Generalisation, AUTHOR="P. S. Kritzinger and S. van Wyk and A. Krzesinski", TITLE="A generalisation of Norton's theorem for multiclass queueing networks", JOURNAL=pe, VOLUME=2, NUMBER=2, PAGES="98-107", YEAR=1982, KEYWORDS="Queueing network; product form; aggregation", } @TECHREPORT{Krze82:Multiclass, AUTHOR="A. Krzesinski", TITLE="Multiclass Queueing Networks with State Dependent Routing", INSTITUTION="IBM Research Report RC-9761, Yorktown Heights, New York, Dec.", ADDRESS="Yorktown Heights", PAGES="1-38", YEAR=1982, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Law82:Confidence, AUTHOR="A. M. Law and W. David Kelton", TITLE="Confidence intervals for steady-state simulations {II:} A survey of sequential procedures", JOURNAL=ms, VOLUME=28, NUMBER=5, PAGES="550-562", YEAR=1982, KEYWORDS="Simulation; statistical technique; confidence interval", } @ARTICLE{Lazo82:Multiple, AUTHOR="E. D. Lazowska and J. L. Zahorjan", TITLE="Multiple class memory constrained queueing networks", JOURNAL=per, VOLUME=11, NUMBER=4, PAGES="130-140", MONTH="Winter", YEAR=1982, KEYWORDS="Queueing network; analysis", } @ARTICLE{Mari82:Extensions, AUTHOR="Raymond Marie and P. M. Snyder and W. J. Stewart", TITLE="Extensions and computational aspects of an iterative method", JOURNAL=per, VOLUME=11, NUMBER=4, PAGES="186-194", MONTH="Winter", YEAR=1982, KEYWORDS="Queueing network; analysis", } @ARTICLE{Meke82:Renewal, AUTHOR="M. S. Meketon and P. Heidelberger", TITLE="A renewal theoretic approach to bias reduction in regenerative simulations", JOURNAL=ms, VOLUME=28, NUMBER=2, PAGES="173-181", YEAR=1982, KEYWORDS="Simulation; statistical technique", } @TECHREPORT{Neus82:CORE, AUTHOR="D. Neuse", TITLE="An Implementation of the {CORE,} {SCAT,} and {LINEARIZER} Algorithms", INSTITUTION="Technical Report, Department of Computer Sciences, University of Texas, Austin", ADDRESS="Austin, Texas", YEAR=1982, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Neus82:HAM, AUTHOR="D. Neuse and K. M. Chandy", TITLE="{HAM:} The heuristic aggregation method", JOURNAL=per, VOLUME=11, NUMBER=4, PAGES="195-212", MONTH="Winter", YEAR=1982, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Pete82:Mixture, AUTHOR="A. V. Peterson and R. Kronmal", TITLE="On mixture methods for the computer generation of random variables", JOURNAL="The American Statistician", VOLUME=36, NUMBER=3, PAGES="184-191", YEAR=1982, KEYWORDS="random variate generation", } @ARTICLE{Schr8205:Detecting, AUTHOR="L. W. Schruben", TITLE="Detecting initialization bias in simulation output", JOURNAL=or, VOLUME=30, NUMBER=3, PAGES="569-590", MONTH="May/June", YEAR=1982, KEYWORDS="Simulation; statistical technique", } @TECHREPORT{Truo82:Leistungsfaehigkeit, AUTHOR="Hong Linh Truong", TITLE="Über die Leistungsfähigkeit von {HDLC-gesteuerten} Datenverbindungen", TYPE="Bericht über verkehrstheoretische Arbeiten", INSTITUTION={Institut für Nachrichtenvermittlung und Datenverarbeitung, Universit"at Stuttgart}, ADDRESS="Stuttgart, Germany", NUMBER=33, YEAR=1982, LANGUAGE="German", KEYWORDS="Performance evaluation; link layer; HDLC", } @ARTICLE{Wich82:Algorithm, AUTHOR="B. A. Wichmann and I. D. Hill", TITLE="Algorithm {AS} 183: An efficient and portable pseudo-random number generator", JOURNAL=as, VOLUME=31, NUMBER=2, PAGES="188-190", YEAR=1982, KEYWORDS="random number generation", } @ARTICLE{Brya82:Discrete, AUTHOR="R. M. Bryant", TITLE="Discrete system simulation in Ada", JOURNAL="Simulation", PAGES="111-121", YEAR=1982, REFERENCES=19, KEYWORDS="Discrete event simulation; software engineering; distributed simulation; ADA", ABSTRACT="Ada contains many features designed to facilitate the construction of software for embedded computer systems. Two particularly important features are task and packages. These features allow the construction of powerful, process-oriented, discrete-system simulation packages in Ada. We provide a design for such a package and illustrate its use.", } @INPROCEEDINGS{Cast82:Dynamic, AUTHOR="J. Castillo and Steven Smith", TITLE="Dynamic Routing in {WISPAC:} A Continuous Systems Simulation Machine", BOOKTITLE="3rd International Conference on Distributed Systems (IEEE)", PAGES="590-593", YEAR=1982, KEYWORDS="Distributed simulation", ABSTRACT="WISPAC is an MIMD machine designed for continuous systems simulation problems. A problem is mapped onto the set of processors under the assumption that the network conforms to the inter-process communications that are needed. This paper discusses considerations for dynamic routing and the results obtained from a set of simulation programs written for different models.", } @INPROCEEDINGS{Chri82:Structure, AUTHOR="T. W. Christopher and M. Evens and R. R. Gargeya and T. Leonhardt", TITLE="Structure of a distributed simulation system", BOOKTITLE="IEEE 3. International Conference on distributed Systems", PAGES="584-589", YEAR=1982, REFERENCES=9, KEYWORDS="Distributed simulation", ABSTRACT="We take the transactions-oriented approach in distributing a queueing systems simulation program over a network of computers. The problem to keep all processors busy is solved by runing the transactions with different simulation time as long as these transaction do not affect one another. A algorithm is presented, that determines how long the transactions can safely run until they need to communicate.", } @MANUAL{IBM82:Systems, AUTHOR="{I. B. M}", TITLE="Systems Network Architecture: Transaction Programmer's Reference Manual for {LU} Type 6.2", YEAR=1982, } @TECHREPORT{Wats82:Connection, AUTHOR="R. W. Watson and others", TITLE="Connection Mangement and Key Distribution Protocols", INSTITUTION="Lawerence Livermore Laboratory", NUMBER="UCRL-88345", YEAR=1982, } @ARTICLE{Gran82:X25, AUTHOR="Alex Grant and David Hutchison", TITLE="{X25} protocols and local area networks", JOURNAL=cn, VOLUME=6, PAGES="255-262", YEAR=1982, } @ARTICLE{Mimi82:Datagram, AUTHOR="O. Mimica and B. Marsden", TITLE="A datagram based network architecture for microcomputers", JOURNAL=comcom, VOLUME=5, PAGES="128-139", YEAR=1982, } @ARTICLE{Land82:Use, AUTHOR="Lawrence H. Landweber", TITLE="Use of Multiple Networks in {CSNET}", JOURNAL="CSNET Design", VOLUME="DN-1", YEAR=1982, } @ARTICLE{Bert82:Dynamic, AUTHOR="Dimitri Bertsekas", TITLE="Dynamic Behaviour of Shortest Path Routing Algorithms for Communication Networks", JOURNAL=ieeeac, VOLUME="AC-27", PAGES="60-74", YEAR=1982, } @ARTICLE{Andr82:Distributed, AUTHOR="G. R. Andrews", TITLE="The Distributed Programming Language {SR} - Mechanisms, Design and Implementation", JOURNAL=spe, VOLUME=12, PAGES="719-753", YEAR=1982, } @BOOK{Barn82:Programming, AUTHOR="J. Fritz Barnes", TITLE="Programming in {ADA}", PUBLISHER="Addison-Wesley", ADDRESS="London", YEAR=1982, } @BOOK{Ben82:Principles, AUTHOR="M. Ben-Ari", TITLE="Principles of Concurrent Programming", ISBN="0-13-701078-8", PUBLISHER="Prentice-Hall International", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1982, } @ARTICLE{Brow82:Newcastle, AUTHOR="D. R. Brownbridge and L. F. Marshall and B. Randell", TITLE="The Newcastle Connection or {UNIXes} of the World Unite!", JOURNAL=spe, VOLUME=12, PAGES="1147-1162", YEAR=1982, } @BOOK{Cole82:Communications, AUTHOR="Robert Cole", TITLE="Communications", PUBLISHER="MacMillan", ADDRESS="London", YEAR=1982, } @BOOK{Cole82:Computer, AUTHOR="Robert Cole", TITLE="comcom", PUBLISHER="Macmillan", ADDRESS="London", YEAR=1982, } @ARTICLE{Cris82:Robust, AUTHOR="F. Cristian", TITLE="Robust Data Types", JOURNAL=acta, VOLUME=17, PAGES="365-397", YEAR=1982, } @ARTICLE{King82:Modelling, AUTHOR="P. King and I. Mitrani", TITLE="Modelling the Cambridge Ring", JOURNAL=per, VOLUME=11, NUMBER=4, PAGES="250-258", YEAR=1982, } @BOOK{Need82:Cambridge, AUTHOR="R. M. Needham and A. J. Herbert", TITLE="The Cambridge Distributed Computing System", ISBN="0-201-14092-6", PUBLISHER="Addison-Wesley", YEAR=1982, } @ARTICLE{Ober8202:Distributed, AUTHOR="R. Obermarck", TITLE="Distributed Deadlock Detection Algorithm", JOURNAL=tods, VOLUME=7, NUMBER=2, YEAR=1982, } @TECHREPORT{Rhod82:Mistress, AUTHOR="{Rhodnius Incorporated}", TITLE="Mistress: Relational Database Management System Version 2.1", TYPE="Manual", INSTITUTION="Rhodnius Incorporated", YEAR=1982, } @INCOLLECTION{Ullm82:Universal, AUTHOR="J. D. Ullman", TITLE="The Universal Relation as a User Interface", BOOKTITLE="Principles of Database Systems", PUBLISHER="Computer Science Press", PAGES="317-348", YEAR=1982, } @INCOLLECTION{Ullm82:Normal, AUTHOR="J. D. Ullman", TITLE="Normal Forms for Relation Schemes", BOOKTITLE="Principles of Database Systems", PUBLISHER="Computer Science Press", PAGES="211-267", YEAR=1982, } @ARTICLE{Alek82:Computer, AUTHOR="I Aleksander and T. J. Stonham and B. V. Wilkie", TITLE="Computer vision systems for industry : Wisard and the like.", JOURNAL="Digital systems for industrial automation", VOLUME=1, NUMBER=4, PAGES="305-321", YEAR=1982, ABSTRACT="This is an article written for those who are not familiar with the problems of automatic, computer-based pattern recognition. It surveys known methods in the light of opportunities offered by silicon chip technology. The article also discusses some of the design desicions made in the creation of Wisard, a fast pattern recognition computer built at Brunel University. Its structure has been optimised for silicon chip implementation.", } @BOOK{Ball82:Computer, AUTHOR="D. H. Ballard and C. M. Brown", TITLE="Computer vision", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1982, } @ARTICLE{Benn82:Automatic, AUTHOR="A. H. Benny", TITLE="Automatic relocation of ground control points in Landsat imagery", JOURNAL=remote, VOLUME="4 (2)", PAGES="335-342", YEAR=1982, } @ARTICLE{Binf8201:Model, AUTHOR="T. O. Binford", TITLE="Survey of model-based image analysis systems", JOURNAL="International Journal of Robotics Research", VOLUME=1, NUMBER=1, PAGES="16-64", YEAR=1982, } @ARTICLE{Chel8203:Digital, AUTHOR="Robin {Chellappa Doss} and R. L. Kashyap", TITLE="Digital image restoration using spatial interaction models", JOURNAL=ieeeassp, VOLUME=30, NUMBER=3, PAGES="461-472", YEAR=1982, ABSTRACT="This paper is concerned with developing fast nonrecursive algorithms for the minimum mean squared error restoration of degraded images. The degredation is assumed to be due to a spatial invariant, periodic, nonseparable known point-spread function, and additive white noise. Our basic approach is to represent the images by a class of spatial interaction models, namely the simultaneous autoregressive models and the conditional Markov models defined on toroidal lattices, and develop minimum mean-squared error restoration algorithms using these models. The restoration algorithms are optimal, if the parameters characterising the interaction models are exactly known. However, in practice, the parameters are estimated from the images. By using spatial interaction models, we develop restoration algorithms that do not require the availability of the original image or its prototype. The specificstructure of the underlying lattice enables the implemetation of the filters using fast Fourier transform computations. Several restoration examples are given.", } @ARTICLE{Chit82:Dependent, AUTHOR="C. B. Chittineni", TITLE="Dependent feature trees for density approximation : 2 maximum likelihood clustering", JOURNAL=remote, VOLUME="3 (2)", PAGES="163-179", YEAR=1982, ABSTRACT="Heavy.", } @BOOK{Devi82:Pattern, AUTHOR="P. A. Devijver and J. Kittler", TITLE="Pattern recognition : a statistical approach", PUBLISHER="Prentice Hall", YEAR=1982, ABSTRACT="For least-mean-square-error procedure.", } @ARTICLE{Hans82:Image, AUTHOR="F. R. Hanson and H. Elliott", TITLE="Image segmentation using simple Markov field models", JOURNAL="CGIP", VOLUME=20, PAGES="101-132", YEAR=1982, ABSTRACT="By modelling a picture as a 2 state Markov field, MAP estimation techniques are used to develop suboptimal but computationally tractable binary segmentation algorithms. The algorithms are shown to perform well at low signal to noise ratios, and analytical procedures are developed for estimating the Markov field transition probabilities. In addition, extensions of this approach to the multispectral and multiregion case are discussed.", } @BOOK{Kand82:Fuzzy, AUTHOR="A. Kandel", TITLE="Fuzzy techniques in pattern recognition", PUBLISHER="J Wiley and sons", YEAR=1982, } @BOOK{Marr82:Vision, AUTHOR="D. Marr", TITLE="Vision", PUBLISHER="Freeman", YEAR=1982, } @ARTICLE{Mats82:Structural, AUTHOR="T. Matsuyama and K. Saburi and M. Nagao", TITLE="A structural analyser for regularly aranged textures", JOURNAL="CGIP", VOLUME=18, PAGES="259-278", YEAR=1982, ABSTRACT={A structural not statistical approach. Repeated regular shapes are detected by region-growing. A {"}regualarity vector{"} is the found to displace the shapes to produce the texture.}, } @MISC{Ming82:Normalised, AUTHOR="L. Ming and I. William and Grosky and J. Ramesh", TITLE="Normalised Quad-trees with respect to translation", YEAR=1982, ABSTRACT="Describes an algorithm to normalise a quad tree - ie express it in unique form.", } @ARTICLE{Nevt8205:Locating, AUTHOR="R. Nevtia and K. E. Price", TITLE="Locating structures in aerial images", JOURNAL=ieeepami, VOLUME=4, NUMBER=5, PAGES="476-484", YEAR=1982, } @ARTICLE{Peli82:Study, AUTHOR="T. Peli and D. Malah", TITLE="A study of edge detection algorithms", JOURNAL="CGIP", VOLUME=20, PAGES="1-21", YEAR=1982, } @ARTICLE{Same82:Neighbor, AUTHOR="H. Samet", TITLE="Neighbor finding techniques for images represented by quadtrees", JOURNAL="CGIP", VOLUME=18, PAGES="37-57", YEAR=1982, } @INPROCEEDINGS{Savo82:Karhunen, AUTHOR="M. H. Savoji and G. G. Wilkinson", TITLE="Karhunen-Loeve transform on an array processor - applications to multi-spectral and single band images.", BOOKTITLE="Electronic Image Processing", PUBLISHER="IEE Press", ADDRESS="York", PAGES="225-229", YEAR=1982, } @MISC{Scho8202:Darwinian, AUTHOR="P. Scholz", TITLE="Darwinian evolution as a strategy model for the numerical optimisation of parameters in a non-linear regression function. {\%J} {EDV} in Medizin und Biologie", VOLUME=13, NUMBER=2, PAGES="36-43", YEAR=1982, } @ARTICLE{Tilt8204:Estimation, AUTHOR="J. C. Tilton and S. B. Vardman and P. H. Swain", TITLE="Estimation of context for statistical classificatioon of multispectral image data", JOURNAL="IEEE Transactions on Geoscience and remote sensing", VOLUME=20, NUMBER=4, PAGES="445-452", YEAR=1982, } @INCOLLECTION{Wolf82:Video, AUTHOR="Catherine G. Wolf", TITLE="Video conferencing: delay and transmission characteristics", BOOKTITLE="Teleconferencing and electronic communication", EDITOR="L. A. Parker and C. H. Olgren", PUBLISHER="North Holland", PAGES="184-188", YEAR=1982, REFERENCES=5, KEYWORDS="delay; multimedia; videoconferencing; human factors", ABSTRACT="This paper discusses the effects of audio-video transmission delay on communication in a two-way, interactive video conferencing system. The study was conducted with the Bell System's market trial video conferencing system, PICTUREPHONE Meeting Service. This system allows groups of up to six people in each of two locations to confer ``face-to-face'' with graphics support. There are at least two potential sources of transmission delay in video conferencing. First, video conferencing is typically employed over long distances where satellite transmission may be most economical. Due to the distance of a satellite from the earth, satellite transmission adds a round-trip increment of about 510 msec to transmission time. Secondly, attempts to reduce the bandwidth required for transmission of the video signal characteristics employ picture processing techniques which add delay to the transmission time. The exact amount of delay depends on the picture processing techniques employed.", ANNOTE="Tested delays of 0, 330, and 840 ms. The 840 ms delay and half-duplex exacerbates simultaneous speech problems, but does not affect task performance. 330 ms shows only very small difference in subjective evaluation of being interrupted or difficulty to communicate compared to 0 ms. [Sc]", } @INPROCEEDINGS{Cohe82:Speaker, AUTHOR="Karen M. Cohen", TITLE="Speaker interaction: video teleconferences versus face-to-face meetings", BOOKTITLE="Teleconferencing and Electronic Communication", EDITOR="L. A. Parker and C. H. Olgren", PAGES="189-199", YEAR=1982, REFERENCES=15, KEYWORDS="human factors; delay; teleconferencing", ABSTRACT="Human factors research was conducted to compare speaker interaction patterns in face-to-face meetings with those in video teleconferences. Groups of subjects completed two problem-solving tasks using either a face-to-face (FTF) medium of communication or the new system to be used in the service offering of Picturephone meeting service (PMS). Upon completion of each task, subjects rated the perceived ease of communication and the social dynamics of the meeting. In addition, observational records of speaker interaction patterns were obtained. Analyses of these data reveal ways in which FTF meetings and PMS video teleconferences differ. The observational records of communication behavior parallel the subjective responses concerning the perceived ease of communication during the discussion tasks. These data indicate that many more speaker ``turns'' and simultaneous speech events occur in FTF meetings than in PMS conferences, though the social dynamics during the tasks are comparably rated. Hence, these results question the appropriateness of FTF communication as the ``ideal'' model for video teleconferencing. However, they also demonstrate that the offering of PMS is perceived to provide positive social dynamics comparable to those found in FTF meetings. This new version of PMS, in contrast to the previous market trial version, also eliminates the negative effects associated with interruptions and simultaneous speech events previously reported for video teleconferences held in the presence of transmission delay. In addition, this rersearch provides data on subjects' perceptions on the effectiveness of different communication media for various conferencing tasks.", ANNOTE="Used voice-switched video. Delay of 705 ms for audio and video. Measured number of turn-takings and interruptions.", } @ARTICLE{Jaco8207:Rebuttal, AUTHOR="T. Jacobsen and P. Thisted", TITLE={Rebuttal to Comments on {"CCITT} Recommendation {X.25} as Part of the {ISO} Reference Model of Open Systems Interconnection"}, JOURNAL=ccr, VOLUME=12, NUMBER="3/4", PAGES="12-13", MONTH="July/October", YEAR=1982, } @ARTICLE{Knig8207:Transport, AUTHOR="Keith G. Knightston", TITLE="The Transport Layer", JOURNAL=ccr, VOLUME=12, NUMBER="3/4", PAGES="14-23", MONTH="July/October", YEAR=1982, REFERENCES=4, } @ARTICLE{ISOT8207:Information, AUTHOR="I. S. O/TC97/SC16/WG6", TITLE="Information Processing Systems--Open Systems Interconnection--Transport Protocol Specification", JOURNAL=ccr, VOLUME=12, NUMBER="3/4", PAGES="24-67", MONTH="July/October", YEAR=1982, } @ARTICLE{Rutk8207:Integrated, AUTHOR="A. M. Rutkowski and M. J. Marcus", TITLE="The Integrated Services Digital Network: Developments and Regulatory Issues", JOURNAL=ccr, VOLUME=12, NUMBER="3/4", PAGES="68-82", MONTH="July/October", YEAR=1982, } @ARTICLE{Hill8207:Dragnet, AUTHOR="D. D. Hill", TITLE="{Dragnet--A} Local Network with Protection", JOURNAL=ccr, VOLUME=12, NUMBER="3/4", MONTH="July/October", YEAR=1982, REFERENCES=1, ABSTRACT="This paper proposes a topology for local computer networks. Called ''Dragnet'', it is similar to the Ethernet network in function, but rather different in the following respects: (1) Instead of a single long bidirectional cable, there are multiple short unidirectional cables. (2) Just as an Ethernet network may require some number of signal repeaters to join multiple segments, the proposed system always uses one or more simple cocentrator units, each one merging several signals into one. (3) Each concentrator unit also provides the facility to silence the lines coming into it, thus providing security against any number of bad (jammed) transmitters. (It is this capability that inspired the name ''Dragnet''.) Most of the remaining good transmitters in the system can continue to send, and all units can receive regardless of the number of errant transmitters. The paper discusses the strengths ad weaknesses of the Dragnet approach. The key disadvantage is that the active medium is potentially less reliable than the simpliest Ethernet network (one with no repeaters.) The key advantages are: simpler, potentially more reliable drivers and receivers; better fault tolerance; and better message verification. In principle, the systems are compatible, and the two might be combined into a hybrid network.", } @ARTICLE{Smit8203:Cache, AUTHOR="A. J. Smith", TITLE="Cache Memories", JOURNAL=acmcs, VOLUME=14, NUMBER=3, PAGES="473-530", YEAR=1982, } @INPROCEEDINGS{Wiec82:Case, AUTHOR="C. A. Wiecek", TITLE="A Case Study of {VAX-11} Instruction Set Usage for Compiler Execution", BOOKTITLE=asplos, PAGES="177-184", YEAR=1982, } @INPROCEEDINGS{Mena82:Two, AUTHOR="Daniel A. Menasce*' and Tatuo Nakanishi", TITLE="Performance Evaluation of a Two-Phase Commit Based Protocol for {DDB's}", BOOKTITLE="SIGMOD", PAGES="247-255", YEAR=1982, } @ARTICLE{Rein82:Zuverlässigkeitsmaße, AUTHOR="K. Reinschke", TITLE="Zuverlässigkeitsmaße für Kommunikationsnetze und ihre rechnerische Ermittlung", JOURNAL=nte, ADDRESS="Berlin, Germany", VOLUME=32, PAGES="472-476", YEAR=1982, LANGUAGE="German", KEYWORDS="Reliability", } @ARTICLE{Ahre8202:Computer, AUTHOR="J. Ahrens and U. Dieter", TITLE="Computer generation of Poisson deviates from modified normal distributions", JOURNAL=toms, VOLUME=8, NUMBER=2, PAGES="163-179", YEAR=1982, KEYWORDS="Rvg", } @ARTICLE{Lam8203:Queueing, AUTHOR="Simon Lam and Jackson Wong", TITLE="Queueing network models of packet switching networks, part 2: Networks with population size constraints", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=2, NUMBER=3, PAGES="161-180", YEAR=1982, KEYWORDS="Communication network; window mechanism; flow control", } @PHDTHESIS{Truo82:Über, AUTHOR="Hong Linh Truong", TITLE="Über die Leistungsfähigkeit von {HDLC-gesteuerten} Datenverbindungen", SCHOOL="Institut für Nachrichtenvermittlung und Datenverarbeitung, Uni Stuttgart", ADDRESS="Stuttgart, Germany", NOTE="33. Bericht über verkehrstheoretische Arbeiten", YEAR=1982, LANGUAGE="German", KEYWORDS="Performance evaluation; link layer; HDLC", } @INPROCEEDINGS{Hutt82:En, AUTHOR="R. Huttunen", TITLE="En Förenklad Metod för Dimensionering av Lågspärrsvia", BOOKTITLE="NTS 4", ADDRESS="Helsingfors, Finland", PAGES="V.2.1-4", YEAR=1982, LANGUAGE="Finnish", KEYWORDS="Telephony", ABSTRACT={Dimensioneringen av förbindelseledningar och kopplingsorgan baserar sig enligt de finländska normerna "Föreskrifter för byggande av telefonnät" på uppmätta fram till nästa utökning eller trafikvägsomdisponering. Genom att utöka eller omrangera vior bör man i god tid se till att de trafikvärden som kan beräknas inte överskrider den nominella spärrningens tillåtna värden.}, } @TECHREPORT{Hord82:Weak, AUTHOR="Arie Hordijk and R. A. Schassberger", TITLE="Weak Convergence for Generalized Semi-Markov Processes", BOOKTITLE="Stochastic Processes and their Applications", INSTITUTION="Univ. of Leiden", VOLUME=12, NUMBER="77-8", PAGES="271-291", YEAR=1982, KEYWORDS="Semi Markov process", } @ARTICLE{Baba82:Maximum, AUTHOR="Y. Baba", TITLE="Maximum Likelihood Estimation of Parameters in Birth and Death Processes by Poisson Sampling", JOURNAL=jorsj, ADDRESS="Japan", VOLUME=25, NUMBER=2, PAGES="99-111", YEAR=1982, KEYWORDS="Maximum likelihood estimation; birth-death process; parameter estimation; sampling", } @ARTICLE{Bakr82:Teletraffic, AUTHOR="S. H. Bakry and M. H. Ackroyd", TITLE="Teletraffic Analysis for Multicell Mobile Radio systems", JOURNAL=ieeecom, VOLUME="COM-30", NUMBER=8, PAGES="1905-1909", YEAR=1982, KEYWORDS="cellular system", } @INCOLLECTION{Bala82:Optimal, AUTHOR="Krishna Balachandran", TITLE="Optimal Control of Service System Utilisation", BOOKTITLE="Optimisation and Control of Dynamic Operational Research Models", EDITOR="S. G. Tzafestas", PUBLISHER="North Holland", PAGES="177-195", YEAR=1982, KEYWORDS="Utilization; control; optimization", } @ARTICLE{Barb82:Capacity, AUTHOR="G. Barberis and R. Brignolo", TITLE="Capacity Allocation in a {DAMA} Satellite System", JOURNAL=ieeecom, VOLUME="COM-30", NUMBER=7, PAGES="1750-1757", YEAR=1982, KEYWORDS="multiserver", ABSTRACT="Some analysis and design results for a circuit-switched multiaccess satellite system are presented. The use of a demand assignment multiple access (DAMA) circuit-switched service in satellite communications gives rise to many problems, recently emphasized in the litterature. They recall those of an open network of queues with population size constraints. The main results are the extension of computation algorithms develop", } @ARTICLE{Barr82:Performances, AUTHOR="C. Barret and M. Gourgand and Gerard Hebuterne and L. Romæuf and others", TITLE="Evaluation des performances dún autocommutateur téléphonique par modèle analytique. Evaluation of the performances of a telephone exchange by an analytical model", JOURNAL=atele, VOLUME=37, NUMBER="9-10", PAGES="399-412", YEAR=1982, KEYWORDS="Analytical model; evaluation; performance evaluation; switching system", } @INPROCEEDINGS{Bo82:Trafikkmåleopplegg, AUTHOR="K. Bo", TITLE="Trafikkmåleopplegg og trafikkmålinger i det norske telenettet", BOOKTITLE="NTS 4", ADDRESS="Helsingfors, Finland", PAGES=13, YEAR=1982, LANGUAGE="Norwegian", } @ARTICLE{Bogd82:Nonstationary, AUTHOR="J. L. Bogdanoff and F. Kozin", TITLE="On Nonstationary Cumulative Damage Models", JOURNAL="Journal of Applied Mechanics", VOLUME=49, NUMBER="37-42", YEAR=1982, KEYWORDS="cumulative process; model", } @ARTICLE{Bono82:Concept, AUTHOR="E. Bonomi and J.-L. Lutton and M. R. Feix", TITLE="Concept d'extensivité un réseau de Clos et probabilité de blocage pour un système a trois étages. The concept of extensivity for Clos Networks and blocking Probability for Three Stage Networks", JOURNAL=atele, VOLUME=37, NUMBER="5-6", PAGES="239-256", YEAR=1982, KEYWORDS="Clos; network; blocking; link system; multistage interconnection network", } @INPROCEEDINGS{Bouc82:Nonblocking, AUTHOR="J. R. Boucher", TITLE="Is a Nonblocking Digital Matrix Essential, or is Essentially Nonblocking Acceptable?", BOOKTITLE=globecom, YEAR=1982, KEYWORDS="Nonblocking; switching system; switching network", } @ARTICLE{Chen82:Use, AUTHOR="Rung-Shiang Cheng", TITLE="The Use of Antithetic Variates in Computer Simulations", JOURNAL=jors, PAGES="229-237", YEAR=1982, KEYWORDS="Simulation", } @ARTICLE{Cuma82:Canonical, AUTHOR="A. Cumani", TITLE="On the Canonical Representation of Homogeneous Markov Processes Modelling Failure-Time Distributions", JOURNAL="Microelectronic Reliability", VOLUME=22, NUMBER=3, PAGES="583-602", YEAR=1982, KEYWORDS="Cox distribution", } @INPROCEEDINGS{Dahl82:Trafikfördelningsmätningar, AUTHOR="P. Dahlström", TITLE="Trafikfördelningsmätningar inför taxeomläggning", BOOKTITLE="NTS 4", ADDRESS="Helsingfors, Finland", PAGES="III.4.1-9", YEAR=1982, LANGUAGE="Swedish", } @ARTICLE{Boer82:Anomaly, AUTHOR="J. de Boer", TITLE="An Anomaly of O'Dells formula", JOURNAL=ieeecom, VOLUME="COM-30", NUMBER=7, PAGES="1720-1721", YEAR=1982, KEYWORDS="grading", } @ARTICLE{Deho82:Geometric, AUTHOR="M. Dehon and G. Latouche", TITLE="A Geometric Interpretation of the Relations between the Exponential and Generalized {Erlang} Distributions", JOURNAL=aap, VOLUME=34, PAGES="885-897", YEAR=1982, KEYWORDS="Cox distribution; phase-type model; exponential distribution; Erlang distribution; distribution function; Linear combination of distribution functions; Vector spaces; convex sets", ABSTRACT="Linear combinations of exponential distribution functions are considered, and the class of distribution functions so obtainable is investigated. Convex combinations correspond to hyperexponential distributions, while non-convex combinations yield, among other, generalized Erlang distributions obtainable as sums of independent exponential random variations.", } @ARTICLE{Deul82:Influence, AUTHOR="N. Deul", TITLE="The Influence of the Perseverance Functions in Queueing Systems with Repeated Calls", JOURNAL=eik, VOLUME=18, NUMBER="10/11", PAGES="587-594", YEAR=1982, KEYWORDS="Call reattempt; queueing system", } @ARTICLE{Diet82:Alternate, AUTHOR="U. Dieter", TITLE="An Alternate proof for the Representation of Discrete Distributions by Equiprobable Mixtures", JOURNAL=jap, VOLUME=19, PAGES="869-872", YEAR=1982, KEYWORDS="Discrete Random Variable", } @ARTICLE{Du82:Comparisons, AUTHOR="Dingzhu Du and F. K. Hwang", TITLE="Comparisons on Blocking Probabilities for Regular Series Parallel Channel Graphs", JOURNAL=bstj, VOLUME=61, NUMBER=8, PAGES="1965-1973", YEAR=1982, REFERENCES=10, KEYWORDS="Blocking; Probability; Graph Model; Comparison", } @ARTICLE{Eklu82:Belastningsstudie, AUTHOR="B. Eklundh and D. Rapp", TITLE="Belastningsstudie av Styrsystemet i {AXE} 10", JOURNAL=ericssonr, ADDRESS="Sweden", VOLUME=4, PAGES="208-216", YEAR=1982, LANGUAGE="Swedish", KEYWORDS="Load Measurement; Analysis", } @TECHREPORT{Hord82:Networks, AUTHOR="Arie Hordijk and N. Van Dijk", TITLE="Networks of Queues. Part 1: Job-Local-Balance and the Adjoint Process", INSTITUTION="Institute of Applied mathematics and Computer Science, University of Leiden", ADDRESS="Leiden, Netherlands", PAGES=27, YEAR=1982, KEYWORDS="Queueing network", ABSTRACT="In these papers we study networks of queues with general routing- and service-characteristics. It is extensively analysed which models do satisfy a partial balance property, called the job-local balance property. The key to our analysis is the adjoint process. Roughly speaking, the original process satisfies the job-loca-balance property if and only if the adjoint process is reversible.", } @ARTICLE{Elno82:New, AUTHOR="S. M. Elnoubi and Raghavendra Singh and Shashank Gupta", TITLE="A New Frequency Channel Assignment Algorithm in High Capacity Mobile Communication Systems", JOURNAL=ieeevt, VOLUME="VT-31", NUMBER=3, PAGES="125-131", YEAR=1982, KEYWORDS="cellular system; mobile radio", } @INPROCEEDINGS{Emst82:Multiprocessor, AUTHOR="Peder Emstad", TITLE="Multiprocessor System Load Analysis", BOOKTITLE="NTS 4", ADDRESS="Helsingfors, Finland", PAGES="VI.I.1-3", YEAR=1982, KEYWORDS="Multiprocessor System; Analysis", ABSTRACT="Processing power is one of the important resources needed in a modern telecommunication switching system. This resource is tipically used to allocate and deallocate other resources as well as to check if conditions are met to start such actions. General resource requirement models can be established using - among other methods - Petrinets. These models then in return form the basis for processor load models.", } @INPROCEEDINGS{Even82:Revised, AUTHOR="R. K. Even", TITLE="Revised Traffic-Related Procedures for Line Concentrators", BOOKTITLE=globecom, ADDRESS="Miami, Florida", VOLUME=3, PAGES="F.6.5.1-4", YEAR=1982, REFERENCES=8, KEYWORDS="Concentrator", } @ARTICLE{Faki82:Group, AUTHOR="D. Fakinos", TITLE="The M/G/k Group-Arrival Group-Departure Loss System", JOURNAL=jap, VOLUME=19, PAGES="826-834", YEAR=1982, KEYWORDS="multi-slot connection; multi-slot traffic", } @ARTICLE{Faki82:Generalized, AUTHOR="D. Fakinos", TITLE="The Generalized M/G/k Blocking System with Heterogeneous Servers", JOURNAL=jors, VOLUME=33, PAGES="801-809", YEAR=1982, KEYWORDS="Erlang B formula", } @INPROCEEDINGS{Falc82:Utveckling, AUTHOR="S. Falck and E. Carlsson", TITLE="Utveckling inom trafikmätningsområdet i Sverige", BOOKTITLE="NTS 4", ADDRESS="Helsingfors, Finland", PAGES=3, YEAR=1982, LANGUAGE="Swedish", } @ARTICLE{Fili82:Optimal, AUTHOR="J. Filipiak", TITLE="Optimal Control of Store-and-Forward Networks", JOURNAL="Optimal Control Applications \& Methods", VOLUME=3, PAGES="155-176", YEAR=1982, KEYWORDS="Communication Network; Store-And-Forward; Control", } @INPROCEEDINGS{Fran82:Point, AUTHOR="P. Franken", TITLE="The Point Process Approach to Queueing Theory and Related Topics", BOOKTITLE="Seminarbericht Nr. 43. Sektion Mathematik der Humboldt-Universität zu Berlin, DDR", PAGES=72, YEAR=1982, KEYWORDS="Random Process; Point Process; Queueing Theory; Theory", } @ARTICLE{Gams8203:Homogeneous, AUTHOR="A. Gamst", TITLE="Homogeneous Distribution of Frequencies in a Regular Hexagonal Cell System", JOURNAL=ieeevt, VOLUME="VT-31", NUMBER=3, PAGES="132-144", YEAR=1982, KEYWORDS="Mobile Radio; Frequency Distribution; Analysis", } @INPROCEEDINGS{Gams82:Frequency, AUTHOR="A. Gamst and W. Rave", TITLE="On Frequency Assignment in Mobile Automatic Telephone Systems", BOOKTITLE=globecom, ADDRESS="Miami, Florida", PAGES="B.3.1.1-7", YEAR=1982, KEYWORDS="Mobile radio; MAT; channel assignment", ABSTRACT="Frekvensallokering", } @ARTICLE{Garc82:Planungsmethode, AUTHOR="Roman Garcia", TITLE="Eine Planungsmethode für das Vermittlungsnetz eines Datennetzes mit Paketvermittlung", JOURNAL=ors, ADDRESS="Germany", VOLUME=4, PAGES="237-244", YEAR=1982, LANGUAGE="German", KEYWORDS="packet switching", } @ARTICLE{Guil82:Simulation, AUTHOR="R. Guild and R. J. Hartnett", TITLE="A Simulation Study of a Machine Interference Problem with {$M$} Machines under the Care of {$N$} Operators Having Two Types of Stoppage", JOURNAL=ijpr, VOLUME=20, NUMBER=1, PAGES="47-55", YEAR=1982, KEYWORDS="machine-repair-man model", ABSTRACT="Palm; Machine Interference", } @ARTICLE{Hamm82:Automatisk, AUTHOR="T. Hammer and T. M. Iversen and E. T. Mortensen and P. Aagaard", TITLE="Automatisk Nordisk Mobiltelefonsystem", JOURNAL="Teleteknik", PAGES="1-17", YEAR=1982, KEYWORDS="mobile radio; cellular system", } @ARTICLE{Harv82:Teletraffic, AUTHOR="C. Harvey", TITLE="Teletraffic Aspects of Processor Utility Design", JOURNAL=poeej, VOLUME=74, PAGES="364-368", YEAR=1982, KEYWORDS="SPC", } @INPROCEEDINGS{Hedb82:Buffert, AUTHOR="I. Hedberg", TITLE="Buffert med Slumpat antal Uthämtade", BOOKTITLE="NTS 4", ADDRESS="Helsingfors, Finland", PAGES="VI.6.1-7", YEAR=1982, LANGUAGE="Swedish", KEYWORDS="Delay model; busy period; M/G/OO; idle period; sampling", ABSTRACT="Tillstånds- och väntetidsfördelning i en oändligt lång buffert med Poissonankomster. Slumpat antal Uthämtade vid tidpunkter med konstanta tidsavstånd.", } @ARTICLE{Helm82:Insensitive, AUTHOR="W. E. Helm and R. A. Schassberger", TITLE="Insensitive Generalized Semi-Markov Schemes with Point Process Input", JOURNAL=mor, VOLUME=7, NUMBER=1, PAGES="129-138", YEAR=1982, KEYWORDS="Queueing System; Semi Markov Process; Point Process", } @INPROCEEDINGS{Helv82:En, AUTHOR="B. E. Helvik", TITLE="En metode for å evaluere systemeffektivitet med utgangspunkt i abonnentenes opplevelse av en ikke fullkommen teletjeneste", BOOKTITLE="NTS 4", ADDRESS="Helsingfors, Finland", PAGES="II.3.1-18", YEAR=1982, LANGUAGE="Norwegian", ABSTRACT="Den foreslåtte metoden tar utgangspunkt i det tidsvarierende servicenivå som abonnentene opplever. For eksempel sannsynligheten for et vellykket anrop. Videre modelleres den subjektive opplevelsen av service som abonnentene har, som en f lge av dette dynamiske servicenivået. Disse to elementene kombineres så for å finne et mål på systemeffektiviteten slik som abonnentene opplever den. Denne fremgangsmåten tillater at vi k", } @TECHREPORT{Hert82:Approximativa, AUTHOR="S. Hertzberg", TITLE="Approximativa Dimensioneringsformler med Normalfördelningsmetoden", INSTITUTION="Helsinki University of Technology, Telecommunications Laboratory", ADDRESS="Helsinki, Finland", NUMBER="5/82", PAGES=19, YEAR=1982, LANGUAGE="Finnish", KEYWORDS="Approximation; Estimation; Normal Distribution", } @ARTICLE{Heym8208:Carrier, AUTHOR="Dan Heyman", TITLE="An Analysis of the Carrier-Sense Multiple Access Protocol", JOURNAL=bstj, VOLUME=61, NUMBER=8, PAGES="2023-2051", YEAR=1982, KEYWORDS="Analysis; Performance Evaluation; CSMA", } @ARTICLE{Ivni8201:Condition, AUTHOR="V. A. Ivnitski", TITLE="On a Condition of Invariance of Stationary Probabilities for Queueing networks", JOURNAL="The Theory of Probability and Its Applications", VOLUME=27, NUMBER=1, PAGES="196-201", YEAR=1982, KEYWORDS="Queueing network", ABSTRACT="Kovalenko", } @INPROCEEDINGS{Jens82:Probability, AUTHOR="E. Lykke Jensen", TITLE="The Probability of $B$-Subscriber Busy: Models based on the Repeated Call Phenomenon", BOOKTITLE="NTS 4", ADDRESS="Helsingfors, Finland", PAGES="IV.2.1-6", YEAR=1982, KEYWORDS="Call reattempt", ABSTRACT="Models, based on repeated call attempts, have been established for determining the B-subscriber busy probability for individual subscriber lines and groups of such lines. Comparisons with measurements have been made. Furthermore, consequences for prediction of call mix have been discussed. On this matter evidence from further measurements would be appreciated. Traffic fluctuations have been considered. These would appear", } @ARTICLE{Kami82:Characteristic, AUTHOR="K. S. Kaminsky", TITLE="A Characteristic Property of the Exponential Distribution", JOURNAL=spl, VOLUME=1, PAGES="31-32", YEAR=1982, KEYWORDS="Exponential distribution; Makeham's law; Gompertz's law", ABSTRACT="The following characterization of the exponential distribution is given: Under suitable conditions on the random variables X and Y, X is exponentially distributed if and only if E[min{X,Y}] = E(X)P(X