@BOOK{Gded83:Handbuch, AUTHOR="B. W. Gdedenko and D. König", TITLE="Handbuch der Bedienungstheorie", PUBLISHER="Akademie Verlag", ADDRESS="Berlin", VOLUME=1, YEAR=1983, KEYWORDS="queueing theory", } @BOOK{Hunt83:MathematicalBasic, AUTHOR="J. J. Hunter", TITLE="Mathematical Techniques of Applied Probability -- Discrete Time Models: Basic Theory", PUBLISHER="Academic Press", ADDRESS="New York, New York", VOLUME=1, YEAR=1983, KEYWORDS="queueing theory; discrete time queues", } @BOOK{Hunt83:MathematicalTechniques, AUTHOR="J. J. Hunter", TITLE="Mathematical Techniques of Applied Probability -- Discrete Time Models: Techniques and Applications", PUBLISHER="Academic Press", ADDRESS="New York, New York", VOLUME=2, YEAR=1983, KEYWORDS="queueing theory; discrete time queues", } @BOOK{Lave83:Computer, TITLE="Computer Performance Modeling Handbook", EDITOR="Stephen S. Lavenberg", SERIES="Notes and Reports in Computer Science and Applied Mathematics", ISBN="0-12-438720-9", PUBLISHER="Academic Press", ADDRESS="New York, New York", YEAR=1983, KEYWORDS="performance evaluation; simulation; queueing theory", } @INCOLLECTION{Ross83:StochasticOrder, AUTHOR="S. M. Ross", TITLE="Stochastic Order Relations", BOOKTITLE="Stochastic Processes", CHAPTER=8, PUBLISHER="John Wiley and Sons", ADDRESS="New York, New York", PAGES="251-284", YEAR=1983, } @BOOK{Ross83:StochasticProcesses, AUTHOR="S. M. Ross", TITLE="Stochastic Processes", PUBLISHER="John Wiley and Sons", ADDRESS="New York, New York", YEAR=1983, } @BOOK{Blau83:Spatial, AUTHOR="Jens Blauert", TITLE="Spatial Hearing: The Psychophysics of Human Sound Localization", PUBLISHER="MIT Press", ADDRESS="Cambridge, Massachusetts", YEAR=1983, KEYWORDS="hearing; spatial hearing; psychoacoustics; audio; stereo", } @PHDTHESIS{Mok83:Fundamental, AUTHOR="A. K. Mok", TITLE="Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment", SCHOOL="Massachusetts Institute of Technology", YEAR=1983, } @BOOK{Sedg83:Algorithms, AUTHOR="Rober Sedgewick", TITLE="Algorithms", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1983, } @INPROCEEDINGS{Thom83:Decomposition, AUTHOR="A. Thomasian and In Kyung Ryu", TITLE="A Decomposition Method to the Queueing Network Model of the Centralized {DBMS} with Static Locking", BOOKTITLE=sigmetrics, ADDRESS="Minneapolis, Minnesota", PAGES="82-92", YEAR=1983, } @INPROCEEDINGS{Thom83:Queueing, AUTHOR="A. Thomasian", TITLE="Queueing Network Models to Estimate Serialization Delays in Computer Systems", BOOKTITLE="Performance", PAGES="61-81", YEAR=1983, } @INPROCEEDINGS{Ni83:Prioritizing, AUTHOR="L. M. Ni and Xiao Li", TITLE="Prioritizing packet transmission in local multiaccess networks", BOOKTITLE="ACM Communications Symposium", ORGANIZATION="ACM", NOTE="also in {\em Perspectives on Packetized Voice and Data Communications}, William Lidinsky and David Vlack, editors, IEEE Press, New York, New York, 1990", YEAR=1983, KEYWORDS="multiple access; CSMA/CD; Ethernet; priority", ABSTRACT="Carrier sense multiple access with collision detection (CSMA/CD) protocols have been extensively studied and developed for local area networks. In CSMA/CD protocols, all messages are treated equally in competing for the communications channel. Thus, important or time-critical messages may be severely delayed. In this paper, a new CSMA/CD protocol with message-based priority functions is proposed. A priority code comparison period is needed to determine the highest priority class that can compete for the communication channel. A contention period based on CSMA/CD is then followed. Both nonpreemptive discipline and preemptive discipline are discussed. In each discipline, both the single mode and the batch mode are considered and compared. The overhead in implementing the proposed protocol, either for a few or for a large number of priority classes, is shown to be minimal. In general, a preemptive single mode scheme provides a better performance. The requirements of hierarchical independence of performance and fairness are satisfied.", } @INPROCEEDINGS{List8311:Voice, AUTHOR="M. Listanti and Francesco Villani", TITLE="Voice communication handling in {X.25} packet switching networks", BOOKTITLE=globecom, ORGANIZATION="IEEE", ADDRESS="San Diego, California", PAGES="66-70 (2.4)", MONTH="November/December", YEAR=1983, KEYWORDS="packet voice; X.25; network layer; integrated services", ABSTRACT="This paper discusses some ways to handle packet voice communication in X.25 networks and outlines a voice protocol featuring layers 2 and 3 as compatible subsets of data procedures and allowing for the additional information needed for voice processing. A first evaluation of the protocol layer 2 performance is also presented.", ANNOTE="discard less significant parts of voice frame within network; the lowest received length is reported back to sender to avoid asending data to be discarded.", } @INPROCEEDINGS{Turn8311:Packet, AUTHOR="J. S. Turner", TITLE="A packet network architecture for integrated services", BOOKTITLE=globecom, ORGANIZATION="IEEE", ADDRESS="San Diego, California", PAGES="45-50 (2.1)", MONTH="November/December", YEAR=1983, KEYWORDS="ISDN; ATM; integrated services; packet voice", ABSTRACT="The integrated services digital network (ISDN) is a concept of growing popularity that offers the prospect of new voice and data services at a modest cost. Most proposals for ISDN services involve an integrated access method (e.g., the digital subscriber line) and either separate networks for voice and data or hybrid switching systems of various sorts. This paper discusses the concept of using a single internal packet network to support ISDN services, exploring the protocols and performance of the packet network as well as some aspects of its implementation.", } @ARTICLE{Kerm83:Congestion, AUTHOR="Parviz Kermani and Kadaba Bharath-Kumar", TITLE="A congestion control scheme for window flow controlled computer networks", JOURNAL="Computers and Electrical Engineering", VOLUME=10, NUMBER=3, PAGES="229-243", YEAR=1983, KEYWORDS="congestion control; window flow control; end-to-end control", ABSTRACT="In this paper we introduce a congestion control scheme that is appropriate for virtual circuit networks that use fixed routing and a window mechanism for end-to-end flow control. The scheme relies on the notion of balancing the flow of traffic at the local buffer pool of the outgoing links at every node of the network. The effectiveness of the scheme at the intermediate nodes of a network as well as at the network entry point and at the gateway node of interconnected networks is studied via simulation.", } @ARTICLE{Law8311:Statistical, AUTHOR="A. M. Law", TITLE="Statistical analysis of simulation output data", JOURNAL=or, VOLUME=31, NUMBER=6, PAGES="983-1029", MONTH="November--December", YEAR=1983, KEYWORDS="output analysis; simulation; statistics; survey", ABSTRACT="We present a state-of-the-art survey of statistical analyses for simulation output data of a single simulated system. The various statistical problems associated with output data analyses such as start-up bias and determination of estimator accuracy are described in detail. We then discuss the best available techniques for addressing these problems, as well as topics for further research. The paper concludes with a discussion of how developments in simulation languages, computer graphics, and computer execution speed may affect the future of output analyses.", } @ARTICLE{Heid8311:Simulation, AUTHOR="P. Heidelberger and Peter D. Welch", TITLE="Simulation run length control in the presence of an initial transient", JOURNAL=or, VOLUME=31, NUMBER=6, PAGES="1109-1144", MONTH="November--December", YEAR=1983, KEYWORDS="simulation; statistical analysis; stochastic model applications; transient", ABSTRACT="This paper studies the estimation of the steady state mean of an output sequence from a discrete event simulation. It considers the problem of the automatic generation of a confidence interval of prespecified width when there is an initial transient present. It explores a procedure based on Schruben's Brownian bridge model for the detection of nonstationarity and a spectral method for estimating the variance of the sample mean. The procedure is evaluated empirically for a variety of output sequences. The performance measures considered are bias, confidence interval coverage, mean confidence interval width, mean run length, and mean amount of deleted data. If the output sequence contains a strong transient, the inclusion of a test for stationarity in the run length control procedure results in point estimates with lower bias, narrower confidence intervals, and shorter run lengths than when no check for stationarity is performed. If the output sequence contains no initial transient, then the performance measures of the procedure with a stationarity test are only slightly degraded from those of the procedure without such a test. If the run length is short relative to the extent of the initial transient, the stationarity tests may not be powerful enough to detect the transient, resulting in a procedure with unreliable point and interval estimates.", } @INPROCEEDINGS{Hilt83:Avoiding, AUTHOR="Starr Roxanne Hiltz and Murray Turoff", TITLE="Avoiding Information Overload in the Electronic Office", BOOKTITLE="Sixteenth Annual Hawaii International Conference on System Sciences", PAGES="581-589", YEAR=1983, KEYWORDS="computer conferencing; electronic mail", ABSTRACT="A variety of software options can help users to cope with the potential of information overload resulting from computer mediated communication systems. These include segmentation of communication topics via a conference structure, length limitations, voting structures, and a variety of mechanisms to filter and organize information. Encouragement of the emergence of an on-line social system, with norms and sanctions about considerate communications behavior, is also important for preventing ``junk mail'' and similar impositions of unwanted material on users of these systems.", } @PHDTHESIS{Finn83:Process, AUTHOR="Andrew T. Finn", TITLE="Process and Structure in Computer-mediated Group Communication", SCHOOL="Washington University", PAGES=166, YEAR=1983, KEYWORDS="computer conferencing", ABSTRACT="This study examines the effect of group process on performance in computer mediated group discussions. The theoretical framework views performance as a function of both group resources and process. It is hypothesized that the use of organizing strategies (i.e., group process) related to agenda setting, to the demands of the specific task, and to the demands of the specific medium are all related to the performance measures of consensus and decision quality. Transcripts generated in 24 five-person group discussions of a standard rank-order problem solving task in an earlier study of computer conferencing provide the data base for the present analyses. Measures of the theoretically relevant dimensions of organizing processes are constructed for each group discussion in the original experiment. These organizing strategies are analyzed for effects on the group performance measures. Multiple regression analysis is employed to control the effects of certain group resources and to assess the unique effect of each organizing strategy on group performance. The results provide limited support for the notion that organizing enhances group performance in computer-mediated communication. Task-specific organizing was found to be positively related to decision quality, while organizing tailored to the medium was found to be negatively related to decision quality. Organizing the agenda was positively related to group consensus. These effects are reliable when controlling for the initial level of decision quality or consensus in each group. No other significant effects on performance were found for any of the process measures investigated. Group resources such as the degree of previous experience with computer terminals and the presence of females in the group were also significantly related to consensus. These results call into question the importance of organizing strategies in computer conferencing. The failure of these organizing strategies to be significant determinants of group performance is addressed in terms of the appropriateness of the theoretical framework, the specific measures of group process employed, and the particular nature of the computer conferences analyzed in this study.", } @PHDTHESIS{Murr83:Impact, AUTHOR="Sharon L. Murrel", TITLE="The Impact of Communicating Through Computers (Electronic Mail, Conference)", SCHOOL="State University of New York (Stony Brook)", PAGES=159, YEAR=1983, KEYWORDS="electronic mail; computer conferencing", ABSTRACT="The impact of computer-based communication on group performance depends upon the structure enforced by the communication system. While the ability to introduce structures which enhance human communication processes has been applauded, research to evaluate the impact of various design features is lacking. This research has explored the impact of two synchronous approaches, which vary in the role of immediacy of interaction and feedback, on idea generation and group decision making. One system is message-oriented, requiring a conferee to complete a message before interacting with others. The other displays what each group member is typing in a separate window on the screens of all participants so that users can comment on ideas as they are expressed. While the differential ability to interact did not influence brainstorming performance, it did influence the ability of groups to produce quality decisions. Computer conferencing did not eliminate the characteristic group decrement in brainstorming performance observed in groups interacting face-to-face. Following standard brainstorming instructions to generate ideas without evaluation, subjects typed their ideas for four different problems. Groups interacting through either of the communication systems generated fewer ideas than the same number of people working individually on three of those problems. Differences between the two systems were demonstrated when the groups needed to organize their efforts to make decisions. Asked to solve a problem first individually and then cooperatively using one of the two systems, all groups produced decisions superior to the average initial individual solutions. Window system groups both improved more and produced significantly higher quality decisions than message system groups. These groups focused on fewer topics at one time while spending less time discussing how to organize both system usage and task efforts. By influencing the group's ability to organize and focus its attention, the design of the communication system influenced decision quality. Although each group experienced and rated only one system, window system groups judged their system more satisfactory for a variety of tasks than the message system groups.", } @PHDTHESIS{Tone83:New, AUTHOR="Paul D. Toner", TITLE="Evaluation of a New Model of Tryout-revision", SCHOOL="Michigan State University", PAGES=311, YEAR=1983, KEYWORDS="computer conferencing; software engineering", ABSTRACT="This study was carried out to obtain at least a limited answer to the question, ``is it operationally feasible to use synchronous conferencing (that is, with all participants on-line simultaneously) for obtaining tryout data during the development of self-instructional material? '' Two models of tryout-revision were used. One was a modification of a small group model developed by Abedor (1), which included the use of a face-to-face group debriefing of the learners. The other model was similar in all respects to the first, except that the debriefing was carried out through use of a computer conference. CONFER II, a computer conferencing system originally developed at the University of Michigan, was used, and the conference lasted for about 90 minutes. An instructional television program relating to the functions of an information processing system was used as the prototype. Learners were assigned to one of the two tryout-revision models. This led to the collection of two sets of prototype tryout data which was used as the basis for the development of two revised versions of the prototype. These versions were called the computer conferencing revision (CC revision) and the small group revision (SG revision). Each revision was tried out with learners comparable to the learners who tried out the prototype. Thus, three treatment groups were compared. The data showed that although neither revision brought about general significant improvement in learning, improvement was shown favoring the CC revision with respect to learning outcomes relating to one of the program's six instructional objectives. When the two revisions were compared to each other significant results (p = .009) were shown for the CC revision. This finding, however, is not very important, in view of the more general findings. Also found was that learners with little or no computer usage experience can learn to participate in a computer conference on the basis of very limited training. It was recommended that the computer conferencing model be operationalized in the asynchronous mode to make better use of the uniqueness of computer conferencing. (1) Abebor, Allen J. ``Second Draft Technology.'' Viewpoints 48 (July 1972):45-78.", } @ARTICLE{Rice83:Electronic, AUTHOR="Ronald E. Rice and Donald Case", TITLE="Electronic Message Systems in the {University---A} Description of Use and Utility", JOURNAL="Journal of Communications", VOLUME=33, NUMBER=1, PAGES="131-152", YEAR=1983, KEYWORDS="computer conferencing", ABSTRACT="A pilot study of a computer-based communications system, ``Terminals for Managers'' (80 senior managers), suggests that people do not necessarily attribute greater benefits to using computer-based massaging as they gain experience, and that they prefer different media depending upon the task, their organizational status, attributes of the medium, and their own personalities. Major uses were exchanging information, asking questions, and exchanging opinions. Three major conclusions: 1) positive impacts of electronic messaging systems in an organization represent may not be related to those who actually use the system, 2) computer based communications should be used where appropriate to the particular organizational task and managerial styles rather than indiscriminately requiring it, and 3) personality traits, job tasks, positions, and media skills affect how electronic communications will be accepted.", } @ARTICLE{Sidi83:Two, AUTHOR="M. Sidi and A. Segall", TITLE="Two interfering queues in packet-radio networks", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="123-129", YEAR=1983, REFERENCES=12, KEYWORDS="Packet switching; broadcast; communication; priority", ANNOTE="We consider several classes of interfering queues that appear in packet-radio networks. We analyze the class of systems where one of the queues is given full priority and obtain an expression for the joint probability distribution of the queue lenghts. For aloha-type systems with two symmetric queues we calculate the average packet waiting time and queue lenghts, and for symmetric systems with an arbitrary number of subscribers we develop a met", } @ARTICLE{Silv83:CapacityStrategies, AUTHOR="J. A. Silvester and L. Kleinrock", TITLE="On the capacity of single-hop slotted {ALOHA} networks for various traffic matrices and transmission strategies", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="983-991", YEAR=1983, REFERENCES=15, KEYWORDS="Channel capacity; network throughput; aloha; ring network", ANNOTE="We formulate a general model of the capacity of single-hop slotted aloha networks. We find that the capacity can be expressed as a function of the nodal degree (i.e., number of nodes within range of a transmitter). We than evaluate this model for various traffic matrices. In order to satisfy the requirements of a given traffic matrix, the transmission power is selected accordingly and this determines the degree of the nodes and, hence, the n", } @ARTICLE{Silv83:CapacityStructure, AUTHOR="J. A. Silvester and L. Kleinrock", TITLE="On the capacity of multi-hop slotted {ALOHA} networks with regular structure", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="974-982", YEAR=1983, KEYWORDS="Computer network; slotted ALOHA; routing algorithm; channel", ANNOTE="We investigate the capacity of networks with a regular structure operating under the slotted aloha access protocol. We first consider circular (loop) and linear (bus) networks and then proceed to two-dimensional networks", } @ARTICLE{Simo83:Priority, AUTHOR="B. Simon", TITLE="Priority queues with feedback", JOURNAL=jacm, YEAR=1983, LANGUAGE="Evglish", REFERENCES=6, KEYWORDS="Queueing system; M/G/1; priority; feedback; waiting time", ANNOTE="A priority queuing system in which a customer can feed back and change priority after being served is analyzed. More exactly, there are $c$ customer types. Customer type $i$ feeds back after service $n(i)-1$ times. The $k$th time a type $i$ customer is in the queue it has priority level $f(i,k)$ and requires a service time with arbitrary distribution gik. Type $i$ customers enter from outside as a Poisson process with rate $\lambda(i)$ and can be either preemptive", } @ARTICLE{Span83:Satellitenkommunikation, AUTHOR="O. Spaniol", TITLE="Satellitenkommunikation", JOURNAL=infspec, VOLUME=6, NUMBER=3, PAGES="124-141", YEAR=1983, LANGUAGE="German", REFERENCES=6, KEYWORDS="Satellite; survey; communication protocol; error-correcting", ANNOTE="The present paper gives an introduction of problems and solution methods for the design of a digital satellite communication system. The most important system parameters are studied and their influence on the performance is discussed. For an efficient use of satellite link capacity appropriate multiple access method are necessary as well as flow control and error recovery techniques; due to the long signal propagation delay between sender", } @ARTICLE{Stew83:Computable, AUTHOR="G. W. Stewart", TITLE="Computable error bounds for aggregated Markov chains", JOURNAL=jacm, VOLUME=30, PAGES="271-285", YEAR=1983, REFERENCES=1, KEYWORDS="Markov process; transition matrix; eigenvalue; error bound", ANNOTE="For some discrete finite Markov chains, the matrix a of transition probabilities can be partitioned so that the off diagonal blocks are smaller (in norm) than the square submatrices on the diagonal. Thus, a can be approximated by a block-diagonal matrix. The computation of the left eigenvector with eigenvalue 1, which gives the steady-state probabilities of the chain, then reduces to the computation of left eigenvectors of the submatrices on", } @ARTICLE{Stro83:Local, AUTHOR="N. C. Strole", TITLE="A local communications network based on interconnected token-acc ess rings: a tutorial", JOURNAL=ibmjrd, VOLUME=27, NUMBER=5, PAGES="481-496", YEAR=1983, KEYWORDS="Survey; lan; ring network", ANNOTE="This paper is a tutorial of the fundamental aspects of the architecture, physical components, and operation of a token-ring local area network. Emphasis is placed on the fault detection and isolation capabilities that are possible, as well as the aspects that allow for network expansion and growth. The role of the lan relative to ibm's systems network architecture is also discussed.", } @ARTICLE{Suri83:Robustness, AUTHOR="R. Suri", TITLE="Robustness of queuing network formulas", JOURNAL=jacm, VOLUME=30, PAGES="564-594", YEAR=1983, REFERENCES=37, KEYWORDS="Closed queueing network; operational analysis; modeling", ANNOTE="Analytic models of queuing networks have been observed to give good results for systems which do not conform to the assumptions of classical queuing theory. This has been explained to some extent by the recently proposed concept of operational analysis. However, the use of operational analysis for prediction of system performance involves a restrictive assumption, that of homogeneous service times (hst), and practical systems often deviate from", } @ARTICLE{Suri83:Phantom, AUTHOR="R. Suri and Xi-Ren Cao", TITLE="The phantom customer and marked customer methods for optimization of closed queueing networks with blocking and general service times", JOURNAL=per, VOLUME=13, PAGES="243-256", YEAR=1983, REFERENCES=21, KEYWORDS="Modeling; prediction; closed queueing network; service", ANNOTE="This paper is based on a recent technique called perturbation analysis of discrete event systems. The aims to the paper two-fold. The first, is to bring this technique, which is still relatively new, to the attention of a wider audience, since the method is particularly relevant to practical systems optimization. The second, is to develop two new methods, the phantom customer method and the marked customer method, as extensions of the perturbat", } @ARTICLE{Szpa83:Packet, AUTHOR="W. Szpankowski", TITLE="Packet switching in multiple radio channels: analysis and stability of a random access scheme", JOURNAL=cn, VOLUME=7, PAGES="17-26", YEAR=1983, KEYWORDS="Packet radio; packet switching; stability", } @ARTICLE{Toen83:NBSNET, AUTHOR="R. E. Toense", TITLE="Performance Analysis of {NBSNET}", JOURNAL=jtn, VOLUME=2, NUMBER=2, PAGES="177-186", YEAR=1983, REFERENCES=8, KEYWORDS="NBSNET; broadcast; packet switching; CSMA/CD; LAN", ANNOTE="cited in Ramshaw 83", } @INPROCEEDINGS{Tran83:Subcall, AUTHOR="P. Tran-Gia", TITLE="Subcall-oriented modelling of overload control in {SPC} switching systems", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES=7, YEAR=1983, REFERENCES=12, KEYWORDS="performance evaluation; SPC; overload control; queueing", } @INPROCEEDINGS{Tran83:Renewal, AUTHOR="P. Tran-Gia", TITLE="A renewal approximation for the generalized switching Poisson process", BOOKTITLE="Contribution to the International Workshop on Applied Mathematics", ADDRESS="Pisa, Italy", PAGES=13, YEAR=1983, REFERENCES=12, KEYWORDS="Queueing system; SPP; switched poisson process", } @ARTICLE{Urmo83:Aufbereitung, AUTHOR="W. Urmoneit", TITLE="Die Aufbereitung der verkehrstheoretischen Grundlagen zur Bemessung von Nachrichtennetzen, Teil {I-III}", JOURNAL=fernmelde, PUBLISHER="Verlag für Wissenschaft und Leben", ADDRESS="Bad Windsheim, Germany", VOLUME=37, YEAR=1983, LANGUAGE="German", REFERENCES=59, KEYWORDS="Queueing system; network; performance evaluation", } @ARTICLE{Whit83:Comparing, AUTHOR="W. Whitt", TITLE="Comparing batch delays and customer delays", JOURNAL=bstj, VOLUME=62, NUMBER=7, PAGES="2001-2009", YEAR=1983, REFERENCES=10, KEYWORDS="Comparison; geometric distribution; m/g/1; queue length", ANNOTE="For a large class of queueing systems in which customers arrive in batches, halfin (1983) showed that hte delay distribution of the last customer in a batch to enter service coincides with the delay distribution of an arbitrary customer when the batch-size distribution is geometric. Halfin's result can be applied to study the performance of complicated communication systems in which messages are divided into packets for transmission. Then pack", } @INPROCEEDINGS{Wolf83:Construction, AUTHOR="B. Wolfinger and M. Mühlhäuser", TITLE="Construction of a validated simulator for performance prediction of {DECNET-based} computer networks", BOOKTITLE=sigmetrics, PAGES="138-150", YEAR=1983, REFERENCES=18, KEYWORDS="simulation; performance evaluation; network architecture", ANNOTE="Predicting important performance parameters of computer networks, recognizing potential bottlenecks, comparing design alternatives are factors of decisive importance in building complex computer networks. In this respect, computer aided simulation has proved to be a very effective design tool in a number of practical applications. It is shown by the example of the mosaic modeling system how a simulator applicable on a broad basis could be adapt", } @INPROCEEDINGS{Wyat83:Experiment, AUTHOR="D. L. Wyatt and S. Sheppard and R. E. Young", TITLE="An experiment in microprocessor-based distributed digital simulation", BOOKTITLE=wsc, PAGES="271-277", YEAR=1983, REFERENCES=24, KEYWORDS="Design; method; distributed simulation; hardware", ANNOTE="This paper discussed the design of a distributed simulation system which will utilize off-the-shelf microprocessors in its implementation. Alternative approaches to the assignment of simulation functions and processes are presented. A project currently underway at texas A\\&M university is described which considers the impact of distributed architectures on the design of simulation language support systems. The emphasis in this research project i", } @ARTICLE{Zaho83:Workload, AUTHOR="J. L. Zahorjan", TITLE="Workload representations in queueing models of computer systems", JOURNAL=per, VOLUME=12, PAGES="70-81", YEAR=1983, REFERENCES=9, KEYWORDS="Comparison; computer reaction time; closed queueing", ANNOTE="There are two basic representations of workload in load independent, separable queueing models, these correspond to the notions of open and closed classes, an open class being one in which customers may arrive and depart the model, and a closed being one in which the number of customers is fixed. This paper examines the effect on mean system performance measures of the workload representation chosen. Open and closed representations are compared", } @ARTICLE{Zaho83:Decomposition, AUTHOR="J. L. Zahorjan and E. D. Lazowska and R. L. Garner", TITLE="A decomposition approach to modelling high service time variability", JOURNAL=pe, VOLUME=3, PAGES="35-54", YEAR=1983, REFERENCES=17, KEYWORDS="modeling; prediction; service time; variance; queueing", ANNOTE="The predictive ability of queueing network models can be greatly enhanced if those models include the effects of system characteristics such as high service time variability and simultaneous resource possession, which violate the assumptions required for their efficient exact solution. In this paper we present a new approximate solution technique for queueing networks that include coxian servers to represent resources at which customers have hi", } @ARTICLE{From83:Experiences, AUTHOR="H. Fromm and others", TITLE="Experiences with Performances Measurement and Modeling of a Processor Array", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=1, PAGES="15-31", YEAR=1983, REFERENCES=49, KEYWORDS="Measurement; parallel computing; multiprocessing; process", ANNOTE="Since 1980, a pilot implementation of the Erlangen general purpose array (EGPA) has been operational. Hardware and Software measurement methods are presented which allow to determine overall performance, to show the cooperation of parallel processes and to investigate potential bottlenecks. Validated performance models are used to predict the behavior of future systems.", } @INPROCEEDINGS{Göld83:Simulation, AUTHOR="E. H. Göldner and H. L. Truong", TITLE="A Simulation Study of {HDLC-ABM} with Selective and Nonselective Reject", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES=7, YEAR=1983, REFERENCES=7, KEYWORDS="Protocol; performance evaluation; HDLC; simulation", ANNOTE="The objective of this paper is to compare the performance of th e two recommended recovery options of the data link control procedure HDLC, balanced mode of operation (ABM), the reject-recovery and the selective reject-recovery.", } @MISC{Huan83:Wideband, AUTHOR="A. Huang and Scott C. Knauer", TITLE="Wideband digital switching network", ADDRESS="Murray Hill, New Jersey", PAGES=18, NOTE="United States Patent Nr. 4542497 Applied 479669", YEAR=1983, REFERENCES=11, KEYWORDS="ATM; digital network; switching network; self routing", ANNOTE={Disclosed is a wide bandwidth self-routing switch. One-to-one, one-to-many, and many-to-many modes of communications are achieved with time multiplexed signal packets of multi-service users with a system having a bank of demultiplexers which demultiplex incoming signals and supply them to a broadcast network. The broadcast network includes a concentrator, a "sort on source" sortingnetwork and a copy network.}, } @INPROCEEDINGS{Kies83:End, AUTHOR="W. M. Kiesel", TITLE="End to End Delay in Local Area Networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES=7, YEAR=1983, REFERENCES=13, KEYWORDS="LAN; multiple access; protocol; CSMA/CD; token system", } @ARTICLE{Park83:Measurement, AUTHOR="D. Parkinson and H. M. Liddell", TITLE="The measurement of performance on a highly parallel system", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=1, PAGES="32-37", YEAR=1983, REFERENCES=24, KEYWORDS="Multiprocessor system; distributed processing; parallel", ANNOTE="The problems of measuring the performance of a highly parallel multiple processor system are presented in relation to the conventional methods used for serial processors; this is preceded by a brief description of the DAP hardware in order to provide a framework for the discussion, together with some of the resulting implications for algorithm design.", } @INPROCEEDINGS{Rait83:HDLC, AUTHOR="T. Raith and H. L. Truong", TITLE="Analysis of {HDLC} Normal Response Mode with Full-Duplex Transmission - A New Calculation Method and Simulation", BOOKTITLE=itc10, ADDRESS="Montreal, Quebec", PAGES=7, YEAR=1983, REFERENCES=8, KEYWORDS="HDLC; NRM; Normal Response Mode; protocol; data link", } @ARTICLE{Reed83:Cost, AUTHOR="Daniel Reed and H. D. Schwetman", TITLE="Cost-Performance Bounds for Multimicrocomputer Networks", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=1, PAGES="83-95", YEAR=1983, REFERENCES=15, KEYWORDS="Interconnection network; multiprocessor system; ring", ANNOTE="Several interconnection structures for a distributed multimicrocomputer message-passing system are compared on the basis of cost and performance. Among the structures analyzed are buses, double rings, D-dimensional toroids, trees, cube-connected cycles, and chordal rings.", } @INPROCEEDINGS{Roth83:Traffic, AUTHOR="K. Rothmaier and R. Scheller", TITLE="On the Traffic Capacity and Loss of {PCM} Switching Arrays as a Function of Internal Traffic and Path Allocation Modes", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES=7, YEAR=1983, REFERENCES=13, KEYWORDS="PCM; switching network; routing algorithm", ANNOTE="This paper investigates in detail the influence of path the control on the traffic capacity and the loss, respectively. The applicability of highway internal connections and their loss is also regarded.", } @ARTICLE{Stuc83:Calculating, AUTHOR="B. W. Stuck", TITLE="Calculating the Maximum Mean Data Rate in Local Area Networks", JOURNAL=ieeecomp, VOLUME=5, PAGES="72-76", YEAR=1983, REFERENCES=5, KEYWORDS="LAN; IEEE 802.2; access control; CSMA/CD; token system", ANNOTE="In February 1980 a group of people met in San Francisco to form Project 802: Local Area Network Standards, sponsored by the IEEE Computer Society. A subcommittee was formed in spring 1981 to adress one aspect of the project: for a given workload, what type of congestion might each proposed method experience? This article summarizes the subcommittee's focus on calculating the maximum mean dat rate.", } @ARTICLE{Agra83:Graph, AUTHOR="D. P. Agrawal", TITLE="Graph Theoretical Analysis and Design of Multistage Interconnecti on Networks", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=7, PAGES="637-648", YEAR=1983, KEYWORDS="Graph theory; interconnection network; permutation network", ANNOTE={This paper introduces two graph theoretic models that provide a uniform procedure for analyzing Multistage Interconnection Networks, implemented with 2-input/2-output Switching Elements and satisfying a characteristics called the "budy property". These models show that all such n-stage MIN's are topologically equivale nt and hence prove that one MIN can be implemented from integrated circuits designet for another MIN.}, } @ARTICLE{Bhuy83:Generalized, AUTHOR="L. Bhuyan and D. P. Agrawal", TITLE="Design and Performance of Generalized Interconnection Networks", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=12, PAGES="1081-1090", YEAR=1983, KEYWORDS="Bandwidth switching; cost function; interconnection", ANNOTE={This paper introduces a general class of self-routing interconnection networks for tightly coupled multiprocessor systems. The proposed network, named a "generalized shuffle networl" is based on a new interconnection pattern called a generalized shuffle and is capable of connecting any number of processors $M$ to any number of memory modules $N$. The technique results in a variety of interconnection networks depending on how $M$ and $N$ are factore}, } @ARTICLE{Gold83:Distributed, AUTHOR="Y. Gold and William R. Franta and S. Moran", TITLE="A Distributed Channel-Access Protocol for Fully-Connected Networkswith Mobile Nodes", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=2, PAGES="133-147", YEAR=1983, KEYWORDS="Mobile radio; broadcast; collision free; access protocol", ANNOTE={We present a theoretical description and analysis of a collision-free channel-access protocol for a shared channel with "mobile"nodes that are all within range and in line-of-sight of each other, in arbitrarily changing spatial configurations. The protocol provides distributed access-control under Fixed priority, Fair Round-Robin and Proritized Round-Robin priority disciplines. Theprotocol employs information on the changing node configuration.}, } @ARTICLE{Heid83:Analytic, AUTHOR="P. Heidelberg and K. S. Trivedi", TITLE="Analytic Queueing Models for Programs with Internal Concurrency", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=1, PAGES="73-82", YEAR=1983, KEYWORDS="Approximation; computer system; Markov chain", ANNOTE="Analytic queueing models of programs with internal concurrency are considered. The program behavior model allows a process to spawn two or more concurrent tasks at some point during its execution. Except for queueing effects, the tasks execute independent ly of one another, and at the end of their execution, either wa it for all of their siblings to finish execution or merge with the parent if all have finished execution.", } @ARTICLE{Krus83:Multistage, AUTHOR="C. Kruskal and M. Snir", TITLE="The Performance of Multistage Interconnection Networks for Multiprocessors", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=12, PAGES="1091-1098", YEAR=1983, KEYWORDS="Multistage interconnection network; buffered banyan", ANNOTE="This paper studies the performance of unbufered and buffered, packet-switching, multistage interconnection networks. We begin byreviewing the definition of banyan networks and introducing some generalizations of them. We then present an asymptotic analysisof the performance of unbufferd banyan networks, thereby solvinga problem left open by Patel. We analyze the performance of the unbufferd generalized banyan networks.", } @ARTICLE{Lang83:Reduction, AUTHOR="T. Lang and M. Valero and M. Fiol", TITLE="Reduction of Connections for Multibus Organization", JOURNAL=ieeetc, VOLUME="C-32", PAGES="707-716", YEAR=1983, KEYWORDS="Interconnection network; multiprocessor system", ANNOTE="The multibus interconnection network is an attractive solution for connecting processors and memory modules in a multiprocessor with shared memory. It provides a throughput which is intermediate between the single bus and the crossbar, with a correspondingintermediate cost. The standard connection scheme for the multibus connects all processors and all memory modules to all buses. This connection scheme is redundand and expensive for a relative", } @ARTICLE{Ajmo83:Modeling, AUTHOR="Marco {Ajmone Marsan} and G. Balbo and G. Conte and F. Gregoretti", TITLE="Modeling Bus Contention and Memory Interference in a Multiprocessor System", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=1, PAGES="60-72", YEAR=1983, KEYWORDS="Multiprocessor system; bus arbitration; queueing network", ANNOTE="Stochastic models of contention for shared resources in an experimental multiprocessor prototype are presented and are validatetwith simulation and measurment results. Three modeling techniqu es are used that represent the system operations as Markovian stochastic processes. Each technique is best suited to a specific stage of the analysis. An integrated usee of these techniques a very powerful tool for the performance analysis of multiprocesso", } @ARTICLE{Padm83:Class, AUTHOR="K. Padmanabhan and D. H. Lawrie", TITLE="A Class of Redundant Path Multistage Interconnection Networks", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=12, PAGES="1099-1108", YEAR=1983, KEYWORDS="Fault tolerance; multistage interconnection network", ANNOTE="A general class of fault-tolerant multistage interconnection networks is presented, wherein fault-tolerance is achieved by prividing multiple disjoint paths between every input and output. The SE networks are derived from the Omega networks and as such retain all the connection properties of the parent networks in the absence of faults. An R-path network in this class can tolerate arbitrary faults in the intermediate stages of the network.", } @ARTICLE{Stei83:Invariant, AUTHOR="D. Steinberg", TITLE="Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=5, PAGES="444-459", YEAR=1983, KEYWORDS="Interconnection network; Omega network; parallel computing", ANNOTE="A simplified version of the Omega network is introduced which reduces the number of control bits by a factor of 2/n and yet performs many permutations important for parallel processing with little sacrifice in speed. The new network performs arbitrary permutations in no more than 6n+1 passes.", } @ARTICLE{Vali83:Optimality, AUTHOR="L. Valiant", TITLE="Optimality of a Two-Phase Strategy for Routing in Interconnection Networks", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=9, PAGES="861-863", YEAR=1983, KEYWORDS="Interconnection network; parallel computing; routing", ANNOTE="It is shown that for d-way shuffle graphs all oblivious algorithms for realizing permutations in logarithmic time send packets along routes twice as long as the diameter of the graph. This confirms the optimality of the strategy that sends packets to random nodes in a first phase and to the correct desti nations in the second. For the shuffle-exchange graph the corresponding rou te length is shown to be strictly longer than for the 2-way shuffle.", } @INPROCEEDINGS{Robe83:Teletraffic, AUTHOR="J. W. Roberts", TITLE="Teletraffic models for the {TELECOM} 1 integrated services network", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", VOLUME="1.1", YEAR=1983, REFERENCES=11, KEYWORDS="Traffic model; integrated network; reservation", } @ARTICLE{Bux83:Architecture, AUTHOR="W. Bux and F. Closs and K. K mmerle and H. J. Keller and H. R. Müller", TITLE="Architecture and Design of a Reliable Token-Ring Network", JOURNAL=ieeejsac, VOLUME=1, NUMBER=5, PAGES="756-765", YEAR=1983, REFERENCES=18, KEYWORDS="Performance evaluation; token ring; architecture", ANNOTE="Architecture, performance, transmission system, and wiring strategy of a token-ring LAN implemented at the IBM Zurich Research Laboratory are described. Particular emphasis is placed on high reliability, availability, and serviceability. The delay-throughput performance of the token ring is shown to depend very little on data rate and distance.", } @ARTICLE{Hube83:SILK, AUTHOR="D. E. Huber and W. Steinlin and P. J. Wils", TITLE="{SILK:} An Implementation of a Buffer Insertion Ring", JOURNAL=ieeejsac, VOLUME=1, PAGES="766-774", YEAR=1983, REFERENCES=22, KEYWORDS="LAN; synchronous transmission; multiplexing", ANNOTE="Sections of the paper describe the synchronous transmission technique of the ring channel, the time-multiplexed access of eight ports at each node, the braided interconnection for bypassing defective nodes, and the role of interface transformation units and user interfaces, as well as some traffic characteristics and reliability aspects. SILK's modularity and open system concept are demonstrated.", } @ARTICLE{Wils83:Optimal, AUTHOR="John D. Wilson", TITLE="Optimal Road Capacity in the Presence of Unpriced Congestion", JOURNAL="Journal of Urban Economics", VOLUME=13, PAGES="337-357", YEAR=1983, } @ARTICLE{Afsh83:Load, AUTHOR="P. V. Afshari and S. C. Bruell and R. Y. Kain", TITLE="On the load balancing bus accessing scheme", JOURNAL=ieeetc, VOLUME="C-32", PAGES="766-770", YEAR=1983, REFERENCES=27, KEYWORDS="Bus; parallel computing; analytical model; queueing network; load balancing; BCMP", ABSTRACT="We describe a new technique for accessing a shared bus in a distributed computing enviroment. The load balancing bus accessing scheme can be modeled by a new station type that can be incorporated in a bcmp multiple class queueing network model of the distributed system. We show one simple means of implementing the load balancing scheme.", } @PROCEEDINGS{Agra83:Performance, TITLE="Performance", EDITOR="A. K. Agrawala and Satish K. Tripathi", ISBN="0-444-06673-6", PUBLISHER="North Holland", ADDRESS="College Park, Maryland", PAGES=487, YEAR=1983, KEYWORDS="Performance evaluation; queueing system; simulation", } @ARTICLE{Alba83:Star, AUTHOR="A. Albanese", TITLE="Star network with collision-avoidance circuits", JOURNAL=bstj, VOLUME=62, PAGES="631-638", YEAR=1983, REFERENCES=3, KEYWORDS="Packet switching; CSMA; carrier sense multiple access; star network", ABSTRACT="A multiple-access star network uses a new collision-advoidance circuit to avoid collision of packets. The resulting network has a channel capacity equal to 1, has good stability under heavy traffic conditions, allows transmission of packets shorter than the network round trip time, and provides distributed switching. Collision-advoidance circuits have been built and operated up to 50 mb/s.", } @ARTICLE{Arnd83:Dienste, AUTHOR="G. Arndt and H.-J. Rothamel", TITLE="Dienste im {ISDN}", JOURNAL=siemenstr, VOLUME=6, NUMBER=3, PAGES="169-173", YEAR=1983, LANGUAGE="German", REFERENCES=4, KEYWORDS="ISDN", } @ARTICLE{Arth83:Upper, AUTHOR="E. Arthurs and B. W. Stuck", TITLE="Upper and lower bounds on mean throughput rate and mean delay in memory constrained queueing networks", JOURNAL=bstj, VOLUME=62, PAGES="541-581", YEAR=1983, KEYWORDS="Queueing system; theory; MVA; Closed queueing network; product form; upper bound; lower bound; network throughput; network delay", ABSTRACT="Operators use terminals to enter transactions into a system and then wait for the system to respond. The system contains serially reusable resources, and can hold a maximum number of jobs. Each job requires a total mean amount of service at each stage. We calculate upper and lower bounds on the mean throughput rate a nd mean delay as a function of model parameters. We also present partial results for closed queueing networks where the lo", } @INPROCEEDINGS{Ash83:Intercity, AUTHOR="G. R. Ash and A. H. Kafker and K. R. Krishnan", TITLE="Intercity Dynamic Routing Architecture and Feasibility", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="3.2.2 (1-7)", YEAR=1983, REFERENCES=7, KEYWORDS="Circuit switching; dynamic routing; DNHR network", ABSTRACT="A dynamic, nonhierarchical routing (DNHR) architecture is being planned for the AT\\&T intercity network. This network will evolve from its present five-level structure to a structure consisting of DNHR switching nodes at the upper level with subtending hierarchical switching nodes at the lower level. DNHR allows the choice of traffic paths to change with time of day and is not constrained by a hierarchical ranking of the switching nodes.", } @PHDTHESIS{Bare83:Multiprozessorsystem, AUTHOR="M. Barel", TITLE="Ein Multiprozessorsystem für die stochastische ereignisorientierte Simulation", SCHOOL="RWTH Aachen", ADDRESS="Aachen, Germany", PAGES=138, YEAR=1983, LANGUAGE="German", REFERENCES=54, KEYWORDS="Hardware simulator; SIMULA; DESC; discrete event simulation computer", } @ARTICLE{Baue83:Local, AUTHOR="P. Baues", TITLE="Local area networks based on fiber-optic communication technology", JOURNAL=siemensfe, VOLUME=12, NUMBER=1, PAGES="3-10", YEAR=1983, REFERENCES=34, KEYWORDS="LAN; communication protocol; ring network; star network; bus; survey; bibliography; fiber optics", ABSTRACT="Comparison of different lan-configurations, access protocols etc.", } @ARTICLE{Baxt83:Availability, AUTHOR="L. A. Baxter", TITLE="Availability measures for coherent systems of separately maintained components", JOURNAL=jap, VOLUME=20, PAGES="627-636", YEAR=1983, REFERENCES=20, KEYWORDS="Renewal process; network stability; performance measure; availability; repair", ABSTRACT="A coherent system of components, the failure pattern of each of which being assumed to be modelled by an alternating renewal process, is considered. Formulae are derived for the probability that the system is available at a series of points and for the expected numbers of failures and repairs of the system in a fixed interval. It is shown how the model can be generalised to permit each component to exhibit partial availability in the failed", } @ARTICLE{Beke83:Random, AUTHOR="G. A. Bekey and S. F. Masri", TITLE="Random search techniques for optimization of nonlinear systems with many parameters", JOURNAL="Mathematics and Computers in Simulation", VOLUME=25, PAGES="210-213", YEAR=1983, REFERENCES=4, KEYWORDS="Nonlinear optimization; approximation; method; parameter validation; random search", ABSTRACT="This paper concerns the application of adaptive random search techniques to large parameter optimization and identification problems. A brief review of the algorithm is presented, followed by a discussion of 3 examples: (1) identification of 25 unknown parameters in a nonlinear 5-degree of freedom mechanical system (2) identification of 17 parameters in a nonlinear model of soil mechanics and (3) determination of optimum values of 24 parameters", } @ARTICLE{Bemm83:Ergebnisse, AUTHOR="H.-B. Bemmann", TITLE="Ergebnisse der Untersuchungen von Zufallsgeneratoren", JOURNAL=nte, VOLUME=10, PAGES="429-431", YEAR=1983, LANGUAGE="German", REFERENCES=9, KEYWORDS="Statistics; random number generation; random variate generation", } @ARTICLE{Bene83:Growth, AUTHOR="V. E. Benes", TITLE="Growth, complexity and performance of telephone connecting networks", JOURNAL=bstj, VOLUME=62, PAGES="499-539", YEAR=1983, KEYWORDS="Switching network", } @INPROCEEDINGS{Berr83:Optimal, AUTHOR="L. T. M. Berry", TITLE="Optimal dimensioning of circuit switched digital networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="7 (2.1.6)", YEAR=1983, REFERENCES=7, KEYWORDS="Network planning", } @INPROCEEDINGS{Berr83:Models, AUTHOR="R. Berry and K. M. Chandy", TITLE="Performance models of token ring local area networks", BOOKTITLE=sigmetrics, PAGES="266-274", YEAR=1983, REFERENCES=13, KEYWORDS="LAN; performance evaluation; RING network; TOKEN RING", ABSTRACT="This paper presents a simple heuristic analytic algorithm for predicting the ``response times'' of messages in asymmetric token ring local area networks.", } @ARTICLE{Bhar83:Routing, AUTHOR="K. Barath-Kumar and Joseph Jaffe", TITLE="Routing to multiple destinations in computer networks", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="343-351", YEAR=1983, REFERENCES=15, KEYWORDS="Packet switching; routing algorithm; heuristics; cost", ABSTRACT="Algorithms for effectively routing messages from a source to multiple destination nodes in a store-and-forward network are studied. The focus is on minimizing the network cost (nc), which is the sum of weights of the links in the routing path. Several heuristic algorithms are studied for finding the nc minimum path.", } @INPROCEEDINGS{Bind83:New, AUTHOR="H. E. Binder and H. Auspurg and K. Kammerlander", TITLE="A new cellular mobile telephone network with distributed data bank in the {FRG}", BOOKTITLE="Telecom", ADDRESS="Geneva", PAGES="1.4.4.1", YEAR=1983, KEYWORDS="Mat", ABSTRACT="Netz C Systembeschreibung", } @ARTICLE{Bock83:Konzept, AUTHOR="P. Bocker", TITLE="Konzept und Grundmerkmale des diensteintegrierenden digitalen Nachrichtennetzes {ISDN}", JOURNAL=siemenstr, ADDRESS="München", VOLUME=6, NUMBER=3, PAGES="164-169", YEAR=1983, LANGUAGE="German", REFERENCES=15, KEYWORDS="ISDN", } @ARTICLE{Bran83:Communicating, AUTHOR="D. Brand and P. Zafiropulo", TITLE="On communicating finite state machines", JOURNAL=jacm, VOLUME=30, PAGES="323-342", YEAR=1983, KEYWORDS="Protocol engineering", } @ARTICLE{Bran83:Study, AUTHOR="A. Brandwajn", TITLE="A study of dynamic reconnection", JOURNAL=per, PAGES="1-11", YEAR=1983, REFERENCES=9, KEYWORDS="Model; prediction; disk; I/O channel; loss system; reconnection; DASD; direct access storage device", ABSTRACT="The recently introduced extended architecture (XA) of large IBM computer systems includes, in the disk I/O area, the ability for an access to be resumed and completed on a path different from the one on which it has been initiated. The expected disk performance improvement due to this feature - known as dynamic path reconnection - is investigated in this note. Two popular double pathing connection schemes are considered:", } @ARTICLE{Broo83:Classification, AUTHOR="G. Broomell and R. Heath", TITLE="Classification categories and historical development of circuit switching topologies", JOURNAL=acmcs, VOLUME=15, PAGES="95-134", YEAR=1983, KEYWORDS="Switching; circuit switching; survey", } @ARTICLE{Burm83:Asymptotic, AUTHOR="D. Y. Burman and David Burton Smith", TITLE="Asymptotic analysis of a queueing model with bursty traffic", JOURNAL=bstj, VOLUME=62, NUMBER=6, PAGES="1433-1453", YEAR=1983, REFERENCES=18, KEYWORDS="M/M/N/S; bursty traffic; asymptotic analysis", ABSTRACT="Assuming a particular model for ``bursty'' traffic at a packet-switching node, we find expressions for the expected delay of packets that are valid in light and heavy traffic. Each expression consists of a ``correction factor'' multiplied by the expected delay experienced by packets when the arrivals are ``smooth'' (Poisson) and of the same average rate.", } @ARTICLE{Bux83:Approximate, AUTHOR="W. Bux and M. Schlatter", TITLE="An approximate method for the performance analysis of buffer insertion rings", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="50-55", YEAR=1983, REFERENCES=10, KEYWORDS="LAN; ring network; time in system; network throughput; buffer memory", ABSTRACT="A new analytic approach for the performance evaluation of buffer insertion rings is proposed which overcomes the basic limitations of former analyses. Key to our analysis is that the global performance model of a buffer insertion ring is decomposed into submodels in such a way that the basic interdependence of interarrival and transmission times of the frames transmitted is taken into account. The analysis itself is relatively straightforward", } @INPROCEEDINGS{Bux83:Token, AUTHOR="W. Bux and H. L. Truong", TITLE="Token-ring performance: mean delay approximation", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", VOLUME=10, PAGES="7 (3.1.3)", YEAR=1983, REFERENCES=28, KEYWORDS="LAN; token ring; mean delay; performance evaluation", } @ARTICLE{Chan83:Characterization, AUTHOR="K. M. Chandy and A. J. Martin", TITLE="A characterization of product-form queuing networks", JOURNAL=jacm, VOLUME=30, PAGES="286-299", YEAR=1983, REFERENCES=8, KEYWORDS="Product form; network; stochastic analysis", ABSTRACT="Simple criteria are given for determining whether a queuing network model has a product-from solution and its thus computationally tractable. Performance - queuing theory, stochastic analysis. Networks, product from.", } @ARTICLE{Chan83:Multibeam, AUTHOR="John H. Chang", TITLE="A multibeam packet satellite using random access techniques", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="1143-1154", YEAR=1983, REFERENCES=18, KEYWORDS="Packet switching; satellite radio; ALOHA; TDMA; time division multiple access", ABSTRACT="The performance of a multibeam packet satellite using ALOHA type random access techniques is studied. A TDMA frame is organized in accordance with the traffic demand from each area. System throughput and packet delay have been successfully obtained.", } @MISC{Chom83:Systeme, AUTHOR="D. Chomel and M. Devault and H. Le Bris and Y. Rouaud", TITLE="Systeme de multiplexage numerique temporel asychrone a bus distribue", PUBLISHER="Europäisches Patentamt", ADDRESS="München", PAGES="7+5", YEAR=1983, LANGUAGE="French", KEYWORDS="ATM; Prelude", } @BOOK{Chou83:Computer, TITLE="Computer communications -- Principles", EDITOR="Wushow Chou", PUBLISHER="Prentice-Hall", ADDRESS="Englewood Cliffs, New Jersey", VOLUME=1, PAGES="1-449", YEAR=1983, KEYWORDS="communication network; reference; data transmission", ABSTRACT="Data encryption analytic methods performance", } @ARTICLE{Chou83:Diversity, AUTHOR="G. L. Choudhury and S. S. Rappaport", TITLE="Diversity {ALOHA} - a random access scheme for satellite communications", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="450-457", YEAR=1983, REFERENCES=12, KEYWORDS="packet switching; random multiple access; ALOHA; FDMA; frequency division multiple access; TDMA; time division multiple access", ABSTRACT="A generalization of the slotted aloha random access scheme is considered in which a user transmits multiple copies of the same packet. The multiple copies can be either transmitted simultaneously on different frequency channels (frequency diversity) or they may be transmitted on a single high-speed channel but spaced apart by random time intervals (time diversity).", } @ARTICLE{Chow83:Approximations, AUTHOR="W.-M. Chow", TITLE="Approximations for large scale closed queueing networks", JOURNAL=pe, VOLUME=3, PAGES="1-12", YEAR=1983, REFERENCES=13, KEYWORDS="Queueing approximation; closed queueing network; MVA", ABSTRACT="Evaluation of closed queueing networks with product from solutions is very time-consuming if the population sizes or the network size is large. This paper provides an analysis of an approximation technique, based upon mean value analysis which requires considerably less computation time, and yet achieves a high degree of accuracy. The approximates are unique in some feasible regions. Error analysis and illustrative examples are provided.", } @ARTICLE{Chow83:Approximation, AUTHOR="W.-M. Chow and P. S. Yu", TITLE="An approximation technique for central server queueing models with a priority dispatching rule", JOURNAL=pe, VOLUME=3, PAGES="55-62", YEAR=1983, REFERENCES=8, KEYWORDS="Method; queueing approximation; MVA; queueing network; decomposition; priority; central server; model", ABSTRACT="An approximation technique to solve central server queueing models with a priority dispatching rule is described in this paper. This technique reduces the problem size by aggregating i/o activities and combining different classes into a smaller number of classes, so that the reduced problem can be solved numerically in a rather short time. In 14 different cases of numerical examples considered, throughputs and mean cpu queue sizes calculated by", } @ARTICLE{Chu83:Reservation, AUTHOR="Wesley W. Chu and W. Haller and K. K. Leung", TITLE="Reservation channel access protocol for high speed local networks with star configurations", JOURNAL=ieeetc, VOLUME="C-32", PAGES="763-766", YEAR=1983, REFERENCES=9, KEYWORDS="LAN; demand assignment; star network; broadband; contention; reservation", ABSTRACT="In a wideband communication channel (> 100 Mhz) local network, the propagation delay becomes comparable to the packet transmission time. As a results, CSMA-type protocols may not provide efficient channel utilization. A new channel access protocol, contention based channel reservation (CBCR) that is based on channel reservation is proposed in this paper. Our investifation reveals that the new channel access protocol yields better performance th", } @ARTICLE{Coud83:Reseaux, AUTHOR="J.-P. Coudreuse", TITLE="Les reseaux temporels asynchrones: du transfert de donnees a l'image animee", JOURNAL="L'echo des Recherches", NUMBER=112, PAGES="33-48", YEAR=1983, LANGUAGE="French", KEYWORDS="ATM; PRELUDE; switching block; fast packet switching", } @MISC{Coud83:PRELUDE, AUTHOR="J.-P. Coudreuse and M. Devault", TITLE="{PRELUDE} - Un Reseau Temporel Asynchrone Experimental de Videocommunications", ADDRESS="Lannion", YEAR=1983, LANGUAGE="French", REFERENCES=2, KEYWORDS="ATM; Prelude", } @ARTICLE{Coyl83:Finite, AUTHOR="E. Coyle and B. L. Fellow", TITLE="Finite population {CSMA/CD} networks", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="1247-1251", YEAR=1983, REFERENCES=7, KEYWORDS="Packet switching; CSMA; carrier sense multiple access; LAN; Markov process; collision detection; finite population", ABSTRACT="A continuous time Markov chain model of a non-persistent carrie r sense multiple access with collision detection (csma/cd) protocol is developed to determine the performance of finite population systems. The model allows a wide range of distributions for the length of packets and the lengths of the transmission detection and collision detection times. A stability measure for finitepopulation asynchronous systems - the instantaneous expected dri", } @ARTICLE{Diac83:Statistik, AUTHOR="P. Diaconis and B. Efron", TITLE="Statistik per Computer: Der Münchhausentrick", JOURNAL="Spektrum der Wissenschaft", PAGES="56-71", YEAR=1983, LANGUAGE="German", REFERENCES=4, KEYWORDS="Method; survey; sampling; estimation; resampling technique", ABSTRACT="Wie sich Münchhausen am eigenen Haar aus dem Sumpf zog, können sich Statistiker aus einer hoffnungslos scheinenden Daten-Situation befreien: mittels Computer lassen sich beliebig grosse Stichproben simulieren. So ist die Genauigkeit statistischer Angaben auf der Basis einer einzigen, begrenzten Stichprobe ziemlich verlässlich zu prüfen.", } @ARTICLE{Dosh83:Queue, AUTHOR="B. T. Doshi", TITLE="An {M/G/1} queue with a hybrid discipline", JOURNAL=bstj, VOLUME=62, PAGES="1251-1271", YEAR=1983, KEYWORDS="Queueing system; queueing discipline; M/G/1; LIFO; waiting time; renewal process; hybrid queueing discipline", ABSTRACT="In this paper we analyze the delay in a single-server queue in which the server, when it becomes free, selects for the next service the oldest customer with current delay smaller than t. If no such customer is present, then it selects the youngest customer with the current delay in excess of t. We obtain the delay distributions for this service discipline.", } @PHDTHESIS{Ebbe83:Approximative, AUTHOR="H.-A. Ebbecke", TITLE="Approximative und meßtechnisch gestützte Modellierung von Nebenstellen-Verbundsystemen", SCHOOL="Universität Braunschweig, Fakultät für Maschinenbau und Elektrotechnik", ADDRESS="Braunschweig, Germany", PAGES=165, YEAR=1983, LANGUAGE="German", REFERENCES=103, KEYWORDS="Model; PABX; traffic model", } @BOOK{Enca83:Computer, AUTHOR="J. Encarnaca and E. G. Schlechtendahl", TITLE="Computer aided design", PUBLISHER="Springer-Verlag, Berlin", PAGES="1-346", YEAR=1983, KEYWORDS="Graphics; computation structure; graphics language; man-machine interaction; human factors; model; survey; future outlook; application", ABSTRACT="This book describes the principles, methods and tools that are common to computer application for design tasks, independent of a particular product.", } @ARTICLE{Ende83:Funktionen, AUTHOR="G. Enderle and K. Kansy and G. Pfaff and F.-J. Prester", TITLE="Die Funktionen des Graphischen Kernsystems", JOURNAL=infspec, PAGES="55-75", YEAR=1983, LANGUAGE="German", REFERENCES=2, KEYWORDS="Design; interface; standard; graphics; GKS", ABSTRACT="Das graphische Kernsystem GKS; Funktionen des GKS.", } @ARTICLE{Fern83:Interconnection, AUTHOR="J. I. Fernandez and J. A. Gibbons", TITLE="Interconnection of a Private Packet-Switching Network and a Computer Vendor's Network", JOURNAL=cn, VOLUME=7, PAGES="99-111", YEAR=1983, REFERENCES=16, KEYWORDS="Computer Network; packet switching; protocol; internetworking; gateway; terminal; file transfer", } @BOOK{Ferr83:Measurement, AUTHOR="D. Ferrari and G. Serazzi and A. Zeigner", TITLE="Measurement and tuning of computer systems", ISBN="0-13-568519-2", PUBLISHER="Prentice-Hall", ADDRESS="Englewood Cliffs", PAGES=523, YEAR=1983, KEYWORDS="Modeling; Simulation; performance evaluation; workload; tuning", } @ARTICLE{Fish83:Antithetic, AUTHOR="G. S. Fishman and B. D. Huang", TITLE="Antithetic variates revisited", JOURNAL=cacm, VOLUME=26, PAGES="964-971", YEAR=1983, REFERENCES=1, KEYWORDS="Antithetic simulation; variance reduction; simulation", ABSTRACT="Rn some simulation problems, for example estimating integrals by monte carlo methods, it is important to reduce the variance of the estimates. A method for reducing the variances was developed by Hammersley and Morton in the fifties; this method is called the antithetic sampling technique. This technique is viewed in a new light In this article as a combination of rotation and reflection sampling on a circle. Some practical implications", } @ARTICLE{Fush83:K, AUTHOR="M. Fushimi and S. Tezuka", TITLE="The k-distribution of generalized feedback shift register pseudorandom numbers", JOURNAL=cacm, VOLUME=26, PAGES="516-523", YEAR=1983, KEYWORDS="Shift register sequences; random number generation", } @INPROCEEDINGS{Gabr83:System, AUTHOR="Gabrielli and Lotitio and Sposini", TITLE="Performance analysis and system design of a variable bit rate hybrid switch", BOOKTITLE="Telecom", ADDRESS="Geneva", PAGES="paper 2.8.5", YEAR=1983, KEYWORDS="packet switching; ATM", } @ARTICLE{Gall83:Model, AUTHOR="B. Galler and L. Bos", TITLE="A model of transaction blocking in databases", JOURNAL=pe, VOLUME=3, PAGES="95-122", YEAR=1983, REFERENCES=32, KEYWORDS="Analytical model; closed queueing network; iterative method; blocking; resource management; information system; performance evaluation; transaction blocking", ABSTRACT="A simple queueing model of software resource sharing in a multiprogramming environment is presented. Implicit algebraic equations for steady state mean waiting times at the various queues are developed. These equations may be solved by simple fixed point iteration. It is shown that a solution always exists and that under non-restrictive conditions the simple iteration does converge. An easily applied test for uniqueness of solution is given. Ta", } @ARTICLE{Gavi83:Algorithm, AUTHOR="Bezalel X Gavish and S. L. Hantler", TITLE="An algorithm for optimal route selection in {SNA} networks", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="1154-1161", YEAR=1983, REFERENCES=37, KEYWORDS="SNA; routing; algorithm; exponential queueing network; M/M/1", ABSTRACT="The problem of selecting a single route for each class of service and each pair of communicating nodes in an SNA network is considered. The nodes, links, sets of candidate routes, and traffic characteristics are given. The goal is to select a set of routes which minimizes the expected network end-to-end queueing and transmission delay. Queueing is modeled as a network of M/M/1 queues which leads to a nonlinear combinatorial optimization problem", } @TECHREPORT{Gerl83:Graphische, AUTHOR="H. Gerlach", TITLE="Graphische Software im {CMS} {GR-Software}", TYPE="Internal Report", INSTITUTION="KfA Jülich Zentralinstitut für angewandte Mathematik", ADDRESS="Jülich", PAGES="1-37", YEAR=1983, LANGUAGE="German", KEYWORDS="Graphics; diagram manipulation; three-dimensional plot; two-dimensional plot; fortran", ABSTRACT="Jobs, die interaktiv unter CMS laufen und die FORTRAN-Plotsoftware (GR-Plotprogramme) aufrufen, können die plots direkt auf einem graphischen Terminal visualisieren.", } @ARTICLE{Gerr83:Regularity, AUTHOR="R. Gerrard", TITLE="Regularity conditions for semi-Markov and Markov chains in continuous time", JOURNAL=jap, VOLUME=20, PAGES="505-512", YEAR=1983, REFERENCES=5, KEYWORDS="Semi Markov process; Markov process; continuous time process; time in system; state space transformation", ABSTRACT="The classical condition for regularity of a Markov chain is extended to include semi-Markov chains. In addition, for any given semi-Markov chain, we find Markov chains which exhibit identical regularity properties this is done either (i) by transforming the state space or, alternatively, (ii) by imposing conditions on the holding-time distributions. Brief consideration is given to the problem of extending the results to processes other than", } @ARTICLE{Goel83:Metrics, AUTHOR="A. L. Goel and P. D. Amer", TITLE="Performance Metrics for Bus and Token-Ring Local Area Networks", JOURNAL=jtn, VOLUME=2, NUMBER=2, PAGES="187-209", YEAR=1983, REFERENCES=22, KEYWORDS="LAN; token ring; protocol engineering; finite state model; performance metrics; bus; network", } @INPROCEEDINGS{Gone83:Techniques, AUTHOR="P. Gonet and J.-P. Coudreuse", TITLE="Techniques Temporelles Asynchrones et Resaux Integres de Videocommunications", BOOKTITLE="2nd Congres International sur les Systemes et Services nouveaux de Telecommunications", ADDRESS="Liege", PAGES="G.6.1-7", YEAR=1983, LANGUAGE="French", REFERENCES=3, KEYWORDS="ATM; prelude", } @PHDTHESIS{Gorg83:Warteraum, AUTHOR="C. Görg", TITLE="Warteraum {M/G/1:} Die {SRPT-Optimalstrategie} im Vergleich mit der Zeitscheibenstrategie unter Berücksichtigung von Verwaltungszeiten", SCHOOL="RWTH Aachen", ADDRESS="Aachen, Germany", PAGES=132, YEAR=1983, LANGUAGE="German", REFERENCES=39, KEYWORDS="Queueing system; priority; M/G/1; SRPT; shortest remaining processing time", } @PROCEEDINGS{Gran83:Satellite, TITLE="Satellite and computer communications", EDITOR="J.-L. Grange", PUBLISHER="Proc. IFIP TC6/AFCET/SEE", ADDRESS="Versailles", PAGES="1-379", YEAR=1983, KEYWORDS="Satellite radio; LAN; bulk service", ABSTRACT="1. Satellite and local area networks 1. 2. Bulk transfer. 3. Transaction systems. 4. Satellite channel sharing. 5. On board computers. 6. Link performance improvement. 7. System management and design. 8. Protocols and architecture. 9. Satellites and local area networks 2.", } @ARTICLE{Grev83:Graph, AUTHOR="M. Grevel and A. Sachs", TITLE="A Graph Theoretical Analysis of Dynamic Channel Assignment Algorithms for Mobile Radiocommunications Systems", JOURNAL=siemensfe, VOLUME=12, PAGES="298-305", YEAR=1983, KEYWORDS="MAT; Graph Theory; DCA; dynamic channel assignment", ABSTRACT="DCA with reassignment", } @ARTICLE{Haje83:Proof, AUTHOR="B. Hajek", TITLE="The proof of a folk theorem on queuing delay with applications to routing in networks", JOURNAL=jacm, VOLUME=30, NUMBER=4, PAGES="834-851", YEAR=1983, REFERENCES=20, KEYWORDS="G/M/1; D/M/1; lower bound; time in system; expectation; queueing network; routing algorithm; packet switching; round robin", ABSTRACT="It is show that among all arrival processes (not necessarily stationary or renewal type) for an exponential server queue with specified arrival and service rates, that the arrival process which minimizes the average delay and related quantities is the process with constant interarrival times. The proof is based on a convexity property of exponential server queues which is of independent interest. The folk theorem provides a lower bound, which i", } @INPROCEEDINGS{Harr83:Comparison, AUTHOR="R. J. Harris", TITLE="Comparison of network dimensioning models", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", VOLUME=10, PAGES="10 (4.3b.3)", YEAR=1983, REFERENCES=15, KEYWORDS="Network Planning", } @ARTICLE{Henr83:Integrated, AUTHOR="J. O. Henriksen", TITLE="The integrated simulation environment (simulation software of the 1990s)", JOURNAL=or, VOLUME=31, PAGES="1053-1073", YEAR=1983, REFERENCES=40, KEYWORDS="Simulation", } @INPROCEEDINGS{Hoan83:Modelling, AUTHOR="D. B. Hoang", TITLE="Network Modelling and Optimal Flow Assignment in Computer Networks", BOOKTITLE="19th IREECON International IREE", PAGES="27-29", YEAR=1983, REFERENCES=6, KEYWORDS="Packet switching; routing algorithm; network flow; network delay; optimization", ABSTRACT="The paper discusses some queueing systems for modelling packet switched computer communication networks. In particular, it is shown that for the two proposed queueing systems the optimal flow assignment, which minimizes the average packet delay through the network, can be optained.", } @ARTICLE{Hoev83:Fehlerkorrektur, AUTHOR="Hoeve and Timmermans and Vries", TITLE="Fehlerkorrektur im Compact Disc Digital Audio System", JOURNAL=ntz, VOLUME=36, PAGES="446-448", YEAR=1983, LANGUAGE="German", KEYWORDS="Coding theory; Reed-Solomon code; application", } @ARTICLE{Hofl83:Bedingte, AUTHOR="U. Höfle", TITLE="Die bedingte Lebenserwartung. Ein Beitrag zur Zuverlässigkeits- theorie technischer Systeme mit nichtkonstanten Ausfallraten", JOURNAL=ntzarchiv, VOLUME=5, NUMBER=4, PAGES="119-126", YEAR=1983, LANGUAGE="German", REFERENCES=4, KEYWORDS="Mean lifetime; failure; reliability", } @ARTICLE{Hora83:Estimation, AUTHOR="S. C. Hora", TITLE="Estimation of the inverse function for random variate generation", JOURNAL=cacm, VOLUME=26, PAGES="590-594", YEAR=1983, KEYWORDS="random number generation; random variate generation; Transform; approximation; method; inversion", ABSTRACT="A regression method for estimating the inverse of a continuous cumulative probability function F(X) is presented. It is assumed that an ordered sample, $x1,\ldots,xn$, of identically and independently distributed random variables is available. A reference distribution $f0(x)$ with known inverse $f0-1(p)$ is used to calculate the quantities $wi=i(f0(xi)/f0(xi+1))$. These quantities are used to estimate the function $\gamma(p)$ from", } @BOOK{Horo83:Programming, TITLE="Programming languages: a grand tour", EDITOR="E. Horowitz", PUBLISHER="Springer-Verlag", ADDRESS="Berlin", PAGES="1-664", YEAR=1983, KEYWORDS="survey; bibliography; programming language; design; algol; PASCAL; FORTRAN; ADA; LISP; C programming language", ABSTRACT="A collection of papers edited by ellis horowitz", } @ARTICLE{Hoßf83:Parallele, AUTHOR="F. Hoßfeld and P. Weidner", TITLE="Parallele Algorithmen", JOURNAL=infspec, VOLUME=6, NUMBER=3, PAGES="142-154", YEAR=1983, LANGUAGE="German", REFERENCES=16, KEYWORDS="Parallel computing; survey; process management; MIMD; SIMD; interconnection network", ABSTRACT="Although, contrary to sequential algorithms, the body of theoretical knowledge and practical design of parallel algorithms is still incomplete, the plethora of mostly recently achieved results demonstrates the growing impact of this research area on computer science and applications. Therefore, beside essential design elements and examples of parallel algorithms, also the qualitatively new problems of data communication in parallel processors", } @BOOK{Hou83:Digital, AUTHOR="H. S. Hou", TITLE="Digital document processing", PUBLISHER="John Wiley and Sons", ADDRESS="New York", PAGES="1-329", YEAR=1983, KEYWORDS="Text processing; graphics", ABSTRACT="Here we have an introductory text in the new field of digital document processing, dealing with techniques for generating, transmitting, storing, accessing, and presenting the symbols that represent information. Included in this field are facsimile, character recognition, word processing, computer graphics, image processing, electronic mail, digital typography, and electronic printing.", } @MISC{Huls83:REDUCE, AUTHOR="B. Hulshof and A. van-Hulzen and others", TITLE="{REDUCE}", PUBLISHER="ACM SIGSAM", VOLUME=17, NUMBER=1, PAGES="16-44", YEAR=1983, KEYWORDS="REDUCE; MACSYMA; LISP; operating system; symbolic algebraic computation", ABSTRACT="Titles of articles: - Some REDUCE facilities for pretty printing subscripts and formal derivatives. - About the realization of an extended, but really interactive REDUCE by integration of a small editing and executing system. - REDUCE 2 for CP/M. - A comparsion of the MACSYMA and REDUCE. - Data structures and executiontimes of algebraic mode programs for REDUCE. - A REDUCE package for series analysis by Hadamard's theorem and QD schemes.", } @ARTICLE{Hwan83:Control, AUTHOR="F. K. Hwang", TITLE="Control algorithms for rearrangeable {CLOS} networks", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="952-954", YEAR=1983, REFERENCES=23, KEYWORDS="Switching network; CLOS", } @ARTICLE{Igle83:Simulation, AUTHOR="D. L. Iglehart and G. S. Shedler", TITLE="Simulation of non-Markovian system", JOURNAL=ibmjrd, VOLUME=27, PAGES="472-480", YEAR=1983, REFERENCES=3, KEYWORDS="Regenerative simulation; independent cycles; non-Markov process; output analysis; ring network; multipoint connection", ABSTRACT="This paper provides an interesting discussion of the difficulties in simulating non-Markovian system utilizing the regenerative process approach.", } @ARTICLE{Jali83:Transporting, AUTHOR="P. J. Jalics and T. S. Heines", TITLE="Transporting a portable operating system: {UNIX} to an {IBM} minicomputer", JOURNAL=cacm, VOLUME=12, PAGES="1066-1072", YEAR=1983, REFERENCES=8, KEYWORDS="Operating system; realization; Unix", ABSTRACT="An operating system is a complex set of computer programms that manages the execution of application programms. Every computer typically has its own operating system written in a machine-dependent language. Thus, every time a new machine is developed a new operating system and new compilers must also be developed. In addition, existing application programs need modification because the new operating system requires facilities that are different", } @PHDTHESIS{Jans83:Verkehrsanalyse, AUTHOR="H. Jans", TITLE="Verkehrsanalyse von Vermittlungssteuerungen mit taktgesteuerter Ein-/Ausgabe und Prioritäten", SCHOOL="Universität-GH Siegen", ADDRESS="Siegen, Germany", PAGES=184, YEAR=1983, LANGUAGE="German", REFERENCES=49, KEYWORDS="Queueing system; switching system; priority", } @ARTICLE{Jenq83:Packet, AUTHOR="Y.-C. Jenq", TITLE="Performance Analysis of a Packet Switch Based on single-buffered Banyan Network", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1014-1021", YEAR=1983, REFERENCES=5, KEYWORDS="Interconnection Network; analysis; ATM", } @ARTICLE{Joel83:Public, AUTHOR="A. E. Joel", TITLE="Public digital switching systems", JOURNAL=ieeecm, VOLUME=21, NUMBER=3, PAGES="6-10", YEAR=1983, REFERENCES=15, KEYWORDS="digital network; survey; public network; ISDN", ABSTRACT="This paper describes the evolution toward totally digital networks.", } @ARTICLE{Joon83:Impact, AUTHOR="S. Joongs", TITLE="On the impact of {HDLC} zero insertion and deletion on link utilization and reliability", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="375-381", YEAR=1983, REFERENCES=4, KEYWORDS="HDLC; reliability; utilization", } @ARTICLE{Kapl83:Single, AUTHOR="Michael Kaplan", TITLE="A Single-Server Queue with Cyclostationary Arrivals and Arithmetic Service", JOURNAL=or, PAGES="184-205", YEAR=1983, REFERENCES=29, KEYWORDS="Load Sharing; Analysis; Queueing system", } @ARTICLE{Kauf83:Lokale, AUTHOR="F.-J. Kauffels", TITLE="Lokale Netze --- Status quo und Progress", JOURNAL=aninf, PAGES="465-475", YEAR=1983, LANGUAGE="German", REFERENCES=28, KEYWORDS="Survey; LAN; broadcast; communication; standard; fiber optics", ABSTRACT="This paper is related to the objectives of LAN with regard to several application areas. First, we give a short tutorial on basic concepts. In doing so, some shortcomings can be observed and so the following section treats some advanced concepts to overcome these difficulties. Namely, we present optical fiber transmission systems, broadcast cable systems, and systems with higher reliability.", } @ARTICLE{Kawa83:Efficient, AUTHOR="K. Kawashima", TITLE="Efficient numerical solutions for a unified trunk reservation system with two classes", JOURNAL=recl, VOLUME=31, PAGES="419-429", YEAR=1983, KEYWORDS="Queueing system; priority; M/M/N/S; HOL priority; nonpreemptive priority", ABSTRACT="State prob., no distribution function", } @BOOK{Koba83:Geometric, AUTHOR="H. Kobayashi", TITLE="Geometric Bounds on the Waiting Time Distribution of the Discrete-Time {GI/G/1-System}", ISBN="0-12-455820-8", PUBLISHER="in: Probability Theory and Computer Science, Part II edited by G. Louchard and G. Latouche, Academic Press", ADDRESS="London", PAGES="53-124", YEAR=1983, REFERENCES=56, KEYWORDS="Discrete time analysis; queueing system; GI/G/1; Diffusion approximation; Computational algorithm; Markovian queueing system", ABSTRACT="Contents: 4. Discrete-time queueing systems 5. Diffusion approximations in queueing analysis 6. Computational Algorithms for Markovian queueing networks", } @ARTICLE{Koba83:Optimal, AUTHOR="H. Kobayashi and M. Gerla", TITLE="Optimal routing in closed queueing networks", JOURNAL=tocs, VOLUME=1, PAGES="294-310", YEAR=1983, KEYWORDS="Closed queueing network; routing algorithm", ABSTRACT="This paper addresses the problem of obtaining the set of routing probabilities that will minimize response time, or alternatively maximize the throughput. An algorithm, called the flow deviation (FD) algorithm, is already known for obtaining the optimal routing probabilities for open queueing network models.", } @ARTICLE{Kona83:Introduction, AUTHOR="V. Konangi and C. R. Dhas", TITLE="An introduction to network architectures", JOURNAL=ieeecm, PAGES="44-50", YEAR=1983, REFERENCES=17, KEYWORDS="ARPAnet; network protocol; network architecture; network layer; standardization; SNA", ABSTRACT="An overview of different network architectures (layering) and protocls is presented: sna, arpanet, dna, osi.", } @ARTICLE{Koni83:Identification, AUTHOR="D. König and M. Miyazawa and V. Schmidt", TITLE="On the identification of Poisson arrivals in queues with coinciding time-stationary and customer-stationary state distributions", JOURNAL=jap, VOLUME=20, NUMBER=4, PAGES="860-871", YEAR=1983, REFERENCES=11, KEYWORDS="GI/GI/N; queue length; arrival process; Poisson distribution; stationary process", ABSTRACT="For serval queueing systems, sufficient conditions are given ensuring that from the coincidence of some time stationary and customer-stationary characteristics of the number of customers in the system such as idle or loss probabilities it follows that the arrival process is Poisson.", } @TECHREPORT{Kopp83:Modell, AUTHOR="P. Kopp", TITLE="Ein Modell für das Routing-Problem der mittelfristigen Planung ingemischt analog-digitalen Fernleitungsnetzen unter Berücksichtigung der Mehrwegeführung", INSTITUTION="FTZ, Deutsche Bundespost", ADDRESS="Darmstadt", PAGES="1-80", YEAR=1983, LANGUAGE="German", REFERENCES=35, KEYWORDS="Routing algorithm", ABSTRACT="Für ein gemischt analog-digitales Übertragungsnetz wird ein mathematisches Modell entworfen, das eine Reihe von technischen Nebenbedingungen und betrieblichen Planungsgrundsätzen berücksichtigt und das insbesondere Mehrwegeführung vorsieht. Das Routing-Problem wird hierbei formuliert als ein multi-commodity Fluß-Minimierungsproblem in einem speziell konstruierten Doppelschichtgraphen. Jeder Kante der analogen und digitalen Schicht dieses Graphen wird", } @ARTICLE{Kowa83:Erweiterte, AUTHOR="W. Kowalk", TITLE="Erweiterte Methoden der operationalen Analyse", JOURNAL=aninf, VOLUME=1, PAGES="18-24", YEAR=1983, LANGUAGE="German", REFERENCES=19, KEYWORDS="Operational analysis; variance; error measure", ABSTRACT="In this paper we extend operational analysis in two ways: we will express relationships between higher moments of quantities of queueing systems, to derive variances, coefficients of variation, etc. And we introduce an approach of error calculation from which we can derive the maximum possible error of some results.", } @INPROCEEDINGS{Kuhn83:Busy, AUTHOR="P. J. Kühn", TITLE="Analysis of busy periods and response times in queueing networks by the method of first passage times", BOOKTITLE="Perfomance", PUBLISHER="North Holland", YEAR=1983, KEYWORDS="Queueing network", } @ARTICLE{Lam83:Tree, AUTHOR="S. S. Lam and Y.-C. L. Lien", TITLE="A tree convolution algorithm for the solution of queueing networks.", JOURNAL=cacm, VOLUME=26, PAGES="203-215", YEAR=1983, KEYWORDS="Queueing network; bibliography; tree convolution algorithm; normalization constant", } @INPROCEEDINGS{Lang83:Autotel, AUTHOR="U. Langewellpott", TITLE="Autotel: a novel wideband mobile telephone", BOOKTITLE="IEE conference on radio spectrum conservation techniques", ADDRESS="Birmingham", YEAR=1983, KEYWORDS="MAT; mobile radio; spread spectrum", } @ARTICLE{Laza83:Optimal, AUTHOR="Aurel A. Lazar", TITLE="Optimal Flow Control of a Class of Queueing Networks in Equilibri um", JOURNAL=ieeeac, VOLUME="AC-28", PAGES="1001-1007", YEAR=1983, KEYWORDS="Queueing network; packet switching; flow control; congestion control; buffer management; resource sharing; computational algorithm", ABSTRACT="The problem of optimum flow control of a class of queueing systems which appears as a model of datagram and virtual circuit computer communication networks is investigated. This class ``intuitively'' has the property that by increasing the load on the network, both the average throughput and the average time delay also increase. It is shown that the control that achieves the maximum throughput under a bounded average time delay criterion can.", } @ARTICLE{Lee83:Combined, AUTHOR="Hwang-Soo Lee and J. W. Mark", TITLE="Combined random/reservation access for packet switched transmission over a satellite with on-board processing: part I - global beam satellite", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="1161-1171", YEAR=1983, REFERENCES=17, KEYWORDS="Packet switching; satellite radio; random multiple access; reservation access", ABSTRACT="A combined random/reservation multiple access (crrma) scheme for packet-switched communication over a global beam satellite with on-board processing is proposed and analyzed. Channel time is divided into contiguous slots; each slot contains $n$ minislots for transmission of request and n' minislots for data. Two channel access algorithms for the crrma model are proposed: uncontrolled channel access (uca) and controlled channel access (CCA).", } @INPROCEEDINGS{Lind83:Queueing, AUTHOR="G. Lind", TITLE="Queueing models with Markov-dependent arrival intervals or service times", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="4.4a 1-8", YEAR=1983, REFERENCES=11, KEYWORDS="Queueing system; autocorrelation", } @MASTERSTHESIS{Litz83:Anpassung, AUTHOR="D. Litzba", TITLE="Anpassung von realen Prozessorzeiten durch Weibull-Verteilungen und anschliessende Approximation mit Cox-Verteilungen", SCHOOL="Universität Dortmund, Abteilung Informatik", ADDRESS="Dortmund, Germany", PAGES="1-119", YEAR=1983, LANGUAGE="German", KEYWORDS="phase concept; approximation; method; measurement; Weibull distribution", ABSTRACT="In der Arbeit werden verschiedene Schätzverfahren für Weibull-Verteilungen vorgestellt und ihre Anwendbarkeit sowie Effizienz untersucht. Ausserdem werden Schätzverfahren für ``gemischte'' Weibull-Verteilungen entwickelt, mit denen unter gewissen Randbedingungen eine Schätzung der unbekannten Parameter möglich ist. Anschliessend wird untersucht, welche Verteilungen CPU-zeiten am Informatik-rechner haben und inwieweit Anpassungen", } @ARTICLE{Loke83:Communications, AUTHOR="D. T. Lokerson", TITLE="A communications system which prioritizes the queues, service channels, and traffic", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="113-118", YEAR=1983, REFERENCES=4, KEYWORDS="M/M/N/S; HOL priority; communication protocol", ABSTRACT="A new priority communications protocol has been defined and analyzed. This M/M/C/K system is unique because priorities are assigned not only to the incoming traffic, but also to the queues and the service channels (which may process calls only of an equal or higher priority).", } @BOOK{Louc83:Probability, AUTHOR="G. Louchard and G. Latouche and others", TITLE="Probability theory and computer science", PUBLISHER="ACADEMIC PRESS", ADDRESS="New York", PAGES="1-209", YEAR=1983, KEYWORDS="Stochastic analysis; queueing system; combinatorial method", ABSTRACT="Three topics were covered during the courses and seminars: stochastic modeling, queueing system models, and the mathematical analysis of combinatorial algorithms.", } @ARTICLE{Lutt83:Blocking, AUTHOR="J.-L. Lutton and E. Bonomi and M. R. Feix", TITLE="Blocking probability for a multistage Clos connecting network", JOURNAL="Journal of Statistical Physics", VOLUME=31, NUMBER=1, PAGES="155-167", YEAR=1983, REFERENCES=10, KEYWORDS="Switching network; CLOS", } @ARTICLE{Marc83:Dynamic, AUTHOR="G. D. Marcus and P. Papantoni-Kazakos", TITLE="Dynamic scheduling protocols for a multiple-access channel", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="1046-1055", YEAR=1983, REFERENCES=6, KEYWORDS="Process management; packet switching; scheduling; multiple access; communication protocol", ABSTRACT="In this paper the multiple-access problem in a packet network is considered. A finite number of independent packet transmitting users is assumed. Protocols are developed to allocate the channel resources among the users. Part of the channel capacity is assigned to control information. This information is used to make probabilistic inferences of the queue lengths and delay characteristics of the users. The probabilistic inferences are used to", } @ARTICLE{Marg83:Korrelationsfunktion, AUTHOR="A. Marganitz", TITLE="Korrelationsfunktion der Ausgangsfolge eines Binärumsetzers", JOURNAL="Frequenz", VOLUME=37, PAGES="247-250", YEAR=1983, LANGUAGE="German", REFERENCES=6, KEYWORDS="Correlation; analysis; binary signal; logic element; discrete state process; discrete time process", ABSTRACT="An arbitrarily distributed binary random seqquence as clockpulses of a binary divider causes an equally distributed random sequence at the output. Consecutive pulses of the output signal are strongly depend on each other. In considering an arbitrarily distributed bernoulli-sequence as an input signal the autocorrelation function of the output signal is computed.", } @ARTICLE{Maru83:Defining, AUTHOR="K. Maruyama", TITLE="Defining Routing Tables for {SNA} Networks", JOURNAL=ibmsj, VOLUME=22, NUMBER=4, PAGES="435-449", YEAR=1983, REFERENCES=25, KEYWORDS="Routing algorithm; packet switching; SNA; network", ABSTRACT="This paper addresses three basic problems associated with the definition process for the routing tables of IBM's Systems Network Architecture (SNA). The paper then introduces a program called the Routing Table Generator (RTG) and describes how these problems were solved with RTG. Also discussed are some approaches on how to use RTG in managing routing tables for growing networks.", } @ARTICLE{Mass83:Expected, AUTHOR="G. M. Masson and S. B. Morris", TITLE="Expected capacity of (M,2)-networks", JOURNAL=ieeetc, VOLUME="C-32", PAGES="649-657", YEAR=1983, REFERENCES=9, KEYWORDS="Concentrator; interconnection network", ABSTRACT="A concentrator is an interconnection network with $n$ inputs and $m$ outputs, $n>m$, wherein any specified subset of inputs of size less than or equal to some number, called the network's actual capacity, can always be simultaneously connected to some equal-sized but specifiable subset of outputs. This paper considers the expected capacity of a special class of sparse crossbar concentrators called $(m,2)$ networks. It is seen that the expected", } @ARTICLE{Medi83:Stability, AUTHOR="J. S. Meditch and A. L. Chin-Tau", TITLE="Stability and optimization of the {CSMA} and {CSMA/CD} channels", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="763-774", YEAR=1983, REFERENCES=16, KEYWORDS="packet switching; ALOHA; CSMA; carrier sense multiple access; network stability", ABSTRACT="A comprehensive study of the stability and optimization of the infinite population, slotted, nonpersistent csma and csma/cd channels is presented. The delay versus throughput characteristic for the stabilized channels is derived and used to demonstrate the performance archievable with these channels.", } @ARTICLE{Meue83:Gibt, AUTHOR="Meuer and W. Wacker", TITLE="Gibt es noch das Grosch'sche Gesetz?", JOURNAL=er, VOLUME=25, PAGES="234-240", YEAR=1983, LANGUAGE="German", KEYWORDS="Computer performance; Grosch's law", } @ARTICLE{Mitr83:Asymptotic, AUTHOR="D. Mitra and J. A. Morrison", TITLE="Asymptotic expansions of the waiting time in a shared-processor of an interactive system", JOURNAL="SIAM Journal Computers", VOLUME=12, PAGES="789-802", YEAR=1983, KEYWORDS="M/M/1/S; processor sharing; waiting time; expectation; variance", ABSTRACT="The mathematical model the authors examine is a single server with a finite but large number of customers cycling between a ``thinking'' state and service requests. This type of model has often been called a machine interference problem. They require the think time and service times to be exponentially distributed and $\rho < 1$ for the server. Furthermore, the service discipline is processor-shared. Expansions of the differential (generating function)", } @ARTICLE{Mous83:Passive, AUTHOR="S. Moustakas and H. Witte", TITLE="Passive fiber-optic star bus for local area networks: system design and performance", JOURNAL=siemensfe, ADDRESS="München", VOLUME=12, NUMBER=3, PAGES="182-187", YEAR=1983, REFERENCES=19, KEYWORDS="LAN; star network; bus; fiber optics", ABSTRACT="The article treats the transmission performance of an optical LAN, especially of passive transmissive star coupler.", } @ARTICLE{Nain83:Queueing, AUTHOR="P. Nain", TITLE="Queueing systems with service interruptions: an approximation model", JOURNAL=pe, VOLUME=3, PAGES="123-129", YEAR=1983, REFERENCES=16, KEYWORDS="GI/GI/1; PREHOL priority; diffusion approximation; analytical model; preemptive resume queue; service interruption", ABSTRACT="We present a single queueing model which can be used to analyse queueing system with service interruptions. The model is based on a diffusion approximation using an instantaneous return process which reflects the particular queueing system under consideration. Applications to queueing systems with preemtive resume priority and breakdowns are given in this paper as well as numerical results showing the accuracy of the approximation.", } @ARTICLE{Neuk83:Navigationssystem, AUTHOR="E. P. Neukirchner and others", TITLE="{EVA-Ortungs-} und Navigationssystem für Landfahrzeuge", JOURNAL=ntz, VOLUME=36, PAGES="214-223", YEAR=1983, LANGUAGE="German", KEYWORDS="Navigation system", } @ARTICLE{Ng83:Optimal, AUTHOR="Ming-Hung Ng and D. B. Hoang", TITLE="Optimal Capacity Assignment in Packet-Switching Networks", JOURNAL=atr, VOLUME=17, NUMBER=2, PAGES="53-64", YEAR=1983, REFERENCES=16, KEYWORDS="Packet switching; optimization", ABSTRACT="In this paper we consider the capacity assignment problem in a packet-switching network. Each communication link in the network is realised by a collection of parallel transmission lines. To obtain the optimal capacity assignment, i.e. finding the optimal number of transmission lines for each link, network queueing models are first derived to describe the network in terms of the design parameters, namely: link flow, link capacity, and the", } @ARTICLE{Nizn83:Quantization, AUTHOR="Carol A. Niznik", TITLE="A quantization approximation for modeling computer network nodal queueing delay", JOURNAL=ieeecom, VOLUME="COM-", PAGES="245-253", YEAR=1983, REFERENCES=42, KEYWORDS="GI/G/1; M/M/1; E2/M/1; overflow; buffer length; waiting time; Markov process", ABSTRACT="A new approximation model for the analysis of a finite buffer gi/g/1 system is presented. The approach consists of formulating the computer node mean waiting time from a discrete time marginal overflow customer per time slot solution of a continuous marginal overflow time per customer solution.", } @ARTICLE{Nutt83:Experimental, AUTHOR="G. J. Nutt", TITLE="An experimental distributed modelling system", JOURNAL=toois, VOLUME=1, PAGES="117-142", YEAR=1983, KEYWORDS="Distributed simulation", } @ARTICLE{Page83:G, AUTHOR="B. Page", TITLE="Der Gültigkeitsnachweis von komplexen Simulationsmodellen", JOURNAL=aninf, VOLUME=4, PAGES="149-157", YEAR=1983, LANGUAGE="German", REFERENCES=19, KEYWORDS="Simulation; validation; simulation model", ABSTRACT="In dem mehrstufigen Verfahren zur Modellvalidierung werden die Schritte Verifikation, Sensitivitätsanalyse, Kalibrierung und Outputvergleich sowie prognostische und dynamische Gültigkeitspruefung unterschieden. Ein Anwendungsbeispiel soll die Praktikabilität des Verfahrens zeigen.", } @INPROCEEDINGS{Pawl83:User, AUTHOR="P. F. Pawlita and H.-D. Südhofen", TITLE="User behavior in teleprocessing networks: analytical models based on empirical data", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="3.3.4", YEAR=1983, REFERENCES=15, KEYWORDS="model; traffic parameter; man-machine interaction; performance measure; measurement; parameter validation; information system; communication network", ABSTRACT="In traffic theory a teleprocessing network model is usually based on compound modeling of user traffic, communication network and remote processing environment. This paper deals with analyti cal user models for user-computer (mostly dialog) communication based on traffic measurements. First, a model classification is given. The main parts describe several models of telecommunication user behavior: Models of interaction cycles, one", } @ARTICLE{Pawl83:Analytisch, AUTHOR="P. F. Pawlita and H.-D. Südhofen", TITLE="Analytisch-empirische Modelle des Benutzerverhaltens in Datenfernverarbeitungsnetzen", JOURNAL=er, VOLUME=25, NUMBER=5, PAGES="210-218", YEAR=1983, LANGUAGE="German", REFERENCES=16, KEYWORDS="model; man-machine interaction; measurement; performance measure; parameter validation; communication network; information system; traffic parameter", ABSTRACT="Verkehrstheoretische Modelle für Datenfernverarbeitungsnetze beruhen auf Modellierungen des Benutzerverkehrs, des Netzes und der angeschlossenen Systeme. Vorliegender Beitrag behandelt analytische Modelle des Benutzer-Computer-Verkehrs auf der Basis von Messungen in sechs typischen Dialog- und Transaktionssystemen. Einleitend werden Benutzermodelle klassifiziert. Der Hauptteil behandelt verschiedene Modelle des Benutzerverhaltens in", } @ARTICLE{Perr83:Queue, AUTHOR="Harry Perros", TITLE="On the {M/CK/1} queue", JOURNAL=pe, VOLUME=3, PAGES="83-93", YEAR=1983, REFERENCES=10, KEYWORDS="M/Ck/1; queue length; service time; Z-transform; distribution", ABSTRACT="We obtain the exact analytic expression of the probability distribution of the number of units in a single server queue with poisson arrivals and coxian service time distribution (notated as M/CK/1). A recursive procedure for calculating this probability distribution is given. The well-known queues M/EK/1 and M/D/1 are re-derived as special cases of the M/CK/1 queue. Finally, the cases of M/C2/1 and M/C3/1 are fully worked out.", } @ARTICLE{Pici83:Fast, AUTHOR="B. Picinbono", TITLE="Fast algorithms for Brownian matrices", JOURNAL=ieeeassp, VOLUME="ASSP-31", PAGES="512-514", YEAR=1983, REFERENCES=3, KEYWORDS="Method; recursion method; signal processing; efficient computer algorithm; Toeplitz matrix; linear equation", ABSTRACT="Brownian motion is one of the most common models used to represent nonstationary signals. The covariance matrix of a discrete-time Brownian motion has a very particular structure, and is called a Brownian matrix. This note presents a number of results concerning linear problems appearing in digital signal processing with Brownian matrices. In particular, it is shown that fast algorithms used for Toeplitz matrices are simpler and faster for", } @ARTICLE{Piqu83:Ordering, AUTHOR="A. R. Piquer", TITLE="On Ordering Requests to Servers in a Distributed System", JOURNAL=cn, VOLUME=7, PAGES="69-81", YEAR=1983, REFERENCES=6, KEYWORDS="Computer network; distributed control; request ordering; LAN; Blocking", } @ARTICLE{Posc83:Interruptstrukturen, AUTHOR="R. Posch", TITLE="Interruptstrukturen in Systemen mit Datenfernverarbeitungsumgebu ng", JOURNAL=aninf, VOLUME=6, PAGES="258-261", YEAR=1983, LANGUAGE="German", REFERENCES=5, KEYWORDS="operating system; concentrator; interrupt procedure; dynamic priority", ABSTRACT="This paper deals with the processor load and marginal cases of systems whose main purpose is servicing terminals. Those systems include many front end computers as well as multiplexers and teleprocessing units that are controlled by a processor. In contrast to the common practice of using interrupt classes we propose a system that insures even cpu load and consequently requires less cpu power. This is archieved by using interrupt structures", } @ARTICLE{Raab83:Weg, AUTHOR="G. Raab", TITLE="Der Weg zum {ISDN} - Nebenstellentechnik für die zukünftige Bürokommunikation", JOURNAL=siemenstr, ADDRESS="München", VOLUME=6, NUMBER=3, PAGES="183-187", YEAR=1983, LANGUAGE="German", REFERENCES=11, KEYWORDS="ISDN", } @ARTICLE{Rahi83:LAN, AUTHOR="S. K. Rahimi and G. D. Jelatis", TITLE="{LAN} protocol validation and evaluation", JOURNAL=ieeejsac, VOLUME="SAC-1", PAGES="790-802", YEAR=1983, KEYWORDS="LAN; protocol engineering", } @ARTICLE{Rams83:Generating, AUTHOR="L. A. Ramshaw and P. D. Amer", TITLE="Generating Traffic Over a Local Area Network Using Random Number Generators", JOURNAL=cn, VOLUME=7, PAGES="233-251", YEAR=1983, REFERENCES=21, KEYWORDS="LAN; artificial traffic; NBSNET; performance evaluation; random number generation; random number testing; traffic generator", ABSTRACT="Es geht hier direkt um die Zufallszahlen und nur am Rande um das Generieren von kuenstlicher Last, aber die Randbedingungen sind interessant, d.h. zum Beispiel die Rate mit der Zufallszahlen erzeugt wedarf die Rate mit der Pakete oder Nachrichten abgeschickt werdenbegrenzen.", } @ARTICLE{Rior83:Access, AUTHOR="J. Riordan and others", TITLE="Access strategies in packet mobile radio data networks", JOURNAL=cn, VOLUME=7, PAGES="211-221", YEAR=1983, KEYWORDS="Packet radio", } @ARTICLE{Rons83:Three, AUTHOR="C. Ronse", TITLE="A three-stage construction for multiconnection networks", JOURNAL=acta, VOLUME=20, PAGES="197-206", YEAR=1983, REFERENCES=4, KEYWORDS="Switching network", } @ARTICLE{Rubi83:Synchronous, AUTHOR="I. Rubin", TITLE="Synchronous and channel-sense asynchronous dynamic group-random-access schemes for multiple-access communications", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="1063-1077", YEAR=1983, REFERENCES=19, KEYWORDS="packet switching; multiple access; random multiple access; group random access; CSMA; carrier sense multiple access", ABSTRACT="Adaptive random-access schemes are introduced and analyzed to provide access-control supervision for a multiple-access communication channel. The dynamic group-random-access (dgra) schemes introduced in this paper implement an adaptive gra structure. An active terminal transmits its ready packet at random within the next specified time period. Colliding packets are retransmitted at a random slot within the next time period. The duration of each", } @ARTICLE{Saue83:Computational, AUTHOR="C. H. Sauer", TITLE="Computational algorithms for state-dependent queueing networks", JOURNAL=tocs, VOLUME=1, PAGES="67-92", YEAR=1983, REFERENCES=26, KEYWORDS="Queueing network; method; state dependent queueing; MVA; CONVOLUTION ALGORITHM", ABSTRACT="In this paper the author limits the material reviewed to three froms of state dependency in queueing networks which have the product form. The major part of the paper address state-dependent routing, in which the probability of entering a queue of a subnetwork depend upon the quotient of a linear function of the number of customers in that queue and another linear function of the total number of customers in the subnetwork.", } @BOOK{Saue83:Simulation, AUTHOR="C. H. Sauer and E. A. Mac Nair", TITLE="Simulation of computer communication systems", PUBLISHER="PRENTICE-HALL", ADDRESS="Englewood Cliffs, New Jersey", PAGES="1-158", YEAR=1983, KEYWORDS="simulation; communication network; RESQ; Research Queueing package", } @ARTICLE{Scha83:Time, AUTHOR="R. A. Schassberger and H. Daduna", TITLE="The time for a round trip in a cycle of exponential queues", JOURNAL=jacm, VOLUME=30, PAGES="146-150", YEAR=1983, REFERENCES=5, KEYWORDS="Loop queue; exponential queueing network; FIFO; time in system; distribution; cycle time", ABSTRACT="The distribution of the time for a round trip of a job in a cycle of $m$ exponential FIFO queues, where $n$ jobs are cycling, is derived.", } @ARTICLE{Scho83:Ubertragungstechnik, AUTHOR="G. Schollmeier", TITLE="Übertragungstechnik für den digitalen Teilnehmeranschluss im {ISDN}", JOURNAL=siemenstr, ADDRESS="München", VOLUME=6, NUMBER=3, PAGES="180-182", YEAR=1983, LANGUAGE="German", REFERENCES=3, KEYWORDS="ISDN", } @ARTICLE{Scho83:Dynamic, AUTHOR="Frederik Carel Schoute", TITLE="Dynamic frame length {ALOHA}", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="565-568", YEAR=1983, REFERENCES=6, KEYWORDS="Packet switching; ALOHA; TDMA; time division multiple access", ABSTRACT="The frame length is adjusted dynamically according to the number of garbled, successful, and empty timeslots in the past. Each terminal that has a packet to transmit selects at random one of the n timeslots of a frame. Dynamic frame length aloha achieves a throughput (expected number of successful packets per timeslot) of 0.426 which compares favorably with the $1/e(=0.368)$ upper bound of ordinary slotted aloha.", } @TECHREPORT{Scho83:Waiting, AUTHOR="Frederik Carel Schoute", TITLE="Waiting Time Distribution for a Server with Service Time Distribution in the Form of a Histogram", INSTITUTION="AT\\&T and Philips Telecommunicatie Bedrijven", ADDRESS="Hilversum", NUMBER="SR2200-83-3946/21", YEAR=1983, KEYWORDS="Discrete time analysis", } @ARTICLE{Sega83:Reliable, AUTHOR="A. Segall and B. Awerbuch", TITLE="A reliable broadcast protocol", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="896-901", YEAR=1983, REFERENCES=4, KEYWORDS="Packet switching; ARPAnet; communication protocol; broadcast; communication", ABSTRACT="Broadcast in a communication network is the delivery of copies of messages to all nodes. A broadcast protocol is reliable if all messages reach all nodes in finite time, in the correst order and with no duplicates. The present paper presents an efficient relisble broadcast protocol.", } @BOOK{Seid83:Principles, AUTHOR="J. Seidler", TITLE="Principles of Computer Communication Network Design", ISBN="0-85312-241-5", PUBLISHER="Ellis Horwood Limited", ADDRESS="Chichester", YEAR=1983, KEYWORDS="Computer network; open system; flow control", ABSTRACT="1. Fundamental concepts and problems of computer networks design2. Open systems with a common channel 3. Feedback systems with a common channel 4. Common channel systems with coordinated node operation 5. Fundamental problems of routing 6. Congestion and methods of counteracting IT 7. Optimisation of channel capasities and network topologies", } @ARTICLE{Seit83:User, AUTHOR="N. B. Seitz and D. R. Wortendyke and K. P. Spies", TITLE="User-oriented performance measurements on the {ARPAnet}", JOURNAL=ieeecm, VOLUME=21, PAGES="28-44", YEAR=1983, REFERENCES=6, KEYWORDS="Design; standard; communication network; ARPAnet; performance evaluation; measurement", ABSTRACT="Two related data communication performance standards have been developed. The first, American national standard X3.102, defines user-oriented performance parameters (1). The second, proposed Federal standard 1043, defines companion measurement methods (2). The two standards together provide a common denominator for comparing the performance of altenative services. It is anticipated that they will be widely used in future data communication", } @ARTICLE{Shac83:Protocol, AUTHOR="N. Shacham", TITLE="A protocol for perferred access in packet-switching radio networks", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="253-264", YEAR=1983, REFERENCES=20, KEYWORDS="Packet switching; broadcast; communication; Communication protocol; priority; radio channel; packet radio", ABSTRACT="A protocol that provides multiple access with two levels of priority to a common radio channel is described. A probabilistic model of the protocol is presented and its analysis yields the throughput-delay characteristics of the two classes of packets supp orted by that protocol, along with their interaction. The model is analyzed by a method similar to the one used in priority queues.", } @ARTICLE{Skap83:Anforderungen, AUTHOR="N. Skaperda and U. F. Thomanek", TITLE="Anforderungen und Lösungswege für das Digitalvermittlungssystem {EWSD} im {ISDN}", JOURNAL=siemenstr, VOLUME=6, NUMBER=3, PAGES="174-179", YEAR=1983, LANGUAGE="German", REFERENCES=8, KEYWORDS="ISDN", } @ARTICLE{Tasa83:Stability, AUTHOR="S. Tasaka", TITLE="Stability and performance of the {R-ALOHA} packet broadcast system", JOURNAL=ieeetc, VOLUME="C-32", PAGES="717-726", YEAR=1983, REFERENCES=19, KEYWORDS="Broadcast; communication; packet switching; Markov process; satellite radio; network stability; R-ALOHA; propagation delay", ABSTRACT="The dynamic behavior of the R-ALOHA packet broadcast system with multipacket messages is analyzed in this paper. It is assumed that each user handles one message at a time and the number of packets in a message is geometrically distributed. A Markovian model of the systems is first formulated which explicitly contains the influence of the propagation delay of the broadcast channel. An approximate technique called equilibrium point analysis", } @ARTICLE{Bare83:Untersuchung, AUTHOR="M. Barel and B. Jobes", TITLE="Untersuchung an Generatoren für gleichverteilte Zufallszahlen", JOURNAL=aninf, VOLUME=9, PAGES="404-409", YEAR=1983, LANGUAGE="German", REFERENCES=17, KEYWORDS="random number generation; Tausworthe Generator", } @ARTICLE{Lani83:File, AUTHOR="L. Laning and M. Leonard", TITLE="File Allocation in a Distributed Computer Communication Network", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=3, PAGES="232-244", YEAR=1983, KEYWORDS="Routing algorithm; computer network; distributed database; file management; heuristics; math. programming technique; network delay; simulation", ABSTRACT="An algorithm is presented to determine locations for the stora ge of copies of files in store-and-forward computer communications networks. The algorithm determines storage locations which minimize the sum of network file storage costs and message transmission costs. Network that use adaptive routing techniques are the primary focus. Feasible file locations must satisfy network performance requirements for file availability and delay by mess", } @ARTICLE{Imas83:Directed, AUTHOR="M. Imase and M. Itoh", TITLE="A Design for Directed Graphs with Minimum Diameter", JOURNAL=ieeetc, ISBN="0018-9340", VOLUME="C-32", NUMBER=8, PAGES="782-784", YEAR=1983, REFERENCES=14, KEYWORDS="Computer network; switching system; optimization; graph theory", } @INPROCEEDINGS{Bura83:Approximate, AUTHOR="W. Burakowski", TITLE="Approximate methods for multi-user-class system analysis", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", VOLUME="3.4.6", PAGES="1-7", YEAR=1983, KEYWORDS="Data traffic; computer network", } @INPROCEEDINGS{Bura83:Routing, AUTHOR="A. Burattin and U. Mazzei", TITLE="Routing and trunking network evolution when introducing local digital switching", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.3a.1)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Burk83:Customer, AUTHOR="L. Burkard and J. Phelan and M. D. Weekly", TITLE="Customer behavior and unexpected dial tone delay", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", VOLUME="2.4.5", PAGES="1-7", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Butt83:Satellite, AUTHOR="M. Butto and G. Colombo", TITLE="Performance evaluation of {DA/SS-TDMA} satellite systems with wide bandwidth traffics", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.3a.6)", YEAR=1983, KEYWORDS="Data traffic; computer network", } @INPROCEEDINGS{Caba83:Effects, AUTHOR="P. A. Caballero and J. M. Silva", TITLE="Effects of digitization on the optimum structure of junction network", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.3a.4)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Came83:Dynamic, AUTHOR="P. M. Camerini and L. Fratta and others", TITLE="A dynamic planning method for telecommunication networks and its performance evaluation for district trunk networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-10 (2.1.5)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Came83:Dynamik, AUTHOR="W. H. Cameron and J. Regnier and P. Galloy and A. M. Savoie", TITLE="Dynamik routing for intercity telephone network", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-8 (3.2.3)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Chow83:Switching, AUTHOR="K. Chow and A. J. David and A. Ionescu-Graff", TITLE="Switching Capacity Relief Model: Theiretical Development", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.2)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Coco83:Relationships, AUTHOR="R. A. Coco and R. A. Farel and R. Potter and P. E. Wirth", TITLE="Relationships between utilization, service and forecast uncertainty for central office provisioning", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (1.2.1)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Cohe83:Queueing, AUTHOR="J. W. Cohen", TITLE="Queueing problems with a two-dimensional state space", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-3 (4.1)", YEAR=1983, KEYWORDS="Delay system", } @INPROCEEDINGS{Cole83:Study, AUTHOR="A. C. Cole", TITLE="A study of traffic flow in relation to ccitt recommendations forthe measurement of telephontraffi flow, call attempts and seizures seizures", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-8 (1.4.7)", YEAR=1983, KEYWORDS="Measurement", } @INPROCEEDINGS{Comb83:Simple, AUTHOR="M. C. Combes and F. Horn and J. Kerneis", TITLE="Simple modular algorithm for dimensioning digital links", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.3b.4)", YEAR=1983, KEYWORDS="Link system", } @INPROCEEDINGS{Cond83:Differentiated, AUTHOR="R. Conde and P. C. Carvalho", TITLE="Differentiated rates-effects of its introduction in a developing country", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.2.3)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Croz83:Integrating, AUTHOR="M. W. Crozier and R. N. Pandya and R. Doshi", TITLE="Integrating voice and data in a switching node a comparison ofstrategies", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.1.4)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Dais83:General, AUTHOR="G. Daisenberger and B. Teufel", TITLE="General solution of the equilibrium equations of a nonpreemptive multipriority queue system", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.4a.3)", YEAR=1983, KEYWORDS="Delay system", } @INPROCEEDINGS{Davi83:Switch, AUTHOR="A. J. David and N. Farber and N. J. Holmdes", TITLE="The switch planning system for the dynamic nonhierarchical routingnetwork", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-8 (3.2.8)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Boer83:Limits, AUTHOR="J. de Boer", TITLE="Limits and asymtotes of Overflow Curves", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="5.3.4.1-7", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{los83:Blocking, AUTHOR="J. de los and A. Buchheister", TITLE="Blocking calculation method for digital switching network with step-by-step hunting and retrials", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-5 (5.1.4)", YEAR=1983, KEYWORDS="Link system", } @INPROCEEDINGS{Migu83:Some, AUTHOR="M. de Miguel and F. de los", TITLE="Some aspects of the dimensioning and optimization of digital networks in both-way circuits", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="2.2.6.1-7", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Denz83:Modelling, AUTHOR="W. Denzel and W. Weiss", TITLE="Modelling and performance of a new integrated switching system forvoice and data with distributed control", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.1.3)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Sous83:Traffic, AUTHOR="Paulo de Sousa", TITLE="Traffic engineering for automatic call distribution Networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="4.3a.7.1-8", YEAR=1983, KEYWORDS="Link system", } @INPROCEEDINGS{Diet83:Simulation, AUTHOR="W. Dieterle", TITLE="A simulation Study of {CCITT} {X.25:} Throughput classes and window flow control", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (3.3.6)", YEAR=1983, KEYWORDS="Simulation", } @INPROCEEDINGS{Dosh83:Overload, AUTHOR="B. T. Doshi and H. Heffes", TITLE="Analysis of overload control schemes for a class of distributed switching machines", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (5.2.2.)", YEAR=1983, KEYWORDS="Control; overload control", } @INPROCEEDINGS{Down83:Statistical, AUTHOR="T. Downs", TITLE="Statistical Modelling of the reliability of {SPC} software", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-9 (2.3.2)", YEAR=1983, KEYWORDS="Data traffic; computer network", } @INPROCEEDINGS{Dres83:Cost, AUTHOR="J. Dressler and others", TITLE="Cost 201: A european research project. A flexible procedure for minimizing the costs of a switched network taking into account mixedount mixed technologies and end-to-end blocking constraints", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (2.1.3)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Dzio83:Method, AUTHOR="Z. Dziong", TITLE="A Method for calculation of traffic carried on network paths", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.3b.7)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Eise83:Strict, AUTHOR="M. Eisenberg", TITLE="A strict priority system with overload control", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.3.2)", YEAR=1983, KEYWORDS="Control; overload control", } @INPROCEEDINGS{Ekva83:Allocation, AUTHOR="D. Ekvall and L. Lee", TITLE="Allocation of trunks over diversity routes", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (4.3b.5)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Elha83:Diffusion, AUTHOR="Elhamy Abdou", TITLE="Diffusion approximation for preemptive-resume queueing system", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.4a.5)", YEAR=1983, KEYWORDS="Delay system", } @INPROCEEDINGS{Elld83:Report, AUTHOR="A. Elldin", TITLE="Report of training working party", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-3 (4.2.6)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Emst83:Models, AUTHOR="P. J. Emstad", TITLE="Models of demand access of satellite communication channels", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (3.1.4)", YEAR=1983, KEYWORDS="Data traffic; computer network", } @INPROCEEDINGS{Engv83:Telephone, AUTHOR="L. Engvall", TITLE="Telephone {(TV} and Radio) usage in developing countries. Its relationship to income-distribution and other socio-economic parameters arameters", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-9 (4.2.4)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Ever83:Numerical, AUTHOR="David Everitt and T. Downs", TITLE="A numerical algorithm for the {GI/G/k} queue", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (4.4a.1)", YEAR=1983, KEYWORDS="Delay system; GI/G/N", } @INPROCEEDINGS{Ever83:Multicellular, AUTHOR="David Everitt and N. W. MacFadyen", TITLE="Analysis of multicellular mobile radiotelephone systerms with loss", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.1.7)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Farr83:Administration, AUTHOR="J. P. Farr and E. H. J. Waldron", TITLE="Administration of traffilc forecasting for sparse rural telephone networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.2.5)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Feng83:Approach, AUTHOR="L. Feng-Kuang", TITLE="An approach to integrated voice and data switch modelling", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (1.1.6)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Fiel83:Benefits, AUTHOR="F. A. Field", TITLE="The benefits of dynamic nonhierarchical routing in metropolitan traffic networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (3.2.1)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Fili83:Evolving, AUTHOR="M. Filippini and U. Mazzei and G. Miranda", TITLE="Design and implementation of the evolving italian toll network: methodologies and computer tools", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (2.2.2)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Font83:Queue, AUTHOR="B. Fontana", TITLE="Queue with two priorities and feedback: joint Queue-length distributions for specific sequences", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-8 (4.1.8)", YEAR=1983, KEYWORDS="Delay system", } @INPROCEEDINGS{Fory83:Analyzing, AUTHOR="L. J. Forys and H. Zucker", TITLE="Analyzing the effectiveness of audible ringing", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (5.2.6)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Fred83:Approximating, AUTHOR="A. Fredericks", TITLE="Approximating parcel blocking via state dependet birth rates", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (5.3.2)", YEAR=1983, KEYWORDS="Data traffic; computer network", } @INPROCEEDINGS{Frie83:Precutover, AUTHOR="K. A. Friedman", TITLE="Precutover extreme value engineering of a local digital switch", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.4.1)", YEAR=1983, KEYWORDS="Control; overload control", } @INPROCEEDINGS{Gamb83:Overview, AUTHOR="E. Gambe", TITLE="Overview in the general area of basic traffic theory and queuing", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.1.1)", YEAR=1983, KEYWORDS="Delay system", } @INPROCEEDINGS{Garm83:Switching, AUTHOR="V. A. Garmash and L. A. Shor and A. I. Abramovich", TITLE="Switching networks with unreliable elements", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (5.1.2)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Gava83:Computer, AUTHOR="M. Gavassuti and G. Giacobbo Scavo and U. Trimarco", TITLE="A computer procedure for optimal dimensioning of evolving toll networks under constraints", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (2.2.5)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Gigl83:Description, AUTHOR="J. Giglmayr", TITLE="Description of interprocessor communication by queueing breakdown analysis", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (1.3.6)", YEAR=1983, KEYWORDS="Link system", } @INPROCEEDINGS{Gira83:Sequential, AUTHOR="Andre Girard and Y. Cote", TITLE="Sequential routing optimization for circuit switched networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-13 (4.3b.8)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Gira83:Private, AUTHOR="Andre Girard and V. Taillon", TITLE="Performance evaluation of private networks with automatic route selection and call queuing", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-8 (2.1.4)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Gonz83:User, AUTHOR="O. Gonzalez Soto and D. Gutierrez and L. Martinez Miguez", TITLE="Analysis of a user communication path in a store and forward network", BOOKTITLE=itc10, ADDRESS="Montrea", PAGES="1-8 (3.4.4)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Gonz83:Modeling, AUTHOR="O. Gonzalez Soto and L. Martinez Miguez and I. G. Niemegeers", TITLE="Modeling and performance evaluation of a packet switching module in an {X.25} network", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-8 (3.3.8)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{GOrg83:Preemptive, AUTHOR="C. GÖrg", TITLE="Evaluation of preemptive Queueing strategies with overhead and their applicability in data networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (3.3.7)", YEAR=1983, KEYWORDS="Data traffic; computer network", } @INPROCEEDINGS{GOSz83:CCITT, AUTHOR="G. G. O. Sztony", TITLE="{CCITT} - a chance to unify the basic traffic engineering practice", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-8 (2.3.1)", YEAR=1983, KEYWORDS="Loss system", } @INPROCEEDINGS{Guer83:Three, AUTHOR="J. P. Guerineau and J. Labetoulle and M. Lebourges", TITLE="A three moments method for traffic in a network based on a Coxian input process", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.4b.2)", YEAR=1983, KEYWORDS="Loss system", } @INPROCEEDINGS{Guer83:Approach, AUTHOR="A. Guerrero and J. de los", TITLE="An approach to traffic analsysis of chronically overloaded networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-9 (2.1.2)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Haen83:DNHR, AUTHOR="D. G. Haenschke and D. A. Kettler and E. Oberer", TITLE="{DNHR:} A new {SPC/CCIS} network management challenge", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (3.2.5)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Half83:Blocking, AUTHOR="S. Halfin", TITLE="Blocking and delays conditional on the number of arrivals in a time period", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-5 (4.1.7)", YEAR=1983, KEYWORDS="Delay system", } @INPROCEEDINGS{Hedb83:Optimization, AUTHOR="I. Hedberg", TITLE="Optimization of alternative routing networks with regard to existing equipment and modularities", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (4.3a.3)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @ARTICLE{Hoff83:Extended, AUTHOR="H. Hoffmann", TITLE="Extended {Erlang} {C:} Traffic engineering for queuing with overflow", JOURNAL=bcr, PAGES="28-33", YEAR=1983, KEYWORDS="Delay system", } @INPROCEEDINGS{Hofs83:Blocking, AUTHOR="H. Hofstetter and D. Weber", TITLE="Blocking probability of folded switching networks with respect to their capacity stages", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (5.1.9)", YEAR=1983, KEYWORDS="Link system", } @INPROCEEDINGS{Jaco83:Gradings, AUTHOR="A. C. Jacobaeus", TITLE="Gradings in link Systems", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-3 (5.1.1)", YEAR=1983, KEYWORDS="Link system", } @INPROCEEDINGS{Jaco83:Telecommunication, AUTHOR="C. Jacobaeus", TITLE="Telecommunication systems and traffic theory", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-4 (5.1.10)", YEAR=1983, KEYWORDS="Link system", } @INPROCEEDINGS{Jajs83:Priority, AUTHOR="A. Jajszczyk", TITLE="Priority rearrangements", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-8 (5.1.5)", YEAR=1983, KEYWORDS="TDM; time division multiplex", } @ARTICLE{Jajs83:Nonblocking, AUTHOR="A. Jajszczyk", TITLE="On Nonblocking Switching Networks Composed of Digital Symmetrical Matrices", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=1, YEAR=1983, KEYWORDS="Switching network", } @INPROCEEDINGS{Jans83:Optimization, AUTHOR="A. Jansons", TITLE="Optimization of telecommunication network based on adjustable access probabilities", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.3b.6)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{John83:Tail, AUTHOR="S. Johnsen", TITLE="Tail probabilities through use of extreme order statistics", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-3 (4.4b.7)", YEAR=1983, KEYWORDS="Simulation", } @INPROCEEDINGS{Kall83:Queuing, AUTHOR="P. J. M. Kallenberg", TITLE="Queuing systems with a finite number of sources and internal traffic", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (4.1.3)", YEAR=1983, KEYWORDS="Loss system", } @INPROCEEDINGS{Kami83:User, AUTHOR="K. Kamimura and M. Nakamura", TITLE="User traffic characteristics on the public packet switched networkand their influence on between performable", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (3.4.1)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Kars83:Centralized, AUTHOR="T. Karstad and K. Stordahl", TITLE="Centralized routing based on forecasts of the telephone traffic", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (3.2.7)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Kash83:Minimum, AUTHOR="A. Kashper and C. D. Pack and G. C. Varvalomcas", TITLE="Minimum-cost multiyear trunk provisioning", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.2.5)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Knot83:Econometric, AUTHOR="P. Knottnerus and W. E. Velding", TITLE="An econometric model of the demand for trunk calls in the netherlands during 1950-1981", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (1.2.7)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Koda83:Engineering, AUTHOR="K. Kodaira and Y. Harada", TITLE="Engineering telecommunications networks through integration of differences in day-to-day traffic variation profiles among circuit groups", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.4.5)", YEAR=1983, KEYWORDS="Measurement", } @INPROCEEDINGS{Korn83:Congestion, AUTHOR="U. Körner", TITLE="Congestion control in packet switching computer communication networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-9 (3.3.5)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Krau83:Novel, AUTHOR="J. M. Kraushaar", TITLE="Novel concepts for the measurement of the mean and variance traffic parameters and their application", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.4.3)", YEAR=1983, KEYWORDS="Measurement", } @INPROCEEDINGS{Kron83:Procedure, AUTHOR="M. Krone", TITLE="A design procedure for hybrid circuit-packet networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (3.4.7)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Lee83:Evolution, AUTHOR="John Lee and R. J. Armolavicius", TITLE="The Evolution of traffic standards", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="2.3.8.1-6", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Lee83:AGT, AUTHOR="L. Lee", TITLE="The {AGT} toll network reliability objectives", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-5 (2.3.4)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Gall83:End, AUTHOR="P. Le Gall", TITLE="End to end dimensioning of hierarchical telephone networks and traffic combination", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (2.1.7)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Leht83:Development, AUTHOR="P. Lehtinen and O. Martikainen", TITLE="Development of traffic theory for {SPC} exchanges and new teleservices based on measured data", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.4.6)", YEAR=1983, KEYWORDS="Measurement", } @INPROCEEDINGS{Lewi83:Measurements, AUTHOR="A. W. Lewis and G. Léonard", TITLE="Measurements of repeat call attempts in the intercontinental telephone service", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-4 (2.4.2)", YEAR=1983, KEYWORDS="Measurement", } @INPROCEEDINGS{Lind83:Cost, AUTHOR="P. Lindberg and U. Mocci and A. Tonietti", TITLE="Cost 201: a European resarch project: a procedure for minimizing the cost of a transmission network under service availability constraints in failure conditions", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (2.3.3)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Lind83:Simple, AUTHOR="K. Lindberger", TITLE="Simple approximations of overflow system quantities for additionaldemands in the optimization", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (5.3.3)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Luba83:Circuit, AUTHOR="J. Lubacz", TITLE="Circuit-switched communication networks analysis - call delay point of view", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (2.2.1)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Mach83:Overflow, AUTHOR="F. Machihara", TITLE="On the overflow processes from the {PH1} + {PH2/M/S/K} queue", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.1.5)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Mass83:Asymptotic, AUTHOR="W. A. Massey", TITLE="Asymptotic analysis of M(t)/M(t)/1: The time dependent {M/M/1} queue", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-3 (4.4a.6)", YEAR=1983, KEYWORDS="Delay system", } @INPROCEEDINGS{Mats83:Individual, AUTHOR="J. Matsumoto and Y. Watanabe", TITLE="Analysis of individual traffic characteristics for queueing systemwith multiple poisson and overflow inputs", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (5.3.1)", YEAR=1983, KEYWORDS="Delay system", } @INPROCEEDINGS{McMa83:Traffic, AUTHOR="A. M. McMahon", TITLE="Network traffic planning in a changing environment", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-5 (2.1.1)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{McMe83:Evaluating, AUTHOR="P. G. McMenamin and G. FitzPatrick", TITLE="Evaluating network survivability through exposure", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="2.3.6.1-6", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Mirs83:Aspects, AUTHOR="K. Mirski", TITLE="Some aspects of trunk traffic forecasting", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-5 (4.2.2)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Mroz83:Lost, AUTHOR="G. Mrozynski", TITLE="Lost traffic in a service integrated {TDM} switching system with seperated and common used channel areas", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.1.8)", YEAR=1983, KEYWORDS="Link system", } @INPROCEEDINGS{Mysk83:Distribution, AUTHOR="A. Myskja", TITLE="Distribution models for quasi-stationary random traffic", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.4b.4)", YEAR=1983, KEYWORDS="Loss system", } @INPROCEEDINGS{Naum83:Loss, AUTHOR="E. O. Naumova", TITLE="The loss probability measurement accuracy for the subscriber line with repeated calls", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-4 (4.4b.6)", YEAR=1983, KEYWORDS="Measurement", } @INPROCEEDINGS{Nive83:Optimum, AUTHOR="K. Nivert and R. Gunnarsson and L.-E. Sjöström", TITLE="Optimum distribution of congestion in a national trunk network. Aneconomical evaluation as a bas for grade of service standards ndards", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-5 (2.3.9)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Nomb83:Microprocessor, AUTHOR="L. F. Nombela", TITLE="Microprocessor and eve in the traffic measurement and administration problems. An Empirical specification of {G.O.S.}", BOOKTITLE=itc, ADDRESS="Montreal, Canada", PAGES="1-6 (1.4.4)", YEAR=1983, KEYWORDS="Measurement", } @INPROCEEDINGS{Nord83:Optimization, AUTHOR="P. Nordeste", TITLE="Optimization of Portuguese trunk telephone network", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-5 (2.2.3)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Okaz83:Sensitivity, AUTHOR="H. Okazaki and H. Miyamoto", TITLE="A sensitivity study on network planning", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-8 (4.3a.5)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Part83:Long, AUTHOR="R. Parthasarathy and J. Casey and P. Troutman", TITLE="Long Term Growth Trends in International Telecommunications traffic: An Intelsat study", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.2.6)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Pass83:Forecasting, AUTHOR="A. Passeron and E. Eteve", TITLE="A forecasting Model to set up multi-season Traffic matrices", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.2.4)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Pawl83:Multiple, AUTHOR="Krzysztof Pawlikowski", TITLE="Multiple channel occupation period in a packet switching system", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-5 (4.4a.7)", YEAR=1983, KEYWORDS="Data traffic; computer network", } @INPROCEEDINGS{Pear83:Generalisation, AUTHOR="C. Pearce", TITLE="A generalisation of the Brockmeyer system", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (5.3.7)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Peir83:Approximate, AUTHOR="L. Peiram", TITLE="Approximate analysis of separable queueing networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-8 (4.4a.9)", YEAR=1983, KEYWORDS="Delay system", } @INPROCEEDINGS{Pior83:Uniform, AUTHOR="M. Pioro", TITLE="A uniform approach to the analysis and optimization of circuit-switched communication networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.3a.2)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Poo83:Comparison, AUTHOR="G. S. Poo", TITLE="Comparison of Bayesian and sampling theory estimates of parametersbased on simulation results", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="2.4.7.1-7", YEAR=1983, KEYWORDS="Simulation", } @INPROCEEDINGS{Pujo83:Throughput, AUTHOR="and O. Spaniol", TITLE="Throughput of a satellite channel-communication", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (3.1.7)", YEAR=1983, KEYWORDS="Data traffic; computer network", } @INPROCEEDINGS{Rahk83:Methods, AUTHOR="K. Rahko", TITLE="Some methods for approximation of congestion", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (5.3.6)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Regn83:Grade, AUTHOR="J. Régnier and P. Blondeau and W. H. Cameron", TITLE="Grade of service of a dynamic call-routing system", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-9 (3.2.6)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Rene83:Individual, AUTHOR="L. Reneby", TITLE="On individual and overall losses in overflow systems", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-9 (5.3.5)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Ronn83:Traffic, AUTHOR="L. A. Ronningen", TITLE="Analysis of a traffic shaping scheme", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (5.2.7)", YEAR=1983, KEYWORDS="Data traffic; computer network; traffic shaping", } @INPROCEEDINGS{Ruba83:Estimation, AUTHOR="J. Rubas", TITLE="Estimation of reference load from daily traffic distributions", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.4.2)", YEAR=1983, KEYWORDS="Measurement", } @INPROCEEDINGS{Sall83:Modular, AUTHOR="G. Sallei and Z. Dely", TITLE="Modular engineering and full grouping theorems for alternate routing networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.3b.2)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Sand83:Simple, AUTHOR="B. Sanders and W. H. Haemers and R. Wilcke", TITLE="Simple approximation techniques for congestion functions for smooth and peaked traffic", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.4B.1)", YEAR=1983, KEYWORDS="Loss system", } @INPROCEEDINGS{Sato83:Delay, AUTHOR="S. Satoh and S. Tanabe and N. Oguchi", TITLE="Delay time analysis in multi-microprocessor", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-5 (1.3.5)", YEAR=1983, KEYWORDS="Link system", } @ARTICLE{Schl83:Zeichengabe, AUTHOR="B. Schladt", TITLE="Zeichengabe in digitalen Fernmeldenetzen - das {CCITT-System} 7", JOURNAL=ingdbp, VOLUME=32, NUMBER=6, YEAR=1983, LANGUAGE="German", KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Schm83:Approximate, AUTHOR="W. Schmitt", TITLE="Approximate analysis of Markovian queueing Networks with priorities", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.3.3)", YEAR=1983, KEYWORDS="Queueing network; priority", } @INPROCEEDINGS{Scho83:Adaptive, AUTHOR="Frederik Carel Schoute", TITLE="Adaptive overload control for an {SPC} exchange", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-6 (5.2.3)", YEAR=1983, KEYWORDS="Control; overload control", } @ARTICLE{Scho83:Overload, AUTHOR="Frederik Carel Schoute", TITLE="Overload control in {SPC} processors", JOURNAL=ptr, VOLUME=41, NUMBER=4, YEAR=1983, KEYWORDS="Control; overload control", } @ARTICLE{Shar83:Distribution, AUTHOR="A. N. Sharov and A. F. Semenyuk and V. S. Stepanov", TITLE="Distribution Function of the Time a Message Stays in a Communication System", JOURNAL="Telecommunication and Radio Engineering", ISBN="UDC 621.391", VOLUME=38, NUMBER=8, PAGES="15-17", YEAR=1983, KEYWORDS="Delay system", } @INPROCEEDINGS{Shat83:Terminal, AUTHOR="F. Shatwan and D. G. Smith", TITLE="Terminal reliability of a computer communication network with a maximum allowed delay", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (2.3.7)", YEAR=1983, KEYWORDS="Data traffic; computer network", } @INPROCEEDINGS{Song83:Subscriber, AUTHOR="D. J. Songhurst", TITLE="Subscriber repeat attempts, congestion and quality of service: a study based on network simulation", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-8 (1.1.5)", YEAR=1983, KEYWORDS="Simulation", } @INPROCEEDINGS{Taka83:Generalized, AUTHOR="K. Takagi", TITLE="Some studies of generalized optimal channel graphs", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (5.1.6)", YEAR=1983, KEYWORDS="Link system", } @INPROCEEDINGS{Tana83:Application, AUTHOR="Yuzo Tanaka and M. Akiyama", TITLE="An application of information theory to switching network design", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (5.1.3)", YEAR=1983, KEYWORDS="Measurement", } @INPROCEEDINGS{Tome83:Estimation, AUTHOR="F. M. Tome and J. A. Cunha", TITLE="Estimation of traffic distribution with shortage of data", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (4.2.1)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Ueda83:Application, AUTHOR="T. Ueda", TITLE="Application of Multidimensional Scaling to Grouping of toll Areas and Proposition of a Forecasting Method", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (1.2.3)", YEAR=1983, KEYWORDS="Network planning; forecasting", } @INPROCEEDINGS{As83:Time, AUTHOR="H. van As", TITLE="Time-out management in packet switching networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="3.3.2.1-7", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Door83:Some, AUTHOR="E. van Doorn", TITLE="Some analytical aspects of the peakedness concept", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="4.4B.5.1-8", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Vill83:Average, AUTHOR="M. Villen-Altamirano", TITLE="Average response times in an {M/G/1} queue with general feedback andpriorities", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (5.2.5)", YEAR=1983, KEYWORDS="Delay system", } @INPROCEEDINGS{Wall83:Feedback, AUTHOR="B. Wallström", TITLE="A feedback queue with overload control", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-9 (1.3.4)", YEAR=1983, KEYWORDS="Control; overload control", } @INPROCEEDINGS{Warf83:Application, AUTHOR="R. E. Warfield and G. A. Foers", TITLE="Application of Bayesian methods to teletraffic measurement and dimensiong", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (2.4.3)", YEAR=1983, KEYWORDS="Measurement", } @INPROCEEDINGS{Wata83:Traffic, AUTHOR="Y. Watanabe and Y. Ikeda", TITLE="Traffic characteristics of {PCR} method for {CCITT} Signalling system No. 7", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-7 (3.3.3)", YEAR=1983, KEYWORDS="Data traffic; computer network", } @INPROCEEDINGS{Weis83:Teletraffic, AUTHOR="A. Weiss", TITLE="An analysis of teletraffic generated by a large number of Markovian sources", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-4 (1.1.7)", YEAR=1983, KEYWORDS="GOS", } @INPROCEEDINGS{Whit83:Analytical, AUTHOR="M. J. Whitehead", TITLE="An analytical model of a class of adaptive virtual call routing procedures", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-8 (3.4.3)", YEAR=1983, KEYWORDS="Data traffic; computer network", } @INPROCEEDINGS{Whit83:Approximations, AUTHOR="W. Whitt", TITLE="Approximations for networks of queues", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="1-5 (4.1.2)", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Akyi83:Erweiterung, AUTHOR="Ian Akyildiz and G. Bolch", TITLE="Erweiterung der Mittelwertanalyse zur Berechnung der Zustandswahrscheinlichkeiten für geschlossene und gemischte Netze", BOOKTITLE="Informatik-Fachberichte Messung, Modellierung und Bewertung von Rechensystemen", PUBLISHER="Springer Verlag", VOLUME=61, PAGES="269-276", YEAR=1983, LANGUAGE="German", KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Arnd83:Realisierung, AUTHOR="H.-J. Arndgen and N. Fischer", TITLE="Die Realisierung des zentralen Zeichengabesystems {CCITT} Nr.7: Erster Einsatz im öffentlichen Funkfernsprechnetz der Deutschen Bundespost", JOURNAL="TN-Nachrichten", ADDRESS="Frankfurt", NUMBER=85, PAGES="41-52", YEAR=1983, LANGUAGE="German", KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Balb83:Computational, AUTHOR="G. Balbo and S. C. Bruell", TITLE="Computational aspects of aggregation in multiple class queueing networks", JOURNAL=pe, VOLUME=3, NUMBER=3, PAGES="177-185", YEAR=1983, KEYWORDS="Queueing network; product form; aggregation", } @ARTICLE{Best83:Note, AUTHOR="D. J. Best", TITLE="A note on gamma variate generators with shape parameter less than unity", JOURNAL=comp, VOLUME=30, PAGES="185-188", NOTE="Fascicle 2", YEAR=1983, KEYWORDS="random variate generation", } @ARTICLE{Blum83:Research, AUTHOR="A. Blum and E. A. MacNair and C. H. Sauer", TITLE="The Research Queueing Package: Graphics developments", JOURNAL="Informatik-Fachberichte Messung, Modellierung und Bewertung von Rechensystemen", PUBLISHER="Springer Verlag", VOLUME=61, PAGES="397-408", YEAR=1983, KEYWORDS="Computer tool; performance evaluation", } @ARTICLE{Blyt83:Binomial, AUTHOR="C. R. Blyth and H. A. Still", TITLE="Binomial confidence intervals", JOURNAL="Journal of the American Statistical Association", VOLUME=78, PAGES="108-116", YEAR=1983, KEYWORDS="Simulation; confidence interval", } @ARTICLE{Bux83:Mean, AUTHOR="W. Bux and H. L. Truong", TITLE="Mean-delay approximation for cyclic-service queueing systems", JOURNAL=pe, VOLUME=3, NUMBER=3, PAGES="187-196", YEAR=1983, KEYWORDS="Queueing system; cyclic service; analysis", } @ARTICLE{Buze83:Response, AUTHOR="J. P. Buzen and A. B. Bondi", TITLE="The response times of priority classes under preemptive resume in M/M/m queues", JOURNAL=or, VOLUME=31, NUMBER=3, PAGES="456-465", YEAR=1983, KEYWORDS="Queueing system; priority; analysis", } @ARTICLE{Chan83:Algorithms, AUTHOR="Tat Keung Chan and G. H. Golub and R. J. LeVeque", TITLE="Algorithms for computing the sample variance: Analysis and recommendations", JOURNAL="The American Statistician", VOLUME=37, NUMBER=3, PAGES="242-247", YEAR=1983, KEYWORDS="Simulation; statistics; numeric calculation", } @INPROCEEDINGS{Delo83:Designing, AUTHOR="B. Delosme and A. Vidal-Madjar", TITLE="Designing a target signalling network", BOOKTITLE="2nd International Network Planning Symposium (NETWORKS)", ADDRESS="Brighton", PAGES="289-293 (15.1)", YEAR=1983, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Fish83:Experience, AUTHOR="D. G. Fisher and R. J. Manterfield and R. Bekaert and J. van Goethem", TITLE="Experience in the implementation of the {CCITT} No. 7 signalling system", BOOKTITLE="Telecom", ADDRESS="Geneva, Switzerland", PAGES="1-7 (1.3.3)", YEAR=1983, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Fish83:Accelerated, AUTHOR="G. S. Fishman", TITLE="Accelerated convergence in the simulation of countably infinite state Markov chains", JOURNAL=or, VOLUME=31, NUMBER=6, PAGES="1074-1089", YEAR=1983, KEYWORDS="Simulation; statistical technique", } @BOOK{Gned83:Handbuch, AUTHOR="B. W. Gnedenko and D. König", TITLE="Handbuch der Bedienungstheorie 1: Grundlagen und Methoden", PUBLISHER="Akademie-Verlag, Berlin", ADDRESS="Berlin", YEAR=1983, LANGUAGE="German", } @INPROCEEDINGS{Gold83:Validated, AUTHOR="A. Goldberg and G. J. Popek and S. S. Lavenberg", TITLE="A validated distributed system performance model", BOOKTITLE="Performance", EDITOR="A. K. Agrawala and Satish K. Tripathi", PAGES="251-268", YEAR=1983, } @TECHREPORT{Hein83:Heuristic, AUTHOR="R. Heinselman", TITLE="Heuristic Iterative Mean Value Analysis: Evaluation of Some Issues", TYPE="Research Report", INSTITUTION="Sperry Research Center", ADDRESS="Sudbury, Massachusetts", NUMBER="TM-49-9", YEAR=1983, KEYWORDS="Queueing network; product form; analysis", } @INCOLLECTION{Herz83:Modelling, AUTHOR="U. Herzog", TITLE="Performance modelling for multiprocessor-systems, fundamental concepts and tendencies", BOOKTITLE="Lecture Notes in Control and Information Sciences: Modelling and Performance Evaluation Methodology", PUBLISHER="Springer-Verlag", VOLUME=60, PAGES="441-452", YEAR=1983, } @INPROCEEDINGS{Hong83:Class, AUTHOR="J. P. Hong and G. Kim", TITLE="Class dependent queueing disciplines with product form solutions", BOOKTITLE="Performance", EDITOR="A. K. Agrawala and Satish K. Tripathi", PUBLISHER="North-Holland, Amsterdam", PAGES="341-349", YEAR=1983, KEYWORDS="Queueing network; product form", } @ARTICLE{Igle83:Statistical, AUTHOR="D. L. Iglehart and G. S. Shedler", TITLE="Statistical efficiency of regenerative simulation methods for networks of queues", JOURNAL=aap, VOLUME=15, NUMBER=1, PAGES="183-197", YEAR=1983, KEYWORDS="Simulation; statistical technique", } @ARTICLE{Igle8311:Regenerative, AUTHOR="D. L. Iglehart and M. Stone", TITLE="Regenerative simulation for estimating extreme values", JOURNAL=or, VOLUME=31, NUMBER=6, PAGES="1145-1166", MONTH="November/December", YEAR=1983, KEYWORDS="Simulation; statistical technique", } @INPROCEEDINGS{Jaco83:Reduction, AUTHOR="P. A. Jacobson and E. D. Lazowska", TITLE="A reduction technique for evaluating queueing networks with serialization delays", BOOKTITLE="Performance", EDITOR="A. K. Agrawala and Satish K. Tripathi", PAGES="45-59", YEAR=1983, KEYWORDS="Queueing network; analysis", } @ARTICLE{Keil83:Total, AUTHOR="Julian Keilson and U. Sumita", TITLE="Evaluation of the total time in system in a preempt/resume priority queue via a modified Lindley process", JOURNAL=aap, VOLUME=15, NUMBER=4, PAGES="840-856", YEAR=1983, KEYWORDS="Queueing system; priority; analysis", } @ARTICLE{Kell83:Soujourn, AUTHOR="F. P. Kelly and P. K. Pollett", TITLE="Soujourn times in closed queueing networks", JOURNAL=aap, VOLUME=15, NUMBER=3, PAGES="638-656", YEAR=1983, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Kram83:Wartesysteme, AUTHOR="W. Kramer", TITLE="Wartesysteme {M/G/1} beschränkter Kapazität mit Sperrphasen und relativen Prioritäten", EDITOR="P. J. Kühn and Christopher Carothers", JOURNAL="Informatik-Fachberichte Messung, Modellierung und Bewertung von Rechensystemen", ADDRESS="Stuttgart", VOLUME=61, PAGES="150-163", YEAR=1983, LANGUAGE="German", KEYWORDS="Queueing system; vacation system; analysis", } @ARTICLE{Kuma83:Equivalent, AUTHOR="A. Kumar", TITLE="Equivalent queueing networks and their use in approximate equilibrium analysis", JOURNAL=bstj, VOLUME=62, NUMBER=10, PAGES="2893-2910", YEAR=1983, KEYWORDS="Queueing network; analysis", } @ARTICLE{Lam83:Simple, AUTHOR="S. S. Lam", TITLE="A simple derivation of the {MVA} and {LBANC} algorithms from the convolution algorithm", JOURNAL=ieeetc, VOLUME="C-32", NUMBER=11, PAGES="1062-1064", YEAR=1983, KEYWORDS="Queueing network; product form; analysis", } @INPROCEEDINGS{Lave83:Rollback, AUTHOR="S. S. Lavenberg and R. R. Muntz and B. Samadi", TITLE="Performance analysis of a rollback method for distributed simulation", BOOKTITLE="Performance", EDITOR="A. K. Agrawala and Satish K. Tripathi", PAGES="117-132", YEAR=1983, KEYWORDS="Simulation; distributed simulation; rollback", } @INCOLLECTION{Lave83:Analtical, AUTHOR="S. S. Lavenberg and C. H. Sauer", TITLE="Analytical results for queueing models", BOOKTITLE="Computer Performance Modeling Handbook", EDITOR="S. S. Lavenberg", CHAPTER=3, PUBLISHER="Academic Press", ADDRESS="New York", PAGES="55-172", YEAR=1983, KEYWORDS="Queueing network; product form; analysis", } @INCOLLECTION{Lave83:Approximate, AUTHOR="S. S. Lavenberg and C. H. Sauer", TITLE="Approximate analysis of queueing networks", BOOKTITLE="Computer Performance Modeling Handbook", EDITOR="S. S. Lavenberg", CHAPTER=4, PUBLISHER="Academic Press", ADDRESS="New York", PAGES="173-221", YEAR=1983, KEYWORDS="Queueing network; analysis", } @BOOK{Meij83:Computer, AUTHOR="A. Meijer and P. Peeters", TITLE="Computer Network Architectures", PUBLISHER="Computer Science Press Inc., Rockville", ADDRESS="Rockville", YEAR=1983, KEYWORDS="Communication network", } @BOOK{Neuf83:Lexikon, TITLE="Lexikon der Elektronik", EDITOR="O. Neufang", PUBLISHER="Friedr. Vieweg and Sohn", ADDRESS="Braunschweig", YEAR=1983, LANGUAGE="German", } @INCOLLECTION{Neut83:Discussion, AUTHOR="M. F. Neuts", TITLE="Discussion of {[BALSAMO} 1983-2])", BOOKTITLE="Mathematical Computer Performance and Reliability", EDITOR="G. Iazeolla and Christopher Carothers", PUBLISHER="North-Holland", ADDRESS="Amsterdam", PAGES="14-15", YEAR=1983, KEYWORDS="Queueing network; analysis", } @ARTICLE{Pete83:Analytic, AUTHOR="A. V. Peterson and R. Kronmal", TITLE="Analytic comparison of three general-purpose methods for the computer generation of discrete random variables", JOURNAL=as, VOLUME=32, NUMBER=3, PAGES="276-286", YEAR=1983, KEYWORDS="random variate generation", } @INCOLLECTION{Saue83:Extended, AUTHOR="C. H. Sauer and E. A. MacNair", TITLE="Extended queueing network models", BOOKTITLE="Computer Performance Modeling Handbook", EDITOR="S. S. Lavenberg", CHAPTER=8, PUBLISHER="Academic Press", ADDRESS="New York", PAGES="367-393", YEAR=1983, KEYWORDS="Queueing network; analysis", } @INPROCEEDINGS{Schm83:Recent, AUTHOR="B. W. Schmeiser", TITLE="Recent advances in generating observations from discrete random variables", BOOKTITLE="15th Symposium on the Interface between Computer Science and Statistics", EDITOR="J. E. Gentle", ADDRESS="Amsterdam", PAGES="154-160", YEAR=1983, KEYWORDS="random number generation", } @ARTICLE{Schr8311:Confidence, AUTHOR="L. W. Schruben", TITLE="Confidence interval estimation using standardized time series", JOURNAL=or, VOLUME=31, NUMBER=6, PAGES="1090-1108", MONTH="November/December", YEAR=1983, KEYWORDS="Simulation; statistical technique; confidence interval", } @ARTICLE{Schr8311:Optimal, AUTHOR="L. W. Schruben and H. Singh and L. Tierney", TITLE="Optimal tests for initialization bias in simulation output", JOURNAL=or, VOLUME=31, NUMBER=6, PAGES="1167-1178", MONTH="November/December", YEAR=1983, KEYWORDS="Simulation; statistical technique", } @INPROCEEDINGS{Schu83:Generating, AUTHOR="E. F. Schuster", TITLE="Generating normal variates by summing three uniforms", BOOKTITLE="15th Symposium on the Interface between Computer Science and Statistics", EDITOR="J. E. Gentle", ADDRESS="Amsterdam", PAGES="324-327", YEAR=1983, KEYWORDS="random number generation", } @ARTICLE{Shan8311:Unifying, AUTHOR="J. G. Shanthikumar and R. G. Sargent", TITLE="A unifying view of hybrid simulation/analytic models and modeling.", JOURNAL=or, VOLUME=31, NUMBER=6, PAGES="1030-1052", MONTH="November/December", YEAR=1983, KEYWORDS="Simulation; hybrid simulation", } @INCOLLECTION{Shed83:Generation, AUTHOR="G. S. Shedler", TITLE="Generation methods for discrete event simulation", BOOKTITLE="Computer Performance Modeling Handbook", EDITOR="S. S. Lavenberg", CHAPTER=5, PUBLISHER="Academic Press", ADDRESS="New York", PAGES="223-266", YEAR=1983, KEYWORDS="random variate generation", } @ARTICLE{Sidi83:Structured, AUTHOR="M. Sidi and A. Segall", TITLE="Structured priority queueing systems with applications to packed-radio networks", JOURNAL=pe, VOLUME=3, NUMBER=4, PAGES="265-275", YEAR=1983, KEYWORDS="Queueing system; priority; analysis", } @INCOLLECTION{Stew83:Structure, AUTHOR="W. J. Stewart", TITLE="On the structure of nearly uncoupled Marcov chains", BOOKTITLE="Mathematical Computer Performance and Reliability", EDITOR="G. Iazeolla and Christopher Carothers", PUBLISHER="North-Holland", ADDRESS="Amsterdam", PAGES="287-302", YEAR=1983, KEYWORDS="Markov chain; linear equation", } @INCOLLECTION{Welc83:Statistical, AUTHOR="Peter D. Welch", TITLE="The statistical analysis of simulation results", BOOKTITLE="Computer Performance Modeling Handbook", EDITOR="S. S. Lavenberg", CHAPTER=6, PUBLISHER="Academic Press Inc., New York", PAGES="267-329", YEAR=1983, KEYWORDS="Simulation; statistical technique", } @INCOLLECTION{Wieb83:Link, AUTHOR="G. Wieber", TITLE="Performance analysis of a link level protocol for packet switching networks combining two different retransmission strategies", BOOKTITLE="Lecture Notes in Control and Information Sciences", EDITOR="F. Baccelli and Christopher Carothers", PUBLISHER="Springer Verlag, Berlin", VOLUME=60, PAGES="576-598", YEAR=1983, } @ARTICLE{Chan83:Distributed, AUTHOR="K. M. Chandy and J. Misra and L. M. Haas", TITLE="Distributed Deadlock Detection", JOURNAL=tocs, VOLUME=1, NUMBER=2, PAGES="144-156", YEAR=1983, REFERENCES=15, KEYWORDS="Distributed simulation; computer network; deadlock", ABSTRACT="Distributed deadlock models are presented for resource and communication deadlocks. Simple distributed algorithms for detection of these deadlocks are given. We show that all true deadlocks are detected and that no false deadlocks are reported. In our algorithms, no process maintains global information; all messages have an identical short length. The algorithms can be applied in distributed database and other message communication systems.", } @ARTICLE{Pime83:Real, AUTHOR="J. R. Pimentel", TITLE="Real-time simulation using multiple microcomputers", JOURNAL="Simulation", PAGES="93-104", YEAR=1983, REFERENCES=20, KEYWORDS="Microcomputer; multiprocessor system; real time; distributed simulation", ABSTRACT="Several microcomputers can cooperate to achieve real-time simulation at low cost. Constructing such multiple computer systems requres consideration of task allocation, decomposition schemes, and interprocessor communications. An example system consisting of five 8-bit microprocessors uses direct interprocessor communication and shared memory.", } @ARTICLE{Benj83:Interconnecting, AUTHOR="J. H. Benjamin and M. L. Hess and R. A. Weingarten and W. R. Wheeler", TITLE="Interconnecting {SNA} Networks", JOURNAL=ibmsj, VOLUME=22, NUMBER=4, PAGES="344-386", YEAR=1983, } @UNPUBLISHED{Glig83:Transaction, AUTHOR="V. D. Gligor and R. Popescu-Zeletin", TITLE="Transaction Mangement in Distributed Heterogeneous Database Management Systems", NOTE="U. of Md", YEAR=1983, } @ARTICLE{Gray83:Advanced, AUTHOR="J. P. Gray and P. Brinch Hansen and P. Homan and M. A. Lerner and M. Pozefsky", TITLE="Advanced Program-to-Program Communication in {SNA}", JOURNAL=ibmsj, VOLUME=22, NUMBER=4, PAGES="298-318", YEAR=1983, } @ARTICLE{Grov83:Windows, AUTHOR="G. A. Grover and Kadaba Bharath-Kumar", TITLE="Windows in the Sky-Flow Control in {SNA} Networks with Satellite Links", JOURNAL=ibmsj, VOLUME=22, NUMBER=4, PAGES="451-463", YEAR=1983, } @ARTICLE{Hous83:SNA, AUTHOR="B. C. Housel and C. J. Scopinish", TITLE="{SNA} Distribution Services", JOURNAL=ibmsj, VOLUME=22, NUMBER=4, PAGES="319-343", YEAR=1983, } @ARTICLE{Jaff83:SNA, AUTHOR="Joseph Jaffe and F. H. Moss and R. A. Weingarten", TITLE="{SNA} Routing: Past, Present, and Possible Future", JOURNAL=ibmsj, VOLUME=22, NUMBER=4, PAGES="417-434", YEAR=1983, } @ARTICLE{Ryde83:Experimental, AUTHOR="K. D. Ryder", TITLE="An Experimental Address Space Isolation Technique for {SNA} Networks", JOURNAL=ibmsj, VOLUME=22, NUMBER=4, PAGES="367-386", YEAR=1983, } @ARTICLE{Wein83:Logical, AUTHOR="R. A. Weingarten and E. E. Iacobucci", TITLE="Logical Problem Determination for {SNA} Networks", JOURNAL=ibmsj, VOLUME=22, NUMBER=4, PAGES="387-403", YEAR=1983, } @ARTICLE{Benh83:Multilevel, AUTHOR="E. Benhamou and J. Estrin", TITLE="Multilevel internetworking gateways: Architecture and applications", JOURNAL=ieeecomp, VOLUME=16, PAGES="27-34", YEAR=1983, } @ARTICLE{Burr83:Overview, AUTHOR="W. R. Burr", TITLE="An overview of the proposed American standard for local distributed data interfaces", JOURNAL=cacm, VOLUME=26, PAGES="554-561", YEAR=1983, } @ARTICLE{Hind83:DARPA, AUTHOR="Robert Hinden and Jack Haverty and Alan Sheltzer", TITLE="The {DARPA} internet: Interconnecting heterogeneous computer networks with gateways", JOURNAL=ieeecomp, VOLUME=16, PAGES="38-48", YEAR=1983, } @ARTICLE{Rede83:Interconnecting, AUTHOR="D. D. Redell and James E. White", TITLE="Interconnecting electronic mail systems", JOURNAL=ieeecomp, VOLUME=16, PAGES="55-63", YEAR=1983, } @ARTICLE{Schn83:Interconnecting, AUTHOR="N. Schneidewind", TITLE="Interconnecting local networks to long distance networks", JOURNAL=ieeecomp, VOLUME=16, PAGES="15-24", YEAR=1983, } @ARTICLE{Thor83:Hyper, AUTHOR="J. E. Thornton and G. S. Christensen", TITLE="Hyper channel network links", JOURNAL=ieeecomp, VOLUME=16, PAGES="50-54", YEAR=1983, } @INPROCEEDINGS{Wals83:Personal, AUTHOR="C. Walsh", TITLE="Personal computer network in a teaching environment", BOOKTITLE="Local networks - strategy and systems Localnet", PUBLISHER="On-line publications", ADDRESS="Europe", YEAR=1983, } @ARTICLE{Cole83:Interworking, AUTHOR="Randolph E. Cole and C. J. Adams and N. Calandroni and Luniano Lenzini and I. Leslie", TITLE="An interworking architecture for {STELLA} and {UNIVERSE}", JOURNAL="Satellite and Computer Communication", PAGES="369-377", YEAR=1983, } @BOOK{Denn83:Cryptography, AUTHOR="D. E. Denning", TITLE="Cryptography and Data Security", ISBN="0-201-10150-5", PUBLISHER="Addison-Wesley", YEAR=1983, } @BOOK{Flin83:Data, AUTHOR="D. C. Flint", TITLE="The Data Ring Main - An Introduction to Local Area Networks", PUBLISHER="John Wiley", YEAR=1983, } @BOOK{Gee83:Local, AUTHOR="K. Gee", TITLE="Introduction to Local Area Computer Networks", PUBLISHER="Macmillan", ADDRESS="London", YEAR=1983, } @BOOK{Gold83:Smalltalk, AUTHOR="A. Goldberg and D. Robson", TITLE="Smalltalk-80: The Language and its Implementation", PUBLISHER="Addison-Wesley", YEAR=1983, } @BOOK{Habe83:ADA, AUTHOR="A. N. Habermann and D. E. Perry", TITLE="{ADA} for Experienced Programmers", ISBN="0-201-11481-X", PUBLISHER="Addison Wesley", YEAR=1983, } @ARTICLE{Korf83:Intelligent, AUTHOR="D. Korf and M. Largo", TITLE="Intelligent hardware meets the demand for network performance", JOURNAL="Computer Technology Review", PAGES="365-369", MONTH="Summer", YEAR=1983, } @INPROCEEDINGS{Lloy83:Transport, AUTHOR="P. J. Lloyd and Randolph E. Cole", TITLE="Transport Protocol Performance over Concatenated Local Area and Satellite Networks", BOOKTITLE="Conference on Data Networks with Satellites, Cologne", EDITOR="J-L Grange", PUBLISHER="North-Holland", PAGES="353-367", YEAR=1983, KEYWORDS="performance satellite LAN", } @ARTICLE{Ritt83:Doanostic, AUTHOR="R. R. Ritts", TITLE="Network Doanostic and control play vital role in large-scale networks", JOURNAL="Computer Technology Review", PAGES="347-352", MONTH="Summer", YEAR=1983, } @ARTICLE{Alek83:Emergent, AUTHOR="I Aleksander", TITLE="Emergent intelligent properties of progresively structured recognition nets", JOURNAL="PRL", VOLUME=1, PAGES="375-384", YEAR=1983, ABSTRACT="The n-tuple recognition net is seen as a building brick of a progression of network structures. the emergent intelligent properties of such systems are discussed. They include the amplification of confidence for the recognition of images that differ in small detail, a short term memory of the last seen image, sequence sensitivity, sequence acceptance and saccadic inspection as an aid in scene analysis.", } @ARTICLE{Bart83:Neuronlike, AUTHOR="A. G. Barto and R. S. Sutton and C. W. Anderson", TITLE="Neuronlike adaptive elements that can solve difficult learning control problems", JOURNAL=ieeesmc, VOLUME="SMC-13", PAGES="834-846", YEAR=1983, ABSTRACT="It is shown how a system consisting of 2 neuronlike adaptive elements can solve a difficult learning control problem. The task is to balance a pole that is hinged to a movable cart by applying forces to the carts base. It is assumed that the equations of motion of the cart-pole system are not known and that the only feedback evaluating performance is a failure signal that occurs when the pole falls past a certain angle from the vertical, or the cart reaches an end of the track. Adaptive control, adaptive networks, associative search elememts, adaptive critic element.", } @TECHREPORT{Cann83:Finding, AUTHOR="F. J. Canny", TITLE="Finding edges and lines in images", TYPE="technical report", INSTITUTION="MIT AI Lab", NUMBER=720, YEAR=1983, } @ARTICLE{Chen83:Segmentation, AUTHOR="Pi-Chun Chen and T. Pavlidis", TITLE="Segmentation by texture using correlation", JOURNAL=ieeepami, VOLUME="5 (1)", PAGES="64-69", YEAR=1983, ABSTRACT="The correlation coefficients are used for segmentation according to texture. They are first evaluated on a set of square regions forming 2 levels of the quadratic picture tree (or pyramid). If the coefficients of a square and its 4 children in the tree are similar, then that region is considered to be of uniform texture. If not it is replaced by its children. In this way the split-and-merge algorithm is used to achieve a priliminary segmentation. It is followed by a grouping algorithm using the correlation coefficients and the region adjacency graph, plus a small region elimination step. The latter regions are grouped according to their grey level because texture can not be defined reliably on very small regions. Examples of implementation on 4 pictures are included.", } @ARTICLE{Cong8312:Assessing, AUTHOR="R. G. Congalton and R. G. Oderwald and R. A. Mead", TITLE="Assessing Landsat classification accuracy using discrete multivariate statistical techniques", JOURNAL="Photogrametric Engineering and Remote Sensing", VOLUME=49, NUMBER=12, PAGES="1671-1678", YEAR=1983, } @ARTICLE{Coop8303:Multiple, AUTHOR="D. B. Cooper and F. P. Sung", TITLE="Multiple-window parallel adaptive boundary finding in computer vision", JOURNAL=ieeepami, VOLUME=5, NUMBER=3, PAGES="299-316", YEAR=1983, ABSTRACT="The problem considered in this paper is the estimation of highly variable object boundaries in noisy images. Boundaries may be those of a tank in an IR image, a spinal canal in a CAT scan, a cloud in a visible light image, etc. Or they may be internal to an object such as the boundary between a spherical surface and a cylindrical surface in a manufactured object. The focus of the paper is on parallel multi-window boundary estimation algorithms. Here the image field is partitioned into an array of rectangular windows, and boundary finders are run simultaneously within the windows. The boundary segments found within the windows are then seamed together to obtain meaningful global boundaries. The entire procedure is treated within a maximum likelihood estimation framework that has been developed for boundary finding. Although our multiple window estimation approach can be used with a number of local boundary finding algorithms, we concentrate on one that is based on dynamic programming and will produce the true maximum likelihood boundary. Some theoretical considerations for boundary model design and boundary finding run time are covered. Included is the use of a low computational cost $F$-test for testing whether a window contains a boundary, and an analytical treatment which shows that use of coarse pixels with a chi square test or a $F$ test impoves the probability of correctly recognising whether a boundary is present in a window.", } @ARTICLE{Fair8301:Segmenting, AUTHOR="J. Fairfield", TITLE="Segmenting dot patterns by voronoi concavity", JOURNAL=ieeepami, VOLUME=5, NUMBER=1, PAGES="104-110", YEAR=1983, } @ARTICLE{Feiv8301:Classification, AUTHOR="A. H. Feiveson", TITLE="Classification by Thresholding", JOURNAL=ieeepami, VOLUME=5, NUMBER=1, PAGES="48-54", YEAR=1983, ABSTRACT="A procedure is given which substantially reduces the processing time needed to perform maximum likelihood classification on large data sets. The given method uses a set of fixed thresholds, which, if exceeded by one probability density function, makes it unecessary to evaluate a competing density function. Proves are given of the existance and optimality of these thresholds for the class of contiunuous, unimodal and quasi-concave density functions (which includes the multivariate normal) and a method for computing the thresholds is provided for the specific case of multivariate normal densities. An example with remote sensing data consisting of some 20,000 observations of 4D data from 9 ground cover classes shows that by using thresholds one could cut the processing time almost in half.", } @ARTICLE{Fuku8305:Neocognitron, AUTHOR="K. Fukushima and S. Miyake and I. Takaguki", TITLE="Neocognitron: a neural network model for a mechanism of visual pattern recognition", JOURNAL=ieeesmc, VOLUME=13, NUMBER=5, PAGES="826-834", YEAR=1983, } @ARTICLE{Hara83:Interpretation, AUTHOR="R. M. Haralick", TITLE="An interpretation for probabilistic relaxation", JOURNAL="CVGIP", VOLUME=22, PAGES="388-395", YEAR=1983, ABSTRACT="Probabilistic relaxation has been the basis of one of the popular cooperative processing mechanisms used in image analysis. It has been a mechanism whose theory has not been well understood. In this paper, some general conditional independence conditions are stated which give probabilistic relaxation the interpretation that each iteration computes the conditional probability of each local label given a new context which is the context of the previous iteration enlarged by one neighbourhood width. This interpretation implies that relaxation iterations must only continue until the conditional independence assumptions no longer hold or until the entire context is taken into account, whichever comes first.", } @ARTICLE{Hara8304:Decision, AUTHOR="R. M. Haralick", TITLE="Decision making in context", JOURNAL=ieeepami, VOLUME=5, NUMBER=4, PAGES="417-428", YEAR=1983, } @ARTICLE{Hill8303:Signal, AUTHOR="W. J. Hill and L. Norton-Wayne and L. Finkelstein", TITLE="Signal processing for automatic optical surface inspection of steel strip", JOURNAL="Transactions Institute Marie Curie", VOLUME=5, NUMBER=3, PAGES="137-154", YEAR=1983, ABSTRACT="This paper reports on a continuing collaborative research project involving the Instrument Systems Centre (now the Measurement and Instrumentation Centre) of the City University, the British Steel Corporation and the Sira Institute and concerned with automatic optical surface inspection for cold rolled steel strip. The steel surface is interrogated by a high speed laser-scanning system and the resulting multi-channel response signal is processed to achieve detection, delineation (ie boundary extraction), and identification (by type) of significant surface defects. Processing is organised in a hierarchy, using multiple matched filters and modified image processing operations for detection and delineation, and the techniques of automatic pattern recognition for identification. Extensive studies in computer simulation are described for the development and evaluation of this processing system. The resulting structure is relevant to many similar problems of plain surface inspection.", } @INPROCEEDINGS{Holl83:Escaping, AUTHOR="J. H. Holland", TITLE="Escaping brittleness", BOOKTITLE="2nd International Workshop on Machine Learning", PAGES="92-95", YEAR=1983, ABSTRACT="Expert systems are powerful when working within the domain-specific boundaries of the initial design. It is widely agreed that the usefullness of such systems would be greatky enhanced if they could be made more versatile or less brittle - tolerant of changes in the domain and underlying model. This paper suggests 7 criteria for escaping brittleness (combination, parallelism, declarative and procedural information, categorization, synchronic and diachronic pointing, gracefulness and confirmation) and gives an example of a class of general purpose systems, classifier systems, that attempt to meet these criteria.", } @ARTICLE{Kirk83:Optimisation, AUTHOR="S. Kirkpatrick and C. D. Gelatt and M. P. Vecchi", TITLE="Optimisation by simulated annealing", JOURNAL="Science", VOLUME=220, PAGES="671-680", YEAR=1983, ABSTRACT="There is a deep and useful connection between statistical mechanics (the behaviour of systems with many degrees of freedom in thermal equilibria at a finite temperature) and multivariate or combinatorial optimisation (finding the minimum of a given function depending on many parameters). A detailed analogy with annealing in solids provides a framework for optimisation of the properties of very large and complex systems. The connection to statistical mechanics exposes new information and provides an unfamiliar perspective on traditional optimisation problems and methods.", } @ARTICLE{Knut8303:Anisotropic, AUTHOR="H. E. Knutsson and R. J. Wilson and G. H. Granlund", TITLE="Anisotropic nonstationary image estimation and its applications: part 1 - restoration of noisy images", JOURNAL=ieeecom, VOLUME=31, NUMBER=3, PAGES="388-397", YEAR=1983, ABSTRACT="A new form of image estimator, which takes account of linear features, is derived using a signal equivalent formulation. The estimator is shown to be a nonstationary linear combination of 3 stationary estimators. The relation of the estimator to human visual physiology is discussed. A method of estimating the nonstationary control information is described and shown to be effective when the estimation is made from noisy data. A suboptimal approach which is computationally less demanding is presented and used in the restoration of a variety of images corrupted by additive white noise. The results show the method can improve the quality of noisy images even when the signal to noise ratio is very low.", } @ARTICLE{Kurz8301:Optimal, AUTHOR="M. W. Kurzynski", TITLE="The optimal strategy of a tree classifier", JOURNAL=pattern, VOLUME=16, NUMBER=1, PAGES="81-87", YEAR=1983, } @ARTICLE{Mich83:Theory, AUTHOR="R. S. Michalski", TITLE="A theory and methodology of inductive learning", JOURNAL=ai, VOLUME=20, PAGES="111-161", YEAR=1983, ABSTRACT="The presented theory views inductive learning as a heuristic search through a space of symbolic descriptions, generated by an application of various inference rules to the initial observational statements. The inference rules include generalization rules, which perform generalizing transformations on descriptions, and conventional truth-preserving deductive rules. The application of the inference rules to descriptions is constrained by problem background knowledge, and guided by criteria evaluating the 'quality' of generated inductive assertions. Based on this theory, a general methodology for learning structural descriptions from examples, called STAR, is desribed and illustrated by a problem from the area of conceptual data analysis.", } @INPROCEEDINGS{Moon83:Potential, AUTHOR="W. Mooneyham", TITLE="The potential of exper systems for remote sensing", BOOKTITLE="17th international symposium on remote sensing of the environment", ADDRESS="Ann Arbor, Michigan.", PAGES="51-64", YEAR=1983, } @INPROCEEDINGS{Pett83:Genetic, AUTHOR="E. Pettit and K. M. Swigger", TITLE="An analysis of genetic based pattern tracking and cognitive based component tracking models of adaptation", BOOKTITLE="National Conference on AI AAAI", PAGES="327-332", YEAR=1983, ABSTRACT="The objective of this study was a comparison of the effectiveness in adapting to an environment of populations of structures undergoing modification by 4 different models: 1 Hollands genetic operator model 2 A cognitive (statistical predictive) model 3 a random point mutation model 4 a control (non altered) model.", } @ARTICLE{Piet8303:Experiments, AUTHOR="M. Pietikainen and A Rosenfeld and L. Davis", TITLE="Experiments with texture classification using averages of local pattern matches", JOURNAL=ieeesmc, VOLUME=13, NUMBER=3, PAGES="421-426", YEAR=1983, ABSTRACT="Laws has introduced a class of texture features based on average degrees of match of the pixel neighbourhoods with a set of standard masks. This features yield better texture classification than standard features based on pairs of pixels. Simplifications of these features are investigated. Their performance is not greatly effected by their exact form and also appears to remain the same if only local maxima are used. An alternative definition of such features is also presented, based on sums and differences of Gaussian convolutions.", } @ARTICLE{Qing8306:Method, AUTHOR="S. Qing-Yung and K S Fu", TITLE="A method for the design of binary tree classifiers", JOURNAL=pattern, VOLUME=16, NUMBER=6, PAGES="593-603", YEAR=1983, } @INPROCEEDINGS{Rend83:Doubly, AUTHOR="L. A. Rendell", TITLE="A doubly layered genetic penetrance learning system", BOOKTITLE="National Conference on AI AAAI", PAGES="343-347", YEAR=1983, ABSTRACT="The authors original state space learning system (based on a probabilistic performance measure clustered in feature space) was effective in optimising parameterised linear evaluation functions. However, more accurate probability estimates would allow stabalisation in cases of strong feature interactions. To attain this accuracy and stability, a second level of learning is added, a genetic (parallel) algorithm which supervises multiple activations of the original system. This scheme is aided by the probability clusters themselves. These structures are intermediate between the detailed performance statistics and the more general heuristic, and they estimate an absolute quantity independent of one another. Consequently the system allows both predit localisation at this mediating level of knowledge and feature interaction at the derived heuristic level. Early experimental results have been encouraging as predicted by the analysis, stability is very good.", } @INCOLLECTION{Reyn83:Automatic, AUTHOR="D. E. Reynolds", TITLE="Automatic Segmentation", BOOKTITLE="Cellular Logic Image Processing", EDITOR="M. J. B. and T. J. Duff", PUBLISHER="Academic Press", YEAR=1983, ABSTRACT={An interactive system for producing an image processing subroutine for the CLIP4. The user is quized about the size, contrast etc of the {"}objects{"} he wishes to segment and the system tries out simple operations - threshold, low/high pass filters etc and asks for a score from the user.}, } @ARTICLE{Riss8305:Universal, AUTHOR="J. Rissanen", TITLE="A universal data compression system", JOURNAL=ieeeit, VOLUME=29, NUMBER=5, PAGES="656-664", YEAR=1983, ABSTRACT={A universal data compression algorithm is described which is capable of compressing long strings generated by a {"}finitely generated{"} source, with a near optimum per symbol length without prior knowledge of the source. This class of sources may be viewed as a generalisation of Markov sources to random fields. Moreover the algorithm does not require a working storage much larger than that needed to describe the source generating parameters.}, } @INPROCEEDINGS{Shep83:Appraisal, AUTHOR="B. A. Shepherd", TITLE="An appraisal of a decision-tree approach to image classification", BOOKTITLE="8th International Joint Conference on Artificial Intelligence", PAGES="473-475", YEAR=1983, ABSTRACT="This paper investigates the applicability to a shape recognition problem of a concept learning algorithm which generates decision rules from examples. A comprehensive analysis of this algorithm applied to an industrial vision problem is described. This problem has no obvious best solution and much effort has been devoted to performing a realistic apraisal of the algorithm by making a detailed set of comparisons with the performances of appropriate alternative classifiers. Results presented show the algorithm to be comparable in performance with the alternative classufiers but superior in terms of both the cost of making a classification and also the intelligibilty of the solution.", } @INCOLLECTION{Smit83:Adaptive, AUTHOR="Stephen Leslie Smith", TITLE="Adaptive learning systems", BOOKTITLE="Expert Systems - principles and case studies", EDITOR="R Forsyth", PUBLISHER="Chapman and Hall", PAGES="169-189", YEAR=1983, } @INPROCEEDINGS{Smit83:Flexible, AUTHOR="Stephen Leslie Smith", TITLE="Flexible learning of problem solving heuristics through adaptive search", BOOKTITLE="8th International Joint Conference on Artificial Intelligence", PAGES="422-425", YEAR=1983, ABSTRACT="Noting that the methods employed by existing learning systems are often bound to the intended task domain and have little applicability outside that domain, this paper considers an alternative learning system design that offers greater flexibility without sacificing performance. An operational prototype constructed around a powerful adaptive search technique (genetic algorithm) is presented and applied to the problem of acquiring problem solving heuristics through experience. Some performance results obtained with the system in a poker betting domain ar reported and compared with those of a previously reported learning system in the same domain. It is seen that comparable levels of performance are achieved by the two systems, despite the latters dependence on a considerable amount of domain specific knowledge for effective operation.", } @ARTICLE{Ther83:Estimation, AUTHOR="C. W. Therrien", TITLE="An estimation-theoretic approach to terrain image segmentation", JOURNAL="CVGIP", VOLUME=22, PAGES="313-326", YEAR=1983, ABSTRACT="A method for modelling images of natural terrain is developed and applied to the segmentation of aerial photographic data. An underlying stochastic process based on linear filtering concepts provide a means of modelling the terrain in local areas of the image. Superimposed on this is a MRF that describes transitions from regions of one terrain type to another. Maximum likelihood and MRP are applied to estimate regions of similar terrain. Results of application to digitised aerial photography are presented and discussed.", } @INPROCEEDINGS{Tinn83:Applications, AUTHOR="L. R. Tinney and C. Sailer and J. E. Estes", TITLE="Applications of artificial intelligence to remote sensing", BOOKTITLE="17th International Symposium on Remote Sensing of Environment", PAGES="255-269", YEAR=1983, } @ARTICLE{Yu8301:Recursive, AUTHOR="T. S. Yu and K S Fu", TITLE="Recursive contextual classification using a spatial stochastic model", JOURNAL=pattern, VOLUME=16, NUMBER=1, PAGES="89-108", YEAR=1983, } @PHDTHESIS{Mosz83:Reasoning, AUTHOR="B. Moszkowski", TITLE="Reasoning about digital circuits", TYPE="Ph.{D}. Thesis", SCHOOL="Stanford Univ.", YEAR=1983, } @BOOK{Pete83:Operating, AUTHOR="James L. Peterson and Avi Silberschatz", TITLE="Operating System Principles", ISBN="0-201-06097-3", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1983, KEYWORDS="operating systems; survey", } @BOOK{Saat83:Elements, AUTHOR="T. L. Saaty", TITLE="Elements of Queueing Theory", PUBLISHER="Dover Publications (originally published by McGraw-Hill)", ADDRESS="New York, New York", YEAR=1983, } @BOOK{Bril83:Introduction, AUTHOR="Bruce E. Briley", TITLE="Introduction to Telephone Switching", ISBN="0-201-11246-9", PUBLISHER="Addison-Wesley", ADDRESS="London", YEAR=1983, KEYWORDS="telephony; switching; central office; POTS", } @ARTICLE{Allc83:Synchronization, AUTHOR="J. E. Allchin and M. S. McKendry", TITLE="Synchronization and Recovery of Actions", JOURNAL="PODC", YEAR=1983, KEYWORDS="Clouds", ABSTRACT="Reduced Consistency. Serializability.", } @BOOK{Ross83:Stochastic, AUTHOR="S. M. Ross", TITLE="Introduction to Stochastic Dynamic Programming", PUBLISHER="Academic Press", YEAR=1983, } @ARTICLE{Powe8303:Use, AUTHOR="L. R. Power", TITLE="Design and Use of a Program Execution Analyzer", JOURNAL=ibmsj, VOLUME=22, NUMBER=3, PAGES="271-294", YEAR=1983, } @ARTICLE{Mart8306:UNIX, AUTHOR="Rudolf Marty", TITLE="{UNIX} - Eine Einführung für den professionellen Software-Entwickler", JOURNAL=infspec, NUMBER=6, YEAR=1983, LANGUAGE="German", REFERENCES=13, ABSTRACT="UNIX is a portable timesharing operating system. Its main features are a hierachical file system, compatible file, device, and interprocess i/o, a powerful yet simple to use command interpreter, and a large variety of utilities. This paper is an introduction to the concepts of UNIX addressed to experienced EDP proffesionals who might be interested in UNIX as an implementation tool for substantial software projects as office automation, CAD/CAM, communication software, application software, etc.", } @ARTICLE{Rich8306:Netzmodelle, AUTHOR="Gernot Richter", TITLE="Netzmodelle für die Bürokommunikation", JOURNAL=infspec, NUMBER=6, YEAR=1983, LANGUAGE="German", REFERENCES=15, ABSTRACT="Distribution of tasks and highly structured information objects are among the most outstanding features of office work. In order to allow for a correct and adequate representation of these features on various levels of abstraction and precision it is proposed to partition an office system conceptually into state-oriented and process-oriented functional units. This is done in terms of high-level Petri nets with individual tokens, in this paper in terms of predicate/transition-nets (PrT-nets) with a formal inscription tailored to information structuring needs which are found in office systems. Developing step by step a simple office system, the basic concepts are outlined and the way is shown in which the tools that are based on these concepts are applied in system design pratice.", } @BOOK{Pool83:Forecasting, AUTHOR="Ithiel de Sola Pool", TITLE="Forecasting the Telephone: A Retrospective Technology Assessment of the Telephone", PUBLISHER="Ablex", ADDRESS="Norwood, New Jersey", YEAR=1983, KEYWORDS="social impact; telephone; history", } @ARTICLE{Padm8312:Classs, AUTHOR="K. Padmanabhan and D. H. Lawrie", TITLE="A Classs of Redundant Path Multistage Interconnection Networks", JOURNAL=ieeetc, VOLUME=32, NUMBER=12, PAGES="1099-1108", YEAR=1983, KEYWORDS="fault tolerance; omega; multipath", } @BOOK{Mand83:Fractal, AUTHOR="Benoit B. Mandelbrot", TITLE="The Fractal Geometry of Nature", PUBLISHER="W. H. Freedman and Co.", ADDRESS="New York", YEAR=1983, } @ARTICLE{Hfle8304:Bedingte, AUTHOR="U. Höfle", TITLE="Die bedingte Lebenserwartung. Ein Beitrag zur Zuverlässigkeitstheorie technischer Systeme mit nichtkonstanten Ausfallraten", JOURNAL=ntzarchiv, ADDRESS="Germany", VOLUME=5, NUMBER=4, PAGES="119-126", YEAR=1983, LANGUAGE="German", REFERENCES=4, KEYWORDS="Mean lifetime; failure; reliability", } @INPROCEEDINGS{Akim83:Optimum, AUTHOR="H. Akimaru and H. Takahashi and T. Ikeda", TITLE="Optimum design of alternative routing systems with constrained individual call losses", BOOKTITLE="10th international teletraffic congress", ADDRESS="Montreal, Canada", VOLUME="Sess.4.3b", PAGES="1-7", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Arth83:Distributed, AUTHOR="E. Arthurs and B. W. Stuck", TITLE="Distributed access workload performance sensitivity", BOOKTITLE="10th international teletraffic congress", ADDRESS="Montreal, Canada", VOLUME="Sess.3.1/2", PAGES="1-4", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Asko83:Suboptimal, AUTHOR="P. Asko", TITLE="The suboptimal alternate routing practice with non-coincident busyhours", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="2.2.1-5", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Bass83:Two, AUTHOR="L. A. Bassalygo and V. I. Neiman", TITLE="On two control algorithms for rearrangeable switching networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", VOLUME="paper 7", PAGES="1-7 (5.1)", YEAR=1983, KEYWORDS="Link system", } @INPROCEEDINGS{Basu83:Real, AUTHOR="K. K. Basu and G. Glenn and O. Avellaneda and N. Mactavish", TITLE="A real-time simulator for performance evaluation and overload control design of an {SPC} system", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="5.2.9.1-7", YEAR=1983, KEYWORDS="Control; overload control", } @INPROCEEDINGS{Beck83:Killer, AUTHOR="S. Becker and M. Herzberg", TITLE="'Killer Routes' and 'Killer Numbers' in telephone networks", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="2.2.7.1-6", YEAR=1983, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Bolo83:Bell, AUTHOR="V. A. Bolotin and J. G. Kappel", TITLE="Bell system traffic usage by class of service", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", PAGES="2.4.1-7", YEAR=1983, KEYWORDS="Measurement", } @ARTICLE{Bono8301:Three, AUTHOR="E. Bonomi and J.-L. Lutton and M. R. Feix", TITLE="Three-Stage Rearrangeable Connexting Networks in the ThermodynamicLimit: Number of Needed Reswitchings", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=1, YEAR=1983, KEYWORDS="Link system", } @INPROCEEDINGS{Boye83:Performances, AUTHOR="P. Boyer and A. Dupuis and J.-M. Pitie and L. Romoeuf", TITLE="Evaluation des performances de l'anneau ambre traffic evaluation of ambre: A multiservices local network", BOOKTITLE="10th international teletraffic congress", ADDRESS="Montreal, Canada", VOLUME="Sess.3.1", PAGES="1-12", YEAR=1983, LANGUAGE="French", KEYWORDS="Overload control; flow control; communication network", } @ARTICLE{Ahre8302:Algorithm, AUTHOR="J. Ahrens and K. D. Kohrt and U. Dieter", TITLE="Algorithm 599: Sampling from gamma and Poisson distributions", JOURNAL=tomacs, VOLUME=9, NUMBER=2, PAGES="255-257", YEAR=1983, KEYWORDS="Rvg", } @INCOLLECTION{Hord83:Networks, AUTHOR="A. Hordijk and N. van Dijk", TITLE="Networks of queues", BOOKTITLE="Lecture Notes in Control and Information Sciences Modelling and Performance Evaluation Methodology", PUBLISHER="Springer-Verlag", ADDRESS="Germany", VOLUME=60, PAGES="151-205", YEAR=1983, KEYWORDS="Queueing network; analysis", } @TECHREPORT{MacN83:Research, AUTHOR="E. A. MacNair and C. H. Sauer", TITLE="The Research Queueing Package: A Primer", TYPE="Research Report", INSTITUTION="IBM", ADDRESS="Yorktown Heights, USA", PAGES="1-12", YEAR=1983, KEYWORDS="Computer tool; performance evaluation", } @ARTICLE{Ackr8302:C, AUTHOR="M. H. Ackroyd and C. M. Chie", TITLE={{C.M.} Chie: Comments on {"M/M/1} Transient State Occupancy Probabilities via the Discrete Fourier Transforms". Martin {H.} Ackroyd: Authors Reply}, JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=2, PAGES="289-290", YEAR=1983, KEYWORDS="M/m/1; dft", } @ARTICLE{Akim83:Truncated, AUTHOR="H. Akimaru and H. Takahashi and T. Nishimura", TITLE="Truncated Error of Asymptotic Expansion for {Erlang} Loss Function", JOURNAL="The Transactions of the IECE of Japan", ADDRESS="Japan", VOLUME="E 66", NUMBER=7, PAGES="450-452", YEAR=1983, KEYWORDS="numerical method", } @ARTICLE{Alm83:Distribution, AUTHOR="S. E. Alm", TITLE="On the distribution of the Scan Statistic of a Poisson Process", EDITOR="Allan Gut and Lars Holst", JOURNAL="Probability and Mathematical Statistics", PAGES="1-10", NOTE="Essays in honour of Carl-Gustav Esseen", YEAR=1983, KEYWORDS="Poisson process; time series analysis; scanning principle", } @ARTICLE{Alti83:Allocation, AUTHOR="T. Altiok and S. Stidham", TITLE="The Allocation of Interstage Buffer Capacities in Production Lines", JOURNAL="IIE Transactions", VOLUME=15, NUMBER=4, PAGES="292-299", YEAR=1983, KEYWORDS="Allocation; production system; buffer; buffer dimensioning", } @ARTICLE{Arnd83:Importance, AUTHOR="K. Arndt and B. M. Kirstein", TITLE="An Importance Ranking for Components of Highly Reliable Systems", JOURNAL=eik, VOLUME=19, NUMBER="10-11", PAGES="535-545", YEAR=1983, KEYWORDS="Reliability", } @ARTICLE{Bakm8306:Procedure, AUTHOR="M. Bakmaz", TITLE="A Procedure for Optimal Dimensioning of Trunk Groups While Serving Two Traffic Loads with Different Grade of Service", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=6, PAGES="794-799", YEAR=1983, KEYWORDS="Traffic engineering; traffic load; gos", } @INCOLLECTION{Bart83:Mixed, AUTHOR="D. J. Bartholomew", TITLE="The Mixed Exponential Distribution", BOOKTITLE="Contributions to Statistics Essays in Honour of Norman L. Johnson", EDITOR="P. K. Sen", PUBLISHER="North-Holland", ADDRESS="Netherlands", PAGES="17-25", YEAR=1983, KEYWORDS="Error rate", ABSTRACT="Hazard rate", } @ARTICLE{Baue83:Verfahren, AUTHOR="F. L. Bauer", TITLE="Das d'Hondtsche Verfahren", JOURNAL="Informatik-Spektrum", PUBLISHER="Springer-Verlag", ADDRESS="Germany", VOLUME=6, PAGES="165-167", YEAR=1983, LANGUAGE="German", KEYWORDS="Analytical model; mathematical method", } @TECHREPORT{Berm83:Graphs, AUTHOR="J. C. Bermond and J. Bond and M. Paoli and C. Peyrat", TITLE="Graphs and Interconnection Networks: Diameter and Vulnerability", INSTITUTION="Univ. de Paris-Sud, Centre d'Orsay, Lab. de Recherche en Inf.", NUMBER=124, PAGES=30, YEAR=1983, KEYWORDS="Graph model; interconnection network", } @INPROCEEDINGS{Berr83:Spectrum, AUTHOR="L. T. M. Berry and D. H. Cronin", TITLE="The Spectrum Cost of Frequency-Distance Separation Rules", BOOKTITLE="IEEE International Symposium on Electromagnetic Compatibility Record", YEAR=1983, KEYWORDS="frequency distribution", } @TECHREPORT{Berr83:Telecommunications, AUTHOR="L. T. M. Berry", TITLE={Telecommunications Paradoxes or "Hocus Pocus"}, INSTITUTION="Applied Mathematics Department, University of Adelaide", PAGES=11, YEAR=1983, KEYWORDS="Communication", } @ARTICLE{Berr8302:Note, AUTHOR="L. T. M. Berry", TITLE="A Note on the Chain Flow Model and Arbitrary Assignment", JOURNAL=atr, ADDRESS="Australia", VOLUME=14, NUMBER=2, PAGES="9-42", YEAR=1983, KEYWORDS="Model; method; alternate routing; cost; minimization; network", ABSTRACT="This paper comments on an assumption of the chain flow model - a method proposed for the minimum cost design of alternative routing telephone networks, subject to specified overall traffic congestions between pairs of exchanges in the network.", } @ARTICLE{Boxm8302:Response, AUTHOR="O. J. Boxma", TITLE="Response Time Distributions in Cyclic Queues", JOURNAL="Bulletin of the International Statistical Institute", VOLUME="L", NUMBER=2, PAGES="735-754", YEAR=1983, KEYWORDS="Response time; queueing system; queueing discipline; cycliC service", } @ARTICLE{Boye83:Relations, AUTHOR="P. Boyer and Gérard Hebuterne", TITLE="Relations de Conservation pour une File d'Attente avec des Clients Impatients", JOURNAL=atele, VOLUME=38, NUMBER="5-6", PAGES="226-230", YEAR=1983, KEYWORDS="Impatient customer", } @ARTICLE{Bran83:Continuity, AUTHOR="A. Brandt and B. Lisek", TITLE="On the Continuity of G/GI/m Queues", JOURNAL="Mathematische Operationsforschung Statistik, Serie Statistik", VOLUME=14, NUMBER=4, PAGES="577-587", YEAR=1983, KEYWORDS="GI/GI/N; Continuous Time Process", } @ARTICLE{Bray8311:Adaptive, AUTHOR="Kenneth Brayer", TITLE="An Adaptive Communications Network Designed with Decentralized Control", JOURNAL=ieeecm, VOLUME=21, NUMBER=11, PAGES="30-35", YEAR=1983, REFERENCES=8, KEYWORDS="Decentralized Control; Communication Network", } @ARTICLE{Chak83:Reliability, AUTHOR="S. Chakravarthy", TITLE="Reliability Analysis of a parallel System with Exponential Life Times and Phase Type Repair", JOURNAL=ors, VOLUME=5, PAGES="25-32", YEAR=1983, KEYWORDS="Reliability; Repair", ABSTRACT="We consider a parallel system consisting of n identical components subject to failures. Failed components are repaired by a single repairman. Under the assumptions that the failure times are exponential and the repair times are of phase type, it is shown that the busy period of the repairman, the density of the number of components repaired during a busy period and the stationary down time of the system are also of phase", } @MISC{Chri83:Polling, AUTHOR="P. H. Christensen and A. Fischer-Madsen", TITLE="Performance Evaluation of Polling Systems", PAGES=23, YEAR=1983, KEYWORDS="Polling System; Performance Evaluation", } @ARTICLE{Coff83:Combinatorial, AUTHOR="E. G. Coffman", TITLE="An Introduction to Combinatorial Models of Dynamic Storage Allocation", JOURNAL="SIAM Review", VOLUME=25, NUMBER=3, PAGES="311-325", YEAR=1983, KEYWORDS="Buffer Management; Combinatorial Method", } @ARTICLE{Cono83:More, AUTHOR="B. W. Conolly", TITLE="More Transient Results for Generalised State-Dependent Erlangian Queues", JOURNAL=aap, VOLUME=15, PAGES="688-690", YEAR=1983, KEYWORDS="State Dependent Service; Erlang C Formula; Transient Analysis", } @ARTICLE{Cosm83:Increasing, AUTHOR="G. P. Cosmetatos", TITLE="Increasing Productivity in Exponential Queues by Server-sharing", JOURNAL=omega, VOLUME=11, NUMBER=2, PAGES="187-193", YEAR=1983, KEYWORDS="Shared Resource; Queueing System", ABSTRACT="This paper sets out to investigate the effects of productivity improvements on the operation of queueing systems, the most noticeable effect being a change in the quality of the service that is provided to customers. A bulk-service queueing model is developed and solved, in which the average service time per batch is assumed to increase with the batch size, and the implications for service quality are discussed. The analy", } @ARTICLE{Daik83:Optimal, AUTHOR="K. Daikoku and H. Ohdate", TITLE="Optimal Channel Reuse in Cellular Land Mobile Radio Systems", JOURNAL=ieeevt, VOLUME="VT-32", NUMBER=3, PAGES="217-224", YEAR=1983, KEYWORDS="Mobile Radio", } @ARTICLE{DeHe83:Teletraffic, AUTHOR="E. de Hert", TITLE="Teletraffic and management Science", JOURNAL="Revue Belge de Statistique, d'Informatique et de Recherche Opérationelle", ADDRESS="Belgium", VOLUME=23, NUMBER=1, PAGES="3-18", YEAR=1983, KEYWORDS="Network Management", } @ARTICLE{Delb83:Steady, AUTHOR="L. E. N. Delbrouck", TITLE="On the Steady-State Distribution in a Service Facility Carrying Mixtures of Traffic with Different Peakedness Factors and Capacity Requirements", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=11, PAGES="1209-1211", YEAR=1983, KEYWORDS="multiserver", ABSTRACT="A recursion formula is described. It is useful for calculating steady-state probabilities in a lost-call-cleared service facility carrying a mixture of message traffics with different peakedness factors and/or capacity requirements. In conjunction with the notion of equivalent trunk groups, these probabilities can then be used to evaluate the blocking probability perceived by each traffic stream.", } @ARTICLE{Delb83:Uses, AUTHOR="L. E. N. Delbrouck", TITLE="The Uses of Kosten's Systems in the Provisioning of Alternate Trunk Groups Carrying Heterogeneous Traffic", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=6, PAGES="741-749", YEAR=1983, KEYWORDS="multiserver", ABSTRACT="A functional recursive scheme is described and linked with the equivalent random theory to estimate heterogeneous call blocking probabilities and overflow variances in toll network trunk groups. It is then used to calculate exactly the call blocking probabilities in multidimensional Kosten overflow and Engset finite source models. Numerical examples are shown.", } @ARTICLE{Doub83:Strategic, AUTHOR="C. F. Doubleday and D. E. Probert and G. Walsham", TITLE="A Strategic Model of Communications Demand", JOURNAL=omega, VOLUME=11, NUMBER=4, PAGES="343-354", YEAR=1983, } @ARTICLE{Dubo83:Mathematical, AUTHOR="D. F. Dubois", TITLE="A mathematical model of a flexible manufacturing system with limited in-process inventory", JOURNAL=ejor, VOLUME=14, PAGES="66-78", YEAR=1983, KEYWORDS="queueing network", ABSTRACT="FMS", } @ARTICLE{Hord83:Adjoint, AUTHOR="A. Hordijk and N. van Dijk", TITLE="Adjoint Processes, Job Local Balance and Insensitivity for Stochastic networks", JOURNAL="Bulletin of the International Statistical Institute", PAGES="776-789", YEAR=1983, KEYWORDS="Stochastic network", } @ARTICLE{Faki83:Loss, AUTHOR="D. Fakinos", TITLE="The M/G/k Loss System with Servers Subject to Breakdown", JOURNAL=jap, VOLUME=20, PAGES="706-712", YEAR=1983, KEYWORDS="Erlang B formula; reliability", } @ARTICLE{Fisc8311:Model, AUTHOR="M. J. Fischer", TITLE="A Performance Model for Loss Systems with Crisis Calls", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=11, PAGES="1212-1216", YEAR=1983, KEYWORDS="Loss system; Performance Evaluation; Analysis; overload control", } @ARTICLE{Fole83:Moments, AUTHOR="R. D. Foley and M. Yadin", TITLE="On the Moments of the Cumulative Idle Time in an M/D/infinite Queue", JOURNAL=jap, VOLUME=20, PAGES="445-447", YEAR=1983, KEYWORDS="M/g/oo", } @ARTICLE{Fosc83:Sharing, AUTHOR="G. J. Foschini and B. Gopinath", TITLE="Sharing Memory Optimally", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=3, PAGES="352-360", YEAR=1983, KEYWORDS="multiserver", } @ARTICLE{Fuji83:Theoretical, AUTHOR="M. Fujiki and K. Kawashima", TITLE="Theoretical Analysis of Combined Delay and Delay Systems with Trunk Reservation", JOURNAL=recl, VOLUME=31, NUMBER=3, PAGES="410-418", YEAR=1983, KEYWORDS="Analysis; delay loss model; reservation; reservation system", } @INPROCEEDINGS{Gira83:Comparative, AUTHOR="Andre Girard and Y. Côté and Y. Quimet", TITLE="A Comparative Study of Non-hierarchical Alternate Routing", BOOKTITLE="2nd International Network Planning Symposium. IEE Conference Publication Number 215", PAGES="70-74", YEAR=1983, KEYWORDS="Communication Network; Routing; Comparison; Alternate Routing", } @ARTICLE{Gira8312:Dynamic, AUTHOR="Andre Girard and S. Hurtubise", TITLE="Dynamic Routing and Call Repacking in Circuit-Switched Networks", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=12, PAGES="1290-1294", YEAR=1983, KEYWORDS="Communication Network; Circuit Switching; Dynamic Routing; Routing; Rearrangement; Analysis", } @ARTICLE{Goto83:Nationwide, AUTHOR="T. Goto", TITLE="Nationwide Land Mobile Telephone Service Using New Tracking Exchange Technologies", JOURNAL=jtr, ADDRESS="Japan", VOLUME=25, NUMBER=4, PAGES="241-245", YEAR=1983, KEYWORDS="cellular system", } @ARTICLE{Gott83:Hotel, AUTHOR="G. Gottlieb and U. Yechiali", TITLE="The Hotel Overbooking Problem", JOURNAL=rairo, VOLUME=17, NUMBER=4, PAGES="343-355", YEAR=1983, KEYWORDS="reservation", } @ARTICLE{Hend83:Insensitivity, AUTHOR="W. Henderson", TITLE="Insensitivity and Reversed Markov Processes", JOURNAL=aap, VOLUME=15, PAGES="752-768", YEAR=1983, KEYWORDS="sensitivity analysis", ABSTRACT="Insensitivity", } @ARTICLE{Hoor83:SPP, AUTHOR="M. H. Hoorn and L. P. Seelen", TITLE="The {SPP/G/1} Queue: A Single Server Queue with a Switched Poisson Process as Input Process", JOURNAL=ors, VOLUME=5, PAGES="207-218", YEAR=1983, KEYWORDS="Spp", } @ARTICLE{Kata8303:Break, AUTHOR="T. Katayama", TITLE="Analysis of a Break-in Service Tandem Queue Attended by a Moving Server", JOURNAL=recl, ADDRESS="Japan", VOLUME=31, NUMBER=3, PAGES="430-438", YEAR=1983, KEYWORDS="Tandem queue", } @ARTICLE{Kata8303:Limiting, AUTHOR="T. Katayama", TITLE="Analysis of a Limiting Service Tandem Queue Attended by a Moving Server with Walking Time", JOURNAL=recl, ADDRESS="Japan", VOLUME=31, NUMBER=3, PAGES="439-446", YEAR=1983, KEYWORDS="Tandem queue", } @ARTICLE{Kawa8311:Comments, AUTHOR="K. Kawashima", TITLE={Comments on "Analysis of a Mobile Radio Communication System with Two Types of Customers and Priority"}, JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=11, PAGES="1255-1257", YEAR=1983, KEYWORDS="Mobile radio; priority", } @ARTICLE{Kies8305:New, AUTHOR="W. M. Kiesel and P. J. Kühn", TITLE="A New {CSMA-CD} Protocol for Local Area Networks with Dynamic Priorities and Low Collision Probability", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=5, PAGES="869-876", YEAR=1983, KEYWORDS="Lan; csma/cd", } @ARTICLE{Kimu8302:Diffusion, AUTHOR="Takumi Kimura", TITLE="Diffusion Approximation for an M/G/m Queue", JOURNAL=or, VOLUME=31, NUMBER=2, PAGES="304-321", YEAR=1983, KEYWORDS="M/G/N; diffusion approximation", } @ARTICLE{Komo8305:GI, AUTHOR="Y. Komota and Shinya Nogami and Y. Hoshiko", TITLE="Analysis of the {GI/G/1} Queue by the Supplementary Variables Approach", JOURNAL=ecij1, ADDRESS="Japan", VOLUME="66-A", NUMBER=5, PAGES="10-19", YEAR=1983, KEYWORDS="Gi/g/1", } @ARTICLE{Kulk83:Queueing, AUTHOR="V. G. Kulkarni", TITLE="On Queueing Systems with Retrials", JOURNAL=jap, VOLUME=20, PAGES="380-389", YEAR=1983, KEYWORDS="queueing system; call reattempt", ABSTRACT="Repeated order systems", } @ARTICLE{Laza8306:Dynamic, AUTHOR="Y. V. Lazarev and I. V. Nikiforova", TITLE="Dynamic Control under Conditions of Limited Carrying Capacity of the Switching Units", JOURNAL="Telecommunications and Radio Engineering", ADDRESS="SU", VOLUME=37, NUMBER=6, PAGES="7-9", YEAR=1983, KEYWORDS="Network planning", } @ARTICLE{Leer8304:Junction, AUTHOR="J. T. Leerdam and W. J. Oeveren", TITLE="Junction Networks in the Multi-Exchange Areas in Saudi Arabia", JOURNAL=ptr, ADDRESS="Netherlands", VOLUME=41, NUMBER=4, PAGES="292-299", YEAR=1983, KEYWORDS="Telephony", } @ARTICLE{Lnro83:Blocking, AUTHOR="A. Lönroth", TITLE="About the Blocking Probabilities in the {NMT-System}", JOURNAL="PTH", PAGES=5, YEAR=1983, KEYWORDS="cellular system; mobile radio", } @ARTICLE{Mars8304:Implementing, AUTHOR="K. Marse and S. D. Roberts", TITLE="Implementing a Portable {FORTRAN} Uniform (0,1) Generator", JOURNAL="Simulation", VOLUME=41, NUMBER=4, PAGES="135-139", YEAR=1983, KEYWORDS="RNG; Fortran", } @INPROCEEDINGS{Mars83:Experiences, AUTHOR="J. Marshall and B. R. Spiegelhalter", TITLE="Experiences with Net/One at British Telecom", BOOKTITLE="of Localnet (Europe)", ADDRESS="Northwood, Great Britain", PAGES="67-69", YEAR=1983, KEYWORDS="Lan", } @TECHREPORT{McCr83:Simple, AUTHOR="D. McCron", TITLE="A Simple Mathematical Model of a Microprocessor Based Polling System", INSTITUTION="Standard Telephones and Cables PLC, New Southgate, London, N11 1HB", ADDRESS="London, Great Britain", PAGES=9, YEAR=1983, KEYWORDS="Polling system", } @ARTICLE{Mela83:Randomization, AUTHOR="B. Melamed", TITLE="Randomization Procedures for Numerical Computation of Delay Time Distributions in Queueing Systems", JOURNAL="Bulletin of the International Statistical Institute", VOLUME="2L", PAGES="765-775", YEAR=1983, KEYWORDS="Queueing system; algorithm", } @ARTICLE{Minh83:Simulating, AUTHOR="Do Quang Minh and R. M. Sorli", TITLE="Simulating the {GI/G/1} Queue in Heavy Traffic", JOURNAL=or, VOLUME=31, PAGES="966-971", YEAR=1983, KEYWORDS="Simulation; queueing system; GI/G/1", } @ARTICLE{Miya8308:Derivation, AUTHOR="M. Miyazawa", TITLE="The Derivation of Invariance Relations in Complex Queueing Systems with Stationary Inputs", JOURNAL=aap, VOLUME=15, NUMBER=8, PAGES="874-885", YEAR=1983, KEYWORDS="Queueing system", } @TECHREPORT{Mort83:NMT, AUTHOR="E. T. Mortensen", TITLE="{NMT-Systemet:} Beregning af Afvisning", INSTITUTION="Notat. P\&T's Radiotekniske Tjeneste", PAGES=6, YEAR=1983, KEYWORDS="mobile radio", } @ARTICLE{Nare8305:Use, AUTHOR="K. S. Narendra and P. Mars", TITLE="The Use of Learning Algorithms in Telephone Traffic Routing - A Methodology", JOURNAL="Automatica", VOLUME=19, NUMBER=5, PAGES="495-502", YEAR=1983, KEYWORDS="Expert system; routing; telephony", } @ARTICLE{Nawi83:Note, AUTHOR="W. M. Nawijn", TITLE="A Note on Many-Server Queueing Systems with Ordered Entry, with an Application to Conveyor Theory", JOURNAL=jap, VOLUME=20, PAGES="144-152", YEAR=1983, KEYWORDS="utilization; conveyor; machine-repair-man model; server hunting strategy; server utilization; Palm's problem; sequential hunting; Ordered hunting", ABSTRACT="Consider a many-server queueing system in which the servers are numbered. If a customer arrives when two or more servers are idle he selects the server with lowest index (this is called the ordered entry selection rule). An explicit expression for the traffic handled by the various servers in a GI/M/s queueing system with ordered entry is derived.", } @TECHREPORT{Neut83:Could, AUTHOR="M. F. Neuts", TITLE="Could Probability and Statistics also be Experimental Sciences ?", INSTITUTION="Boletim Informativo de Estatistica e Investigacao Operational, INIC, Lisboa, Portugal, No 10-12", ADDRESS="Lisboa, Portugal", PAGES="2-6", YEAR=1983, KEYWORDS="Probability theory", } @ARTICLE{Niel83:Mand, AUTHOR="A. K. Nielsen", TITLE="Mand-maskine kommunikation ved hjælp af tale", JOURNAL="Teleteknik", ADDRESS="Denmark", VOLUME=3, PAGES="152-159", YEAR=1983, LANGUAGE="Danish", KEYWORDS="Man-machine interaction", } @ARTICLE{Nish8304:Operation, AUTHOR="T. Nishigaichi and T. Eto", TITLE="Operation Results on Economical Radio and Switching Equipment for Nation-wide Automobile Telephone Service", JOURNAL=jtr, ADDRESS="Japan", VOLUME=25, NUMBER=4, PAGES="265-269", YEAR=1983, KEYWORDS="Mat", } @ARTICLE{Noga8303:GI, AUTHOR="Shinya Nogami and Y. Komota and Y. Hoshiko", TITLE="Analysis of the {M/G/1} and {GI/M/1} Queueing Systems by the Supplementary Variable Approach", JOURNAL=ecij1, ADDRESS="Japan", VOLUME="66A", NUMBER=3, PAGES="14-23", YEAR=1983, KEYWORDS="M/g/1; g/m/1", } @ARTICLE{Oett8311:Cellular, AUTHOR="J. Oetting", TITLE="Cellular Mobile Radio - An Emerging Technology", JOURNAL=ieeecm, VOLUME=21, NUMBER=11, PAGES="10-15", YEAR=1983, KEYWORDS="Mobile radio", } @ARTICLE{Pevt83:Estimate, AUTHOR="N. V. Pevtsov", TITLE="An Estimate of the Effect of Subscriber Behaviour on the Load of a Long-distance Telephone Network", JOURNAL="Telecommunications \& Radio Engineering", ADDRESS="SU", VOLUME="37/38", PAGES="6-9", YEAR=1983, KEYWORDS="Traffic source model", } @TECHREPORT{Rama83:Remarks, AUTHOR="F. Ramalhoto", TITLE="Some Remarks on Statistical Problems in the Theory of Queues", INSTITUTION="Boletim Informativo de Estatistica E Investigacao Operacional, No 10-12", ADDRESS="Spain", VOLUME=10, PAGES="6-9", YEAR=1983, KEYWORDS="Queueing theory", } @ARTICLE{Rama83:J, AUTHOR="M. F. Ramalhoto and J. A. Amaral and M. T. Cochito", TITLE="A Survey of {J.} Little'e Formula", JOURNAL="International Statistical Review", VOLUME=51, PAGES="255-278", YEAR=1983, KEYWORDS="Little's formula", } @ARTICLE{Rayk8312:Inequalities, AUTHOR="T. Raykov and W. Warmuth", TITLE="Inequalities for Traffic Characteristics", JOURNAL=eik, VOLUME=19, NUMBER=12, PAGES="643-649", YEAR=1983, KEYWORDS="Queueing system; approximation", ABSTRACT="For general queueing systems with or without delay, under weak conditions inequalities for important characteristics of the system are proved (e.g. peakedness, variance of some discrete random numbers describing the behaviour of the system).", } @ARTICLE{Hsie8301:End, AUTHOR="W. Hsieh and B. Kraimeche", TITLE="Performance Analysis of an End-To-End Flow Control Mechanism In a Packet-Switched Network", JOURNAL=jtn, VOLUME=2, NUMBER=1, PAGES="103-116", YEAR=1983, KEYWORDS="Packet switching; end-to-end flow control; performance evaluation", ABSTRACT="The performance of a window-based end-to-end flow control mechanism for a transport layer connection in a packet-switched network is investigated in this paper. The transport connection is assumed yo operate under a group acknowledgement strategy, in which the acknowledgement and credit allocation are made on a one per several packet basis. The performance model presented in this paper takes into account both the source-d", } @ARTICLE{Rubi8305:Message, AUTHOR="I. Rubin and L. de Moraes", TITLE="Message Delay Analysis for Polling and Token Multiple-Access Schemes for Local Communication Networks", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=5, PAGES="935-947", YEAR=1983, KEYWORDS="LAN; token passing", } @ARTICLE{Sato8301:Application, AUTHOR="T. Sato and M. Mori", TITLE="An application of the Lumping Method to a Loss System with Two Types of Customers", JOURNAL=jorsj, ADDRESS="Japan", VOLUME=26, NUMBER=1, PAGES="51-59", YEAR=1983, KEYWORDS="Loss system", } @ARTICLE{Sche83:Computation, AUTHOR="H. Schellhaas", TITLE="Computation of the State Probabilities in {M/G/1} Queues with State Dependent Input and State Dependent Service", JOURNAL=ors, VOLUME=5, PAGES="223-228", YEAR=1983, KEYWORDS="M/g/1", } @INPROCEEDINGS{Schw83:Modeling, AUTHOR="M. Schwartz", TITLE="Modeling and Queueing Analysis in Communication Networks", BOOKTITLE=globecom, PAGES="10.2.1-6", MONTH="November/December", YEAR=1983, KEYWORDS="Norton's theorem", } @ARTICLE{Serg83:Optimum, AUTHOR="T. P. Sergeyeva", TITLE="The Optimum Organization of Transit Facilities for Channel Groups in Network Junctions by means of a computer", JOURNAL="Telecommunications and Radio Engineering", ADDRESS="SU", VOLUME="37/38", PAGES="57-61", YEAR=1983, KEYWORDS="Network planning", } @ARTICLE{Shar8304:Economical, AUTHOR="R. L. Sharma", TITLE="Design of an Economical Multidrop Network Topology with Capacity Constraints", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=4, PAGES="590-591", YEAR=1983, KEYWORDS="Network planning", } @ARTICLE{Shne83:Normalization, AUTHOR="M. Shneps-Shneppe and A. Ozols", TITLE="Normalization of the Load of Long-Distance Telephone channels Taking Re-dialling into Account", JOURNAL="Telecommunications and Radio Engineering", ADDRESS="SU", VOLUME="37/38", PAGES="9-12", YEAR=1983, KEYWORDS="Circuit switching; call reattempt; load balancing", } @ARTICLE{Skla8308:Structured, AUTHOR="B. Sklar", TITLE="A Structured Overview of Digital Communications - a Tutorial - Part 1", JOURNAL=ieeecm, VOLUME=21, NUMBER=8, PAGES="4-17", YEAR=1983, KEYWORDS="Communication network; survey", } @ARTICLE{Smet8306:Investigation, AUTHOR="L. D. Smetanin", TITLE="Investigation of a Method of Statistical Diagnosis of {ALTS} Facilities Based on Counters of the Number of Busy Calls", JOURNAL="Telecommunications and Radio Engineering", ADDRESS="SU", VOLUME=37, NUMBER=6, PAGES="15-21", YEAR=1983, KEYWORDS="Traffic engineering", } @ARTICLE{Stei8303:Application, AUTHOR="H. A. H. A. Steit and Geoffrey Smith", TITLE="Application of Some Rearrangement Algorithms to a {T-S-T} Network", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=3, PAGES="309-314", YEAR=1983, KEYWORDS="Switching network; architecture", } @ARTICLE{Step8306:Trunk, AUTHOR="S. N. Stepanov", TITLE="The Design of a Trunk Group Based on Repeated Calls and Waiting", JOURNAL="Telecommunications and Radio Engineering", ADDRESS="SU", VOLUME=37, NUMBER=6, PAGES="1-7", YEAR=1983, KEYWORDS="Network planning; call reattempt", } @ARTICLE{Suda8301:Integrated, AUTHOR="T. Suda and H. Miyahara and Toshiharu Hasegawa", TITLE="Performance Evaluation of an Integrated Access Scheme in a Satellite Communication Channel", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=1, PAGES="153-164", YEAR=1983, KEYWORDS="Satellite radio; access protocol; performance evaluation", ABSTRACT="JSAC", } @ARTICLE{Sund8307:Alternative, AUTHOR="C. E. Sundberg", TITLE="Alternative Cell Configurations for Digital Mobile Radio Systems", JOURNAL=bstj, VOLUME=62, NUMBER=7, PAGES="2037-2065", YEAR=1983, KEYWORDS="Mobile radio", } @TECHREPORT{Thom83:Grafteori, AUTHOR="C. Thomassen", TITLE="Grafteori - En Introduktion", INSTITUTION="Matematisk Institute, Danmarks tekniske Hojskole", ADDRESS="Lyngby, Denmark", NUMBER=114, PAGES=14, YEAR=1983, LANGUAGE="Danish", KEYWORDS="network planning; graph theory; tutorial", } @TECHREPORT{Tjur83:Det, AUTHOR="T. Tjur", TITLE="Det Sekventielle Paradoks: En Påmindelse om at Statistikkens Konventioner ikke er Naturlove", INSTITUTION="Institut for Matematisk Statistik, Kobenhavns Universitet", ADDRESS="Copenhagen, Denmark", PAGES=7, YEAR=1983, LANGUAGE="Danish", KEYWORDS="Statistics", } @ARTICLE{Tu8305:Convexity, AUTHOR="H.-Y. Tu and H. Kumin", TITLE="A Convexity Result for a Class of {GI/G/1} Queueing Systems", JOURNAL=or, VOLUME=31, NUMBER=5, PAGES="948-950", YEAR=1983, KEYWORDS="Gi/g/1", } @ARTICLE{Tuxe83:Nordic, AUTHOR="L. Tuxen", TITLE="The Nordic Mobile Telephone System", JOURNAL=ptr, VOLUME=41, NUMBER=1, PAGES="3-16", YEAR=1983, KEYWORDS="mobile radio", } @ARTICLE{Vain8304:Improved, AUTHOR="A. D. Vainshtein", TITLE="Improved Lower Bounds for Mean Characteristics of Ek/GI/m Queues", JOURNAL="Mathematische Operationsforschung und Statistik, serie optimization", VOLUME=14, NUMBER=4, PAGES="601-605", YEAR=1983, KEYWORDS="Queueing system; lower bound", } @ARTICLE{VanE8303:Random, AUTHOR="A. J. Van Es and R. D. Gill and C. Van Putten", TITLE="Random Number Generators for a Pocket Calculator", JOURNAL="Statistica neerlandica", ADDRESS="Netherlands", VOLUME=37, NUMBER=3, PAGES="95-102", YEAR=1983, KEYWORDS="Rng", } @ARTICLE{Vino8303:Approximating, AUTHOR="B. Vinod and T. Altiok", TITLE="Approximating Unreliable Queueing Networks Under the Assumption of Exponentiality", JOURNAL=jors, VOLUME=37, NUMBER=3, PAGES="309-316", YEAR=1983, KEYWORDS="Queueing network; reliability", } @ARTICLE{Walr8306:Probabilistic, AUTHOR="J. Walrand", TITLE="A Probabilistic Look at Networks of Quasi-Reversible Queues", JOURNAL=ieeeit, VOLUME="IT-29", NUMBER=6, PAGES="825-831", YEAR=1983, KEYWORDS="Queueing theory", } @ARTICLE{Walr83:Note, AUTHOR="J. Walrand", TITLE="A Note on Norton's Theorem for Queueing Networks", JOURNAL=jap, VOLUME=20, PAGES="442-444", YEAR=1983, KEYWORDS="Norton's theorem", } @ARTICLE{Wals8303:Telephone, AUTHOR="G. Walsham", TITLE="Telephone Systems in the Third World: A Research Project", JOURNAL=jors, VOLUME=34, NUMBER=3, PAGES="225-231", YEAR=1983, KEYWORDS="Telephony; forecasting; survey", ABSTRACT="Developing countries", } @ARTICLE{Ware8311:Competitive, AUTHOR="H. Ware", TITLE="The Competitive Potential of Cellular Mobile Telecommunications", JOURNAL=ieeecm, VOLUME=21, NUMBER=11, PAGES="16-23", YEAR=1983, KEYWORDS="Mobile radio", } @ARTICLE{Webe8305:Note, AUTHOR="R. A. Weber", TITLE="A Note on Waiting Times in Single Server Queues", JOURNAL=or, VOLUME=31, NUMBER=5, PAGES="950-951", YEAR=1983, KEYWORDS="Queueing system; single server; waiting time", } @ARTICLE{Whit8304:Untold, AUTHOR="W. Whitt", TITLE="Untold Horrors of the Waiting Room: What the Equilibrium Distribution Will Never Tell About the Queue-Length Process", JOURNAL=ms, VOLUME=29, NUMBER=4, PAGES="395-408", YEAR=1983, KEYWORDS="Queueing theory", } @ARTICLE{Wood8309:Incremental, AUTHOR="C. M. Woodside", TITLE="An Incremental Capacity-Allocation Algorithm for Voice/Data Networks", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=9, PAGES="1113-1114", YEAR=1983, KEYWORDS="Voice/data integration; algorithm", } @ARTICLE{Yers83:Calculation, AUTHOR="V. Yershov and Y. P. Peneva", TITLE="Calculation of the Loss Probability in Switching Systems with a Nonuniform Load", JOURNAL="Telecommunications and Radio Engineering", ADDRESS="SU", VOLUME="37/38", PAGES="13-17", YEAR=1983, KEYWORDS="Switching system; asymmetric load; loss probability", } @ARTICLE{Yoko8306:Multi, AUTHOR="M. Yokoyama and H. Yamamoto and M. Kajiwara", TITLE="A Multi-Bit-Rate Substitute-Communication System with High Call-Carrying Capacity", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=6, PAGES="799-803", YEAR=1983, KEYWORDS="Communication network", } @ARTICLE{Zver8306:Organization, AUTHOR="G. I. Zvereva and V. O. Shvartsman", TITLE="The Organization of the Preventive Maintenance of Communication Equipment", JOURNAL="Telecommunications and Radio Engineering", ADDRESS="SU", VOLUME=37, NUMBER=6, PAGES="9-14", YEAR=1983, KEYWORDS="Network management; reliability", } @ARTICLE{Imas8302:Graph, AUTHOR="M. Imase and Kazunori Okada and H. Ichikawa", TITLE="Graph Theoretical Approach to a Highly Reliable Network", JOURNAL=ecij1, ADDRESS="Japan", VOLUME="66B", NUMBER=2, PAGES="88-96", YEAR=1983, KEYWORDS="Network planning; reliability", } @ARTICLE{Jarr8307:Compte, AUTHOR="B. Jarry-Lacombe and J.-F. Legros", TITLE="Compte rendu du 2e congrès international sur la planification des réseaux de télécommunications", JOURNAL=atele, ADDRESS="France", VOLUME=38, NUMBER="7-8", PAGES="297-303", YEAR=1983, LANGUAGE="French", } @ARTICLE{Jenn8302:Another, AUTHOR="L. P. Jennergren", TITLE="Another Method for Random Number Generation on Microcomputers", JOURNAL="Simulation", VOLUME=41, NUMBER=2, PAGES="79-", YEAR=1983, KEYWORDS="Rng", } @BOOK{Bler83:Nachrichtennetze, AUTHOR="R. Bäßler and A. Deutsch", TITLE="Nachrichtennetze", PUBLISHER="VEB Verlag Technik Berlin", ADDRESS="Berlin, Germany", PAGES=260, YEAR=1983, LANGUAGE="German", REFERENCES=101, KEYWORDS="Communication network", ABSTRACT="Nachrichtennetzgestaltung; Grundlagen der Gestaltung und Planungvon Fernmeldenetzen; Gestaltung und Planung von Orts- und Knotennetzen; Gestaltung und Planung von Primärnetzen für den Fernmeldeweitverkehr; Gestaltung und Planung von Sekundärnetzen für den Fernmeldeweitverkehr; Verkehrstheorie", } @TECHREPORT{Cour83:Topological, AUTHOR="P.-J. Courtois and P. Semal", TITLE="Topological optimization of communication network with discrete capacity values", INSTITUTION="Philips Research Lab", ADDRESS="Brussels, Belgium", NUMBER="R 467", PAGES=50, YEAR=1983, REFERENCES=10, KEYWORDS="Data network; network planning; Greedy algorithm", ABSTRACT="Design procedure by which the mean message delay and the cost of adata communication network topology can be minimized when link capacities are restricted to take discrete values only.", } @ARTICLE{Mora83:Stanford, AUTHOR="Hans P. Moravec", TITLE="The Stanford Cart and the {CMU} Rover", JOURNAL=ieeeproc, VOLUME=71, NUMBER=7, PAGES="872-884", YEAR=1983, } @ARTICLE{Tege83:Factors, AUTHOR="S. L. Teger", TITLE="Factors impacting the evolution of office automation", JOURNAL=ieeeproc, VOLUME=71, NUMBER=4, PAGES="503-511", YEAR=1983, REFERENCES=50, KEYWORDS="Survey; future outlook; bibliography; office automation", ANNOTE="This paper examines some of the market factors, which will be central to the evolution of office automation . Based upon the substantial portion of office worker time spent in interpersonal communications, their three leading activity areas of voice communications, meetings, and development communications are described in terms of problems with current processes and generic solutions", } @ARTICLE{Thom83:Techniques, AUTHOR="A. Thomasian and P. Bay", TITLE="Analysis techniques for queueing network models of multicomputer systems with shared resources", JOURNAL=compperf, VOLUME=4, PAGES="151-166", YEAR=1983, REFERENCES=13, KEYWORDS="Method; multiprogramming; closed queueing network; m/m/1/n", ANNOTE="The effect of shared resources, such as shared dasd, on the performance of multicomputer systems is considered. Such systems can be modelled as queueing networks with a large number of job types (chains). Computational cost for analysing the model can be reduced by adopting iterative schemes based an mean-value analys is, but these schemes cannot take into account the blocking effect due to the limited multiprogramming level at each computer. T", } @ARTICLE{Balb83:Calculation, AUTHOR="G. Balbo and S. C. Bruell", TITLE="Calculation of the moments of the waiting time distribution of {FCFS} stations in product form queueing networks", JOURNAL=compperf, VOLUME=4, PAGES="106-110", YEAR=1983, REFERENCES=20, KEYWORDS="FIFO; waiting time; product form; network; queue length; moment; distribution; method; MVA", ABSTRACT="Recursive expressions for computing the moments of the waiting time and queue length distributions of multiple server fcfs stations embedded in product-form queueing networks are derived. The se results can easily be incorporated in a mean value analysis algorithm for computing the performance measures of queueing networks. It is therefore recommended that standard product from queueing network solution packages be augmented to report routinely", } @ARTICLE{Brya83:MVA, AUTHOR="R. M. Bryant and A. Krzesinski and P. Teunissen", TITLE="The {MVA} pre-empt resume priority approximation", JOURNAL=per, PAGES="12-27", YEAR=1983, REFERENCES=21, KEYWORDS="queueing approximation; PREHOL priority; product form; network; MVA", ABSTRACT="A mean value analysis (MVA) approximation is presented for computing the average performance measures of closed multiclass queueing networks containing non pre-emptive head of line (HOL) and pre-empt resume (PR) priority centers. The approximation has the same storage and computational requirements as MVA thus allowing computationally efficient solutions of large priority queueing networks. The accuracy of the MVA PR approximation is systematic", } @ARTICLE{Buze83:State, AUTHOR="J. P. Buzen and S. C. Agrawal", TITLE="State space transformations in queueing network modeling", JOURNAL=per, PAGES="55-69", YEAR=1983, REFERENCES=21, KEYWORDS="queueing approximation; product form; network; PREHOL priority; operational analysis; performance evaluation; state space transformation; aggregate server method", ABSTRACT="An important problem in queueing network modeling is that of characterizing and analyzing relationships among alternative models of a single system. The problem is approached by developing the concept of a state space transformation, which is a mechanism for expressing the way one model can be mapped into another. After discussing state space transformations in general terms, some important transformations are presented. The usefuless of the te", } @ARTICLE{Coff83:Diffusion, AUTHOR="E. G. Coffman and M. I. Reiman", TITLE="Diffusion approximations for storage processes in computer systems", JOURNAL=per, PAGES="93-117", YEAR=1983, REFERENCES=20, KEYWORDS="Diffusion approximation; GI/G/1; FIFO; limit theorem", ABSTRACT="In the past, stochastic models of computer systems have concentrated on sequencing problems with no explicit account taken of the concurrent problems of storage allocation. Queueing networks, for example, have been used effectively to represent the serval and perhaps iterative use of resources at varying levels, but the simultaneous of space resources that affect job sequencing cannot be easily assimilated into such models. The nature of the di", } @ARTICLE{Duda83:Transient, AUTHOR="A. Duda", TITLE="Transient diffusion approximation for some queueing systems", JOURNAL=per, PAGES="118-128", YEAR=1983, REFERENCES=14, KEYWORDS="GI/G/1; diffusion approximation; time in system; first passage; overflow; busy period; transient behaviour; multiserver", ABSTRACT="There are many situations where information about the transient behaviour of computer systems is wanted. In this paper a diffusion approximation to the transient behaviour of some queueing systems is proposed. The solution of the forward diffusion equation on the real positive line with the elementary return barrier having almost general holding time distribution provides the approximation for the gi/g/1 queue. The solution of the diffusion e", } @ARTICLE{Freu83:New, AUTHOR="D. J. Freund and J. N. Bexfield", TITLE="A new aggregation approximation procedure for solving closed queueing networks with simultaneous resource possession", JOURNAL=per, PAGES="214-223", YEAR=1983, REFERENCES=11, KEYWORDS="Queueing approximation; closed queueing network; method; queueing discipline; resource management; simultaneous resource possession", ABSTRACT="A new aggregation approximation procedure is presented for analyzing single class closed queueing networks with simultaneous resource possession. It is applicable to multiple entry systems such as I/O models and relies on a new multi-entrance queue to aggregate the subnetwork with simultaneous resource possession into a variable rate queue. The resulting network is solved using conventional product form techniques. The multi-entrance queue has", } @ARTICLE{Garc83:Method, AUTHOR="R. Garcia", TITLE="A Method for Planning Packet-Switched Data Networks", JOURNAL=networks, YEAR=1983, REFERENCES=11, KEYWORDS="Network planning", ABSTRACT="The planning of such a network can be divided into two parts: the planning of the switching network. In this contribution, a method for the planning of the switching network is examined.", } @ARTICLE{Guri83:Comparison, AUTHOR="W. Gürich and B. Mertens", TITLE="Comparison of internal and external interactive response times", JOURNAL=compperf, VOLUME=4, PAGES="13-18", YEAR=1983, REFERENCES=20, KEYWORDS="Tuning; response time; interactive mode; measurement; comparison", ABSTRACT="Knowledge of the response times of interactive systems is of fundamental importance in performance evaluation and tuning. Very often, the internal response time, as seen by the system scheduler, is taken as an indicator of the system's responsiveness. However, use of this parameter may be misleading since it neglects the effects of the teleprocessing subsystem. The paper describes in detail a simple method of measuring the external response tim", } @ARTICLE{Harr83:Exact, AUTHOR="P. G. Harrison", TITLE="An exact analysis of the distribution of cycle times in a class of queueing networks", JOURNAL=per, PAGES="224-242", YEAR=1983, REFERENCES=16, KEYWORDS="Tree queue; closed queueing network; dialog cycle time; frequency distribution; Laplace transform; moment", ABSTRACT="Prediction of detailed characteristics of the delays experienced by customers in queueing networks is of great importance in various modelling and performance evaluation activities: operations research, computer systems and communication networks. Their statistical properties have been investigated predominantly by simulation techniques with the execption of mean value analysis for which little's law is applied. Theoretical studies of the proba", } @ARTICLE{Kowa83:Operational, AUTHOR="W. Kowalk", TITLE="An operational view on renewal theory", JOURNAL=per, PAGES="130-137", YEAR=1983, REFERENCES=14, KEYWORDS="Renewal process; operational analysis; Takacs; waiting time; esidual life", ABSTRACT="In this paper we derive a formula for the moments of the residual life in operational context, and show that the paradox of residual life holds also in a finite queueing model. In addition, we prove the renewal theorem, show that forward and backward times are independent, and state the memoryless property. As applications we point out how to derive takacs recurrence formula for the moments of the waiting time and how to base the Markovian", } @INPROCEEDINGS{Ster8311:Queueing, AUTHOR="T. E. Stern", TITLE="A Queueing Analysis of Packet Voice", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="2.5.1-6", DAYS=28, MONTH="November/December", YEAR=1983, KEYWORDS="Packet voice", } @INPROCEEDINGS{Wu83:Adaptive, AUTHOR="Chengke Wu and V. R. Dhadesugoor", TITLE="An Adaptive Multiple Access Protocol for Integrated Voice/Data Local Area Networks", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="28.4.1-5", DAYS=28, MONTH="November/December", YEAR=1983, KEYWORDS="Voice/data integration", } @TECHREPORT{Wood8301:Finding, AUTHOR="James A. Woods", TITLE="Finding files fast", TYPE="Technical Report", INSTITUTION="Computer Science Division, University of California", ADDRESS="Berkeley, California", NUMBER="UCB/CSD 83/148", MONTH=jan, YEAR=1983, KEYWORDS="file system; file finding; searching; Unix; BSD", ABSTRACT="A fast filename search facility for UNIX is presented. It consolidates two data compression methods with a novel string search technique to rapidly locate arbitrary files. The code, integrated into the standard find utility, consults a preprocessed data base, regenerated daily. This contrasts with the usual mechanism of matching search keys against candidate items generated on-the-fly from a scattered directory structure. The pathname database is an incrementally-encoded lexicographically sorted list (sometimes referred to as a ``front-compressed'' file) which is also subjected to common bigram coding to effect further space reduction. The storage savings are a factor of five to six over the standard ASCII representation. The list is scanned using a modified linear search specially tailored to the incremental encoding; typical ``user time'' required by this algorithm is 40\% -- 50\% less than with naive search.", } @ARTICLE{Hwan8301:Guest, AUTHOR="K. Hwang", TITLE="Guest Editor's Introduction: Computer Architectures for Image Processing", JOURNAL=ieeecomp, VOLUME=16, NUMBER=1, PAGES="10-12", MONTH=jan, YEAR=1983, } @ARTICLE{Hwan8301:Integrated, AUTHOR="K. Hwang and K S Fu", TITLE="Integrated Computer Architectures for Image Processing and Database Management", JOURNAL=ieeecomp, VOLUME=16, NUMBER=1, PAGES="51-60", MONTH=jan, YEAR=1983, } @ARTICLE{Stuc8301:Which, AUTHOR="B. W. Stuck", TITLE="Which local net bus access is most sensitive to traffic congestion?", JOURNAL=datacommunications, VOLUME=12, PAGES="107-120", MONTH=jan, YEAR=1983, } @ARTICLE{Cox8301:Object, AUTHOR="B. J. Cox", TITLE="The Object Oriented Pre-Compiler", JOURNAL=sigplan, VOLUME=18, PAGES="15-22", MONTH=jan, YEAR=1983, } @TECHREPORT{Bren8301:Linear, AUTHOR="R. P. Brent and H. T. Kung and F. T. Luk", TITLE="Some Linear-Time Algorithms for Systolic Arrays", INSTITUTION="Cornell University, Computer Science Department", NUMBER="TR83-541", PAGES=46, MONTH=jan, YEAR=1983, ABSTRACT="We survey some recent results on linear-time and almost linear-time algorithms for one and two-dimensional systolic arrays. In particular, we show how the greatest common divisor (GCD) of two polynomials of degree $n$ over a finite field can be computed in time $O(n)$ on a linear systolic array of $O(n)$ cells; similarly for the GCD of two $n$-bit binary numbers. Assuming that the systolic cells can perform floating-point arithmetic, we show how $n$ by $n$ Toeplitz systems of linear equations can be solved in time $O(n)$ on a linear array of $O(n)$ cells, each of which has constant memory size (independent of $n$). Finally, we outline how a two-dimensional array of $O(n)$ by $O(n)$ cells with nearest-neighbor interconnections can be used to solve (to working accuracy) the eigenvalue problem for a symmetric real $n$ by $n$ matrix in time $O(nS(n))$. Here $S(n)$ is a slowly-growing function of $n$; for practical purposes $S(n)$ can be regarded as a constant. In addition to their theoretical interest, these results can be implemented relatively easily and have potential applications in the areas of error-correcting codes, symbolic and algebraic computation, signal processing and image processing. For example, systolic GCD arrays for error correction have been implemented with the microprogrammable ``PSC'' chip.", } @ARTICLE{Ciep8301:Connecting, AUTHOR="A. Ciepielewski and T. Jungefeldt and J. Linnell", TITLE="Connecting a Minicomputer to an {X.25} Network: A Case Study", JOURNAL=ccr, VOLUME=13, NUMBER=1, PAGES="11-30", MONTH=jan, YEAR=1983, REFERENCES=14, } @ARTICLE{Borg8301:Collision, AUTHOR="F. Borgonovo and L. Fratta", TITLE="A Collision Resolution Algorithm for Random-Access Channels with Echo", JOURNAL=ccr, VOLUME=13, NUMBER=1, PAGES="31-39", MONTH=jan, YEAR=1983, REFERENCES=8, ABSTRACT="In this paper random access algorithms for packet broadcast channels are considered. It is shown that utilizing channels with a central repeater, as for instance a satellite channel, more information is available to resolve conflicts than that utilized in Capetanakis type tree algorithms. Based on this extra information, a new class of collision resolution algorithms is presented. Only preliminary results on maximum achievable throughput are given and it is shown that this can approach .673.", } @TECHREPORT{Bren8301:Systolic, AUTHOR="R. P. Brent and F. T. Luk", TITLE="A Systolic array for the linear-time solution of Toeplitz systems of equations", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-83-02", MONTH=jan, YEAR=1983, } @TECHREPORT{RPBr8301:Research, AUTHOR="editor R. P. Brent", TITLE="Research in the Department of Computer Science", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-83-01", MONTH=jan, YEAR=1983, } @MISC{Siem8301:MFC, AUTHOR="Siemens", TITLE="{MFC} signaling systems", NOTE="Siemens topics", MONTH=jan, YEAR=1983, } @ARTICLE{Chie8302:Comments, AUTHOR="C. M. Chie", TITLE="Comments on {``M/M/1} Transient State Occupancy Probabilities Via the Discrete Fourier Transform", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=2, PAGES="289-290", MONTH=feb, YEAR=1983, KEYWORDS="queueing theory", ANNOTE="see \cite{Ackr82:MM1}", } @TECHREPORT{Merr8302:Providing, AUTHOR="Ian H. Merritt", TITLE="Providing telephone line access to a packet voice network", TYPE="Research Report", INSTITUTION="Information Sciences Institute (ISI)", ADDRESS="Marina del Ray, California", NUMBER="ISI/RR-83-107", MONTH=feb, YEAR=1983, KEYWORDS="packet voice; silence suppression; echo suppression; silence detection", ABSTRACT="Research in the area of packet voice over the past ten years has proven the value of packet technology for voice transmission. Continuing research in this area has led to the development of a packet satellite network for use as a testbed for packet voice telephone services. In order to allow a wide range of users to participate in the testing of this technology, ISI has developed the switched telephone network interface card to allow interconnection between the packet network and the commercial telephone system. This report describes the design of this device and discusses the techniques used to implement functions such as sound/silence detection, echo suppression, and dialing.", } @ARTICLE{Tham8302:Voice, AUTHOR="Y. K. Tham and J. N. P. Hume", TITLE="Analysis of voice and low-priority data traffic by means of brisk periods and slack periods", JOURNAL=comcom, VOLUME=6, NUMBER=1, PAGES="14-22", MONTH=feb, YEAR=1983, KEYWORDS="integrated services; voice traffic; movable boundary; slotted systems", ABSTRACT="Differentiating data traffic in an integrated voice and data network into high and low priority classes, it is noted that spare voice transmission capacity may be used to transmit low priority data packets, which can tolerate large delays. This paper introduces the notion of brisk periods and slack periods for studying the fluctuation in the number of voice calls in progress and the number of customers, in general, in a multiplexer queue with Poisson arrivals and exponential service times. Recurrence relations are derived for the Laplace-Stieltjes transform of the probability density functions and the mean and variance of the increase in low priority data packets during brisk periods of voice calls. Computation of spare capacity during slack periods of voice calls is outlined.", } @ARTICLE{List8302:X, AUTHOR="M. Listanti and Francesco Villani", TITLE="An X.25-compatible protocol for packet voice communications", JOURNAL=comcom, VOLUME=6, NUMBER=1, PAGES="23-31", MONTH=feb, YEAR=1983, KEYWORDS="packet voice; X.25; integrated services", ABSTRACT="Developments in packet-switched networks have generated interest in how to integrate voice and data traffic in such networks. The paper deals with a proposed communications protocol for voice transmission within X.25 packet-switched networks. Basic protocol procedures for handling voice communications are examined, and possible formats for the identified types of voice frame and packet fitting for current CCITT standards governing packet data communications are presented.", ANNOTE="time stamp field of 8 bit and a quantizing interval of 2 ms", } @ARTICLE{Huds8302:Microprocessor, AUTHOR="C. Hudson", TITLE="A microprocessor file server", JOURNAL="Software and Microsystems", VOLUME=2, PAGES="9-13", MONTH=feb, YEAR=1983, } @ARTICLE{Mino8302:New, AUTHOR="Daniel Minoli", TITLE="A new design criterion for store-and-forward networks", JOURNAL=cn, VOLUME=7, PAGES="9-15", MONTH=feb, YEAR=1983, } @ARTICLE{VonS8302:Transport, AUTHOR="P. VonStudritz", TITLE="Transport protocols: Their performance and status in international standardization", JOURNAL=cn, VOLUME=7, PAGES="27-35", MONTH=feb, YEAR=1983, } @ARTICLE{Land8302:Computer, AUTHOR="Lawrence H. Landweber", TITLE="The Computer Science Network: History, Status, and Future", JOURNAL="Computer Compacts", PUBLISHER="North-Holland", VOLUME=1, NUMBER=1, PAGES="9-13", MONTH=feb, YEAR=1983, } @TECHREPORT{Cole8302:Naming, AUTHOR="Randolph E. Cole and P. Higginson and P. J. Lloyd and R. Moulton", TITLE="Naming, Addressing and Routing in a Multi-Layer, Multi-Network Environment", TYPE="INDRA Note", INSTITUTION="UCL", NUMBER=1391, MONTH=feb, YEAR=1983, } @TECHREPORT{Wall8302:GILT, AUTHOR="P. Wallerlath and L. Wosnitza", TITLE="The {GILT} Standard - Interconnection of Computer Based Message and Conference Systems", INSTITUTION="University of Dusseldorf", MONTH=feb, YEAR=1983, } @INPROCEEDINGS{MacN8302:Research, AUTHOR="E. A. MacNair and C. H. Sauer", TITLE="The Research Queueing Package: A Primer", BOOKTITLE="Share 60", PAGES="29-37", MONTH=feb, YEAR=1983, } @TECHREPORT{Sach8302:Relations, AUTHOR="D. Sachse-Åkerlind", TITLE="Relations between complexity classes and provable complexity classes", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-83-04", MONTH=feb, YEAR=1983, } @TECHREPORT{Sach8302:Computational, AUTHOR="D. Sachse-Åkerlind", TITLE="Computational complexity and provable equivalence of algorithms", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-83-03", MONTH=feb, YEAR=1983, } @ARTICLE{Davi8302:MATS, AUTHOR="C. K. Davis", TITLE="The {MATS-E} Cellular Mobile Telephone System", JOURNAL="Telecommunications", ADDRESS="Great Britain", PAGES="74, 76, 97", MONTH=feb, YEAR=1983, KEYWORDS="mobile radio", } @INPROCEEDINGS{Kies8302:Architecture, AUTHOR="W. M. Kiesel and P. J. Kühn and H. Schröder and A. Schwanke", TITLE="Architecture of the Communication Subsystem for Local Area Networks Operating under a new {CSMA-Protocol} with Dynamic Priorities", BOOKTITLE="Messung, Modellierung und Bewertung von Rechensystemen, 2.GI/NTG-Fachtagung", PUBLISHER="Springer-Verlag", ADDRESS="Stuttgart, Germany", PAGES="497-516", MONTH=feb, YEAR=1983, LANGUAGE="English", KEYWORDS="LAN; CSMA", } @ARTICLE{Will8302:Capacity, AUTHOR="J. Williams", TITLE="Capacity Dynamics in Cellular Mobile Telephone systems", JOURNAL="Telecommunications", PAGES="32-37", MONTH=feb, YEAR=1983, KEYWORDS="MAT; capacity planning", } @ARTICLE{Brun8303:Comments, AUTHOR="H. Bruneel", TITLE="Comments on ``Discrete-Time Queueing Systems and Their Networks''", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=3, PAGES="461-463", MONTH=mar, YEAR=1983, KEYWORDS="discrete time queue", } @ARTICLE{Junk8303:Digital, AUTHOR="S. L. Junker and W. E. Noller", TITLE="Digital private branch exchanges", JOURNAL=ieeecm, VOLUME=21, NUMBER=3, PAGES="11-17", MONTH=mar, YEAR=1983, REFERENCES=37, KEYWORDS="Survey; bibliography; digital network; PABX; LAN; future outlook", ABSTRACT="This paper describes the development of digital PBXs and its relation to LANs.", } @ARTICLE{Kaji8303:Trends, AUTHOR="M. Kajiwara", TITLE="Trends in digital switching system architectures", JOURNAL=ieeecm, VOLUME=21, NUMBER=3, PAGES="47-52", MONTH=mar, YEAR=1983, REFERENCES=18, KEYWORDS="Digital network; public network; ISDN", ABSTRACT="This paper describes various aspects and the advantages of digital switching architectures.", } @ARTICLE{Liss8303:Digital, AUTHOR="T. Lissack and B. Maglaris and I. T. Frisch", TITLE="Digital switching in local area networks", JOURNAL=ieeecm, VOLUME=21, NUMBER=3, PAGES="26-37", MONTH=mar, YEAR=1983, REFERENCES=39, KEYWORDS="digital network; LAN; survey; bibliography; protocol", ABSTRACT="This paper describes various aspects of switching in lan's.", } @ARTICLE{Ross8303:Military, AUTHOR="Myron J. Ross", TITLE="Military/government digital switching systems", JOURNAL=ieeecm, VOLUME=21, NUMBER=3, PAGES="18-25", MONTH=mar, YEAR=1983, REFERENCES=10, KEYWORDS="Switching system", ABSTRACT="The differences in requirements for military and public networks.", } @ARTICLE{Scar8303:Orbital, AUTHOR="T. Scarcella and R. V. Abbott", TITLE="Orbital efficiency through satellite digital switching", JOURNAL=ieeecm, VOLUME=21, NUMBER=3, PAGES="38-46", MONTH=mar, YEAR=1983, REFERENCES=7, KEYWORDS="Survey; satellite radio; digital network; TDMA; time division multiple access", ABSTRACT="This paper gives a survey on the various aspects of digital networks including satellite transmission and switching.", } @INPROCEEDINGS{Skoo8303:Architecture, AUTHOR="R. A. Skoog and Hazim Ahmadi and S. M. Boyles", TITLE="Network architecture planning for common channal signaling networks", BOOKTITLE="2nd International Network Planning Symposium (NETWORKS)", ADDRESS="Brighton", PAGES="266-271 (14.1)", MONTH=mar, YEAR=1983, KEYWORDS="Signalling; common channel; CCS; network planning", } @ARTICLE{Tsay8303:MIKE, AUTHOR="D.-P Tsay and Minkui Liu", TITLE="{MIKE:} A Network Operating System for the Distributed Double-Loop Network", JOURNAL=ieeese, VOLUME="SE-9", NUMBER=2, PAGES="143-154", MONTH=mar, YEAR=1983, } @INPROCEEDINGS{Doug8303:Comparison, AUTHOR="R. H. Douglas", TITLE="A comparison of {IEEE} standard local area networks", BOOKTITLE="2rd annual Phoenix Conference on Computers and Communication", PAGES="334-335", MONTH=mar, YEAR=1983, } @INPROCEEDINGS{Reed8303:Estimating, AUTHOR="Daniel Reed", TITLE="Estimating the performance of multi microcomputer networks", BOOKTITLE="IEEE International Workshop on Computer Systems Organization", ADDRESS="New Orleans", PAGES="479-481", MONTH=mar, YEAR=1983, } @INPROCEEDINGS{Saal8303:Community, AUTHOR="H. J. Saal", TITLE="Community microcomputing: user centered networks of personal computers", BOOKTITLE=compcon, PAGES="134-135", MONTH=mar, YEAR=1983, } @INPROCEEDINGS{Schn8303:Functional, AUTHOR="N. Schneidewind", TITLE="Functional approach to the design of a local network: A Naval Logistics System Example", BOOKTITLE="Compcon Spring", PUBLISHER="IEEE computer society", PAGES="197-202", MONTH=mar, YEAR=1983, } @INPROCEEDINGS{Croc8303:MMDF, AUTHOR="D. H. Crocker and G. B. Reilly and D. Farber", TITLE="{MMDF--An} Internetwork Memo Distribution Facility", BOOKTITLE="Spring Compcon", PUBLISHER="IEEE Computer Society Press", ADDRESS="New York", PAGES="314-315", MONTH=mar, YEAR=1983, } @INPROCEEDINGS{Edmi8303:Overview, AUTHOR="R. D. Edmiston", TITLE="An Overview of the Computer Science Network {(CSNET)}", BOOKTITLE="of Papers Spring Compcon", PUBLISHER="IEEE Computer Society Press", ADDRESS="New York", PAGES="310-313", NOTE="Published as IEEE Computer", MONTH=mar, YEAR=1983, } @ARTICLE{Andr8303:Concepts, AUTHOR="G. R. Andrews and F. Schneider", TITLE="Concepts and Notations for Concurrent Programming", JOURNAL=acmcs, VOLUME=15, NUMBER=1, PAGES="3-44", MONTH=mar, YEAR=1983, } @ARTICLE{BITN8303:Because, AUTHOR="Bitnet", TITLE="Because its There", JOURNAL="Perspectives on Computing", INSTITUTION="BITNET", PUBLISHER="IBM", VOLUME=3, NUMBER=1, MONTH=mar, YEAR=1983, KEYWORDS="Bitnet", } @INPROCEEDINGS{Kenn8303:Fibre, AUTHOR="J. S. Kennedy", TITLE="Fibre Optics in Local Area Networks", BOOKTITLE="Localnet (Europe)", ADDRESS="London", PAGES="327-341", MONTH=mar, YEAR=1983, } @INPROCEEDINGS{Li8303:Characteristics, AUTHOR="L. Li", TITLE="Performance Characteristics of Token Bus Networks", BOOKTITLE="Localnet (Europe)", ADDRESS="London", PAGES="261-275", MONTH=mar, YEAR=1983, } @TECHREPORT{NBS8303:Message, AUTHOR="N. B. S", TITLE="Message Format for Computer Based Mail Systems", INSTITUTION="National Bureau of Standards", NUMBER="FIPS 98", MONTH=mar, YEAR=1983, } @ARTICLE{Yemi8303:Bang, AUTHOR="Y. Yemini", TITLE="A Bang-Bang Principle for Real-time Transport Protocols", JOURNAL=sigcomm, ORGANIZATION="ACM", ADDRESS="Austin, Texas", VOLUME=13, NUMBER=2, PAGES="262-268", MONTH=mar, YEAR=1983, REFERENCES=9, KEYWORDS="queueing theory; discrete time queue; FIFO", ABSTRACT="A real-time protocol is usually concerned with the transportation of a real-time data stream over a packet switched network. Among the major issues distinguishing real-time protocols from ordinary transport protocols is the problem of trading delay for loss. That is, if some loss of packets may be acceptable, and usually inevitable, the objective of the protocol is to minimize the delay of packets, subject to constraints on the acceptable loss. This is unlike usual transport protocols, which are designed to guarantee no loss at the expense of increased delays. This paper presents a model for the delay-loss tradeoffs in a family of real-time transport protocols. It is demonstrated that, under very general assumptions, an optimal real-time protocol is a bang-bang protocol: there exists a threshold queue length such that as long as the packet queue length at the sender is less than the threshold the protocol should be an ordinary positive acknowledgement with retransmissions transport protocol. However, as soon as the threshold queue length is exceeded, a newly arriving packet causes the first (or any other) packet in the queue to be discarded. Closed form expressions for the threshold buffer size are obtained and analyzed in terms of the given parameters of the system.", ANNOTE="slotted system with fixed packet size arriving from Bernoulli source; infinite buffer. Models channel delivery probability, with retransmissions and instantaneous acknowledgements. Sender discards with probability $p\_n$, where $n$ is buffer occupancy. Optimal policy discards packet at head of queue (disabling retransmission) if occupancy is above some threshold.", } @ARTICLE{Cerf8303:Putting, AUTHOR="V. G. Cerf and L. Pouzin and John F. Shoch", TITLE="Putting Protocols to Work", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="1-1", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, } @ARTICLE{desJ8303:ISO, AUTHOR="R. desJardins", TITLE="{ISO} Open Systems Interconnection Standardization Status Report", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="4-5", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, } @ARTICLE{Enni8303:Development, AUTHOR="Gregory Ennis", TITLE="Development of the {DoD} Protocol Reference Model", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="6-7", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=3, } @ARTICLE{Garl8303:Evolution, AUTHOR="L. L. Garlick", TITLE="Evolution of Xerox's Network Systems Architecture", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="8-9", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, } @ARTICLE{Boch8303:Higher, AUTHOR="Gregor V. Bochmann", TITLE="Higher-Level Protocols Are Not Necessarily End-to-End", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="10-11", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, } @ARTICLE{John8303:Routing, AUTHOR="Marjory Johnson", TITLE="Analysis of Routing Table Update Activity After Resource Failure in a Distributed Computer Network", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="14-20", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=3, ABSTRACT="In a distributed computer network each node participates in the routing process, making routing decisions based on information about network topology which is stored in tables in the node. To maintain the accuracy of these tables without interrupting the functionality of the network, they must be dynamically updated whenever there is a topology change in the network. The purpose of this paper is to analyze update activity required by a topology information maintenance scheme which has been implemented on the three-node MERIT Computer Network in Michigan. The main theorem gives upper and lower bounds on the number of update messages required after failure of a single network resource, either a node or a link.", } @ARTICLE{Gafn8303:Path, AUTHOR="E. M. Gafni and D. P. Bertsekas", TITLE="Path Assignment for Virtual Circuit Routing", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="21-25", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=9, ABSTRACT="We consider a network which routes on a virtual-circuit. Each virtual-circuit is associated with a session. Virtual-circuit is assigned to a session at the time the session is initiated. We address the dynamic case where new sessions arrive and old sessions terminate. We formulate an optimal control problem to deduce which virtual-circuit an incoming session will be assigned to. We then discuss various approximations to the problem and show that the heuristic rule, ''route on the shortest marginal delay path'', is close to optimal in an asymptotic sense.", } @ARTICLE{Vito8303:Mechanical, AUTHOR="Benedetto L. Di Vito", TITLE="Mechanical Verification of a Data Transport Protocol", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="30-37", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=10, ABSTRACT="A protocol that models the data transfer functions of TCP has been formally specified and mechanically verified. This work represents a significant application of deductive verification techniques to protocol analysis. The formal methods are based on a concurrent process model and its associated proof techniques. Mechanical theorem proving is used as an integral part of the methodology. Both formal and informal specifications of the protocol are presented as well as a high level overview of the proof.", } @ARTICLE{Shan8303:Verification, AUTHOR="A. U. Shankar and S. S. Lam", TITLE="Specification and Verification of an {HDLC} Protocol with {ARM} Connection Management and Full-Duplex Data Transfer", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="38-48", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=12, ABSTRACT="We use an event-driven process model to specify a version of the High-level Data Link Control (HDLC) protocol between two communicating protocol entities. The HDLC protocol is based upon the Asynchronous Response Model (ARM) of operations, and uses the basic repertoire of HDLC commands and responses (with the exception of the CMDR response). It includes the features of poll/final cycles for connection management and checkpointing, sliding windows for data transfer, and ready/not ready messages for flow control. HDLC has three distinguishable functions: connection management, and one-way data transfer in opposite directions between the protocol entities. Various logical safety properties of the HDLC protocol concerning these functions have been verified using the methods of projections.", } @ARTICLE{Vuon8303:Reachability, AUTHOR="Son Vuong and D. D. Cowan", TITLE="Reachability Analysis of Protocols with {FIFO} Channels", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="49-57", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=17, ABSTRACT="In a complete protocol design process, it is often important to validate the protocol for general correctness properties such as boundedness, deadlock absence, and well-formedness. However, for any general protocol modeled as a number of communicating finite state machines with unbounded FIFO channels, the above properties are known to be undecidable . In this paper we demonstrate the decidability of those properties for a class of protocols, called well-ordered protocols. We introduce an algorithm for constructing a finite reachability tree for any given protocol with FIFO channels and show that by using this reachability tree, one can decide whether any given protocol is well-ordered, and if it is well-ordered whether it has an unbounded channel, a state deadlock, or an unspecified reception.", } @ARTICLE{Cohe8303:X, AUTHOR="Karen M. Cohen and Roger P. Levy", TITLE="{X.25} Implementation: The Untold Story", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="60-64", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=6, ABSTRACT="CCITT Recommendation X.25 specifies an access protocol for the interface between Data Terminal Equipment and Data Circuit-Terminating Equipment for terminals operating in the packet mode on public data networks. The recommendation is written from the Data Circuit-terminating Equipment's point of view. All of the internal implementation is left up to the designer. This paper describes some of the packet level issues that were encountered during the design and implementation of a packet switch; some solutions are given. Although some of these issues are general and pertain to other protocols, some are specific to Recommendation X.25. Issues covered are: what are the network actions when buffers are depleted; how is a permanent virtual circuit set up; what is done when the remote side of a permanent virtual circuit goes out of order; and what strategy should be taken for internal coupling of the network endpoints.", } @ARTICLE{Liu8303:Layered, AUTHOR="Ruoheng Liu", TITLE="A Layered Architecture for a Programmable Shared Data Network", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="65-65", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, ABSTRACT="The Advanced Communication Systems AIS Net 1000 service offered by American Bell Inc. provides a service that combines Data Communications with Data Processing capabilities. The Net 1000 network offers customers a nation-wide service that can be shared among multiple customers. It interfaces with a wide variety of terminals and hosts, and allows incompatible devices to communicate with each other. It provides call, store and forward, and storage services. It also provides customer- programmable capabilities in a distributed processing environment. With the terminal and host computer compatibility, customer programmability, and shared public networking capability, this data network offers the service for the 80's. The presentation will describe the objectives, approach, and capabilities of the AIS Net 1000 service architecture. It will also address the operating environment and the resulting architecture of the call, store and forward, and storage services.", } @ARTICLE{Goud8303:Maximal, AUTHOR="M. G. Gouda and Y. T. Yu", TITLE="Maximal Progress State Exploration", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="68-75", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=13, ABSTRACT="Given two machines which communicate by exchanging messages over two finite-capacity channels, it is possible to generate all reachable states of the system and check whether any of them is a nonprogress state. This technique is called state exploration; and it usually requires large execution time and storage. In this paper, we discuss a more efficient variation of this technique. In particular, we show that the task of generating all reachable states can be devided into two independent subtasks. In each subtask, only the states reachable by allowing maximal progress for one machine are generated. We prove that a given system cannot reach a nonprogress state if none of the states generated in each subtask is a nonprogress state. Since the two subtasks are completely independent, and since in most cases the time and storage requirements for each subtask are less than those for the original task, maximal progress state exploration can save time or storage over conventional state exploration.", } @ARTICLE{Niko8303:Methodology, AUTHOR="Christos N. Nikolaou and Edmund M. Clarke and Yang and Nissim Francez and Stephen A. Schuman", TITLE="A Methodology for Verifying Request Processing Protocols", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="76-83", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=18, ABSTRACT="In this paper, we view computer networks as distributed systems that provide their users with a set of services, in a way which hide the distinction between those services which are local and those which are remote. We conceive of a given target network configuration as a network of communicating virtual machines and its behavior is modelled by a system of communicating sequential processes. Network protocols are described by a high level concurrent language (CSP) and a methodology is developed which permits the verification of partial and total correctness assertions about the system in a simple and natural way. Global invariants are used to establish invariant properties of the whole system and histories to record the sequence of communication exchanges between every matching pair of processes. Eventuality properties are expressed using linear temporal logic.", } @ARTICLE{Osse8303:Proving, AUTHOR="Marty Ossefort", TITLE="Proving Safety Properties for a General Communication Protocol", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="84-91", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=7, } @ARTICLE{Aran8303:Staged, AUTHOR="Mauricio Arango and Hussein Badr and Arthur J. Bernstein and D. Gelernter", TITLE="Staged Circuit Switching for Network Computers", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="94-100", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=23, ABSTRACT="Staged circuit switching (SCS) is a message-switching technique that combines a new protocol with new communication hardware. Protocol and hardware are designed specifically for networks that are intended to function as integrated, general-purpose MIMD machines, i.e., for ''network computers''. The SCS protocol is a form of circuit switching that degrades automatically into packet switching when unavailable output lines make further extension of a partial circuit impossible. The SCS hardware uses a front-end crossbar switch to multipex some small number of communication channels among all of a given node's s incident links. Together, hardware and protocol represent an attempt to convert spare bandwidth into lower network delays. They also allow experimentation with networks that reconfigure themselves dynamically in response to measured traffic patterns. We compare SCS to packet switching, circuit switching and the ''virtual cut-through'' protocol of Kermani and Kleinrock, and discuss an SCS implementation designed for the SBN network computer.", } @ARTICLE{Belg8303:Distributed, AUTHOR="Abdelfettah Belghith and L. Kleinrock", TITLE="A Distributed Routing Scheme with Mobility Handling in Stationless Multi-hop Packet Radio Networks", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="101-108", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=22, ABSTRACT="A mobile stationless multi-hop packet radio network consists of a set of mobile and geographically distributed nodes (e.g., computers, terminals, etc., equipped with radio units ), called packet radio units (PRUs), which communicate using a shared broadcast radio channel without a central station control. In this paper we consider the routing in highly mobile stationless multi-hop packet radio networks. We provide a validation of the use of the tier-ring architecture, and we present a scheme for handling mobile packet radio units in stationless environment by the use of a link-traversal approach when a node (packet radio unit) is no longer in possession of an outgoing link to communicate with the rest of the network.", } @ARTICLE{Sloa8303:Mechanisms, AUTHOR="Tansing Sloan", TITLE="Mechanisms that Enforce Bounds on Packet Lifetimes", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="109-109", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, ABSTRACT="For reliable transport protocol operation the lifetime of packets should not exceed an assumed maximum packet lifetime (MPL). A packet's lifetime is spent in nodes and crossing links. Time spent in nodes and on simple links is easily found. Other links or logical links may lose, duplicate, delay, and reorder data and do not provide transit time information. We present a link-transit-time protocol for bounding the transit time of packets that cross such links.", } @ARTICLE{Ansa8303:Description, AUTHOR="P. Ansart and V. Chari and M. Neyer and O. Rafiq and D. Simon", TITLE="Description, Simulation and Implementation of Communication Protocols using {PDIL}", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="113-120", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=23, ABSTRACT="This paper presents the basis of PDIL, a language designed for specifying protocols and services and allowing automatic implementation. The main objectives of the language are unambiguous description, simulation and automatic implementation. The first part presents the objects that PDIL allows to manipulate: machines, channels, contexts, automata, interactions. The second part gives an overview of a PDIL description unit in its language aspect. This paper also introduces general ideas about the description of simulation and automatic implementation of protocols or services. This work is largely based on the present result of subgroups A and B of ISO/SC16/WGL/FDT with significant extensions.", } @ARTICLE{Sari8303:Synchronization, AUTHOR="B. Sarikaya and Gregor V. Bochmann", TITLE="Synchronization Issues in Protocol Testing", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="121-128", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=16, ABSTRACT="Protocol testing for the purpose of certifying the implementation's adherence to the protocol specification can be done with an architecture which includes a remote Tester and a local Responder processes generating specific input stimuli called test sequences. It is possible to adapt test sequence generation methods of finite state machines, namely transition tour, characterization and checking sequence methods to generate test sequences for protocols specified as incomplete finite state machines. For certain test sequences, the Tester or Responder processes are forced to consider the timing of an interaction in which they have not taken part; these test sequences are called nonsynchronizable. The three test sequence generation algorithms are modified to obtain synchronizable test sequences. Checking the protocol designs for intrinsic synchronization problems is also discussed.", } @ARTICLE{Ragh8303:Relationship, AUTHOR="K. S. Raghunathan and J. A. Barchanski and Gregor V. Bochmann", TITLE="Relationship between Performance Parameters for Transport and Network Services", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="129-135", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=10, KEYWORDS="Protocols; OSI reference model; Performance parameters; Performance analysis; Transport protocol; Transport service; Quality of service.", ABSTRACT="Various performance parameters are defined which characterize the quality of service offered by a layer of the OSI model. In particular the parameters for the Transport and Network are considered. The set of parameters are classified into (i) Connection related parameters; and (ii) Access point related parameters. We further make an analysis of the relation between the parameters of the service provided by the Transport layer and the parameters of the Network service used by the Transport protocol, depending on the class of Transport protocol used. This is an example of a hierarchical approach to the evaluation of performance measures for the N-layer service in terms of performance measures of the (N-1) -layer service in conjunction with the performance measures of the N-layer protocol entity.", } @ARTICLE{Denn8303:History, AUTHOR="P. J. Denning and A. C. Hearn and C. William Kern", TITLE="History and Overview of {CSNET}", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="138-145", NOTE="sigcomm", MONTH=mar, YEAR=1983, REFERENCES=5, ABSTRACT="CSNET is the acronym for the Computer Science Research Network, a project supported by NSF to provide advanced computer network services to the computer research community. CSNET is a ''logical net''--a high-level communication environment spanning several physical nets, including the ARPANET, Phonenet, and Telenet. This paper reviews the history, the goals, the organization, the components, and the status of CSNET.", } @ARTICLE{Land8303:Architecture, AUTHOR="Lawrence H. Landweber and M. Litzkow and Donald Neuhengen and M. Solomon", TITLE="Architecture of the {CSNET} Name Server", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="146-153", NOTE="sigcomm", MONTH=mar, YEAR=1983, REFERENCES=16, ABSTRACT="An important function of CSNET is to simplify communication by electronic mail. To this end, a Name Server facility is being implemented, which will free users from having to understand the complexities of inter-network mail addressing. The Name Server includes a database and accessing software on a central Service Host machine, as well as programs and data structures on CSNET member hosts. We describe the architecture of the Name Server and discuss considerations that lead to its design.", } @ARTICLE{Come8303:CSNET, AUTHOR="D. Comer and John T. Korb", TITLE="{CSNET} Protocol Software: The {IP-to-X.25} Interface", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="154-160", NOTE="sigcomm", MONTH=mar, YEAR=1983, REFERENCES=8, } @ARTICLE{Maru8303:Dynamic, AUTHOR="K. Maruyama and David Shorter", TITLE="Dynamic Route Selection Algorithms for Session Based Communication Networks", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="162-169", NOTE="sigcomm", MONTH=mar, YEAR=1983, REFERENCES=12, ABSTRACT="A session-based communication network is a store-and-forward message (or packet) switching network in which each session (conversation from logon until logoff) is assigned to a single communication route (or path) until its termination. Examples of such networks are TYMNET and SNA. A route selection algorithm can be either static or dynamic. A static selection is based on given route selection tables which are usually provided to the system by the system generation process. A dynamic selection uses dynamically changing information of the network for determining an optimal route for the new session to be assigned to. This paper develops both static and dynamic route selection algorithms which may be used in a session-based communication network. Route selection algorithms will be classified into several classes depending on the network work-load information available for making decisions. It will be shown that very simple algorithms give good robustness with good response time.", } @ARTICLE{Elsa8303:Simulation, AUTHOR="M. Y. Elsanadidi and Wesley W. Chu", TITLE="Simulation Studies of the Behavior of Multihop Broadcast Networks", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="170-177", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=8, ABSTRACT="The performance (throughput and delay) of the multihop broadcast communication networks is studied via a simulation model that includes channel access, transmission scheduling, buffer management, and hop-by-hop acknowledgment protocols. The parameters considered are the data and acknowledgment packets transmission probabilities, timeout periods, and buffer sizes. The performance of echo acknowledgment, all-active acknowledgment, and a mixed acknowledgment scheme based on nodes connectivities are also studied. Systems parameters that yield best performance for each configuration are given. Our studies reveal that the string configuration yielded better throughput than the star configuration; further, echo acknowledgment yield better performance than active acknowledgment in a string multihop broadcast network.", } @ARTICLE{Gons8303:Packet, AUTHOR="Timothy A. Gonsalves", TITLE="Packet-Voice Communication on an Ethernet Local Computer Network: An Experimental Study", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="178-185", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=18, ABSTRACT="Local computer networks have been used successfully for data applications such as file transfers for several years. Recently, there have been several proposals for using these networks for voice applications also. We describe a simple voice protocol for use on a packet-switching local network. This protocol is used in an experimental study of the feasibility of using a 3 Mbps experimental Ethernet network for packet-voice communications. The effect of various parameters on performance is examined. The study shows that with appropriately chosen parameters the experimental Ethernet is capable of supporting about 40 simultaneous 64-Kbps two-way voice conversations with acceptable quality. This corresponds to a utilization of 95\% of the network capacity.", } @ARTICLE{Sha8303:Distributed, AUTHOR="L. Sha and E. Lykke Jensen and Richard F. Rashid and J. Duane Northcutt", TITLE="Distributed Co-operating Processes and Transactions", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="188-196", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=19, ABSTRACT="As part of our research in the Archons project on decentralized computers, we have developed a relational mode of data consistency to replace the conventional serialization model for reasoning about the relationships among distributed system data objects in general and state variables in particular. We not only permit but encourage such relationships to be probabilistic, in the interest of efficiency. This model leads to a new formulation of co-operating processes, and thence to the notion of co-operating transactions: co-operating processes whose actions are made atomic for the sake of reliability. We believe that co-operating processes are valuable in a computer network, but essential in a decentralized computer where the conceptual singular but physically dispersed global operating system requires a transaction facility in the kernel. These ideas are illustrated by examples from our initial experience in applying the model to the Accent network operating system and other system software of the Spice personal computing network. This document is intended to be an overview of the synchronization effort in the Archons project, and future publications will elaborate on many of the individual points touched on here.", } @ARTICLE{Batt8303:Interprocess, AUTHOR="G. J. Battarel and H. F. Savary", TITLE="Interprocess Communication System of the {MT35} Digital Exchange", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="197-204", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=19, } @ARTICLE{Toku8303:Interprocess, AUTHOR="H. Tokuda and E. Manning", TITLE="An Interprocess Communication Model for a Distributed Software Testbed", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="205-212", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=20, ABSTRACT="This paper describes design and implementation of an IPC model for a distributed software testbed Shoshin. The IPC model was designed to provide a reliable message communication among distributed processes and to support implementations of user level protocols for various applications. A multiprocess structure, which separates a link level and a transport level, has been used to provide a flexible protocol management. The basic performance of the current implementation and the extensibility of the model are also discussed.", } @ARTICLE{Moll8303:Asynchronous, AUTHOR="Mart L. Molle", TITLE="Asynchronous Multipak Access Tree Algorithms", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="214-218", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=18, ABSTRACT="Random access protocols allow large numbers of low duty cycle stations to exchange messages over a shared communications channel under distributed control. Recently, a new class of random access protocols called ''tree algorithms'' has emerged. Tree algorithms offer several performance advantages over other random access protocols (e.g., ALOHA and CSMA), namely higher capacity and inherently stable operation. However, only synchronous (slotted) tree algorithms have so far been defined. Any practical implementation of a synchronous protocol is complicated by the need for stations to perform the steps of the algorithm synchronously. Thus asynchronous (unslotted) protocols are of greater practical importance, especially for local networks. Here we show how to construct asynchronous versions of several well-known tree algorithms, and describe some of the performance limitations that result from asynchronous operation.", } @ARTICLE{Frat8303:Improved, AUTHOR="L. Fratta", TITLE="An Improved Access Protocol for Data Communication Bus Networks with Control Wire", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="219-225", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=6, ABSTRACT="An efficient algorithm is presented to achieve a conflict-free round-robin access scheme for use in a local area communication network based on the architecture of a Bidirectional Broadcast System to which an unidirectional control wire is added. This algorithm has its origins in the access control algorithm A2 proposed in [1], but it achieves a more efficient use of the bus bandwidth. In fact the time required to switch from one active station to the next in a round is of the order of signal detection time and is independent of the end-to-end network propagation delay.", } @ARTICLE{Meht8303:Acknowledging, AUTHOR="Maneesh Mehta and J. W. Mark", TITLE="Acknowledging {DSMA} with Priority Scheduling for Local Area Networks", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="226-231", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=12, ABSTRACT="A mini-slot, appended to the data slot in the distributed scheduling multiple access (DSMA) protocol described in [1], for the transmission of acknowledgement packets is described and analyzed. The resulting DSMA with fixed slot acknowledgement (DSMA/FSA) presents a better alternative to sending a separate acknowledgement packet for each received data packet. With priority requests, DSMA/FSA appears to be a viable media access protocol for integrated voice and data services in a local area network.", } @ARTICLE{Gran8303:Gateway, AUTHOR="A. Grant and D. Hutchison and W. L. Shepherd", TITLE="A Gateway for Linking Local Area Networks and {X.25} Networks", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="234-239", NOTE="sigcomm", MONTH=mar, YEAR=1983, REFERENCES=14, ABSTRACT="This paper describes the hardware and software architecture of a gateway between an Ethernet-style local area network called Strathnet and an X.25 packet switched network (British Telecom's PSS). The hardware is based on a Motorola 68000 processor using the VME bus, and peripheral boards based on an 8-bit 68120/1 processor for the local network and the X.25 interfaces. The software is layered from the low-level executive, through the three X.25 levels and the transport layer, and through the corresponding layers on the local network side, to the bridging software itself. Both hardware and software are designed so that the system can be a general- purpose gateway; for example, the local area network peripheral board could be replaced by a ring type interface, and the software within the local network layers could similarly be replaced.", } @ARTICLE{Ford8303:Portable, AUTHOR="Warwick S. Ford", TITLE="Portable Implementation of Network Architecture Layers", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="240-245", NOTE="sigcomm", MONTH=mar, YEAR=1983, REFERENCES=8, ABSTRACT="The Australian CSIRONET network links a variety of host mainframes, user terminals, and other systems, via an Australia-wide packet-switching subnetwork comprising over 120 minicomputers. A layered network architecture has been used in integrating different host systems into the network. Portable software has been used extensively in implementing various layers in different systems. This paper discusses the use of portable software in supporting file transfers on CSIRONET. Two important benefits result from the systematic use of portable software. The first is the ease with which a new type of system can be integrated into the network. The second is the high degree of flexibility in changing layer functions and protocols, and propagating these changes to the network interfaces on different systems. The original layer protocols on CSIRONET were CSIRONET-specific. However, as the ISO standards emerge, these are being phased into use through the portable interface software. These portable software concepts have universal value in the present environment of evolving network standards.", } @ARTICLE{Rao8303:X, AUTHOR="K. A. Rao", TITLE="{X.25} Interface to {MARKLINK} Terminal", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="246-253", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=13, ABSTRACT="MARKLINK Terminal (MLT) is a Distributed Data Processing system on the General Electric Information Services Company (GEISCO) network. The GEISCO network is a hierarchical network with the file systems at one end and the terminals at the other. The terminals are connected to the network via remote devices. The MLT X.25 interface connects the MLT to the remote device, Network Gateway, via the Public Data Network. To be cost effective, all the users of an MLT are multiplexted over a single virtual circuit. The interrupte and the clear processes are flow controlled using Network Control Data Packets. MLT initiates, communicates and terminates the communication sessions with the GEISCO network by exchanging the Network Control Data Packets and the User Data Packets. The Network Control Data Packets extend some of the network control functions to the MLT.", } @ARTICLE{Brad8303:Distributed, AUTHOR="R. Braden and Randolph E. Cole and P. Higginson and P. J. Lloyd", TITLE="A Distributed Approach to the Interconnection of Heterogeneous Computer Networks", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="254-259", NOTE="sigcomm", MONTH=mar, YEAR=1983, REFERENCES=14, ABSTRACT="This paper describes a distributed architecture for the flexible interconnection of heterogeneous networks with a number of mini- and micro- computers, in a research environment. The interconnected networks include the DARPA Internet, which uses the DoD protocols, and the X25-based networks PSS and SERCNET. The approach described here distributes the network access into a set of microcomputers acting as network front-ends (''network access machines''), with a local area network (Cambridge Ring) as a common bus. Communication between the hosts and the network access machines uses an interprocessor communication mechanism with a standard transport-level virtual-call interface, which is described. This arrangement provides local hosts with flexible access to any of the networks, and supports a relay system which allows users on one network to access hosts and facilities on any of the other networks.", } @ARTICLE{Marc8303:Lookahead, AUTHOR="S. I. Marcus and G. J. Lipovski", TITLE="Lookahead Network Priority Protocols", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="269-274", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=8, ABSTRACT="A new architecture for local area networks, based on the carry- lookahead circuit has been described in recent papers. It features a cost- effective hardware round-robin priority circuit, a bus and a shift register ring network that uses the same hardware. This paper shows that such an architecture can be used to minimize$\Sigma$ U\_iW\_i where U\_i is a real number urgency and W\_i is a constant, or a time varying function which is a sequence of constant steps. Such a capability is useful in distributed real-time control systems. This paper demonstrates that a network that implements priority, bus and shift register ring-hardware can create new capabilities for local area networks.", } @ARTICLE{Moll8303:Character, AUTHOR="M. K. Molloy", TITLE="Character Delays in Simple {X.3} {PAD} Devices", JOURNAL=ccr, VOLUME=13, NUMBER=2, PAGES="275-279", NOTE="SIGCOMM Symposium", MONTH=mar, YEAR=1983, REFERENCES=8, ABSTRACT="Several options are specified in the X.3 standard for the selection of packet construction time. Some simple queueing theoretic models are constructed to study two of the three alternative criterion, fixed packet size and end of packet character.", } @TECHREPORT{Bren8303:Computation, AUTHOR="R. P. Brent and F. T. Luk and Charles Van Loan", TITLE="Computation of the Singular Value Decomposition Using Mesh-Connected Processors", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-83-05", MONTH=mar, YEAR=1983, } @ARTICLE{LeGa8303:Analytical, AUTHOR="F. Le Gall and J. Bernussou", TITLE="An Analytical Formulation for Grade of Service Determination in Telephone Networks", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=3, PAGES="420-424", MONTH=mar, YEAR=1983, KEYWORDS="GOS", ABSTRACT="The paper provides a simple method for point-to-point blocking estimation in telephone networks. A one-moment method is developed which incorporates the definition of fictitious offered traffic that enables one to take into account the deviation of smooth and peaked traffics from the Poisson. Numerical results illustrate the accuracy of the method.", } @ARTICLE{Olse8303:Digital, AUTHOR="Kenneth H. Olsen and Barry James Folsom and Ronald J. Ham and John R. Clarke", TITLE="Digital's Personal Computers", JOURNAL=ieeeproc, VOLUME=72, NUMBER=3, MONTH=mar, YEAR=1983, REFERENCES=37, ABSTRACT="Digital Equipment Corporation's three series of personal computers have been designed to meet different types of application needs of business and technical users. Common ergonomic concepts were applied in designing two sizes of system units, the keyboard and CRT monitors used with all three series. The hardware architecture of each series was established to attain its specific operating and performance goals at acceptable cost and unit size. Taking use of computers' inherent expandability, there have been major hardware upgrades - in memory, mass storage, and graphics capability in particular - since their introduction. Software upgrades have included implementations of additional industry-standard operating systems with modifications for optimum performance.", } @INPROCEEDINGS{Kuhl8304:Error, AUTHOR="Diana F. Kuhl", TITLE="Error Recovery Protocols: Link by Link vs. Edge to Edge", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Diego, California", PAGES="319-324", MONTH=apr, YEAR=1983, KEYWORDS="error recovery", } @ARTICLE{Amer8304:Measuring, AUTHOR="P. D. Amer and R. Rosenthal and R. E. Toense", TITLE="Measuring a local network's performance", JOURNAL=datacommunications, PAGES="173-182", MONTH=apr, YEAR=1983, REFERENCES=5, KEYWORDS="Network measurement; hardware monitor; artificial traffic; traffic generator; utilization; fairness; measurement; NBSnet; stability", } @ARTICLE{Bray8304:Survivable, AUTHOR="Kenneth Brayer", TITLE="Implementation and performance of survivable computer communication with autonomous decentralized control", JOURNAL=ieeecm, VOLUME=21, NUMBER=4, PAGES="34-41", MONTH=apr, YEAR=1983, REFERENCES=6, KEYWORDS="Packet switching; routing algorithm; computer network; DECENTRALIZED CONTROL; FAIL SAFE; FAULT TOLERANCE", ABSTRACT="A survivable, flexible, computer-communications routing algorithm has been developed. This algorithm permits nodal computers to autonomously create a network and then continue to adapt to changes in network topology, that is, changes in the interconnecti ons between nodes and changes in the sign-on of addresses of various nodes. The algorithm depends on a small amount of additional information, the message path being appended on each", } @TECHREPORT{Hear83:REDUCE, AUTHOR="A. C. Hearn and J. Marti and others", TITLE="{REDUCE} user's manual, version 3.0 (standard {LISP} report)", INSTITUTION="University of Utah", NUMBER="TR-6", PAGES="1-135", NOTE="RAND publication CP78 (UUCS-78-101)", MONTH=apr, YEAR=1983, KEYWORDS="Reduce; LISP", } @INPROCEEDINGS{Joha8304:Burroughs, AUTHOR="S. Johari", TITLE="Burroughs network architecture: an overview", BOOKTITLE=infocom, ADDRESS="San Diego", PAGES="503-511", MONTH=apr, YEAR=1983, } @ARTICLE{VanT8304:Operating, AUTHOR="A. M. VanTilborg and L. D. Wittie", TITLE="Operating systems for the micronet computer", JOURNAL=ieeemicro, VOLUME=3, PAGES="38-47", MONTH=apr, YEAR=1983, } @INPROCEEDINGS{Cela8304:STELLA, AUTHOR="N. Celandroni", TITLE="{STELLA} --- Satellite Interconnection of Local Area Networks: Architecture and Protocols", BOOKTITLE="IFIP International Symposium Satellite and Computer Communications, North-Holland", ADDRESS="Versailles", PAGES="25-40", MONTH=apr, YEAR=1983, } @TECHREPORT{Larm8304:JNT, AUTHOR="J Larmouth", TITLE="{JNT} Name Registration Technical Guide", INSTITUTION="Salford University Computer Centre", MONTH=apr, YEAR=1983, KEYWORDS="Nrs", } @INCOLLECTION{Lloy8304:Comparative, AUTHOR="P. J. Lloyd and Randolph E. Cole", TITLE="A Comparative Study of Protocol Performance on the {UNIVERSE} and {SATNET} Network Systems", BOOKTITLE="Satellite and Computer Communications", EDITOR="J.-L. Grange", PUBLISHER="North Holland", ADDRESS="Versailles", PAGES="353-367", MONTH=apr, YEAR=1983, KEYWORDS="performance; SATNET; UNIVERSE", } @INPROCEEDINGS{Maju8304:New, AUTHOR="J. Majus", TITLE="Performance of some New Link Control Procedures under Precipitation Fades of Domestic Satellite Systems", BOOKTITLE="IFIP International Symposium on Satellite and Computer Communications, North-Holland, Versailles", MONTH=apr, YEAR=1983, } @ARTICLE{Spec8304:Transactions, AUTHOR="A. Z. Spector and P. M. Schwartz", TITLE="Transactions: A Construct for Reliable Distributed Computing", JOURNAL=acmosrev, VOLUME=17, NUMBER=2, PAGES="18-35", MONTH=apr, YEAR=1983, } @ARTICLE{Burt8304:Laplacian, AUTHOR="Peter Burt and Edward H. Adelson", TITLE="The Laplacian Pyramid as a compact image code", JOURNAL=ieeecom, PUBLISHER="IEEE", VOLUME="COM-31", NUMBER=4, PAGES="532-540", MONTH=apr, YEAR=1983, KEYWORDS="video compression", } @INPROCEEDINGS{Schw8304:Analytic, AUTHOR="M. Schwartz and B. Kraimeche", TITLE="An Analytic Control Model for an Integrated Node", BOOKTITLE=infocom, ADDRESS="San Diego, California", PAGES="540-546", MONTH=apr, YEAR=1983, KEYWORDS="Queueing system; hybrid switching", ABSTRACT="We present in this paper a general queueing model for an integrated node accomodating multi-bandwidth circuit switched and packet switched traffic sharing dynamically a wideband TDM channel. The generality of the circuit traffic model and its computational aspects are investigated. A useful state transformation allows us to model the packet subsystem as a single server queue with random service capacity. A state dependent", } @ARTICLE{Neum8304:OSI, AUTHOR="John Neumann", TITLE="{OSI} transport and session layers: service and protocols", JOURNAL=ieeeproc, PAGES="115-123", MONTH=apr, YEAR=1983, } @INPROCEEDINGS{Reis8305:Queueing, AUTHOR="M. Reiser", TITLE="Queueing and Delay Analysis of a Buffer Pool with Resume Level", BOOKTITLE="9th International Symposium on Computer Performance Modelling, Measurement, and Evaluation (Performance)", EDITOR="A. K. Agrawala and Satish K. Tripathi", ORGANIZATION="IFIP Working Group 7.3", PUBLISHER="North-Holland", ADDRESS="College Park, Maryland", PAGES="25-31", MONTH=may, YEAR=1983, ANNOTE="$M/M/1/K$-type system, where input traffic resumes only after queue level drops below $N < K$; provides state probabilities at message arrival and Laplace transform of delay distribution", } @ARTICLE{Mack8305:Packet, AUTHOR="Andrew J. Mackie and Salah E. Aidarous and S. A. Mahmoud and J. Spruce Riordon", TITLE="Design and performance evaluation of a packet voice system", JOURNAL=ieeevt, VOLUME="VT-32", NUMBER=2, PAGES="158-168", MONTH=may, YEAR=1983, KEYWORDS="packet voice; simulation", ABSTRACT="A packet voice network has been designed using adaptive delta modulators. Tests were performed to examine the effects of packet length and packet loss rate on digital voice intelligibility. The packet voice network was simulated using a SLAM network model to find queue size requirements as a function of packet size, delay distribution, and expiring time out. The queueing strategy is investigated in order to minimize total information loss during channel acquisition delays. Voice is coded using continuously variable slope delta modulation (CVSD) at a rate of 16 kb/s. No silence detection is employed.", ANNOTE="Unreadable; experiments use non-standard methods and are not well described; ignorant of other work in field.", } @ARTICLE{Kirk8305:Optimization, AUTHOR="S. Kirkpatrick and C. D. Gelatt and M. P. Vecchi", TITLE="Optimization by Simulated Annealing", JOURNAL="Science", VOLUME=220, NUMBER=4598, PAGES="671-680", MONTH=may, YEAR=1983, } @ARTICLE{Eage8305:Bound, AUTHOR="D. L. Eager and K. C. Sevcik", TITLE="Performance bound hierarchies for queueing networks", JOURNAL=tocs, VOLUME=1, NUMBER=2, PAGES="99-115", MONTH=may, YEAR=1983, KEYWORDS="Queueing network; product form; analysis", } @INPROCEEDINGS{Post8305:Telnet, AUTHOR="J. B. Postel and J. F. Reynolds", TITLE="Telnet Protocol Specification {NIC-RFC-854}", BOOKTITLE="DDN Protocol Handbook", PUBLISHER="U.S. Department of Defense", VOLUME=2, PAGES="2.575-2.589", MONTH=may, YEAR=1983, } @ARTICLE{Gee8305:Using, AUTHOR="K. Gee", TITLE="Using a local area network of micro computers", JOURNAL="Electronics and power", VOLUME=29, PAGES="399-400", MONTH=may, YEAR=1983, } @INPROCEEDINGS{Cole8305:Interconnecting, AUTHOR="Randolph E. Cole and P. Higginson", TITLE="Issues in Interconnecting Local and Wide Area Networks", BOOKTITLE="Business Telecom Conference", ADDRESS="London", PAGES="231-241", MONTH=may, YEAR=1983, KEYWORDS="Lan; wan", } @ARTICLE{ECMA8305:Message, AUTHOR="Eva Ma", TITLE="Message Interchange Distributed Application Standard (4th draft)", JOURNAL="European Computer Manufacturers Association", INSTITUTION="ECMA", MONTH=may, YEAR=1983, } @INPROCEEDINGS{Neuf8305:EAN, AUTHOR="G. W. Neufeld", TITLE="{EAN:} A distributed message system", BOOKTITLE="CIPS National Meeting", PAGES="144-149", MONTH=may, YEAR=1983, KEYWORDS="ean", ABSTRACT="General description of EAN", } @ARTICLE{Park8305:Detection, AUTHOR="D. S. Parker and G. J. Popek", TITLE="Detection of Mutual Inconsistency in Distributed Systems", JOURNAL=ieeese, VOLUME="SE-9", NUMBER=3, PAGES="240-247", MONTH=may, YEAR=1983, } @TECHREPORT{Taka8305:Throughput, AUTHOR="H. Takagi", TITLE="Analysis of Throughput and Delay for Single- and Multi-Hop Packet Radio Networks", INSTITUTION="Computer Science Dept, University of California", ADDRESS="Los Angeles", NUMBER="CSD-830523", MONTH=may, YEAR=1983, } @TECHREPORT{Loka8305:Use, AUTHOR="Christopher J. Lokan", TITLE="The Use of Predicted Program behaviour in defining a context-sensitive architecture", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-83-09", MONTH=may, YEAR=1983, } @TECHREPORT{Bren8305:Systolic, AUTHOR="R. P. Brent and H. T. Kung", TITLE="Systolic {VLSI} arrays for Linear-time {GCD} computation", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-83-08", MONTH=may, YEAR=1983, } @TECHREPORT{Loka8305:Static, AUTHOR="Christopher J. Lokan", TITLE="Static prediction of dynamic program profiles", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-83-07", MONTH=may, YEAR=1983, } @TECHREPORT{Loka8305:Dynamic, AUTHOR="Christopher J. Lokan", TITLE="A dynamic analysis of the use of loops and if-statements in Pascal Programs", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-83-06", MONTH=may, YEAR=1983, } @ARTICLE{Akim8306:Approximate, AUTHOR="H. Akimaru and H. Takahashi", TITLE="An Approximate Formula for Individual Cell Losses in Overflow Systems", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=6, PAGES="808-811", MONTH=jun, YEAR=1983, KEYWORDS="queueing theory; blocking systems", ABSTRACT="A simple approximate formula for estimating individual call losses in overflow systems is derived using the interrupted Poisson process. The formula presents good accuracy in the single-overflow model, and it is also applicable in the multioverflow model. It is expected that the present formula is useful for the optimization of systems under given service criteria.", } @INPROCEEDINGS{Clar8306:Prioritized, AUTHOR="Loren Clare and I. Rubin", TITLE="On the Design of Prioritized Multiplexing Systems", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Boston, Massachusetts", PAGES="1344-1348 (E5.3)", MONTH=jun, YEAR=1983, KEYWORDS="discrete time queue", ANNOTE="Synchronous discrete-time queues. I.i.d. Bulk arrivals from $K$ sources (classes), finite capacity, FCFS, deterministic service. Strict priority in service and buffer preemption. Defines feasible regions of losses for each class.", } @INPROCEEDINGS{Fory8306:New, AUTHOR="L. J. Forys", TITLE="Performance Analysis of a New Overload Strategy", BOOKTITLE=itc10, ORGANIZATION="IAC", PUBLISHER="North Holland", ADDRESS="Montreal, Canada", PAGES="5.24", MONTH=jun, YEAR=1983, ANNOTE="Describes and analyzes overload control strategy for digit receivers in No. 1 ESS. Service is LCFS (LIFO), with periodic rejoining of patient customers. Uses diffusion approximation, simulation and field measurements.", } @INPROCEEDINGS{Suda8306:Packetized, AUTHOR="T. Suda and Y. Yemini and H. Miyahara and Toshiharu Hasegawa", TITLE="Performance Evaluation of a Packetized Voice System --- Simulation Study", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Boston, Massachusetts", PAGES="749-753", MONTH=jun, YEAR=1983, KEYWORDS="packet voice", ANNOTE="see \cite{Suda84:Performance}", } @INPROCEEDINGS{Yum8306:Algorithm, AUTHOR="Takshing P. Yum and Hung-Ming Yen", TITLE="Design Algorithm for a Hysteresis Buffer Congestion Control Strategy", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Boston, Massachusetts", PAGES="499-503 (B5.5)", MONTH=jun, YEAR=1983, ANNOTE="Flow control. Buffer allocation to input and transit packets.", } @INPROCEEDINGS{Srir8306:Buffered, AUTHOR="K. Sriram and Pramod K. Varshney and J. G. Shantikumar", TITLE="Buffered digital speech interpolation with fixed delay", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Boston, Massachusetts", VOLUME=2, PAGES="1080-1084 (D6.2)", MONTH=jun, YEAR=1983, KEYWORDS="speech transmission; packet voice; DSI; digital speech interpolation; discrete-time queues", ABSTRACT="While in conversation, a speaker alternates between talkspurts and silences, and is in talkspurt for less than half the time. This fact motivated the design of time assigned speech interpolation (TASI) on FDM channels and digital speech interpolation (DSI) on TDM channels. Buffered DSI schemes were proposed to eliminate or reduce speech clipping at the expense of delay. A buffered DSI scheme with variable talkspurt delays requires speech fill-in to keep the speech impairment tolerable. In the fixed delay buffered DSI scheme proposed here, fill-in is not required. Hence, all the silences that naturally occur in speech are fully utilized. Since fill-in is not used, the talkspurts and silences have shorter mean durations. Consequently, substantial increase in DSI advantage is achieved in the fixed-delay buffered DSI scheme. We present a discrete-time analysis of the scheme. Our numerical examples show that 10-20\% increase in the DSI advantage is achieved by permitting a fixed delay not exceeding 0.5 sec.", ANNOTE="Synchronous, framed system.", } @INPROCEEDINGS{Eckb8306:Generalized, AUTHOR="Ted Eckberg", TITLE="Generalized peakedness of teletraffic processes", BOOKTITLE=itc10, PUBLISHER="North-Holland", ADDRESS="Montreal, Canada", MONTH=jun, YEAR=1983, KEYWORDS="traffic characterization; peakedness; overflow streams", ABSTRACT="Peakedness has proven to be a very useful partial characterization of overflow streams, and techniques based on peakedness for approximating the blocking experienced by superpositions of such streams are frequently used (e.g., the equivalent random method and Hayward's approximation). This paper puts peakedness in a more general framework, allowing an arbitrary stationary arrival stream to be characterized by its peakedness functional. This functional provides a convenient second-order characterization of an arrival stream, and quantifies the variability in congestion resulting from the interaction of the stream with a variety of service systems. A general theory for representations and properties of peakedness functionals is developed and illustrated with examples. It can be shown, e.g., that excessive variability in an arrival stream tends to be smoothed out by variable system holding times, while it is accentuated by holding time regularity.", } @ARTICLE{Voyd8306:Security, AUTHOR="Victor L. Voydock and Stephen T. Kent", TITLE="Security mechanisms in high-level network protocols", JOURNAL=acmcs, VOLUME=15, NUMBER=2, PAGES="135-171", MONTH=jun, YEAR=1983, REFERENCES=39, KEYWORDS="security; encryption; end-to-end security; data encryption standard; DES; DES-CBC; DES-ECB; public key cryptography; authentication; denial-of-service attacks; survey; communication protocol; reliability; survey", ABSTRACT="The implications of adding security mechanisms to high-level network protocols operating in an open-system environment are analyzed. First the three threats to security that may arise in such an environment are described, and then a set of goals for communications security measures is established. This is followed by a brief description of the two basic approaches to communications security, link-oriented measures and end-to-end measures, which concludes that end-to-end measures are more appropriate in an open system environment. Next, relevant properties of data encryption --- the fundamental technique on which all communications security mechanisms are based -- are discussed. The remainder of the paper describes how end-to-end measures can be used to achieve each of the security goals previously established.", ANNOTE="CBC IVs must be pseudorandomly selected or be different for each PDU of each association.", } @INPROCEEDINGS{Manf8306:Queueing, AUTHOR="David R. Manfield and P. Tran", TITLE="Queueing Analysis of an Arrival-Driven Message Transfer Protocol", BOOKTITLE=itc10, ADDRESS="Montreal, Quebec", PAGES="4.1.4,1-7", MONTH=jun, YEAR=1983, REFERENCES=7, KEYWORDS="Queueing theory; protocol; SPC; switching system", ANNOTE={In SPC switching systems with distributed architecture, the overall performance is affected by the efficiency of the messaging protocols used for inter-processor communication. In this paper the performance analysis of a queueing model for a messaging protocol called "collect $n$ with timeout" is presented, in which the major performance measures are derived, along with numerical results to demonstrate the optimising effect of the prot. parameter}, } @INPROCEEDINGS{Jans8306:Queueing, AUTHOR="H. Jans", TITLE="On queueing systems with clocked operation and priorities", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", MONTH=jun, YEAR=1983, KEYWORDS="Queueing system; priority", } @INPROCEEDINGS{Akin8306:Overload, AUTHOR="J. M. Akinpelu", TITLE="The Overload Performance of Engineered Networks with Nonhierarchical and Hierarchical Routing", BOOKTITLE=itc10, MONTH=jun, YEAR=1983, } @INPROCEEDINGS{Regn8306:Grade, AUTHOR="J. Regnier and P. Blondeau and W. H. Cameron", TITLE="Grade of Service of a Dynamic Call Routing System", BOOKTITLE=itc10, MONTH=jun, YEAR=1983, } @ARTICLE{Cole8306:International, AUTHOR="Randolph E. Cole and P. Higginson and P. J. Lloyd and R. Moulton", TITLE="International net faces problems handling mail and file transfer", JOURNAL=datacommunications, PUBLISHER="McGraw-Hill", VOLUME=12, NUMBER=6, PAGES="175-187", MONTH=jun, YEAR=1983, } @INPROCEEDINGS{Aida8306:Packetized, AUTHOR="Salah E. Aidarous and S. A. Mahmoud and J. Spruce Riordon", TITLE="Performance Analysis of a Packetized Voice Radio Network", BOOKTITLE=icc, ADDRESS="Boston, Massachusetts", PAGES="B8.7.1-7.", MONTH=jun, YEAR=1983, KEYWORDS="packet voice; packet radio; performance evaluation; network", } @INPROCEEDINGS{Hoan8306:Dynamic, AUTHOR="A. J. van and J. W. Roberts", TITLE="Dynamic Resource Allocation in the Telecom 1 Satellite System", BOOKTITLE=icc, ADDRESS="Boston, Massachusetts", PAGES="897-902 (D1.4.1-6)", MONTH=jun, YEAR=1983, KEYWORDS="Satellite radio; resource allocation", } @ARTICLE{Coop8306:Cellular, AUTHOR="George R. Cooper and R. W. Nettleton", TITLE="Cellular Mobile Technology: the Great Multiplier", JOURNAL=ieeespec, VOLUME=20, PAGES="30-37", MONTH=jun, YEAR=1983, REFERENCES=14, KEYWORDS="Cellular System", } @TECHREPORT{Kris8306:En, AUTHOR="B. S. Kristensen", TITLE="En Brugers Ventetidsproblemer ved Kommunikation i et Datanetværk", INSTITUTION="Specialeopgave ved Matematisk Inst., Aarhus University", ADDRESS="Aarhus, Denmark", PAGES=136, MONTH=jun, YEAR=1983, LANGUAGE="Danish", KEYWORDS="protocol; ISO reference model", } @INPROCEEDINGS{Robe8306:Modéles, AUTHOR="J. W. Roberts", TITLE="Modéles de Télétrafic pour le Réseau a Intégration de Services du Satellite {TELECOM} 1", BOOKTITLE=itc10, ADDRESS="Montreal, Canada", MONTH=jun, YEAR=1983, LANGUAGE="French", KEYWORDS="Service integration", } @TECHREPORT{Mart8306:Nonstationary, AUTHOR="O. Martikainen", TITLE="On nonstationary birth and death processes", INSTITUTION="Technical Research Center of Finland, Telecommunications Laboratory", ADDRESS="Espoo, Finland", PAGES=5, DAYS=21, MONTH=jun, YEAR=1983, KEYWORDS="Markov process", } @TECHREPORT{McKu8307:Fast, AUTHOR="Marshall K. McKusick and William N. Joy and Samuel J. Leffler and R. S. Fabry", TITLE="A fast file system for {UNIX}", TYPE="PROGRES Report", INSTITUTION="Computer Science Division, University of California", ADDRESS="Berkeley, California", NUMBER="UCB/CSD 83/147", MONTH=jul, YEAR=1983, KEYWORDS="file system; UNIX; BSD", ABSTRACT="A reimplementation of the UNIX file system is described. The reimplementation provides substantially higher througput rates by using more flexible allocation policies that allow better locality of reference and that can be adapted to a wide range of peripheral and processor characteristics. The new file system clusters data that is sequentially accessed and provides two block sizes to allow fast access to large files while not wasting large amounts of space for small files. File access rates of up to ten times faster than the traditional UNIX file system are experienced. Long needed enhancements to the user interface are discussed. These include a mechanism to lock files, extensions of the name space across file systems, the ability to use arbitrary length file names, and provisions for efficient administrative control of resource usage.", } @ARTICLE{Adam8307:Achieving, AUTHOR="N. R. Adam", TITLE="Achieving a confidence interval for parameters estimated by simulation", JOURNAL=ms, VOLUME=29, NUMBER=7, PAGES="856-866", MONTH=jul, YEAR=1983, KEYWORDS="Simulation; statistical technique; confidence interval", } @ARTICLE{Barn8307:Priority, AUTHOR="J. A. Barnett and A. S. Cooperband", TITLE="Priority is a limited property", JOURNAL=acmosrev, VOLUME=17, NUMBER=3, PAGES=9, MONTH=jul, YEAR=1983, KEYWORDS="Queueing system; priority; analysis", } @ARTICLE{Wegn8307:Processes, AUTHOR="P. Wegner and S. A. Smolka", TITLE="Processes, Tasks, and Monitors: A Comparative Study of Concurrent Programming Primitives", JOURNAL=ieeese, VOLUME="SE-9", NUMBER=4, PAGES="446-462", MONTH=jul, YEAR=1983, } @ARTICLE{Bern8307:Interconnection, AUTHOR="G. Bernard", TITLE="Interconnection of local computer networks: modelling and optimization problems", JOURNAL=ieeese, VOLUME="SE-9", PAGES="463-470", MONTH=jul, YEAR=1983, } @TECHREPORT{Leff8307:Networking, AUTHOR="Samuel J. Leffler", TITLE="{4.2BSD} Networking Implementation Notes", INSTITUTION="Computer Systems Research Group, University of California, Berkeley", MONTH=jul, YEAR=1983, } @TECHREPORT{LeLa8307:Real, AUTHOR="G. LeLann", TITLE="Real-Time {LANs}", INSTITUTION="Advanced Course on LANs, University of Strathclyde", MONTH=jul, YEAR=1983, } @ARTICLE{Lisk8307:Guardians, AUTHOR="B. Liskov and R. Scheifler", TITLE="Guardians and Actions: Linguistic Support for Robust Distributed Programs", JOURNAL=toplas, VOLUME=5, NUMBER=3, PAGES="381-404", MONTH=jul, YEAR=1983, } @TECHREPORT{Bren8307:Solution, AUTHOR="R. P. Brent and F. T. Luk", TITLE="The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays", INSTITUTION="Cornell University, Computer Science Department", NUMBER="TR83-562", PAGES=34, MONTH=jul, YEAR=1983, ABSTRACT="Parallel Jacobi-like algorithms are presented for computing a singular-value decomposition of an $mxn$ matrix $(m \geq n)$ and an eigenvalue decomposition of an $n x n$ symmetric matrix. A linear array of $O(n)$ processors is proposed for the singular-value problem and the associated algorithm requires time $O(mnS)$, where $S$ is the number of sweeps (typically $S \leq 10)$. A square array of $O(n^{2})$ processors with nearest-neighbor communication is proposed for the eigenvalue problem; the associated algorithm requires time $O(nS)$. Key Words And Phrases: Multiprocessor arrays, systolic arrays, singular-value decomposition, eigenvalue decomposition, real symmetric matrices, Hestenes method, Jacobi method, VLSI, real-time computation, parallel algorithms.", } @ARTICLE{Call8307:Proposal, AUTHOR="R. Callon", TITLE="Proposal for a Connection-Oriented Internetwork Protocol", JOURNAL=ccr, VOLUME=13, NUMBER=3, PAGES="10-18", MONTH=jul, YEAR=1983, REFERENCES=8, } @ARTICLE{Boul8307:Bus, AUTHOR="P. Boulton and Shiang-feng Lee", TITLE="Bus, Ring, Star, and Tree Local Area Networks", JOURNAL=ccr, VOLUME=13, NUMBER=3, PAGES="19-24", MONTH=jul, YEAR=1983, REFERENCES=8, ABSTRACT="This paper examines some of the relative merits of Bus, Ring, and Star topologies for Local Area Networks, and describes a new structure-- the dual rooted tree. The latter produces superior performance for heavy loads and for impulse loads, while avoiding the message length limitations associated with CSMA LAN's. A 50 Mbit/s fibre-optic prototype network has been constructed and tested. A large (250 port) 50 Mbit/s fibre-optic field trial network is now being installed at the University of Toronto.", } @ARTICLE{Pogr8307:Selection, AUTHOR="K. T. Pogran", TITLE="Selection of a Local Area Network for the Cronus Distributed Operating System", JOURNAL=ccr, VOLUME=13, NUMBER=3, PAGES="25-35", MONTH=jul, YEAR=1983, REFERENCES=1, ABSTRACT="The Cronus Distributed Operating System, under development at Bolt Beranek and Newman Inc., employs high-bandwidth local area network technology to interconnect processing elements that are members of a Cronus ''cluster''. One requirement imposed upon the Cronus development was that the system employ ''commercial, off-the-shelf'' local area network technology. This paper describes the requirements we established for the Cronus local area network and the selection process we employed, and gives our reasons for choosing ETHERNET technology.", } @ARTICLE{Oppe8307:Clearinghouse, AUTHOR="D. C. Oppen and Y. Dalal", TITLE="The Clearinghouse: A Decentralized Agent for Locating Named Objects in a Distributed Environment", JOURNAL=toois, VOLUME=1, NUMBER=3, PAGES="230-253", MONTH=jul, YEAR=1983, } @INPROCEEDINGS{Vo8307:Modeling, AUTHOR="T. Vo-Dai", TITLE="Modeling and Analysis of Computer and Communication Systems with Queueing Networks: An Analytical Study", BOOKTITLE="11th IFIP Conference for Sciences", ADDRESS="Copenhagen, Denmark", VOLUME=59, PAGES="650-661", MONTH=jul, YEAR=1983, KEYWORDS="Communication network; model", } @INPROCEEDINGS{Bacc8307:Models, AUTHOR="François Baccelli and G. Fayolle", TITLE="Analysis of Models Reducible to a Class of Diffusion Processes in the Positive Quarter Plane", BOOKTITLE="11th IFIP Conference on System Modelling and Optimization", ADDRESS="Copenhagen, Denmark", PAGES=37, DAYS=25, MONTH=jul, YEAR=1983, KEYWORDS="Diffusion approximation; analysis; model", } @ARTICLE{Ho8308:Perturbation, AUTHOR="Yu-Chi Ho and Xi-Ren Cao", TITLE="Perturbation Analysis and Optimization of Queueing Networks", JOURNAL="Journal of Optimization Theory and Applications", VOLUME=40, NUMBER=4, PAGES="559-582", MONTH=aug, YEAR=1983, KEYWORDS="perturbation analysis", } @TECHREPORT{Fode8308:Language, AUTHOR="John K. Foderaro", TITLE="The design of a language for algebraic computation systems", TYPE="Report", INSTITUTION="Computer Science Division (EECS), University of California", ADDRESS="Berkeley, California", NUMBER="UCB/CSD 83/160", MONTH=aug, YEAR=1983, KEYWORDS="symbolic algebra; computer languages; object-oriented languages", ABSTRACT="This thesis describes the design of a language to support mathematics-oriented symbolic algebra systems. The language, which we have names NEWSPEAK, permits the complex interrelations of mathematical types, such as rings, fields and polynomials to be described. Functions can be written over the most general type that has the required operations and properties and then inherited by subtypes. All function calls are generic, with most function resolution done at compile time. Newspeak is type-safe, yet permits run-time creation of types.", } @TECHREPORT{Pond8308:Ldots, AUTHOR="Carl Ponder", TITLE="``\ldots but will {RISC} run {LISP?''} (a feasibility study)", TYPE="Technical Report", INSTITUTION="Computer Science Division (EECS), University of California", ADDRESS="Berkeley, California", NUMBER="UCB/CSD 83/122", MONTH=aug, YEAR=1983, KEYWORDS="LISP; RISC; computer architecture; computer languages; compiler", ABSTRACT="The Berkeley RISC microprocessor, developed under the direction of David Patterson and Carlo Sequin, is targeted for efficient execution of C programs. The architecture has competed successfully with existing systems such as Vax 11/780 and MC68000. A major question about such a reduced, targeted architecture is how well it extends to other languages. An important language in symbolic computation is Lisp. Lisp is a functional language which has little in common with the standard block structured languages such as C. This has led to the often-asked question -- ``will RISC run LISP?''. The purpose of this paper is to explore the feasibility of a LISP system running on RISC. The major parts of this include a look at the behavior of large-scale ``typical'' Lisp programs, and an examination of current LISP implementations.", } @ARTICLE{Lerc8308:Computer, AUTHOR="Irving A. Lerch", TITLE="Computer Conferencing: New tool for scientific communication", JOURNAL="Physics Today", VOLUME=36, NUMBER=8, PAGES="9, 90-91", MONTH=aug, YEAR=1983, KEYWORDS="computer conferencing", ABSTRACT="This article discusses use of computer conferencing systems for scientific communication. It mentions Participate, NOTEPAD, Hub/Planet, and EIES. It is generally a rah-rah about conferencing. No bibliography", } @ARTICLE{Geor8308:Algorithm, AUTHOR="R. George", TITLE="Algorithm 200: Normal random", JOURNAL=cacm, VOLUME=6, NUMBER=8, MONTH=aug, YEAR=1983, KEYWORDS="random variate generation; random variables; random number generation", } @ARTICLE{Burr8308:Overview, AUTHOR="W. R. Burr", TITLE="An Overview of the Proposed American National Standard for Local Distributed Data Interfaces", JOURNAL=cacm, VOLUME=26, NUMBER=8, PAGES="554-561", MONTH=aug, YEAR=1983, } @ARTICLE{Live8308:Protection, AUTHOR="J. Livesey and E. Manning", TITLE="Protection and Synchronisation in a Message-Switched System", JOURNAL=cn, VOLUME=7, NUMBER=4, PAGES="253-268", MONTH=aug, YEAR=1983, } @ARTICLE{Salz8308:Ring, AUTHOR="J. H. Salzter and K. T. Progran and D. D. Clark", TITLE="Why A Ring?", JOURNAL=cn, VOLUME=7, NUMBER=4, PAGES="223-232", MONTH=aug, YEAR=1983, } @ARTICLE{Davi8308:Access, AUTHOR="P. Davies and F. A. Ghani", TITLE="Access protocols for an optical fibre ring network", JOURNAL=comcom, VOLUME=6, PAGES="178-184", MONTH=aug, YEAR=1983, } @ARTICLE{Rams8308:Generating, AUTHOR="L. A. Ramshaw and P. D. Amer", TITLE="Generating artificial traffic over a local area network using random number generators", JOURNAL=cn, VOLUME=4, PAGES="233-251", MONTH=aug, YEAR=1983, } @ARTICLE{Weav8308:Broadcast, AUTHOR="K. Weaving", TITLE="Broadcast service implementation on a packet switched network", JOURNAL=comcom, VOLUME=6, PAGES="178-184", MONTH=aug, YEAR=1983, } @ARTICLE{Baue8308:Key, AUTHOR="R. K. Bauer and T. A. Berson and R. J. Feiertag", TITLE="A Key Distribution Protocol Using Event Markers", JOURNAL=tocs, VOLUME=1, NUMBER=3, PAGES="249-255", MONTH=aug, YEAR=1983, } @ARTICLE{Stal8308:Local, AUTHOR="P. Stallings", TITLE="Beyond Local Networks", JOURNAL=datamation, VOLUME=23, NUMBER=8, PAGES="166-179", MONTH=aug, YEAR=1983, } @TECHREPORT{Coop8308:Argument, AUTHOR="G. H. Cooper", TITLE="An Argument for Soft Layering of Protocols", TYPE="Technical Report", INSTITUTION="MIT Laboratory for Computer Science", ADDRESS="Cambridge, Massachusetts", NUMBER="TR 300", MONTH=aug, YEAR=1983, KEYWORDS="protocol architecture; protocol implementation", ABSTRACT={This thesis is about the efficiency of protocol layering. It examines the technique of protocol layering in an abstract way and finds two major sources of inefficiency in protocol implementations which are caused by the imposition on them of a layered structure. The conventional approach to making layered protocol implementations run efficiently -- for avoiding the sources of inefficiency discussed herein -- are all independent of the protocol specification, and thus all decrease the value of the protocol specification as a guidefor implementing protocols. We introduce a new means of avoiding the problems of layered protocol implementations which operates within the domain of the protocol specification. We allow an increase in the flow of state information between the layers of a layered protocol implementation in a very controlled manner, so as to decrease the modularity of the protocol architecture as little as possible. The increased flow of information is specified in the protocol specification as a model of all the layered protocols that use the protocol being specified, called the "usage mode." Since our approach decreases the rigidity of the layered structure without entirely eliminating it, we coin the term "Soft Layering" for the approach.}, URL="http://ana-www.lcs.mit.edu/anaweb/abstracts/tr-300.html", } @TECHREPORT{Asmu8308:K, AUTHOR="S. Asmussen", TITLE="K -teori", INSTITUTION="Naturligvis - Naturvidenskab på Kobenhavns Universitet", PAGES="20-21", MONTH=aug, YEAR=1983, KEYWORDS="Queueing theory", } @ARTICLE{Walk8308:Recent, AUTHOR="A. J. Walker", TITLE="Some Recent Advances in Radio Communications", JOURNAL=ieeecm, PAGES="51-53", MONTH=aug, YEAR=1983, KEYWORDS="Mobile radio", } @ARTICLE{Half8309:Batch, AUTHOR="S. Halfin", TITLE="Batch Delays Versus Customer Delays", JOURNAL=bstj, VOLUME=62, NUMBER=7, PAGES="2011-2015", MONTH=sep, YEAR=1983, KEYWORDS="queueing theory", ANNOTE="For geometric batch sizes, the customer delay distribution is the same as the distribution of the last served customer of a batch.", } @INPROCEEDINGS{Tran8309:Simulation, AUTHOR="P. Tran-Gia", TITLE="Simulation of Instationary Processes for Performance Evaluations of Switching Systems", BOOKTITLE="1st European Simulation Congress", ADDRESS="Aachen, West Germany", PAGES=6, MONTH=sep, YEAR=1983, REFERENCES=5, KEYWORDS="simulation method; transient behaviour; queueing system", ABSTRACT="A simulation method for investigations of transient behaviour ofqueueing systems is described. The method is based on a modific ation of the event-by-event simulation technique where arrivals according to time-dependent, generalized Poisson prpcesses are considered. Applications of the method to performance evaluationof switching systems are discussed where the transient behaviourof the $Mx(t)/M/1$ queueing model is investigated.", ANNOTE="bibliography for non-stationary simulation and performance evaluation attached", } @ARTICLE{Fran8309:Address, AUTHOR="P. A. Franaszek", TITLE="Address-Independent Routing for Local Networks", JOURNAL=ibmjrd, VOLUME=27, NUMBER=5, PAGES="464-471", MONTH=sep, YEAR=1983, } @ARTICLE{Fran8309:Methods, AUTHOR="P. Francois and A. Potocki", TITLE="Some Methods for Providing {OSI} Transport in {SNA}", JOURNAL=ibmjrd, VOLUME=27, NUMBER=5, PAGES="452-463", MONTH=sep, YEAR=1983, } @ARTICLE{Stro8309:Local, AUTHOR="N. C. Strole", TITLE="A Local Communication Network Based on Interconnected Token-Access Rings: A Tutorial", JOURNAL=ibmjrd, VOLUME=27, NUMBER=5, PAGES="481-496", MONTH=sep, YEAR=1983, } @TECHREPORT{Cole8309:Research, AUTHOR="Randolph E. Cole and P. T. Kirstein", TITLE="Research Contract Proposal (MoD)", TYPE="Internal Note", INSTITUTION="UCL", NUMBER=1421, MONTH=sep, YEAR=1983, } @TECHREPORT{Edge8309:Connection, AUTHOR="S. W. Edge", TITLE="Connection Flow Control in a Wide Area Packet Switching Network", TYPE="Ph.D. Thesis", INSTITUTION="University College London", NUMBER="TR 88", MONTH=sep, YEAR=1983, } @INPROCEEDINGS{Kill8309:Interconnection, AUTHOR="S. E. Kille", TITLE="The Interconnection of Network Mailsystems", BOOKTITLE="IERE Conference on Networks and Electronic Office Systems", ADDRESS="Reading", MONTH=sep, YEAR=1983, } @INPROCEEDINGS{Load8309:High, AUTHOR="R. J. Loader and P. A. Martin", TITLE="The Design of a High Performance Concentrator for the Cambridge Ring", BOOKTITLE="IFIP WG6.4 International Workshop on Ring Technology, University of Kent at Canterbury", MONTH=sep, YEAR=1983, } @TECHREPORT{Yao8309:Queueing, AUTHOR="D. D. Yao", TITLE="Queueing Models of Flexible Manufacturing Systems", INSTITUTION="Department of Industrial Engineering, University of Toronto", PAGES=194, MONTH=sep, YEAR=1983, KEYWORDS="Cox distribution", ABSTRACT="Queueing models of Flexible Manufacturing Systems (FMSs) are developed at two levels. At the local level, work stations of FMSs are modeled as GI/G/c/N queues. In the case of both interarrival and service times having a small squared coefficinet of variation (scv), the queueing process is approximated by a diffusion process with two boundaries associated with elementary return processes. In the case of large scv's, t", } @ARTICLE{LeGa8310:Estimate, AUTHOR="F. Le Gall and J. Bernussou", TITLE="An Estimate for the Time Congestion for Overflow Processes", JOURNAL=ieeecom, VOLUME="COM-31", NUMBER=10, PAGES="1202-1203", MONTH=oct, YEAR=1983, KEYWORDS="queueing theory", ABSTRACT="The paper presents an estimate of time congestion for overflow processes. The approximation is derived from the Markovian formulation under classical assumptions (Poissonian traffic offered to the first choice route and exponential service time). Numerical experiments show the accuracy and limitations of the proposed estimate.", } @ARTICLE{Chla8310:Voice, AUTHOR="I. Chlamtac and M. Eisenger", TITLE="Voice/data integration on Ethernet --- backoff and priority considerations", JOURNAL=comcom, VOLUME=6, NUMBER=5, PAGES="236-244", MONTH=oct, YEAR=1983, KEYWORDS="Ethernet; integrated services; local area networks; multiple access; priority", ABSTRACT="A study of the CSMA/CD protocol as given in the Ethernet specifications, for real time (voice in particular) and mixed voice/data environments is described. The objectives of the study were to predict the Ethernet's behaviour under the current protocols, to point out potential improvements within the realm of the current specifications, and to improve understanding of the network behaviour in these environments. Results are given in terms of relative performance of the various system measures given as a function of system and traffic models. It is shown that the support provided to real time voice on Ethernet strongly depends on the assumptions made with regard to the coexisting data user's traffic and that with certain data traffic patterns the observed voice delay is much worse than previously reported. Finally, it is shown that without violating the Ethernet network specification, voice service can be improved by simple adjustments of the Ethernet retransmission 'backoff' algorithm.", } @ARTICLE{Papa8310:Designing, AUTHOR="Papazoglou and others", TITLE="Designing a parallel {SIMULA} machine", JOURNAL=comp_design, PAGES="125-132", MONTH=oct, YEAR=1983, KEYWORDS="hardware simulator; distributed simulation; SIMULA", } @ARTICLE{Cerf8310:Military, AUTHOR="V. G. Cerf and R. E. Lyons", TITLE="Military Requirements for Packet-Switched Networks and Their Implications for Protocol Standardization", JOURNAL=cn, VOLUME=7, NUMBER=5, PAGES="293-306", MONTH=oct, YEAR=1983, } @ARTICLE{Cerf8310:Internet, AUTHOR="A. G. Cerf and E. Cain", TITLE="The {DoD} {Internet} Architecture Model", JOURNAL=cn, VOLUME=7, NUMBER=5, PAGES="307-318", MONTH=oct, YEAR=1983, } @ARTICLE{Come83:Computer, AUTHOR="D. Comer", TITLE="A Computer Science Research Network {CSNET:} A History and Status Report", JOURNAL=cacm, VOLUME=26, NUMBER=10, PAGES="747-753", MONTH=oct, YEAR=1983, } @ARTICLE{Hear8310:Local, AUTHOR="K. S. Heard", TITLE="Local Area Networks and the Practical Aspects of Internetworking", JOURNAL=cn, VOLUME=7, NUMBER=5, PAGES="343-348", MONTH=oct, YEAR=1983, } @ARTICLE{Selv8310:Department, AUTHOR="P. S. Selvaggi", TITLE="The Department of Defense Data Protocol Standardization Program", JOURNAL=cn, VOLUME=7, NUMBER=5, PAGES="319-328", MONTH=oct, YEAR=1983, } @ARTICLE{Colv8310:CSMA, AUTHOR="Alan Colvin", TITLE="{CSMA} with collision avoidance", JOURNAL=comcom, VOLUME=6, NUMBER=5, PAGES="227-235", MONTH=oct, YEAR=1983, ABSTRACT="Advances in local area networking have allowed users to run many different applications on one system. Users are now asking for greater access, more functions, more power and greater reliability. This requires that the system tasks should be distributed, and means that the interconnection system used should be highly reliable; 'passive', so that no failed component can bring the entire system down; support high throughput; and operate on low-cost cable. This paper describes a broadband transmission system based on a single passive coxial cable which detects possible collisions before the data is sent. Examples of two remote stations and and two adjacent stations competing for transmission are given, along with performance comparisions of CSMA/CD and CSMA/CA.", } @MISC{Come8310:Proposed, AUTHOR="D. Comer and John T. Korb", TITLE="The Proposed {DARPA} {IP-to-X.25} Interface Standard: Performance Optimization with Multiple Circuits", MONTH=oct, YEAR=1983, } @ARTICLE{Come8310:Computer, AUTHOR="D. Comer", TITLE="The Computer Science Research Network {CSNET:} A History and Status Report", JOURNAL=cacm, ADDRESS="New York", VOLUME=26, NUMBER=10, PAGES="747-753", MONTH=oct, YEAR=1983, ANNOTE="CSNET overview", } @INPROCEEDINGS{Edmi8310:Operational, AUTHOR="R. D. Edmiston and Norm Farber", TITLE="Operational Issues in a Relay-Based Message System", BOOKTITLE="European Teleinformatics Conference", PUBLISHER="North-Holland, Amsterdam", ADDRESS="Varese, Italy", MONTH=oct, YEAR=1983, } @ARTICLE{Muel8310:Nested, AUTHOR="E. T. Mueller and J. D. Moore and G. J. Popek", TITLE="A Nested Transaction Mechanism for {LOCUS}", JOURNAL=acmosrev, VOLUME=17, NUMBER=5, PAGES="71-89", MONTH=oct, YEAR=1983, } @INPROCEEDINGS{Palm8310:Computer, AUTHOR="J. Palme", TITLE="Computer Conferencing is More than Electronic Mail", BOOKTITLE="EUTECO, European Teleinformatics Conference", PUBLISHER="North Holland", MONTH=oct, YEAR=1983, KEYWORDS="Com", } @ARTICLE{Walk8310:LOCUS, AUTHOR="B. Walker and G. J. Popek", TITLE="The {LOCUS} Distributed Operating System", JOURNAL=acmosrev, VOLUME=17, NUMBER=5, PAGES="49-70", MONTH=oct, YEAR=1983, } @INPROCEEDINGS{Wall8310:GILT, AUTHOR="P. Wallerlath", TITLE="The {GILT} Abstract Model of a Computer Based Message System", BOOKTITLE="EUTECO, European Teleinformatics Conference", PUBLISHER="North Holland", MONTH=oct, YEAR=1983, KEYWORDS="Gilt", } @ARTICLE{Mock8310:Reliable, AUTHOR="P. V. Mockapetris", TITLE="Analysis of reliable multicast algorithms for local networks", JOURNAL=ccr, PUBLISHER="IEEE Computer Society Press", ADDRESS="Silver Spring, Maryland, USA", VOLUME=13, NUMBER=4, PAGES="150-157", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=16, ABSTRACT="Three types of multicast transactions for local networks are described and analyzed: positive, separate acknowledgements from each receiver, negative acknowledgements from left out receivers and saturation sending of multicast requests without any acknowledgements.", } @ARTICLE{Chu8310:Internetworking, AUTHOR="N. N. Y. Chu", TITLE="Internetworking between {VAX} and Apollo Ring Network", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="3-8", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=3, ABSTRACT="Specifications for a network design to connect the Apollo DOMAIN network with the VAX system are discussed in this paper. Three networking approaches were considered which represent three distinct chronological stages in the evolution of computer communications. Based on a comparison of data transfer rate and the installation cost among these three alternatives, the LAN, represented by the Ethernet, was recommended as the connecting hardware. The OSI Reference Model was used as a starting basis to discuss protocol issues to be built for the chosen LAN. Of particular interest are the transport, presentation, and application layers. The transport layer was designed to perform functions of the network and session layers in the OSI model. The presentation layer incorporated a text mapping algorithm to convert incompatible characters in filenames created on the VAX versus those on the Apollo. The application layer was designed with the capability to send and receive files between these two systems.", } @ARTICLE{Cher8310:Local, AUTHOR="D. R. Cheriton", TITLE="Local Networking and Internetworking in the V-System", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="9-16", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=15, ABSTRACT="Local networking can be treated as a subset of internetworking for remote terminal access and file transfer. However, a distributed operating system, such as the V-system, uses a local network more as an extended backplane than a fast, miniature long-haul network. This paper describes the use of server-based ''intelligent gateways'' to provide internetworking using standard protocols in conjunction with an efficient light-weight protocol for V IPC on a local network. Besides providing good local network performance, this design allows a gateway to act as an access control mechanism, addressing some reliability and security issues that arise with local networks.", } @ARTICLE{Cela8310:Architecture, AUTHOR="N. Celandroni and E. Ferro and Luniano Lenzini and B. M. Segal and K. S. Olofsson", TITLE="Architecture and Protocols of {STELLA:} A European Experiment on Satellite Interconnection of Local Area Networks", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="17-24", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=16, ABSTRACT="STELLA (Satellite Transmission Experiment Linking Laboratories) is a European wide-band data transmission experiment. STELLA makes use of the European Orbital Test Satellite (OTS) which provides a 2 Mb/s broadcast data transmission channel. The first phase of the STELLA project (STELLA/I) is summarized. The more important design characteristics of an improved version (STELLA/II) of STELLA/I are emphasized. Collaboration between STELLA/II and UNIVERSE projects in the framework of COST-11Bis is then outlined.", } @ARTICLE{Suns8310:Interconnection, AUTHOR="C. A. Sunshine and D. Kaufman and Gregory Ennis and K. J. Biba", TITLE="Interconnection of Broadband Local Area Networks", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="25-32", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=16, ABSTRACT="Interconnection of multiple broadband local area networks to form an integrated packet transport system presents several challenges. To take full advantage of broadband systems, assignment of nodes to channels must be dynamic, leading to the use of a flat address space. Combined with the desire to avoid reliance on a central server or complex routing in packet forwarders, this addressing scheme leads to adoption of a controlled flooding technique to ''discover'' the best path to a destination node. This discovery procedure sets up a path through internetwork forwarders for use by subsequent packets to the same destination. This paper describes the design and implementation of such a technique in Sytek's LocalNet(TM) system along with several refinements which increase performance and keep the worst case load for route discovery below a few percent of network capacity.", } @ARTICLE{Shur8310:Office, AUTHOR="R. Shurig", TITLE="Office Information and Telecommunications", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="35-38", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, KEYWORDS="Telecommunications; Information media; Worker Archetypes; Products; Prediction", ABSTRACT="In order to understand the relationship of office information to office products and to telecommunications, the category of information media must be introduced. Voice, image, text and data information media can be related to one another, to computer and telecommunications technologies and to the needs of different types of workers. The purpose of business offices, however, is not usually primarily information, computing or telecommunication, but rather knowledge, products and useful work. The information categories including media, transfer, products and work can be related to one another for a better understanding of office information products and telecommunications and in order to predict their future.", } @ARTICLE{Nuge8310:Videotex, AUTHOR="W. Nugent and J. Harding", TITLE="Beyond Videotex: The Library of Congress Pilot Project in Page Image Retrieval and Transmission Digital Optical Disk", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="257-260", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=8, ABSTRACT="We describe two current development projects at the Library of Congress using high-density optical storage, both of which require more advanced and improved computer-based information retrieval methodologies than existing bibliographic retrieval systems. A much greater emphasis will be placed on the information content of the articles rather than on the broad subject categories in general use for computer retrieval citations to book materials. Needed approaches include the linking of selected external reference sources and the extraction of character-encoded index information from the page images by OCR techniques. Our position is that extremely high density storage of articles in a single subject area requires a finer resolution in the retrieval system accessing the material. A single side of a 12-inch digital optical disk, for example, can hold 15 years of the Journal of the ACM.", } @ARTICLE{Cohe8310:Real, AUTHOR="Danny Cohen", TITLE="Real-Time Packet Video over Satellite Channels", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="40-47", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, ABSTRACT="The paper describes major issues and problems in the use of packet satellite channels for real-time video images and suggests some solutions. The DARPA Wide Band Communication Network provides the testbed for this activity. The main idea in this paper is the automatic online tradeoff between the quality and the dynamics of the communicated images in order to optimally adapt to the changes of the channel performance and of the scene to be communicated. The paper discusses the problems of real-time packet video, suggests several techniques to cope with them, and describes some new approaches to the encoding of real-time video communication. The paper describes in more detail several encoding schemes based on this approach, using the 2-dimensional Discrete Cosine Transform (DCT). Section-C describes issues which are arise in the application of packet satellite channels for real-time video communication. Section-D discusses a general approach which addresses these issues. Section-E describes a general methodology for signal coding and compression, and Section-F describes a scheme for the communication of video images using DCT of the raw images in an absolute way, unlike the four differential schemes which are described in Section-G. Section-H describes a scheme which self- corrects the accumulated quantization errors introduced by the encoding and compression. Such errors are totally eliminated for static images.", } @ARTICLE{Su8310:Identification, AUTHOR="Z.-S. Su", TITLE="Identification in Computer Networks", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="51-55", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=17, ABSTRACT="To communicate across a network system, entities within the system need to be able to identify one another. An identifier usually takes the form of a name or an address. Conventions for the assignment of these identifiers and their resolution affect many aspects of network design. Identification is thus a crucial issue for network architecture and standardization. In this paper, our discussion is first devoted to the semantics of names, addresses, and routes, with emphasis on the elationships among them. We then examine the implications of layered network architecture, syntactic differences of identifiers, and broadcast communication. Finally, we turn our attention to naming and addressing in large dynamic networks.", } @ARTICLE{Pope8310:Implementing, AUTHOR="R. Popescu-Zeletin", TITLE="Implementing the {ISO-OSI} Reference Model", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="56-66", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=11, ABSTRACT="The ISO-OSI reference model was the design framework for the implementation of a heterogeneous network in a local environment. The HMINET-2 is a network based on standards in data communication. The paper focus on the OSI model feasibility and outlines the encountered problems and the adopted solutions in the network design and implementation.", } @ARTICLE{Atki8310:Exception, AUTHOR="M. S. Atkins", TITLE="Exception Handling in Communication Protocols", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="67-72", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=9, ABSTRACT="This paper describes structures used for exception handling in multi-process implementations of the X.25 and X.29 protocols. Each protocol layer is implemented as a collection of cooperating processes. These are structured in one of two alternative ways, reflecting differences in the type of exceptional situations that may occur. Within each of the lower protocol layers, one process takes the form of a Finite State Machine. In these lower level protocols, where it is difficult to identify ''normal'' transitions, there are no special exception cases; we treat all transitions as being equally likely to occur. For higher level protocols such as the X.29 protocol, exceptions occur less frequently. Here, transmitting and receiving are performed by two independent processes, and exception handling is performed by an auxiliary process which is invoked as needed. This multi-process structure matches the functionality of the protocol, and results in software which is easy to program and easy to understand.", } @ARTICLE{Kuro8310:Controlling, AUTHOR="James F. Kurose and M. Schwartz and Y. Yemini", TITLE="Controlling Window Protocols for Time-Constrained Communication in a Multiple Access Environment", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="75-84", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=17, ABSTRACT="For many time-constrained communication applications, such as packetized voice, a critical performance measure is the percentage of messages which are transmitted within a given amount of time after their arrival at a sending station. We examine the use of a group random access protocol based on time windows for achieving time-constrained communication in a multiple access environment. First, we formulate a policy for controlling protocol operation in order to minimize the percentage of messages with waiting times greater than some given bound. A semi-Markov decision model is then developed for protocol operation and three of the four optimal control elements of this policy are then determined. Although the semi-Markov decision model can also be used to obtain performance results, the procedure is too computationally expensive to be of practical use. Thus, an alternate performance model based on a centralized queueing system with impatient customers is developed. Protocol performance under the optimal elements of the control policy shows significant improvements over cases in which the protocol is not controlled in this manner. Simulation results are also presented to corroborate the analytic results.", } @ARTICLE{Perl8310:Incorporation, AUTHOR="R. Perlman", TITLE="Incorporation of Multiaccess Links into a Routing Protocol", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="85-94", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=9, ABSTRACT="Conventional routing protocols and algorithms work most efficiently on sparsely connected networks. Network topologies today include multiaccess links which include hundreds of nodes, all of which are capable of direct communication with each other. Some of these multiaccess links have broadcasting ability. This paper presents protocols and algorithms for efficiently dealing with the characteristics of various types of multiaccess links, when they are included as links in a general topology net.", } @ARTICLE{Arth8310:Theoretical, AUTHOR="E. Arthurs and G. L. Chesson and B. W. Stuck", TITLE="Theoretical Performance Analysis of Sliding Window Link Level Flow Control for a Local Area Network", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="95-100", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=29, ABSTRACT="A transmitter sends packets over a local area network to a receiver. The receiver has a finite amount of storage capacity for buffering messages. A sliding window protocol is employed to insure all packets are delivered without error in order of arrival. Mean throughput rate and packet delay statistics are studied as a function of model parameters. Simulation data are presented.", } @ARTICLE{Naka8310:Message, AUTHOR="T. Nakayama and Y. Shimazu and K. Haruta", TITLE="A Message Handling System for Public Networks", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="103-111", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=5, ABSTRACT="As a message handling system installed in the public communication networks, SSC (Store and Processing Service Control Facility) provides convenient communication processing services using storage and conversion technologies. The SSC conversion facilities, including media conversion from teletex codes to facsimile image, increase the communicable terminal range. Mailbox services, using four different kinds of personal Message Boxes in the SSC, bring about much benefit to personal communications. The SSC service requesting procedures facilitate multi-address delivery, timed delivery and automatic conversions. The SSC is a prototype which realizes the Message handling Systems being studied in CCITT. The system is under developmental research in the NTT Laboratory. This paper describes the basic SSC development concept, the relationship to the CCITT standard, the SSC service outline and the field trial system configuration.", } @ARTICLE{Hill8310:NOVANET, AUTHOR="J. S. Hill and J. R. Severyn and P. J. VanArsdall", TITLE="{NOVANET/Communications} Network for a Control System", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="113-118", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=5, ABSTRACT="Novanet is a control system oriented fiber optic local area network that was designed to meet the unique and often conflicting requirements of the Nova laser control system which will begin operation in 1984. The computers and data acquisition devices that form the distributed control system for a large laser fusion research facility need reliable, high speed communications. Both control/status messages and experimental data must be handled. A subset of NOVANET is currently operating on the two beam Novette laser system.", } @ARTICLE{Rush8310:Access, AUTHOR="A. Rushinek and S. F. Rushinek", TITLE="Access and Communications Controls in an Accounting Information System", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="119-120", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, ABSTRACT="This paper involves the exploration of two very important security controls in a computerized accounting information system: (1) access controls, and (2) communication controls. The various specific access and communication controls are examined, analyzing their roles in an accounting information system's computer network. The growing use of computers in the accounting information systems of the business environment, along with the presence of growing computer fraud, necessitate managements to implement stricter access and communication controls.", } @ARTICLE{Burk8310:Commercial, AUTHOR="E. L. Burke", TITLE="Commercial Network Security--Does Anyone Care?", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="123-123", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, ABSTRACT="Since World War II, the US government has had a comprehensive way to deal with communication security. Under pressure from commercial interests, the government moved in the 70's to make some communication security technology available in the form of the Data Encryption Standard. DES has been available for some time, yet there is little interest in the marketplace. The lack of interest could stem from unawareness or unconcern with security or from the feeling that data security is not the weak point in the system. This session will investigate the techniques and vulnerabilities of commercial network security. Panel members will present their experiences with developmental and product activities aimed at providing security in a business environment. The panel will try to stimulate discussion on why there has been no market and what technical characteristics that market should have.", } @ARTICLE{Yao8310:Network, AUTHOR="J. Yao", TITLE="Network Security Considerations in {BLN}", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="124-127", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=5, ABSTRACT="In a heterogeneous computer network, resources on each node are protected by the local security mechanism. Network services allow local resources to be accessed remotely from other nodes. Without appropriate network security measures, each node is vulnerable to attack from the network. This paper analyzes the heterogeneous Bell Labs Network (BLN) environment and lists the potential network security risks. By assessing the risks, counter-measures are proposed for minimizing potential exposures. These counter-measures are part of a global network security mechanism being implemented for BLN.", } @ARTICLE{Besh8310:Methodology, AUTHOR="H. Besharatian", TITLE="A Methodology for the Design of Reliable Communication Networks in Distributed Processing Systems", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="131-140", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=15, ABSTRACT="The combined problem of the communication network design and resource allocation is studied for Distributed Data Processing (DDP) networks. The reliability measure for a distributed data processing system is used in order to enhance network reliability. A model is proposed to determine an optimal DDP network and to allocate resources that maximize the reliability measure of the network. The model takes into consideration network topology, resource availability and channel capacity. It is shown that the model may be represented by a linear programming model.", } @ARTICLE{Lin8310:Verification, AUTHOR="H.-A. Lin and Minkui Liu and C. J. Graff", TITLE="Verification of a Methodology for Designing Reliable Communication Protocols", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="141-149", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=19, ABSTRACT="In this paper we present a new methodology for designing reliable communication protocols. This methodology enhances communicating processes with a synchronization mechanism so that they can detect and resolve the errors caused by collisions automatically. The major advantages of this new methodology include: (1) the ''state explosion'' problem involved in protocol validation is alleviated; and (2) the burden of handling errors due to collisions is removed from the protocol designer. There is a need to verify that this methodology is applicable to arbitrary protocols. In this paper we also discuss the application of a program verification technique to this methodology.", } @ARTICLE{Wong8310:Reliable, AUTHOR="J. W. Wong and G. Gopal", TITLE="Analysis of Reliable Broadcast in Local-Area Networks", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="158-163", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=14, ABSTRACT="The performance characteristics of a reliable broadcast protocol in a local-area network environment are analyzed. This protocol involves a source broadcasting a message to all destinations and collecting replies from these destinations. Reliability is achieved by using Send-and-Wait protocols for transmitting broadcast and reply messages. A queueing model is developed and results on the throughput and delay of the broadcast operation are obtained by approximate analysis. Numerical results showing the effect of model parameters on throughput are provided.", } @ARTICLE{Choi8310:Decomposition, AUTHOR="T. Y. Choi and Russ Miller", TITLE="A Decomposition Method for the Analysis and Design of Finite State Protocols", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="167-176", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=16, ABSTRACT="Finite state automata have been applied with success to the modeling of Computer Network protocols. The interaction of finite state machines can be very complex especially if the protocol involves a large number of states. To counteract the complexity of analysis and design, we propose an approach of decomposition. Through this approach, the protocol graph can be partitioned into subgraphs each having a unique entity node and zero or more exit nodes. The exit nodes of one subgraph can be connected only to the entry nodes of other subgraphs. From the standpoint of protocol analysis, the correctness of the entire protocol graph can be inferred from the correctness of individual protocol subgraphs. From the standpoint of protocol design, the individual protocol subgraphs can be designed to correspond to different phases of the protocol. If the individual protocol subgraphs are designed correctly and the connections between subgraphs conform to the structure discussed above, then we show that the entire protocol graph will operate correctly.", } @ARTICLE{Gold8310:Dynamic, AUTHOR="Y. Gold and S. Moran", TITLE="Dynamic Selection of a Performance-Effective Transmission Sequence for Token-Passing Networks with Mobile Nodes", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="177-180", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=5, ABSTRACT="We describe a distributed method for keeping down ''token-passing'' overhead in a mobile multi-access network, by performing local corrections in the token-passing sequence as they become necessary due to changes in node spatial configuration. These corrections involve only a subset of the nodes in the network, thus reducing the required computational effort. The method consists of three distributed protocols. The first is for detecting deterioration and identifying a subset of nodes that constitutes a ''problem area'', the second is to provide each node with the distances (propagation delays ) to all other nodes, and the third is to use this topological information to construct a minimal spanning tree, from which a good ''token passing'' sequence can be derived. The second and third protocols may also have applications other than the one described here, such as position location, routing and broadcasting.", } @ARTICLE{Beck8310:Graceful, AUTHOR="M. W. Beckner and T. Starr", TITLE="Graceful Preemption for Multi-Link Layer Protocols", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="181-187", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=5, ABSTRACT="This paper discusses a powerful priority mechanism that can be used on a physical communication medium supporting multiple, independent, logical data links. This scheme allows a high priority message to immediately interrupt a lower priority message which is in the process of being transmitted, and yet will not require the retransmission of the first part of the lower priority message; hence, the term graceful preemption. Graceful preemption may be extended to furnish multiple priority levels similar to existing processor interrupt structure which implement multiple levels. This protocol may serve a single processor which handles several different processes, or several independent stations that share a common bus. Hence, priority levels can be enforced without the need for a centralized bus ''master'' or ''arbitrator'' unit. As an example, the application of graceful preemption to the Integrated Services Digital Network (ISDN) link access procedure, LAPD, is discussed.", } @ARTICLE{Kuo8310:Multimedia, AUTHOR="F. F. Kuo and J. J. Garcia-Luna-Aceves and D. P. Deutsch and H. C. Forsdick and Najah Naffah and Andrew A. Poggio and J. B. Postel and James E. White", TITLE="Multimedia Computer Mail--Technical Issues and Future Standards", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="191-196", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, ABSTRACT="A computer-based message system (CBMS) consists of computer facilities that expedite the creation, management and nonreal time distribution of messages. These systems are increasingly being used for formal and informal communication, supporting the distribution of textual messages. However, nontext media such as voice and graphics are very important for human interaction, and are becoming more and more important in computer system applications. As a result, there is a growing need for the support of media other than text in CBMS. Before standards for multimedia CBMS can be implemented, there are many technical issues that must be addressed. These range from the design of new mechanism for the distribution of multimedia mail, to the design of tools needed for editing nontext media. This panel will be discussing issues encountered in the development of multimedia CBMS and an outlook for standards for multimedia computer mail.", } @ARTICLE{Kumm8310:Establishment, AUTHOR="K. Kummerle", TITLE="Establishment Communication Systems: {LANs} or {PABXs--Which} is Better?", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="199-200", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, } @ARTICLE{Wang8310:Function, AUTHOR="P. S.-C. Wang and S. R. Kimbleton", TITLE="A Function Oriented Corporate Network", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="203-210", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=15, ABSTRACT="The ITT/NET is an internal corporate network built to satisfy the distributed programming requirements of ITT technology and engineering communities. This paper describes the network: its goals, its architecture, its operational environment and prototype development activities. The various issues involved in the construction of a Corporate Network based upon diverse, existing systems and communication methods are described in detail. The architectural and implementation decisions are discussed and justified. The programming process and the methodologies adopted are presented and some conclusions are drawn as to the practicality and usefulness of formal development methods in the context of this particular project.", } @ARTICLE{Jans8310:Filing, AUTHOR="P. Janson and L. Svobdova and E. Maehle", TITLE="Filing and Printing Services on a Local-Area Network", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="211-220", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=22, ABSTRACT="This paper describes the design and implementation of filing and printing services in a distributed system based on a token-ring local-area network. The main emphasis is put on the communication aspects of the client/server scenario: roles of a client and a server in a communication protocol, and the integration of communication protocols with applications.", } @ARTICLE{Yudk8310:Resource, AUTHOR="M. Yudkin", TITLE="Resource Management in a Distributed System", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="221-226", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=9, ABSTRACT="In the Cambridge Distributed System, developed at the Computer Laboratory, Cambridge, terminals, machines, and peripherals are separated by a ring network. A problem that arises is the establishment and control of suitable connections between the individual components, so that users may use machines, machines may use peripherals or other machines, etc. in a secure manner. This paper describes an experimental mechanism used to control the connections and provide security in our particular system. The solution is not restricted to the Cambridge ring, although a different architecture may suggest alternative solutions more suited to its specific features. Some possibilities are discussed.", } @ARTICLE{Colo8310:Interfaces, AUTHOR="W. A. Colon-Castro and D. A. Kirkman", TITLE="Interfaces between Protocol Layers on a Multiprocessor System", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="229-233", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=9, ABSTRACT="A multi-layer, X.25 based protocol has been implemented on a multiprocessor system. The higher layer protocol resides in the system processor while the lower level protocol (X.25 levels 2 and 3) runs on a peripheral processor. This paper focuses on the boundary between the system and peripheral processors. It discusses how flow control is done, how control information is passed across the boundary, and the synchronization problems that arose. In addition, it describes effects on performance resulting from splitting the protocol across the two processors.", } @ARTICLE{Ni8310:Prioritizing, AUTHOR="L. M. Ni and Xiao Li", TITLE="Prioritizing Packet Transmission in Local Multiaccess Networks", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="234-244", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=9, ABSTRACT="Carrier sense multiple access with collision detection (CSMA/CD) protocols have been extensively studied and developed for local area networks. In CSMA/CD protocols, all messages are treated equally in competing for the communication channel. Thus, important or time-critical messages may be severely delayed. In this paper, a new CSMA/CD protocol with message-based priority functions is proposed. A priority code comparison period is needed to determine the highest priority class that can compete for the communication channel. A contention period based on CSMA/CD scheme is then followed. Both nonpreemptive discipline and preemptive discipline are discussed. In each discipline, both the single mode and the batch mode are considered and compared. The overhead in implementing the proposed protocol, either for a few or a large number of priority classes, is shown to be minimal. In general, a preemptive single mode scheme provides a better performance. The requirements of hierarchical independence of performance and fairness are satisfied.", } @ARTICLE{Wood8310:Potential, AUTHOR="C. M. Woodside", TITLE="Performance Potential of Communications Interface Processors", JOURNAL=ccr, VOLUME=13, NUMBER=4, PAGES="245-253", NOTE="Eighth Data Communications Symposium", MONTH=oct, YEAR=1983, REFERENCES=9, ABSTRACT="Interface processors are being developed in hardware and firmware for communications protocols at higher and higher levels (HDLC, X.25, Ethernet...), for smaller and smaller host systems. How far this process will go depends on the driving factors of increased performance and simpler implementation of the systems which use the protocols. A simplified performance model with parameters, which encompasses a large part of all systems using communications, is used to find those parameter combinations offering various degrees of performance improvement. The results can be used to approximately distinguish those cases which will provide the market for performance improvement via higher-level interface processors.", } @ARTICLE{Lamp8310:Hints, AUTHOR="B. W. Lampson", TITLE="Hints for Computer System Design", JOURNAL=acmosrev, VOLUME=17, NUMBER=5, PAGES="33-48", MONTH=oct, YEAR=1983, } @ARTICLE{Sand8310:Secure, AUTHOR="P. W. Sanders and V. Varadharajan", TITLE="Secure Communications between Microcomputer Systems", JOURNAL=comcom, VOLUME=6, NUMBER=5, MONTH=oct, YEAR=1983, ABSTRACT="A data security communications interface unit has been developed to allow data transfer between Apple terminals in either plain or encrypted format under user control. The unit employs the Data Encryption Standard algorithm and has a degree of sophistication sufficient to meet most user needs. The unit uses the 6502 microprocessor to control encryption, decryption and communications. In addition to the transfer of encrypted data, the interface also provides a facility for storing encrypted program and data files locally in the Apple disc system. Further, the encryption system has been designed to allow storage and retrieval of completely encrypted or partly encrypted frames of information on the Prestel database. The interface has been tested extensively using serveral DES modes of operation.", } @TECHREPORT{Mart8310:Modular, AUTHOR="O. Martikainen and A. P. Ahtiainen", TITLE="Modular Specification of {OSI} Subsystems", INSTITUTION="Technical Research Center of Finland and University of Helsinki", PAGES=12, NOTE="submitted to Euteco Teleinformatic Conference, Varese, Italy", MONTH=oct, YEAR=1983, KEYWORDS="OSI", ABSTRACT="A connection-based approach for substructuring an (N)-subsystem into protocol servers and a subsystem manager is presented. This results in a dynamic characterization of (N)-entities as disjoint sets of interconnected connection end-points. Formal protocol specification methods are examined with an objective to find a compact method supporting this modularization of an (N)-sub", } @ARTICLE{Amst8311:Burst, AUTHOR="Stanford R. Amstutz", TITLE="Burst Switching --- An Introduction", JOURNAL=ieeecm, VOLUME=21, NUMBER=11, PAGES="36-42", MONTH=nov, YEAR=1983, } @ARTICLE{Arth8311:Theoretical, AUTHOR="E. Arthurs and G. L. Chesson and B. W. Stuck", TITLE="Theoretical Performance Analysis of Sliding Window Flow Control", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=5, PAGES="947-959", MONTH=nov, YEAR=1983, KEYWORDS="congestion control", ABSTRACT="A transmitter breaks a message up into packets and transmits the packets to a receiver over a single virtual circuit within a local area network. The receiver has a finite amount of storage capacity for buffering messages. A {\em sliding window protocol} turns the transmitter on and off to ensure there is always storage room in the receiver for packets. Mean throughput rate and delay statistics are studied as a function of model parameters.", } @ARTICLE{Laza8311:Throughput, AUTHOR="Aurel A. Lazar", TITLE="The Throughput Time Delay Function of an {$M/M/1$} Queue", JOURNAL=ieeeit, VOLUME="IT-29", NUMBER=6, PAGES="914-918", MONTH=nov, YEAR=1983, KEYWORDS="queueing theory", ABSTRACT="A study of the design requirements of the data link control protocol leads us to consider a throughput time delay criterion as a performance measure for optimal flow control of computer communication networks. A closed network model consisting of a $\cdot/M/1$ queueing system (the receiver node) controlled by an exponential queueing system with variable rate (the source node) is considered. The flow control maximizing the throughput of the $M/M/1$ queueing system in equilibrium under a bounded average time delay criterion is shown to be a window flow control mechanism. The window size $L$ can be easily derived from the maximum tolerated average delay $T$ and the maximum offered load $c$. The dependence of the maximum throughput on the average time delay is also analyzed.", } @INPROCEEDINGS{Mehm8311:Optimal, AUTHOR="M. K. Mehmet and C. M. Woodside", TITLE="Optimal Choice of Packet Size and Reconstruction Delay for a Packet Voice System", BOOKTITLE=globecom, ORGANIZATION="IEEE", ADDRESS="San Diego, California", PAGES="964-968 (28.5)", MONTH=nov, YEAR=1983, KEYWORDS="packet voice", ANNOTE="Waits for late-arriving packets, introducing gaps when necessary. Delay modeled as $M/M/1$ queue.", } @INPROCEEDINGS{Swin8311:Adding, AUTHOR="Daniel C. Swinehart and L. Stewart and S. M. Ornstein", TITLE="Adding Voice to an Office Computer Network", BOOKTITLE=globecom, ORGANIZATION="IEEE", ADDRESS="San Diego, California", PAGES="392-398 (11.4)", NOTE="also Xerox Report CSL-83-8", MONTH=nov, YEAR=1983, KEYWORDS="packet voice; recorded voice; telephones; Ethernet; Cedar; distributed systems", ABSTRACT="This paper describes the architecture and initial implementation of an experimental telephone system developed by the Computer Science Laboratory at the Xerox Palo Alto Research Center (PARC CSL). A specially designed processor (Etherphone) connects to a telephone instrument and transmits digitized voice, signalling, and supervisory information in discrete packets over an Ethernet local area network. When used by itself, an Etherphone processor provides the functions of a conventional telephone, but it comes into its own when combined with the capabilities of a nearby office workstation, a voice file server, and other shared services such as databases. Most of the work so far has gone into the basic provisions for voice switching and transmission. Today the system supports ordinary telephone calls and simple voice message services. We will expand these functions as we explore the integration of voice with our experimental office systems.", ANNOTE="Packet contains 160 $\mu$-law PCM samples, plus 36 bytes of header. Total delay is 40 ms: 20 ms packetization, hardware latency of 5 ms, software delays of 5 ms, anti-jitter delay of 10 ms. Recorded voice has an anti-jitter delay of 100 ms. Clock skew is compensated for during silent intervals.", } @ARTICLE{Hacc8311:Experimental, AUTHOR="David Haccoun and Paul Cohen and Hoang Hai-Hoc", TITLE="An experimental investigation of the active-idle pattern of speech over land mobile radio telephone channels", JOURNAL=ieeevt, VOLUME="VT-32", NUMBER=4, PAGES="260-268", MONTH=nov, YEAR=1983, KEYWORDS="speech communication; silence detection", ABSTRACT="Two methods of speech detection at the syllabic level of voice traffic over land mobile radio telephone channels are presented. Both methods are based on the periodic comparison of the audio signal level with a threshold and provide an on-off pattern of active-idle periods on the channel at a rate equal to 100 to 200 samples per second. One method is entirely digital whereas the other method uses an analog detector followed by digital processing. Results of the analysis show that during conversation more than 50 percent of the time the channel is idle, with an average duration of silences larger than 300 ms. These results and those concerning other parameters of interest indicate that even during a conversation many useful idle periods do occur. These silences could indeed be exploited by making them available to additional users and hence improve both the efficiency of the channels and their congestion. The speech detector computes the average magnitude over an 8 ms window and compares it to an adaptive threshold which is restricted to a set interval. The threshold is decreased by a fixed step size $D$ for each window during the active period and increased by a step $I$ during the silence period. The thresholds were chosen as 1.5 and 3 percent of the maximum audio signal, $D$ and $I$ as 1 and 8. Active periods of less than 48 ms are discarded. A mean silence period of 0.379 s was observed; the silence period was not exponentially distributed ($\sigma = 0.859 s$).", } @ARTICLE{Limb8311:Distributed, AUTHOR="J. O. Limb and Lois E. Flamm", TITLE="A distributed local area network packet protocol for combined voice and data transmission", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=5, PAGES="926-934", MONTH=nov, YEAR=1983, KEYWORDS="packet voice; local area networks", ABSTRACT="Local area networks designed to carry a variety of traffic such as data, voice, facsimile, and video should be able to implement low latency virtual circuits to meet the demands of periodic traffic. We have designed a partially distributed algorithm to efficiently schedule voice traffic on a unidirectional bus system called Fasnet. Virtual channels are allocated for the duration of a talk spurt and relinquished during the intervening silence intervals. Conversations already in progress, but without an assigned circuit, take precedence over newly arriving calls. Unused voice capacity may be utilized by data stations when required. Simulations of the system indicate that performance is close to that obtained by an ideal TASI multiplexer. While the algorithm is unfair, this is not a significant factor unless the network is loaded very heavily. Further, except for a ``sojourn'' time unused voice capacity is utilized by the data stations.", } @ARTICLE{Ahuj8311:High, AUTHOR="Sudhir A. Ahuja", TITLE="{S/NET:} A High-Speed Interconnect for Multiple Computers", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=5, PAGES="751-755", MONTH=nov, YEAR=1983, } @ARTICLE{Fras8311:Universal, AUTHOR="A. G. Fraser", TITLE="Towards a universal data transport system", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=5, PAGES="803-816", MONTH=nov, YEAR=1983, KEYWORDS="Datakit; network architecture; packet switch", ABSTRACT="It is anticipated that a ubiquitous data transport system will require integration of local area and wide area networks. The combined network will need to present a uniform appearance to the user, be effective as a transport mechanism for a great variety of traffic patterns, and be economically appropriate for a wide range of consumer products. Learning from telephony and from experiments with a local area network, we conclude that the transport system must seek a clean separation of function and protocol between the network and its users. This separation is achieved by a byte-stream architecture that carries control and data bytes over switched virtual circuits. A DATAKIT packet switch demonstrates how the byte-stream concept can integrate local area and wide area network objectives. This switch is an assembly of interface modules connected by a pair of short passive buses. Each type of interface module serves one type of remote equipment and, if need be, terminates the protocol of that equipment. There are interface modules for trunks that lead to other switches, for terminals, and for host computers. Other modules provide system timing, switching, network control, and maintenance support.", } @ARTICLE{Whit8311:Queueing, AUTHOR="W. Whitt", TITLE="The queueing network analyzer", JOURNAL=bstj, VOLUME=62, NUMBER=9, PAGES="2779-2815", MONTH=nov, YEAR=1983, REFERENCES=70, KEYWORDS="queueing theory; queueing networks; queueing; QNA; approximations", ABSTRACT="This paper describes the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for a network of queues. The first version of QNA analyzes open networks of multiserver nodes with the first-come, first-served discipline and no capacity constraints. An important feature is that the external arrival process need not be Poisson and the service-time distribution need not be exponential. Treating other kinds of variability is important. For example, with packet-switched communication networks we need to describe the congestion resulting from bursty traffic and the nearly constant service times of packets. The general approach in QNA is to approximately characterize the arrival process by two or three parameters and then analyze the individual nodes separately. The first version of QNA uses two parameters to characterize the arrival process and service times, one to describe the rate and the other to describe the variability. The nodes are then analyzed as standard GI/G/M queues patially characterind by the first two moments of the interarrival-time and service-time distributions. Congestion measures for the network as a whole are obtained by assuming as an approximation that the nodes are stochastically independent given the approximate flow parameters.", } @TECHREPORT{Blom8311:Big, AUTHOR="Richard A. Blomseth", TITLE="A Big {RISC}", TYPE="Technical Report", INSTITUTION="Computer Science Division (EECS), University of California", ADDRESS="Berkeley, California", NUMBER="UCB/CSD 83/143", MONTH=nov, YEAR=1983, KEYWORDS="computer architecture; RISC; ECL", ABSTRACT="Big RISC (BRISC) is a high-speed CPU designed with 100K ECL logic and based on the RISC I architecture. Design, performance, and cost of BRISC is presented. Performance is shown to be better than high-end mainframes such as the IBM 3081 and Amdahl 470V/8 on integer benchmarks written in C, Pascal and LISP. The cost, conservatively estimated to be \$132,400, is about the same as a high-end minicomputer such as the VAX 11/780. BRISC has a CPU cycle time of 46 ns, providing a RISC I instruction rate of greater than 15 MIPS. BRISC is designed with a Structured Computer Aided Logic Design System (SCALD) by Valid Logic Systems. An evaluation of the utility of SCALD for computer design is also included.", } @ARTICLE{Saue8311:Corrigendum, AUTHOR="C. H. Sauer", TITLE="Corrigendum: Computational algorithms for state-dependent queuing networks", JOURNAL=tocs, VOLUME=1, NUMBER=4, PAGES=369, MONTH=nov, YEAR=1983, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Sloa8311:Machanisms, AUTHOR="L. J. Sloan", TITLE="Machanisms that Enforce Bounds on Packet Lifetimes", JOURNAL=tocs, VOLUME=1, NUMBER=4, PAGES="311-330", MONTH=nov, YEAR=1983, } @INPROCEEDINGS{Cole8311:Flexible, AUTHOR="Randolph E. Cole and P. J. Lloyd", TITLE="A Flexible Architecture for Protocol Studies in a Multi-network Environment", BOOKTITLE="9th World Computer Congress (IFIP)", PUBLISHER="IFIP", ADDRESS="Paris", PAGES="401-406", MONTH=nov, YEAR=1983, } @INPROCEEDINGS{Taki8311:Satellite, AUTHOR="T. Takizuka and K. Matsuo and S. Lisaku and K. Ono", TITLE="Design and evaluation of satellite packet communication protocols for integrated services networks", BOOKTITLE=globecom, PUBLISHER="IEEE", ADDRESS="New York", VOLUME=3, PAGES="1358-63", MONTH=nov, YEAR=1983, ABSTRACT="Describes a new error-control scheme and multicast commmunication protocols which are suitable for a satellite link, and also the protocol integration method used in the satellite packet communication system. The defects of the selective reject scheme are investigated, and a modified error-control scheme, called MN-SREJ, is proposed to attain high throughput efficiency through a medium-quality link with a long propagation delay. The effect on throughput efficiency of the slf-orthogonal convolution cose and the BCH code used as forward error correcting codes in the satellite channels, is examined. To utilize the multiple-access capability of a satellite, multicast communication procedures are proposed and evaluated. A satellite packet communication system that integrates packet-switching type and circuit-switching type protocols is introduced.", } @INPROCEEDINGS{Cher8311:Distributed, AUTHOR="D. R. Cheriton and W. Zwaenepoel", TITLE="The Distributed V Kernel and its Performance for Diskless Workstations", BOOKTITLE="9th Symposium on Operating System Principles", MONTH=nov, YEAR=1983, } @INPROCEEDINGS{Haug8311:Nordic, AUTHOR="T. Haug", TITLE="The Nordic Mobile Telephone System, An Extension of the Telephone Network", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="41.1.1-5", MONTH=nov, YEAR=1983, KEYWORDS="Communication Network; Existing network; Telephony; Mobile Radio", } @INPROCEEDINGS{Kona8311:Effect, AUTHOR="V. Konangi and C. R. Dhas and M. Duewiger", TITLE="Effect of Data Distribution on the Performance of Ethernet-Like Networks", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="18.5.1-4", MONTH=nov, YEAR=1983, KEYWORDS="LAN", } @INPROCEEDINGS{Pfan8311:MATS, AUTHOR="H. Pfannschmidt", TITLE="{MATS} E - An Advanced Cellular Radio Telephone System", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="41.2.1-7", MONTH=nov, YEAR=1983, KEYWORDS="Mobile radio", } @INPROCEEDINGS{Hubi8311:Simulation, AUTHOR="N. Hubing and K. Dassel and Wu Chou and A. Nilsson", TITLE="A Simulation Tool for Evaluating Control Procedures in Packet Switching networks", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="10.1.1", MONTH=nov, YEAR=1983, KEYWORDS="Packet switching; flow control; simulation", } @INPROCEEDINGS{Gopa83:Auctioneer, AUTHOR="I. Gopal and Joseph Jaffe", TITLE="The Auctioneer's Problem", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="33.2.1-5", DAYS=28, MONTH=nov, YEAR=1983, KEYWORDS="Optimization; theory", } @INPROCEEDINGS{John8311:Optimization, AUTHOR="S. W. Johnston and R. K. Poole", TITLE="Optimization of packet Networks with Remote Concentrators", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="10.3.1-4", DAYS=28, MONTH=nov, YEAR=1983, KEYWORDS="Packet switching; network optimization", } @INPROCEEDINGS{Lest8312:PRCS, AUTHOR="H. L. Lester and S. S. Rappaport and C. M. Puckette", TITLE="{PRCS} - A Consumer Mobile Radio Telephone Communication System with Distributed Control", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="41.3.1-8", DAYS=28, MONTH=nov, YEAR=1983, KEYWORDS="mobile radio", } @INPROCEEDINGS{Mark8311:Integrated, AUTHOR="J. W. Mark", TITLE="Integrated Voice/Data Services on a Dual-Ring Local Area Network", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="11.1.1-5", DAYS=28, MONTH=nov, YEAR=1983, KEYWORDS="LAN; voice/data integration", } @ARTICLE{Anon8312:Special, AUTHOR="Anonymous", TITLE="Special issue on Packet switched voice and data communication", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, MONTH=dec, YEAR=1983, KEYWORDS="packet voice", } @ARTICLE{Barb8312:Coded, AUTHOR="G. Barberis and Mario Calabrese and Livio Lambarelli and Daniele Roffinella", TITLE="Coded Speech in Packet-Switched Networks: Models and Experiments", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1028-1038", MONTH=dec, YEAR=1983, KEYWORDS="packet voice; silence detection", ANNOTE="voice packet switch; 2400 bit/s voice with speech detection and 3-hop network; voice priority; compares voice performance of standard X.25-type protocol, voice priority and no flow/error control with and without voice priority in terms of delay mean and variance (simulation and analysis); shows simulation histograms for delay distribution for batch (20\% of traffic), interactive (50\%) and voice packets (30\%), but fails to provide data on their assumed source characteristics.", } @ARTICLE{Grub8312:Requirements, AUTHOR="J. G. Gruber and N. H. Le", TITLE="Performance Requirements for Integrated Voice/Data Networks", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="981-1005", MONTH=dec, YEAR=1983, KEYWORDS="packet voice", } @ARTICLE{Kim8312:Characterization, AUTHOR="Byung G. Kim", TITLE="Characterization of Arrival Statistics of Multiplexed Voice Packets", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1133-1139", MONTH=dec, YEAR=1983, KEYWORDS="packet voice; multiplexing; arrival process; simulation", ABSTRACT="An assumption that voice packets arrive by a Poisson arrival (or an exponential interarrival) distribution has not been widely accepted by analysts from an obvious observation that voice packets are generated at regular intervals in a talkspurt. Through a simulation, supported by an approximate analysis, this paper claims that when a sufficiently large number of voice sources are multiplexed, packets observe an exponential or hypoexponential interarrival distribution. When the number of packets arriving during a single or a multiple slot is considered instead, a more liberal claim is made that regardless of the number of voice sources multiplexed, a Poisson process can be assumed with reasonable accuracy.", ANNOTE="First and second moment of the interarrival time from $n$ sources; average delay and queue length for infinite buffers show that $M/D/1$ is a reasonable model.", } @ARTICLE{Mont8312:Techniques, AUTHOR="Warren A. Montgomery", TITLE="Techniques for Packet Voice Synchronization", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1022-1028", MONTH=dec, YEAR=1983, KEYWORDS="packet voice; playout synchronization", ABSTRACT="The paper discusses blind delay (worst-case assumption), roundtrip measurement (estimate by sender), absolute timing (master clock) and accumulated variable delay (delay stamp, but maybe expensive) as synchronization methods for packet playout at receiver; relative timing within talkspurt or call may be affected by clock skew; adaptive change in playout based on speech in buffer or roundtrip delay measurements; hints at using delay information for discarding, queue scheduling and call admission", ANNOTE="references to $\mu$s on pg. 1022, 1023 should be ms.", } @ARTICLE{Muss8312:Local, AUTHOR="J. M. Musser and Te-Kai Liu and L. Li and George J. Boggs", TITLE="A Local Area Network as a Telephone Local Subscriber Loop", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1046-1054", MONTH=dec, YEAR=1983, KEYWORDS="packet voice; packet loss; loss recovery", ANNOTE="Simulation study. Replace lost packets by recirculating previous packet. With 12 ms packets, losses of up to 1.6\% are barely noticeable, losses up to 6.2\% noticeable, but not objectionable. Even losses of up to 10\% show no influence on intelligibility tests, but acceptability drops even for 0.5\% loss. Mentions that 10--12 ms is the psychoacoustic threshold for gap detection, while normative phoneme span 20--80 ms.", } @ARTICLE{Srir8312:Discrete, AUTHOR="K. Sriram and Pramod K. Varshney and J. G. Shanthikumar", TITLE="Discrete-Time Analysis of Integrated Voice/Data Multiplexers With and Without Speech Activity Detection", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1124-1132", MONTH=dec, YEAR=1983, KEYWORDS="packet voice", ABSTRACT="Discrete-time analysis of two schemes for multiplexing voice and data is presented. In each scheme voice and data are multiplexed using the movable boundary frame allocation scheme. In the first scheme, speech activity detectors (SAD's) are not used, and hence, the variations in the voice traffic are only due to the on/off characteristics of voice. In the second scheme, SAD's are employed so that talker silences can be utilized for transmission of additional voice and/or data. In this scheme, the multiplexer performs digital speech interpolation as well as movable boundary frame allocation. The performance measures considered are probability of loss for voice calls, probability of speech clipping, speech packet rejection ratio, and the expected data message delay. In the case of the mulitplexer with SAD, a tradeoff exists between data message delay and speech interpolation advantage. Some numerical examples are presented which illustrate the performance of the two multiplexers.", } @ARTICLE{Ueda8312:Experimental, AUTHOR="Hirotaka Ueda and Ikuo Tokizawa and Takahisa Aoyama", TITLE="Evaluation of an Experimental Packetized Speech and Data Transmission System", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1039-1045", MONTH=dec, YEAR=1983, ANNOTE="Provides average talk spurt, pause length and activity factor as function of SAD threshold level; describes microprocessor-based packet switch for 200 64 kb/s terminals; two-level speech detector with low-energy packets transmitted only when no data packets are waiting; speech packets have priority over data packets; speech quality does not deteriorate for discard rates of less than 5\%.", } @ARTICLE{Wein8312:Experience, AUTHOR="Clifford J. Weinstein and James W. Forgie", TITLE="Experience with Speech Communication in Packet Networks", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="963-980", NOTE="also DTIC ESD-TR-84-234", MONTH=dec, YEAR=1983, ABSTRACT="The integration of digital voice with data in a common packet-switched network system offers a number of potential benefits, including reduced system cost through sharing of switching and transmission resources, flexible internetworking among system utilizing different transmission media and enhanced services for users requiring access to both and data communications. Issues which it has been necessary to address in order to realize these benefits include reconstitution of speech from packets arriving at non-uniform intervals, maximization of packet speech multiplexing efficiency, and determination of the implementation requirements for terminals and switching in a large-scale packet voice/data system. A series of packet speech experiments to address these issues has been conducted under the sponsorship of the Defense Advanced Research Projects Agency (DARPA). In the initial experiments on the ARPAnet, the basic feasibility of speech communication on a store-and-forward packet network was demonstrated. Techniques were developed for reconstitution of speech from packets, and protocols were developed for call setup and for speech transport. Later speech experiments utilizing the Atlantic packet satellite network (SATNET) led to the development of techniques for efficient voice conferencing in a broadcast environment, and for internetting speech between a store-and-forward net (ARPAnet) and a broadcast net (SATNET). Large-scale packet speech multiplexing experiments could not be carried out on ARPAnet or SATNET where the network link capacity severely restrict the number of speech users that can be accomodated. However, experiments are currently being carried out using a wide-band satellite-based system designed to accomodate a sufficient number of simultaneous users to support realistic experiments in efficient statistical multiplexing. Key developments to date associated with the wide-band experiments have been 1) techniques for internetting via voice/data gateways from a variety of local access networks (packet cable, packet radio and circuit switched) to a long-haul broadcast satellite network and 2) compact implementations of packet voice terminals with full protocol and voice capabilities. Basic concepts and issues associated with packet speech systems are described. Requirements and techniques for speech processing, voice protocols, packetization and reconstitution, conferencing and multiplexing are discussed in the context of generic packet speech system configuration. Specific experimental configuration and key packet speech results on the ARPAnet, SATNET, and wide-band systems are reviewed.", ANNOTE="overview paper, covering mostly ARPAnet experiences, with heavy emphasis on voice conferencing; describes ST, the virtual-circuit equivalent of IP; ARPAnet experiments typically had 5 to 10 hops", } @ARTICLE{DeTr8312:Distributed, AUTHOR="John DeTreville and David W. Sincoskie", TITLE="A Distributed Experimental Communications System", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1070-1075", MONTH=dec, YEAR=1983, KEYWORDS="packet voice", ABSTRACT="The packet experimental communications system (packet XCS) is a new experimental voice and data switch. It uses a local-area network (LAN) for digital voice transmission, with local intelligence for switching. The packet XCS also has a highly distributed control. The individual sites cooperate to provide user services as well as internal data management. We have learned that several local networks, including CSMA/CD networks, can be made to work well for voice transmission and that highly distributed control is practical in such a system. A system has been constructed which is used as a testbed for distributed voice and data communication experiments. This system is purely for experimentation and does not indicate a direction for future Bell System offerings.", ANNOTE="varies packet size if an Ethernet collision occurs to prevent repeat collisions due to the periodic arrivals. 64 kb/s $\mu$-law encoded voice with silence detection. Silence detection is based on a fixed threshold for the maximum sample in a packet. To avoid sudden loudness changes, attenuate $n$th silent packet by $-n 6$ dB. 5.75 ms of playout delay for 32 ms packets. Buffer readjustment at talkspurts compensates for clock skew (0.1\%).", } @ARTICLE{Falk8312:Integration, AUTHOR="G. Falk and Stephen J. Groff and Walter Milliken and Marian Nodine and Steven Blumenthal and Winston Edmond", TITLE="Integration of Voice and Data in the Wideband Packet Satellite Network", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1076-1083", MONTH=dec, YEAR=1983, KEYWORDS="packet voice", ABSTRACT="The Wideband (packet satellite) network is an experimental 3 Mbit/s communication system developed under sponsorship of the Defense Advanced Research Projects Agency and the Defense Communications Agency. This system is being used to evaluate the use of packet transmission for efficient voice communication, voice conferencing, and integration of voice and data over a satellite channel. Each station in the Wideband network consists of an earth terminal (dedicated 5 m antenna plus associated IF/RF equipment), a burst-modem and codec unit, and a station controller. Station controllers provided interfaces to host computers (including packet speech sources) and manage the allocation of the satellite channel on a TDMA demand-assigned basis. TDMA demand-assignment is implemented using a reservation-based packet-oriented protocol capable of handling traffic at multiple priority levels. The channel provides a reservation-per-message mode of service (datagrams) to support transmission from bursty traffic sources and a reservation-per-call mode of service (streams) to support traffic with more regular arrival statistics (e.g., voice). A distributed scheduler running in every station controller eliminates the need for a central control station and minimizes network transit delay for datagram transmission as well as stream creation, modification, and deletion. In this paper, we describe the protocols and mechanisms upon which the Wideband packet satellite network is based.", } @ARTICLE{Shac8312:Speech, AUTHOR="N. Shacham and Earl Craighill and Andrew A. Poggio", TITLE="Speech Transport in Packet-Radio Networks with Mobile Nodes", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1084-1097", MONTH=dec, YEAR=1983, KEYWORDS="packet voice; mobile radio; packet radio; routing", ABSTRACT="A research effort to provide speech-carrying capabilities to a data-oriented packet-switching radio network is described. The features of the network that limit its ability to carry packetized speech are discussed, and their effects on the network performance are analyzed. A new protocol, called duct routing, that enhances the network capabilities in a mobile environment is presented. That protocol makes use of repeater redundancy to compensate for loss of communication connectivity due to node mobility. A series of experiments to evalute the network performance in carrying speech traffic, both with data and voice protocols, is described, and the results are presented and discussed.", ANNOTE="Claims 300 ms as acceptable end-to-end delay (without echo). Longer pauses and overlapping talk increase for delays between 0.3 and 1.5 s, while conversation becomes difficult for longer delays. Quotes permissible bit error rate of 1 \%. Tested CVSD at 16 kb/s and LPC at 2.4 kb/s.", } @ARTICLE{Mahm8312:Integrated, AUTHOR="S. A. Mahmoud and W. C. Chan and J. Spruce Riordon and Salah E. Aidarous", TITLE="An Integrated Voice/Data System for {VHF/UHF} Mobile Radio", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1098-1111", MONTH=dec, YEAR=1983, KEYWORDS="packet voice; speech coding", ABSTRACT="This paper presents the basic architecture and performance of a mobile radio multiaccess voice/data system. Natural pauses in conversational speech allow bandwidth saving through interleaving of data packets and talkspurts from different voice sources. A speech detector designed specifically for the mobile environment is presented. Blocking and delay performance of the multiaccess uplink is analyzed for voice traffic, assuming no traffic effects from the low priority data packets. Performance results from simulation are then presented for two downlink strategies in a two-hop virtual circuit in which a base station acts as a relay. The results verify also that the uplink analysis is valid for low voice traffic. For the data traffic, simulation results are presented in terms of data packet transmission delay and probability of collision with talkspurts. The results indicate that data flow may be limited by the collision factor. This work concludes that relative to conventional radio telephoning in which two channels are dedicated to each transmitter/receiver pair, a bandwidth reduction of 30--35 percent can be achieved.", ANNOTE="CVSD coder at 16 kb/s. Describes silence detector consisting of zero crossing detector and averaging of energy. Also provides statistics on first moments and distribution of talkspurts and pauses. The exponential distribution fits the talkspurts well, but not the silence periods.", } @ARTICLE{Arth8312:Traffic, AUTHOR="Edwards Arthur and B. W. Stuck", TITLE="Traffic Analysis Tools for Integrated Digital Time-Division Link Level Multiplexing of Synchronous and Asynchronous Message Streams", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1112-1123", MONTH=dec, YEAR=1983, KEYWORDS="packet voice; integrated services; TDMA", ABSTRACT="Information is transmitted over a digital link in repetitive time intervals called frames; each frame consists of one or more time slots. Theoretical performance limitations of a variety of time-division multiplexing policies for models of synchronous and asynchronous message streams are studied.", ANNOTE="Markovian voice model.", } @ARTICLE{Fang8312:Voice, AUTHOR="G. S. Fang", TITLE="Voice channel echo cancellation", JOURNAL=ieeecm, VOLUME=21, NUMBER=12, PAGES="11-14", MONTH=dec, YEAR=1983, KEYWORDS="speech transmission; echo cancellation", ABSTRACT="Echo generation, suppression and cancellation is described. The functions of the near-end speech detector and center clipper are discussed.", } @ARTICLE{Hobe8312:Layered, AUTHOR="William L. Hoberecht", TITLE="A layered network protocol for packet voice and data integration", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="1006-1013", MONTH=dec, YEAR=1983, KEYWORDS="packet voice; speech transmission; error control", ABSTRACT="This paper discusses considerations in the design of packet protocols suitable for interactive voice and interactive data communication, and then outlines a potential layered protocol architecture for the internal communication of a long haul network that might support packet voice and packet data transport. Following the protocol description, the paper compares potential delays for two voice/data packet network architectures: one using only link retransmission, the other using only edge retransmission for data (as included by the voice/data protocol). The underlying data traffic loads offered to the network are the same for the two methods, although they give rise to different traffic patterns. This preliminary analysis shows that the average delay using and edge-to-edge recovery discipline can be made comparable to the delays introduced with a link-to-link recovery discipline, if the network uses high-speed transmission facilities (e.g., over 1 Mbit/s) having good error characteristics (e.g., one or less packets corrupted in each 1000), and sends up to 128 bytes of customer data as a single packet.", } @ARTICLE{Deci8312:Foreword, AUTHOR="M. Decina and David Vlack", TITLE="Foreword: Voice by the Packet", JOURNAL=ieeejsac, VOLUME="SAC-1", NUMBER=6, PAGES="961-962", MONTH=dec, YEAR=1983, KEYWORDS="packet voice", } @TECHREPORT{Terr8312:Naming, AUTHOR="Douglas B. Terry", TITLE="An analysis of naming conventions for distributed computer systems", TYPE="PROGRES Report", INSTITUTION="Computer Science Division, University of California", ADDRESS="Berkeley, California", NUMBER="UCB/CSD 83/156", MONTH=dec, YEAR=1983, KEYWORDS="naming; name resolution", ABSTRACT="Name servers that collectively manage a global name space facilitate sharing of resources in a large internetwork by providing means of locating named objects. The efficiency with which the name space can be managed is strongly influenced by the adopted naming convention. Structured name spaces are shown to simplify name space management from both an administrative and system viewpoint. Formulae have been derived which allow one to quantitatively measure the effect of the distributed name server configuration on a given client's level of performance. In general, the cost of a name server query can be reduced by distributing replicated copies of name server database entries in a way that exploits the locality of clients' reference patterns.", } @TECHREPORT{Ferr8312:Evolution, AUTHOR="D. Ferrari", TITLE="The evolution of Berkeley {UNIX}", TYPE="PROGRES Report", INSTITUTION="Computer Science Division, University of California", ADDRESS="Berkeley, California", NUMBER="UCB/CSD 83/155", MONTH=dec, YEAR=1983, KEYWORDS="UNIX; Berkeley UNIX; operating systems", ABSTRACT="The current plans for the evolution of the Berkeley UNIX operating system are outlined. The objective of these plans is to make the system capable of offering its users various degrees of autonomy, transparency, and user power. The possible stages of such evolution, and the projects that have been recently undertaken to provide the bases for stage-to-stage transitions are briefly described.", } @ARTICLE{Perl8312:Fault, AUTHOR="R. Perlman", TITLE="Fault-Tolerant Broadcast of Routing Information", JOURNAL=cn, MONTH=dec, YEAR=1983, KEYWORDS="routing; fault tolerance", } @ARTICLE{Hanl8312:Spezifikation, AUTHOR="J. O. Hänle and E. Schriefer", TITLE="Spezifikation, Implementierung und Test von Kommunikationsprotokollen, basierend auf ihrer Darstellung durch endliche Automaten", JOURNAL="DFN", MONTH=dec, YEAR=1983, LANGUAGE="German", REFERENCES=3, KEYWORDS="Protocol Specification; Test; Implementation", } @INPROCEEDINGS{Over8312:Model, AUTHOR="C. Overstreet", TITLE="Model specification with respect to analysis", BOOKTITLE=wsc, ADDRESS="Arlington, Virginia", PAGES="429-", MONTH=dec, YEAR=1983, KEYWORDS="Specification language; discrete event model; error analysis", ABSTRACT="A specification language for discrete event models to be used in model development system is described. The language is structured to support error analysis of both partially and completely specified models. Analysis of a model specification can also provide useful model documentation and implementation assistance. The language is intended to be used in conjunction with a model specification generator (a program to assist a modeler or modeling team with the", } @ARTICLE{Hluc8312:Preemptive, AUTHOR="M. G. Hluchyj and C. D. Tsao and R. R. Boorstyn", TITLE="Performance analysis of a preemptive priority queue with applications to packet communication systems", JOURNAL=bstj, VOLUME=62, NUMBER=10, PAGES="3225-3245", MONTH=dec, YEAR=1983, KEYWORDS="Queueing system; priority; analysis", } @ARTICLE{Ripl8312:Computer, AUTHOR="B. D. Ripley", TITLE="Computer generation of random variables: A tutorial", JOURNAL="International Statistical Review", VOLUME=51, NUMBER=3, PAGES="301-319", MONTH=dec, YEAR=1983, KEYWORDS="random variate generation", } @ARTICLE{Rols8312:Continuous, AUTHOR="T. Rolski", TITLE="Continuous versions of the queuing formulas {L=lambda*W} and {H=lambda*G}", JOURNAL=orl, VOLUME=2, NUMBER=5, PAGES="211-215", MONTH=dec, YEAR=1983, KEYWORDS="Queueing theory; Little's formula", } @ARTICLE{Haer8312:Principles, AUTHOR="T. Haerder and A. Reuter", TITLE="Principles of Transaction-Oriented Database Recovery", JOURNAL=acmcs, VOLUME=15, NUMBER=4, PAGES="287-318", MONTH=dec, YEAR=1983, } @ARTICLE{King8312:Centralized, AUTHOR="J. L. King", TITLE="Centralized vs Decentralized Computing: Organizational Considerations and Management Options", JOURNAL=acmcs, VOLUME=15, NUMBER=4, PAGES="319-350", MONTH=dec, YEAR=1983, } @ARTICLE{LeeD8312:Voice, AUTHOR="Duan-Shin. Lee and F. H. Lochovsky", TITLE="Voice Response Systems", JOURNAL=acmcs, VOLUME=15, NUMBER=4, PAGES="351-374", MONTH=dec, YEAR=1983, } @ARTICLE{Ebih8312:GAMMA, AUTHOR="Y. Ebihara and K. Ikeda and T. Nakamura and M. Ishizaka and M. Shinzawa and K. Nakayama", TITLE="{GAMMA-NET:} A local computer network coupled by a high speed optical fibre ring bus system: Concept and structure", JOURNAL=cn, VOLUME=7, PAGES="375-388", MONTH=dec, YEAR=1983, } @ARTICLE{Gee8312:Choosing, AUTHOR="K. Gee", TITLE="Choosing a local area network", JOURNAL=comcom, VOLUME=6, PAGES="313-319", MONTH=dec, YEAR=1983, } @ARTICLE{Hutc8312:Terminal, AUTHOR="D. Hutchison", TITLE="Terminal concentrators for an Ethernet style local network", JOURNAL=comcom, VOLUME=6, PAGES="291-296", MONTH=dec, YEAR=1983, } @ARTICLE{Gira8312:End, AUTHOR="Andre Girard and Y. Ouimet", TITLE="End-to-End Blocking for Circuit-Switched Networks: Polynomial Algorithms for Some Special Cases", JOURNAL=ieeecom, VOLUME="COM-31", PAGES="1269-1273", MONTH=dec, YEAR=1983, } @ARTICLE{King8312:Centralised, AUTHOR="J. L. King", TITLE="Centralised versus Decentralised Computing: Organisational Considerations and Management Options", JOURNAL=acmcs, VOLUME=15, NUMBER=4, PAGES="319-350", MONTH=dec, YEAR=1983, } @TECHREPORT{McCu8312:Derivation, AUTHOR="E. Robert McCurley and F. Schneider", TITLE="Derivation of a Distributed Algorithm for Finding Paths in Directed Networks", INSTITUTION="Cornell University, Computer Science Department", NUMBER="TR83-586", PAGES=15, MONTH=dec, YEAR=1983, ABSTRACT="A distributed algorithm is developed that can be used to compute the topology of a network, given that each site starts with information about sites it is adjacent to, the network is strongly connected, and communication channels are uni-directional. The program is derived and proved correct using assertional reasoning.", } @ARTICLE{Linn8312:Testing, AUTHOR="R. J. Linn and J. S. Nightingale", TITLE="Testing {OSI} Protocols at the National Bureau of Standards", JOURNAL=ieeeproc, VOLUME=71, NUMBER=12, PAGES="1431-1434", MONTH=dec, YEAR=1983, REFERENCES=9, KEYWORDS="Protocol testing", } @ARTICLE{Day8312:OSI, AUTHOR="John Day and H. Zimmermann", TITLE="The {OSI} Reference Model", JOURNAL=ieeeproc, VOLUME=71, NUMBER=12, PAGES="1334-1340", MONTH=dec, YEAR=1983, KEYWORDS="OSI; network architecture", } @ARTICLE{Call8312:Internetwork, AUTHOR="R. Callon", TITLE="Internetwork Protocol", JOURNAL=ieeeproc, VOLUME=71, NUMBER=12, PAGES="1388-1392", MONTH=dec, YEAR=1983, }