@BOOK{Bhat84:Elements, AUTHOR="U. Narayan Bhat", TITLE="Elements of Applied Stochastic Processes", EDITION="2nd", PUBLISHER="John Wiley", ADDRESS="New York, New York", YEAR=1984, KEYWORDS="stochastic processes", } @ARTICLE{Fili8409:Dynamic, AUTHOR="J. Filipiak", TITLE="Dynamic Routing in Queueing Systems with a Multiple Service Facility", JOURNAL=or, VOLUME=32, NUMBER=5, PAGES="1163-1180", MONTH="September--October", YEAR=1984, KEYWORDS="routing", } @BOOK{Gded84:Handbuch, AUTHOR="B. W. Gdedenko and D. König", TITLE="Handbuch der Bedienungstheorie", PUBLISHER="Akademie Verlag", ADDRESS="Berlin", VOLUME=2, YEAR=1984, KEYWORDS="queueing theory", } @BOOK{McGi84:Continuous, AUTHOR="Clare D. McGillem and George R. Cooper", TITLE="Continuous and Discrete Signal and System Analysis", PUBLISHER="Holt, Rinehart and Winston", ADDRESS="New York, New York", YEAR=1984, KEYWORDS="signal processing", } @BOOK{Papo84:Probability, AUTHOR="A. Papoulis", TITLE="Probability, Random Variables, and Stochastic Processes", EDITION="2nd", ISBN="0-07-048468-6", PUBLISHER="McGraw-Hill Book Company", ADDRESS="New York, New York", YEAR=1984, KEYWORDS="probability theory; stochastic processes", } @BOOK{Rey84:Engineering, TITLE="Engineering and Operations in the Bell System", EDITOR="R. F. Rey", ISBN="0-932764-04-5", PUBLISHER="AT\\&T Bell Laboratories", ADDRESS="Murray Hill, New Jersey", YEAR=1984, ANNOTE="Telephony. Part 2, Chapter 5: Traffic.", } @MISC{Inte84:Information, AUTHOR="{International Organization for Standardi}", TITLE="Information Processing Systems -- Open Systems Interconnection: Addendum for Connectionless Mode Transmission -- {IS} {8072/AD1}", YEAR=1984, KEYWORDS="transport protocol; connectionless service", } @MISC{CCIT84:Recommendation, AUTHOR="C. C. ITT", TITLE="Recommendation {T.4:} Standardization of Group 3 Facsimile Apparatus for Document Transmission", PAGES="16-31", NOTE="Fascicle VII.3 -- Red Book", YEAR=1984, KEYWORDS="fax; facsimile; picture coding; T.4; G3", } @BOOK{Lazo84:Quantitative, AUTHOR="E. D. Lazowska", TITLE="Quantitative system performance: computer system analysis using queueingnetwork models", PUBLISHER="Prentice-Hall", YEAR=1984, } @ARTICLE{Onyu84:Closed, AUTHOR="Ibrahim Onyuksel and K. B. Irani", TITLE="A Closed-Form Solution for the Performance Analysis of Multiple-Bus Multiprocessor Systems", JOURNAL=ieeetc, VOLUME="c-33", NUMBER=11, PAGES="1004-1012", YEAR=1984, } @INPROCEEDINGS{Ward84:Assigning, AUTHOR="Matthew O. Ward and Deborah J. Romero", TITLE="Assigning parallel-executable, intercommunicating subtasks to processors", BOOKTITLE="International Conference on Parallel Processing", PAGES="392-394", YEAR=1984, } @ARTICLE{Fras8407:Queueing, AUTHOR="A. G. Fraser and Samuel P. Morgan", TITLE="Queueing and framing disciplines for a mixture of data traffic types", JOURNAL=atttj, VOLUME=63, NUMBER=6, PAGES="1061-1087", MONTH="July--August", YEAR=1984, KEYWORDS="scheduling; round robin; priority; ATM", ABSTRACT="Packet switched data networks are constructed from switching nodes interconnected by trunks. Trunk queueing delays for short messages can be reduced at the expense of long messages by having the trunk server take no more than a fixed number of bytes from each message before going on to the next message. We report analysis and simulations of two partial-service disciplines, namely round robin (RR) and priority first-in first-out followed by round robin (PR + RR), for a mixture of traffic types. The PR + RR discipline permits short messages to experience finite mean delay at traffic levels where longer messages see infinite mean delay. Information is transmitted over the trunk in frames, where a frame may contain parts of several messages. At the far end of the trunk, the contents of a frame are not transmitted further until the end of the frame has arrived. We simulate two framing algorithms that work effectively with the PR+RR queueing discipline to achieve acceptably low frame overhead together with short delays for short messages. In addition, queueing plus framing delays for longer messages are substantially reduced, at a given overall traffic intensity if the access lines run more slowly than the trunk.", } @MISC{CCIT84:Procedures, AUTHOR="C. C. ITT", TITLE="Procedures for document facsimile transmission in the general switched telephone network", YEAR=1984, KEYWORDS="facsimile; PSTN; telephone network; fax", ABSTRACT="This recommendation is intended to apply to document facsimile apparatus covered by CCITT Recommendations T.2, T.3 and T.4. It describes the procedures and signals to be used where facsimile equipments are operated over the general switched telephone network. When existing equipments are operated in a non-CCITT manner, they shall not interfere with equipment operating in accordance with the Series T recommendation.", } @INBOOK{Vall84:Computer, AUTHOR="Jacques Vallee", TITLE="Computer Message Systems", SERIES="Data Communications Book Series", PUBLISHER="McGraw-Hill", ADDRESS="New York, New York", PAGES="70-87", YEAR=1984, KEYWORDS="computer messaging systems; electronic mail", ABSTRACT="In Chap 5: Tools of Conferencing, the author describes two systems PARTICIPATE and NOTEPAD. In Chap 6: Analysis of Group Communications, the author addresses capturing group usage and cost data, user-level statistics, and reactions and perceptions", } @BOOK{Hilt84:Online, AUTHOR="Starr Roxanne Hiltz", TITLE="Online Communities: A Case Study of the Office of the Future", PUBLISHER="Ablex Publishing", ADDRESS="Norwood, NJ", PAGES=262, YEAR=1984, KEYWORDS="computer conferencing", ABSTRACT="An easy to read book (paperback) by one of the early users and leaders in the field. Heavily oriented to the EIES (Electronic Information Exchange System) at New Jersey Institute of Technology. Compares EIES to other conferencing and electronic mail systems. Case study includes several ``research groups'' using EIES in several subjects. Includes theory and practical aspects, detailed questionnaires and detailed results (including statistical analyses of most items). General conclusions: 1) learning to use a new medium requires someone take the leadership role in groups; 2) users will make time to use conferencing if they feel the task is sufficiently important; 3) participates generally rate it easy, fun, and productive; 4) increases in ``quality'' of work rather than ``quantity'' of work were observed; and 5) telephone and mail had some decrease during the conferencing experience.", } @BOOK{Palm84:Computer, AUTHOR="J. Palme", TITLE="Survey of Computer-Based Message Systems", PUBLISHER="Stockholm University", PAGES=43, YEAR=1984, KEYWORDS="computer conferencing; electronic mail", ABSTRACT="Four individual papers: 1) COM/PortaCOM Conference Systems, 2) Design Goals and Principles, 3) Computer Conferencing is More than Electronic Mail, and 4) Effects of the COM Computer Conferencing System. Jacob Palme designed the COM conferencing system and is one of the early leaders in the field. Includes: 1) a survey of computer based mail and conferencing systems, 2) an evaluation of systems for both individually addressed mail and group addressing through conferences and distribution lists, 3) a discussion of various methods of structuring the text data in existing systems, and 4) a description of the networks of interconnected systems (including ARPAnet, CSNET, BITNET, USENET, JNT-MAIL, EURNET, AND MAILNET).", } @ARTICLE{Joha84:Expect, AUTHOR="Robert Johansen and Christine Bullen", TITLE="What to Expect from Teleconferencing", JOURNAL="Harvard Business Review", VOLUME=62, NUMBER=2, PAGES="164,168,170,172,174", YEAR=1984, KEYWORDS="computer conferencing", ABSTRACT="Provides several case studies and definitions for types of teleconferencing (audio, video, computer). Common misconceptions are: 1) high level of use (actually the technology is just developing but growing); 2) best for travel substitution (actually travel patterns will change but slowly); 3) audio is simple (actually audio systems are the technically most difficult; and 4) solution to face-to-face meetings (actually most people try to ``imitate'' a face-to-face meeting with this technology and thus loose much of its potential). Critical Success Factors include: 1) clear business requirement (some uses are obvious and others less so but there must be a need for communications); 2) accurate needs assessment (understand the nature of work involved); 3) learning from experience (learn from other's mistakes); and 4) importance of culture (behavioral impacts). Likely effects include: 1) teleconferencing is a partly a ``managerial support system'' and must be integrated into other communications planning; 2) face-to-face meetings and electronic meetings will become less and less alike as we better apply the technology; 3) the ``tone'' of the meeting will change as requirements for communication become the driving force for change rather than protocol of face-to-face meetings; 4) organizations will change as teleconferencing is integrated with computing and data availability; and 5) the incentives for using teleconferencing will begin to compete with other modes of communication or travel (including remote ``observation'' by off-site experts). Making it work requires effort: 1) there is no ``cookbook'' for success and each application should be reviewed independently; 2) integration of teleconferencing into other forms of communications is crucial; 3) cost factors will be important so ``possible'' systems are likely to give way to ``practical'' systems; and 4) since introduction of teleconferencing will change the fundamental communications process of the organization, the manager introducing it plays a delicate role. Tables compare the various media, cost advantages, opportunity enhancement, and negative effects.", } @BOOK{Kupf84:Theoretische, AUTHOR="K. Küpfmüller", TITLE="Einführung in die theoretische Elektrotechnik", EDITION="11th", PUBLISHER="Springer-Verlag", ADDRESS="Berlin", YEAR=1984, } @BOOK{Smit84:Circuits, AUTHOR="Ralph J. Smith", TITLE="Circuits, Devices, and Systems", EDITION="4th", PUBLISHER="John Wiley and Sons", ADDRESS="New York", YEAR=1984, } @ARTICLE{Shen84:Fault, AUTHOR="Jun Shen and John Hayes", TITLE="Fault-tolerance of dynamic-full-access interconnection networks", JOURNAL=ieeetc, VOLUME="C-33", NUMBER=3, PAGES="241-249", YEAR=1984, REFERENCES=16, KEYWORDS="Fully connected network; computer network; reliability", ANNOTE="A beta-network is an interconnection network composed of 2x2 crossbar switches called beta-elements. This paper presents an analysis of the fault-tolerance of beta-networks. A fault model is specified which allows beta-elements to be stuck in either of their two normal states. A new connectivity property called dynamic full access (DFA) is introduced which server as the criterion for fault tolerance. A fault is called critical if it destroys.", } @ARTICLE{Sips84:Bit, AUTHOR="H. J. Sips", TITLE="Bit-sequential arithmetic for parallel processors", JOURNAL=ieeetc, VOLUME="C-33", PAGES="7-21", YEAR=1984, REFERENCES=21, KEYWORDS="Floating point; parallel computing", ANNOTE="A bit-sequential processing element with $O(n)$ complexity is described, where $n$ is the wordlength of the operands. The operations performed by the element are $a*b+c*d$, $a/b$, and a performance comparison between the bit-sequential processing element and conventional pipelined arithmetic units is given.", } @ARTICLE{Spir84:Bursty, AUTHOR="J. R. Spirn and J. Chien and W. Hawe", TITLE="Bursty traffic local network modeling", JOURNAL=ieeejsac, VOLUME="SAC-2", PAGES="250-258", YEAR=1984, REFERENCES=12, KEYWORDS="Lan; queueing network; queueing approximation; discrete", ANNOTE="A computer program to predict the performance of local area networks based on an ethernet or other medium is described. The effects of bursty traffic are modeled as packet streams which are initially bulk poisson, but whose clusters spread apart as they propagate through the network. It is shown by example that performance predictions using more conventional poisson assumptions tend to be optimistic, often extremely so a simulator i", } @ARTICLE{Stal84:Local, AUTHOR="W. Stallings", TITLE="Local networks", JOURNAL=acmcs, VOLUME=16, PAGES="3-41", YEAR=1984, REFERENCES=67, KEYWORDS="LAN; survey; standard; system evaluation", ANNOTE="The purpose of this paper is to present a systematic, organized overview of the alternative architectures for and design approaches to local networks. The key elements that determine the cost and performance of a local network are its topology, transmission medium, and medium access control protocols. Transmission media include twisted pair, baseband coaxial cable, and optical fiber. Topologies include bus, tree, and ring. Medium access c", } @ARTICLE{Stan84:Simulations, AUTHOR="John Stankovic", TITLE="Simulations of three adaptive, decentralized controlled, job scheduling algorithms", JOURNAL=cn, VOLUME=8, NUMBER=3, PAGES="199-217", YEAR=1984, REFERENCES=32, KEYWORDS="Discrete event simulation; gpss; process management", ANNOTE="Simulation results of three adaptive, decentralized controlled job scheduling algorithms which assume absolutely no a priori knowledge about jobs are presented. The results provide insight into the workings and relative effectiveness of the three algorithms, as well as insight into the performance of a special type of decentralized control. The simulation approach includes tuning the parameters of each algorithms, and then comparing the three", } @BOOK{Stoy84:LISP, AUTHOR="H. Stoyan and G. Görz", TITLE="{LISP} -- Eine Einführung", ISBN="3-540-13158-2", PUBLISHER="Springer-Verlag", ADDRESS="Berlin, Germany", PAGES=358, YEAR=1984, LANGUAGE="German", KEYWORDS="Programming language; LISP", } @INPROCEEDINGS{Suda84:Protocol, AUTHOR="T. Suda and others", TITLE="Protocol architecture of a tree network with collision avoidance switches", BOOKTITLE=icc, ADDRESS="Amsterdam, Holland", PAGES="423-427", YEAR=1984, KEYWORDS="Computer network; protocol", } @ARTICLE{Swob84:Digitale, AUTHOR="J. Swoboda", TITLE="Digitale Nebenstellenanlagen im dienstintegrierten digitalen Netz {ISDN}", JOURNAL=infspec, VOLUME=7, NUMBER=3, PAGES="138-153", YEAR=1984, LANGUAGE="German", REFERENCES=48, KEYWORDS="PABX; digital network; circuit switching; ISDN", ANNOTE="Nebenstellenanlagen sind Wählervermittlungen, vorzugsweise für den Fernsprechdienst innerhalb eines privaten Geländes. Sie werden in diesem Beitrag aus funktioneller Sicht charakterisiert. Es wird ein Überblick über die realisierbaren Dienstleistungen, die Standards sowie die technischen Mittel und deren Entwicklung gegeben. Als ein Markstein für Standards wird auch das CCITT-Signalisiersystem Nr. 7 behandelt. Die noch in Diskussion", } @ARTICLE{Toba84:Packet, AUTHOR="F. A. Tobagi and R. Binder and B. M. Leiner", TITLE="Packet radio and satellite networks", JOURNAL=ieeecm, VOLUME=22, PAGES="24-40", YEAR=1984, REFERENCES=44, KEYWORDS="Packet switching; satellite; broadcast; ALOHA; CSMA; carrier sense multiple access", ABSTRACT="Highlighting the similarities and differences between packet radio and satellite networks; structure, protocols, applications, and examples.", } @ARTICLE{Tole84:Modeling, AUTHOR="L. F. Tolendino and M. O. Vahle", TITLE="The modeling and simulation of a circuit switched distributed interactive terminal network", JOURNAL=ieeejsac, VOLUME="SAC-2", PAGES="258-263", YEAR=1984, REFERENCES=7, KEYWORDS="Circuit switching; communication network; analytical", ANNOTE="The newly installed terminal switching network at sandia national laboratories has been modeled with analytic and simulation techniques. Using classical queuing techniques and parameters derived from recorded usage data, fair and equitable allocations of interactive computer ports have been made. The allocations were then refined through the use of simulation techniques. The effect of balking as an alternative to entering queues has been shown", } @ARTICLE{Trst84:Alternative, AUTHOR="D. Trstensky and P. Bowron", TITLE="An Alternative Index for the Reliability of Telecommunication Networks", JOURNAL=ieeer, VOLUME="R-33", NUMBER=4, YEAR=1984, REFERENCES=6, KEYWORDS="communication network; network topology; system", ANNOTE="mehr für Telekommunikation, da Annahme, daß Knoten absolut Verbindungen können ausfallen.", } @ARTICLE{Tsao84:Local, AUTHOR="C. D. Tsao", TITLE="A local area network architecture overview", JOURNAL=ieeecom, VOLUME=22, PAGES="7-11", YEAR=1984, REFERENCES=27, KEYWORDS="LAN; survey; bibliography", ANNOTE="Overview of existing LAN-architectures and introduction to the present special issue of IEEE communications on LAN's with 6 articles.", } @ARTICLE{Ullr84:Rechnerarithmetik, AUTHOR="C. Ullrich", TITLE="Rechnerarithmetik und die Weiterentwicklung von {FORTRAN}", JOURNAL=er, VOLUME=26, NUMBER=2, PAGES="71-78", YEAR=1984, LANGUAGE="German", REFERENCES=14, KEYWORDS="FORTRAN; programming language; arithmetic", } @ARTICLE{Vass84:Cyclic, AUTHOR="P.-C. G. Vassiliou", TITLE="Cyclic behaviour and asymptotic stability of non-homogeneous Markov systems", JOURNAL=jap, VOLUME=21, NUMBER=2, PAGES="315-325", YEAR=1984, REFERENCES=14, KEYWORDS="Markov process; transition matrix; transient Markov chain", ANNOTE="In this paper we study the cyclic behaviour of non-homogeneous Markov systems, i.e., the behaviour of the system under the assumption of periodic sequences of transition matrices, input probabilities, output probabilities and total number in the system. We provide a general theorem for the limiting structure of such a system under the cyclic behaviour. We also study the asymptotic stability of non-homogeneous Markov systems and theorems are given", } @TECHREPORT{Vera84:QNAP2, AUTHOR="M. Veran and D. Potier", TITLE="{QNAP2:} A portable enviroment for queueing systems modelling", TYPE="Inria rapports de recherche no. 314", INSTITUTION="INRIA", PAGES="1-44", YEAR=1984, REFERENCES=22, KEYWORDS="Queueing network; realization; bibliography; analytical", ANNOTE="Qnap2 is a portable modelling enviroment providing specific facilities for building, handling and solving queueing network models. It is comprized of a collection of resolution algorithms and of a common user interface for model description, analysis control and result presentation. This paper briefly reviews the highlights of qnap2 and presents the main features of the qnap2 language and of its solvers. Several examples are given as illustrati", } @ARTICLE{Vere84:Moments, AUTHOR="D. Vere-Jones and Y. Ogata", TITLE="On the moments of a self-correcting process", JOURNAL=jap, VOLUME=21, NUMBER=2, PAGES="335-343", YEAR=1984, REFERENCES=9, KEYWORDS="Markov process; moment estimation; moment approximation", ABSTRACT="The existence of ordinary and exponential moments of a point process with conditional intensity of the form $\lambda(t)=\exp(\alpha+\beta (t-\rho n(t)))$ these results form an application of recent theorems of Tweedie (1983 a, b) and are used to obtain laws of large numbers for a range of functionals of the process.", } @ARTICLE{Wah84:Comparative, AUTHOR="B. W. Wah", TITLE="A comparative study of distributed resoure sharing on multiprocessors", JOURNAL=ieeetc, VOLUME="C-33", PAGES="700-711", YEAR=1984, REFERENCES=35, KEYWORDS="Comparison; numerical result; computer network", ANNOTE="In this paper we have studied the interconnection of resoures to multiprocessors and the distributed scheduling of these resources. For a given interconnection network, the resource-mapping problem entails the search of one of the free resources which can be connected to each requesting processor. To prevent the bottleneck of sequential scheduling, a request without any destination address is given to the network, and the network is responsib", } @ARTICLE{Wang84:Probability, AUTHOR="G. X. Wang and G. R. Redinbo", TITLE="Probability of state transition errors in a finite state machine containing soft failures", JOURNAL=ieeetc, VOLUME="C-33", PAGES="269-278", YEAR=1984, REFERENCES=15, KEYWORDS="Error-correcting code; steady state probability; Markov", ANNOTE="A Markov model of a finite state machine realization containing gates and memory elements each subject to internal soft errors is given and a computational method for determining the probability of state transition errors is presented .", } @ARTICLE{Whan84:Separability, AUTHOR="K.-Y. Whang and G. Wiederhold and D. Sagalowicz", TITLE="Separability - an approach to physical database design", JOURNAL=ieeetc, VOLUME="C-33", PAGES="209-223", YEAR=1984, REFERENCES=34, KEYWORDS="Information system; blocking; physical layer", ANNOTE="A theoretical approach to the optimal design of a large multifile physical database is presented", } @ARTICLE{Whit84:Approximations, AUTHOR="W. Whitt", TITLE="Approximations for Departure Processes and Queues in Series", JOURNAL=navres, VOLUME=31, PAGES="499-521", YEAR=1984, REFERENCES=31, KEYWORDS="Queueing system", } @ARTICLE{Will84:Review, AUTHOR="M. B. Williams", TITLE="Review of {ICCC'82}", JOURNAL=cn, VOLUME=8, NUMBER=3, PAGES="231-283", YEAR=1984, KEYWORDS="Reference; documentation; conference report; communication", ANNOTE="ICCC'82 featured a wide spectrum of papers representing the breadth of interests now engaged on various aspects of computer communication. Public service telecommunication networks, office systems, commercial and social applications and human factors were clearly becoming dominant interests. In this review, compiled from reports from several participants whose contributions are acknowledged in the appendix, more than 170 papers have been summar", } @ARTICLE{Wong84:Event, AUTHOR="F. S. Wong and M. R. Ito", TITLE="Design and evaluation of the event-driven computer", JOURNAL=piee, VOLUME=131, PAGES="209-222", YEAR=1984, REFERENCES=16, KEYWORDS="Design; evaluation; large computer; multiprocessor system", ANNOTE={This paper describes a new design methodology for a class of next-generation computers. Our proposal, the event-driven computer (edc), is primarily a data-driven heterogenous system which is supplemented with control-driven activities; such a combined approach is aimed at extracting the advantages of both the "pure" data-driven and control-driven systems while alleviating their shortcomings. Compared to other similar designs edc has the advanta}, } @ARTICLE{Wood84:Response, AUTHOR="C. M. Woodside", TITLE="Response time sensitivity measurement for computer systems and general closed queuing networks", JOURNAL=pe, VOLUME=4, NUMBER=3, PAGES="199-210", YEAR=1984, REFERENCES=8, KEYWORDS="Computer reaction time; service time; closed queueing", ANNOTE="A method is described for measuring the performance sensitivity variable $s=(\partial t/\partial \mu) (\mu/t)$ when $t$ is a mean response time and $\mu$ is the processing rate of one device in a computer system, or one server in a closed or partly open queuing network. The derivative is with respect to a hypothetical change in $\mu$, in a system operating on the identical job sequence. The measurement method is basically an", } @ARTICLE{Yama84:Low, AUTHOR="Jiro Yamada and N. Saito and A. Tamura", TITLE="A low-cost drafting system based on a personal computer", JOURNAL="IEEE computer graphics", VOLUME=4, PAGES="61-65", YEAR=1984, REFERENCES=2, KEYWORDS="Design; method; graphics; microprocessor software", ANNOTE="Many recently announced high-performance cad/cam systems use a mini or mainframe computer as a host. Vendors using this approach emphasize the wide range of capability their systems offer. These systems can do many things, it is true, but without exception they are expensive. Worse yet, the larger a system becomes, the less user-friendly it tends to be. To use these systems, operators must learn many commands and complicated procedures or seek", } @ARTICLE{Zaho84:Distribution, AUTHOR="J. L. Zahorjan", TITLE="The distribution of network states during residence times in product form queueing networks", JOURNAL=pe, VOLUME=4, PAGES="99-104", YEAR=1984, REFERENCES=7, KEYWORDS="Product form; network; number of elements in system", ANNOTE="In this paper we derive the distribution of network states seen by a particular customer while resident at a particular service center. This distribution too has a relatively simple product form. We use this information to explain in an intuitive way the mva solution technique for a more general class of network, those containing load independent processor sharing and last-come-first-served-preemptive-resume service centers. It is hoped t", } @ARTICLE{Bhuy84:Generalized, AUTHOR="L. Bhuyan and D. P. Agrawal", TITLE="Generalized Hypercube and Hyperbus Structures for a Computer Network", JOURNAL=ieeetc, VOLUME="C-33", NUMBER=4, PAGES="323-333", YEAR=1984, KEYWORDS="Parallel computing; computer architecture; hypercube; LAN", ANNOTE="A general class of hypercube structures is presented in this paper for interconnection a network of microcomputers in parallel and distributed environments. The interconnection is based on a mixed radix number system and the technique results in a varietyof hypercube structures for a given number of proccesor, dopending on the desired diameter of the network. A cost optimal realization is obtained through a process of discrete optimization.", } @ARTICLE{Fine84:Demand, AUTHOR="M. Fine and F. A. Tobagi", TITLE="Demand Assigment Multiple Access Schemes in Broadcast Bus Local Area Networks", JOURNAL=ieeetc, VOLUME="C-33", NUMBER=12, PAGES="1130-1159", YEAR=1984, KEYWORDS="Broadcast; LAN; bus; packet switching; protocol", ANNOTE="Local area communications networks based on packet broadcasting techniques provide simple architectures and efficient and flexible operation. Various ring systems and CSMA contention bus systems have been in operation for several years. More recently, a number of distributed DAMA schemes suitable for broadcast bus networks have emerged which provide conflict-free broadcast communications by means of various scheduling techniques.", } @ARTICLE{Iran84:Closed, AUTHOR="K. B. Irani and I. Onyüksel", TITLE="A Closed-Form Solution for the Performance Analysis Of Multiple- Bus Multiprocessor Systems", JOURNAL=ieeetc, VOLUME="C-33", NUMBER=11, PAGES="1004-1012", YEAR=1984, KEYWORDS="Multiprocessor system; interconnection network; bus", ANNOTE="A closed-form solution for the performance analysis of multiple -bus multiprocessor systems is presented. A Markovian queueing network model has been developed to investigate the effects of memory and bus contentions on the system performance. The symmetrical structure of the Markov chains of the queueing model makes it possible to demonstrate that the localbalance is satisfied. Consenquently, the probabilities of the states of Markov chains", } @ARTICLE{Jerr84:Families, AUTHOR="M. Jerrum and S. Skyum", TITLE="Families of Fixed Degree Graphs for Processor Interconnection", JOURNAL=ieeetc, VOLUME="C-33", NUMBER=2, PAGES="190-194", YEAR=1984, KEYWORDS="Graph theory; interconnection network; parallel computing", ABSTRACT="A construction is presented which, given a fixed undirected graph of low degree and smal average path length, yields an infinite sequence of low diameter graphs of increasing order and fixeddegree. As examples of the construction, infinite sequences of low diameter graphs are presented with degrees in the range 3 to 30. Expressed as a function of the order of the graphs, the degree 3 sequence has diameter bounded above by 1.4722 $\log N+0(1)$.", } @ARTICLE{Mark84:Deterministic, AUTHOR="P. Markenscoff", TITLE="A Deterministic Model for Evaluating the Performance of a Multiple Processor System with a Shared Bus", JOURNAL=ieeetc, VOLUME="C-33", NUMBER=3, PAGES="281-285", YEAR=1984, KEYWORDS="Multiprocessor system; bus; performance evaluation", ANNOTE="The operation and performance of a multiple processor system wiph a shared bus is studied. The model developed is applicable to real time computations consisting of two pipelined tasks in which the first task is partitioned into a number of independentsubtasc that are execudet in parallel.", } @ARTICLE{Nizn84:Computer, AUTHOR="Carol A. Niznik", TITLE="Performance evaluation of the computer network dynamic congestion table algorithm", JOURNAL=ieeetc, VOLUME="C-33", NUMBER=2, PAGES="150-159", YEAR=1984, KEYWORDS="ARPAnet; routing algorithm; load balancing; server hunting", ANNOTE="A comparison of the performance of the DCT algorithm, a computercongestion control algorithm's delay table entry generation sub algorithm, is made here with a Pascal implementation of the present ARPAnet SPF Algorithm. The parameters of global throughput, delay, and power versus load are evaluated for 10 and 20 node sections of the ARPAnet, using M/M/1 service and interarrival distributions for the computer node buffer to obtain computer node.", } @ARTICLE{Sche84:Heuristic, AUTHOR="P. Scheuermann and G. Wu", TITLE="Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks", JOURNAL=ieeetc, VOLUME="C-33", NUMBER=9, PAGES="804-811", YEAR=1984, KEYWORDS="Computer network; broadcast; routing algorithm; heuristics", ANNOTE="We examine the problem of broadcasting in a point-to-point computer network where a message, orginated by one node, is transmitted to all nodes, subject to the restriction that an informed no de can call only one of its neighbors during a given time unit. A dynamic programming formulation for optimal broadcasting in general networks is given, and an exact algorithm based on it is developed.", } @ARTICLE{Spar84:Gamma, AUTHOR="D. Sparker and C. S. Raghavendra", TITLE="The Gamma Network", JOURNAL=ieeetc, VOLUME="C-33", NUMBER=4, PAGES="367-373", YEAR=1984, KEYWORDS="Fault tolerance; interconnection network; reliability", ANNOTE="The Gamma network is an interconnection network connecting $N=2$ inputs to $N$ outputs. It is a multistage network with $N$ switches per stage, each of which is a 3 input, 3 output crossbar. The stages are linked via ``power of two'' and indentify connections in such a way that redundant paths exist between the input and o5tput terminals. In this network, a path from a source to a destination may be represented using one of the redundand forms of .", } @ARTICLE{Stan84:Perspective, AUTHOR="John Stankovic", TITLE="A Perspective on Distributed Computer Systems", JOURNAL=ieeetc, VOLUME="C-33", NUMBER=12, PAGES="1102-1115", YEAR=1984, KEYWORDS="Computer network; parallel computing", ANNOTE="Distributed computer systems have been the subject of a vast amount of research. Many prototype distributed computer systems have been bulit at university, industrial, commercial, and government research laboratories, and production systems of all sizes and types have proliferated. It is impossible to surv ey all distributed computing system research. Instead, this pa per indentifies six fundamental distributed computer system.", } @ARTICLE{Wong84:Loop, AUTHOR="F. S. Wong and M. R. Ito", TITLE="A Loop-Structured Switching Network", JOURNAL=ieeetc, VOLUME="C-33", NUMBER=5, PAGES="450-455", YEAR=1984, KEYWORDS="Deadlock avoidance; packet switching; parallel computing", ANNOTE="This paper describes a novel loop-structured switching network intended for highly parallel processing architectures. With loops, it can connect up to $N=L \log L$ pairs of transmitting and receiving devices using only N/2 two-by-two switching elements; thus it is very cost-effective in terms of its component count. Its topology resembles that of the indirect binary $n$-cube network.", } @INPROCEEDINGS{Lutt84:Traffic, AUTHOR="J.-L. Lutton and J. W. Roberts", TITLE="Traffic performance of multi-slot call routing strategies in an integrated services digital network", BOOKTITLE=iss, ADDRESS="Florence, Italy", PAGES="6.1-8 (session 22)", YEAR=1984, REFERENCES=7, KEYWORDS="ISDN; Multi-Slot Connection; Performance Evaluation", } @ARTICLE{Berg84:Process, AUTHOR="J. A. Bergstra and J. W. Klop", TITLE="Process Algebra for Synchronous Communication", JOURNAL="Information and control", VOLUME=60, PAGES="109-137", YEAR=1984, REFERENCES=44, KEYWORDS="Process interaction; concurrency; process algebra", ANNOTE="Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. The rewrite system behind the communication algebra is shown to be confluent and terminating. Further, some relationships are shown to hold between the concepts of merging.", } @INPROCEEDINGS{Burk84:Modelling, AUTHOR="H. J. Burkhardt and Hans Eckert and R. Prinoth", TITLE="Modelling of {OSI-Communication} Services and Protocols using Predicate/Transition Nets", BOOKTITLE="IFIP WG6.1 4th International Workshop on Protocol Specification, Testing and Verification", ORGANIZATION="IFIP", ADDRESS="Mt. Pocono, Pennsylvania", YEAR=1984, KEYWORDS="protocol specification; Petri nets; formal methods", ABSTRACT="Modelling of OSI communication services and protocols requires refinement of the OSI reference model to achieve a communication service model and a communication protocol model. This refinement process, the objective of which is to support the realization of real open systems, is best served by a systematic approach. The mathematical basis of our approach is given by Predicate/Transition sets (an extended form of Petri-nets). These have been further specialized for the purpose of formal specification of OSI services and protocols. The developed methods and tools have successfully been applied to provide a specification of the OSI transport and network service as well as for the specification of the OSI transport classes 2 and 3.", } @ARTICLE{Herz84:Petri, AUTHOR="Otthein Herzog and Wolfgang Reisig and Rüdiger Valk", TITLE="Petri-Netze: ein Abriß ihrer Grundlagen und Anwendungen", JOURNAL=infspec, VOLUME=7, PAGES="20-27", YEAR=1984, LANGUAGE="German", KEYWORDS="Petri net; survey", ABSTRACT="Increasing attention is paid to Petri nets, both in theoretical research and application to problems in system design and specification. After a motivated introduction, fundamental concepts and methods are presented. The second part tries to review some important applications.", } @ARTICLE{Kim84:Method, AUTHOR="Hyun Kim and Kun Soo Chang", TITLE="A method of numerical solution for unsteady state problems: inversion of Laplace transforms by recursive orthogonal polynomial regression", JOURNAL="The Chemical Engineering Journal", VOLUME=29, PAGES="11-18", YEAR=1984, KEYWORDS="Laplace transform; numerical methods; inversion; regression; polynomials", ABSTRACT="An improved method of numerical inversion of Laplace transforms is presented. The method employs a set of recursive orthogonal polynomials and eliminates the need for matrix inversion in the evaluation of regression coefficients. Thus the numerical instability inherent in the conventional numerical inversion technique by curve fitting is avoided. Application examples show that the method is efficient and the result accurate. The method is useful in the study of unsteady state behavior of processes when the analytical solution is not available.", } @ARTICLE{Wilc84:New, AUTHOR="D. J. Wilcox and I. S. Gibson", TITLE="Evaluation of a new method for numerical Laplace transformation and inversion", JOURNAL="International Journal for Numerical Methods in Engineering", VOLUME=20, PAGES="1581-1528", YEAR=1984, KEYWORDS="Laplace transform; inversion; numerical methods", ABSTRACT="The paper presents results obtained by implementation of a new method of Laplace transformation and inversion developed by the authors. Test functions are used to show that basic accuracy is comparable to that obtainable by uniform sampling along the Bromwich contour. The advantage of the new method is seen to be that it generally requires far fewer samples of $F(s)$. It is clarified that the new method does have certain limitations so far as general application is concerned. However, given results indicate that very satisfactory performance may be expected whenever the method is specifically applied to the calculation of transient responses of damped physical systems.", } @ARTICLE{Squi84:Numerical, AUTHOR="William Squire", TITLE="The numerical treatment of Laplace Transforms: 1. The Koizumi inversion method", JOURNAL="International Journal for Numerical Methods in Engineering", VOLUME=20, PAGES="1697-1702", YEAR=1984, KEYWORDS="Laplace transform; inversion; numerical methods", ABSTRACT="An inversion formula based on expansion in a Fourier sine series, proposed by Koizumi in 1935, is examined. It is found to give results of moderate accuracy with relatively little work.", } @ARTICLE{Wilc84:Numerical, AUTHOR="D. J. Wilcox and I. S. Gibson", TITLE="Numerical Laplace transformation and inversion in the analysis of physical systems", JOURNAL="International Journal for Numerical Methods in Engineering", VOLUME=20, PAGES="1507-1519", YEAR=1984, KEYWORDS="Laplace transform; numerical methods; inversion", ABSTRACT="The paper develops a new discrete transform pair which economizes on the number of samples of $F(s)$ and $f(t)$ compared with the standard pair. Whereas the standard pair used uniform sampling along the Bromwich contour, the new method allows a progressive increase in the sampling interval, thereby reducing the number of samples required to meet a specified bandwidth requirement. In the case of the computation of transient responses of physical systems, a reduction by a factor of 10 is not unrealistic. The new transform pair is based on the generalization of fundamental sampling principles. In particular, this leads to an integration contour different from the Bromwich contour.", } @ARTICLE{Adel84:Interactive, AUTHOR="H. H. Adelsberger", TITLE="Interactive modeling and simulation of transaction flow or network models using the {ADA} simulation support enviroment", JOURNAL=simuletter, PAGES="23-32", YEAR=1984, REFERENCES=21, KEYWORDS="Discrete event simulation; ADA", } @ARTICLE{Aho84:UNIX, AUTHOR="A. V. Aho and Dennis M. Ritchie and others", TITLE="The {UNIX} system", JOURNAL=bstj, VOLUME=63, PAGES="1573-1906", YEAR=1984, KEYWORDS="Special issue; operating system; UNIX", ABSTRACT="The second special issue of the Bell System Technical Journal for Unix.", } @ARTICLE{Ajmo84:Degradable, AUTHOR="Marco {Ajmone Marsan} and A. Bobbio and G. Conte and A. Cumani", TITLE="Performance analysis of degradable multiprocessor systems using generalized stochastic Petri nets", JOURNAL="Distributed Processing TC Newsletter Special Issue: Distributed System Architecture", ADDRESS="Torino", PAGES="47-54", YEAR=1984, REFERENCES=7, KEYWORDS="GSPN; generalized stochastic Petri net; reliability measure; performance measure; Markov process; multiprocessor system", } @ARTICLE{Ajmo84:Class, AUTHOR="Marco {Ajmone Marsan} and G. Conte and G. Balbo", TITLE="A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems", JOURNAL=tocs, VOLUME=2, PAGES="93-122", YEAR=1984, REFERENCES=15, KEYWORDS="GSPN; generalized stochastic Petri net; performance evaluation; multiprocessor system", } @ARTICLE{Albi84:Approximating, AUTHOR="S. L. Albin", TITLE="Approximating a Point Process by a Renewal Process, {II:} Superposition Arrival Processes to Queues", JOURNAL=or, VOLUME=32, PAGES="1133-1162", YEAR=1984, REFERENCES=26, KEYWORDS="Superposition; queueing system; analysis", } @ARTICLE{Ali84:Service, AUTHOR="O. M. E. Ali and M. F. Neuts", TITLE="A service system with two stages of waiting and feedback of customers", JOURNAL=jap, VOLUME=21, NUMBER=2, PAGES="404-414", YEAR=1984, REFERENCES=4, KEYWORDS="Queueing system; renewal process; imbedded Markov chain; performance analysis", ABSTRACT="Customers initially enter a service unit via a waiting room. The customers to be served are stored in a service room which is replenished by the transfer of all those in the waiting room at the points in time where the service room becomes empty. At those epochs of transfer, positive random numbers of 'overhead customers' are also added to the service room. Algorithmically tractable expressions for the stationary distributions of queue lengths", } @ARTICLE{Ande84:Coordinated, AUTHOR="G. C. Anderson", TITLE="The coordinated use of five performance evaluation methodologies", JOURNAL=cacm, VOLUME=27, PAGES="119-125", YEAR=1984, REFERENCES=13, KEYWORDS="Performance evaluation; method; Queueing network; hardware monitor; simulation; model; workload", ABSTRACT="During the past twelve years, there has been a rapid evolution of performance evaluation from hit-and-miss measurement to experimental computer science. The progress in the development of algorithms for solving queueing network models, for example, has been remarkable. However, the many recent papers dealing with performance evaluation usally have either presented a new algorithm for solving queueing networks or dealt with only one performanc", } @INPROCEEDINGS{Ango84:Measurement, AUTHOR="P. Angosto and D. Bouesnard", TITLE="Performance Measurement of the {TRANSPAC} Network", BOOKTITLE="Performance of Computer Communication Systems", EDITOR="H. Rudin and W. Bux", PUBLISHER="North-Holland", ADDRESS="Zürich, Switzerland", PAGES="493-504", YEAR=1984, REFERENCES=4, KEYWORDS="Packet switching; network; measurement; traffic generator", } @BOOK{ANSI84:IEEE, AUTHOR="A. N. SI/IEEE", TITLE="{IEEE} 802.2: Logical link control", ISBN="0-471-82748-7", PUBLISHER="IEEE", ADDRESS="New York", PAGES=111, YEAR=1984, KEYWORDS="LAN; IEEE 802.2; standard", } @ARTICLE{Ash84:Carves, AUTHOR="G. R. Ash and V. S. Mummert", TITLE="{AT\\&T} carves New Routes in its Nationwide Network", JOURNAL=attr, VOLUME="aug", PAGES="18-22", YEAR=1984, KEYWORDS="Circuit switching; DNHR network; routing", ABSTRACT="called Dynamic Nonhierarchical Routing (DNHR). The system is called dynamic because the predetermined routing paths of calls can be changed up to ten times a day. It is called nonhierarchical because it eliminates the traditional structured, hierarchical routing system by using the computer-controlled intelligence that AT\\&T has built into its switching and trunking network. This permits calls to be routed more efficiently based on forecasted", } @ARTICLE{Bacc84:End, AUTHOR="François Baccelli and E. Gelenbe and B. Plateau", TITLE="An end-to-end approach to the resequencing problem", JOURNAL=jacm, VOLUME=31, PAGES="474-485", YEAR=1984, REFERENCES=10, KEYWORDS="Packet switching; performance evaluation; analytical model; consistency control; serialization; resequencing", ABSTRACT="The resequencing or serialization problem is of basic interest in distributed systems and computer communication systems. This is because a flow of packets, messages, or updates entering a communication system in chronological order from the same port or from different ports may be disordered. The receiving port must then ensure that these objects are resequenced in the appropriate order before they are fed to the output of the system. In this", } @ARTICLE{Bada84:Modellierung, AUTHOR="A. Badach and B. Wolfinger", TITLE="Modellierung von Kommunikationsprotokollen zum Zwecke der Bewertung von Quittungsstrategien", JOURNAL=aninf, VOLUME=8, PAGES="307-313", YEAR=1984, LANGUAGE="German", REFERENCES=17, KEYWORDS="Communication protocol; analytical model; modeling; prediction; transmission principle; acknowledgement; error control", ABSTRACT="This paper introduces analytical models for comparison of diff erent acknowledgement strategies which support error control during the data exchange phase of communication. In particular, acknowledgement strategies of existing data link protocols are considered. The paper emphasizes the modelling cycle, where one tr ies to obtain realistic (but still analytically tractable) models by means of appropriate stepwise abstractions.", } @ARTICLE{Bake84:Simulation, AUTHOR="D. J. Baker and Anthony Ephremides and J. A. Flynn", TITLE="The design and simulation of a mobile radio network with distributed control", JOURNAL=ieeejsac, VOLUME="SAC-2", PAGES="226-237", YEAR=1984, REFERENCES=21, KEYWORDS="Discrete event simulation; SIMULA; mobile radio", ABSTRACT="A new architecture for mobile networks, called the linked cluster architecture, is described, and methods for implementing this architecture using distributed control techniques are presented. To study the performance of our network structuring algorithms, a simulation model was developed. The use of simula to construct software simulation tools is illustrated. Simulation results are shown for the example of a high frequency (hf) intrat", } @ARTICLE{Bakr84:Simulation, AUTHOR="S. H. Bakry", TITLE="Simulation tools for the investigation of mobile radio telephone traffic problems", JOURNAL="Simulation", PAGES="67-75", YEAR=1984, KEYWORDS="Simulation; mobile radio", } @ARTICLE{Bala84:Kosteng, AUTHOR="V. R. Balakrishnan", TITLE="Kostengünstige Netzwerkknoten mit Ethernet/Cheapernet", JOURNAL="Elektronik", VOLUME=22, PAGES="91-95", YEAR=1984, LANGUAGE="German", KEYWORDS="LAN; Ethernet", } @BOOK{Bank84:Discrete, AUTHOR="J. Banks and J. S. Carson", TITLE="Discrete-event system simulation", PUBLISHER="PRENTICE-HALL, INC", ADDRESS="Englewood Cliffs", PAGES="1-514", YEAR=1984, REFERENCES=3, KEYWORDS="Discrete event simulation; output analysis; survey", } @ARTICLE{Bare84:Discrete, AUTHOR="M. Barel", TITLE="The discrete event simulation computer - {DESC}", JOURNAL=simuletter, PAGES="9-15", YEAR=1984, REFERENCES=12, KEYWORDS="Hardware simulator; discrete event simulation; DESC; discrete event simulation computer", } @TECHREPORT{Baum84:Einführung, AUTHOR="K. Baumann and I. Nagel", TITLE="Einführung in die Textformatierung mit {GML}", TYPE="Interner Bericht", INSTITUTION="Kernforschungsanlage (KFA)", ADDRESS="Jülich, Germany", NUMBER="KFA-ZAM-0050-TEXT-CM", PAGES="1-59", YEAR=1984, LANGUAGE="German", KEYWORDS="Text processing", ABSTRACT="Dieses Dokumentationssystem, die generalized markup language, im folgenden kurz GML genannt, ist eine Teilmenge des von IBM vertriebenen Textverarbeitungssystems DCF (document composition facility). GML ist eine Macrosprache, die den aufbau eines Dokuments beschreibt. Die einzelnen GML-befehle beziehen sich dabei auf die Textelemente, aus denen sich ein Dokument zusammensetzt, und nicht auf Details wie zum Beispiel Anzahl der Leerzeilen", } @ARTICLE{Beck84:System, AUTHOR="R. Becker", TITLE="Design of the S system for data analysis", JOURNAL=cacm, VOLUME=27, PAGES="486-495", YEAR=1984, KEYWORDS="Simulation; output analysis; time series analysis; statistics", } @BOOK{Beck84:Interactive, AUTHOR="R. Becker and J. M. Chambers", TITLE="An interactive environment for data analysis and graphics", ISBN="0-534-03313-X", PUBLISHER="Wadsworth Advanced Book Program", ADDRESS="Belmont, Ca", PAGES=550, YEAR=1984, KEYWORDS="Statistics; output analysis; graphics", } @ARTICLE{Behl84:Personal, AUTHOR="J. Behle", TITLE="Personal Computer von Siemens - Zum Beispiel {PC16}", JOURNAL=siemenstr, VOLUME=7, NUMBER=3, PAGES="200-203", YEAR=1984, LANGUAGE="German", REFERENCES=3, KEYWORDS="Microcomputer; small computer; PC", ABSTRACT="Beschreibung der Hard- und Softwarekomponenten des aktuellen (1984) 16-bit-PC's von Siemens.", } @INPROCEEDINGS{Behr84:System, AUTHOR="J. P. Behr", TITLE="System concept of a {PABX} integrating voice and data", BOOKTITLE=icc, ADDRESS="Amsterdam", YEAR=1984, KEYWORDS="PABX; hybrid switching", } @INPROCEEDINGS{Beil84:COPE, AUTHOR="H. Beilner and J. Mäter", TITLE="{COPE:} past, presence and future", BOOKTITLE="International Conference on Modelling Techniques and Tools for Performance Analysis", ADDRESS="Paris", PAGES="1-20", YEAR=1984, REFERENCES=15, KEYWORDS="Performance evaluation; analytical model; simulation model; Queueing network; realization; cope", ABSTRACT="Cope is a software tool developed for supporting the construction and analysis of computing system performance models. 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", } @ARTICLE{Benb84:Command, AUTHOR="I. Benbasat and Y. Wand", TITLE="Command abbreviation behavior in human-computer interaction", JOURNAL=cacm, VOLUME=27, PAGES="376-383", YEAR=1984, REFERENCES=16, KEYWORDS="Command language; human factors", ABSTRACT="This paper reports the findings of an experiment conducted to observe the command abbreviation behavior of users of an interactive decision-support system.", } @TECHREPORT{Beou84:Dependability, AUTHOR="C. Beounes and J. C. Laprie", TITLE="Dependability evaluation of complex computer systems: stochastic Petri net modelling", TYPE="Rapport de Recherche", INSTITUTION="Centre national de la recherche scientifique", ADDRESS="Toulouse", NUMBER=84086, PAGES="1-19", YEAR=1984, REFERENCES=36, KEYWORDS="Computer system; SPN; stochastic Petri net; reliability", } @ARTICLE{Bhar84:Tool, AUTHOR="Kadaba Bharath-Kumar and Parviz Kermani", TITLE="Performance evaluation tool {(PET):} an analysis tool for computer communication networks", JOURNAL=ieeejsac, VOLUME="SAC-2", PAGES="220-226", YEAR=1984, REFERENCES=8, KEYWORDS="Queueing network; communication network; discrete event simulation; SNA; RESQ; research queueing package", ABSTRACT="The performance evaluation tool (pet) is a package to aid the designers of architecture and protocols of computer networks. It is specially targeted, but not limited, to ibm's systems network architecture (sna) networks. The tool allows its users the capability to easily construct simulation models of networks and conduct traffic related performance studies. Pet is based on the research queueing package (resq) - version 2, which is a package fo", } @ARTICLE{Bobb84:Reduced, AUTHOR="A. Bobbio and A. Cumani and R. Del Bello", TITLE="Reduced Markovian representation of stochastic Petri net models", JOURNAL="Systems Science", ISBN="0137-1223", ADDRESS="Torino", VOLUME=10, NUMBER=2, PAGES="5-23", YEAR=1984, REFERENCES=11, KEYWORDS="Probability Theory; control system; stochastic Theory; reduced Markovian representation; SPN; stochastic Petri net", ABSTRACT="The use of stochastic Petri Net (SPN) models involves the presence of fast and slow transitions. As a consequence, the Markov process, associated to the given SPN has a stiff transition rate matrix. The paper discusses a method for obtaining an approximate solution of the Markov stateprobabilities, by considering separately states with outgoing fast and slow transition rates, thus by integrating smaller and", } @ARTICLE{Bogl84:Traffic, AUTHOR="G. Bogler and W. Killinger", TITLE="{TRAFFIC} - Ein rechnergestütztes Analyseverfahren für Verkehrsmeßdaten von Vermittlungsstellen des Systems {EWSD}", JOURNAL=siemenstr, VOLUME=7, NUMBER=4, PAGES="232-237", YEAR=1984, LANGUAGE="German", REFERENCES=3, KEYWORDS="Switching system; measurement; data analysis; EWSD", ABSTRACT="Rechnergesteuerte Vermittlungssysteme, wie das Digitalvermittlungssystem EWSD, ermöglichen dem Betreiber, parallel zur Steuerung des Vermittlungsverkehrs zahlreiche Informationen über Umfang und Struktur des Verkehrsaufkommens zu gewinnen. Mit Hilfe des Analyseverfahrens TRAFFIC (traffic data analysis), eines Produkts aus der Familie der administration support systems (ADSS), lassen sich die erfassten Verkehrsdaten für den Betrieb und die", } @ARTICLE{Bolc84:Zur, AUTHOR="G. Bolch and W. Bruckner", TITLE="Zur Leistungsanalyse symmetrischer Mehrprozessorsysteme mit dynamischen Prioritäten", JOURNAL=er, VOLUME=26, PAGES="12-19", YEAR=1984, LANGUAGE="German", KEYWORDS="Multiprocessor system; performance evaluation; priority; dynamic priority", ABSTRACT="In der vorliegenden Arbeit wird untersucht, inwieweit sich Antwortzeiten symmetrischer Mehrprozessoranlagen analytisch bestimmen lassen, wenn die Abarbeitungsreihenfolge konkurrierender Prozesse durch prioritäten gesteuert wird. Neben statischen Prioritäten werden vor allem dynamische Prioritäten verschiedener Prioritätsverläufe betrachtet. Außer den bekannten Prioritätsverläufen mit Prioritätsklassenabhängiger Anstiegsrate bzw.", } @INPROCEEDINGS{Bonn84:Retransmission, AUTHOR="M. Bonnati and A. Briccoli and L. Fratta", TITLE="Performance Evaluation of Retransmission Protocols in processor interconnection Networks", BOOKTITLE=globecom, ADDRESS="Atlanta", PAGES="5.5.1-5.5.7", YEAR=1984, REFERENCES=1, KEYWORDS="Interconnection Network; Simulation", } @ARTICLE{Booy84:SNAPL, AUTHOR="M. Booyens and P. S. Kritzinger", TITLE="{SNAPL/1:} a language to describe and evaluate queuing network models", JOURNAL=pe, VOLUME=4, NUMBER=3, PAGES="171-181", YEAR=1984, REFERENCES=17, KEYWORDS="Discrete convolution; model; queueing network; product form; decomposition; simulation language; MVA", ABSTRACT="Recent theoretical developments in queuing theory have made multiclass queuing network models a viable alternative to established simulation methods for the analysis of dynamic systems. Computer software is required to describe and solve such network models. This paper describes a language which provides the human interface multiclass queueing network modelling package. The discussion is illustrated with an example from the language.", } @ARTICLE{Boxm84:Product, AUTHOR="O. J. Boxma and F. P. Kelly and A. G. Konheim", TITLE="The product form for sojourn time distributions in cyclic exponential queues", JOURNAL=jacm, VOLUME=31, NUMBER=1, PAGES="128-133", YEAR=1984, REFERENCES=12, KEYWORDS="Queueing system; multiqueue; loop queue; time in system; product form; network; reversibility", ABSTRACT="Consider a closed cyclic queuing system consisting of $m$ exponential queues. The Laplace-Stieltjes transform of the distribution of the consecutive sojourn times of a customer at the $m$ queues is determined and shown to have a product from. The proof is based on a reversibility argument.", } @ARTICLE{Bron84:Open, AUTHOR="O. Bronshtein and I. B. Gertsbakh", TITLE="An open exponential queuing network with limited waiting spaces and losses: a method of approximate analysis", JOURNAL=pe, VOLUME=4, NUMBER=1, PAGES="31-43", YEAR=1984, REFERENCES=12, KEYWORDS="Approximation; method; exponential queueing network; open queueing network; loss system; Markov process; Jackson net", ABSTRACT="Open exponential queuing networks are considered where each node in a network represents serval exponential servers with a joint waiting space (a buffer) of limited capacity. A customer arriving to a node with fully occupied buffer is lost. An assumption is made that the input flow to each node formed as a mixture of the external poisson flow and the flows coming from other nodes is a poisson flow. Under this assumption, a method of computing n", } @ARTICLE{Brun84:Buffers, AUTHOR="H. Bruneel", TITLE="On buffers with stochastic input and output interruptions", JOURNAL=aeu, VOLUME=38, PAGES="265-271", YEAR=1984, KEYWORDS="Queueing system; M/D/1; stochastic interruption", } @ARTICLE{Budr84:Packet, AUTHOR="Zigmantas L. Budrikis and A. N. Netravali", TITLE="A Packet / Circuit Switch", JOURNAL=atttj, VOLUME=63, NUMBER=8, YEAR=1984, KEYWORDS="packet switching; circuit switching; hybrid system; QPSX; DQDB", ABSTRACT="We propose a switch, suitable for an integrated local communications network, that will support packet switching and circuit switching, with a wide range of bit rates. Key components are two serial memories; a multiplicity of access units, each capable ofwriting and reading uniformly formatted, addresed information.", } @ARTICLE{Butl84:Computer, AUTHOR="T. W. Butler", TITLE="Computer response time and user performance during data entry", JOURNAL=bstj, VOLUME=63, PAGES="1007-1017", YEAR=1984, REFERENCES=18, KEYWORDS="Man-machine interaction; modeling; prediction; user time; response time; information system; traffic source model", ABSTRACT="In this experiment, subjects entered data at a computer terminal while the response time of the computer was varied systematically. Long average response times were found to be associated with significantly longer subject ``think times'', as was an increase in the variability of the computer's response time. Six subjects entered five-character letter groups under ten different computer response time conditions.", } @ARTICLE{Bux84:Local, AUTHOR="W. Bux", TITLE="Performance Issues in Local Area Networks", JOURNAL=ibmsj, VOLUME=23, NUMBER=4, PAGES="351-374", YEAR=1984, KEYWORDS="LAN; delay throughput characteristics; file server; timing problem; overview", } @INPROCEEDINGS{Cell84:Methods, AUTHOR="W. Cellary and M. Stroinski", TITLE="Analysis of Methods of Computer Network Performance Measurement", BOOKTITLE="IFIP", EDITOR="Rudinei Goularte and W. Bux", PUBLISHER="North Holland", YEAR=1984, REFERENCES=83, KEYWORDS="computer network; measurement method; standard user; reference user; software monitor; hardware monitor; hybrid monitor", ABSTRACT="cited in Fehlau 87", } @ARTICLE{Chin84:Packet, AUTHOR="C.-Y. Chin and K. Hwang", TITLE="Packet switching networks for multiprocessors and data flow computers", JOURNAL=ieeetc, VOLUME="C-33", PAGES="981-1003", YEAR=1984, REFERENCES=43, KEYWORDS="Packet switching; computer network; switching system; performance measure; data flow machine", ABSTRACT="Most packet switched multistage networks have been proposed to use a unique path between any source and destination. We propose to add a few extra stages to create multiple paths between any source and destination. Connection principles of such multipath networks for packet switching are presented. Performance of such networks is analyzed for possible use in multiprocessor systems or in data flow computers.", } @ARTICLE{Chri84:Very, AUTHOR="N. H. Christ and A. E. Terrano", TITLE="A very fast parallel processor", JOURNAL=ieeetc, VOLUME="C-33", PAGES="344-351", YEAR=1984, REFERENCES=9, KEYWORDS="Microprocessor; floating point; parallel computing", ABSTRACT="A parallel processor specially designed for an important probl em in theoretical physics is described. The final device will contain 256 nodes running in lock-step in a simd mode with a computational power of 4 billion 22-bit floating point operations per second. Each node is controlled by an intel 80286/287 microprocessor, contains 160 kbits of memory and has a pipelined, microprogrammable arithmetic unit which performs floating point multip", } @ARTICLE{Clau84:HDLC, AUTHOR="H. D. Clausen and F. Sausen", TITLE="{HDLC} und ähnliche Leitungskontrollverfahren für Satellitenkanäle", JOURNAL=ntzarchiv, VOLUME=6, PAGES="151-158", YEAR=1984, LANGUAGE="German", KEYWORDS="HDLC; satellite radio", } @INPROCEEDINGS{Coud84:Techniques, AUTHOR="J.-P. Coudreuse", TITLE="Techniques de Transfer des Informations pour un {RNIS} Integrant la Videocomminication", BOOKTITLE={SUP Telecom Congres"De nouvelles architectures pour la communication"}, ADDRESS="Paris", YEAR=1984, LANGUAGE="French", REFERENCES=2, KEYWORDS="Switching", } @ARTICLE{Boer84:Trunking, AUTHOR="J. de Boer and J. de Jager", TITLE="The trunking of radio channels in private mobile radio networks", JOURNAL=ptr, ADDRESS="Eindhoven", VOLUME=42, PAGES="35-45", YEAR=1984, KEYWORDS="Mobile radio; traffic engineering", } @ARTICLE{Dehe84:Characterization, AUTHOR="P. Deheuvels", TITLE="The characterization of distributions by order statistics and record values - a unified approach", JOURNAL=jap, VOLUME=21, NUMBER=2, PAGES="326-333", YEAR=1984, REFERENCES=28, KEYWORDS="Exponential distribution; geometric distribution", ABSTRACT="It is shown that, in some particular cases, it is equivalent to characterize a continuous distribution by properties of records and by properties of order statistics. As an application, we give a simple proof that if two successive $j$th record values $r(kj)$ and $r(k+1j)$ associated to an i.i.d. Sequence are such that $r(kj)$ and $r(k+1j)-r(kj)$ are independent, then the sequence has to derive from an exponential distribution (in the continuous case).", } @ARTICLE{Mora84:Message, AUTHOR="L. de Moraes and I. Rubin", TITLE="Message delays for a {TDMA} scheme under a non-preemptive priority discipline", JOURNAL=ieeecom, VOLUME="COM-32", PAGES="583-589", YEAR=1984, REFERENCES=18, KEYWORDS="HOL priority; multiple access; queueing system; TDMA; time division multiple access", ABSTRACT="A TDMA access-control operating under a nonpreemptive message-based priority discipline is considered and analyzed. The moment generating function (mgf) of the message waiting-time is obtained, at an arbitrary station of the network, under the assumptions of a Poisson message arrival stream and random message lengths governed by a general distribution, for each priority class. Using results, explicit formulas for any moment of the message delay", } @INPROCEEDINGS{Deva84:Data, AUTHOR="M. Devault and D. Chomel and H. Le Bris and Y. Rouaud", TITLE="From Data to Moving Pictures: A Multi-Bit-Rate Asynchronous Time-Division Equipment at the Subscriber's Premises", BOOKTITLE="ISSLS", ADDRESS="Nice", YEAR=1984, REFERENCES=4, KEYWORDS="ATM; traffic source model", } @ARTICLE{Devr84:Random, AUTHOR="L. Devroye", TITLE="Random variate generation for unimodal and monotone densities", JOURNAL=comp, ADDRESS="London", PAGES="43-68", YEAR=1984, KEYWORDS="application; random number generation; Performance evaluation; method; numerical result", ABSTRACT="The paper presents efficient algorithms for generating random variates with monotone nonincreasing density in (o, infinity) us ing a random number generator with uniform distribution. The inverse of the distribution function is not known explicitly, and the density and its support may be unbounded. The proposed algorithms are based on a combination of inversion and rejection methods with modification to either increase efficiency or to deal wi", } @INPROCEEDINGS{Dias84:Packet, AUTHOR="Daniel M. Dias and M. Kumar", TITLE="Packet Switching in {$N} \Log {N$} Multistage Networks", BOOKTITLE=globecom, ADDRESS="Atlanta", PAGES="5.2.1-5.2.7", YEAR=1984, KEYWORDS="ATM; switching network", } @TECHREPORT{Doct84:Benutzung, AUTHOR="J. Doctor", TITLE="Einführung in die Benutzung der {CRAY}", TYPE="interner Bericht", INSTITUTION="Kernforschungsanlage (KFA)", ADDRESS="Jülich, Germany", NUMBER="KFA-ZAM-0052-CRAY", PAGES="1-77", YEAR=1984, LANGUAGE="German", KEYWORDS="Isolated system; large computer; batch processing", ABSTRACT="Die Cray ist ein Vektorrechner, der sich in seiner Architektur grundlegend von konventionellen Rechnern unterscheidet. Die gegenüber konventionellen Rechnern erreichbare Verbesserung in der CPU-Leistung kann deshalb nicht durch einen konstanten Faktor beschrieben werden, sondern sie hängt wesentlich davon ab, wie geeignet ein Programm für die Vektorarchitektur der Cray ist: Hierzu ist einmal erforderlich, daß das Problem im", } @TECHREPORT{Dong84:Various, AUTHOR="J. J. Dongarra", TITLE="Performance of Various Computers Using Standard linear equations software in a Fortran Environment", TYPE="Technical Memorandum", INSTITUTION="Argonne National Laboratory", ADDRESS="Argonne", NUMBER=23, PAGES=8, YEAR=1984, REFERENCES=3, KEYWORDS="computer performance; LINPACK; linear equation; FORTRAN", } @ARTICLE{Dowd84:Algorithms, AUTHOR="L. W. Dowdy and K. D. Gordon", TITLE="Algorithms for nonintegral degress of multiprogramming in closed q ueuing networks", JOURNAL=pe, PUBLISHER="North Holland", VOLUME=4, NUMBER=1, PAGES="19-29", YEAR=1984, REFERENCES=21, KEYWORDS="Closed queueing network; multiprogramming; method; Performance evaluation; job class; MVA", ABSTRACT="The average degree of multiprogramming (DMP) in closed queuing networks is usually to be an integer. Computational algorithms (i.e., normalization constant methods, mean value analysis methods) iterate on, and require, integral DMP values. However, in practice, the average measured DMP is rarely integer-valued. In this paper we present algorithms for the computation of performance measures when the DMP is allowed to be any positive real-valued", } @ARTICLE{Down84:Proposal, AUTHOR="C. P. Downing", TITLE="Proposal for a digital pseudo-random number generator", JOURNAL=elet, VOLUME=20, PAGES="435-436", YEAR=1984, KEYWORDS="random number generation", ABSTRACT="Multiplicative generator in hardware", } @ARTICLE{Eber84:Evoluation, AUTHOR="I. G. Ebert", TITLE="The evoluation of integrated access towards the {ISDN}", JOURNAL=ieeecm, PAGES="6-11", YEAR=1984, KEYWORDS="Survey; ISDN", ABSTRACT="Short introduction into ISDN philosophy.", } @ARTICLE{Esse84:Bereitstellung, AUTHOR="R. Esser and D. Krekel", TITLE="Bereitstellung von Anwendungssoftware auf Größtrechnern in Rechnernetzen", JOURNAL=aninf, VOLUME=9, PAGES="361-369", YEAR=1984, LANGUAGE="German", REFERENCES=14, KEYWORDS="Large computer; software; comparison; application; runtime/storage efficiency; supercomputer", ABSTRACT="In this article we discuss some criteria for the decision whether an application software system should be implemented on a supercomputer and if so which supercomputer should be preferred. The statements are based on experience with the vector-computers CYBER 205 and CRAY X-MP. Some performance characteristics of these computers are presented which were obtained during the conversion of linear algebra codes.", } @INPROCEEDINGS{Fitz84:File, AUTHOR="N. Fitzpatrick and M. Purser and P. Reilly and G. Starovic", TITLE="The Performance of a File Transfer Protocol across Packet-Switched Networks", BOOKTITLE="IFIP", EDITOR="Rudinei Goularte and W. Bux", PUBLISHER="North-Holland", PAGES="481-492", YEAR=1984, REFERENCES=6, KEYWORDS="File transfer; packet switching; performance evaluation; protocol; measurement", } @ARTICLE{Flem84:Approximate, AUTHOR="P. Fleming", TITLE="An approximate analysis of sojourn times in the {M/G/1} queue with round-robin service discipline", JOURNAL=bstj, VOLUME=63, NUMBER=1, PAGES="1521-1535", YEAR=1984, REFERENCES=8, KEYWORDS="Round robin; queueing approximation; M/G/1; expectation; variance; time in system; waiting time", ABSTRACT="In this paper we investigate the effect of the quantum size on the mean and variance of the response time.", } @ARTICLE{Fran84:Measurement, AUTHOR="William R. Franta and J. R. Heath", TITLE="Measurement and analysis of Hyperchannel networks", JOURNAL=ieeetc, VOLUME="C-33", PAGES="249-261", YEAR=1984, REFERENCES=31, KEYWORDS="Communication protocol; network throughput; LAN; measurement tool; CSMA; carrier sense multiple access", ABSTRACT="We consider hyperchannel adapter local networks, the most oft used approach to realizing very high speed (50 mbit/s transmission rates) local networks. We first describe the channel selection, channel access, and virtual circuit protocols used in hyperchannel networks. Next, to characterize adapter network performance we present and interpret a series of measurement obtained from an adapter testbed network.", } @INPROCEEDINGS{Fruc84:Hybrid, AUTHOR="C. Fruchard and J. Dejean", TITLE="A hybrid switched open network for voice and data services", BOOKTITLE=iss, ADDRESS="Florence", PAGES="paper 211", YEAR=1984, KEYWORDS="Lan", } @ARTICLE{Fuji84:Graphics, AUTHOR="A. Fujimoto and C. G. Perrott and K. Iwata", TITLE="A {3-D} graphics display system with depth buffer and pipeline processor", JOURNAL="IEEE computer graphics", VOLUME=4, NUMBER=6, PAGES="11-23", YEAR=1984, REFERENCES=5, KEYWORDS="Design; graphics; three-dimensional plot; display", ABSTRACT="Lower costs and increased performance of semiconductor memory and microprocessors are driving a trend toward the use of realistic, three-dimensional, colorshaded displays. Raster technology, which has traditionally provided superior color shading, is now able to approach the speed of vector graphics displays. The use of a depth buffer allows hidden surface removal in parallel with update of the raster refresh buffer (see Newman and Sproull).", } @ARTICLE{Furc84:Performability, AUTHOR="D. G. Furchtgott and J. Meyer", TITLE="A performability solution method for degradable nonrepairable systems", JOURNAL=ieeetc, VOLUME="C-33", PAGES="550-554", YEAR=1984, REFERENCES=30, KEYWORDS="Model; finite state stochastic process; degradable system; performance evaluation; fault tolerance; performability; reliability; reward model", } @ARTICLE{Garc84:Uberlegungen, AUTHOR="R. Garcia", TITLE="Überlegungen zur Optimierung der Leistungsfähigkeit von paketvermittelnden Datennetzen", JOURNAL="Frequenz", VOLUME=38, PAGES="278-284", YEAR=1984, LANGUAGE="German", REFERENCES=21, KEYWORDS="Packet switching; network throughput; M/M/1; survey; network flow; optimization; throughput; data network", ABSTRACT="In this paper, an attempt is made to list the main problems encountered in the optimization of a packet-switched data network a nd proposals for solution methods.", } @ARTICLE{Gilo84:Entwicklung, AUTHOR="W. K. Giloi", TITLE={Die Entwicklung der Rechnerarchitektur von der von Neumann-Maschine bis zu den Rechnern der "fünften Generation"}, JOURNAL=er, VOLUME=26, NUMBER=2, PAGES="55-70", YEAR=1984, LANGUAGE="German", REFERENCES=24, KEYWORDS="computer architecture", } @ARTICLE{Gros84:Leistungsanalyse, AUTHOR="S. R. Gross", TITLE="Leistungsanalyse des Lokalen Netzes {COSY}", JOURNAL=aninf, VOLUME=7, PAGES="287-295", YEAR=1984, LANGUAGE="German", REFERENCES=9, KEYWORDS="LAN; open queueing network; exponential queueing network; performance evaluation", ABSTRACT="This paper discusses the performance of a node of the local network COSY. The software of a node consists of different processes which are arranged in three layers. The performance analysis starts with some considerations on the efficieny of a node under heavy constant load. Next a queueing network model for a node will be derived. Each layer of the software will be represented as a M/M/1-system.", } @ARTICLE{Gude84:Berechnung, AUTHOR="J. W. Gudenberg", TITLE="Berechnung maximal genauer Standardfunktionen mit einfacher Mantissenlänge", JOURNAL=er, VOLUME=26, NUMBER=5, PAGES="230-238", YEAR=1984, LANGUAGE="German", REFERENCES=15, KEYWORDS="Mathematics; arithmetic", } @ARTICLE{Gupt84:Relationships, AUTHOR="R. C. Gupta", TITLE="Relationships between order statistics and record values and some characterization results", JOURNAL=jap, VOLUME=21, NUMBER=2, PAGES="425-431", YEAR=1984, REFERENCES=19, KEYWORDS="Exponential distribution; Markov process", ABSTRACT="The similarity between order statistics and record values motivated us, in this paper, to investigate some relationships between the order statistics and the record values. These relationships are employed to characterize a continuous distribution by some moment properties of the spacings of the record values, and hence obtain characterizations of the exponential distribution. Some of the well-known results follow trivially.", } @ARTICLE{Haki84:Adaptive, AUTHOR="S. L. Hakimi and K. Nakajima", TITLE="On adaptive system diagnosis", JOURNAL=ieeetc, VOLUME="C-33", PAGES="234-241", YEAR=1984, REFERENCES=25, KEYWORDS="Error-correcting code; adaptive routing", ABSTRACT="Nakajima proposed to adaptively choose the tests and to seek their results until one can identify a fault-free unit. This fault-free unit may then be used as a tester to identify all faulty units in this paper, we exploit this idea fully and show that one needs the results of at most $(n+2t-2)$ adaptive tests to identify all faulty units in a $t$-faulty-diagnosable system with $n$ units.", } @ARTICLE{Harr84:Distribution, AUTHOR="P. G. Harrison", TITLE="The distribution of cycle times in tree-like networks of queues", JOURNAL="Computer Journal", VOLUME=27, NUMBER=1, PAGES="27-36", YEAR=1984, KEYWORDS="Tree queue; dialog cycle time; distribution; cycle time", ABSTRACT={This paper presents an analysis of the task cycle time performance of "tree-like" queueing networks. If service centers are viewed as nodes and possible task paths as edges, then the network is a closed tree-like network if it has the structure of a tree with additional edges from each leaf back to the root. All servers are assumed to have FCFS queueing discipline and service times with negative exponential probability distributions.}, } @INPROCEEDINGS{Hase84:New, AUTHOR="E. F. Haselton", TITLE="New Switching Concept Integrates Voice and Data Bursts", BOOKTITLE=globecom, PAGES="126-129", YEAR=1984, REFERENCES=4, KEYWORDS="IBCN", } @BOOK{Haye84:Modeling, AUTHOR="I. F. Hayes", TITLE="Modeling and Analysis of Computer Communication Networks", PUBLISHER="Plenum Press", ADDRESS="New York", YEAR=1984, KEYWORDS="Computer network; performance evaluation", } @PHDTHESIS{Hech84:Entscheidungstabellengesteuerte, AUTHOR="R. Hecht", TITLE="Entscheidungstabellengesteuerte dynamische Wirtschaftlichkeitsotimierung von Nachrichtennahbereichsnetzen", SCHOOL="Universität Braunschweig, Fakultät für Maschinenwesen und Elektrotechnik", ADDRESS="Braunschweig, Germany", PAGES=156, YEAR=1984, LANGUAGE="German", REFERENCES=64, KEYWORDS="Network planning; optimization; subscriber premises network", } @ARTICLE{Hegg84:Overview, AUTHOR="H. M. Heggestad", TITLE="An overview of packet-switching communications", JOURNAL=ieeecm, PAGES="24-31", YEAR=1984, REFERENCES=14, KEYWORDS="Packet switching; survey", ABSTRACT="A short survey of packet switched networks is given including introduction into queueing theory.", } @ARTICLE{Heid84:Computer, AUTHOR="P. Heidelberger and S. S. Lavenberg", TITLE="Computer performance evaluation methodology", JOURNAL=ieeetc, VOLUME="C-33", PAGES="1195-1220", YEAR=1984, KEYWORDS="Performance evaluation; simulation; method; event sequencing; survey; performance measure; application", ABSTRACT="We survey the major quantitative methods used in computer performance evaluation, focusing on post-1970 developments and emphasizing trends and challenges. We divide the methods used into three main areas, namely performance measurement, analytic performance modeling, and simulation performance modeling, which we survey in the three main sections of the paper. Although we concentrate on the methods per se, rather than on the results of", } @ARTICLE{Heym84:Asymptotic, AUTHOR="D. P. Heyman and W. Whitt", TITLE="The asymptotic behavior of queues with time-varying arrival rates", JOURNAL=jap, PAGES="142-155", YEAR=1984, REFERENCES=35, KEYWORDS="Model; performance evaluation; arrival process; queueing system; instationary process; waiting time; periodic service", ABSTRACT="This paper discusses the asymptotic behavior of the MI/G/C queue having a Poisson arrival process with a general deterministic intensity. Since traditional equilibrium does not always exist, other notions of asymptotic stability are introduced and investigated. For the periodic case, limit theorems are proved complementing Harrison and Lemoine (1977) and Lemoine (1981).", } @ARTICLE{Hofr84:Interleaved, AUTHOR="M. Hofri", TITLE="Analysis of interleaved storage via a constant-service queuing sy stem with Markov-chain-driven input", JOURNAL=jacm, VOLUME=31, PAGES="628-648", YEAR=1984, REFERENCES=13, KEYWORDS="Memory organization; performance evaluation; analytical model; GB/D/1; waiting time; interleaved memory", ABSTRACT="A popular means of increasing the effective rate of main storage accesses in a large computer is a multiplicity of memory accessible in parallel. Although such an organization usually achieves a net gain in access rate, it also creates new modes of congestion at the storage controller. This paper analyzes the variables that describe such a congestion: queue lengths and delays.", } @ARTICLE{Hoss84:Diagnosis, AUTHOR="S. H. Hosseini and J. G. Kuhl and S. M. Reddy", TITLE="A diagnosis algorithm for distributed computing systems with dynamic failure and repair", JOURNAL=ieeetc, VOLUME="C-33", PAGES="223-234", YEAR=1984, REFERENCES=23, KEYWORDS="Error-correcting code; computer network; distributed control", ABSTRACT={The problem of designing distributed fault-tolerant computing systems is considered. A model in which the network nodes are assumed to possess the ability to "test" certain other network facilities for the presence of failures is employed. Using this model, a distributed algorithm is presented which allows all the network nodes to correctly reach independent diagnoses of the condition (faulty or faulty-free) of all the network nodes and interno}, } @ARTICLE{Hsie84:Routing, AUTHOR="W. Hsieh and I. Gitman", TITLE="Routing Strategies in Computer Networks", JOURNAL=ieeecomp, VOLUME="jun", PAGES="46-56", YEAR=1984, REFERENCES=15, KEYWORDS="packet switching; survey; routing algorithm; SNA; DATAPAC; ARPAnet; TYMNET; comparison", ABSTRACT="In this article, we provide an overview of how the routing-related functions are implemented in a number of current distributed computer networks and compare the performance of the routing functions. The networks reviewed include public data networks Arpanet, Tymnet, Telenet, Datapac, IBM's System Network Architecture, and Digital Equipment C/rporation's Digital Network Architecture.", } @ARTICLE{Ide84:Properties, AUTHOR="H.-D. Ide and J. Sägebarth", TITLE="On properties of random number generators and their influence on traffic simulation", JOURNAL=aeu, VOLUME=38, NUMBER=3, PAGES="207-212", NOTE="also Proc. 10th ITC, Montreal, Oct. 1983", YEAR=1984, REFERENCES=7, KEYWORDS="Shift register sequences; random number generation; test; recursive random generator", ABSTRACT="This paper deals with properties of recursively generated pseudo random numbers and their influence on traffic simulations. In particular, the uniformity of the distribution of such random numbers and their independence of preceding values are investigated on the basis of group theory. An upper limit for the maximum number of independent random events in traffic simulations which can be produced by arbitary random number generators with finite", } @INPROCEEDINGS{Ilya84:Simulation, AUTHOR="M. Ilyas and Hussein Mouftah", TITLE="A simulation study of a new hybrid switching technique for computer networks", BOOKTITLE=icc, ADDRESS="Amsterdam", PAGES="1298-1302", YEAR=1984, KEYWORDS="Switching; data network; hybrid", ABSTRACT="Quasi cut-through", } @ARTICLE{Jenq84:Approximation, AUTHOR="Y.-C. Jenq", TITLE="Approximation for packetized voice traffic in statistical multiplexer", JOURNAL="IEEE", PAGES="256-259", YEAR=1984, REFERENCES=11, KEYWORDS="Statistical multiplexer; Approximation; Packet voice; traffic source model; renewal approximation", } @TECHREPORT{Kall84:Queueing, AUTHOR="P. J. M. Kallenberg", TITLE="Queueing systems with cyclic service, a survey", INSTITUTION="APT NAS-report JNL 215-RO-0121/21 02.05.84", ADDRESS="Hilversum", YEAR=1984, KEYWORDS="Queueing system; polling", } @INPROCEEDINGS{Kamm84:Verminderung, AUTHOR="K. Kammerlander and H. Lorber and E. C. Zscherpe", TITLE="Verminderung von Gleichkanalstörungen in Ballungsgebieten durch die Detektion von Funkzellengrenzen im Netz C der {DBP}", BOOKTITLE="NTG-Fachberichte Bewegliche Funkdienste", VOLUME=90, YEAR=1984, LANGUAGE="German", KEYWORDS="MAT; simulation", } @ARTICLE{Kauf84:Approximation, AUTHOR="J. S. Kaufman", TITLE="Approximation methods for networks of queues with priorities", JOURNAL=pe, VOLUME=4, PAGES="183-198", YEAR=1984, REFERENCES=14, KEYWORDS="Approximation; method; queueing network; priority", ABSTRACT="Queuing network models are commonly used to analyze the performance of computer systems. Unfortunately, the class of queueing network models which can be exactly analyzed excludes cpu priority scheduling disciplines, conspicuously present in most computer systems. A popular approximation technique which we denote the reduced occupancy approximation, is often used to analyze such priority service disciplines because of its simplicity and", } @ARTICLE{Klov84:Detection, AUTHOR="T. Klove and M. J. Miller", TITLE="The detection of errors after error-correction decoding", JOURNAL=ieeecom, VOLUME="COM-32", PAGES="511-518", YEAR=1984, REFERENCES=44, KEYWORDS="Error-correcting code; bit error", ABSTRACT="In data transmission and storage system, combined error correction and detection procedures are often used to provide high reliability. This paper considers the use of separate concatenated codes $c$ and $d$ for error correction and detection, respectively. It examines the error detection performance of coded to determine how the probability of undetected error depends on the choice of $c$ and $d$. A comparison is made of the probability of undetected", } @ARTICLE{Ko84:Delay, AUTHOR="King-Tim Ko and B. R. Davis", TITLE="Delay analysis for a {TDMA} channel with contiguous output and Poisson message arrival", JOURNAL=ieeecom, VOLUME="COM-32", PAGES="707-710", YEAR=1984, REFERENCES=6, KEYWORDS="Network delay; Communication protocol; TDMA; time division multiple access", ABSTRACT="An analysis of the exact delay of a tdma or a loop communication system with a contiguous output and a poisson message arrival process is presented. The nonlinear relationship of a contiguous output with arbitrary arrival process can be expressed by an infinite series. In the case of a poisson message arrival process, the series can be summed to a closed form. The derived result, which is validated by simulation, is a vast improvement over the", } @ARTICLE{Koik84:Experimental, AUTHOR="H. Koike and others", TITLE="An experimental voice store and forward system for a {PBX}", JOURNAL=recl, VOLUME=32, PAGES="1-8", YEAR=1984, KEYWORDS="PABX; voice storage", } @ARTICLE{Konh84:Finite, AUTHOR="A. G. Konheim and M. Reiser", TITLE="Finite capacity queueing systems with applications in computer modelling", JOURNAL=sicomp, VOLUME=7, PAGES="210-229", YEAR=1984, KEYWORDS="Queueing system", } @ARTICLE{Kriz84:Throughput, AUTHOR="J. Kriz", TITLE="Throughput bounds for closed queueing networks", JOURNAL=pe, VOLUME=4, PAGES="1-10", YEAR=1984, REFERENCES=13, KEYWORDS="Closed queueing network; upper bound; lower bound; Performance evaluation; response time; time sharing; Asymptotic analysis", ABSTRACT="Analytical lower and upper bounds for the throughput of closed queueing networks with single and delay (infinite) servers are studied in this paper. The numerical evaluation of these bounds requires a small number of significant operations which is independent of the population $n$. This is in contrast to the exact computation of the throughput which requires at least $O(n)$ operations as $n$ tends to infinity. The bounds are given by simple closed-form", } @ARTICLE{Kröm84:Jahre, AUTHOR="F. Krömer", TITLE="50 Jahre Telex in Deutschland", JOURNAL="Unterrichtsblätter der Deutschen Bundespost", VOLUME=37, NUMBER=3, PAGES="88-114", YEAR=1984, LANGUAGE="German", REFERENCES=18, KEYWORDS="Telex; circuit switching; history", } @INPROCEEDINGS{Kuhn84:Modelling, AUTHOR="P. J. Kühn", TITLE="Modelling and analysis of computer networks - decomposition techniques, transient analysis and protocol implications", BOOKTITLE=icc, ADDRESS="Amsterdam", PAGES="1-9", YEAR=1984, REFERENCES=43, KEYWORDS="Modeling; analysis; decomposition; transient analysis; protocol engineering", } @INPROCEEDINGS{Kulz84:Statistical, AUTHOR="J. J. Kulzer and Warren A. Montgomery", TITLE="Statistical switching architectures for future services", BOOKTITLE=iss, ADDRESS="Florence", PAGES="paper 43a1", YEAR=1984, REFERENCES=1, KEYWORDS="ATM", ABSTRACT={This paper explores the trends to find efficient ways to trans- port variable bandwidth or "bursty" information, a continuum of techniques that can be used for such transport and some of the implications that such approaches have on system architecture. It concludes that a statistical switching technique based on a generalized form of packet switching , FPS, is particularly attractive.}, } @ARTICLE{Kwon84:Integrated, AUTHOR="Raymond Kwong and A. Leon-Garcia", TITLE="Performance analysis of an integrated hybrid-switched multiplex structure", JOURNAL=pe, VOLUME=4, NUMBER=2, PAGES="81-91", YEAR=1984, REFERENCES=14, KEYWORDS="Imbedded Markov chain; Z-transform; time in system; switching type; multiplexer; Erlang B formula; voice/data integration", ABSTRACT="The performance of an integrated voice/data hybrid-switched mul tiplex structure is analyzed. The approach is based on an imbedded two-dimensional Markov chain associated with the voice and data queueing processes, which accounts for their inter-action. Using generating functions, a method for determining exactly the average data delay is given. As an application, an analytical expression for the average data delay is derived for the so-called", } @ARTICLE{Lam84:Self, AUTHOR="K. Lam and M.-Y. Leung and M.-K. Siu", TITLE="Self-organizing files with dependent access", JOURNAL=jap, VOLUME=21, PAGES="343-359", YEAR=1984, REFERENCES=19, KEYWORDS="File management", ABSTRACT="We analyze certain self-organizing filing techniques when accesses are assumed to be dependent on each other. The stream of requests for accessing records in a file is modelled as a Markov chain. A general framework is introduced to obtain the asymptotic search cost of a memory-free self-organizing heuristic. The move-to-front heuristic is studied in detail. A formula for the asymptotic search cost, which generalizes that in the case of indepen", } @ARTICLE{Lee84:Queue, AUTHOR="T. T. Lee", TITLE="{M/G/1/N} queue with vacation time and exhaustive service discipline", JOURNAL=or, VOLUME=32, PAGES="774-784", YEAR=1984, REFERENCES=13, KEYWORDS="Queueing system; M/G/1; server vacation; exhaustive service", } @TECHREPORT{MacN84:Research, AUTHOR="E. A. MacNair", TITLE="The research queueing package: submodels and arrays", INSTITUTION="IBM internal report", ADDRESS="Yorktown Heights", PAGES=18, YEAR=1984, REFERENCES=13, KEYWORDS="Queueing system; MVA; simulation; computer animation; RESQ; research queueing package", } @ARTICLE{Mass84:Operator, AUTHOR="W. A. Massey", TITLE="An operator-analytic approach of the Jackson network", JOURNAL=jap, VOLUME=21, NUMBER=2, PAGES="379-394", YEAR=1984, REFERENCES=6, KEYWORDS="LAN; queue length; heavy traffic approximation; Jackson net", ABSTRACT="Operator methods are used in this paper to systematically analyze the behavior of the jackson network. Here, we consider rarely treated issues such as the transient behavior, and arbitrary subnetworks of the total system. By deriving the equations that govern an arbitrary subnetwork, we can see how the mean and variance for the queue length of one node as well as the covariance for two nodes vary in time.", } @ARTICLE{McKe84:Asymptotic, AUTHOR="J. McKenna and D. Mitra", TITLE="Asymptotic expansions and integral representations of moments of queue lengths in closed Markovian networks", JOURNAL=jacm, PAGES="346-360", YEAR=1984, REFERENCES=16, KEYWORDS="Time sharing; closed queueing network; exponential queueing network; Markov process; bibliography; product form; normalization constant; partition function", ABSTRACT="In this paper a method for calculating the first and higher order moments of the queue lengths for each customer class at each node in a closed Markovian queuing network is presented. The method is based on asymptotic expansions in power of n-1 for the moments of interest. N is a parameter that reflects the size of the network.", } @TECHREPORT{Meer84:Programmsystem, AUTHOR="U. van der Meer and C. Görg", TITLE="Das Programmsystem {MEASURE}", INSTITUTION="Lehrstuhl für AE und Datenfern verarbeitung, RWTH Aachen", ADDRESS="Aachen", PAGES=10, YEAR=1984, LANGUAGE="German", KEYWORDS="PASCAL; runtime/storage efficiency; measurement", ABSTRACT="Das MEASURE - System ermöglicht, beliebige PASCAL Programme hinsichtlich ihres Laufzeitverhaltens zu testen, und stellt die ausgewerteten Meßergebnisse in einer Tabelle zur Verfügung", } @TECHREPORT{Meer84:Makroprozessor, AUTHOR="U. van der Meer and C. Görg", TITLE="Der Makroprozessor {MAC}", INSTITUTION="Lehrstuhl für AE und Datenfer nverarbeitung, RWTH Aachen", ADDRESS="Aachen", PAGES="1-22", YEAR=1984, LANGUAGE="German", KEYWORDS="PASCAL; text processing", ABSTRACT="Das Programm MAC ermöglicht die Anwendung von Makros, vergleichbar den Makros in vielen Assembler-Sprachen, in beliebigen Texten, um deren Erzeugung zu vereinfachen und übersichtlich zu gestalten.", } @ARTICLE{Mela84:Numerical, AUTHOR="B. Melamed and B. Yadin", TITLE="Numerical computation of sojourn-time distributions in queuing networks", JOURNAL=jacm, VOLUME=31, PAGES="839-854", YEAR=1984, REFERENCES=16, KEYWORDS="Exponential queueing network; queueing approximation; time in system", ABSTRACT="In a previous paper the authors proposed a methodology utilizing randomization procedures to approximate sojourn time distributions in arbitrary discrete-state Markovian queuing networks. This paper addresses the computational aspects of the methodology pertaining to implementation. Ways of improving the accuracy of the approximated distribution functions are also discussed.", } @ARTICLE{Moce84:Managing, AUTHOR="J. M. Mocenigo and D. M. Tow", TITLE="Managing a Network that won't sit still", JOURNAL=attr, VOLUME="aug", YEAR=1984, KEYWORDS="Circuit switching; DNHR network", ABSTRACT="If finding a needle in a haystack is difficult, try finding a moving needle in a moving haystack. This was the challenge facing the developers of a network management design for AT\\&T's new dynamic nonhierarchical routing (DNHR) network (see 'Internal Signature: N1.7'). The purpose of a network management is to optimize the performance of the network during overloads or other stresses. Good network management permits more calls to go through", } @ARTICLE{Mouf84:Tradeoffs, AUTHOR="Hussein Mouftah and S. Bhatia", TITLE="Design tradeoffs for local access systems in computer networks", JOURNAL=ieeejsac, VOLUME="SAC-2", PAGES="264-277", YEAR=1984, REFERENCES=21, KEYWORDS="Discrete event simulation; communication network; message switching; concentrator; file transfer", ABSTRACT="A computer-aided design tool has been developed to study the hardware/software structure of various types of data switching systems used in the local loop distribution of computer communication networks. A simulation package is used to evaluate the performance parameters (such as the system throughput, average message delay, and probability of data loss) of local access systems under different input traffic conditions.", } @TECHREPORT{Mühl84:Distributed, AUTHOR="M. Mühlhäuser", TITLE="{DESIGN,} a distributed environment for development and performance evaluation of network applications", INSTITUTION="Universität Karlsruhe Fakultät für Informatik", NUMBER="14/84", PAGES="1-27", YEAR=1984, REFERENCES=21, KEYWORDS="survey; communication protocol; performance evaluation; design; parallel computing; distributed simulation; model; program construction; software monitor; rapid prototyping", ABSTRACT="The development of comfortable higher layer communication protocols and of complex distributed applications requires appropriate tools, including methods for software engineering as well as for performance evaluation. For both areas, the state of the art is outlined. To overcome the limited applicability of the current methods, new approaches are proposed. The concept of design - a distributed environment for development and performance evaluat", } @INPROCEEDINGS{Naga84:Role, AUTHOR="M. Nagasawa and M. Aoki and Y. Yoshida and M. Kato", TITLE="Role of Packet Switching Networks in Future Telecommunications Network - A Proposal of High Speed Packet Switching Network", BOOKTITLE=iccc, ADDRESS="Florence", PAGES="632-637", YEAR=1984, REFERENCES=12, KEYWORDS="ATM", } @ARTICLE{Nain84:Interdeparture, AUTHOR="P. Nain", TITLE="Interdeparture times from a queuing system with preemptive resume priority", JOURNAL=pe, VOLUME=4, NUMBER=2, PAGES="93-98", YEAR=1984, REFERENCES=18, KEYWORDS="Evaluation; Laplace transform; M/M/N; priority; PREHOL priority; interdeparture time", ABSTRACT="Independent of the theoretical interest, the study of output processes has a strong practical motivation since the behavior (performance) of a queuing system is often expressed in terms of throughput. In this study we are concerned with the output processes of a queuing system under a preemptive resume priority. More precisely we consider the following model: customers arrive at a service facility at $r$ priority levels. At each priority", } @ARTICLE{Naka84:Correctness, AUTHOR="Tatuo Nakanishi and D. A. Menasce", TITLE="Correctness and performance evaluation of a two-phase commit-based protocol {FOR} {DDBS}", JOURNAL="Conputer Performance", VOLUME=5, NUMBER=1, PAGES="38-54", YEAR=1984, REFERENCES=20, KEYWORDS="Communication protocol; process management; information system; computation structure; performance evaluation; concurrency; control; algorithm; distributed database", ABSTRACT="Many concurrency control algorithms for distributed database management systems have been proposed in the last few years, but little has been done to analyse their performance. This paper presents the specification of a concurrency control algorithm based on the two-phase commit protocol for distributed databases. A correctness proof of the algorithm and a complete performance analysis are included.", } @ARTICLE{Nels84:Spatial, AUTHOR="R. T. Nelson and L. Kleinrock", TITLE="The spatial capacity of a slotted {ALOHA} multihop packet radio network with capture", JOURNAL=ieeecom, VOLUME="COM-32", PAGES="684-695", YEAR=1984, REFERENCES=18, KEYWORDS="ALOHA; network throughput; packet broadcasting", ABSTRACT="In this paper we determine throughput equations for a packet radio network where terminals are randomly distributed on the plane, are able to capture transmitted signals, and use slotted aloha to access the channel. We find that the throughput of the network is a strictly increasing function of the receiver's ability to capture signals, and depends on the transmission range of the terminals and their probability of transmitting packets. Under i", } @ARTICLE{ORei84:Efficient, AUTHOR="Peter O'Reilly and J. L. Hammond Jr", TITLE="An efficient simulation technique for performance studies of {CSMA/CD} local networks", JOURNAL=ieeejsac, VOLUME="SAC-2", PAGES="238-249", YEAR=1984, REFERENCES=20, KEYWORDS="LAN; discrete event simulation; CSMA; carrier sense multiple access; CSMA/CD", ABSTRACT="A new simulation technique is presented for performance studies of local area networks which use csma/cd as the access protocol. The method requires partitioning the network stations into a few primary stations and the remainder as background stations. The new method is more efficient than conventional discrete-event simulations when the number of network stations is reasonably large. The algorithm and the overall simulation technique are co", } @BOOK{Oren84:Simulation, AUTHOR="T. I. ren and B. P. Zeigler and M. S. Elzas", TITLE="Simulation and model-based methodologies: an integrative view", ISBN="3-540-12884-0", PUBLISHER="NATO ASI series F: Springer-Verlag", ADDRESS="Berlin", VOLUME=10, PAGES=651, YEAR=1984, KEYWORDS="Modeling; simulation", } @ARTICLE{Ott84:Sojourn, AUTHOR="Teunis Ott", TITLE="The sojourn-time distribution in the {M/G/1} queue with processor sharing", JOURNAL=jap, VOLUME=21, NUMBER=2, PAGES="360-378", YEAR=1984, REFERENCES=8, KEYWORDS="Time in system; processor sharing; exponential queueing network; round robin", ABSTRACT="This paper gives, in the form of Laplace-Stieljes transforms and generating functions, the joint distribution of the sojourn time and the number of customers in the system at departure for customers in the general m/g/1 queue with processor sharing (m/g/1/ps). Explicit formulas are given for a number of conditional and unconditional moments, including the variance of the sojourn time of an 'arbitrary' customer.", } @ARTICLE{Petr84:Threshold, AUTHOR="J. D. Petruccelli and S. W. Woolford", TITLE="A threshold {AR(1)} model", JOURNAL=jap, VOLUME=21, NUMBER=2, PAGES="270-286", YEAR=1984, REFERENCES=12, KEYWORDS="Markov process; autoregressive process", ABSTRACT="We consider the model z1 = phi1 zt-1 + phi1 zt-1 + at where phi1, phi2 are real coefficients, not necessarily equal, and the at's are a sequence of i.i.e. random variables with mean o. Necessary and sufficient conditions on the phi's are given for stationarity of the process. Least squares estimators of the phi's are derived and, under mild regularity conditions, are shown to be consistent and asymptotically normal. An hypothesis test is given.", } @ARTICLE{Rama84:Sojourn, AUTHOR="V. Ramaswami", TITLE="The sojourn time in the {GI/M/1} queue with processor sharing", JOURNAL=jap, VOLUME=21, NUMBER=2, PAGES="437-443", YEAR=1984, REFERENCES=6, KEYWORDS="Time in system; processor sharing; exponential queueing network; round robin", ABSTRACT="A queueing model of considerable interest in computer engineering is the processor-sharing model in which the server shares its fixed capacity equally among all units present in the system. Here, we derive the mean and the variance of the equilibrium sojourn time, and deduce that the variance of the sojourn time is larger for the processor-sharing model than for the corresponding fcfs model.", } @ARTICLE{Rans84:Local, AUTHOR="M. N. Ransom", TITLE="Local area data transport service overview", JOURNAL=bstj, VOLUME=63, NUMBER=4, PAGES="1113-1134", YEAR=1984, REFERENCES=25, KEYWORDS="Design; realization; logical network structure; packet switching; ring network", ABSTRACT="A new packet data communication service known as local area data transport (ladt) has been recently introduced. Combining new loop electronics technology with packet switching, ladt provides customers with lowcost data communications within local access and transport areas, as well as access to interexchange data communications networks. This paper describes the need for ladt, its goals, architecture, and services, and also serves as an introdu", } @ARTICLE{Rayc84:ALOHA, AUTHOR="D. Raychaudhuri", TITLE="{ALOHA} with multipacket messages and {ARQ-type} retransmission protocols - throughput analysis", JOURNAL=ieeecom, VOLUME="COM-32", PAGES="148-155", YEAR=1984, REFERENCES=16, KEYWORDS="ALOHA; packet switching; network throughput; ARQ; communication protocol", ABSTRACT="The throughput of slotted aloha systems with multipacket messa ge transmission is evaluated. The conventional strategy of retransmitting the entire message when collisions occur results in a reduction in throughput when compared with the single packet case. However, it is proved analytically that the use of arq-type retransmisssion protocols can provide significant performance improvement.", } @ARTICLE{Reno84:Private, AUTHOR="R. Renoulin and C. Fruchard", TITLE="Private multiservice networks {CARTHAGE} and {LCT} 6500", JOURNAL="Communication and transmission", PAGES="49-60", YEAR=1984, KEYWORDS="Lan", } @ARTICLE{Ritc84:Evolution, AUTHOR="Dennis M. Ritchie", TITLE="The evolution of the {UNIX} time-sharing system", JOURNAL=bstj, VOLUME=63, NUMBER=8, PAGES="1577-1594", YEAR=1984, REFERENCES=15, KEYWORDS="UNIX; operating system; time sharing; file management", ABSTRACT="This paper presents a brief history of the early development of the UNIX tm operating system. It concentrates on the evolution of the file system, the process-control mechanism, and the idea of pipelined commands. Some attention is paid to social conditions during the development of the system. This paper is reprinted from lecture notes on computer science, no. 79, language design and programming methodology, Springer-Verlag, 1980.", } @ARTICLE{Ritc84:Stream, AUTHOR="Dennis M. Ritchie", TITLE="A stream input-output system", JOURNAL=bstj, VOLUME=63, NUMBER=8, PAGES="1897-1910", YEAR=1984, REFERENCES=7, KEYWORDS="UNIX; process management; coroutine; I/O SYSTEM", ABSTRACT="In a new version of the unix tm operating system, a flexible-coroutine-based design replaces the traditional rigid connection between processes and terminals or networks. Processing modules may be inserted dynamically into the stream that connects a user's program to a device. Programs may also connect directly to programs, providing interprocess communication.", } @ARTICLE{Rose84:OSI, AUTHOR="H. J. Rosenberg", TITLE="{OSI-Standards} für die Transport- und Kommunikations- Steuerungsschicht verfügbar", JOURNAL=aninf, VOLUME=7, PAGES="296-299", YEAR=1984, LANGUAGE="German", KEYWORDS="OSI; standard; transport layer; session layer; survey", ABSTRACT="The availability of standards for the transport layer and the session layer is an important step towards the realisation of 'open systems interconnection'. This article gives an overview over the new international drafts and discusses their role in the system as a whole. DIN ISO 8072, 8073, 8326, 8327", } @INCOLLECTION{Saal84:Data, AUTHOR="A. Saal and O. Spaniol", TITLE="Performance evaluation of a data base management system", BOOKTITLE="Modelling and performance evaluation methodology", EDITOR="Emmanuel Baccelli and Guy Fayolle", PUBLISHER="Springer-Verlag", ADDRESS="Berlin", PAGES="393-407", YEAR=1984, REFERENCES=5, KEYWORDS="Analytical model; information system; database; closed queueing network; network throughput; Performance evaluation; DBMS; database management system", ABSTRACT="Transaction behaviour, locking policies and multiprogramming e nviroment are most important factors for the performance of data base management systems. In this paper we deal with a simple model in order to derive quantitative results concerning the tradeoff between several system parameters. The analysis is performed by means of mathematical methods and results are presented either in closed form or as approximations which are easily evaluate", } @INPROCEEDINGS{Sand84:Contribution, AUTHOR="B. Sanders and others", TITLE="A contribution to the techniques of traffic engineering in communication networks with waiting facilities", BOOKTITLE=icc, ADDRESS="Amsterdam", PAGES="56-60", YEAR=1984, KEYWORDS="Queueing system", } @ARTICLE{Saue84:Queueing, AUTHOR="C. H. Sauer and E. A. Mac Nair and James F. Kurose", TITLE="Queueing network simulations of computer communication", JOURNAL=ieeejsac, VOLUME="SAC-2", PAGES="203-220", YEAR=1984, REFERENCES=31, KEYWORDS="Discrete event simulation; Queueing network; communication network; RESQ; research queueing package", ABSTRACT="For queueing network models to be used effectively for simulation of contention systems, appropriate software is needed. The research queueing package (resq) is a general purpose tool for modeling contention for resources and associated system characteristics.", } @BOOK{Scha84:Verteilungsfreie, AUTHOR="E. Schaich and A. Hamerle", TITLE="Verteilungsfreie statistische Prüfverfahren", PUBLISHER="Springer-Verlag", ADDRESS="Berlin", PAGES=345, YEAR=1984, LANGUAGE="German", REFERENCES=150, KEYWORDS="Statistics; time series analysis", } @ARTICLE{Sche84:Delay, AUTHOR="R. Schehrer", TITLE="On a delay-loss system for overload protection", JOURNAL=aeu, VOLUME=38, PAGES="201-206", NOTE="also in Proc. 10th International Teletraffic Congress, Montreal, 1983", YEAR=1984, KEYWORDS="Queueing system; delay loss model; overload control", } @BOOK{Schm84:Modellbildung, AUTHOR="B. Schmidt", TITLE="Modellbildung mit {GPSS-FORTRAN} Version 3", ISBN="3-540-13783-1", PUBLISHER="Fachberichte Simulation, Springer-Verlag", ADDRESS="Berlin", VOLUME=3, PAGES=307, YEAR=1984, LANGUAGE="German", KEYWORDS="Discrete event simulation; GPSS; FORTRAN", } @BOOK{Schm84:Systemanalyse, AUTHOR="B. Schmidt", TITLE="Einführung in die Systemanalyse {GPSS-FORTRAN} Version 3", PUBLISHER="Fachberichte Simulation, Springer-Verlag", ADDRESS="Berlin", VOLUME=1, YEAR=1984, LANGUAGE="German", REFERENCES=45, KEYWORDS="discrete event simulation; GPSS; FORTRAN", } @BOOK{Schm84:Simulator, AUTHOR="B. Schmidt", TITLE="Der Simulator {GPSS-FORTRAN} Version 3", ISBN="3-540-13782-3", PUBLISHER="Fachberichte Simulation, Springer-Verlag", ADDRESS="Berlin", VOLUME=2, PAGES=336, YEAR=1984, LANGUAGE="German", KEYWORDS="discrete event simulation; GPSS; FORTRAN", } @PHDTHESIS{Schm84:Verkehrsanalyse, AUTHOR="W. Schmitt", TITLE="Verkehrsanalyse von Warteschlangennetzen mit Prioritäten", SCHOOL="Universität-Gesamthochschule Siegen, Fachbereich Elektrotechnik", ADDRESS="Siegen, Germany", PAGES=158, YEAR=1984, LANGUAGE="German", REFERENCES=75, KEYWORDS="Queueing system; Queueing network; priority", } @ARTICLE{Schn84:Was, AUTHOR="P. Schnupp and C. Schmauch and U. Leibrandt", TITLE="Was ist Prolog?", JOURNAL=er, VOLUME=26, NUMBER=4, PAGES="194-200", YEAR=1984, LANGUAGE="German", REFERENCES=9, KEYWORDS="Prolog; expert system; programming language", } @ARTICLE{Schr84:Time, AUTHOR="F. Schreiber", TITLE="Time efficient simulation: the {LRE-algorithm} for producing empirical distribution functions with limited relative error", JOURNAL=aeu, VOLUME=38, PAGES="93-98", NOTE="also ITC 10, Montreal, Canada", YEAR=1984, REFERENCES=12, KEYWORDS="Statistics; Bayes statistics", } @ARTICLE{Schr84:State, AUTHOR="F. Schreiber", TITLE="State dependency issues in evaluating distributed database availability", JOURNAL=cn, VOLUME=8, NUMBER=3, PAGES="187-197", YEAR=1984, REFERENCES=15, KEYWORDS="information system; analytical model; Markov process; reliability; memory management; distributed database; state dependent failure rate; availability", ABSTRACT={Quantitative evaluation of availability in distributed database systems must take into account both hardware and software failures. Therefore parameters such as the failure and the recovery probabilities must be evaluated for each "component" of the system. The most difficult problems arise when the evaluation procedure has to deal with failure mechanisms which functionally depend on the state of the system. In this paper, after a short introdu}, } @ARTICLE{Schw84:Algebra, AUTHOR="F. Schwarz", TITLE="Algebra mit dem Computer", JOURNAL="GMD-SPIEGEL", VOLUME=2, PAGES="4-6", YEAR=1984, LANGUAGE="German", KEYWORDS="REDUCE; MACSYMA; symbolic algebraic computation", ABSTRACT="Die beiden bedeutendsten Computer-Algebra systeme, Macsyma und Reduce, sind seit kurzem auch in der GMD verfuegbar. Bis jetzt haben sie zahlreiche Anwendungen auf Probleme gefunden, die im Zusammenhang mit nichtlinearen Differantialgleichungen auftreten.", } @ARTICLE{Serv84:Reseaux, AUTHOR="M. Servel and Andrew Thomas", TITLE="Reseaux de transfert en Videocommunication - la commutation de paquets", JOURNAL="L'echo des Recherches", NUMBER=115, PAGES="33-40", YEAR=1984, LANGUAGE="French", KEYWORDS="ATM; prelude", } @ARTICLE{Shac84:Throughput, AUTHOR="N. Shacham", TITLE="Throughput-delay performance of packet-switching multiple-access channel with power capture", JOURNAL=pe, VOLUME=4, NUMBER=3, PAGES="153-170", YEAR=1984, REFERENCES=8, KEYWORDS="Random multiple access; packet switching; channel type; network delay; priority; tuning; power capture; slotted ALOHA; packet radio", ABSTRACT="Power capture is the ability of a receiver to receive correctly the strongest of several messages that arrive during overlapping intervals. The present of power capture in multiple-access packet switching channels introduces inequality in the access conditions to the channel when packets arrive at the receiver at different power levels. Two models for such channels under slotted ALOHA protocol with power capture are considered.", } @ARTICLE{Stel84:Technologies, AUTHOR="D. J. Stelte and H. J. Kafka and W. J. Paule", TITLE="{AT\\&T} Technologies implementation of local area data transport --- a hardware and software overview", JOURNAL=bstj, VOLUME=63, NUMBER=4, PAGES="1135-1190", YEAR=1984, REFERENCES=19, KEYWORDS="DESIGN; standard; Queueing network; LAN", ABSTRACT="At\\&t technologies has implemented hardware and software components that will provide an economical local area data transport (LADT) service. The AT\\&T technologies LADT generic 1.0 is composed of a No. 1 PSS packet switch, one or more statistical multiplexers called data subscriber interface (DSIS), and an administrative processor (AP) responsible for the administrative functions of the network. This paper describes AT\\&T technologies LADT", } @ARTICLE{Sven84:Token, AUTHOR="J. Sventek and W. Greimann and M. O'Dell and A. Jansen", TITLE="Token Ring Local Area Networks: A Comparison of Experimental and Theoretical Performance", JOURNAL=cn, VOLUME=8, PAGES="301-309", YEAR=1984, REFERENCES=11, KEYWORDS="LAN; token ring; performance model; infinite queue; randomness; access control; congestion; stability; fairness; measurement; packet level", } @ARTICLE{Taka84:Architecture, AUTHOR="Noriyuki Takahashi and others", TITLE="An Architecture for High-Speed Scientific Calculation-Oriented Data Flow Machine", JOURNAL=recl, VOLUME=32, NUMBER=5, PAGES="783-792", YEAR=1984, REFERENCES=20, KEYWORDS="Data flow machine", } @ARTICLE{Walk84:Vor, AUTHOR="B. Walke", TITLE="Über Vor- und Nachteile der Datenpaketvermittlung im Vergleich zur Leitungsvermittlung", JOURNAL=infspec, VOLUME=7, NUMBER=4, PAGES="221-236", YEAR=1984, LANGUAGE="German", REFERENCES=60, KEYWORDS="X.25; circuit switching; packet switching; data network; comparison; cost", ABSTRACT="Der Beitrag erläutert einige wesentliche Unterschiede zwischen leitungs- und paketvermittelter Übertragung über Datennetze und begründet, unter welchen Umständen welche Techniken kostengünstiger realisiert werden kann. Anschließend werden, unter dem Gesichtspunkt des Datenschutzes bei der Übertragung, die dafür in den Kommunikationsprotokollen notwendigen Vorkehrungen beschrieben. Es zeigt sich, daß die paketvermittelte Übertragung.", } @ARTICLE{Whit84:Approximations3, AUTHOR="W. Whitt", TITLE="On approximations for queues, {III:} Mixtures of exponential Distributions", JOURNAL=atttj, VOLUME=63, NUMBER=1, PAGES="163-167", YEAR=1984, KEYWORDS="Queueing network; Approximation; GI/G/1; H/M/1", } @ARTICLE{Yau84:Optimization, AUTHOR="S. S. Yau and W. Hong", TITLE="Performance optimization of a {CSMA} protocol for local computer networks", JOURNAL=ieeetc, VOLUME="COM-", PAGES="812-817", YEAR=1984, REFERENCES=22, KEYWORDS="LAN; TUNING; CSMA; carrier sense multiple access; queueing system; retransmission delay", ABSTRACT="The purpose of this paper is to derive an optimized performance of one version of csma, slotted nonpersistent csma with truncation (CSMA-SNP/TR), which is known to have better throughput performance than all other versions of csma. The optimum average retransmission delay which provides the maximum throughput is presented in terms of message propagation delay, average retransmission delay, and number of terminals. An optimal average", } @ARTICLE{Arth84:Modified, AUTHOR="E. Arthurs and B. W. Stuck", TITLE="A Modified Access Policy for Ethernet Version 1.0 Data Link Layer", JOURNAL=ieeecom, VOLUME=32, NUMBER=8, PAGES="977-979", YEAR=1984, REFERENCES=16, KEYWORDS="Ethernet; LAN; access protocol; analysis", ABSTRACT="A modification to the access policy for Ethernet Version 1.0 is proposed. By placing additional restrictions on each station attempting to transmit, this access policy makes it more likely a successful message transmission will occur and in less time. Theoretical analysis substantiates these claims.", } @INPROCEEDINGS{Dahm84:Token, AUTHOR="N. Dahmen and Ulrich Killat and R. Stecher", TITLE="Performance Analysis of Token Bus and {CSMA/CD} Protocols Derived from {FORCASD} Simulation Runs", BOOKTITLE="Performance of Computer Communications Systems IFIP", PAGES="79-94", YEAR=1984, REFERENCES=11, KEYWORDS="Performance evaluation; LAN; token bus; CSMA/CD; simulation; ccess protocol; FORCASD", ABSTRACT="A comparative performance analysis is given with respect to the CSMA/CD and Token Bus protocols. The model reflects the behavior of the two access methods with Poisson-type traffic or, alternatively, a session-oriented traffic.", } @ARTICLE{Lang84:Waiting, AUTHOR="C. Langaris and B. W. Conolly", TITLE="On the Waiting Time of a two-state Queueing System with Blocking", JOURNAL=jap, VOLUME=21, PAGES="628-638", YEAR=1984, REFERENCES=8, KEYWORDS="Tandem queue; service time", ABSTRACT="An analysis is given of the first-come-first-served waiting-timeprocess in stages 1 and 2 of a two-stage service system with $k$ and $n$ parallel service channels in the first and second stages respectively, and $m$ intermediate waiting places $(k,n>=1,m>=$. The analysis paves the way for an extensive study of the numerical effects on waiting time of blocking in commonly encountered systems of this nature. 'effective service time' in stage 1, defined", } @ARTICLE{Delo84:Large, AUTHOR="C. Delorme and G. Farhi", TITLE="Large Graphs with Given Degree and Diameter", JOURNAL=ieeetc, ISBN="0018-9340", VOLUME="C-33", NUMBER=9, PAGES="857-860", YEAR=1984, REFERENCES=21, KEYWORDS="Graph theory; analysis; interconnection network", } @ARTICLE{Fiol84:Line, AUTHOR="M. Fiol and J. Yebra and I. de Miquel", TITLE="Line Digraph Iterations and the $(d,k)$ Digraph Problem", JOURNAL=ieeetc, ISBN="0018-9340", VOLUME="C-33", NUMBER=5, PAGES="400-403", YEAR=1984, REFERENCES=12, KEYWORDS="Graph theory; communication network; routing algorithm", } @INCOLLECTION{Lawr84:Message, AUTHOR="D. H. Lawrie and D. Padua", TITLE="Analysis of Message Switching with Shuffle-Exchanges in Multiprocessors", BOOKTITLE="IEEE Tutorial: Interconnection Networks", ISBN="0-8186-0574-X", PUBLISHER="IEEE Computer Society Press", ADDRESS="Silver Spring, MD", PAGES="341-348", YEAR=1984, REFERENCES=11, KEYWORDS="Interconnection network; shuffle exchange; multiprocessor; memory; stochastic analysis", ANNOTE={Reprint from "The Proceedings of the Workshop on Interconnection Networks for Parallel and Distributed Processing", 1980, pp. 116 - 123}, } @ARTICLE{Ding84:Digitalvermittlungssystem, AUTHOR="R. Dingeldey and G. Eisenhut and F. Sporleder", TITLE="Digitalvermittlungssystem {EWSD}", JOURNAL=fernmelde, VOLUME=38, NUMBER="4/5", YEAR=1984, LANGUAGE="German", KEYWORDS="TDM; time division multiplex", } @ARTICLE{Ding84:Digitalvermittlung, AUTHOR="R. Dingeldey and G. Eisenhut and F. Sporleder", TITLE="Digitalvermittlung System 12", JOURNAL=fernmelde, VOLUME=38, NUMBER="6/7", YEAR=1984, LANGUAGE="German", KEYWORDS="TDM; time division multiplex", } @ARTICLE{Hert84:Offenes, AUTHOR="G. Hertel", TITLE="Offenes ungeordnetes Verlustsystem mit Unterbrechung der Bedienung durch interne Störungen", JOURNAL=nte, ADDRESS="Berlin", VOLUME=34, NUMBER=7, YEAR=1984, LANGUAGE="German", KEYWORDS="Loss system", } @ARTICLE{Jaco84:Digital, AUTHOR="J.-B. Jacob and George Fiche", TITLE="The {E10.B} Digital Switching System: Field Measuremants of Performances and Traffic Capacities", JOURNAL="Commutation and transmission", VOLUME=6, NUMBER=1, PAGES="95-106", YEAR=1984, KEYWORDS="Measurement", } @ARTICLE{Jage84:Methods, AUTHOR="D. L. Jagerman", TITLE="Methods in Traffic Calculations", JOURNAL=atttj, VOLUME=63, NUMBER=7, YEAR=1984, KEYWORDS="Loss system", } @ARTICLE{Khan84:Address, AUTHOR="F. M. Khanlin", TITLE="Address-Code asynchronous switching and multiplexing of communication channels", JOURNAL="Telecommunication and Radio Engineering", VOLUME=38, NUMBER=6, PAGES="1-7", YEAR=1984, KEYWORDS="packet switching", } @ARTICLE{Mosc84:Definitionen, AUTHOR="R. Mosch", TITLE="Definitionen für einige Grundbegriffe der Nachrichtentechnik", JOURNAL=ntz, VOLUME=37, NUMBER=1, PAGES="28-31", YEAR=1984, LANGUAGE="German", KEYWORDS="Loss system", } @ARTICLE{Nock84:Kollisionsverlust, AUTHOR="R. Nocker", TITLE="Kollisionsverlust bei zeitgerastertem Vielfachzugriff", JOURNAL=aeu, VOLUME=38, NUMBER=1, YEAR=1984, LANGUAGE="German", KEYWORDS="TDM; time division multiplex", } @ARTICLE{Pand84:New, AUTHOR="R. N. Pandya and W. D. Robinson", TITLE="New services and their impact on traffic engineering", JOURNAL="Telecommunication Journal", VOLUME=51, NUMBER=6, YEAR=1984, KEYWORDS="Gos", } @ARTICLE{Scho84:Programmiersprachen, AUTHOR="H. Schoknecht and H. Schumacher", TITLE="Programmiersprachen und Compiler Hilfsmittel für den Umgang mit Computern", JOURNAL="RTP", VOLUME=26, NUMBER=5, PAGES="220-225", YEAR=1984, LANGUAGE="German", KEYWORDS="compiler", } @ARTICLE{Door84:Note, AUTHOR="E. van Doorn", TITLE="A Note on Delbrouck's Approximate Solution to the Heterogeneous blocking Problem", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=11, PAGES="1210-1211", YEAR=1984, KEYWORDS="Loss system", } @ARTICLE{Whit84:Approximations1, AUTHOR="W. Whitt", TITLE="On Approximations for Queues, {I:} Extremal Distributions", JOURNAL=bstj, VOLUME=63, NUMBER=1, YEAR=1984, KEYWORDS="Delay system", } @ARTICLE{Whit84:Approximations2, AUTHOR="W. Whitt and J. G. Klincewicz", TITLE="On Approximations for Queues, {II:} Shape Contraints", JOURNAL=bstj, VOLUME=63, NUMBER=1, YEAR=1984, KEYWORDS="Delay system", } @INPROCEEDINGS{Akiy84:Delay, AUTHOR="I. Akiyoshi and H. Suzuki and H. Nakanishi and H. Sanada and Y. Tezuka", TITLE="Delay analysis for wait system of computer communication network with window control", BOOKTITLE=globecom, ADDRESS="Atlanta", VOLUME=1, YEAR=1984, KEYWORDS="Communication network; window mechanism; flow control", } @INCOLLECTION{Bals84:Decomposability, AUTHOR="Simonetta Balsamo", TITLE="Decomposability in general Markovian networks", BOOKTITLE="Mathematical Computer Performance and Reliability", PUBLISHER="North Holland Publishing Company", PAGES="3-13", YEAR=1984, KEYWORDS="Queueing network; analysis", } @INCOLLECTION{Bals84:Aggregation, AUTHOR="Simonetta Balsamo and G. Iazeolla", TITLE="Aggregation and disaggregation in queueing networks: The principle of product-form synthesis", BOOKTITLE="Mathematical Computer Performance and Reliability", PUBLISHER="North Holland Publishing Company, Amsterdam", PAGES="95-109", YEAR=1984, KEYWORDS="Queueing network; product form; aggregation", } @INPROCEEDINGS{Bets84:Dual, AUTHOR="J. Betser and M. Gerla and G. J. Popek", TITLE="A dual priority {MVA} model for a large distributed system {LOCUS}", BOOKTITLE="Performance", EDITOR="E. Gelenbe", PUBLISHER="North-Holland, Amsterdam", PAGES="51-66", YEAR=1984, KEYWORDS="Queueing network; analysis", } @INPROCEEDINGS{Brow84:Congestion, AUTHOR="P. Brown and Prosper Chemouil and B. Delosme", TITLE="A congestion control policy for signalling networks", BOOKTITLE=iccc, EDITOR="J. M. Bennett and T. Pearcey", ADDRESS="Sydney", PAGES="717-724 (paper 2)", YEAR=1984, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Brue84:Mean, AUTHOR="S. C. Bruell and G. Balbo and P. V. Afshari", TITLE="Mean value analysis of mixed, multiple class {BCMP} networks with load dependent service stations", JOURNAL=pe, VOLUME=4, NUMBER=4, PAGES="241-260", YEAR=1984, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Chin84:Integrated, AUTHOR="I. P. W. Chin and B. T. Dingle", TITLE="An introduction to the integrated services digital network user part of the {CCITT} {CCSS} No. 7", JOURNAL="Telecommunication Journal of Australia", VOLUME=34, NUMBER=2, PAGES="145-155", YEAR=1984, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Dao84:Modelling, AUTHOR="M. Dao and J. Labetoulle", TITLE="Modelling of a node-to-node window flow control in a stote-and-forward network", BOOKTITLE="Performance of Computer-Communication Systems", EDITOR="W. Bux and H. Rudin", PUBLISHER="North-Holland, Amsterdam", ADDRESS="Zürich, Switzerland", PAGES="205-218", YEAR=1984, KEYWORDS="Communication network; window mechanism; flow control", } @ARTICLE{Souz84:Perspective, AUTHOR="E. de Souza and S. S. Lavenberg and R. R. Muntz", TITLE="A perspective on iterative methods for the approximate analysis of closed queueing networks", EDITOR="G. Iazeolla and Christopher Carothers", JOURNAL="Mathematical Performance and Reliability", PUBLISHER="North-Holland, Amsterdam", YEAR=1984, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Devr84:Simple, AUTHOR="L. Devroye", TITLE="A simple algorithm for generating random variates with a log-concave density", JOURNAL=comp, VOLUME=33, NUMBER="3-4", PAGES="247-257", YEAR=1984, KEYWORDS="random variate generation", } @ARTICLE{Devr84:Use, AUTHOR="L. Devroye", TITLE="On the use of probability inequalities in random variate generation", JOURNAL="Journal of Statistical Computation and Simulation", VOLUME=20, PAGES="91-100", YEAR=1984, KEYWORDS="random variate generation", } @ARTICLE{Devr84:Methods, AUTHOR="L. Devroye", TITLE="Methods for generating random variates with Polya characteristic functions", JOURNAL=spl, VOLUME=2, NUMBER=5, PAGES="257-261", YEAR=1984, KEYWORDS="random variate generation", } @ARTICLE{Disn84:Stationary, AUTHOR="R. L. Disney and D. König and V. Schmidt", TITLE="Stationary queue-length and waiting-time distributions in single-server feedback queues", JOURNAL=aap, VOLUME=16, NUMBER=2, PAGES="437-446", YEAR=1984, } @ARTICLE{Eage84:Approximation, AUTHOR="D. L. Eager and K. C. Sevcik", TITLE="An analysis of an approximation algorithm for queueing networks", JOURNAL=pe, VOLUME=4, NUMBER=4, PAGES="275-284", YEAR=1984, KEYWORDS="Queueing network; product form; analysis", } @INPROCEEDINGS{Font84:Stationary, AUTHOR="B. Fontana and C. D. Berzosa", TITLE="Stationary queue-length distributions in an {M/G/1} queue with two non-preemptive priorities and general feedback", BOOKTITLE="Performance of Computer-Communication Systems", EDITOR="W. Bux and H. Rudin", PUBLISHER="North-Holland", ADDRESS="Zürich", PAGES="333-347", YEAR=1984, KEYWORDS="Queueing system; priority; analysis", } @ARTICLE{Fuhr84:Note, AUTHOR="S. W. Fuhrmann", TITLE="A note on the {M/G/1} queue with server vacations", JOURNAL=or, VOLUME=32, NUMBER=6, PAGES="1368-1373", YEAR=1984, KEYWORDS="Queueing system; vacation system; analysis", } @BOOK{Gned84:Handbuch, AUTHOR="B. W. Gnedenko and D. König", TITLE="Handbuch der Bedienungstheorie 2: Formeln und andere Ergebnisse", PUBLISHER="Akademie-Verlag, Berlin", ADDRESS="Berlin", YEAR=1984, LANGUAGE="German", } @ARTICLE{Kelt84:Analytical, AUTHOR="W. David Kelton and A. M. Law", TITLE="An analytical evaluation of alternative strategies in steady-state simulation", JOURNAL=or, VOLUME=32, NUMBER=1, PAGES="169-184", YEAR=1984, KEYWORDS="Simulation; statistical technique", } @ARTICLE{Klin84:Approximations, AUTHOR="J. G. Klincewicz and W. Whitt", TITLE="On approximations for queues, {II:} Shape constraints", JOURNAL=atttj, VOLUME=63, NUMBER=1, PAGES="139-161", YEAR=1984, } @ARTICLE{Law84:Confidence, AUTHOR="A. M. Law and W. David Kelton", TITLE="Confidence intervals for steady-state simulations {I:} A survey of fixed sample size procedures", JOURNAL=or, VOLUME=32, NUMBER=6, PAGES="1221-1239", YEAR=1984, KEYWORDS="Simulation; statistical technique; confidence interval", } @ARTICLE{Mars84:Exact, AUTHOR="G. Marsaglia", TITLE="The exact-approximation method for generating random variables in a computer", JOURNAL="Journal of the American Statistical Association", VOLUME=79, NUMBER=385, PAGES="218-221", YEAR=1984, KEYWORDS="random variate generation", } @ARTICLE{Mars84:Fast, AUTHOR="G. Marsaglia and W. W. Tsang", TITLE="A fast, easily implemented method for sampling from decreasing or symmetric unimodal density functions", JOURNAL="SIAM Journal on Scientific and Statistical Computing", VOLUME=5, NUMBER=2, PAGES="349-369", YEAR=1984, KEYWORDS="random variate generation", } @ARTICLE{Mela84:Randomization, AUTHOR="B. Melamed and M. Yadin", TITLE="Randomization procedures in the computation of cumulative-time distributions over discrete state Markov processes", JOURNAL=or, VOLUME=32, NUMBER=4, PAGES="926-944", YEAR=1984, } @INPROCEEDINGS{Mitr84:Results, AUTHOR="D. Mitra and J. McKenna", TITLE="Some results on asymptotic expansions for closed Markovian networks with state dependent service rates", BOOKTITLE="Performance", EDITOR="E. Gelenbe", PAGES="377-392", YEAR=1984, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Niu84:Inequalities, AUTHOR="S.-C. Niu", TITLE="Inequalities between arrival averages and time averages in stochastic processes arising from queueing theory", JOURNAL=or, VOLUME=32, NUMBER=4, PAGES="785-795", YEAR=1984, KEYWORDS="Queueing theory; number of elements in system", } @ARTICLE{Ott84:Queue, AUTHOR="Teunis Ott", TITLE="On the {M/G/1} queue with additional inputs", JOURNAL=jap, VOLUME=21, NUMBER=1, PAGES="129-142", YEAR=1984, } @ARTICLE{Rein84:Testbetrieb, AUTHOR="M. Reinartz and D. Stroh", TITLE="Testbetrieb des Zentralkanal-Zeichengabesystems Nr. 7", JOURNAL=siemenstr, ADDRESS="München", VOLUME=7, NUMBER=5, PAGES="279-282", YEAR=1984, LANGUAGE="German", KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Roma84:New, AUTHOR="M. Romagnoli and M. Intorrella", TITLE="A new inter-nodal protocol for both connection oriented and connectionless communications in the {ISDN}", BOOKTITLE=iccc, ADDRESS="Sydney", PAGES="644-649 (B10.1)", YEAR=1984, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Rose84:CCITT, AUTHOR="K.-H. Rosenbrock and B. Schladt", TITLE="Das {CCITT-Zeichengabesystem} Nr. 7", JOURNAL="Unterrichtsblätter der Deutschen Bundespost", VOLUME=37, NUMBER=2, PAGES="27-70", YEAR=1984, LANGUAGE="German", KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Ross84:Optimal, AUTHOR="M. H. Rossiter", TITLE="Optimal analysis and design of a packet switching network", BOOKTITLE=iccc, ADDRESS="Sydney", PAGES="427-433 (B10.1)", YEAR=1984, } @INPROCEEDINGS{Schm84:Decompositions, AUTHOR="W. Schmitt", TITLE="On decompositions of Markovian priority queues and their application to the analysis of closed priority queueing networks", BOOKTITLE="Performance", EDITOR="E. Gelenbe", PUBLISHER="North-Holland, Amsterdam", PAGES="393-407", YEAR=1984, KEYWORDS="Queueing network; analysis", } @INCOLLECTION{Schw84:Aggregation, AUTHOR="P. Schweitzer", TITLE="Aggregation methods for large Markov chains", BOOKTITLE="Mathematical Computer Performance and Reliability", EDITOR="G. Iazeolla and Christopher Carothers", PUBLISHER="North-Holland, Amsterdam", PAGES="275-285", YEAR=1984, KEYWORDS="Aggregation; Markov chain", } @INCOLLECTION{Taka84:Discussion, AUTHOR="Yutaka Takahashi", TITLE="Discussion of [Schweitzer 1984]", BOOKTITLE="Mathematical Computer Performance and Reliability", EDITOR="G. Iazeolla and Christopher Carothers", PUBLISHER="North-Holland, Amsterdam", PAGES=286, YEAR=1984, KEYWORDS="Aggregation; Markov chain", } @ARTICLE{Tiet84:Stand, AUTHOR="W. Tietz", TITLE="Stand der internationalen Normung im Bereich des ``Message Handling''", JOURNAL=ntz, VOLUME=37, NUMBER=1, PAGES="20-26", YEAR=1984, LANGUAGE="German", KEYWORDS="Standardization", } @INPROCEEDINGS{Tsoi84:Simulation, AUTHOR="A. C. Tsoi and N. J. Nicholls", TITLE="Simulation of a packet switching network", BOOKTITLE=iccc, ADDRESS="Sydney", PAGES="440-445 (B10.3)", YEAR=1984, } @TECHREPORT{Weis84:Struktur, AUTHOR="W. Weiß", TITLE="Über Struktur, Betriebsweise und Verkehrsleistung eines diensteintegrierten Vermittlungssystems für Fernsprech- und Datenverkehr", TYPE="Bericht über verkehrstheoretische Arbeiten", INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung, Universität Stuttgart", ADDRESS="Stuttgart, Germany", NUMBER=34, YEAR=1984, LANGUAGE="German", KEYWORDS="Switching system; architecture; performance evaluation", } @ARTICLE{Wich84:Correction, AUTHOR="B. A. Wichmann and I. D. Hill", TITLE="Correction to Algorithm {AS} 183: An efficient and portable pseudo-random number generator", JOURNAL=as, VOLUME=33, PAGES=123, YEAR=1984, KEYWORDS="random number generation", } @BOOK{Wirt84:Compilerbau, AUTHOR="Niklaus Wirth", TITLE="Compilerbau", PUBLISHER="Teubner", ADDRESS="Stuttgart", YEAR=1984, LANGUAGE="German", KEYWORDS="Compiler; Modula-2", } @ARTICLE{Melm84:DISS, AUTHOR="M. Melman and M. Livny", TITLE="The {DISS} methodology of distributed system simulation", JOURNAL="Simulation", PAGES="163-176", YEAR=1984, REFERENCES=27, KEYWORDS="Distributed simulation", ABSTRACT="A simulation modeling and programming methodology addressing itself to fully distributed processing systems and based upon the process concept of SIMSCRIPT 11.5 is presented here. The language is based upon the principles of loosely coupled nodes displaying a cooperative autonomy in their indernodal relationship. The two levels of modularity used offers flexibility and extensibility of the models.", } @INPROCEEDINGS{Mier84:Multiple, AUTHOR="J. Mierzwa and Adam M Wolisz", TITLE="A Multiple Random Access Protocol for Bus Structured Local Area Networks Operating in Real-Time Environment", BOOKTITLE="IFAC 9th Triennial World Congress Budapest", ADDRESS="Budapest", PAGES="2713-2718", YEAR=1984, REFERENCES=7, KEYWORDS="Bus; busy sense multiple access; LAN; real time", ABSTRACT="In this paper main techniques used for channel sharing in bus-structured local area networks are briefly discussed in the context of rigorous requirement imposed by process control applications. The preference is given to random-access schemes and a detailed description of a new protocol is presented. The features of this protocol like: fully distributed control, taking into account the message priority, bounded response time are discussed.", } @ARTICLE{Nanc84:Tutorial, AUTHOR="R. E. Nance", TITLE="A tutorial view of simulation model development", JOURNAL=simuletter, VOLUME=15, NUMBER=2, PAGES="16-22", YEAR=1984, REFERENCES=37, KEYWORDS="Simulation model", ABSTRACT="Working from the background of simulation language developments, we develop an understanding of the current status of simulation model development. Factors characterizing the current status include a shift in emphasis from program to model, more commitment to modeling tools, and the lingering impedance of simulation language isolation. Current and future needs are identified.", } @INPROCEEDINGS{Chri84:Development, AUTHOR="Christodoulakis and others", TITLE="Development of a Multimedia Information System for an Office Environment", BOOKTITLE="Very Large Data Bases", PAGES="261-271", YEAR=1984, KEYWORDS="multimedia", } @INPROCEEDINGS{Bonn84:MINDS, AUTHOR="Bonnell and others", TITLE="{MINDS-Multiple} Intelligent Node Document Servers", BOOKTITLE="IEEE 1st International Conference on Office Automation", YEAR=1984, KEYWORDS="multimedia", } @INPROCEEDINGS{Assm84:ISQL, AUTHOR="Assmann and others", TITLE="{ISQL-Language} -- A Uniform Tool For Managing Images and Non-image Data in an {IDBMS}", BOOKTITLE="ISMII IEEE Computer Society International Symposium on Medical Images and Icons