@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", YEAR=1984, KEYWORDS="multimedia", } @ARTICLE{Gold84:Directions, AUTHOR="B. C. Goldstein and A. R. Heller and F. H. Moss and I. Wladawsky-Berger", TITLE="Directions in Cooperative Processing Between Workstations and Hosts", JOURNAL=ibmsj, VOLUME=23, NUMBER=3, PAGES="236-244", YEAR=1984, } @ARTICLE{Murr84:Security, AUTHOR="W. H. Murray", TITLE="Security Considerations for Personal Computers", JOURNAL=ibmsj, VOLUME=23, NUMBER=3, PAGES="297-304", YEAR=1984, } @ARTICLE{Summ84:Overview, AUTHOR="R. C. Summers", TITLE="An Overview of Computer Security", JOURNAL=ibmsj, VOLUME=23, NUMBER=4, PAGES="309-325", YEAR=1984, } @BOOK{Duce84:Distributed, TITLE="Distributed Computing Systems Programme", EDITOR="D. A. Duce", ISBN="0-86341-023-5", PUBLISHER="Peter Peregrinus Ltd", YEAR=1984, } @INCOLLECTION{Benn84:Distributed, AUTHOR="K. H. Bennett", TITLE="Distributed Filestores", BOOKTITLE="distcomp", EDITOR="F. B. Chambers", ISBN="0-12-167350-2", PUBLISHER="Academic Press", YEAR=1984, } @INCOLLECTION{Benn84:Mechanisms, AUTHOR="K. H. Bennett", TITLE="Mechanisms for Distributed Control", BOOKTITLE="distcomp", EDITOR="F. B. Chambers", ISBN="0-12-167350-2", PUBLISHER="Academic Press", YEAR=1984, } @BOOK{Ceri84:Distributed, AUTHOR="S. Ceri and G. Pelagatti", TITLE="Distributed Databases - Principles and Systems", ISBN="0-07-010829-3", PUBLISHER="McGraw-Hill", YEAR=1984, } @BOOK{Cham84:Distributed, AUTHOR="F. B. Chambers", TITLE="Distributed Computing", ISBN="0-12-167350-2", PUBLISHER="Academic Press", YEAR=1984, } @BOOK{Davi84:Security, AUTHOR="Donald W. Davies and W. L. Price", TITLE="Security for Computer Networks", ISBN="0-471-90063-X", PUBLISHER="John Wiley", YEAR=1984, } @TECHREPORT{Digi84:DEQNA, AUTHOR="{Digital Equipment Corporation}", TITLE="{DEQNA} User's Guide", INSTITUTION="Digital Equipment Corporation", NUMBER="EK-DEQNA-UG-PRE", YEAR=1984, } @MISC{Hawe84:Architecture, AUTHOR="B. Hawe", TITLE="An Architecture for Transparently Interconnecting {IEEE} 802 Local Area Networks", PUBLISHER="Digital Equipment Corporation", YEAR=1984, } @TECHREPORT{Kirs84:Provision, AUTHOR="P. T. Kirstein and T. Daniel", TITLE="The Provision of {UK-US} Services for Non-Subsidised Users by the {UCL} Gateway Service Project", TYPE="Internal Note", INSTITUTION="UCL", NUMBER=1664, YEAR=1984, } @ARTICLE{Mull84:Protection, AUTHOR="S. J. Mullender and A. S. Tanenbaum", TITLE="Protection and Resource Control in Distributed Operating Systems", JOURNAL=cn, VOLUME=8, PAGES="421-432", YEAR=1984, } @TECHREPORT{Perl84:Algorithm, AUTHOR="R. Perlman", TITLE="An Algorithm for Distributed Computation of a Spanning Tree in an Extended {LAN}", INSTITUTION="Digital Equipment Corporation", NUMBER="IEEE 802.85*1.97", YEAR=1984, } @INCOLLECTION{Slom84:Building, AUTHOR="M. Sloman and J. F. Magee and J. Kramer", TITLE="Building Flexible Distributed Computing Systems in Conic", BOOKTITLE="Distributed Computing Systems Programme", EDITOR="DA Duce", ISBN="0-86341-023-5", PUBLISHER="Peter Peregrinus Ltd", YEAR=1984, } @BOOK{Brei84:Classification, AUTHOR="L. Breiman and Jerome H. Friedman and R. Olshen and C. Stone", TITLE="Classification and regression trees", PUBLISHER="Wadsworth International Group", YEAR=1984, ABSTRACT="Authorative description of classification trees.", } @ARTICLE{Dutr8402:Experiments, AUTHOR="L. V. Dutra and D. A. Mascarenhas", TITLE="Some experiments with spatial feature extraction methods in multispectral classification", JOURNAL=remote, VOLUME=5, NUMBER=2, PAGES="303-313", YEAR=1984, ABSTRACT="Just using Laplacian operators to get spatial info. Seems basic.", } @INPROCEEDINGS{Fitz84:Image, AUTHOR="J. M. Fitzpatrick and J. J. Grefenstette and D. Van Gucht", TITLE="Image registration by genetic search", BOOKTITLE="IEEE SouthEast Conference", PAGES="460-464", YEAR=1984, ABSTRACT="When comparing two digital images of a moving physical object, it may be necessary to find a transformation from one image into the other. Motion more complicated than rotation and translation requires a description involving several parameters. The determination of the transformation can be described as a search for an optimal point in parameter space. The genetic search method has been applied to this optimisation problem", } @ARTICLE{Gema8406:Stochastic, AUTHOR="D. Geman and S. Geman", TITLE="Stochastic relaxation, Gibbs distribution and Bayesian restoration of images", JOURNAL=ieeepami, VOLUME=6, NUMBER=6, PAGES="721-741", YEAR=1984, } @ARTICLE{Hill84:Connection, AUTHOR="W. D. Hillis", TITLE="The connection machine: a computer architecture based on cellular automata", JOURNAL="Physica", VOLUME=10, NUMBER="D", PAGES="213-228", YEAR=1984, ABSTRACT="This paper describes the connection machine, a programmmable computer based on cellular automata. The essential idea behind the connection machine is that a regular locally-connected cellular array can be made to behave as if the processing cells are connected into any desired topology. When the topology of the machine is chosen to match the topology of the application program, the result is a fast, powerful computing engine. The connection machine was originally designed to implement knowledge retrieval operations in AI programs, but the hardware and the programming techniques are apparently applicable to a much larger class of problems. A machine with 100,000 processing cells is currently being constructed.", } @INCOLLECTION{Jadz84:Inside, AUTHOR="C. Jadzia and M. Bramer", TITLE="Inside an expert system : a rational reconstruction of the Mycin consultation system", BOOKTITLE="Artifical Intelligence - Tools, Techniques and Applications", EDITOR="T. Eisenstad and Oshea M.", PUBLISHER="Harper and Row", ADDRESS="New York", PAGES="453-497", YEAR=1984, ABSTRACT="Describes the diagnosis and prescription expert system mYCIN. The Ability to reason with uncertainty is an important feature of MYCIN. Concludes that the approach is geared to consultation systems and is not applicable to general problem solving.", } @ARTICLE{Kitt84:Contextual, AUTHOR="J. Kittler and J. Foglein", TITLE="Contextual classification of multispectral pixel data", JOURNAL=image, VOLUME=2, PAGES="13-29", YEAR=1984, } @ARTICLE{Nazi8405:Low, AUTHOR="A. M. Nazif and M. D. Levine", TITLE="Low level image segmentation : an expert system", JOURNAL=ieeepami, VOLUME=6, NUMBER=5, PAGES="555-577", YEAR=1984, ABSTRACT="A major problem in robotic vision is the segmentation of images of natural scenes in order to understand their content. This paper presents a new solution to the image segmentation problem that is based on the design of a rule based expert system. General knowledge about low level properties of processes employ the rules to segment the image into uniform regions with connected lines. In addition to the knowledge rules, a set of control rules are also employed. These include meta rules that embody inference about the order in which the knowledge rules are matched. They also incorporate focus of attention rules that determine the path of processsing within the image. Furthermore, an additional set of higher level rules dynamically alters the processing strategy. This paper discusses thje structure and contenet of the knowledge and control rules for image segmentation.", } @ARTICLE{Pent8406:Fractal, AUTHOR="A. P. Pentland", TITLE="Fractal based descriptions of natural scenes", JOURNAL=ieeepami, VOLUME=6, NUMBER=6, PAGES="661-674", YEAR=1984, } @ARTICLE{Tom8402:Automated, AUTHOR="C. H. Tom and L. W. Miller", TITLE="An automated land-use mapping comparison of the Baysian maximum liklihood and linear discriminant analysis algorithms", JOURNAL="Photogrametric Engineering and Remote Sensing", VOLUME=50, NUMBER=2, PAGES="193-207", YEAR=1984, } @ARTICLE{Vali8411:Theory, AUTHOR="L. Valiant", TITLE="A theory of the learnable", JOURNAL=cacm, VOLUME=27, NUMBER=11, PAGES="1134-1142", YEAR=1984, ABSTRACT="Humans appear to be able to learn new concepts without needing to be programmed explicitly in any conventional sense. In this paper we regard learning as the phenomenon of knowledge acquisition in the absense of specific programming. We give a precise methodology for dtudying this phenomenon from a computational viewpoint. It consists of choosing an appropriate information gathering mechanism, the learning protocol, and exploring the class of concepts that can be learnt using it in a reasonable (polynomial) number of steps. Although inherent algorithmic complexity appears to set serious limits to the range of concepts that can be learnt, we show that there are some important nontrivial classes of propositional concepts that can be learnt in a realistic sense.", } @INPROCEEDINGS{Wilk84:Role, AUTHOR="G. G. Wilkinson and P. F. Fisher", TITLE="The role of expert systems in remote sensing", BOOKTITLE="Integrated approaches in remote sensing", PAGES="353-360", YEAR=1984, } @TECHREPORT{ISO84:Protocol, AUTHOR="I. S. O", TITLE="Protocol for the provision of the Connection Orientated Network Service over an underlying Connectionless Mode Service", INSTITUTION="ISO", NUMBER="SC6/N3440", YEAR=1984, } @INBOOK{Cook84:MLA, AUTHOR="Claire Kehrwald Cook", TITLE="The {MLA's} Line by Line How to Edit Your Own Writing", CHAPTER=1, PUBLISHER="Modern Language Association of America, Houghton Mifflin Company", PAGES="1-18", YEAR=1984, } @INPROCEEDINGS{Mitr84:Optimum, AUTHOR="D. Mitra and I. Mitrani", TITLE="Analysis and Optimum Per\-formance of Two Message-Passing Parallel Processors Synch\-ronized by Roll\-back", BOOKTITLE="Performance", PUBLISHER="North-Holland", PAGES="35-50", YEAR=1984, } @INPROCEEDINGS{Zdon84:Object, AUTHOR="S. Zdonik", TITLE="Object Management System Concepts", BOOKTITLE="ACM-SIGOA Conference on Office Information Systems", PAGES="13-19", YEAR=1984, } @ARTICLE{Baye84:Verteilte, AUTHOR="R. Bayer and Klaus Elhardt and Werner Kiessling and Dieter Killar", TITLE="Verteilte Datenbanksysteme", JOURNAL=infspec, NUMBER=7, YEAR=1984, LANGUAGE="German", REFERENCES=70, ABSTRACT="The concept of distributed database systems that evolved in the middle of the seventies is still subject of controversial discussion. The most difficult problems in distributing a database system over a computer network are data partioning, query processing, synchronization of transactions, and recovery. This overview paper discusses the main prerequisites for successful application of distributed database systems and the problems in the above-mentioned areas.", } @INPROCEEDINGS{Thar84:Buffer, AUTHOR="A. K. Thareja and Satish K. Tripathi", TITLE="Buffer Sharing in a Dynamic Load Environment", BOOKTITLE=infocom, ORGANIZATION="IEEE", YEAR=1984, } @ARTICLE{Garc84:Überlegungen, AUTHOR="R. Garcia", TITLE="Überlegungen zur Optimierung der Leistungsfähigkeit von paketver mittelnden Datennetzen", JOURNAL="Frequenz", ADDRESS="Germany", 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{May84:OCCAM, AUTHOR="Martin May and David E. Taylor", TITLE="{OCCAM} - an overview", JOURNAL="Microprocessors and Microsystems", ADDRESS="Great Britain", VOLUME=8, PAGES="73-79", YEAR=1984, KEYWORDS="Parallel computing; TRANSPUTER; OCCAM", } @INPROCEEDINGS{McMi84:Interconnection, AUTHOR="R. J. McMillen", TITLE="A Survey of Interconnection Networks", BOOKTITLE=globecom, ADDRESS="Atlanta, Georgia", PAGES="5.1.1-5.1.9", YEAR=1984, REFERENCES=52, KEYWORDS="Interconnection Network", } @PHDTHESIS{As84:Modelling, AUTHOR="H. van As", TITLE="Modelling and Analysis of Congestion Control Mechanisms in Packet Switching Networks", SERIES="Report on Studies in Congestion Theory", SCHOOL="University of Stuttgart", ADDRESS="Stuttgart, Germany", VOLUME=38, YEAR=1984, LANGUAGE="German", KEYWORDS="Overload control; analysis; simulation", } @PHDTHESIS{Yim84:Durchsatzruckgang, AUTHOR="C.-H. Yim", TITLE="Durchsatzrückgang in überlasteten Wählvermittlungen", SCHOOL="Universität Braunschweig, Fakultät für Maschinenbau und Elektrotechnik", ADDRESS="Braunschweig, Germany", PAGES=163, YEAR=1984, LANGUAGE="German", REFERENCES=118, KEYWORDS="Queueing system; switching system; overload control", } @ARTICLE{Suck8412:ISDN, AUTHOR="M. Suckfüll", TITLE="{ISDN,} das Universalnetz für alle Individualkommunikationsdienste", JOURNAL=ntz, ISBN="0027-707X", PUBLISHER="VDE-Verlag", ADDRESS="Germany", VOLUME=37, NUMBER=12, PAGES="770-776", YEAR=1984, LANGUAGE="German", REFERENCES=14, KEYWORDS="ISDN; introduction strategy; overview; OSI; IDN; circuit switching; packet switching", } @ARTICLE{Ackr8410:Stationary, AUTHOR="M. H. Ackroyd", TITLE="Stationary and Cyclostationary finite Buffer behaviour Computationvia Levinson's Method", JOURNAL=atttj, VOLUME=63, NUMBER=10, PAGES="2160-2170", YEAR=1984, KEYWORDS="Data traffic; computer network", } @ARTICLE{Apan84:Distribution, AUTHOR="V. V. Apanasovich and O. M. Tikhonenko", TITLE="Distribution of the overall message length in a single channel", JOURNAL=ec, ADDRESS="SU", VOLUME=22, PAGES="63-67", YEAR=1984, KEYWORDS="Data traffic; computer network", } @ARTICLE{Bär8410:Verlustwahrscheinlichkeit, AUTHOR="M. Bär", TITLE="Verlustwahrscheinlichkeit geordneter Systeme mit gestörten Kanälenmit kurzen Belegungen", JOURNAL=nte, ADDRESS="Germany", VOLUME=34, NUMBER=10, PAGES="DDR", YEAR=1984, LANGUAGE="German", KEYWORDS="Loss system", } @PHDTHESIS{As84:Modellierung, AUTHOR="H. van As", TITLE="Modellierung und Analyse von Überlast-Abwehrmechanismen in Paketvermittlungsnetzen", SERIES="Bericht über verkehrstheoretische Arbeiten", SCHOOL="Institut für Nachrichtenvermittlung und Datenverarbeitung, Universität Stuttgart", ADDRESS="Stuttgart, Germany", VOLUME=38, YEAR=1984, LANGUAGE="German", KEYWORDS="Packet switching; overload control; performance evaluation", } @PHDTHESIS{Weiß84:Über, AUTHOR="W. Weiß", TITLE="Über Struktur, Betriebsweise und Verkehrsleistung eines diensteintegrierten Vermittlungssystems für Fernsprech- und Datenverkehr", SERIES="Bericht über verkehrstheoretische Arbeiten", SCHOOL="Institut für Nachrichtenvermittlung und Datenverarbeitung, Universität Stuttgart", ADDRESS="Stuttgart, Germany", VOLUME=34, YEAR=1984, LANGUAGE="German", KEYWORDS="Switching system; architecture; performance evaluation", } @INPROCEEDINGS{Aage84:Traffic, AUTHOR="F. A. Aagesen", TITLE="Traffic Studies on {UNINETT}", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES=22, YEAR=1984, KEYWORDS="X.25; computer network; communication network; simulation; traffic source model; network protocol; network throughput", ABSTRACT="UNINETT is a X.25 -based computer communication network between universities and research establishments in Norway. This paper summarizes the traffic activities performed in the milieu related to this network, and presents details from the simulations carried out with the simulator EXWYM. A central problem when designing computer networks is the influence caused by the traffic from the different applications on the network", } @ARTICLE{Abbo8404:Digital, AUTHOR="G. F. Abbott", TITLE="Digital Space Division - A Technique for Switching High-Speed Data signals", JOURNAL=ieeecm, VOLUME=22, NUMBER=4, PAGES="32-38", YEAR=1984, KEYWORDS="High speed; data switching; digital transmission; digital network; space division multiplex", } @ARTICLE{Acam8408:New, AUTHOR="A. S. Acampora and M. G. Hluchyj", TITLE="A New Local Area Network Architecture Using a Centralized Bus", JOURNAL=ieeecm, VOLUME=22, NUMBER=8, PAGES="12-21", YEAR=1984, KEYWORDS="Lan", } @INPROCEEDINGS{Ahls84:Trafikövervakningen, AUTHOR="B. V. M. Ahlstedt", TITLE="Trafikövervakningen i Helsingfors telefonanläggningar under 50 år", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES=21, YEAR=1984, LANGUAGE="Finnish", KEYWORDS="Traffic measurement", } @ARTICLE{Albi84:Simulation, AUTHOR="S. L. Albin", TITLE="Simulation to Develop and Test Queue Approximations: A Case Study", JOURNAL="Simulation", VOLUME=43, PAGES="279-285", YEAR=1984, KEYWORDS="Simulation; queueing approximation", } @ARTICLE{Hopn8404:Digital, AUTHOR="E. Hopner and M. A. Patten", TITLE="The Digital Data Exchange - A Space-Division Switching System", JOURNAL=ibmjrd, VOLUME=28, NUMBER=4, PAGES="444-453", YEAR=1984, KEYWORDS="Switching system", } @INPROCEEDINGS{Arhn84:Erik, AUTHOR="J. Arhnung and V. B. Iversen", TITLE="Erik Brockmeyer og Teletrafikteorien", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="I.1-18", YEAR=1984, LANGUAGE="Danish", KEYWORDS="Traffic theory", } @ARTICLE{Assa84:Multivariate, AUTHOR="D. Assaf and N. A. Langberg and T. H. Savits and M. Shaked", TITLE="Multivariate Phase-type Distributions", JOURNAL=or, VOLUME=32, NUMBER=3, PAGES="688-702", YEAR=1984, KEYWORDS="failure; dependency; dependent components", } @ARTICLE{Bart84:Demand, AUTHOR="S. M. Barta and M. L. Honig", TITLE="Analysis of a Demand Assignment {TDMA} Blocking System", JOURNAL=atttj, VOLUME=63, NUMBER=1, PAGES="89-114", YEAR=1984, KEYWORDS="Analysis; TDMA; blocking; demand assignment", } @ARTICLE{Bash84:Single, AUTHOR="G. P. Basharin and K. Y. Samuylov", TITLE="A Single Phase Queueing System with Two Types of Arrivals and Relative Priority", JOURNAL=ec, ADDRESS="SU", YEAR=1984, KEYWORDS="Queueing system; phase-type model; arrival process; priority", } @ARTICLE{Bayb8405:Transmission, AUTHOR="I. Baybars and K. O. Kortanek", TITLE="Transmission Facility Planning in Telecommunications Networks: A Heuristic Approach", JOURNAL=ejor, VOLUME=16, NUMBER=5, PAGES="59-83", YEAR=1984, KEYWORDS="Network planning; junction network; heuristics", ABSTRACT="EJOR", } @ARTICLE{Berg84:Random, AUTHOR="T. Berger and N. Mehravari and Donald F. Towsley and J. Wolf", TITLE="Random Multiple-Access Communication and Group Testing", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=7, PAGES="769-779", YEAR=1984, KEYWORDS="Random access; random multiple access; communication; multiple access; testing", } @ARTICLE{Biel84:Network, AUTHOR="M. Bielli and M. Cini and G. Callicchio and L. Magliozzi and M. Ordone", TITLE="Network Models in Planning the New Generation of Submarine Communication Systems", JOURNAL="Operational Research", PAGES="1038-1052", YEAR=1984, KEYWORDS="Network planning; communication system; model", } @INPROCEEDINGS{Bo84:Trafikkvariasjoner, AUTHOR="K. Bo", TITLE="Trafikkvariasjoner i det norske telenettet i forbindelse med endringer i samtaletakstene", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", YEAR=1984, ABSTRACT="For å kunne f lge trafikkutviklinga og dens fordeling over d gnet, er det de seinere år foretatt landsomfattende trafikkmålinger i det norske telefonnettet i viktige perioder eller timer i g gnet. Målingene er hvert år foretatt i begynnelsen av juni i en hel uke eller i deler av en uke, og omfattet antatt travel time om formiddagen og alle timer fra kl. 1700 til kl.2100. Omlag 20\% av alle sambansbunter i nærnettet og omla", } @ARTICLE{Boch84:Results, AUTHOR="P. Bocharov and M. A. Zharkov and B. A. Naumov", TITLE="Results of an Investigation of a Mathematical Model of a {CCS} Network", JOURNAL="Telecommunications and Radio Engineering", VOLUME=38, NUMBER=1, PAGES="1-5", YEAR=1984, KEYWORDS="mathematical model; CCS; network", } @ARTICLE{Bono8404:Travelling, AUTHOR="E. Bonomi and J.-L. Lutton", TITLE="The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm", JOURNAL="SIAM Review", VOLUME=26, NUMBER=4, PAGES="551-568", YEAR=1984, KEYWORDS="Routing; simulated annealing", ABSTRACT="simulated annealing; In any N-city travelling salesman problem there are (N-1)!/2 possible tours. We use the Metropolis algorithm to generate a sequence of such tours. This sequence may be viewed as the random evolution of a physical system in contact with a heat-bath. As the temperature is lowered, the tours generated approach the optimal tour. It appears that for large N one arrives within a few percent of the optimal s", } @INPROCEEDINGS{Bred84:Belastningsavhengig, AUTHOR="E. Bredrup and K. Evensen and B. E. Helvik and A. R. Swensen", TITLE="Belastningsavhengig feilrate i telesystemer", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES=15, YEAR=1984, LANGUAGE="Norwegian", KEYWORDS="Failure; reliability", ABSTRACT="Artikkelen bygger på et prosjekt om sammenheng mellom belastning og feilrate i DMS systemer. (BRED 84). Etter en gjennomgang av ulike forhold som kan påvirke feilraten, blir resultatet av en unders kelse for tre av Televerkets DMS sentraler presentert. De virktigste konklusjonene er * det er en klar variasjon over d gnet for tidspunktet når feil inntrer. Dette gjelder både for det totale antall rapportets feil og for feil", } @ARTICLE{Bril84:Queues, AUTHOR="P. H. Brill and L. Green", TITLE="Queues in which Customers Receive Simultaneous Service from a Random Number of Servers: A System Point Approach", JOURNAL=ms, VOLUME=30, NUMBER=1, PAGES="51-68", YEAR=1984, KEYWORDS="multi-slot connection", ABSTRACT="Multi-slot", } @ARTICLE{Bron84:Computer, AUTHOR="R. Bronson", TITLE="Computer Simulation: What it is and how it's done", JOURNAL=byte, VOLUME=9, NUMBER=3, PAGES="95-102", YEAR=1984, KEYWORDS="Simulation", } @ARTICLE{Burk84:Thermodynamically, AUTHOR="R. E. Burkard and F. Rendl", TITLE="A thermodynamically motivated simulation procedure for combinatorial optimization problems", JOURNAL=ejor, VOLUME=17, PAGES="169-174", YEAR=1984, KEYWORDS="simulation; combinatorial method; optimization; heuristics", ABSTRACT="simulated annealing", } @ARTICLE{Burm84:Insensitivity, AUTHOR="D. Y. Burman and J. P. Lehoczky and Y. Lim", TITLE="Insensitivity of Blocking Probabilities in a circuit-Switching Network", JOURNAL=jap, VOLUME=21, PAGES="850-859", YEAR=1984, KEYWORDS="Blocking; Circuit Switching", } @ARTICLE{Burr84:Service, AUTHOR="P. R. H. Burrington", TITLE="Service Standards for Packet-Switched Networks - An Introduction", JOURNAL="British Telecommunications Engineering", VOLUME=3, PAGES="197-202", YEAR=1984, KEYWORDS="packet switching; GOS; QOS", } @ARTICLE{Cao84:Dependence, AUTHOR="Xi-Ren Cao", TITLE="The Dependence of Sojourn Times on Service Times in Tandem Queues", JOURNAL=jap, VOLUME=21, PAGES="661-667", YEAR=1984, KEYWORDS="Markov process; renewal process; reversibility", ABSTRACT="In this paper we study a series of servers with exponentially distributed service times. We find that the sojourn time of a customer at any server depends on the customer's past history only through the customer's interarrival time to that server. A method of calculating the conditional probabilities of sojourn times is developed.", } @ARTICLE{Chla84:Methodology, AUTHOR="I. Chlamtac and Raj Jain", TITLE="A Methodology for Building a Simulation Model for Efficient Design and Performance analysis of Local Area Networks", JOURNAL="Simulation", VOLUME=43, PAGES="57-66", YEAR=1984, KEYWORDS="LAN; Simulation Model; Design; Performance Evaluation", } @ARTICLE{Clau84:Dynamische, AUTHOR="H. D. Clausen and F. X. Thaller", TITLE="Dynamische Vielfachzugriffsverfahren für die Datenübertragung per Satellit", JOURNAL=ntzarchiv, ADDRESS="Germany", VOLUME=6, NUMBER=5, PAGES="93-100", YEAR=1984, LANGUAGE="German", KEYWORDS="Multiple Access; Satellite Radio", } @ARTICLE{Cohe84:Traffic, AUTHOR="Paul Cohen and H.-H. Hoang and David Haccoun", TITLE="Traffic Characterization and Classification of Users of Land Mobile Communications Channels", JOURNAL=ieeevt, VOLUME="VT-33", NUMBER=4, PAGES="276-284", YEAR=1984, KEYWORDS="Traffic Model; Mobile radio", } @ARTICLE{Cono84:Autostrada, AUTHOR="B. W. Conolly", TITLE="The Autostrada Queueing Problem", JOURNAL=jap, VOLUME=21, NUMBER=9184, PAGES="394-403", YEAR=1984, KEYWORDS="parallel queue", } @ARTICLE{Boer84:Comments, AUTHOR="J. de Boer", TITLE="Comments on Teletraffic Analysis for Single-Cell Mobile Radio Telephone Systems. Authors' Reply", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=3, PAGES="300-302", YEAR=1984, REFERENCES=3, KEYWORDS="Traffic analysis; mobile radio", } @INPROCEEDINGS{Duri84:Processsimulering, AUTHOR="M. During", TITLE="Processsimulering Tillämpad på ett Multikösystem", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="IV.1.1-6", YEAR=1984, LANGUAGE="Swedish", KEYWORDS="Queueing System; Simulation", ABSTRACT="Det är snarare en regel än ett undantag att verkliga kö-system har en så pass komplex uppbyggnad att det är svårt för att inte säga omöjligt att komma fram till en analytisk lösning. Ett sätt att studera dessa system är då att använda sig av simulering. I detta föredrag kommer simulering av ett multikösystem att behandlas. Erfarenheter och resultat från denna process-simulering, tillämpat på ett multikösystem (se fig. 1)", } @ARTICLE{Dyed84:Engineering, AUTHOR="V. G. Dyedoborshch and A. I. Gromov and E. E. Urm", TITLE="An Engineering Method of Calculating the Efficiency of Common-Channel Signaling Systems", JOURNAL="Telecommunications and Radio Engineering", VOLUME=38, NUMBER=1, PAGES="6-9", YEAR=1984, KEYWORDS="Common channel; signalling; calculation; system effectiveness", } @INPROCEEDINGS{Eike84:Effekten, AUTHOR="M. Eikeland and P. J. Emstad", TITLE="Effekten av Ressursdeling for Taleforsindelser", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="V.5.1-4", YEAR=1984, LANGUAGE="Norwegian", KEYWORDS="TASI; speech processing", ABSTRACT="Taleforbindelser kan dele ressurser på ulike måter. Linjesvitsjing og pakkesvitsjing er kjente metoder. TASI-konseptet (Time Assigned Speech Interpolation) kombinert med linjesvitsjing har vært i bruk en del år. Her beslaglegges talekanalen bare så lenge en talekilde er aktiv, dvs, sender ut informasjon. Når kilden er passiv, dvs, lytter, frigis talekanalen for så å bli belagt når kilden igjen blir aktiv. Vi vet at en tal", } @TECHREPORT{Eklu84:Multipacket, AUTHOR="B. Eklundh", TITLE="On a Multipacket Slotted {ALOHA} Protocol with Unreliable Transmission", INSTITUTION="Ericsson Radio Systems and Lund Institute of Technology", ADDRESS="Lund, Sweden", NOTE="NTS-5", YEAR=1984, KEYWORDS="Packet radio; slotted ALOHA; reliability", } @INPROCEEDINGS{Emst84:Two, AUTHOR="P. J. Emstad", TITLE="A two level processor load model", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES=5, YEAR=1984, KEYWORDS="Processor; Resource Use Model; M/M/OO", ABSTRACT="In a communication system a processor is part of the secondary resources enganged in administrating the primary resources carrying the subscriber generated traffic. A two level model involving both the primary and secondary resources is studied. The primary resources are modelled as an M/M/inf. system. Jobs to the secondary system are generated when customers enter and leave the M/M/inf. system. The secondary system is a", } @TECHREPORT{Engv84:Socio, AUTHOR="L. Engvall", TITLE="A Socio-Economic Study on the Usage of Telephone, Television, and Radio Services", INSTITUTION="Inst. för Teletrafiksystem, Kungl. Tekniska Högskolan", ADDRESS="Stockholm, Sweden", NUMBER="TRITA-TTDS-8402", YEAR=1984, KEYWORDS="Telephony", } @ARTICLE{Esch84:Statistical, AUTHOR="W. Eschenbach", TITLE="Statistical Inference for Queueing Models", JOURNAL="Mathematische Operationsforschung und Statistik, Ser. Statistik", VOLUME=15, NUMBER=3, PAGES="451-462", YEAR=1984, KEYWORDS="estimation", } @ARTICLE{Ever84:Output, AUTHOR="David Everitt and T. Downs", TITLE="The Output of the M/M/s Queue", JOURNAL=or, VOLUME=32, NUMBER=4, PAGES="796-808", YEAR=1984, KEYWORDS="Queueing theory; M/M/N; output process", } @ARTICLE{Fali84:Sufficient, AUTHOR="G. I. Falin", TITLE="On Sufficient Conditions for Ergodicity of Multichannel Queueing Systems with Repeated Calls", JOURNAL=aap, VOLUME=16, PAGES="447-448", YEAR=1984, KEYWORDS="ergodicity; call reattempt", ABSTRACT="We propose a simple and efficient method of obtaining sufficient conditions for the existence of a stationary regime for multichannel fully available queueing systems with repeated calls.", } @ARTICLE{Fali84:Quasi, AUTHOR="G. I. Falin", TITLE="Quasi-Input Process in the M/G/1/$\infty$ Queue", JOURNAL=aap, VOLUME=16, PAGES="695-696", YEAR=1984, KEYWORDS="random; queueing system", ABSTRACT="Random flows; We consider the flow of service starting times in the $M/G/1/\infty$ queue and study some of its equilibrium properties.", } @ARTICLE{Fede84:Queue, AUTHOR="A. Federgruen and L. Green", TITLE="An M/G/c Queue in Which the Number of Servers Required is Random", JOURNAL=jap, VOLUME=21, PAGES="583-601", YEAR=1984, KEYWORDS="multiserver; random; approximation", ABSTRACT="Random server requirement; Many queueing systems such as computer, communications and emergency systems have the feature that customrs may require service from several servers at the same time. They may thus be delayed until the required number of servers is available and servers may be idle when customers are waiting. We consider general server-completion-time distributions and derive approximation methods for the comput", } @ARTICLE{Finl84:Optical, AUTHOR="M. R. Finley", TITLE="Optical Fibers in Local Area Networks", JOURNAL=ieeecm, VOLUME=22, NUMBER=8, PAGES="22-35", YEAR=1984, KEYWORDS="LAN", } @ARTICLE{Fisc84:Enhanced, AUTHOR="M. J. Fischer and D. A. Garbin and G. W. Swinsky", TITLE="An Enhanced Extension to Wilkinson's Equivalent Random Technique with Application to Traffic Engineering", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=1, PAGES="2-4", YEAR=1984, KEYWORDS="overflow; ERT; equivalent random technique", } @ARTICLE{Flat84:Two, AUTHOR="L. Flatto and S. Hahn", TITLE="Two Parallel Queues Created by Arrivals with Two Demands, Part I", JOURNAL=siapp, VOLUME=44, NUMBER=5, PAGES="1041-1053", YEAR=1984, KEYWORDS="Delay model; analysis; priority; queueing discipline", } @ARTICLE{Fran84:Reliability, AUTHOR="P. Franken and B. M. Kirstein and A. Streller", TITLE="Reliability Analysis of Complex Systems with Repair", JOURNAL=eik, VOLUME=20, NUMBER="7-9", PAGES="407-422", YEAR=1984, KEYWORDS="Analysis; reliability; repair", } @ARTICLE{Frie84:Statistical, AUTHOR="L. W. Friedman and H. H. Friedman", TITLE="Statistical considerations in computer Simulation: The State of the Art", JOURNAL="Journal of Statistical Computation and Simulation", VOLUME=19, PAGES="237-263", YEAR=1984, KEYWORDS="simulation; variance reduction", } @ARTICLE{Glan84:BER, AUTHOR="B. S. Glance", TITLE="{BER} Degradations Caused by Switching in Digital Mobile Radio Systems Using Base Station Diversity", JOURNAL=atttj, VOLUME=63, NUMBER=4, PAGES="545-564", YEAR=1984, KEYWORDS="Mobile radio; bit error; switching system; multipath; analysis", } @ARTICLE{Goeb8403:5ESS, AUTHOR="H. J. Goebertus", TITLE="{5ESS-PRX} Architecture", JOURNAL=ptr, ADDRESS="Netherlands", VOLUME=42, NUMBER=3, PAGES="111-131", YEAR=1984, KEYWORDS="Switching System; Architecture; Overview", } @ARTICLE{Gopi84:Blocking, AUTHOR="B. Gopinath and J.-M. Garcia and P. Varaiya", TITLE="Blocking Probability in a Switching Center with Arbitrary Routing Policy", JOURNAL=atttj, VOLUME=63, NUMBER=5, PAGES="709-720", YEAR=1984, KEYWORDS="Switching System; Routing; Blocking; Probability; Analysis", } @ARTICLE{Gray84:Using, AUTHOR="P. Gray", TITLE="Using the Interactive Financial Planning System {(IFPS)} for Stochastic Simulation", JOURNAL="Simulation", VOLUME=43, PAGES="286-292", YEAR=1984, KEYWORDS="Simulation method", ABSTRACT="IFPS", } @ARTICLE{Gree84:COST, AUTHOR="D. Greenop and R. Campbell", TITLE="{COST} 201 - A Procedure for the Optimisation of Telecommunication Networks", JOURNAL="British Telecommunications Engineering", VOLUME=3, NUMBER=1, PAGES="47-58", YEAR=1984, KEYWORDS="Planning; communication network; optimization", } @ARTICLE{Hage8402:Zuk, AUTHOR="J. Hagenauer and R. Schweikert", TITLE="Zukünftiger Satellitenmobilfunk - Datenverbindung mit Schiffen, Fahrzeugen und Flugzeugen", JOURNAL=ntz, ADDRESS="Germany", VOLUME=37, NUMBER=2, PAGES="78-83", YEAR=1984, LANGUAGE="German", KEYWORDS="mobile radio", } @ARTICLE{Hand84:Local, AUTHOR="G. J. Handler", TITLE="Local Packet Transport Planning: Videotex and Beyond", JOURNAL=ieeecm, VOLUME=22, NUMBER=4, PAGES="12-17", YEAR=1984, KEYWORDS="Planning; Packet Switching; Teletex; Forecasting", } @ARTICLE{Haug84:Application, AUTHOR="J. F. Haughney", TITLE="Application of Burst switching Technology to Defense Communications System", JOURNAL=ieeecm, VOLUME=22, NUMBER=10, PAGES="15-21", YEAR=1984, KEYWORDS="Switching system; burst switching; application", ABSTRACT="A new switching concept provides improvements to the CONUS transmission grid.", } @INPROCEEDINGS{Hauk84:Adaptive, AUTHOR="J. Haukeland and T. Falch and Moan", TITLE="Adaptive Süke- og Rutingalgoritmer i et Linjesvitsjet Nett. Metoder og Simuleringer", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES=20, YEAR=1984, LANGUAGE="Norwegian", KEYWORDS="Adaptive Routing; Simulation", ABSTRACT="Bruksområdene til STK's knutepunktkonsept har satt strenge krav til de anvendte rutingalgoritmer. Fri numberering for grupper av abonnenter og robusthet/pålitelighet ved topologiforandringer og trafikk-variasjoner er krav som ikke kan ivaretas med konvensjonell deterministisk ruting. Mulige s kemetoder (dvs. abonnentlokalisering) og rutingmetoder som m ter disse kravene i linjesvitsjede nett, vil bli studert. Foredraget b", } @ARTICLE{Helm84:Optimal, AUTHOR="W. E. Helm and K.-H. Waldmann", TITLE="Optimal Control of Arrivals to Multiserver Queues in a Random Environment", JOURNAL=jap, VOLUME=21, PAGES="602-615", YEAR=1984, KEYWORDS="queueing system; Markov process; decision theory; dynamic programming", } @TECHREPORT{Hert84:List, AUTHOR="S. Hertzberg", TITLE="List of Kauko Rahko's Publications from the Years 1959 to 1983", INSTITUTION="Telecommunication Switching Laboratory, Helsinki University of Technology", ADDRESS="Helsinki, Finland", NUMBER=1, PAGES=22, YEAR=1984, KEYWORDS="Bibliography; History", } @TECHREPORT{Hert84:Kauko, AUTHOR="S. Hertzberg", TITLE="Kauko Rahko's Publication on Traffic Theory from 1977 to 1983", INSTITUTION="Telecommunication Switching laboratory, Helsinki University of Technology", ADDRESS="Helsinki, Finland", NUMBER="4/83", PAGES=378, YEAR=1984, KEYWORDS="Bibliography; history", } @ARTICLE{Ho84:Optimization, AUTHOR="Yu-Chi Ho and R. Suri and Xi-Ren Cao and Gregory W. Diehl and others", TITLE="Optimization of large multiclass (non-product-form) queueing networks using perturbation analysis", JOURNAL="Large Scale Systems", VOLUME=7, PAGES="165-180", YEAR=1984, KEYWORDS="Monte Carlo simulation", } @INPROCEEDINGS{Jens84:Dimensioneringsregler, AUTHOR="A. Jensen", TITLE="Dimensioneringsregler for Teleplanlægning", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", YEAR=1984, LANGUAGE="Danish", KEYWORDS="Network planning", ABSTRACT="Med udgangspunkt i en reformulering af målsætningsfunktionen for public Utilities tages de klassiske dimensioneringsregler op til discussion, bl.a. Molina's, P.V. Christensens og Moe's resultater, ligesom der s ges kastet et nyt lys over Chr. Asgersens forslag.", } @INPROCEEDINGS{Jens84:Trafikkvurderinger, AUTHOR="E. Lykke Jensen", TITLE="Trafikkvurderinger ved innf ring av digitale telefonsentraler i Norge", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="II.3.1-27", YEAR=1984, LANGUAGE="Norwegian", } @ARTICLE{Joel8404:Engineer, AUTHOR="A. E. Joel", TITLE="The engineer and the International Communications Community", JOURNAL=ieeecm, VOLUME=22, NUMBER=4, PAGES="39-41", YEAR=1984, KEYWORDS="Traffic engineering", } @ARTICLE{Kamm8404:C900, AUTHOR="K. Kammerlander", TITLE="{C900} - An Advanced Mobile Radio Telephone System with Optimum Frequency Utilization", JOURNAL=ieeejsac, VOLUME="SAC-2", NUMBER=4, PAGES="589-597", YEAR=1984, KEYWORDS="Mobile radio; MAT", } @INPROCEEDINGS{Karl84:Erfarenheter, AUTHOR="T. Karlstedt", TITLE="Erfarenheter och resultat vid användning av {SDL/SIM} för kapacitetsstudier", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", YEAR=1984, LANGUAGE="Norwegian", KEYWORDS="Software engineering", ABSTRACT="I detta bidrag redogörs för de huvudsakligen mycket positiva erfarenheterna från två års användning av SDL/SIM, ett program-paket för händelsestyrd simulering som utvecklats vid TTS institutionen vid LTH. Erfarenheterna baseras på verksamheten vid instansen XT/UDJ och andra angränsande verksamheter. För att belysa arten av denna verksamhet beskrivs översiktligt några utförda simuleringsstudier. Dessutom diskuteras några a", } @ARTICLE{Karr8402:Martingale, AUTHOR="A. F. Karr", TITLE="The Martingale Method: Introductory Sketch and Access to the Literature", JOURNAL=orl, VOLUME=3, NUMBER=2, PAGES="59-63", YEAR=1984, KEYWORDS="Bibliography; martingale", } @ARTICLE{Kash8401:Trunk, AUTHOR="A. Kashper and G. C. Varvaloucas", TITLE="Trunk Implementation Plan for Hierarchical Networks", JOURNAL=atttj, VOLUME=63, NUMBER=1, PAGES="57-88", YEAR=1984, KEYWORDS="Network planning", } @INPROCEEDINGS{Kilk84:Trafikgodhet, AUTHOR="K. Kilkki and K. Rahko", TITLE="Trafikgodhet", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="VI.7.1-7", YEAR=1984, LANGUAGE="Finnish", ABSTRACT="Trafikgodheten är en viktig aspekt på man granskar olika dimensioneringsmetoder. Trafikgodheten bestäms av företeelse, som abonnenten iakttar när han använder telefon. Det är mycket viktigt för honom hur han lyckas telefonera:sannolikheten att samtal lyckas, spärrning, sannolikheten av B-upptaget osv.", } @ARTICLE{Kim8401:Highly, AUTHOR="W. Kim", TITLE="Highly Available Systems for Database Applications", JOURNAL=acmcs, VOLUME=16, NUMBER=1, PAGES="71-98", YEAR=1984, KEYWORDS="Database; availability", } @ARTICLE{King84:Comparison, AUTHOR="P. King", TITLE="Performance Comparison of Local Network Architectures", EDITOR="Kenneth G. Beauchamp", SERIES="NATO ASI Series", JOURNAL="Information Technology and the Computer Network", PUBLISHER="Springer Verlag", ADDRESS="Belgium", VOLUME="F6", PAGES="125-135", YEAR=1984, KEYWORDS="LAN; comparison", } @ARTICLE{Klei84:Statistical, AUTHOR="J. P. Kleijnen", TITLE="Statistical Analysis of Steady-State Simulations: Survey of Recent Progress", JOURNAL=ejor, VOLUME=17, PAGES="150-162", YEAR=1984, KEYWORDS="variance reduction", } @ARTICLE{Klei8401:Self, AUTHOR="L. Kleinrock and G. Y. Akavia", TITLE="On a Self-Adjusting Capability of Random Access Networks", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=1, PAGES="40-47", YEAR=1984, KEYWORDS="Random access", } @INPROCEEDINGS{Knut84:Hur, AUTHOR="A. Knutsson", TITLE="Hur Dynamiska Trafikproblem Hanteras med Martingal-Metodik", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="V.3.1-2", YEAR=1984, LANGUAGE="Finnish", ABSTRACT="Den moderna tele- och data-tekniken qenererar fler och fler trafikproblem av dynamisk karaktär, t ex övervakning i reell tid, automatisk överbelastningskontroll, dynamisk och adaptiv dirigering, automatisk Network Management, samt flera andra former av 'compuer-aided and computer-controlled network operations'. Vi har allstå en mängd viktiga och intressanta problem, men dessvärre saknas ännu etablerade och effektiva metod", } @ARTICLE{Lau84:Effect, AUTHOR="H.-S. Lau and A. Zaki", TITLE="The Effect of Using Discrete Time Units in Queueing Simulation", JOURNAL=ejor, VOLUME=17, PAGES="163-168", YEAR=1984, KEYWORDS="Queueing system; simulation method; time sequencing", ABSTRACT="Westerberg fordeling ?", } @INPROCEEDINGS{LeGa84:One, AUTHOR="F. Le Gall and J. Bernussou and J.-M. Garcia", TITLE="A One Moment Model for Telephone Networks with Dependence on Link Blocking Probabilities", BOOKTITLE="Performance", EDITOR="E. Gelenbe", PUBLISHER="North-Holland", ADDRESS="Zürich, Switzerland", PAGES="449-458", YEAR=1984, REFERENCES=13, KEYWORDS="Traffic engineering", } @ARTICLE{LeGa84:OneAllocation, AUTHOR="F. Le Gall and J.-M. Garcia and J. Bernussou", TITLE="A One Moment Model for Telephone Traffic. Application to Blocking Estimation and Resource Allocation", EDITOR="H. Rudin and W. Bux", JOURNAL="Performance of Computer-Communication Systems", PUBLISHER="North-Holland", ADDRESS="Zürich, Switzerland", PAGES="159-171", YEAR=1984, KEYWORDS="Traffic engineering", } @ARTICLE{LeGa8403:Dimensionnement, AUTHOR="P. Le Gall", TITLE="Dimensionnement de bout en bout de réseaux téléphoniques hiérarchisés et combinaison des trafics", JOURNAL=atele, ADDRESS="France", VOLUME=39, NUMBER="3-4", PAGES="129-141", YEAR=1984, LANGUAGE="French", KEYWORDS="traffic theory; telephony; hierarchical; traffic model; overload control; stochastic system; loss system; Poisson process", ABSTRACT="Dimensioning; Overload traffic; Theoretical study; The author considers the problem of determining the individual loss probabilities of each traffic stream in a hierarchical network operated as a loss system in the case of arbitrary call holding time distribution. He shows that, in order to separate out the distribution function of each traffic stream, it is necessary to modify not only the arrival processes but also the", } @INPROCEEDINGS{Leht84:Kontinuerlig, AUTHOR="P. Lehtinen and K. Sallinen", TITLE="Kontinuerlig Trafikmätning och Analys av Mätdata i det Digitala System {DX} 200 av Telenokia {OY}", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="VI.9.1-24", YEAR=1984, LANGUAGE="Finnish", KEYWORDS="Traffic measurement", ABSTRACT="Introduktion av DX 200 System", } @ARTICLE{Lems8403:Network, AUTHOR="W. Lemstra", TITLE="Network Planning with {5ESS-PRX}", JOURNAL=ptr, ADDRESS="Netherlands", VOLUME=42, NUMBER=3, PAGES="132-147", YEAR=1984, KEYWORDS="Network planning", } @ARTICLE{Limb8408:Local, AUTHOR="J. O. Limb", TITLE="Performance of Local Area Networks at High Speed", JOURNAL=ieeecm, VOLUME=22, NUMBER=8, PAGES="41-45", YEAR=1984, KEYWORDS="Lan", } @INPROCEEDINGS{Lind84:Kösystem, AUTHOR="G. Lind", TITLE="Kösystem Där Ankomstavstånd eller betjäningstider är markovberoende", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", YEAR=1984, LANGUAGE="Swedish", KEYWORDS="Switching system", ABSTRACT="I ett bidrag till ITC 10, Montreal i juni 1983, formulerade författaren en klass av köproblem med beroenden. I bidraget betraktas kösystem bestående av 1 betjänare eller m parallella betjänare. Ankomstprocessen antas, liksom i de klassiska analyserna, vara oberoende av betjäningstiderna.", } @INPROCEEDINGS{Lind84:För, AUTHOR="K. Lindberger", TITLE="För-och nackdelar med olika grad av sammanlagring av varierande typer av teletrafik i något slag framtida {ISDN-nät}", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="II.2.1-7", YEAR=1984, LANGUAGE="Swedish", KEYWORDS="ISDN", ABSTRACT="På senare tid har det talats och skrivits mycket om ISDN (Integrated Service Digital Network) och de möjligheter detta ger. De flesta artiklar behandlar dock huvudsakligen ISDN ur abonnentens synpunkt och de standardiseringar man därvid kommit överens om i CCITT tex vad gäller transmissionskapaciteten på abonnentledningen. Varje abonnent får sålunda 2 st 64 k bit kanaler, den ena avsedd för telefoni, den andra för diverse", } @ARTICLE{Maff84:Randomized, AUTHOR="F. Maffioli and M. G. Speranza and C. Vercellis", TITLE="Randomized Algorithms: An Annotated Bibliography", JOURNAL="Annals of Operations Research", VOLUME=1, PAGES="331-345", YEAR=1984, KEYWORDS="Bibliography; optimization", } @ARTICLE{Male8405:Generic, AUTHOR="M. Malek-Zavarei and M. C. Chow and J. Williams", TITLE="Generic Approaches to the Design of Network Services Circuits", JOURNAL=atttj, VOLUME=63, NUMBER=5, PAGES="737-773", YEAR=1984, KEYWORDS="Communication network; design", } @ARTICLE{Mark8401:Simple, AUTHOR="Z. Markov", TITLE="A Simple Method of Automatic Faulty-Trunk Detection", JOURNAL=aeu, ADDRESS="Stuttgart, Germany", VOLUME=38, NUMBER=1, PAGES="75-77", YEAR=1984, KEYWORDS="Network management", ABSTRACT="Killer trunks; This letter describes a simple method of automatic faulty trunk detection. The probability of miss, probability of falls alarm and mean time to alarm are calculated. The suggested method is compared to the known methods.", } @INPROCEEDINGS{Mart84:Time, AUTHOR="O. Martikainen", TITLE="Time Varying Blocking Probability of Nonstationary Traffic", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="V.4.1-5", YEAR=1984, KEYWORDS="Erlang B formula", ABSTRACT="In this paper the measurement and modelling of the time-varying traffic are considered. A nonstationary generalization of the Erlang B-formula is given and a resursive approximate formula derived for it. Calculated nonstationary blocking probabilities are compared to the measured values.", } @ARTICLE{Mase8401:Network, AUTHOR="K. Mase and M. Kajiwara and H. Yamamoto", TITLE="Network Control system Using Traffic Database", JOURNAL=recl, ADDRESS="Japan", VOLUME=32, NUMBER=1, PAGES="9-15", YEAR=1984, KEYWORDS="Network management", } @ARTICLE{Mase8403:Adaptive, AUTHOR="K. Mase and N. Kawashima and M. Kajiwara", TITLE="An Adaptive High-Usage Trunk Allocation Scheme Employing an {SS/TDMA} System", JOURNAL=recl, ADDRESS="Japan", VOLUME=32, NUMBER=3, PAGES="497-507", YEAR=1984, KEYWORDS="Network management; routing", } @ARTICLE{Mats8406:Approximation, AUTHOR="J. Matsuda", TITLE="An Approximation for the Auto-Covariance Function of the Virtual Waiting Time in an {M/G/1} and Its Applications", JOURNAL=ecij1, ADDRESS="Japan", VOLUME="67-B", NUMBER=6, PAGES="72-78", YEAR=1984, KEYWORDS="Queueing system; virtual waiting time", } @ARTICLE{McNi84:Properties, AUTHOR="D. C. McNickle", TITLE="Properties of the Interrupted Poisson Approximation", JOURNAL=orl, VOLUME=3, NUMBER=2, PAGES="69-73", YEAR=1984, KEYWORDS="Ipp", } @ARTICLE{Mitt84:Discrete, AUTHOR="S. S. Mittra", TITLE="Discrete System Simulation concepts", JOURNAL="Simulation", VOLUME=43, PAGES="142-144", YEAR=1984, KEYWORDS="Simulation method", } @ARTICLE{Modi8404:Random, AUTHOR="D. T. Modianos and R. C. Scott and L. W. Cornwell", TITLE="Random Number Generation on Microcomputers", JOURNAL="Interfaces", VOLUME=14, NUMBER=4, PAGES="81-87", YEAR=1984, KEYWORDS="Rng", } @INPROCEEDINGS{Mysk84:Sperregenskaper, AUTHOR="A. Myskja and M. Skretting", TITLE="Sperregenskaper hos Trafikktyper av Ulik Karakter", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES=12, YEAR=1984, LANGUAGE="Norwegian", KEYWORDS="Traffic source model", ABSTRACT="En grunnleggende referanseprosess i trafikkteorien er poissonprosessen. Den benyttes til å beskrive både ankomstprosessen ved antall ankomster i et gitt tidsintervall og trafikkprosessen ved antall beladte organer i en uendelig betjeningsgruppe. Karakteristisk for poissonprosessen er at den er bestemt ved eneste parameter, nemlig middelverdien i den fordeling som beskriver prosessen. Når middelverdien er gitt, er også all", } @ARTICLE{Nami8404:Mobile, AUTHOR="C. Namislo", TITLE="Analysis of Mobile Radio Slotted {ALOHA} Networks", JOURNAL=ieeejsac, VOLUME="SAC-2", NUMBER=4, PAGES="583-588", YEAR=1984, KEYWORDS="Aloha", } @ARTICLE{Neut84:Matrix, AUTHOR="M. F. Neuts", TITLE="Matrix-Analytic Methods in the Queueing Theory", JOURNAL=ejor, VOLUME=15, PAGES="2-12", YEAR=1984, KEYWORDS="Matrix analytic method", ABSTRACT="This review describes the development during the past decade of a number of matrix-analytic methods for the study of a variety of stochastic models, primarily queues but also certain models for dams and inventories. This work originated in the search for algorithmic methods and has led to results that are well-suited for computer implementation. It has also required a reexamination of the theoretical approaches to these s", } @ARTICLE{Newe8405:Approximations, AUTHOR="G. F. Newell", TITLE="Approximations for Superposition Arrival Processes in Queues", JOURNAL=ms, VOLUME=30, NUMBER=5, PAGES="623-632", YEAR=1984, KEYWORDS="Arrival process; superposition", } @INPROCEEDINGS{Niel84:Edb, AUTHOR="K. E. Nielsen", TITLE="Edb-behandling af trafikdata ved {KTAS}", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="VI.4.1-12", YEAR=1984, LANGUAGE="Danish", KEYWORDS="Traffic measurement", ABSTRACT="Ved KTAS' trafikplanlægning startede man allerede i slutningen af 1960'erne med at anvende edb till trafikberegninger.", } @ARTICLE{Nish8404:Simulation, AUTHOR="D. J. Nishball and E. Koenigsberg", TITLE="Simulation and Analysis of Cyclic Queues", JOURNAL=ijpr, VOLUME=22, NUMBER=4, PAGES="661-672", YEAR=1984, KEYWORDS="Simulation; round robin", } @INPROCEEDINGS{Oste84:Analyse, AUTHOR="O. Østerb", TITLE="Analyse av et tandem-k system med ende-til-ende vindus-mekanisme", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", YEAR=1984, LANGUAGE="Norwegian", KEYWORDS="Tandem queue", ABSTRACT="De fleste pakkesvitsjede datanett tilbyr idag virtuelle forbindelser mellom abonenter i nettet. Imange nett har de virtuelle forbindelsene også ofte ende-til-ende flytkontroll. (Dette er tilfelle med DATAPAK). En virtuell forbindelse med ende-til-ende flytkontroll begrenser antall pakker som kan være i transit i nettet. Det masimale antall pakker som er tillatt i en virtuell forbindelse er definert som VINDUS-STORRELSEN.", } @ARTICLE{Part84:Notes, AUTHOR="P. R. Parthasarathy and M. Sharafali", TITLE="Some Notes on the Total Service Time in Certain Loss Systems", JOURNAL=jap, VOLUME=21, PAGES="616-627", YEAR=1984, KEYWORDS="Markov process; renewal process", ABSTRACT="In this paper we discuss the total service rendered by all servers in certain loss systems.", } @INPROCEEDINGS{Parv84:Dimensioning, AUTHOR="A. Parviala", TITLE="The Dimensioning of Alternate Routing by a Simple Algorithm Taking into Account the Non-Ideal Parameters", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="VI.1.1-2", YEAR=1984, KEYWORDS="Network planning; alternate routing", ABSTRACT="The demonstrated values for the basic cost of a route (k) and for busy hour coincidence (lambda) values appear quite normally in practice, but the ideal k=0 and lambda=1 appear only in theory. The real k and lambda values have an important influence on the alternate routing dimensioning; particularly as regards expensive direct circuits (epsilon>0.5) they must be taken into account to avoid false investments.", } @INPROCEEDINGS{Parv84:Viadimensioneringspraxis, AUTHOR="A. Parviala and M. Mäkelä", TITLE="Viadimensioneringspraxis i Finlands Telenät", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES=3, YEAR=1984, LANGUAGE="Finnish", KEYWORDS="Routing", ABSTRACT="Seminarieorganisationen NTS 5 har bett de nordiska länderna presentera var sin viadimensioneringspraxis. I Finland har vi rätt goda möjligheter till en sådan presentation.", } @TECHREPORT{Pede84:Simulation, AUTHOR="N. N. Pedersen", TITLE="Simulation Results for High Speed Local Area Networks", INSTITUTION="LAN-DTH Project Note 7, Department of Computer Science, DTH", ADDRESS="Lyngby, Denmark", NUMBER=1044, YEAR=1984, KEYWORDS="LAN; simulation", } @INPROCEEDINGS{Peir84:Traffical, AUTHOR="L. Peiram", TITLE="Traffical Aspects on x.25/x.75 Packet Mode", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="III.7.1-14", YEAR=1984, KEYWORDS="Packet switching; X.25; X.75", ABSTRACT="The CCITT recommendations X.25/X.75 for packet mode date networks are successively being implemented over the world, e.g. in Europe as well as in Australia and USA, and for public as well as private data networks. In my lecture I point out some of the mechanisms that affect the traffical performance in terms of loss and delays.", } @INPROCEEDINGS{Pior84:Optimal, AUTHOR="M. Pioro", TITLE="Optimal Dimensioning problems in Non-Hierarchical Circuit-Switched Communication Networks", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES=18, YEAR=1984, KEYWORDS="Network planning; routing", ABSTRACT="The problem of optimizing links dimensions and routing patterns for circuit-switched communication networks employing dynamic non-hierarchical call routing strategy are discussed. Two optimization methods are introduced and some computational results presented.", } @TECHREPORT{Pior84:Routing, AUTHOR="M. Pioro and L. Reneby and B. Wallström", TITLE="Routing Principles in Non-hierarchical Networks - An Introductory Study", INSTITUTION="Department of Communication System, Lund Institute of Technology", ADDRESS="Lund, Sweden", PAGES=154, YEAR=1984, KEYWORDS="Network optimization; nonhierarchical network", ABSTRACT="Herbert Leijon", } @ARTICLE{Raac8410:Customer, AUTHOR="G. A. Raack and E. G. Sable and R. J. Stewart", TITLE="Customer Control of Network Services", JOURNAL=ieeecm, VOLUME=22, NUMBER=10, PAGES="8-14", YEAR=1984, KEYWORDS="Network management", ABSTRACT="A new set of software-defined capabilities gives customers direct control of their network services.", } @ARTICLE{Rao84:Algorithmic, AUTHOR="B. M. Rao and M Posner", TITLE="Algorithmic and Approximation Analyses of the Split and Match Queue", JOURNAL="Stochastic Models", YEAR=1984, KEYWORDS="fork-join queue", ABSTRACT="Split and match; merge", } @ARTICLE{Rasm8403:Queue, AUTHOR="E. H. Rasmussen", TITLE="Queue Simulation", JOURNAL=byte, VOLUME=9, NUMBER=3, PAGES="157-174", YEAR=1984, KEYWORDS="Queueing system; simulation", } @ARTICLE{Ravi84:Comments, AUTHOR="N. Ravichandran and A. Gravey", TITLE="Some Comments on the Simple Queue", JOURNAL=aap, VOLUME=16, PAGES="933-935", YEAR=1984, KEYWORDS="Busy period", } @ARTICLE{Robi84:Customer, AUTHOR="G. Robin", TITLE="Customer Installations for the {ISDN}", JOURNAL=ieeecm, VOLUME=22, NUMBER=4, PAGES="18-23", YEAR=1984, KEYWORDS="ISDN; CPN", } @INPROCEEDINGS{Rønn84:Modelling, AUTHOR="L. A. Rønningen and N. Stol", TITLE="Modelling implementation and use of a traffic simulator for {NPON}", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", YEAR=1984, KEYWORDS="Simulation; traffic generator", ABSTRACT="In order to reduce the model complexity the traffic simulator is divided into two main parts: a call oriented model and a data phase oriented model. The call oriented model is relatively detailed in the set-up and release phases, while the behaviour in the data phase is simplified. The data phase model follows a simplified set-up and release sequence, and focuses on the data phase behaviour which reflects the user behaviour", } @ARTICLE{Sall84:Optimum, AUTHOR="G. Sallai and Z. Dely", TITLE="Optimum {THF} Diagrams for Modular Engineering of Circuit Groups", JOURNAL=ntzarchiv, VOLUME=6, NUMBER=7, PAGES="159-161", YEAR=1984, KEYWORDS="overflow", } @ARTICLE{Schr8403:Simulation, AUTHOR="P. A. Schrodt", TITLE="Simulation of Weighted Voting: The Banzhaf Index", JOURNAL=byte, VOLUME=9, NUMBER=3, PAGES="138-154", YEAR=1984, KEYWORDS="Simulation", } @ARTICLE{Seil84:Waiting, AUTHOR="A. F. Seila", TITLE="On Waiting Times for a Queue in which Customers Require Simultaneous Service from a Random Number of Servers", JOURNAL=or, VOLUME=32, NUMBER=5, PAGES="1181-1184", YEAR=1984, KEYWORDS="multi-slot connection; multi-slot traffic", } @ARTICLE{Serf84:Thinning, AUTHOR="R. Serfozo", TITLE="Thinning of Cluster Processes: Convergence of Sums of Thinned Point Processes", JOURNAL=mor, VOLUME=9, NUMBER=4, PAGES="522-533", YEAR=1984, KEYWORDS="superposition; Cox distribution", } @ARTICLE{Shan8406:Expert, AUTHOR="R. E. Shannon and R. Mayer and H. H. Adelsberger", TITLE="Expert Systems and Simulation", JOURNAL="Simulation", VOLUME=44, NUMBER=6, PAGES="275-284", YEAR=1984, KEYWORDS="Simulation method; expert system", } @ARTICLE{Sidi8406:Acknowledgement, AUTHOR="M. Sidi and A. Segall", TITLE="An Acknowledgement-Based Access Scheme in a Two-Node Packet-Radio Network", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=6, PAGES="741-744", YEAR=1984, KEYWORDS="Packet radio", } @ARTICLE{Sidi8412:Three, AUTHOR="M. Sidi and A. Segall", TITLE="A Three-Node Packet Radio Network", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=12, PAGES="1336-1338", YEAR=1984, KEYWORDS="Packet radio", } @TECHREPORT{Stec84:Optimality, AUTHOR="K. E. Stecke and J. J. Solberg", TITLE="The Optimality of Unbalancing Both Workloads and Machine Group Sizes in Closed Queueing Networks of Multi-Server Queues", INSTITUTION="Div. of Research, Graduate School of Administration. The University of Michigan", PAGES=37, NOTE="To appear in Operations Research", YEAR=1984, KEYWORDS="Closed queueing network", } @ARTICLE{Stoc8404:Small, AUTHOR="A. C. Stocker", TITLE="Small-Cell Mobile Phone Systems", JOURNAL=ieeevt, VOLUME="VT-33", NUMBER=4, PAGES="269-275", YEAR=1984, KEYWORDS="Mat", } @INPROCEEDINGS{Stor84:Prognosemodeller, AUTHOR="K. Stordahl", TITLE="Prognosemodeller for Trafikken i det Fremtidige Telematikknettet", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", YEAR=1984, LANGUAGE="Danish", KEYWORDS="Forecasting", ABSTRACT="Det meste av teletrafikkforskningen har inntil nylig vært konsentrert om telefonnettet. I l pet av de siste årene har imidlertid nye tjenester og nett blitt implementert. Dette har f rt til forskningen på dette felt har fått et bredere tilsnitt.", } @ARTICLE{Stuc8408:Traffic, AUTHOR="B. W. Stuck", TITLE="An Introduction to Traffic Handling Characteristics of Bus Local Area Network Distributed Access Methods", JOURNAL=ieeecm, VOLUME=22, NUMBER=8, PAGES="46-56", YEAR=1984, KEYWORDS="Lan", } @INPROCEEDINGS{Swen84:Om, AUTHOR="A. R. Swensen", TITLE="Om ventetider i {GI/M/c} systemer med timeout", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="III.2.1-7", YEAR=1984, LANGUAGE="Norwegian", KEYWORDS="Queueing system", ABSTRACT={K er med "time-out" har vært gjenstand for adskillig oppmerksomhet på NTS og ITC i årenes l p. Vi kan nevne arbeidene til Wallström (1976) på ITC 8 der han behandlet en mer kompleks Markov ventetidsmodel, og hvor det er en vre begrensning for hvor lenge anropene tillates å være i k en. Haugen (1978) tok i et bidrag til NTS 2 utgangspunkt i Wallströms resultat og foreslo en tolkning av ventetiden, som gav en sammenheng me}, } @ARTICLE{Swid8412:Unified, AUTHOR="J. Swiderski", TITLE="Unified Analysis of Local Flow control Mechanisms in Message-Switched Networks", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=12, PAGES="1286-1293", YEAR=1984, KEYWORDS="Flow control", } @ARTICLE{Sze8402:Queueing, AUTHOR="D. Y. Sze", TITLE="A Queueing Model for Telephone Operator Staffing", JOURNAL=or, VOLUME=32, NUMBER=2, PAGES="229-249", YEAR=1984, KEYWORDS="Network management", } @ARTICLE{Taka8403:Optimal, AUTHOR="H. Takagi and L. Kleinrock", TITLE="Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=3, PAGES="246-257", YEAR=1984, KEYWORDS="Packet radio", } @INPROCEEDINGS{Tidb84:Packet, AUTHOR="S.-E. Tidblom", TITLE="Packet switching - en teknik på frammarsch", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", YEAR=1984, LANGUAGE="Norwegian", KEYWORDS="Packet switching", ABSTRACT="I Sverige finns sedan ca 3 år tillbaka tillgång till en paketförmedlande tjänst benämnd Datapak (f d Telepak). Datapak kan sägas vara ett komplement till det kretskopplade Dataexnätet. Via Datapak kommer abonnenterna i kontakt med andra paketförmedlande nät runt om i världen t ex Tymnet och Telenet i USA och Euronet m fl i Europa. Till dessa nät finns bl a stora databaser anslutna, vilka man från Sverige tidigare endast k", } @ARTICLE{Tows8412:Adaptive, AUTHOR="Donald F. Towsley and J. Wolf", TITLE="On Adaptive Tree Polling Algorithms", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=12, PAGES="1294-1298", YEAR=1984, KEYWORDS="Polling system", } @INPROCEEDINGS{Wall84:Symmetrical, AUTHOR="B. Wallström", TITLE="On Symmetrical Two-Link Routing in Fully Connected Circuit Switched Networks with Unidirectional Links", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", YEAR=1984, KEYWORDS="Routing", ABSTRACT="For a fully connected, symmetrical circuit switched network we study the problem how to arrange two-link routing in accordance with a natural symmetry condition. Design rules are derived for a certain class of symmetrical schemes that are successfully applied in case where the number of nodes is a prime.", } @ARTICLE{Warm8405:Approximation, AUTHOR="W. Warmuth", TITLE="Approximation of Output Processes by Recurrent Processes", JOURNAL=eik, VOLUME=20, NUMBER="5/6", PAGES="258-260", YEAR=1984, KEYWORDS="Output process; approximation", ABSTRACT="Two methods of approximation of output processes by processes with a more simple structure, for instance by recurrent point processes, are given.", } @ARTICLE{Warm84:Einfach, AUTHOR="W. Warmuth", TITLE="Einfach-Korrelierte Abgangsintervalle in Verlustsystemen", JOURNAL="SERDICA Bulgaricae mathematicae publicationes", ADDRESS="BG", VOLUME=10, PAGES="237-240", YEAR=1984, LANGUAGE="German", KEYWORDS="Loss system; output process", } @ARTICLE{Whit84:Generating, AUTHOR="C. A. Whitney", TITLE="Generating and Testing Pseudorandom Numbers", JOURNAL=byte, VOLUME=9, NUMBER=11, PAGES="128-", YEAR=1984, KEYWORDS="random number", } @ARTICLE{Whit84:Departures, AUTHOR="W. Whitt", TITLE="Departures from a Queue with Many Busy Servers", JOURNAL=mor, VOLUME=9, NUMBER=4, PAGES="534-544", YEAR=1984, KEYWORDS="Interdeparture time; limit theorem; queueing network", } @ARTICLE{Whit8405:Heavy, AUTHOR="W. Whitt", TITLE="Heavy-Traffic Approximations for Service Systems with Blocking", JOURNAL=atttj, VOLUME=63, NUMBER=5, PAGES="689-708", YEAR=1984, KEYWORDS="Queueing theory; heavy traffic approximation", } @ARTICLE{Wils84:Statistical, AUTHOR="James R. Wilson", TITLE="Statistical Aspects of Simulation", JOURNAL="Operational Research", ADDRESS="Netherlands", PAGES="825-841", YEAR=1984, KEYWORDS="Simulation", } @ARTICLE{Wirt8401:Remarks, AUTHOR="K.-D. Wirth", TITLE="Some Remarks on Feed-Back Queues", JOURNAL=eik, VOLUME=20, NUMBER=1, PAGES="55-64", YEAR=1984, KEYWORDS="Feedback queue", } @ARTICLE{Yao84:Bounds, AUTHOR="D. D. Yao and M. L. Chaudhry and J. G. C. Templeton", TITLE="On Bounds for Bulk Arrival queues", JOURNAL=ejor, VOLUME=15, PAGES="237-243", YEAR=1984, KEYWORDS="Queueing system; bulk arrival", } @TECHREPORT{Yong84:Solution, AUTHOR="Z. Yongjian", TITLE="A Solution of Partial Overflow Model", INSTITUTION="Gambe Research Office of U.E.C.", ADDRESS="Japan", PAGES=8, YEAR=1984, KEYWORDS="Overflow", } @ARTICLE{Yous8405:Accuracy, AUTHOR="M. N. Youssef", TITLE="On the Accuracy of Forecasting Telephone Usage Demand", JOURNAL=atttj, VOLUME=63, NUMBER=5, PAGES="819-849", YEAR=1984, KEYWORDS="Telephony; forecasting", } @ARTICLE{Yum8412:Adaptive, AUTHOR="Takshing P. Yum and H.-A. Lin", TITLE="Adaptive Load Balancing for Parallel Queues with Traffic Constraints", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=12, PAGES="1339-1342", YEAR=1984, KEYWORDS="Load balancing", } @ARTICLE{Zhar8401:Computer, AUTHOR="M. A. Zharkov and T. I. Chitishvili", TITLE="Computer Synthesis of Toll Networks with Common Channel Signaling", JOURNAL="Telecommunications and Radio Engineering", ADDRESS="SU", VOLUME=38, NUMBER=1, PAGES="10-12", YEAR=1984, KEYWORDS="Telephony; CCS", } @ARTICLE{Ishi8402:Stationary, AUTHOR="A. Ishikawa", TITLE="Stationary Waiting Time Distribution in a {GI/Ek/m} Queue", JOURNAL=jorsj, ADDRESS="Japan", VOLUME=27, NUMBER=2, PAGES="130-149", YEAR=1984, KEYWORDS="Queueing system; GI/G/N; waiting time", } @INPROCEEDINGS{Jaco84:Mätningar, AUTHOR="C. Jacobaeus", TITLE="Mätningar på verklig Telefontrafik - från Palm till {SPC}", BOOKTITLE="NTS 5", ADDRESS="Trondheim, Norway", PAGES="II.4.1-9", YEAR=1984, LANGUAGE="Swedish", KEYWORDS="Traffic engineering; history", } @BOOK{Löff84:Rechnerverbundsysteme, AUTHOR="H. Löffler", TITLE="Rechnerverbundsysteme", PUBLISHER="Akademie-Verlag Berlin", ADDRESS="Berlin, Germany", PAGES=296, YEAR=1984, LANGUAGE="German", REFERENCES=339, KEYWORDS="Computer network; architecture; computer communication", ABSTRACT="Einführung in die Architektur von Rechnerverbundsystemen; Mehrrechnersysteme; Rechnerkommunikationsnetze; Rechnernetzwerke; Rechnergest tzte Kommunikationssysteme", } @ARTICLE{Dura84:International, AUTHOR="J. M. Duran and J. Visser", TITLE="International Standards for Intelligent Networks", JOURNAL=ieeecm, ISBN="0163-6804", ADDRESS="New York", PAGES="34-42", YEAR=1984, REFERENCES=9, KEYWORDS="Ccitt; in; intelligent network; standardization", ABSTRACT="The CCITT's Capability Set 1 Defines the Scope and Content of INs for the Near Term without Curtailing Subsequent Growth", } @INCOLLECTION{Gran84:MULTILINK, AUTHOR="J. S. Grant", TITLE="multilink -- a ring that provides a simple interface for individual outstations", BOOKTITLE="Ring Technology Local Area Networks", PUBLISHER="Elsevier Science Publishers", PAGES="41-50", YEAR=1984, REFERENCES=7, KEYWORDS="Lan; ring network", ABSTRACT="Multilink is a register-insertion ring using a self-clocked NRZdata format over twisted-pair cable. Its main use is for connecting individual terminals, workstations, printers, etc to each other and to central computing and communications facilities. An LSI version has been developed which is particularly suitable for interfacing to microcomputers. This paper discribed the designof the network and its role in distributed information process..", } @ARTICLE{Homa84:Intelligent, AUTHOR="J. Homa and S. J. Harris", TITLE="Intelligent Network Requirements for Personal Communications Services", JOURNAL=ieeecm, ISBN="0163-6804", ADDRESS="New York", YEAR=1984, REFERENCES=11, KEYWORDS="In; intelligent network", ABSTRACT={INs need the components that will get PCS off to a fast, profitable start.... In this article we will outline the IN requirements for implementing what is generally accepted within the industry as a "lead IN service", namely Personal Communications Services or PCS.}, } @ARTICLE{Jabb84:Intelligent, AUTHOR="B. Jabbari", TITLE="Intelligent Network Concepts in Mobile Communications", JOURNAL=ieeecm, ISBN="0163-6804", ADDRESS="New York", PAGES="64-69", YEAR=1984, REFERENCES=12, KEYWORDS="In; intelligent network; mobile radio", ABSTRACT="An examination of implementation of IN in mobile cellular.", } @INCOLLECTION{Mich84:TRN, AUTHOR="A. Michalski and R. Lis", TITLE="{TRN} - a microcomputer communication system for local area computer networks", BOOKTITLE="Ring Technology Local Area Networks", PUBLISHER="Elsevier", ADDRESS="Netherlands", PAGES="59-70", YEAR=1984, REFERENCES=2, KEYWORDS="Lan; ring network", ABSTRACT="Network controllers built around programmable data link controlchips facilitate implemntation of local network protocols. Thispaper describes a communication system called Train Ring Network, which has a token-passing architecture with contralized control. The logical connections between stations are based on decentralized virtual channel service. Stop-and-wait acknowledgement scheme and time-out mechanism are used.", } @ARTICLE{Okad84:Traffic, AUTHOR="T. Okada and Hiroyuki Ohnishi and N. Morita", TITLE="Traffic Control in Asynchronous Transfer Mode", JOURNAL=ieeecm, ISBN="0163-6804", ADDRESS="New York", PAGES="58-62", YEAR=1984, REFERENCES=2, KEYWORDS="Atm; ring network", ABSTRACT="Cell delay variation (CDV) complicates Usage Parameter Control (UPC). Fortunately, there is a GFC protocol that facilitates UPC.", } @INCOLLECTION{Sint84:LOCAL, AUTHOR="L. Sintonen", TITLE="A local area ring network architecture", BOOKTITLE="Ring Technology Local Area Networks", PUBLISHER="Elsevier", PAGES="71-77", YEAR=1984, REFERENCES=2, KEYWORDS="Lan; ring; token system", ABSTRACT="This paper describes a local computer network (TAMNET) implemented at the Electronics Laboratory of Tampere University of Technology for experimental purposes. The network topology is a ring operating at a bit rate of 2 Mbit/s maximum. Peripheral devices are connected to the network by microprocessor-based network nodes which provide link-level network sevices. The network operating system is distributed among these stations.", } @INPROCEEDINGS{Temp84:Cambridge, AUTHOR="S. Temple", TITLE="The design of the Cambridge fast ring", BOOKTITLE="IFIP WG 6.4 Ring Technology Local Area Networks", PUBLISHER="Elsevier Science Publishers B.V. (North-Holland)", ADDRESS="Canterbury, England", PAGES="79-88", YEAR=1984, REFERENCES=5, KEYWORDS="Cambridge ring; hslan; lan; man", ABSTRACT="The Cabridge Fast Ring (CFR) is a high speed local area networksimilar in principle to the well established Cambridge Ring. Inaddition to allowing much higher transfer rates than existing networks, the CFR incorporates facilities for partitioning the bandwidth between several groups of users and for connecting ringstogether without the need for bridge computers and complex addressing schemes. This paper describes the major design decisions.", } @ARTICLE{Will84:BATH, AUTHOR="P. J. Willis", TITLE="The {BATH} token ring: architecture and early experience", JOURNAL="Ring Technology Local Area Networks", PUBLISHER="Elsevier Science Publishers B.V. (North-Holland)", PAGES="51-58", YEAR=1984, REFERENCES=7, KEYWORDS="LAN; token ring", ABSTRACT="The design of all major aspects of a particular token ring is described. The implementation is at a stage where some raw performance figures are now abtainable and the first use is being madeof the network. Comments are not confined to purely technical matters as the document also mentions some of the more mundane considerations which influenced the development of the design.", } @ARTICLE{Stav84:Throughput, AUTHOR="B. Stavenow", TITLE="Throughput-delay characteristics and stability considerations of the access channel in a mobile telephone system", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="105-112", YEAR=1984, REFERENCES=13, KEYWORDS="MAT; cellular system; CSMA; carrier sense multiple access", ANNOTE="In this paper a performance study of the access channel in a cellular mobile telephone system is presented. The method used in the cellular system for multiplexing the population of mobile terminals over the access channel is a hybrid between the methods known as csma/cd and bima. In the paper we extend an analysis of csma/cd to accomodate the function of the particular random multiaccess protocol. Results are shown which illustrate the equilib", } @ARTICLE{Step84:Convolutional, AUTHOR="L. E. Stephens and L. W. Dowdy", TITLE="Convolutional bound hierarchies", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="120-133", YEAR=1984, REFERENCES=11, KEYWORDS="Queueing approximation; discrete convolution; upper bound", ANNOTE="The time required to find the exact solution of a product-form queueing network model of a computer system can be high. Faster and cheaper methods of solution, such as approximations, are natural alternatives. However, the errors incurred when using an approximation technique should be bounded. Several recent techniques have been developed which provide solution bounds. These bounding techniques have the added benefit that the bounds can be mad", } @ARTICLE{Suri84:Generalized, AUTHOR="R. Suri", TITLE="Generalized quick bounds for performance of queueing networks", JOURNAL=compperf, VOLUME=5, NUMBER=2, PAGES="116-120", YEAR=1984, REFERENCES=14, KEYWORDS="Runtime/storage efficiency; stochastic analysis", ANNOTE="Recently there has been interest in developing algorithms which bound the performance of queueing networks, instead of giving exact solutions. The advantage of such algorithms is that they can (potenially) given good estimates of performance with very little computation, and so prove useful in the preliminary design of large networks. Two such methods are the balanced job bound and the performance bound hierachy methods. A third method, called", } @ARTICLE{Suri84:Newbuilding, AUTHOR="R. Suri and Gregory W. Diehl", TITLE={A newbuilding block" for performance evaluation of}, JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="134-142", YEAR=1984, REFERENCES=40, KEYWORDS="Performance evaluation; product form; network; blocking", ANNOTE={We propose a new "building block", for analyzing queueing networks. This is a model of a server with a variable buffer-size. Such a model enables efficient analysis of certain queueing networks with blocking due to limited buffer spaces, since it uses only product-from submodels. The technique is extensively tested, and found to be reasonably accurate over a wide range of parameters. Several examples are given, illustating practical situation}, } @ARTICLE{Tasa84:Multiple, AUTHOR="S. Tasaka", TITLE="Multiple-access protocols for satellite packet communication networks: a performance comparision", JOURNAL=ieeeproc, VOLUME=72, NUMBER=11, PAGES="1573-1582", YEAR=1984, REFERENCES=24, KEYWORDS="Packet switching; satellite; ALOHA; multiple access", ANNOTE="This paper considers satellite packet communication networks with a large population of bursty users and presents an analytic comparsion of the throughput versus average message delay tradeoff characteristics of multiple-access protocols. The following six multiple-access protocols are examined: 1) slotted aloha, 2) reservation-aloha, 3) reservation protocol with a slotted aloha reservation channel, 4) a reservation protocol with a tdma reserva", } @ARTICLE{Temp84:Operating, AUTHOR="T. Tempelmeier", TITLE="Operating system processors in real-time systems - performance analysis and measurement", JOURNAL=compperf, VOLUME=5, NUMBER=2, PAGES="121-127", YEAR=1984, REFERENCES=8, KEYWORDS="Operating system; computer reaction time; measurement", ANNOTE="The use of an operating system coprocessor to improve response time in real-time systems is discussed. An operating system coprocessor is an additional processor exclusively dedicated to the operating system kernel, freeing the actual processor of almost all of the operating system work. The response-time improvements are analysed theoretically by means of probability theory, especially renewal theory and the theory of cumulative processes. E", } @ARTICLE{Thom84:Queueing, AUTHOR="A. Thomasian and P. Bay", TITLE="Analysis of queueing network models with population size constraints and delayed blocked customers", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="202-216", YEAR=1984, REFERENCES=28, KEYWORDS="Queueing approximation; blocking; arrival process; closed", ANNOTE="Queueing network models; qnm's with population size constraints and delayed blocked customers occur due to multiprogramming level; mpl constraints in computer systems and window flow-control mechanisms in computer communication networks; ccn's. The computational cost of existing algorithms is unacceptable for large numbers of chains and high population sizes. A fast approximate solution technique based on load concealment is presented to sol", } @ARTICLE{Turn84:DECNET, AUTHOR="R. Turner and J. Schriesheim and I. Mitra", TITLE="Performance of a {DECNET} based disk block server", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="96-104", YEAR=1984, REFERENCES=9, KEYWORDS="Numerical result; file management; lan; ethernet", ANNOTE="This report describes an experimental disk block server implemented for the rsx-11m operating system using decnet. The block server allows user programs on one system to access files on a disk physically located on a different system. The actual interface is at the level of physical blocks and io transfers. Results of basic performance measurements are given, and explained in terms of major components. Performance predictions are made for serve", } @ARTICLE{Will84:Processor, AUTHOR="E. Williams", TITLE="Processor queueing disciplines in distributed systems", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="113-119", YEAR=1984, REFERENCES=5, KEYWORDS="Parallel computing; FIFO; HOL priority; PREHOL priority", ANNOTE="A distributed program consists of processes, many of which can execute concurrently on different processors in a distributed system of processors. When several processes from the same or different distributed programs have been assigned to a processor in a distributed system, the processor must select the next process to run. The following two questions are investigated: what is an appropriate method for selecting the next process to run ? unde", } @ARTICLE{Zaho84:Incorporating, AUTHOR="J. L. Zahorjan and E. D. Lazowska", TITLE="Incorporating load dependent servers in approximate mean value analysis", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="52-62", YEAR=1984, REFERENCES=9, KEYWORDS="Queueing approximation; hierarchical modeling; prediction", ANNOTE="Queueing network performance modelling technology has made tremendous strides in recent years. Two of the most important developments in facilitating the modelling of large and complex systems are hierarchical modelling, in which a single load dependent server is used as a surrogate for a subsystem, and approximate mean value analysis, in which reliable approximate solutions of separable models are efficiently obtained. Unfortunately, there", } @ARTICLE{Agra84:General, AUTHOR="S. C. Agrawal and J. P. Buzen and A. Shum", TITLE="A general technique for developing approximate algorithms for queueing networks", JOURNAL=per, VOLUME=12, PAGES="63-77", YEAR=1984, REFERENCES=33, KEYWORDS="Queueing approximation; queueing network; decomposition; FIFO; priority; utilization; time in system", ABSTRACT="Response time preservation (rtp) is introduced as a general technique for developing approximate analysis procedures for queueing networks. The underlying idea is to replace a subsystem by an equivalent server whose response time in isolation equals that of the entire subsystem in isolation. The rtp based approximations, which belong to the class of decomposition approximations, can be viewed as a dual of the norton's theorem approach for solvi", } @ARTICLE{Agra84:Unified, AUTHOR="S. C. Agrawal and J. P. Buzen and A. K. Thareja", TITLE="A unified approach to scan time analysis of token rings and polling networks", JOURNAL=per, VOLUME=12, PAGES="176-185", YEAR=1984, REFERENCES=15, KEYWORDS="LAN; ring network; multipoint connection; message switching; ime in system; exhaustive service; nonexhaustive service; token system; changeover time", ABSTRACT="Token rings and multipoint polled lines are two widely used network interconnection techniques. The general concept of cyclic allocation processes is defined and used to characterize token passing and polling in these networks. Scan time, the time to poll all nodes at least once, is an important quantity in the response time analysis of such networks. We derive expressions for the mean and variance of scan times using a direct, operational", } @ARTICLE{Arti84:MVS, AUTHOR="H. P. Artis", TITLE="{MVS/XA} {I/O} overview", JOURNAL=compperf, VOLUME=5, NUMBER=3, PAGES="182-184", YEAR=1984, KEYWORDS="Documentation; I/O channel; extended architecture", ABSTRACT="Although most observers have concentrated on the virtual storage relief offered by mvs/xa, it also redefines the i/o hardware and software architecture of mvs/370 systems. In particular, it addresses the problems of i/o configuration size limitation and the paradox of reliability versus performance that were inherent in mvs/370 systems, the structure and limitations of mvs/370 i/o architecture are reviewed and then the i/o architecture offered", } @ARTICLE{Bass84:Workload, AUTHOR="M. A. Bassiouni and J. R. Spirn", TITLE="Workload characterization at the program level - a model for {I/O}", JOURNAL=compperf, VOLUME=5, NUMBER=1, PAGES="23-30", YEAR=1984, REFERENCES=24, KEYWORDS="Analytical model; I/O channel; semi Markov process; SIMSCRIPT; measurement; parameter validation; carried traffic; workload", ABSTRACT="A model for the logical I/O activity of tasks is presented. Results of the measurements and validation of the model are reported. An application of logical I/O modelling in the design of buffers for tasks is presented.", } @ARTICLE{Beck84:Modeling, AUTHOR="S. Becker and K. M. Rege and B. Sengupta", TITLE="A modeling methodology for sizing a computer based system in a netted environment", JOURNAL=per, VOLUME=12, PAGES="149-157", YEAR=1984, REFERENCES=4, KEYWORDS="Model; method; performance evaluation; CPU; utilization; multiprogramming; private network", ABSTRACT="This paper describes a hybrid model, combining both analytical and simulation techniques, which was developed to study the performance of a netted computer based system. The computer based system that was modeled is the facility assignment and control system (FACS). This system is presently being developed within several Bell operating companies to inventory and assign central office and outside plant facilities.", } @ARTICLE{Bene84:Uplink, AUTHOR="G. Benelli and E. Del Re and Romano Fantacci and F. Mandelli", TITLE="Performance of uplink random-access and downlink {TDMA} techniques for packet satellite networks", JOURNAL=ieeeproc, VOLUME=72, NUMBER=11, PAGES="1583-1593", YEAR=1984, REFERENCES=19, KEYWORDS="Packet switching; ALOHA; performance evaluation; satellite radio; TDMA; time division multiple access", ABSTRACT="In this paper the integration of aloha random-access schemes and tdma techniques in a multibeam packet satellite network are analyzed. The uplink channels operate according to a slotted-aloha protcol, while the downlink channels use a tdma strategy. Two different models are described. In the first model, each transponder on-board the satellite is permanently connected to a preassigned spot beam. The second model uses a number of transponders lo", } @ARTICLE{Bran84:Efficient, AUTHOR="A. Brandwajn and W. M. Mc-Cormack", TITLE="Efficient approximation for models of multi-programming with shar ed domains", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="186-194", YEAR=1984, REFERENCES=16, KEYWORDS="Queueing approximation; multiprogramming; overflow; queueing network", ABSTRACT="Queueing network models of multiprogramming systems with memory constraints and multiple classes of jobs are important in representing large commercial computer systems. Typically, an exact analytical solution of such models is unavailable, and, given the size of their state space, the solution of models of this type is approached through simulation and/or approximation techniques. Recently, a computationally efficient iterative technique has.", } @ARTICLE{Brum84:Operational, AUTHOR="J. A. Brumfield", TITLE="Operational response-time formulas and their sensitivity to error", JOURNAL=compperf, VOLUME=5, NUMBER=1, PAGES="7-13", YEAR=1984, REFERENCES=8, KEYWORDS="Time in system; operational analysis; M/G/1; parameter validation; error bound; accuracy", ABSTRACT="Operational assumptions can be used to derive four different response-time formula for an isolated service centre. There are two sources of error in using these formulas for performance prediction: parameter estimation and assumption violation. An analysis of the error expressions gives insight into the expected accuracy of the response-time estimates.", } @ARTICLE{Coff84:Recent, AUTHOR="E. G. Coffman", TITLE="Recent progress in the performance evaluation of fundamental allocation algorithms", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="2-6", YEAR=1984, REFERENCES=10, KEYWORDS="Performance evaluation; information system; operating system; memory management; allocation; algorithm", ABSTRACT="Our understanding of several allocation algorithms basic to operating systems and to data base systems has improved substantially as a results of a number of research efforts within the past one or two years. We refer to proofs that certain classical algorithms described as approximate are in fact optimal in a strong probabilistic sense. The work discussed here will be classified according to the application areas, archival and dynamic", } @ARTICLE{Cson84:Workload, AUTHOR="E. Csontos", TITLE="Workload prediction using time-series analysis", JOURNAL=compperf, VOLUME=5, NUMBER=2, PAGES="70-79", YEAR=1984, REFERENCES=7, KEYWORDS="Modeling; prediction; time series analysis; accounting; cpu; workload; capacity planning", ABSTRACT="A workload-projection method that is being implemented at esso australia is outlined. The method concentrates on the prediction of cpu requirements, and it is based on historical accounting information. The paper begins with a review of methods for converting accounting information to 'true' cpu time. The workload is partitioned by a number of attributes, and capture ratios are developed. Time-series analysis is accomplished using various tech", } @ARTICLE{Curr84:Measurement, AUTHOR="J. Curram and Cyril Leung", TITLE="Measurement and modelling of an interactive distributed system using operational analysis", JOURNAL=compperf, VOLUME=5, NUMBER=3, PAGES="178-181", YEAR=1984, REFERENCES=6, KEYWORDS="STAR network; computer network; operational analysis; measurement; interactive mode; PArallel computing; time in system", ABSTRACT="The measurement of an interactive computer system using synthetic workload is discussed, and the construction of a validated analytic tool to predict its performance is described. The system under study is a distributed one consisting of a network of four computers arranged in a star configuration. In spite of the complexity of the system, a simple model has been successfully constructed using the equations of operational analysis, and close ag", } @ARTICLE{Das8403:Validated, AUTHOR="P. K. Das and K. K. Bagchi and B. B. Bhaumik", TITLE="Validated analytical technique for multiple microprocessor architectures", JOURNAL=compperf, VOLUME=5, NUMBER=3, PAGES="169-177", YEAR=1984, REFERENCES=19, KEYWORDS="microprocessor; method; parameter validation; queueing network", ABSTRACT="A generic performance model for multimicroprocessor systems at message passing level is described. Unlike other models, which are valid for a limited number of architectures only, the methodology outlined here is a simple but generalized one and with its help a large number of architectures can be modelled. An architecture is first mapped onto this generic model or an iterated version of it. The resulting model is subsequently mapped onto diffe", } @ARTICLE{Emri84:Capacity, AUTHOR="R. Emrick", TITLE="Capacity management of end-user processing", JOURNAL=compperf, VOLUME=5, NUMBER=2, PAGES="80-84", YEAR=1984, REFERENCES=3, KEYWORDS="Resource management; modeling; prediction; information system; capacity planning; workload", ABSTRACT="End-user processing is being promoted very actively throughout the information management industry and is possibly the fastest growing workload segment. Capacity management practitioners face one of their greatest challenges in attempting to forecast this workload. The premise that end-user processing will provide more timely information, reduce programming backlogs, and generally increase productivity is probably sound.", } @ARTICLE{Ferr84:Foundations, AUTHOR="D. Ferrari", TITLE="On the foundations of artificial workload design", JOURNAL=per, VOLUME=12, PAGES="8-14", YEAR=1984, REFERENCES=16, KEYWORDS="Design; model; performance evaluation; man-machine interaction; interactive mode; product form; network; workload; user behaviour graph", ABSTRACT="The principles on which artificial workload model design is currently based are reviewed. Design methods are found wanting for three main reasons: their resource orientation, with the selection of resource often unrelated to the performance impact of resource demands; their avoiding to define an accuracy criterion for the resulting workload model; and their ignoring the dynamics of the workload to be modeled. An attempt at establishing conceptu", } @ARTICLE{Foxl84:Hybrid, AUTHOR="E. Foxley and M. S. Ali", TITLE="Hybrid performance modelling method for virtual environments", JOURNAL=compperf, VOLUME=5, NUMBER=3, PAGES="159-168", YEAR=1984, REFERENCES=19, KEYWORDS="Analytical model; performance evaluation; simulation; process management; memory management; multiprogramming; virtual computer", ABSTRACT="During the past ten years, a number of papers have been published in the development of hybrid techniques for the modelling of computer performance. The objective of hybrid technique is to combine the low computing demands of analytic models with the flexibility of simulation models, and their main area of application so far has been to computer performance modelling. In this paper, existing techniques are extended to cover the performance of v", } @ARTICLE{Hugh84:Generating, AUTHOR="H. D. Hughes", TITLE="Generating a drive workload from clustered data", JOURNAL=compperf, VOLUME=5, NUMBER=1, PAGES="31-37", YEAR=1984, REFERENCES=14, KEYWORDS="Software monitor; data analysis; simulation model; carried traffic; workload; cluster analysis", ABSTRACT="The problem of constructing a representative computersystem wo rkload is addressed. A representative workload is necessary for various computer system performance evaluation studies, but difficulties can be experienced in identifying the essential performance variables to be used for characterizing the workload and developing a method of generating the drive workload. A detailed procedure is established for constructing a drive workload repres", } @ARTICLE{Kras84:Telecommunications, AUTHOR="W. P. Kraslawsky", TITLE="Telecommunications monitors and queue measurement", JOURNAL=compperf, VOLUME=5, NUMBER=2, PAGES="85-101", YEAR=1984, REFERENCES=9, KEYWORDS="Hardware monitor; analytical model; simulation model; data network; response time; tuning; GPSS; network management", ABSTRACT="Hardware monitoring of data communications systems is rapidly becoming a cost-effective means of management control. Computer rooms and management offices are being equipped with colour displays showing network status, response curve and frequency distributions. A significant selling point for these monitors is the ability to divided online response time into network and host components, which allows concentration of tuning efforts in the area", } @ARTICLE{Krze84:Improved, AUTHOR="A. Krzesinski and J. Greyling", TITLE="Improved lineariser methods for queueing networks with queue dependent centres", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="41-51", YEAR=1984, REFERENCES=6, KEYWORDS="Product form; network; communication network; model; modeling; prediction; queueing approximation; MVA; linearizer; load dependent server", ABSTRACT="The lineariser is an mva-based technique developed for the approximate solution of large multiclass product form queueing networks. The lineariser is capable of computing accurate solutions for networks of fixed rate centers. However, problems arise when the lineariser is applied to networks containing centres with queue dependent service rates. This paper presents an improved lineariser which computes accurate approximate solutions for", } @ARTICLE{Lave84:Simple, AUTHOR="S. S. Lavenberg", TITLE="A simple analysis of exclusive and shared lock contention in a da tabase system", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="143-148", YEAR=1984, REFERENCES=10, KEYWORDS="Information system; database; blocking; model; contention", ABSTRACT="We consider a probabilistic model of locking in a database system in which an arriving transaction is blocked and lost when its lock requests conflict with the locks held by currently executing transactions. Both exclusive and shared locks are considered. We derive a simple asymptotic expression for the probability of blocking which is exact to order $1/N$ where $N$ is the number of lockable items in the database.", } @ARTICLE{Mena84:Isolated, AUTHOR="D. A. Menasce and L. L. P. Leite", TITLE="Performance evaluation of isolated and interconnected token bus local area networks", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="167-175", YEAR=1984, REFERENCES=7, KEYWORDS="LAN; performance evaluation; multipoint connection; network delay; upper bound; lower bound; token system; packet delay", ABSTRACT="The token bus based local area network, redpuc, designed and implemented at the pontificia universidade catolica do rio de jan eiro is briefly described. Analytic models are presented, which allow one to obtain an approximation for the average packet delay, as well as exact upper and lower bounds for the same performance measure. A performance evaluation of interconnected local networks is also given.", } @ARTICLE{Moha84:Study, AUTHOR="S. M. A. Mohamad and J. C. Cavouras", TITLE="Performance study of descriptor-oriented architectures", JOURNAL=compperf, VOLUME=5, NUMBER=1, PAGES="14-22", YEAR=1984, REFERENCES=49, KEYWORDS="Structure; operating system; design; development; simulation; bibliography; computer architecture; protection", ABSTRACT="In designing a well-protected computer system, the objective is not only to design a controllable operating system so that the security policy is successfully enforced, but also to select a suitable design architecture. The available design architectures are presented and compared. The descriptor-oriented architecture has been used to modify a detailed and highly parameterized simulation model. The performance of this model is monitored and", } @ARTICLE{Muss84:Parallel, AUTHOR="P. H. Mussi and P. Nain", TITLE="Evaluation of parallel execution of program tree structures", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="78-87", YEAR=1984, REFERENCES=6, KEYWORDS="Numerical result; parallel computing; Performance evaluation", ABSTRACT="We define and evaluate two policies (na-policy, a-policy) for parallel execution of program tree structures. Via a probabilistic model we analytically determine, for each policy, the Laplace-Stieltjes transform for the tree processing time distribution. The acceleration of the program execution time achieved when adding processors to a single processor environment, is computed and plotted for each policy.", } @ARTICLE{Park84:Micro, AUTHOR="E. B. Parker", TITLE="Micro earth stations as personal computer accessories", JOURNAL=ieeeproc, VOLUME=72, NUMBER=11, PAGES="1526-1531", YEAR=1984, REFERENCES=11, KEYWORDS="Packet switching; satellite radio; CDMA; code division multiple access; PC; spread spectrum", ABSTRACT="Equatorial communications company has shipped more than 15000 micro earth stations, typically 24 in (60 cm) in diameter and costing under dollar 3000 for reception of satellite data transmission. Many are used as data input devices for personal computers in distributed database applications. Spread-spectrum modulation techniques implemented in microprocessor technology are used in equatorial networks and earth stations to provide high", } @ARTICLE{Pawl84:Role, AUTHOR="P. F. Pawlita and H.-D. Südhofen", TITLE="Role of traffic measurements in information networks", JOURNAL=compperf, VOLUME=5, NUMBER=3, PAGES="135-143", YEAR=1984, REFERENCES=18, KEYWORDS="Measurement; performance evaluation; model; survey; network design; traffic parameter", ABSTRACT="This paper analyses the role of traffic measurements for the design of performance-optimized and cost-effective information net works. First, basic traffic measurement goals in network planning, development, operation and research, and the present situation are outlined. The importance of realistic traffic modelling based on measurements is shown by the sensitivity of queues to traffic misestimations. In view of the emerging communication lands", } @ARTICLE{Peac84:Experimental, AUTHOR="D. R. Peachey and R. B. Bunt and Carey Williamson and T. B. Brecht", TITLE="An experimental investigation of scheduling strategies for {UNIX}", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="158-166", YEAR=1984, REFERENCES=7, KEYWORDS="Process management; tuning; carried traffic; UNIX; operating system; performance measurement", ABSTRACT="The scheduler used in an operating system is an important factor in the performance of the system under heavy load. This paper describes the scheduling philosophy employed in the UNIX operating system and outlines the standard scheduling strategies. Modified strategies which address deficiencies in the standard strategies are described. The effectiveness of these modified strategies is assessed by means of performance experiments.", } @ARTICLE{Penn84:Measurement, AUTHOR="J. P. Penny and P. J. Ashton", TITLE="Measurement and description of time-sharing system response", JOURNAL=compperf, VOLUME=5, NUMBER=3, PAGES="144-152", YEAR=1984, REFERENCES=14, KEYWORDS="time in system; classification; measurement; comparison; service time; time sharing", ABSTRACT="The difficulties experienced in achieving precise definitions of commonly used response indices are discussed. A method for system evaluation is described which does not require precise definition of a response index. Particular attention is given to indices based on mean response time or response ratio, and the conditions under which either can be used. Alternative ways of counting users are discussed, and it is shown that different evaluation", } @ARTICLE{Pere84:Parameter, AUTHOR="A. de J and L. W. Dowdy", TITLE="Parameter interdependencies of file placement models in a {UNIX} system", JOURNAL=per, PAGES="15-26", YEAR=1984, REFERENCES=12, KEYWORDS="Model; file management; modeling; prediction; user time; multiprogramming; closed queueing network; UNIX", ABSTRACT="A file assignment case study of a computer system running unix is presented. A queueing network model of the system is constructed and validated. A modeling technique for the movement of files between and within disks is proposed. A detailed queueing network model is constructed for several file distributions in secondary storage. The interdependencies between the speed of the cp u, the swapping activity, the visit ratios and the multiprogra", } @ARTICLE{Perr84:Queueing, AUTHOR="Harry Perros", TITLE="Queueing networks with blocking: a bibliography", JOURNAL=per, VOLUME=12, PAGES="8-12", YEAR=1984, REFERENCES=75, KEYWORDS="queueing network; blocking; bibliography", ABSTRACT="In recent years, queueing networks with blocking have been studied by researchers from various research communities such as co mputer performance modelling, operations research, and industrial engineering. In view of this, related results are scattered throughout various journals. The bibliography given below is the result of a first attempt to compile an exhaustive list of related papers in which analytic investigations (exact or approximate)", } @ARTICLE{Raja84:Measures, AUTHOR="M. K. Rajaraman", TITLE="Performance measures for a local network", JOURNAL=per, VOLUME=12, PAGES="34-37", YEAR=1984, REFERENCES=6, KEYWORDS="Performance measure; lan", ABSTRACT="Parameters that influence the performance of a local network consisting of three mainframes and an array processor are identified. Performance measures are developed for this network and their significance in the operation and use of the network are discussed. Some aspects of implementing such measures in local networks are examined.", } @ARTICLE{Redd84:Shared, AUTHOR="A. V. Reddi", TITLE="Shared-memory performance of multiple computer terminals in parallel distributed information processing systems", JOURNAL=compperf, VOLUME=5, NUMBER=1, PAGES="55-63", YEAR=1984, REFERENCES=14, KEYWORDS="Information system; remote peripheral; parallel computing; memory management; arrival process; uniform continuous distribution; Erlang distribution; service time; time in system; video service; telex; resource sharing", ABSTRACT="A system model for transmission of computer user's data with a finite number of regular users in a resource-sharing mode in parallel distributed information-processing systems is considered. The mini/microcomputer included in the system model is considered to be receiving the mixed arrival data of the user from a picture-phone terminal with uniformly-distributed data arrivals and a teletypewriter terminals with Erlang-distributed data arrival", } @ARTICLE{Redd84:Pipeline, AUTHOR="A. V. Reddi", TITLE="Performance of pipeline and parallel architectures for communication processors", JOURNAL=compperf, VOLUME=5, NUMBER=2, PAGES="102-107", YEAR=1984, REFERENCES=9, KEYWORDS="Multiprocessor system; communication network; ARPAnet; design; development; computer architecture; parallel computing; pipeline processing", ABSTRACT="Various communication processor systems architecture are reviewed and their evolution and future development are discussed. The suitability of pipeline and parallel architecture for communication processor system is examined, and their performance is analysed and compared with that of a uniprocessor. Finally, the most suitable architectures for communication processor systems are presented.", } @ARTICLE{Sang84:Program, AUTHOR="J. Sanguinetti", TITLE="Program optimization for a pipelined machine, a case study", JOURNAL=per, VOLUME=12, NUMBER=3, PAGES="88-95", YEAR=1984, REFERENCES=9, KEYWORDS="Numerical result; computation structure; performance improvement; optimization; pipeline processing", ABSTRACT="This paper describes certain optimizations made to a set of system software routines during their development. The optimization effort was driven by the execution frequencies of common paths through the programs in question, and by the execution characteristics of those paths, as shown by a processor simulator. Path optimization itself was done with both general program optimization techniques and with techniques specific to the particular", } @ARTICLE{Sere84:Satellite, AUTHOR="D. Seret and", TITLE="Satellite channels for distributed data systems", JOURNAL=compperf, VOLUME=5, NUMBER=3, PAGES="153-158", YEAR=1984, REFERENCES=20, KEYWORDS="Satellite radio; data network; HDLC; model; forward correction; queueing network; virtual channel", ABSTRACT="Link control of satellite channels is one of the most crucial items in computer communications via satellites. The performance of the standard hdlc protocol over satellite channels is studied and all the strategies proposed for improving data link efficiency are presented. Queueing models and probabilistic models are built in order to evaluate these new protocols and to compare their behaviour.", } @ARTICLE{Nadj84:Throughput, AUTHOR="B. Nadji and A. Thomasioan", TITLE="Throughput estimation in queueing networks", JOURNAL=compperf, VOLUME=5, NUMBER=4, PAGES="197-206", YEAR=1984, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Saue84:Numerical, AUTHOR="C. H. Sauer", TITLE="Numerical solution of some multiple chain queueing networks", JOURNAL=per, VOLUME=12, NUMBER=4, PAGES="19-28", MONTH="Winter", YEAR=1984, KEYWORDS="Queueing network; analysis", } @ARTICLE{Thom84:Speeding, AUTHOR="A. Thomasian and K. Gargeya", TITLE="Speeding up computer system simulations using hierarchical modeling", JOURNAL=per, VOLUME=12, NUMBER=4, PAGES="34-39", MONTH="Winter", YEAR=1984, KEYWORDS="Simulation; hierarchical modeling", } @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{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", } @BOOK{Jaya84:Digital, AUTHOR="Nuggehally S. Jayant and Peter Noll", TITLE="Digital coding of waveforms : principles and applications to speech and video", SERIES="signal processing series", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs, NJ", YEAR=1984, LANGUAGE="English", } @PHDTHESIS{Cao8401:Optimization, AUTHOR="Xi-Ren Cao", TITLE="Optimization and Perturbation Analysis of Discrete Event Dynamics Systems", SCHOOL="Harvard University", MONTH=jan, YEAR=1984, KEYWORDS="perturbation analysis", } @ARTICLE{Grav8401:Temps, AUTHOR="A. Gravey", TITLE="Temps d'attente et nombre de clients dans une file $nD/D/1$", JOURNAL="Annales de l'Institut Henri Poincaré -- Probabilités et Statistiques", VOLUME=20, NUMBER=6, PAGES="53-73", MONTH=jan, YEAR=1984, KEYWORDS="discrete time queue", ANNOTE="French. ``Waiting times and number of customers in a $nD/D/1$ queue.'' Periodic input sources.", } @ARTICLE{Suda8401:Packetized, AUTHOR="T. Suda and H. Miyahara and Toshiharu Hasegawa", TITLE="Performance Evaluation of a Packetized Voice System -- Simulation Study", JOURNAL=ieeecom, VOLUME="COM-34", NUMBER=1, PAGES="97-102", MONTH=jan, YEAR=1984, KEYWORDS="packet voice; playout synchronization", ABSTRACT="Introduction of the packet switching technique into digitized voice may afford great advantages in efficient use of the channel, compared to both circuit-switched and DSI systems. Detailed characteristics, however, have not been obtained because of the difficulty in the exact analysis. Hence, simulation models are developed in this paper for the packetized voice transmission system, and various characteristics of such as transmissioin delays and loss probability of voice packets are obtained. We further evaluate three types of voice packet reassembly strategy at the receiving terminal, and obtain the optimal packet length, which keeps both overall packet transmission delay and packet loss probability less than a certain permissible value. Comparison among three strategies is also stated.", ANNOTE="discusses playout strategies for packet voice: null (first packet of talkspurt delayed by fixed time), complete (account for network delay), and mixed timing (talkspurt played out as it arrives or after fixed delay, whichever is {\em greater}); in latter case, it is not clear what happens if first packet of talkspurt is lost; recommends maximum overall delay of 200 ms and packet length of about 250 bits; investigates single and three-hop system; assumes zero propagation delay; interfering traffic at intermediate nodes is Poisson; shows first two moments of silent interval differences, but does not explain how complete timing can incur any variations; provides no indication of simulation runlength, voice model and confidence intervals", } @ARTICLE{DeTr8401:Simulation, AUTHOR="John DeTreville", TITLE="A Simulation-Based Comparison of Voice Transmission on {CSMA/CD} Networks and on Token Buses", JOURNAL=bstj, VOLUME=63, NUMBER=1, PAGES="33-55", MONTH=jan, YEAR=1984, KEYWORDS="packet voice", ABSTRACT="Digitized speech can be transmitted over a variety of digital media. An interesting choice is the use of a local-area network (LAN), for which digitized speech is packetized at the transmitter and depacketized at the receiver. Many local-area networks exhibit good throughput but poor delay characteristics; variable or excessive transmission delay can become noticeable and objectionable to the users of such a voice system. A number of simulations were performed to assess the delay characteristics of a carrier sense multiple access/collision detection (CSMA/CD) LAN and of a similar token bus LAN. A comparison of the results show that the token bus performs somewhat better. The CSMA/CD LANs performance was characterized by carrying voice well until a point of collapse is reached; the token bus's performance degraded more continuously. In either case, throughput close to the theoretical capacity was found to be achievable with appropriate techniques.", ANNOTE="Judges acceptable delay by satellite connections as 270 ms. Suggests using variable packet sizes by appending voice samples accumulated during attempts to access LAN medium. Also investigates interference of data traffic. Mean delay of token ring is never less than CSMA/CD, with variance lower under heavy load and higher under low load.", } @ARTICLE{Jana8401:Integrated, AUTHOR="N. Janakiraman and B. Pagurek and J. E. Neilson", TITLE="Performance analysis of an integrated switch with fixed or variable frame rate and movable voice/data boundary", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=1, PAGES="34-39", MONTH=jan, YEAR=1984, KEYWORDS="integrated services; hybrid switching; movable boundary", ABSTRACT="In this paper, a variable-frame hybrid multiplexer with a min-max constraint on frame length is proposed. Using a single server queueing model, it is shown that the performance of the variable-frame multiplexer with respect to channel utilization, blocking, and delay is better than its fixed frame counterpart. Some of the results are compared to those from earlier studies.", } @ARTICLE{Whit8401:Approximations, AUTHOR="W. Whitt", TITLE="On approximations for queues, {III:} Mixtures of exponential", JOURNAL=atttj, VOLUME=63, NUMBER=1, PAGES="163-167", MONTH=jan, YEAR=1984, KEYWORDS="Queueing network; Approximation; GI/G/1; H/M/1", } @ARTICLE{Bhus8401:Considerations, AUTHOR="G. S. Bhusri", TITLE="Considerations for {ISDN} planning and implementation", JOURNAL=ieeecm, VOLUME=22, NUMBER=1, PAGES="18-32", MONTH=jan, YEAR=1984, REFERENCES=23, KEYWORDS="Survey; network planning; introduction strategy; ISDN", ABSTRACT="This paper gives an survey of the different network structures of ISDN like local networks, future broadband networks, signaling networks etc.", } @ARTICLE{Sast8401:Objectives, AUTHOR="A. Sastry", TITLE="Performance objectives for {ISDN's}", JOURNAL=ieeecm, VOLUME=22, NUMBER=1, PAGES="49-55", MONTH=jan, YEAR=1984, REFERENCES=59, KEYWORDS="survey; bibliography; public network; ISDN; performance projection", ABSTRACT="This paper gives an overview on the different services of ISDN and its performance objectives like error rate and delay requirements.", } @ARTICLE{Kost8401:Transition, AUTHOR="D. J. Kostas", TITLE="Transition to {ISDN} -- an overview", JOURNAL=ieeecm, VOLUME=22, NUMBER=1, PAGES="11-17", MONTH=jan, YEAR=1984, KEYWORDS="ISDN", } @ARTICLE{Mats8401:Recent, AUTHOR="Y. Matsuo", TITLE="Recent developments and future prospects in common channel signaling system", JOURNAL=jtr, VOLUME=26, NUMBER=1, PAGES="79-82", MONTH=jan, YEAR=1984, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Wien8401:Evolution, AUTHOR="R. M. Wienski", TITLE="Evolution to {ISDN} within the Bell Operating Companies", JOURNAL=ieeecm, VOLUME=22, NUMBER=1, PAGES="33-41", MONTH=jan, YEAR=1984, KEYWORDS="ISDN", } @INPROCEEDINGS{OBri8401:CSNET, AUTHOR="Michael T. O'Brien and Daniel B. Long", TITLE="{CSNET} Grows Up", BOOKTITLE="USENIX UniForum Conference", ADDRESS="Washington DC", MONTH=jan, YEAR=1984, } @TECHREPORT{Brin8401:MMDF, AUTHOR="D. Brink and S. E. Kille", TITLE="{MMDF} Access Control", TYPE="Indra Note", INSTITUTION="UCL", NUMBER=1531, MONTH=jan, YEAR=1984, } @TECHREPORT{Jeff8401:Time, AUTHOR="David Jefferson and A. Motro", TITLE="The Time Warp Concurrency Control Mechanism For Distributed Databases", INSTITUTION="Computer Science Department, University of Southern California", NUMBER="TR-84-302", MONTH=jan, YEAR=1984, } @ARTICLE{Lamp8401:Hints, AUTHOR="B. W. Lampson", TITLE="Hints for Computer System Design", JOURNAL=ieeesoft, MONTH=jan, YEAR=1984, REFERENCES=55, ABSTRACT="Designing a computer system is very different from designing an algorithm: the external interface - that is, the requirement - is less precisely defined, more complex, and more subject to change; the system has much more internal structure - hence, many internal interfaces and the measure of success is much less clear. The designer usually finds himself floundering in a see of posibilities, unclear about how one choice will limit his freedom to make other choices or affect the size and performance of the entire system. There probably isn't a best way to build the system or even a major part of it. Much more important is to avoid choosing a terrible way and how to have a clear division of responsibilities among the parts.", } @ARTICLE{Gopa8402:Playout, AUTHOR="P. M. Gopal and J. W. Wong and J. C. Majithia", TITLE="Analysis of Playout Strategies for Voice Transmission Using Packet Switching Techniques", JOURNAL=pe, VOLUME=4, NUMBER=1, PAGES="11-18", MONTH=feb, YEAR=1984, KEYWORDS="packet voice; playout synchronization", ABSTRACT="Due to variations in network delay, a stream of voice packets with deterministic interarrival times to a data network may not have deterministic interdeparture times at the destination. Two playout schemes which are designed to remove such variations in delay are considered. Analytic results for the performance of these two schemes are obtained. Numerical examples showing the effect of coefficient of variation of interdeparture time on performance are presented.", ANNOTE="Loss tolerance: 2\%. Late packets are discarded or delayed. Model: iid interarrival times (Erlang-$k$) within talkspurt; infinite receiver buffer.", } @ARTICLE{Zieg8402:Waiting, AUTHOR="Chaim Ziegler and Donald L. Schilling", TITLE="Waiting Times at Very Fast, Constant Service Time Merger Nodes", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=2, PAGES="189-194", MONTH=feb, YEAR=1984, REFERENCES=3, KEYWORDS="queueing theory; FIFO; multiplexer; waiting; time; packet switching; channel capacity; switching", ABSTRACT="The paper concerns the study of waiting times at a packet-switched merger node for which the outgoing capacity exceeds or is equal to the sum of the capacities of the incoming channels. The case of constant service times, fixed-length packets, and general independent inputs is considered. A trivial upper bound on the waiting time is derived. Exact results on waiting time are obtained for certain specific network configurations.", ANNOTE="general, continuous-time input process", } @ARTICLE{Mark8402:Integrated, AUTHOR="J. W. Mark and J. O. Limb", TITLE="Integrated voice/data services on Fasnet", JOURNAL=bstj, VOLUME=63, NUMBER=2, PAGES="307-336", MONTH=feb, YEAR=1984, KEYWORDS="local area networks; integrated services; packet voice", ABSTRACT="Fasnet is a high-speed local area network with a pair of unidirectional communication channels. While individual stations control their own access to the medium, global scheduling of the medium for various types of traffic is controlled centrally. Centeralized scheduling permits a slot to be endowed with a type, so it is feasible to integrate synchrononous and asynchronous traffic services on Fasnet. In this paper we describe a policy for admitting new voice calls into the system and an approximate analysis of the queueing behavior of data packets in an integrated voice and data services environment. Queueing behavior can also be studied by means of simulation, which is, however, an expensive undertaking, particularly at high transmission rates, for example, at 100 Mb/s. The approximate method described in this paper allows the performance evaluation for high-spedd local area networks.", } @ARTICLE{Konh8402:Integrated, AUTHOR="A. G. Konheim and R. L. Pickholtz", TITLE="Analysis of integrated voice/data multiplexing", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=2, PAGES="140-147", MONTH=feb, YEAR=1984, KEYWORDS="packet voice; local area networks; integrated services; ISDN; movable boundary; TDMA", ABSTRACT="A model of a moving-boundary, fixed frame length, integrated multiplexor is proposed and analyzed. The assignment of slots within a frame to the voice and data sources is made by an allocation function. The joint distribution of queue length and expected waiting time are derived.", } @ARTICLE{Birr8402:Implementing, AUTHOR="A. D. Birrell and B. J. Nelson", TITLE="Implementing Remote Procedure Calls", JOURNAL=tocs, VOLUME=2, NUMBER=1, PAGES="39-59", MONTH=feb, YEAR=1984, ABSTRACT="Remote procedure calss (RPC) appear to be a uaeful paradigm forp roviding communicaqtion across a network between programs written in a high-level language. This papaer descirbes a package providing a remote procedure call facility, the options that face the desinger of such a package, and the decisions we made. We describe the overall structure of our RPC mechanism, our facilities for binding RPC clients, the transport level communications protocol, and some performance measurements. We include descriptions of some optimizations used to achieve high performance and to minimize the load on server machines that have many clients.", ANNOTE="The idea of RPC was first suggested by J. E. White in a paper entitled ``A high-level framework for network-based resource sharing'' in the Proceedings of the National Computer Conference in June 1976. The implementation of RPC described in the paper is the one from the {\em Cedar} project at Xerox.", } @ARTICLE{Stal8402:Local, AUTHOR="W. Stallings", TITLE="Local network performance", JOURNAL=ieeecm, VOLUME=22, NUMBER=2, PAGES="27-36", MONTH=feb, YEAR=1984, REFERENCES=8, KEYWORDS="LAN; performance evaluation; ring network; survey", ANNOTE="Significant factors in determining local network performance based on recent studies.", } @ARTICLE{Nels8402:Hardware, AUTHOR="J. Nelson and M. K. Refai", TITLE="Design of a hardware arbiter", JOURNAL="Microprocessors and Microsystems", VOLUME=8, PAGES="21-24", MONTH=feb, YEAR=1984, KEYWORDS="Microprocessor; multiprocessor system; bus arbitration", } @ARTICLE{Anon8402:Special, AUTHOR="Anonymous", TITLE="Special Issue -- Programming, languages and open system interconnections", JOURNAL=cn, VOLUME=8, PAGES="3-55", MONTH=feb, YEAR=1984, } @TECHREPORT{Pope8402:Proposed, AUTHOR="A. Pope and D. P. Deutsch", TITLE="Proposed change to Personal Name standard attribute type", INSTITUTION="IFIP", NUMBER="IFIP WG 6.5 document", MONTH=feb, YEAR=1984, } @ARTICLE{Will8402:Concurrent, AUTHOR="R. Williamson and E. Horowitz", TITLE="Concurrent Communication and Synchronisation Mechanisms", JOURNAL=spe, VOLUME=14, NUMBER=2, PAGES="135-151", MONTH=feb, YEAR=1984, } @ARTICLE{Schr8402:Experience, AUTHOR="M. D. Schroeder and A. D. Birrell and R. M. Needham", TITLE="Experience with Grapevine: The Growth of a Distributed System", JOURNAL=tocs, VOLUME=2, NUMBER=1, PAGES="3-23", MONTH=feb, YEAR=1984, } @INPROCEEDINGS{As8403:Congestion, AUTHOR="H. van As", TITLE="Congestion Control in Packet Switching Networks by a Dynamic Foreground-Background Storage Strategy", BOOKTITLE="Performance of Computer-Communication Systems ( the IFIP WG 7.3/TC 6 Second International Symposium on the Performance of Computer-Communication Systems)", EDITOR="Werner Bux and Harry Rudin", ORGANIZATION="IFIP", PUBLISHER="North-Holland", ADDRESS="Zürich, Switzerland", PAGES="433-448", MONTH=mar, YEAR=1984, KEYWORDS="congestion control", ABSTRACT="Due to dynamic sharing of network resources, packet switching nodes have to cope with short overload peaks. Whereas packets entering the network can be rejected without waste of network resources, a rejection of packets already within the network should be avoided. For these so-called transit packets a congestion control mechanism based on priority scheduling and dynamic foreground-background management is proposed. Its investigation has been made by transient queueing analysis using the 4th-order Runge-Kutta method. Fundamentally, the model is a Markovian system with two nonpreemptive priority classes and several queue length restrictions. Loss probabilities reflecting the degree of packet rejection for each class have been chosen as performance measure. First, results are presented for steady state defining the system operating point. Subsequently, dynamic system reactions to rectangular overload peaks are shown. A comparison is made with a model with priority scheduling but without dynamic storage management.", } @PROCEEDINGS{Bux8403:Computer, TITLE="Performance of Computer-Communication Systems (Proceedings of the {IFIP} {WG} {7.3/TC} 6 Second International Symposium on the Performance of Computer-Communication Systems)", EDITOR="Werner Bux and Harry Rudin", ISBN="0-444-86883-6", ORGANIZATION="IFIP", PUBLISHER="North-Holland", ADDRESS="Zürich, Switzerland", MONTH=mar, YEAR=1984, } @INPROCEEDINGS{Dao8403:Modeling, AUTHOR="M. Dao and J. Labetoulle", TITLE="Modeling of a Node-to-Node Window Flow Control in a Store-and-Forward Network", BOOKTITLE="Performance of Computer-Communication Systems ( the IFIP WG 7.3/TC 6 Second International Symposium on the Performance of Computer-Communication Systems)", EDITOR="Werner Bux and Harry Rudin", ORGANIZATION="IFIP", PUBLISHER="North-Holland", ADDRESS="Zürich, Switzerland", PAGES="205-218", MONTH=mar, YEAR=1984, KEYWORDS="congestion control", ABSTRACT="This paper presents the modeling of a store-and-forward computer network where a local window flow control is implemented. The resolution of the model is carried out in two steps: first, the mean sojourn times in the different active resources of the network is calculated, and then mean blocking times due to flow control is computed using the values derived in the first part. Analytical results obtained will be compared to simulation runs to estimate the validity of the approximations done.", } @INPROCEEDINGS{Geih8403:Modeling, AUTHOR="Kurt Geihs", TITLE="Modeling and Analysis of Silence Suppression Strategies for Packet Voice Transmission", BOOKTITLE="Performance of Computer-Communication Systems ( the IFIP WG 7.3/TC 6 Second International Symposium on the Performance of Computer-Communication Systems)", EDITOR="Werner Bux and Harry Rudin", ORGANIZATION="IFIP", PUBLISHER="North-Holland", ADDRESS="Zürich, Switzerland", PAGES="139-155", MONTH=mar, YEAR=1984, KEYWORDS="packet voice", ABSTRACT="In packet voice communication systems data rate reduction can be achieved by suppressing the transmission of silence periods. In this paper the performance of several silence suppression strategies is compared using a Markovian speech model and an approximation technique for the delay distribution. Performance predictions are made for conventional point-to-point transmission lines as well as for two popular local computer network technologies.", } @INPROCEEDINGS{Half8403:Backlog, AUTHOR="S. Halfin", TITLE="The Backlog of Data in Buffers with Variable Input and Output Rates", BOOKTITLE="Performance of Computer-Communication Systems ( the IFIP WG 7.3/TC 6 Second International Symposium on the Performance of Computer-Communication Systems)", EDITOR="Werner Bux and Harry Rudin", ORGANIZATION="IFIP", PUBLISHER="North-Holland", ADDRESS="Zürich, Switzerland", PAGES="307-319", MONTH=mar, YEAR=1984, KEYWORDS="queueing theory", ABSTRACT="Buffers are frequently used for temporary storage of data when the total input into a given location may from time to time exceed the total output from that location. We study buffers whose input and output rates depend on the state of a birth-and-death process. Two important applications are: (1) inputs from a group of terminals with a varying number of active terminals; and (2) integrated data and voice systems. We show how to calculate moments of the backlog of data in the buffer and of the delay.", } @INPROCEEDINGS{Mühl8403:Simulation, AUTHOR="H. Mühlenbein and F. Limburger", TITLE="Simulation of Flow and Congestion Control Algorithms", BOOKTITLE="Performance of Computer-Communication Systems ( the IFIP WG 7.3/TC 6 Second International Symposium on the Performance of Computer-Communication Systems)", EDITOR="Werner Bux and Harry Rudin", ORGANIZATION="IFIP", PUBLISHER="North-Holland", ADDRESS="Zürich, Switzerland", PAGES="191-202", MONTH=mar, YEAR=1984, KEYWORDS="congestion control", ABSTRACT="The performance of computer networks is influenced by many parameters, e.g., storage of the nodes, capacity of the links and the traffic load. Investigations with analytical models have shown the optimal solutions for important subproblems (storage management in a node, window control). These solutions are for the stationary case and depend on the traffic load. The simulation model TOCS for computing system simulation has been enhanced by a connection oriented computer network model which incorporates the ``optimal'' solutions of the subproblems in adaptive algorithms. It uses the multiplexing of many (layer-4) connections into (layer-3) connections (virtual lines). The system design allows for the communication system and the communicating entities to ``talk'' about performance and network status which are relevant to flow control. For comparison we also implemented the static layer 3 window algorithm of the German PTT packet-switching network DATEX-P. The simulation experiments show a 5 to 60 percent better performance of the adaptive algorithm for file transfer applications, with only a small increase in dialog delay.", } @ARTICLE{Jana8403:Delay, AUTHOR="N. Janakiraman and B. Pagurek and J. E. Neilson", TITLE="Delay versus {TASI} advantage in a packet voice multiplexer", JOURNAL=ieeecom, VOLUME="COM-22", NUMBER=3, PAGES="319-320", MONTH=mar, YEAR=1984, KEYWORDS="packet voice; speech communication; statistical multiplexer; discrete-time queue", ABSTRACT="In this correspondence we complement, by means of an analytic model, an earlier simulation study on tradeoff between delay and TASI advantage in a packetized speech multiplexer.", } @ARTICLE{Kuro8403:Multiple, AUTHOR="James F. Kurose and M. Schwartz and Y. Yemini", TITLE="Multiple-Access Protocols and Time Constrained Communication", JOURNAL=acmcs, VOLUME=16, NUMBER=1, PAGES="43-70", MONTH=mar, YEAR=1984, } @BOOK{Rudi84:Computer, TITLE="Performance of computer-communication systems", EDITOR="H. Rudin and W. Bux", PUBLISHER="North Holland", ADDRESS="Zürich, Switzerland", PAGES=525, MONTH=mar, YEAR=1984, KEYWORDS="Computer network; performance evaluation; simulation", } @ARTICLE{Mass8403:Open, AUTHOR="W. A. Massey", TITLE="Open networks of queues: Their algebraic structure and estimating their transient behavior", JOURNAL=aap, VOLUME=16, NUMBER=1, PAGES="176-201", MONTH=mar, YEAR=1984, KEYWORDS="Queueing network; analysis", } @TECHREPORT{Gafn8403:Dynamic, AUTHOR="E. M. Gafni and D. P. Bertsekas", TITLE="Dynamic Control of Session Input Rates in Communication Networks", TYPE="LIDS-P", INSTITUTION="Massachusetts Institute of Technology", ADDRESS="Cambridge, MA", NUMBER=1298, NOTE="Revised version", MONTH=mar, YEAR=1984, } @INPROCEEDINGS{Cole8403:User, AUTHOR="Randy Cole", TITLE="User Experience and Evaluation of International {X.25} Services", BOOKTITLE="Telecoms Today Conference", ADDRESS="London", PAGES="107-118", MONTH=mar, YEAR=1984, KEYWORDS="X.25 performance", } @BOOK{Kill8403:JNT, TITLE="{JNT} Mail Protocol (revision 1.0)", EDITOR="S. E. Kille", PUBLISHER="Joint Network Team", ADDRESS="Rutherford Appleton Laboratory", MONTH=mar, YEAR=1984, KEYWORDS="greybook jntmail", } @INPROCEEDINGS{Wate8403:Satellite, AUTHOR="A. G. Waters", TITLE="The Performance of the Satellite Bridge in the {UNIVERSE} Project", BOOKTITLE="IFIP 2nd International Symposium on Performance of Computer-Communication Systems", PUBLISHER="North-Holland", PAGES="383-3", MONTH=mar, YEAR=1984, } @ARTICLE{Bent8403:Back, AUTHOR="Jon Louis Bentley", TITLE="The Back of the Envelope", JOURNAL=cacm, VOLUME=27, NUMBER=3, PAGES="180-184", MONTH=mar, YEAR=1984, } @PHDTHESIS{Weih8403:Atomic, AUTHOR="William Edward Weihl", TITLE="Specification and Implementation of Atomic Data Types", SCHOOL="MIT", MONTH=mar, YEAR=1984, KEYWORDS="Atomic consistency; serializability; argus", } @TECHREPORT{Lars8403:Decision, AUTHOR="R. E. Larson", TITLE="A Decision Theoretic Analysis of Queueing Delays and Environments. A Research Proposal", INSTITUTION="Massachusetts Institute of Technology", ADDRESS="Cambridge, Massachusetts", MONTH=mar, YEAR=1984, KEYWORDS="Queueing theory", } @ARTICLE{Whit8403:Mobile, AUTHOR="C. C. White", TITLE="Mobile Communications -Stalled", JOURNAL="Telecommunications", PAGES=6, MONTH=mar, YEAR=1984, KEYWORDS="Mobile radio", } @ARTICLE{Bart8403:OSI, AUTHOR="J. Bartik", TITLE="{OSI:} From model to prototype as commerce tries to keep pace", JOURNAL=datacommunications, VOLUME=13, NUMBER=3, PAGES="307-319", MONTH=mar, YEAR=1984, ANNOTE="Uses term 'Stuttgart wineglass' as picture of protocol hierarchy. Also called hourglass or protocol funnel.", } @ARTICLE{Gupt8403:First, AUTHOR="A. Gupta and Hoo-Min D. Toong", TITLE="The First Decade of Personal Computers", JOURNAL=ieeeproc, VOLUME=72, NUMBER=3, MONTH=mar, YEAR=1984, REFERENCES=38, ABSTRACT="The first decade of personal computers is characterized by three generations of these man-made devices. During the last six years alone, the number of personal computers purchased has increased by two orders of magnitude. This rapid growth has been catalyzed by innovations in computing and communication technology and by the advent of systems with friendlier human-machine interfaces geared towards individual needs. As the microelectronics revolution progresses and better software methologies evolve, the personal computer will find widespread use in nontraditional application areas involving computing operations on information of many different types. This paper discusses the key features of contemporary personal computers, four different market niches are delineated and their characteristics analyzed.", } @INPROCEEDINGS{Jenq8404:Approximations, AUTHOR="Y.-C. Jenq", TITLE="Approximations for packetized voice traffic in statistical multiplexer", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", PAGES="256-259", MONTH=apr, YEAR=1984, KEYWORDS="packet voice; statistical multiplexer; renewal theory", ABSTRACT="Recently, there has been great interest in voice transmission in packet form. Packet voice technology provides a potentially low cost mechanism for voice transmission by exploiting the bursty nature of speech signals via statistical multiplexing. Capacity and delay performance can be quite sensitive to traffic characteristics, especially with bursty traffic. Therefore, accurate methodology is needed for capacity and delay calculations. In this paper we study the traffic characteristics of packetized voice and its delay performance in a statistical multiplexer. We examine several approximation models and compare their results with a simulation. It is shown that for traffic intensity less than 0.7 the combined voice streams behaves like a Poisson process. However, for traffic intensity greater than 0.7 the combined traffic behaves significantly different from a Poisson stream. A renewal approximation, alone of the models tested, is shown to give a sufficiently accurate estimation of the mean waiting time through the entire range of traffic intensity (from 0 to 1). The methodology can be used for other types of traffic as well.", } @ARTICLE{Li8404:DTDMA, AUTHOR="Song Li and J. C. Majithia", TITLE="Performance analysis of a {DTDMA} local area network for voice and data", JOURNAL=cnj, VOLUME=8, NUMBER=2, PAGES="81-91", MONTH=apr, YEAR=1984, KEYWORDS="multiple access; integrated services; local area networks; TDMA", ABSTRACT="A demand-oriented TDMA (time division multiple access) scheme for integrated services in a local area network (LAN) is proposed. Specifically it is designed to handle voice and transaction oriented data traffic. The topology of the network is a bus. In the proposed DTDMA scheme, the time slot assignment is a call-oriented to voice traffic and packet-oriented to data traffic. Since voice is synchronously transmitted on a implied priority basis, its performance is not affected by the data rate on the channel. The performance of the proposed scheme has been analysed both by analytic models and simulation. It seems feasible to satisfactorily meet both voice and data performance objectives.", } @INPROCEEDINGS{Krai8404:Circuit, AUTHOR="B. Kraimeche and M. Schwartz", TITLE="Circuit access control strategies in integrated digital networks", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", PAGES="230-235", MONTH=apr, YEAR=1984, KEYWORDS="access control", ABSTRACT="Traffic access control strategies are investigated for circuit-switched demand access to a common digital transmission facility by a population of heterogeneous users, with different average holding times and differing bandwidth (bit rate) requirements. In order for this type of integrated communication system to handle its traffic demands with high efficiency and flexibility, close control of access and switching at the input node is required. We introduce a class of restricted access (RA) control strategies capable of providing improved system performance. These access strategies consist of clustering the set of user types and limiting the number of resource (bandwidth) units occupied by user types in each cluster. A recursive scheme for efficient system performance computation is presented. The optimum design of an RA strategy is formulated as a combinatorial optimization problem, and special case is treated via a simple algorithm. The RA strategy augmented by a priority scheme is shown to provide improved performance.", } @TECHREPORT{Ecke8404:Produktnetze, AUTHOR="Hans Eckert and R. Prinoth", TITLE="Produktnetze -- Definition eines {PROSIT-Beschreibungsmittels}", TYPE="Arbeitspapiere der GMD", INSTITUTION="Gesellschaf für Mathematik und Datenverarbeitung", ADDRESS="Bonn, Germany", NUMBER=92, MONTH=apr, YEAR=1984, LANGUAGE="German", KEYWORDS="protocol analysis; protocol synthesis; Petri Nets", ABSTRACT="Die in diesem Papier eingeführten Produktnetze stellen eine Formalisierung einer Untermenge der Spezifikationskonzepte dar, die im Projekt PROSIT zur problemadäquaten Beschreibung realer Kommunikationsdienste und -protokolle entwickelt wurden.", } @MISC{West8404:Automated, AUTHOR="Jil Westcott and John Buruss and Vivienne Begg", TITLE="Automated network management", MONTH=apr, YEAR=1984, } @ARTICLE{Cher8404:V, AUTHOR="D. R. Cheriton", TITLE="The V Kernel: A Software Base for Distributed Systems", JOURNAL=ieeesoft, VOLUME="S-1", NUMBER=2, PAGES="19-43", MONTH=apr, YEAR=1984, } @ARTICLE{Kuma8404:Modeling, AUTHOR="V. Kumar", TITLE="Modeling Delay in Selective Retransmission Protocol by a {FIFO} Queue", JOURNAL=ccr, VOLUME=14, NUMBER=1, PAGES="8-9", MONTH=apr, YEAR=1984, } @ARTICLE{Pisc8404:ISO, AUTHOR="D. Piscitello", TITLE="The {ISO} Internetwork Protocol Standard", JOURNAL=ccr, VOLUME=14, NUMBER=1, PAGES="10-13", MONTH=apr, YEAR=1984, } @ARTICLE{SC8404:Information, AUTHOR="ISO/TC 97/SC6", TITLE="Information Processing Systems--Data Communications--Protocol for Providing the Connectionless Network Service", JOURNAL=ccr, VOLUME=14, NUMBER=1, PAGES="14-58", NOTE="book chapter", MONTH=apr, YEAR=1984, REFERENCES=6, ABSTRACT="This protocol is one of a set of International Standards produced to facilitate the interconnection of open systems. The set of standards covers the services and protocols required to achieve such interconnection.", } @ARTICLE{Chun8404:Authentication, AUTHOR="A. W. Chung and R. H. Sherman", TITLE="Design of an Authentication Service", JOURNAL=ccr, VOLUME=14, NUMBER=1, PAGES="59-77", MONTH=apr, YEAR=1984, REFERENCES=10, } @ARTICLE{Anan8404:Extensive, AUTHOR="A. Ananda and B. Srinivasan", TITLE="An Extensive Bibliography on Computer Networks", JOURNAL=ccr, VOLUME=14, NUMBER=1, PAGES="78-98", MONTH=apr, YEAR=1984, REFERENCES=478, } @ARTICLE{Teit8404:Tour, AUTHOR="Warren Teitelman", TITLE="A Tour Through Cedar", JOURNAL=ieeesoft, MONTH=apr, YEAR=1984, REFERENCES=11, ABSTRACT="This article is an introduction to many of the salient features of the Cedar programming environment - a state-of-the-art programming system that combines high-quality graphics, a sophisticated editor and document preparation facility, and a variety of tools for the programmer to use in the construction and debugging of programs. The Cedar programming language is a strongly typed, compiler-oriented language of the Pascal family. What is especially interesting about the Cedar project is that it is one of the few examples where an interactive, experimental programming environment has been built for this kind of language. In the past, such environments have been confirmed to dynamically typed languages like Lisp and Smalltalk. In these pages I attempt to give the reader the 'feel' of Cedar system by simulating a live demonstration. The simulation is actually taken from a videotape of such a live demo; the sequents of events, as well as the dialogue is fairly close to what a viewer of this tape would see and hear. Numerous snapshots of display, taken at various points during the session, simulate the visual information contained in the tape. Text that would actually appear on the display during the demonstration - either because the user typed it or the system printed it - will appear in a distinctive typeface (English Times boldface).", } @TECHREPORT{Jarv8404:Application, AUTHOR="R. A. Jarvis", TITLE="Application Oriented Robotic Vision", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-84-02", MONTH=apr, YEAR=1984, } @INPROCEEDINGS{Thom8405:Asynchronous, AUTHOR="Andrew Thomas and J.-P. Coudreuse and M. Servel", TITLE="Asynchronous time-division techniques: an experimental packet network integrating videocommunication", BOOKTITLE=iss, ADDRESS="Florence, Italy", PAGES="32 C 2", MONTH=may, YEAR=1984, KEYWORDS="packet switching; ATM; video transport; fast packet switches; packet multiplexing", ABSTRACT="The packet multiplexing technique which is a subset of the TDM one, appears as an efficient way to provide a multi-bitrate access to a transmission support. This feature is widely enhanced when associated with packet switching technique. In this way, a non-dedicated packet switch can support any type of service, supposing the information suitably packetized. The wide-band aspect of video signals leads, however, to specific requirements, especially in the switching field which will have to provide a large processing capability. Based upon the existing fast electronic technologies, an experiment leaded at CNET (PRELUDE project) attempts to prove that such a technique is already quite realistic for implementing a multiservice network.", } @INPROCEEDINGS{Gril8405:Impact, AUTHOR="D. Grillo and Francesco Villani and Mario Calabrese and R. Pietrojusti", TITLE="Impact of low and high bit-rate voice coding in an integrated packet network", BOOKTITLE=iss, ADDRESS="Florence, Italy", VOLUME=4, PAGES="42.B.1-42.B.7", MONTH=may, YEAR=1984, KEYWORDS="packet voice; X.25; integrated services", ABSTRACT="Voice communication in X.25 packet switched networks is considered under different assumptions, related to voice applications (auxiliary/man-machine or interactive) and corresponding coding rates. The impact of X.25-compatible, voice tailored protocols combined with flow control actions aimed at meeting end-to-end voice delay requirements is analyzed.", } @TECHREPORT{Terr8405:Berkeley, AUTHOR="Douglas B. Terry and Mark Painter and David W. Riggle and Songnian Zhou", TITLE="The Berkeley {Internet} name domain server", TYPE="PROGRES Report", INSTITUTION="Computer Science Division, University of California", ADDRESS="Berkeley, California", NUMBER="UCB/CSD 84/182", MONTH=may, YEAR=1984, KEYWORDS="DNS; name resolution", ABSTRACT="The Berkeley Internet Name Domain (BIND) Server allows a standard way of naming the many types of objects and resources that exist in distributed UNIx environments, and provides operations for storing and retrieving information about these objects. BIND Servers collectively manage a hierarchical name space that is partitioned into domains reflecting administrative entities. Many existing UNIX applications, particularly mail facilities, will benefit greatly from such a service.", } @UNPUBLISHED{Kamm8405:Verteilte, AUTHOR="P. Kammerer", TITLE="Verteilte Systeme", INSTITUTION="Technische Hochschule Darmstadt", NOTE="Vorlesungsunterlagen", MONTH=may, YEAR=1984, KEYWORDS="networks; survey", } @INPROCEEDINGS{Ronn8405:Architecture, AUTHOR="L. A. Ronningen", TITLE="Architecture of a very fast packet switch", BOOKTITLE=iss, ADDRESS="Florence, Italy", PAGES="B41.4.1-B41.4.4", MONTH=may, YEAR=1984, REFERENCES=5, KEYWORDS="Design; architecture; fast packet switching; VLSI", ANNOTE="In this paper a fast and low-cost packet switch based on custom designed VLSI circuits is proposed. Methods for specification and design of the switch are outlined, and some simplified performance considerations are presented.", } @INPROCEEDINGS{Mui8405:Packet, AUTHOR="P. Mui and Nicolaos D. Georganas", TITLE="Packet-voice performance evaluation of two multiple access protocols", BOOKTITLE=icc, ADDRESS="Amsterdam", PAGES="121-124", MONTH=may, YEAR=1984, KEYWORDS="Lan", } @INPROCEEDINGS{Schm8405:Protocol, AUTHOR="W. Schmidt", TITLE="Protocol design of the {EC} 900 cellular radio system", BOOKTITLE="34th veh. tech. conference", ADDRESS="Pittsburgh", PAGES=7, MONTH=may, YEAR=1984, REFERENCES=8, KEYWORDS="MAT; control channel; protocol engineering", } @INPROCEEDINGS{Alga8405:CCITT, AUTHOR="D. Algalarrondo and J. Kremeur and O. Taxy and F. Lanquetot", TITLE="{CCITT} signalling system Number 7 experiment between digital exchanges", BOOKTITLE=iss, ADDRESS="Florence", VOLUME=3, PAGES="1-6 (31b.5)", MONTH=may, YEAR=1984, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Beka8405:Testing, AUTHOR="R. Bekaert and R. J. Manterfield and F. Haerens and D. L. Thomas", TITLE="Testing results from the implementation of the {CCITT} No. 7 signalling system", BOOKTITLE=iss, ADDRESS="Florence", PAGES="1-7 (31b.2) (paper 2)", MONTH=may, YEAR=1984, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Clos8405:Development, AUTHOR="W. Close and P. Darling and P. O'Neill", TITLE="Development of the Australian integrated digital network and strategy towards {ISDN}", BOOKTITLE=iss, ADDRESS="Florence", VOLUME=2, PAGES="1-6 (21c.2)", MONTH=may, YEAR=1984, KEYWORDS="ISDN", } @INPROCEEDINGS{Fuji8405:Signalling, AUTHOR="Y. Fujiyama and H. Takeichi and T. Masuda", TITLE="Implementation of signalling system {CCITT} No. 7 in {FETEX-150} digital switching system", BOOKTITLE=iss, ADDRESS="Florence", VOLUME=3, PAGES="1-7 (31b.7)", MONTH=may, YEAR=1984, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Heid8405:Field, AUTHOR="A. Heidermark and O. Borgström", TITLE="Field trial with signalling system Number 7 in {AXE} 10", BOOKTITLE=iss, ADDRESS="Florence", PAGES="1-7 (31.b.3)", MONTH=may, YEAR=1984, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Anon8405:Zeichengabeverfahren, AUTHOR="Anonymous", TITLE="Zeichengabeverfahren zwischen Vermittlungsstellen", JOURNAL="Siemens topic", NUMBER=3, MONTH=may, YEAR=1984, LANGUAGE="German", KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Stol8405:Realization, AUTHOR="A. Stoll and G. Wenzel", TITLE="Realization of signalling system No. 7 in an {ISDN}", BOOKTITLE=iss, ADDRESS="Florence", PAGES="1-7 (31B.4)", MONTH=may, YEAR=1984, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Subo84:CCITT, AUTHOR="M. Subocz and P. E. Wright and Y. Ikeda and M. Fujioka", TITLE="The {CCITT} signalling system No. 7 field trial between Japan and Australia", BOOKTITLE=iss, ADDRESS="Florence", PAGES="1-7 (31B.1)", MONTH=may, YEAR=1984, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Tail84:Laboratory, AUTHOR="G. Taille and J. P. Blanc and R. Mardon and M. Serge", TITLE="A laboratory model of a signalling transfer point {(STP)}", BOOKTITLE=iss, ADDRESS="Florence", PAGES="1-7 (31B.6)", MONTH=may, YEAR=1984, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Dani8405:LSI, AUTHOR="T. Daniel", TITLE="{LSI-11} {BBP} Driver --- Test and Measurement", JOURNAL="Personal Communication", MONTH=may, YEAR=1984, } @INPROCEEDINGS{Deut8405:Implementing, AUTHOR="D. P. Deutsch", TITLE="Implementing Distribution Lists in Computer Based Message Systems", BOOKTITLE="IFIP WG 6.5 Conference", ADDRESS="Nottingham", MONTH=may, YEAR=1984, } @INPROCEEDINGS{Kill8405:Integration, AUTHOR="S. E. Kille", TITLE="Integration of Electronic Mail and Conferencing", BOOKTITLE="IFIP WG 6.5 Conference", PUBLISHER="Noth Holland", ADDRESS="Nottingham", MONTH=may, YEAR=1984, } @TECHREPORT{Kill8405:Gatewaying, AUTHOR="S. E. Kille", TITLE="Gatewaying between {RFC} 822 and {JNT} Mail", INSTITUTION="JNT Mailgroup", NUMBER="Note 15", MONTH=may, YEAR=1984, } @ARTICLE{Svob8405:Resilient, AUTHOR="Liba. Svobodova", TITLE="Resilient Distributed Computing", JOURNAL=ieeese, VOLUME="SE-10", NUMBER=3, PAGES="257-268", MONTH=may, YEAR=1984, } @INPROCEEDINGS{Whit8405:User, AUTHOR="James E. White", TITLE="A User-friendly Naming Convention for Use in Communication Networks", BOOKTITLE="IFIP WG 6.5 Working Conference", PUBLISHER="North Holland", ADDRESS="Nottingham", MONTH=may, YEAR=1984, } @INPROCEEDINGS{Roth8405:Kernel, AUTHOR="K. Rothermel and B. Walter", TITLE="A kernel for transaction oriented communication in distributed database systems", BOOKTITLE=dcs, PUBLISHER="IEEE Computer Society Press", ADDRESS="Silver Spring, MD, USA", PAGES="557-65", MONTH=may, YEAR=1984, ABSTRACT="A kernel for transacation-oriented communication services is proposed as an adaption module between distributed database systems and the basic communication system. This kernel provides high-level communication primitives that are a good base on which to develop transaction oriented applications efficiently. The kernel also maintains recoverable transaction state tables that can be used to recall uncompleted transactions during restart recovery. It is argued that participating kernels should communicate by multicast.", } @INPROCEEDINGS{Mock8405:Domain, AUTHOR="P. V. Mockapetris", TITLE="A Domain Nameserver Scheme", BOOKTITLE="IFIP WG 6.5 Conference", ADDRESS="Nottingham", MONTH=may, YEAR=1984, } @TECHREPORT{Hurs8405:AMPL, AUTHOR="A. J. Hurst", TITLE="{AMPL} Another Micro Programming Language User Manual", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-84-03", MONTH=may, YEAR=1984, } @INPROCEEDINGS{Lind84:New, AUTHOR="I. Lindgren and G. Hellman", TITLE="Introduction of a New Data Switching Service in the Nordic Countries", BOOKTITLE=iss, ADDRESS="Florence, Italy", PAGES="34C, 7", MONTH=may, YEAR=1984, KEYWORDS="Data network", } @ARTICLE{Thar8406:Optimal, AUTHOR="A. K. Thareja and A. K. Agrawala", TITLE="On the Design of Optimal Policy for Sharing Finite Buffers", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=6, PAGES="737-740", MONTH=jun, YEAR=1984, KEYWORDS="queueing theory", ABSTRACT="An important analytic model of finite buffer systems is a multiclass single queue with typed servers. In the context of such a model, we address the problem of selecting an optimal buffer sharing policy. We show that with respect to weighted throughput, an optimal policy must be a stationary delayed resolution policy. An iterative procedure based upon the policy iteration method for Markov processes with rewards is used to efficiently search for the optimal delayed resolution policy for a given set of system parameters. A performance comparison of the optimal delayed resolution policy with other well-known buffer sharing policies is also provided.", } @MISC{Inte8406:Information, AUTHOR="{International Organization for Standardi}", TITLE="Information Processing Systems -- Open Systems Interconnection: Transport Service Definition -- {IS} 8072", MONTH=jun, YEAR=1984, KEYWORDS="transport protocol; OSI", } @ARTICLE{Will8406:Integrated, AUTHOR="Gilbert F. William and A. Leon-Garcia", TITLE="Performance analysis of integrated voice and data hybrid-switched links", JOURNAL=ieeecom, VOLUME="COM-32", NUMBER=6, PAGES="695-706", MONTH=jun, YEAR=1984, KEYWORDS="integrated services; movable boundary; TDMA; multiple access; numerical methods; Markov chains", ABSTRACT="Numerical techniques for the solution of a class of two-dimensional Markov processes are presented. These techniques are used to analyze the performance of several versions of hybrid switching including the movable boundary scheme with finite or infinite buffers, with flow control, and with or without TASI. Also included are results for TASI in which the number of off-hook calls is not fixed. Finally, the accuracy of the quasi-static approximation is evaluated for several problems.", } @INPROCEEDINGS{Agui8406:Datagram, AUTHOR="Lorenzo Aguilar", TITLE="Datagram routing for internet multicasting", BOOKTITLE=sigcomm, ORGANIZATION="ACM and IEEE", ADDRESS="Montreal, Canada", PAGES="58-63", NOTE="also in {\em Computer Communications Review}, 14 (2)", MONTH=jun, YEAR=1984, REFERENCES=10, KEYWORDS="multicast; routing; IP; network layer", ABSTRACT="We present a solution to the problem of multidestination routing in internetworks. The component subnets of these internets share a common datagram internet layer, and the gateways and hosts can determine the next gateway en route to a foreign net. Our datagram routing offers high resilience to network failures, major reductions in network traffic, and no changes whatsoever to the subnetwork routing. The routing follows ``shortest'' paths as defined by the distance criteria of an internet. We intend to use the algorithm as an option of the DoD Internet Protocol with only minor changes to IP while preserving interoperability with IP modules not supporting multidestination.", } @INPROCEEDINGS{Behr8406:Access, AUTHOR="J. P. Behr and Ulrich Killat", TITLE="Performance analysis of an access method suitable for the integration of voice and data", BOOKTITLE=sigcomm, ORGANIZATION="ACM and IEEE", ADDRESS="Montreal, Canada", PAGES="172-177", NOTE="also in {\em Computer Communications Review}, 14 (2)", MONTH=jun, YEAR=1984, REFERENCES=10, KEYWORDS="local area networks; integrated services; hybrid switching; movable boundary", ABSTRACT="This contribution describes a new type of an integrated system's architecture which reconciles the diverging needs of both stream traffic of 64 kbit/s and bursty traffic of low and high data rates. The total capacity of a unidirectional bus is subdivided into a high-speed channel and a certain number of time slots for stream traffic. The capacity of the high-speed channel can dynamically be adjusted according to the amount of time slots required for stream traffic. Due to the dynamic creation and deletion of time slots, the subsystem for 64-kbit/s channels is almost blocking free. The same mechanism is used to control access to the high-speed channel, and to determine the fraction of the total capacity dedicated to the high-speed channel. The performance of the proposed access mechanism has been investigated by means of system modeling and simulation. The results show that besides its ability to accomodate 64 kbit/s channels it compares quite favorably with other LAN concepts like CSMA/CD.", } @ARTICLE{DaCr8406:Kermit, AUTHOR="Frank Da Cruz and Bill Catchings", TITLE="Kermit: a file-transfer protocols for universities -- Part 1: design considerations and specifications", JOURNAL=byte, PAGES="255-278", MONTH=jun, YEAR=1984, KEYWORDS="Kermit; file transfer; serial line; microcomputer", } @TECHREPORT{Kuli8406:Arithmetic, AUTHOR="U. Kulisch and W. L. Miranker", TITLE="The arithmetic of the digital computer", TYPE="Mathematics Research Report", INSTITUTION="IBM Research Division", ADDRESS="Yorktown Heights, New York", NUMBER="RC 10580 (\#47356)", MONTH=jun, YEAR=1984, KEYWORDS="computer arithmetic; accuracy; floating point; numerical algorithms; scalar product; interval; bounding", ABSTRACT="The methodology for defining and implementing floating-point arithmetic is described. Shortcomings of elementary floating-point arithmetic are revealed through sample problems. The development of automatic computation with emphasis on the user control of errors is reviewed. The limitation of conventional rule of thumb procedures for error control in scientific computation are demonstrated by means of examples. Computer arithmetic is extended so that the arithmetic operations in the linear spaces and their interval correspondents which are most commonly used in computation can be performed with maximum accuracy on digital computers. A new fundamental computer operation, the scale product, is introduced to develop this advanced computer arithmetic. A process of automatic error control called validation which delivers high accuracy with guarantees for scientific computations is described. Validation of computations for a large class of numerical problems is made possible by advanced computer arithmetic. High accuracy is furnished by coupling the scalar product with the process of defect correction. Guarantees and error bounds are obtained by interval techniques. This whole process establishes certain numerical algorithms such as the evaluation of rational expressions as additional higher order arithmetic operations. The development of some programming languages in the context of computer arithmetic is reviewed. A collection of constructs in terms of which a source language may accomodate the methodology of computer arithmetic in a user-friendly mode is described. Finally the current state of implementation of the ideas discussed there is reviewed.", } @TECHREPORT{Sech8406:Tutorial, AUTHOR="Stuart Sechrest", TITLE="Tutorial Examples of Interprocess Communication in Berkeley {UNIX} {4.2BSD}", TYPE="PROGRES Report", INSTITUTION="Computer Science Division of the University of California at Berkeley", ADDRESS="Berkeley, California", NUMBER="UCB/CSD 84/191", MONTH=jun, YEAR=1984, } @INPROCEEDINGS{Bolo8406:Time, AUTHOR="T. Bolognesi and Harry Rudin", TITLE="On the Analysis of Time-Dependent Protocols by Network flow algorithms", BOOKTITLE="4th International Workshop on Protocol Specification, Verification and Testing", PAGES="491-513", MONTH=jun, YEAR=1984, REFERENCES=21, KEYWORDS="Protocol engineering; performance evaluation", } @INPROCEEDINGS{Rudi8406:Improved, AUTHOR="Harry Rudin", TITLE="An Improved Algorithm for Estimating Protocol Performance", BOOKTITLE="4th International Workshop on Protocol Specification, Verification and Testing", PAGES="515-525", MONTH=jun, YEAR=1984, REFERENCES=11, KEYWORDS="Protocol Performance; performance evaluation; analysis", } @INPROCEEDINGS{Dedo8406:Methods, AUTHOR="V. G. Dedobortsh and G. P. Basharin and M. A. Zharkov and K. E. Samuilov", TITLE="Methods of quality parameter analysis for common channel signalling system", BOOKTITLE="3rd International Seminar on Teletraffic Theory", ADDRESS="Moscow", PAGES="77-89 (paper 11)", MONTH=jun, YEAR=1984, KEYWORDS="Signalling; common channel; CCS; performance evaluation", } @INPROCEEDINGS{Font8406:Queue, AUTHOR="B. Fontana", TITLE="{M/G/1} queue with two non-preemptive priorities and feedback: Response time distribution for any particular sequence", BOOKTITLE="3rd International Seminar on Teletraffic Theory", ADDRESS="Moscow", PAGES="113-116 (paper 16)", MONTH=jun, YEAR=1984, KEYWORDS="Queueing system; priority; analysis", } @INPROCEEDINGS{Kell8406:Series, AUTHOR="F. P. Kelly", TITLE="Series of buffers", BOOKTITLE="3rd International Seminar on Teletraffic Theory", ADDRESS="Moscow", PAGES="229-240 (paper 30)", MONTH=jun, YEAR=1984, KEYWORDS="Queueing network; analysis", } @INPROCEEDINGS{Olss8406:Simple, AUTHOR="K. M. Olsson", TITLE="A simple proof of a generalization of Burke's theorem", BOOKTITLE="3rd International Seminar on Teletraffic Theory", ADDRESS="Moscow", PAGES="322-325 (43)", MONTH=jun, YEAR=1984, } @INPROCEEDINGS{Usha8406:Queuing, AUTHOR="V. G. Ushakov", TITLE="On some queuing systems with relative priority", BOOKTITLE="3rd International Seminar on Teletraffic Theory", ADDRESS="Moscow", PAGES="441-442 (61)", MONTH=jun, YEAR=1984, KEYWORDS="Queueing system; priority; analysis", } @MANUAL{Inte84:CCITT, AUTHOR="International Telegraph and Telephone Consultative Committee", TITLE="{CCITT} Study Group {VII} - Recommendations {X.400} to {X.410}", EDITION="AP VIII-66-E", MONTH=jun, YEAR=1984, } @ARTICLE{Goul8406:Doing, AUTHOR="J. D. Gould and N. Grischkowsky", TITLE="Doing the Same Work with Hard Copy and with Cathode-Ray Tube {(CRT)} Computer Terminals", JOURNAL="Human Factors Society", VOLUME=26, NUMBER=3, PAGES="323-337", MONTH=jun, YEAR=1984, } @TECHREPORT{Lazo8406:File, AUTHOR="E. D. Lazowska and J. L. Zahorjan and D. R. Cheriton and W. Zwaenepoel", TITLE="File Access Performance of Diskless Workstations", INSTITUTION="University of Washington, Seattle", NUMBER="84-06-01", MONTH=jun, YEAR=1984, } @ARTICLE{Same8406:Quadtree, AUTHOR="H. Samet", TITLE="The Quadtree and Related Hierarchical Data Structures", JOURNAL=acmcs, VOLUME=16, NUMBER=2, PAGES="187-260", MONTH=jun, YEAR=1984, } @INPROCEEDINGS{Edge8406:Adaptive, AUTHOR="S. W. Edge", TITLE="An Adaptive Timeout Algorithm for Retransmission across a Packet Switching Network", BOOKTITLE=sigcomm, ADDRESS="Montreal", PAGES="248-255", NOTE="also in Computer COmmunication Review (ACM CCR) Vol.14,No.2, Jun.1984", MONTH=jun, YEAR=1984, LANGUAGE="English", URL="http://doi.acm.org/10.1145/639624.802085", } @TECHREPORT{Karp8406:DRUID, AUTHOR="P. M. Karp", TITLE="{DRUID:} A Distributed Name Server", TYPE="Internal Report", INSTITUTION="Stanford University", MONTH=jun, YEAR=1984, } @INPROCEEDINGS{Lant8406:Factors, AUTHOR="K. A. Lantz", TITLE="Factors Affecting the Performance of Distributed Applications", BOOKTITLE=sigcomm, ADDRESS="Montreal", PAGES="116-123", NOTE="also in Computer COmmunication Review (ACM CCR) Vol.14,No.2, Jun.1984", MONTH=jun, YEAR=1984, } @ARTICLE{Lesl8406:Architecture, AUTHOR="I. Leslie and R. M. Needham and J. W. Burren and G. C. Adams", TITLE="The Architecture of the {UNIVERSE} Network", JOURNAL=ccr, VOLUME=14, NUMBER=2, PAGES="2-9", NOTE="sigcomm", MONTH=jun, YEAR=1984, REFERENCES=12, ABSTRACT="The Universe Network is composed of a number of local area networks at various sites in the U.K., joined by high capacity data links. Apart from one token ring, all of the local area networks are Cambridge rings; the high capacity data links are provided by a 1 Mbit/s satellite broadcast channel. The Universe Project encompasses both the design and implementation of the network, and a program of experiments which make use of the network. One of the notable features of the network is that a host's view of communication over the network is no different from communication over a single ring; no internet protocol is used.", } @ARTICLE{Nabi8406:Interfacing, AUTHOR="J. Nabielsky", TITLE="Interfacing to the 10 Mbps Ethernet: Observations and Conclusions", JOURNAL=ccr, ADDRESS="Montreal", VOLUME=14, NUMBER=2, PAGES="124-131", NOTE="sigcomm", MONTH=jun, YEAR=1984, REFERENCES=7, ABSTRACT="This paper documents our efforts to connect our network front-ends to the 10Mbps Ethernet, and presents some quantitative and qualitative results that may prove useful to those who, like us, are implementing a distributed-function architecture built upon a high-speed local area network.", } @ARTICLE{Pede8406:Channel, AUTHOR="N. N. Pedersen and R. Sharp", TITLE="Analysis of Channel Access Schemes for High-Speed {LANs}", JOURNAL=ccr, ADDRESS="Montreal", VOLUME=14, NUMBER=2, PAGES="164-171", NOTE="SIGCOMM Symposium", MONTH=jun, YEAR=1984, REFERENCES=9, ABSTRACT="A series of simulation studies into channel access protocols suitable for use in local area networks operating in baseband mode at bit rates of 100 Mbit/s or more is presented, and the usefulness of these protocols for supporting data transmission with mixed traffic is discussed.", } @ARTICLE{Econ8406:Slotted, AUTHOR="P. Economopoulos and Mart L. Molle", TITLE="On the performance of slotted {ALOHA} in a spread spectrum environment", JOURNAL=ccr, VOLUME=14, NUMBER=2, PAGES="234-41", NOTE="SIGCOMM Symposium", MONTH=jun, YEAR=1984, REFERENCES=6, ABSTRACT="The authors present an extension of the slotted ALOHA protocol for use in a spread spectrum packet radio environment. With spread spectrum, $N$ distinct codes are available, each code being used as a separate channel. Running an independent copy of the protocol on each of these channels would be undesirable, since each user would have to collect one channel to monitor for packets addressed to it, inducing a logical partitioning of the user population into $N$ groups. We examine the effect of separating packet into a short preamble, which is sent over a public channel, and a body, which is sent over a private channel. M of the available codes are used as preamble channels, and the remaining N-m codes are used for actual packet transmission. If m<