@UNPUBLISHED{Berg89:Overload, AUTHOR="Arthur W. Berger", TITLE="Overload Control in Star Networks: Comparison of Percent Blocking Throttle and {LIFO} Queue Discipline", NOTE="Working paper from AT\\&T Bell Laboratories", YEAR=1989, KEYWORDS="congestion control; overload control; LIFO; packet discarding", ANNOTE="compares goodput for $\rho > 1$; server spends time entering customers into queue; $M/M/1$ model", } @ARTICLE{Blon89:Finite, AUTHOR="C. Blondia", TITLE="The {$N/G/1$} Finite Capacity Queue", JOURNAL=comstat, VOLUME=5, NUMBER=2, PAGES="273-294", YEAR=1989, KEYWORDS="queueing theory", } @MISC{CCIT89:Draft, AUTHOR="C. C. ITT", TITLE="Draft Recommendation {G.PVNP:} Packetized Voice Networking Protocol", PAGES="151-160", NOTE="Appendix 2 to Annex 1 of Question 24/XV (COM XV-1-E)", YEAR=1989, KEYWORDS="packet voice", ANNOTE="Suitable for basic-rate ISDN; variable length packets with bit-dropping (blocks of msb, next-to-msb, etc.); time stamp records variable (queueing) delays in milliseconds and is used to schedule play-out of first packet in talk-spurt (sequence number zero); 4-bit sequence numbers, wrapping around from fifteen to one during a talkspurt, are used to detect missing packets; allows for different coding schemes (PCM and ADPCM variations) encoded in each data packet.", } @BOOK{Casw89:Matrix, AUTHOR="Hal Caswell", TITLE="Matrix Population Models", PUBLISHER="Sinauer Associates", ADDRESS="Sunderland, Massachusetts", YEAR=1989, KEYWORDS="stochastic processes", } @ARTICLE{Glyn8901:Indirect, AUTHOR="P. W. Glynn", TITLE="Indirect Estimation via $L=\lambda {W$}", JOURNAL=or, VOLUME=37, NUMBER=1, PAGES="82-103", MONTH="January/February", YEAR=1989, REFERENCES=52, KEYWORDS="queueing theory; Little's law; limit theorem; GI/G/S", } @UNPUBLISHED{Grav89:Simultaneity, AUTHOR="A. Gravey", TITLE="Simultaneity in Discrete-Time Single Server Queues with Bernoulli Inputs", NOTE="published by Centre National d'Etudes des Télécommunications", YEAR=1989, KEYWORDS="discrete time queue", ANNOTE="Arrivals first and departures first.", } @INPROCEEDINGS{Holt89:Using, AUTHOR="J. M. Holtzmann", TITLE="On Using Perturbation Analysis to do Sensitivity Analysis: Derivatives vs. Differences", BOOKTITLE="28th IEEE Conference on Decision and Control", ORGANIZATION="IEEE", YEAR=1989, } @INPROCEEDINGS{Kall89:Optimality, AUTHOR="Michelle Hruby Kallmes and Donald F. Towsley and Christos Cassandras", TITLE="Optimality of the Last-In-First-Out {(LIFO)} Service Discipline in Queueing Systems with Real-Time Constraints", BOOKTITLE="28th Conference on Decision and Control (CDC)", ORGANIZATION="IEEE", ADDRESS="Tampa, Florida", PAGES="1073-1074", YEAR=1989, KEYWORDS="queueing theory; LIFO; real-time", ANNOTE="Among non-preemptive, non-deadline-dependent scheduling disciplines and concave deadline cdf, LIFO yields the highest goodput, FIFO the lowest for $G/G/c$ queues. The result holds for deadlines on system and queueing time as well as for bulk arrivals. For $G/M/1$, pre-emptive LIFO is best. For deterministic deadlines, LIFO outperforms FIFO for deadlines below a critical value, but does worse above it.", } @UNPUBLISHED{Karm89:High, AUTHOR="G. Karmi", TITLE="High Speed Communication Networks", NOTE="Presentation to ECE Industrial Advisory Panel", YEAR=1989, KEYWORDS="BISDN", } @ARTICLE{Kram89:Buffer, AUTHOR="M. Kramer", TITLE="Analysis of a Buffer Queueing Problem in Discrete Time", JOURNAL=qs, VOLUME=5, NUMBER=4, PAGES="369-380", YEAR=1989, KEYWORDS="discrete time queue", ANNOTE="Generating functions of time-dependent and stationary queue length distributions for single-server system with bulk arrivals, finite queue, limited service, vacations.", } @UNPUBLISHED{Kuro89:Exact, AUTHOR="James F. Kurose", TITLE="An Exact Analysis of Customer Loss Under Minimum Laxity Scheduling in Discrete-Time Queueing Systems", NOTE="Unpublished working paper", YEAR=1989, KEYWORDS="queueing theory; minimum laxity; discrete time queue", } @BOOK{Leon89:Probability, AUTHOR="A. Leon-Garcia", TITLE="Probability and Random Processes for Electrical Engineering", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1989, KEYWORDS="probability theory; random processes", } @UNPUBLISHED{Leun89:Routing, AUTHOR="J. Y.-T. Leung and Tommy W. Tam and Chun Wong and Gilbert H. Young", TITLE="Routing Messages with Release Time and Deadline Constraints", NOTE="Unpublished manuscript", YEAR=1989, KEYWORDS="routing; complexity; ring network; polynomial-time algorithm; strong NP-completeness; computational complexity; nonpreemptive transmission; preemptive transmission; real-time message; release time; deadline; on-line routing", ABSTRACT="The problem of determining whether a set of real-time messages can be routed in a network is considered. Each message has five parameters associated with it -- origin node, destination node, length, release time and deadline. The complexity of the problem is considered under various restrictions of the four parameters: origin node, destination node, release time and deadline. It is shown that if the network is arbitrary, the problem is NP-complete even when all four parameters are fixed. Motivated by the complexity of the problem, we consider a simple network -- an unidirectional ring. For nonpreemptive transmission, it is shown that the problem is solvable in polynomial time when any one of the four parameters is allowed to be arbitrary, and that is becomes NP-complete when any two of them are fixed. The same kind of complexity results hold for preemptive transmission, except the following two cases: (1) same origin node and release time, and (2) same destination node and deadline. The complexity of these two cases remain open. The possibility of having an optimal on-line algorithm is also considered. It is shown that no such algorithm can exist unless all of the remaining three parameters are fixed.", ANNOTE="Complexity of determing whether a set of real-time messages can be routed in a network.", } @UNPUBLISHED{Li89:Traffic, AUTHOR="Song Li and J. W. Mark", TITLE="Traffic Characterization for Integrated Services Networks", NOTE="unpublished memorandum", YEAR=1989, KEYWORDS="queueing theory; source model", ABSTRACT="In an integrated service network (ISN), time-critical traffic tends to be lengthy and steady and possesses high correlation between the adjacent message arrivals. This high correlation behavior can seriously impair the network performance. Most queueing analyses in the literature only consider the traffic at the steady state. To characterize the effect of traffic correlation on the queuing process, we introduce a new traffic model by building memory in each source, in which the concept of correlation function and power spectral density is used to describe the correlation behavior of each traffic type. Based on this model, the queueing analysis of integrated services on a packet switched TDM system is developed. The resulting expression reflects the essential qualitative features of the system and provides much useful information on its physical behavior. Furthermore, a lengthy-steady traffic is highly predictable. One aspect in network design which has not been fully exploited in the literature is how to make use of this predictable nature to minimize the correlation effect. This paper proposes and analyzes an adaptive flow control and routing scheme that successively adjusts the short-bursty traffic arrival rate at each TDM node. The analytical results indicate a substantial reduction in the correlation effect on the system behavior.", } @TECHREPORT{Lin89:Fixed, AUTHOR="A. Y. Lin and J. A. Silvester", TITLE="Fixed-Node Routing Architecture and Its Performance in {ATM} Networks", INSTITUTION="Computer Engineering Division, Electrical Engineering-Systems Department, University of Southern California", ADDRESS="Los Angeles, California", NUMBER="CRI 89-26", NOTE="infocom", YEAR=1989, KEYWORDS="BISDN; queueing theory", ANNOTE="Compares single output channel to multiple channel architecture, using $D^{[A]}/D/1/K$ and $D\_1 + \ldots + D\_N/D/1/K$ traffic models.", } @TECHREPORT{Lin89:Queueing, AUTHOR="A. Y. Lin and J. A. Silvester", TITLE="Queueing Analysis of an {ATM} Switch with Multichannel Transmission Groups", INSTITUTION="Computer Engineering Division, Electrical Engineering-Systems Department, University of Southern California", ADDRESS="Los Angeles, California", NUMBER="CRI 89-25", YEAR=1989, KEYWORDS="discrete time queue", ANNOTE="discrete-time $D^{[A]}/D/c/K$ and $D\_1+\ldots D\_N/D/c/K$ (periodic arrivals) system", } @ARTICLE{Reim8909:Sensitivity, AUTHOR="M. I. Reiman and A. Weiss", TITLE="Sensitivity Analysis for Simulations Via Likelihood Ratios", JOURNAL=or, VOLUME=37, NUMBER=5, PAGES="830-844", MONTH="September/October", YEAR=1989, ANNOTE="Perturbation analysis.", } @ARTICLE{Rubi8901:Sensitivity, AUTHOR="R. Y. Rubinstein", TITLE="Sensitivity Analysis and Performance Extrapolation for Computer Simulation Models", JOURNAL=or, VOLUME=37, NUMBER=1, PAGES="72-81", MONTH="January/February", YEAR=1989, ANNOTE="Perturbation analysis.", } @BOOK{Verm89:Estimation, AUTHOR="Pramode K. Verma", TITLE="Performance Estimation of Computer Communication Networks: A Structured Approach", PUBLISHER="Computer Science Press", ADDRESS="New York, New York", YEAR=1989, ANNOTE="TK5105.5.V47", } @BOOK{Wolf89:Stochastic, AUTHOR="R. W. Wolff", TITLE="Stochastic Modeling and the Theory of Queues", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1989, } @INPROCEEDINGS{Aras89:HMP, AUTHOR="Caglan M. Aras and Ren C. Luo", TITLE="{HMP:} A Hierarchical Multiprocessor computer architecture for multi-sensor based robotic tasks", BOOKTITLE="IEEE International Symposium on Intelligent Control", ADDRESS="Piscataway, New Jersey", PAGES="487-492", YEAR=1989, } @BOOK{Beam89:Command, AUTHOR="Walter R. Beam", TITLE="Command, control and communication systems engineering", PUBLISHER="McGraw-Hill", ADDRESS="New York", YEAR=1989, } @INPROCEEDINGS{Bhuy89:Interconnection, AUTHOR="L. Bhuyan and Haitao Jiang and D. Ghosal", TITLE="From interconnection network to task level analysis", BOOKTITLE="International Conference on Parallel Processing", ADDRESS="Pennsylvania State University, Pennsylvania", PAGES="73-77", YEAR=1989, } @PHDTHESIS{Clar89:Data, AUTHOR="Dave Clark", TITLE="Data Communication in Robot Control Systems", SCHOOL="New York University", YEAR=1989, } @ARTICLE{Crow89:Planning, AUTHOR="James Crowley", TITLE="Planning and Execution of Tasks for a Domestic Robot", JOURNAL="Robotics and Autonomous Systems", VOLUME=5, PAGES="257-272", YEAR=1989, } @INPROCEEDINGS{Forn89:Implementation, AUTHOR="R. J. Fornaro and E. W. Davis and C. F. Hendriks and S. E. Polge", TITLE="Analysis and implementation of hierarchical real-time architectures", BOOKTITLE="Proceedings: Euromicro Workshop on Real Time", ADDRESS="Piscataway, New Jersey", PAGES="66-73", YEAR=1989, } @INPROCEEDINGS{Han89:Modeling, AUTHOR="Junsheng Han and Chia-Jiu Wang", TITLE="Modeling an Performance Evaluation of Multiprocessor Systems for Real-Time Nonlinear Robot Control", BOOKTITLE="IEEE Robotics and Automation Conference", PAGES="1016-1021", YEAR=1989, } @INPROCEEDINGS{Harm89:Method, AUTHOR="S. Y. Harmon", TITLE="A method for estimating computational requirements for complex robots", BOOKTITLE="SPIE Mobile RobotsIV", ADDRESS="Philadephia, Pennsylvania", VOLUME=1195, PAGES="138-147", YEAR=1989, } @BOOK{Heal89:VMEbus, AUTHOR="Steve Health", TITLE="{VMEbus} Users Handbook", PUBLISHER="CRC Press", ADDRESS="Boca Raton, Florida", YEAR=1989, } @ARTICLE{Ko89:CSMA, AUTHOR="C. C. Ko and K. M. Lye and K. C. Chua and F. T. Yap", TITLE="Analysis of a {CSMA/CD-based} Protocol with Dynamic Segmentation", JOURNAL=cnis, VOLUME=16, PAGES="347-355", YEAR=1989, } @INPROCEEDINGS{Mahm89:Communication, AUTHOR="Syed M. Mahmud", TITLE="Communication performance in a hierarchical bus system", BOOKTITLE="IEEE International Symposium on Circuits and Systems", ADDRESS="Piscataway, New Jersey", VOLUME=1, PAGES="122-125", YEAR=1989, } @INPROCEEDINGS{Mati89:NASA, AUTHOR="J. R. Matijevic and W. F. Zimmerman and S. Dolinsky", TITLE="The {NASA/OAST} Telerobot Testbed Architecture", BOOKTITLE="NASA Conference on Space Telerobotics", ADDRESS="Pasadena, California", VOLUME=1, PAGES="185-195", YEAR=1989, } @ARTICLE{Onvu8904:Equivalencies, AUTHOR="R. O. Onvural and Harry Perros", TITLE="Equivalencies between open and closed queueing networks with finite buffers", JOURNAL=pe, VOLUME=9, NUMBER=4, PAGES="263-269", YEAR=1989, } @INPROCEEDINGS{Peng89:Static, AUTHOR="Dartzen Peng and Kang G. Shin", TITLE="Static allocation of periodic tasks with precedence constraints in distributed real-time systems", BOOKTITLE=dcs, ADDRESS="Piscataway, New Jersey", PAGES="190-198", YEAR=1989, } @ARTICLE{Perl89:Better, AUTHOR="Yesoshua Perl", TITLE="Better understanding ofBatcher's Merging Networks", JOURNAL="Discrete Applied Mathematics", VOLUME=25, PAGES="257-271", YEAR=1989, } @BOOK{Pete89:VMEbus, AUTHOR="Wade D. Peterson", TITLE="The {VMEbus} Handbook", PUBLISHER="VMEBus International Trade Association (VITA)", ADDRESS="Scottsdale, Arizona", YEAR=1989, } @ARTICLE{Reev89:Adaptive, AUTHOR="Douglas Reeves and Edward F. Gehringer", TITLE="Adaptive Routing for Hypercube {Multiprocessors:A} Performance Study", JOURNAL="International Journal of High Speed Computing", NOTE="In Print", YEAR=1989, } @INPROCEEDINGS{Shin89:Floating, AUTHOR="Kang G. Shin and Yogesh Muthuswamy", TITLE="Floating communication processor architecture in a distributed real-time system", BOOKTITLE="Twenty-2nd Annual Hawaii International Conference on System Sciences: Architecture Track", ADDRESS="North Hollywood, California", PAGES="120-126", YEAR=1989, } @INPROCEEDINGS{Simm89:Task, AUTHOR="Reid Simmons and Tom Mitchell", TITLE="A Task Control Architecture for Autonomous Robots", BOOKTITLE="SOAR Conference", YEAR=1989, } @INPROCEEDINGS{Vand89:Graph, AUTHOR="Daved E. VandenBout and Thmas K. Miller I. I. I", TITLE="Graph Partitioning Using Annealed Neural Networks", BOOKTITLE="IJCNN: International Joint Conference on Neural Networks", ADDRESS="Washington, D.C.", VOLUME=1, PAGES="521-528", YEAR=1989, } @INPROCEEDINGS{Hira89:ATM, AUTHOR="Atsushi Hiramatsu", TITLE="{ATM} communications network control by neural network", BOOKTITLE="International joint conference on neural networks (IJCNN)", ORGANIZATION="IEEE", ADDRESS="Washington, D.C.", PAGES="I-259-1-266", YEAR=1989, KEYWORDS="neural networks; ATM; call admission control", ABSTRACT="A learning control method using neural networks for service quality control in the asynchronous transfer mode (ATM) network is described. An ATM network is a high-speed packet switching network for the data transmission layer of BISDN, (Broadband Integrated Services Network) which provides multimedia services, including voice, data and video. Service quality control is one of the most crucial issues in realizing a flexible ATM network. It is a challenging research task to build an efficient network controller which can control the network traffic even when the precise characteristics of the source traffic are not known and the service quality requirements change over time. The proposed ATM network controller is flexible in function and simple in implementation, because neural networks using back-propagation learn the relations between the offered traffic and service qualities. A training data selection method called 'leaky pattern tables' is proposed to learn the accurate relations. The performance of the proposed controller is evaluated by simulation of a basic call regulation model.", } @BOOK{Inmo89:TransputerPerformance, AUTHOR="Inmos", TITLE="Transputer applications notebook: systems and performance", PUBLISHER="Inmos", ADDRESS="Bristol, United Kingdom", YEAR=1989, KEYWORDS="transputer; computer architecture", } @BOOK{Inmo89:TransputerSoftware, AUTHOR="Inmos", TITLE="Transputer applications notebook: architecture and software", PUBLISHER="Inmos", ADDRESS="Bristol, United Kingdom", YEAR=1989, KEYWORDS="transputer; computer architecture", } @BOOK{Roge89:Hands, AUTHOR="Mike Rogers and Virginia Bare", TITLE="Hands-on Apple Talk", ISBN="0-13-039678-9", PUBLISHER="Simon and Schuster", ADDRESS="New York, New York", YEAR=1989, KEYWORDS="Apple Talk; local area networks; DDP; ALAP; ELAP; AARP; NBP; RTMP; ATP; EP; protocols", } @INPROCEEDINGS{Hari89:Cache, AUTHOR="S. Haridi and E. Hagerstein", TITLE="The cache conherency protocol of the data diffusion machine", BOOKTITLE="In Procedings of Parallel Architectures and Languages Europe", PUBLISHER="Springer-Verlag", YEAR=1989, } @BOOK{Burr89:Project, AUTHOR="J. W. Burren and S. C. Cooper", TITLE="Project {UNIVERSE:} an Experiment in High-Speed Computer Networking", PUBLISHER="Clarendon", YEAR=1989, REFERENCES=138, ANNOTE="Datagrams are a disadvantage when LANs are connected together as they contribute additional processing overhead at network bridges ``In a high speed network the CPU power of the bridges is likely to be the limiting factor'' LANs provide broadcast or multicast services naturally. Satellite systems provide much the same facilities as LANs except for the fact that they have a very long transmission delay. Satellite networks are 'one-hop' (the satellite does not provide store and forward facilities) and provide broadcast facilities naturally. Monitoring of networks gathers basic information necessary to diagnose problems, implement controls, accounting or charging of network use and highly loading of the network's resources over time. ``Computer data require some means for ensuring error-free communication accross the network, but do not generally need tight constraints on packet transmission times.'' ``Voice and video data require tight constraints on transit time 'jitter', but can acccept some loss or corruption of the information during transmission.'' Characteristics routes in the Universe network were provided by the nameservers when connections to NVEs were being made so that average jitter delays and the like could be set up for voice protocols, etc. Remote terminal access requires high bit rates in bursts and low transmission delays to be acceptable. Although bulk data transfer does not need a short delay as far as the end user is concerned, long latency in the network can stil make it difficult to provide an appreciable amount of the underlying bandwidth to the user. Network management tools are hard to provide as afterthought and on high speed networks, the components providing these tools have the problem of also having to handle vast quantities of user data. Cacheing can be sometimes be used quite effectively to overcome some of the performance losses due to network delays.", } @INPROCEEDINGS{Mart89:DQDB, AUTHOR="P. Martini", TITLE="The {DQDB} Protocol - What About Fairness?", BOOKTITLE=globecom, PUBLISHER="IEEE", PAGES="298-302", YEAR=1989, REFERENCES=9, ANNOTE="DQDB was originally known as QPSX which stood for Queued Packet and Synchronous Exchange. DQDB is formed from two counter rotating unidirectional buses which operate synchronously within the MAC sublayer using fixed length slots. DQDB offers both packet and circuit service allowing users to choose between a guaranteed pre-arbitrated service and a queue-based service. For the queued service, it can be shown that the DQDB system unfairly distributes bandwidth to stations based upon their geographic location upon the bus. This is because the stations attached far from the slot generators do not really have a chance to capture any of the bandwidth. The point at which DQDB becomes fair depends heavily upon the length of the bus and the number of stations attached. For example a 10km bus is fair with more than 20 stations attached but a 100km bus requires over 120 stations start getting fair. The model used to in the paper to derive the results did not take into account pre-arbitrated traffic. Pre-arbitrated traffic is likely to make DQDB appear fairer as the slot requests are carried in pre-arbitrated slots and so lots of isochronous traffic reduces the disadvantages of geographical location. Even when the unfairness is taken into account, DQDB offers packet transfer times which are far smaller than FDDI-II even for the most badly affected station.", } @ARTICLE{Stan89:Interdeparture, AUTHOR="D. A. Stanford and W. Fischer", TITLE="The Interdeparture-Time Distribution for each Class in the (Sum Mi)/Gi/1 Queue", JOURNAL=qs, VOLUME=4, PAGES="179-191", YEAR=1989, REFERENCES=15, KEYWORDS="Interdeparture time; M/G/1; analysis; Laplace transform", } @ARTICLE{Sumi89:Interprocessor, AUTHOR="S. Sumita", TITLE="Performance analysis of interprocessor communications in an electronic switching system with distributed control", JOURNAL=pe, VOLUME=9, NUMBER=2, PAGES="83-91", YEAR=1989, REFERENCES=27, KEYWORDS="Queueing system; switching system; tandem queue; gating", } @ARTICLE{Suzu89:Temporal, AUTHOR="I. Suzuki and H. Lu", TITLE="Temporal Petri Nets and Their Application to Modeling and Analysis of a handshake daisy chain arbiter", JOURNAL=ieeetc, VOLUME=38, NUMBER=5, PAGES="696-704", YEAR=1989, KEYWORDS="Arbiter; concurrent system; temporal Petri net", ANNOTE="We introduce a new class of Petri nets, called temporal Petri nets, in which timing constaints are represented by the operato rs of temporal logic. Due to the versatility of the temporal logic operators to express temporal assertions, temporal Petri netscan describe clearly and compactly causal and temporal relationships between the events of a system including eventuality and fairness.", } @ARTICLE{Tran89:Load, AUTHOR="P. Tran-Gia and Erwin P. Rathgeb", TITLE="Performance Analysis of Load-Balancing Semidynamic Scheduling Mechanisms in Distributed Systems", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart, Germany", VOLUME=43, PAGES="38-45", YEAR=1989, REFERENCES=17, KEYWORDS="Load balancing; scheduling; distributed system; G/G/1", } @ARTICLE{Tsai89:Simple, AUTHOR="Wei K. Tsai and P. E. Cantrell", TITLE="A simple derivation of transient queue statistics and applications", JOURNAL=pe, VOLUME=10, NUMBER=2, PAGES="103-114", YEAR=1989, REFERENCES=22, KEYWORDS="Queueing system; discrete time analysis; transient", } @ARTICLE{Varm89:Fault, AUTHOR="A. Varma and C. S. Raghavendra", TITLE="Fault-Tolerant Routing in Multistage Interconnection Networks", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=3, PAGES="385-393", YEAR=1989, KEYWORDS="Fault tolerance; multistage interconnection network; Omega", ANNOTE="In this paper, we study the fault tolerance of multiprocessor systems with multistage interconnection networks under multiple faults in the network. The fault tolerance is analyzed with respe ct to the criterion of dynamic full access (DFA) property of theprocessors in the system. A characterization of multiple faults in the Omega network is introduced and used to develop simple tests for the DFA capability under a given set of faults.", } @ARTICLE{Wagn89:Parallel, AUTHOR="D. B. Wagner and E. D. Lazowska", TITLE="Parallel simulation of queueing networks: limitations and potentials", JOURNAL=per, VOLUME=17, NUMBER=1, PAGES="146-155", YEAR=1989, REFERENCES=22, KEYWORDS="Distributed simulation; queueing network", } @ARTICLE{Webe89:Lastprofile, AUTHOR="D. Weber and C. Hauber", TITLE="Lastprofile von Belegungen in rechnergesteuerten Kommunikationssystemen", JOURNAL=ntzarchiv, VOLUME=11, NUMBER=1, PAGES="17-22", YEAR=1989, LANGUAGE="German", REFERENCES=6, KEYWORDS="Switching system; traffic model; ISDN; overload control", ANNOTE="Um die Eigenschaften unterschiedlicher Belegungen zu charakterisieren, wird unter Berücksichtigung der den Einfallsprzessen zugrunde liegenden statistischen Gesetzmäßigkeiten eine Darstellungsform für sogenannte Lastprofile entwickelt. Diese spiegelt das im statistischen Mittel zu erwartende Verhalten der Belegung wieder.", } @ARTICLE{Wies89:Exact, AUTHOR="J. E. Wieseltheir and Anthony Ephremides and L. A. Michaels", TITLE="An exact analysis and performance evaluation of framed {ALOHA} with capture", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=2, PAGES="125-137", YEAR=1989, KEYWORDS="LAN; Aloha; network; performance evaluation", ANNOTE="In this paper, we present an exact analysis of framed ALOHA for the case of a finite number of users. This analysis, which is based on the use of a new combinatorial technique, does not requ ire any resrtrictive assumptions on channel traffic. This model can accommodate a general model for capture, in which the proba bility that one packet isreceived successfully depends on the nu mber of packets infolved in the collision.", } @ARTICLE{Wils89:Comparative, AUTHOR="G. A. Wilson", TITLE="Comparative timings of three different set implementations in {OCCAM}", JOURNAL=spe, VOLUME=19, NUMBER=3, PAGES="273-281", YEAR=1989, KEYWORDS="Occam; transputer; set theory; programming; benchmark", } @ARTICLE{Wong89:Fairness, AUTHOR="F. S. Wong and J. de Marca", TITLE="Fairness in Window Flow Controlled Computer Networks", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=5, PAGES="475-480", YEAR=1989, REFERENCES=18, KEYWORDS="Flow control; network; fairness; packet switching; computer", ANNOTE="Flow control is an issue of utmost importance in the design and operation of computer networks. From its fundamental functions, the one which has received less attention is measure is proposed based ontwo concepts: 1) the congestion caused by a virtual circuit (VC), 2.) the penalty inflicted by the network into a VC. These two concepts are combined to define a new fairness criterion.", } @ARTICLE{Wood89:Throughput, AUTHOR="C. M. Woodside", TITLE="Throughput calculation for basic stochastic rendezvous networks", JOURNAL=pe, VOLUME=9, NUMBER=2, PAGES="143-160", YEAR=1989, REFERENCES=20, KEYWORDS="Interprocess communication; performance evaluation", } @ARTICLE{Kauf89:Conservation, AUTHOR="J. S. Kaufman", TITLE="A conservation law based approximate analysis for a class of simultaneous resource possession problems", JOURNAL=pe, VOLUME=10, NUMBER=4, PAGES="263-280", YEAR=1989, REFERENCES=17, KEYWORDS="Delay system; FIFO; packet switching; M/G/1; resource", } @ARTICLE{Akyi89:Special, AUTHOR="Ian Akyildiz and Harry Perros", TITLE="Special issue on queueing networks with finite capacity queues", JOURNAL=pe, VOLUME=10, NUMBER=3, PAGES=260, YEAR=1989, KEYWORDS="Queueing network; finite capacity; performance evaluation", ANNOTE="7 papers on that issue by van Dijk, Kouvatsos and Xenios, Frein and Dallery, Brandwajn and Shai, Hillier and So, Ammar and Gershwin, Onvural plus a bibliography (195 entries) on the topic by Perros", } @ARTICLE{Bree89:Study, AUTHOR="J. Breecher", TITLE="A Study of Program Restructuring in a Virtual Memory System", JOURNAL=pe, VOLUME=10, NUMBER=2, PAGES="79-92", YEAR=1989, REFERENCES=16, KEYWORDS="Paging; Program Behavior; Program Restructuring; Bradford", ANNOTE="The effects of module restructuring on the behavior of programs are measured in a multiuser virtual memory operating system. Comparisons are made of the performance improvement as a function of the restructuring technique used. It is found that the improvement depends on the level of memory contenstion in the system. .", } @ARTICLE{Qin89:Model, AUTHOR="B. Qin and H. A. Sholl and R. A. Ammar", TITLE="A Model to Predict the Average Response Time of User Programs", JOURNAL=pe, VOLUME=10, NUMBER=2, PAGES="93-101", YEAR=1989, REFERENCES=15, KEYWORDS="Time sharing; Response Time; CPU Time; Round Robin", ANNOTE="The queueing model is often used to analyse the avarage responsetime in round-robin systems. A model that can analyse the avarage response time in round-robin systems is presented in this paper. This model is based on the state transition model. Each state in the model represents the number of programs in thesystem. It is assumend in the model that a state transition occurs every dt time instants. .", } @INPROCEEDINGS{Gala89:ATM, AUTHOR="G. Galassi and G. Rigolio", TITLE="{ATM:} Bandwidth assignment and bandwidth enforcement", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", PAGES="1788-1793 (49.6)", YEAR=1989, REFERENCES=10, KEYWORDS="ATM; traffic model; traffic mix; source policing", ANNOTE="Two new CAC mechanisms are described. (Class related rule)", } @ARTICLE{Arth89:Broadband, AUTHOR="E. Arthurs and Matthew S. Goodman and Haim Kobrinski and P. Vecchi", TITLE="A Broadband Optoelectronic Packet Switching System", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=6, PAGES="645-648", YEAR=1989, REFERENCES=9, KEYWORDS="Packet switching; broadband; arbitration protocol", ANNOTE="A new architecture is presented for an optoelectronic hybrid packet switching system (HYPASS) for the distribution of multiple-bitrate broadband services. HYPASS is based on an input-buffered/output-controlled arbitration protocol. This packet switch uses novel multiwavelength optical networks to accomplish routing and transmission of the packets.", } @ARTICLE{Bamb89:Queues, AUTHOR="N. Bambos and J. Walrand", TITLE="On Queues With Periodic Inputs", JOURNAL="Applied Probability Trust", VOLUME=26, PAGES="381-189", YEAR=1989, REFERENCES=14, KEYWORDS="Point process; Stability; Asymptotic Periodicity; Limit", } @ARTICLE{Cham89:Encoding, AUTHOR="C. Chamzas and D. L. Duttweiler", TITLE="Encoding Facsimile Images for Packet-Switching Network", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=5, PAGES="857-864", YEAR=1989, REFERENCES=11, KEYWORDS="Video coding; packet switching", } @ARTICLE{Chen89:Study, AUTHOR="Jinghu Chen and R. Guérin", TITLE="Performance Study of an Integrated Packet Switch with Two Priority Classes", JOURNAL="Informatik Fachberichte", VOLUME=205, PAGES="400-414", YEAR=1989, REFERENCES=5, KEYWORDS="Packet Switching; Priority; Analysis", } @ARTICLE{Clar89:Transputer, AUTHOR="R. T. Clarke and S. J. Nichols and P. Mars", TITLE="Transputer-based simulation tool for performance evaluation of wide area telecommunication networks", JOURNAL="Microprocessors and Microsystems", VOLUME=13, NUMBER=3, PAGES="173-178", YEAR=1989, REFERENCES=8, KEYWORDS="Transputer; communication network; performance evaluation", } @ARTICLE{Cmel89:Experience, AUTHOR="R. F. Cmelik and N. Gehani and W. D. Roome", TITLE="Experience with Multiple Processor Versions of Concurrent C", JOURNAL=ieeese, VOLUME="SE-15", NUMBER=3, PAGES="335-344", YEAR=1989, REFERENCES=11, KEYWORDS="Software Engineering; C programming language; LAN; computer", ANNOTE="Concurrent C is a superset of C that provides parallel programming facilities. Concurrent C was designed for effective utilization of multiprocessors and multicomputers. The experience with implementing and using Concurrent C are discussed in this paper.", } @ARTICLE{Coac89:Integrated, AUTHOR="R. Coackley and H. L. Steadman", TITLE="An Integrated Voice and Data Network Based on Virtual Circuits", JOURNAL="Hewlett-Packard Journal", VOLUME="feb", PAGES="42-49", YEAR=1989, REFERENCES=3, KEYWORDS="Voice/data integration; LAN; WAN; MAN; throughput; virtual", ANNOTE="Developed as an HP Laboratories research project, this network offers true integration of voice and data, a single architecture for local and wide area networks, high throughput, low host overhead, very good cost/performance ratio, and effective interfacing to existing standards.", } @ARTICLE{Darr89:Fixed, AUTHOR="J. C. Darragh and Richard L. Baker", TITLE="Fixed Distortion Subband Coding of Images for packet-switched networks", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=5, PAGES="789-800", YEAR=1989, REFERENCES=38, KEYWORDS="Video coding; packet switching; packet video", } @ARTICLE{Dsha89:Multichannel, AUTHOR="J. Dshalalow", TITLE="Multichannel Queueing Systems with Infinite Waiting Room and Stochastic Control", JOURNAL="Applied Probability Trust", VOLUME=26, PAGES="345-362", YEAR=1989, REFERENCES=12, KEYWORDS="Controlled input; controlled service; queueing discipline", } @ARTICLE{Fend89:Measurements, AUTHOR="K. W. Fendick and W. Whitt", TITLE="Measurements and Approximations to Describe the Offered Traffic and Predict the Average Workload in a Single-Server Queue", JOURNAL=ieeeproc, VOLUME=77, PAGES="171-194", YEAR=1989, KEYWORDS="single server; IDW; index of dispersion for work; $GI/G/1$", } @ARTICLE{Font89:Software, AUTHOR="M. L. Fontenot", TITLE="Software Congestion, Mobile Servers, and the Hyperbolic Model", JOURNAL=ieeese, VOLUME="SE-15", NUMBER=8, PAGES="947-962", YEAR=1989, REFERENCES=18, KEYWORDS="Approximation; mobile server; performance evaluation", ANNOTE={The phenomenon of software congestion is examined. The term refers to situations in which the performance bottleneck of a system is some element of software, rather than some hardware device. A notational scheme is introduced for describing those systems in which software congestion may be important ("mobile servers representation", MSR). An approximate analytical model (hyperbolicm.) is developed for anyalyzing systems with software congestion}, } @TECHREPORT{Fuhr89:Packet, AUTHOR="S. W. Fuhrmann", TITLE="Performance of a Packet Switch with Crossbar Architecture", INSTITUTION="IBM Research Division", ADDRESS="Zürich, Switzerland", PAGES=20, YEAR=1989, REFERENCES=14, KEYWORDS="Packet switching; crossbar; switching network", } @ARTICLE{Good89:Packet, AUTHOR="David J. Goodman and R. A. Valenzuela and K. T. Gayliard and B. Ramamoorthi", TITLE="Packet Reservation Multiple Access for Local Wireless Communications", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=8, PAGES="885-890", YEAR=1989, LANGUAGE="Englisch", REFERENCES=19, KEYWORDS="Multiple Access; packet switching; simulation; star; ALOHA", ANNOTE="Packet reservation multiple access (PRMA) allows a variety of information sources to share the same wireless access channel. Computer simulations and a listening test reveal that PRMA achieves a promising combination of vopice quality and bandwidth efficiency.", } @INPROCEEDINGS{Hubi89:Techniken, AUTHOR="W. Hubig and D. Weber", TITLE="Techniken zur Leistungsanalyse von Kommunikationssystemen", BOOKTITLE="5. GI/ITG-Fachtagung; Informatik Fachberichte 218", ISBN="3-540-51713-8", ADDRESS="Braunschweig, Germany", PAGES="255-257", YEAR=1989, LANGUAGE="German", KEYWORDS="Performance evaluation; communication system; simulation", } @ARTICLE{Ibe89:Approximate, AUTHOR="Oliver C. Ibe and X. Cheng", TITLE="Approximate Analysis of Asymmetric Single-Service Token-Passing Systems", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=6, PAGES="572-577", YEAR=1989, REFERENCES=20, KEYWORDS="LAN; polling; asymmetric load; approximation; token system", ANNOTE="We consider token-passing or polling systems in which the message arrival process, the message transmission time distribution, and the walk time vary from one station to another. An approximate analysis of these systems is obtained. The results are compared against both simulation results and those obtained from two approximate methods that have been proposed earlier.", } @ARTICLE{Karl89:Cellular, AUTHOR="J. Karlsson and B. Eklundh", TITLE="A Cellular Mobile Telephone System with Load Sharing - An Enhancement of Directed Retry", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=5, PAGES="530-535", YEAR=1989, REFERENCES=8, KEYWORDS="Mobile radio; MAT; load sharing; blocking; traffic source", ANNOTE="A load sharing facility, which enables subscribers in a mobile telephone system to look for free channels in more than one cell, is investigated with respect to blocking probability and channel utilization. Results show that a substantial improvement, compared to other channel effects are especially dramatic for an asymmetric traffic situation.", } @INPROCEEDINGS{Kill89:Einige, AUTHOR="Ulrich Killat", TITLE="Einige Anmerkungen zu Begriffen und Konzepten der {ATM-Technik}", BOOKTITLE="ITG/GI-Fachtagung Kommunikation in verteilten Systemen", ADDRESS="Stuttgart, Germany", PAGES="1-13", YEAR=1989, LANGUAGE="German", REFERENCES=10, KEYWORDS="ATM", } @INPROCEEDINGS{Kook89:Mean, AUTHOR="K. Kook and R. Serfozo", TITLE="Mean Passage Times in Queueing Networks", BOOKTITLE="5. GI/ITG-Fachtagung Messung Modellierung und", ISBN="0-387-51713-8", ADDRESS="Braunschweig, Germany", PAGES="1-15", YEAR=1989, REFERENCES=17, KEYWORDS="Queueing Network; routing algorithm; performance", ANNOTE="Major performance measures of a queueing network are the mean time a unit spends in a sector of the network and the mean time for a unit to move from one sector to another. We give expressions for these and other mean passage times on routes in Jackson queueing networks and in more general queueing networks with congestion-dependent processing and routing. In these networks, the units may overtake one another as they move.", } @ARTICLE{Koop89:Verkehrslenkungsverfahren, AUTHOR="W. Koops", TITLE="Verkehrslenkungsverfahren in leitungsvermittelten Netzen - Einführung und Übersicht", JOURNAL=fernmelde, VOLUME=43, NUMBER=5, PAGES="1-27", YEAR=1989, LANGUAGE="German", REFERENCES=18, KEYWORDS="Flow control; routing algorithm; network; model; blocking", ANNOTE="This article describes how overload situations can be caused and how they can be remedied by means of flow control and routing measures to be applied for call requests and seizures. The routing methods are treated with the example of simple network models, taking into account of end-to-end-blocking. Essential strategies for traffic protection are presented.", } @ARTICLE{Kosi89:Packetized, AUTHOR="R. Kositpaiboon", TITLE="Packetized radiographic image transfer over local area networks for diagnosis and conferencing", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=5, PAGES="842-856", YEAR=1989, REFERENCES=32, KEYWORDS="Packet Switching; LAN; Multimedia; CSMA/CD; Image Transfer", } @ARTICLE{Lemo89:Waiting, AUTHOR="A. J. Lemoine", TITLE="Waiting Time and Workload in Queues", JOURNAL=aap, VOLUME=26, PAGES="390-397", YEAR=1989, REFERENCES=12, KEYWORDS="Single server; Moment", } @ARTICLE{Liao89:Approximate, AUTHOR="K. Liao and L. G. Mason", TITLE="An Approximate Performance Model for a Multislot Integrated Services System", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=3, PAGES="211-221", YEAR=1989, REFERENCES=12, KEYWORDS="Network optimization; ISDN; queueing system; model", ANNOTE="An approximate model (with finite or infinite waiting room) for an ISDN-system is presented with 3 types of traffic: a first offered narrow-band traffic, an overflow narrow-band traffic and a a wide-band traffic. The model provides a very good approx. for the system performance, that is the blocking prob. of the 2 narrow-band traffics, the loss prob.(finite waiting room), the probability of nonwaiting and the average waiting time of wide-band traffic.", } @ARTICLE{Liu89:Time, AUTHOR="Minkui Liu and D. G. Messerschmidt and D. A. Hodges", TITLE="Time Slot Switching for Integrated Services in Fiber Optic {PBX/LAN}", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=7, PAGES="685-693", YEAR=1989, REFERENCES=22, KEYWORDS="Access protocol; TSS protocol; LAN; fiber optics", ANNOTE="A new medium access protocoll called time slot switching (TSS) is proposed for use in optical fiver local area networks. This protocol incorporates features of time division, space division, and time compression for users to share a common medium. Operational principles of TSS are explained. A performance analysis is presented to show the tradeoffs among traffic capacity, frame guard time, blocking prob., and transmission delay.", } @ARTICLE{Mill89:Error, AUTHOR="M. J. Miller", TITLE="Error Control Techniques for Integrated Services Packet Networks", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=5, PAGES="690-697", YEAR=1989, REFERENCES=9, KEYWORDS="Packet switching; error control; performance evaluation", } @ARTICLE{Myle89:DQDB, AUTHOR="A. Myles", TITLE="{DQDB} simulations and {MAC} protocol analysis", JOURNAL=elet, VOLUME=25, NUMBER=9, PAGES="616-618", YEAR=1989, REFERENCES=2, KEYWORDS="Data Transmission; communication network; Queueing Theory", } @ARTICLE{Pang89:Throughput, AUTHOR="Joseph Pang and F. A. Tobagi", TITLE="Throughput Analysis of a Timer Controlled Token Passing Protocol Under Heavy Load", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=7, PAGES="694-702", YEAR=1989, REFERENCES=14, KEYWORDS="LAN; token bus; token ring; protocol; IEEE 802.4", ANNOTE="An analysis of the throughput performance of token passing protocols are presented under a heavy load assumption. These protocols employ a cycle-dependent timing mechanism to control staiton access to the channel. The analysis yields the amount of bandwidth allocated to each class of traffic as a function of the timing parameters, thus clearly revealing the priority features of the cycle-dependent timing mechanism.", } @ARTICLE{Pern89:Video, AUTHOR="P. Pernsteiner and F. Brendel", TITLE="Video- und Datenkommunikation im {VBN}", JOURNAL=ntz, VOLUME=42, NUMBER=8, PAGES="486-493", YEAR=1989, LANGUAGE="German", KEYWORDS="Data communication; communication network; fiber optics", } @MISC{Rame89:Element, AUTHOR="L. Ramel", TITLE="Element de circuit-point de croisement entre deux lignes", ADDRESS="Paris, France", PAGES=15, NOTE="European Patent Application 89201057.0", YEAR=1989, LANGUAGE="French", KEYWORDS="ATM; bus", ANNOTE="Teilweise Übersetzung ins Deutsche vorhanden.", } @ARTICLE{Ross89:Stochastic, AUTHOR="Keith W. Ross and D. Tsang", TITLE="The stochastic Knapsack problem", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=7, PAGES="740-747", YEAR=1989, REFERENCES=18, KEYWORDS="Knapsack; modeling; circuit switching; traffic model", ANNOTE="The stochastic knapsack model is motivated by the problem of accepting and blocking calls to a circuit-switched telecommunication system which supprots a variety of traffic types. By modeling the communication channel as the knapsack, the traffic types as the object classes, and the bandwidth requirements as the objectvolumes, the problem of optimally accepting calls in order to maximize average revenue is equiv. to the stoch. knapsack problem.", } @ARTICLE{Sabn89:Algorithmic, AUTHOR="K. Sabnani and A. M. Lapone and M. Ü. Uyar", TITLE="An Algorithmic Procedure for Checking Safety Properties of Protocols", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=9, PAGES="940-948", YEAR=1989, REFERENCES=28, KEYWORDS="Protocol; Safety property; FSM; Finite State Machine; Q.931", ANNOTE="This paper presents a procedure for checking safety properties o communication protocols. A protocol is specified as a collection of communicating finite state machines (FSM's). The first algorithm does incremental composition and reduction fo FSM's. The second algorithm checks whether the behaviour of one FSM is a subset of another FSM's behaviour. This procedure has been applied to the ISDN Q.931 protocol and to the Alternating Bit Protocol.", } @MISC{Senn89:Switching, AUTHOR="R. T. Sennema", TITLE="Switching system for switching packet orientated data as well as circuit orientated data", ADDRESS="Eindhoven, Holland", PAGES=5, NOTE="European Patent Application 89201424.2", YEAR=1989, KEYWORDS="Switching system; packet switching; circuit switching; ATM", ANNOTE="Two separate switching systems, a first one for switching packetorientated data and a second one for switching circuit orientated data as known from the state of the art can, according to the invention and with regard to their function, be integrated into a single switching system. This is realised by storing the packet orientated data in a first section of a switch memory and the circuit orientated data in a second section of this memory", } @ARTICLE{Shim89:Packet, AUTHOR="H. Shimizu and M. Mera and H. Tani", TITLE="Packet Communication Protocol for Image Services on a High-Speed Multimedia {LAN}", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=5, PAGES="782-788", YEAR=1989, REFERENCES=13, KEYWORDS="HSLAN; Protocol; Multimedia", } @ARTICLE{Stas89:Optimal, AUTHOR="G. I. Stassinopoulos and H. Koukoutos", TITLE="Optimal Dynamic Routing in Double Ring Networks", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=8, PAGES="890-896", YEAR=1989, REFERENCES=11, KEYWORDS="Routing algorithm; dynamic routing; ring network; protocol", ANNOTE="The dynamic routing problem with multiple destinations on ring networks is considered. An infinite algorithm exhibiting only polynomial complexity in the number of network nodes at eahc iteration is presented. Implementation issues are discussed, in particular a routing protocol exhibiting features known in local area networks.", } @ARTICLE{Taka89:Mean, AUTHOR="Yutaka Takahashi", TITLE="Mean-Delay approximation for a single-server priority queue with batch arrivals of two classes", JOURNAL=ieice, VOLUME=72, NUMBER=1, PAGES="29-36", YEAR=1989, REFERENCES=24, KEYWORDS="Delay model; single server; batch arrival; priority", } @ARTICLE{Todd89:Compatible, AUTHOR="T. D. Todd and P. Lopinski", TITLE="A compatible fixed-frame {ISDN} gateway for broadband metropolitan area networks", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=5, PAGES="680-689", YEAR=1989, REFERENCES=12, KEYWORDS="MAN; ISDN; gateway; performance evaluation", } @ARTICLE{Wong89:Integrated, AUTHOR="P. C. Wong and Takshing P. Yum", TITLE="An integrated services token-controlled Ring Network", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=5, PAGES="670-679", YEAR=1989, REFERENCES=37, KEYWORDS="Token Ring; Integrated Network; Protocol; performance", } @ARTICLE{Wood89:Effect, AUTHOR="C. M. Woodside and J. R. Montealegre", TITLE="The Effect of Buffering Strategies on Protocol Execution Performance", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=6, PAGES="545-554", YEAR=1989, REFERENCES=13, KEYWORDS="Protocol; performance evaluation; buffer management; LAN", ANNOTE="The execution workload of a protocol often limits the data communications throughput in local area and wide area networks. The handling of buffers is one of the implementation factors which affects the execution workload of a protocol implementation: if possible, copying of user data should be avoided. Two ``buffer cut-through'' strategies for avoiding copying higher level data are described. The resulting execution workload is studied in detail.", } @ARTICLE{Yang89:Efficient, AUTHOR="C.-L. Yang and P. Kubat", TITLE="Efficient Computation of Most Probable States for Communication Networks with Multimode Components", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=5, PAGES="535-538", YEAR=1989, REFERENCES=7, KEYWORDS="Multimode model; communication network; performability", ANNOTE="A general multimode model for jointly assessing the performance and reliability (performability) of a communication network is considered. The performability is computed by averaging the performance over the most probable network states. An efficient algorithm, superior to all previous algorithms in both speed and flexibility, is proposed to enumerate the most probable network states.", } @ARTICLE{Abra89:Direct, AUTHOR="Santosh Abraham and K. Padmanabhan", TITLE="Performance of the Direct Binary n-Cube Network for Multiprocessors", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=7, PAGES="1000-1011", YEAR=1989, KEYWORDS="Parallel computing; hypercube; packet switching; hot spot", ANNOTE="A mathematical model for predicting the performance of the dire ct binary n-cube interconnection scheme is presented. These predictions are checked against simulations of a comparable system. The results for the network are compared to known results for indirect interconnection schemes like the crossbar and indirect n-cube networks.", } @ARTICLE{Bhuy89:Approximate, AUTHOR="L. Bhuyan and D. Ghosal and Q. Yang", TITLE="Approximate Analysis of Single and Multiple Ring Networks", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=7, PAGES="1027-1040", YEAR=1989, KEYWORDS="Packet switching; ring network; performance evaluation", ANNOTE="Asynchronous packet-swiched interconnection networks with decentralized control are very appropriate for multiprocessing and data flow architectures. This paper presents performance models of single and multiple ring networks based on token ring, slotted ring, and register insertion ring protocols. The multiple ring networks have the advantages of being reliable, axpandable, and cost effective.", } @ARTICLE{Choi89:Acknowledgment, AUTHOR="J. D. Choi and Chong Kwan Un", TITLE="On Acknowledgment Schemes of Sliding Window Flow Control", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=11, PAGES="1184-1191", YEAR=1989, KEYWORDS="Protocol; packet switching; flow control", ANNOTE="We investigate two acknowledgment schemes of sliding window flowcontrol in packet communication. Those are the delayed acknowledgment scheme and the window acknowledgment scheme. It is shown that acknowledgment scheme of the link layer of X.25 protocol can be modeled by the D-ACK scheme and that of the packet layer by the W-ACK scheme. The efficiencies of these aknowledgment schemes are shown by the mean number of aknowledgment control.", } @ARTICLE{Du8903:Heuristic, AUTHOR="Dong-Hui Du and Lishing Liu", TITLE="Heuristic Algorithms for Single Row Routing", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=3, PAGES="312-320", YEAR=1989, KEYWORDS="Routing algorithm; heuristics; algorithm", ANNOTE="A heuristic algorithm, based on the criterion of having nets with larger cut numbers assigned to inner tracks and nets with smaller cut numbers assigned to outer tracks, for single row routing problem has recently been proposed by Tarandom number generation et al. It has been reported that this algorithm has always been able to produce the optimal solutions for all the examples tested so far.", } @ARTICLE{Kama89:Star, AUTHOR="A. E. Kamal", TITLE="Star Local Area Networks: A Performance Study", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=4, PAGES="483-499", YEAR=1989, KEYWORDS="LAN; transfer delay; performance evaluation; simulation", ANNOTE="In this paper we study local area networks based on the star to pology. We consider different access protokols used for communication over star networks. The study is concerned with network performance. We present models for the analysis of existing star network protocols. We also propose a new access protocol for star networks. The protocol has a performance that is very closeto perfect schedulingt.", } @ARTICLE{Kuma89:Adaptive, AUTHOR="A. Kumar", TITLE="Adaptive Load Control of the Central Processor in a Distributed System with a Star Topology", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=11, PAGES="1502-1512", YEAR=1989, KEYWORDS="Distributed system; flow control; queueing network", ANNOTE="We present adaptive control techniques for controlling the flow of real-time jobs from the peripheral processors to the central processor of a distributed system with a star topology. We consider two classes of flow control mechanism: 1) proportional control, 2) threshold control. The problem is to obtain good algorithms for dynamically adjusting the control level at each PP in order to prevent overload of the CP.", } @ARTICLE{Limb89:Load, AUTHOR="J. O. Limb", TITLE="Load-Controlled Scheduling of Traffic on High-Speed Metropolitan Area Networks", JOURNAL=ieeetc, VOLUME="COM-37", NUMBER=11, PAGES="1144-1150", YEAR=1989, KEYWORDS="MAN; routing algorithm; load dependent routing", ANNOTE="An access protocol is described that is particulary appropriate for high-speed local and metropolitan area networks. It serves two functions, first to permit efficient use of the shared transmission medium, in particular where the electrical length of the medium may be many times the duration of an average packet and second to share the medium in an almost arbitrary manner between a number of competing traffic types or user classes.", } @ARTICLE{Lin89:Conflict, AUTHOR="W. Lin and T.-L. Sheu and Ch. Das and T. Feng and Chengke Wu", TITLE="A Conflict-Free Routing Scheme on Multistage Interconnection Networks", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=8, PAGES="1086-1097", YEAR=1989, KEYWORDS="Switching system; multistage interconnection network", ANNOTE="In this paper, we present a conflict-free routing scheme for a class of parallel and distributed computing systems. The core of the proposed routing scheme is a quadtree communication structure. The quadtree structure suggests a general approach to mapping a class of parallel algorithmus with intensive communicationrequirements for selecting data from many different sources and distributing data from a single source.", } @ARTICLE{Mirc89:Effect, AUTHOR="R. Mirchandaney and Donald F. Towsley and John Stankovic", TITLE="Analysis of the Effect of Delays on Load Sharing", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=11, PAGES="1513-1525", YEAR=1989, KEYWORDS="Multiprocessor system; scheduling; load sharing; Matrix", ANNOTE="In this paper, we study the performance characteristics of simp le load sharing algorithms for distributed systems. In the systemunder consideration, it is assumed that nonnegligible delays areencountered in transferring tasks from one node to another and in gathering remote state information. Because of these delays, the state information gathered by the load sharing algorithms isout of date by the time the load sharing decisions are taken.", } @ARTICLE{Peng89:Modeling, AUTHOR="Dartzen Peng and Kang G. Shin", TITLE="Modeling of Concurrent Task Execution in a Distributed System for Real - Time Control", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=4, PAGES="500-516", YEAR=1989, KEYWORDS="Distributed system; Markov chain; first passage time", ABSTRACT="In a distributed system that implements real-time control, computational tasks are distributed over different nodes for execut ion to improve response time and system reliability. To model system behavior, tasks in each node are first decomposed into ``activities''. The activities and precedence constraints among them are then modeled by a generalized stochastic Petri net. Finally, a sequence of homogeneous continuous-time Markov chains is built", } @BOOK{Preu89:Computer, AUTHOR="L. Preuß and H. Musa", TITLE="Computer - Schnittstellen", PUBLISHER="Carl Hanser", ADDRESS="München, Germany", YEAR=1989, LANGUAGE="German", KEYWORDS="interface; V.24; IEC bus", ANNOTE="Die Centronics Schnittstelle; Die V.24 Schnittstelle; Die IEC-BUS Schnittstelle; Programmierung des IEC-BUS; IEC-BUS Erweiterungen", } @ARTICLE{Tsai89:Adaptive, AUTHOR="W. T. Tsai and C. V. Ramamoorthy and Wei K. Tsai and O. Nishiguchi", TITLE="An Adaptive Hierarchical Routing Protocol", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=8, PAGES="1059-1075", YEAR=1989, KEYWORDS="Computer network; hierarchical network; hierarchical", ANNOTE="This paper proposes an adaptive hierarchical routing protocol based on the extension of the new Arpanet acheme and presents its performance by simulation. Our objective is to design efficient and adaptive routing protocols for large and dynamic computer networks. The proposed protocol can adapt to rapidly changing environments and works for arbitrarily large networks.", } @TECHREPORT{Krie89:Computational, AUTHOR="U. R. Krieger", TITLE="Computational Methods for Markovian Queueing Models - A", INSTITUTION="Research Institute of the Deutsche Bundespost", ADDRESS="Darmstadt, Germany", PAGES=42, YEAR=1989, REFERENCES=103, KEYWORDS="Markov chain; steady state probability distribution", ANNOTE="A summary of computational methods for the calculation of the stationary distribution of a homogeneous discrete or continuous-time MArkov chain with finite state space is presented. We discuss some direct and iterative methods recommended in the literature within a unified methematical framework based on the theory of nonnegativ matrices and M-matrices and provide anh up-to-datesurvey of the field.", } @ARTICLE{Poll89:Discrete, AUTHOR="L. F. Pollacia", TITLE="A survey of discrete event simulation and state-of-the-art discrete event languages", JOURNAL=sigsim, VOLUME=20, NUMBER=3, PAGES="8-25", YEAR=1989, REFERENCES=78, KEYWORDS="Discrete event simulation; survey; animation", ANNOTE="This paper provides an introduction to the main concepts of discrete event simulation and surveys the field of current discrte event simulation techniques.", } @BOOK{Ambr89:Intelligent, AUTHOR="W. Ambrosch and A. Maher and B. Sasscer", TITLE="The Intelligent Network : a joint study by Bell Atlantic, {IBM} and Siemens", ISBN="3-540-50897-X", PUBLISHER="Springer-Verlag", ADDRESS="Berlin, Germany", PAGES="1-294", YEAR=1989, KEYWORDS="Communication network; network architecture; service", ANNOTE="1. The Intelligent Network 2. Functional Characteristics Common to Selected IN Services 3. Network and Service Management 4. Network Components 5. Green Number Service 6. GNS Application Description 7. Alternate Billing Service", } @INPROCEEDINGS{Karo89:Growable, AUTHOR="Mark Karol and I. Chin-Lin", TITLE="Performance Analysis of a Growable Architecture for Broadband Packet {(ATM)} Switching", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=2, PAGES="1173-1180 (32.4)", YEAR=1989, REFERENCES=9, KEYWORDS="ATM; loss probability; architecture; analysis", ABSTRACT="A growable architecture for broadband packet (ATM) switching consisting of a memoryless, self-routing interconnect fabric and modest-size packet switch modules, was recently proposed by Eng, Krol, and Yeh. we examine the performance of this architecture. We focus on the cell loss probability, because the architecture attains the best possible delay-throughput performance if the packet switch modules use output queueing.", } @BOOK{Kell89:Loss, AUTHOR="F. P. Kelly", TITLE="Loss networks", PUBLISHER="University of Cambridge", ADDRESS="Cambridge, England", PAGES=67, YEAR=1989, REFERENCES=78, KEYWORDS="Erlang B formula; blocking; phase-type model; network flow", ANNOTE="The paper describes work on the stochastic modelling of loss networks with application to telephone engineers. The paper provides an introduction to the area and a review of the recent work.", } @INPROCEEDINGS{Alon89:Use, AUTHOR="P. L. C. Alonso and F. J. H. Gßlvez and A. A. Herßn", TITLE="On the use of priorities in {ATM} switching structures", BOOKTITLE="IEEE international conference on communication BOSTONIC", ADDRESS="Boston, Massachusetts", VOLUME=2, PAGES="718-721", YEAR=1989, REFERENCES=3, KEYWORDS="ATM; Priority; performance evaluation", } @INPROCEEDINGS{Broc89:Voice, AUTHOR="Frank M. Brochin and J. B. Thomas", TITLE="Voice/Data Transmission in Packet Form: a Study of Delay Performances", BOOKTITLE="IEEE Pacific Rim Conference on Communication, Computers", PAGES="218-221", YEAR=1989, REFERENCES=19, KEYWORDS="Voice/Data Integration; Statistical Multiplexer; Delay Time", } @ARTICLE{Dadu89:Mean, AUTHOR="H. Daduna", TITLE="Mean value analysis for the duration of heavy traffic periods in subnetworks of a queueing network", JOURNAL="Informatik-Fachberichte", VOLUME=214, PAGES="16-28", YEAR=1989, KEYWORDS="Queueing Network; Heavy Load; Analysis", } @ARTICLE{Deri89:Discrete, AUTHOR="H. Derin and Patrick Kelly", TITLE="Discrete-Index Markov-Type Random Process", JOURNAL=ieeeproc, VOLUME=77, NUMBER=10, PAGES="1485-1510", YEAR=1989, REFERENCES=49, KEYWORDS="Random Process; Markov; Analysis", } @INPROCEEDINGS{Earn89:Inplementation, AUTHOR="R. W. Earnshaw and A. Titchmarsh and P. Mars", TITLE="Design and inplementation of a packet-switched network simulator", BOOKTITLE="6th United Kingdom Teletraffic Symposium", PAGES="5/1-5", YEAR=1989, REFERENCES=2, KEYWORDS="Packet switching; Design; Simulation; Implementation", } @INPROCEEDINGS{Good89:Factors, AUTHOR="David J. Goodman", TITLE="Factors affecting the bandwidth efficiency of packet reservation multiple access", BOOKTITLE="39th IEEE vehicular technology conference", VOLUME=1, PAGES="292-299", YEAR=1989, REFERENCES=6, KEYWORDS="PRMA; packet reservation multiple access; packet radio", } @ARTICLE{Kric89:Diffusion, AUTHOR="E. V. Krichagina", TITLE="Diffusion approximation for a queue in a multiserver system with multistage service", JOURNAL=arc, VOLUME=50, NUMBER="3Pt1", PAGES="346-354", YEAR=1989, KEYWORDS="Multiserver; queueing discipline; diffusion approximation", } @ARTICLE{List89:Switching, AUTHOR="M. Listanti and A. Roveri", TITLE="Switching structures for {ATM}", JOURNAL=comcom, VOLUME=12, NUMBER=6, PAGES="349-358", YEAR=1989, REFERENCES=23, KEYWORDS="ATM; switching type; performance evaluation; architecture", } @ARTICLE{Nete89:Estimating, AUTHOR="V. A. Netes", TITLE="Estimating the probable loss of demand in queueing systems of limited capacity", JOURNAL="Soviet Journal of computer and system sciences", VOLUME=26, NUMBER=6, PAGES="161-163", YEAR=1989, REFERENCES=2, KEYWORDS="Queueing System; finite queue; loss probability; estimation", } @INPROCEEDINGS{Seit89:Standards, AUTHOR="N. B. Seitz", TITLE="Performance standards for packet switched services", BOOKTITLE=icc, ADDRESS="Boston, Massachusetts", VOLUME=1, PAGES="63-70", YEAR=1989, REFERENCES=18, KEYWORDS="Packet switching; performance parameter; standard", } @ARTICLE{Shul89:Generalization, AUTHOR="Y. N. Shul'ga", TITLE="Generalization of the Pollaczek-Khinchin formula for spatial stochastic networks", JOURNAL=arc, VOLUME=50, NUMBER="3Pt.1", PAGES="355-365", YEAR=1989, REFERENCES=12, KEYWORDS="Waiting time; analysis; stochastic theory; Little's", } @ARTICLE{Step89:Solution, AUTHOR="S. N. Stepanov", TITLE="Solution of Simultaneous large-scale equilibrium equations", JOURNAL=arc, VOLUME=50, NUMBER=5, PAGES="647-655", YEAR=1989, REFERENCES=5, KEYWORDS="Equilibrium distribution; queueing theory", } @ARTICLE{Whit89:Planning, AUTHOR="W. Whitt", TITLE="Planning queueing simulation", JOURNAL=ms, VOLUME=35, NUMBER=11, PAGES="1341-1366", YEAR=1989, REFERENCES=76, KEYWORDS="Simulation; queueing system; planning", } @ARTICLE{Zeif89:Properties, AUTHOR="A. I. Zeifman", TITLE="Properties of a system with losses in the case of variable rates", JOURNAL=arc, VOLUME=50, NUMBER="1Pt.2", PAGES="82-87", YEAR=1989, REFERENCES=6, KEYWORDS="Loss system; variable rate; analysis", } @ARTICLE{Beli89:CCITT, AUTHOR="F. Belina and D. Hogrefe", TITLE="The {CCITT-Specification} and Description Language {SDL}", JOURNAL=cnis, VOLUME=16, NUMBER=4, PAGES="311-341", YEAR=1989, REFERENCES=9, KEYWORDS="SDL; CCITT; specification language; OSI; protocol; design", ANNOTE="This paper briefly explains the basic concepts of the latest version of the language, known as SDL88, as it has been recommended by CCITT in 1987.", } @ARTICLE{Bux89:Token, AUTHOR="W. Bux", TITLE="Token-Ring Local-Area Networks and Their Performance", JOURNAL=ieeeproc, VOLUME=77, PAGES="238-256", YEAR=1989, REFERENCES=99, KEYWORDS="Token ring; LAN; performance evaluation; technology; FDDI", ANNOTE="The paper first examines the major technical concepts underlying the token-ring technology and then focusses on performance issues arising in the design of such LANs. Three topics are discussed in detail: 1) the Token Ring and its performance, 2) the ANSI Fiber Distributed Data Interface (FDDI) Token Ring and its performance, and 3) architecture and performance issues arising in the interconnection of tokenring networks.", } @ARTICLE{Chen89:Reservation, AUTHOR="Jinghu Chen and V. Li", TITLE="Reservation {CSMA/CD:} A Multiple Access Protocol for {LAN's}", JOURNAL="IEEE", VOLUME=7, NUMBER=2, PAGES="202-210", YEAR=1989, REFERENCES=9, KEYWORDS="LAN; CSMA/CD; multiple access; collision free; performance", ANNOTE="This paper describes a multiple access protocol for local area networks. Performance models are developed for our proposed protocol and for the Ethernet protocol. It is found that our protocol gives better performance under a wide range of scenarios.", } @INPROCEEDINGS{Davi89:DQDB, AUTHOR="P. Davids and T. Welzel", TITLE="Performance Analysis of {DQDB} Based on Simulation", BOOKTITLE="3rd IEEE Workshop on MAN", PAGES="1-15", YEAR=1989, REFERENCES=14, KEYWORDS="DQDB; MAN; asynchronous method; performance evaluation", ANNOTE="A backbone environment with LANs interconnected via a DQDB subnetwork is considered. Asynchronous traffic model is assumed and the performance of DQDB is studied by simulation with respect to packet delays and fairness issues.", } @ARTICLE{Glas89:Token, AUTHOR="B. Glass", TITLE="The Token Ring", JOURNAL=byte, VOLUME=1, PAGES="363-376", YEAR=1989, REFERENCES=4, KEYWORDS="token ring; overview; ISO reference model", ANNOTE="The article gives an introduction to the token ring released in 1985 by IBM. It describes the functions of the Physical Layer, the MAC Sublayer, the active monitor, the matter of priority, and bridges and backbones.", } @ARTICLE{Kama89:Approximate, AUTHOR="A. E. Kamal and C. Hamacher", TITLE="Approximate Analysis of Non-exhaustive Multiserver Polling Systems with Applications to Local Area Networks", JOURNAL=cnis, VOLUME=17, NUMBER=1, PAGES="15-27", YEAR=1989, REFERENCES=28, KEYWORDS="LAN; performance evaluation; slotted ring; polling", ANNOTE="We consider symmetric multiqueue polling systems served by a number of identical servers. The service is of the limiting non-exhausting type. We obtain an interactive approximate solution to the mean waiting time for symmetric systems.", } @BOOK{Leff89:Implementation, AUTHOR="Samuel J. Leffler and Kirk M. McKusick and Mike Karels and J. S. Quarterman", TITLE="The Design and Implementation of the {4.3BSD} {UNIX} Operating System", PUBLISHER="Addison-Wesley Publishing Company", ADDRESS="Massachusetts", YEAR=1989, ANNOTE="Includes a chapter on the BSD networking interface.", } @BOOK{Stol89:Cuckoo, AUTHOR="C. Stoll", TITLE="The Cuckoo's Egg", ISBN="0-385-24946-2", PUBLISHER="Doubleday", ADDRESS="New York", YEAR=1989, } @BOOK{Huhn89:Distributed, AUTHOR="Michael Huhns and Les Gasser", TITLE="Distributed artificial intelligence", PUBLISHER="Pitman Publishing", ADDRESS="London, England", VOLUME=2, YEAR=1989, } @BOOK{Blac89:Data, AUTHOR="U. Black", TITLE="Data Networks: Concepts, Theory and Practice", PUBLISHER="Prentice Hall", YEAR=1989, } @ARTICLE{Shim89:Process, AUTHOR="Shinji Shimojo and Hideo Mihahara", TITLE="Process Assignment in Distributed Systems", JOURNAL="Systems and Computers in Japan", VOLUME=20, NUMBER=6, PAGES="80-90", YEAR=1989, KEYWORDS="Distributed Systems", } @BOOK{Helm89:Data, AUTHOR="Scott A. Helmers", TITLE="Data Communications: A Beginner's Guide to Concepts and Technology", PUBLISHER="Prentice-Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1989, } @BOOK{Eijk89:Formal, AUTHOR="Peter van Eijk and C. A. Vissers and M. Diaz", TITLE="The Formal Description Technique {LOTOS:} Results of the {ESPRIT/SEDOS} Project", PUBLISHER="North-Holland", ADDRESS="New York", YEAR=1989, } @BOOK{Mala89:DEC, AUTHOR="Carl Malamud", TITLE="{DEC} networks and architectures", PUBLISHER="Intertext Pubs./McGraw-Hill", ADDRESS="New York", YEAR=1989, } @BOOK{Fort89:Handbook, AUTHOR="Paul Fortier", TITLE="Handbook of {LAN} Technology", PUBLISHER="McGraw-Hill", ADDRESS="New York, New York", YEAR=1989, } @ARTICLE{Beas89:Algorithm, AUTHOR="J. E. Beasley and N. Christofides", TITLE="An Algorithm for the Resource Constrained Shortest Path Problem", JOURNAL=networks, VOLUME=19, NUMBER=4, PAGES="379-394", YEAR=1989, KEYWORDS="Routing", } @TECHREPORT{Rahm89:Distributed, AUTHOR="E. Rahm and A. Thomasian", TITLE="Distributed Optimistic Concurrency Control for High Performance Transaction Processing", TYPE="Technical Report", INSTITUTION="Department of Computer Science, University of Kaiserslautern, West Germany", NOTE="Report can be ordered from: Dr. Erhard Rahm, Dept. of Computer Science, University Kaiserslautern, P.O. Box 3049, D-6750 Kaiserslautern, West Germany, (rahm@uklirb.uucp)]", YEAR=1989, KEYWORDS="distributed Systems", ABSTRACT="The performance of high-volume transaction processing systems is determined by the degree of hardware and data contention. This is especially a problem in the case of distributed systems with global transactions accessing and updating objects from multiple systems. While the conventional two-phase locking method of centralized systems can be adapted for concurrency control in distributed systems, it may restrict system throughput to very low levels. This is due to a significant increase in lock holding times and associated transaction waiting time for locks, as compared to centralized systems. Optimistic concurrency control (OCC) which is similarly extensible to distributed systems has the disadvantage of repeated transaction restarts, which is a weak point of currently proposed methods. We propose a new hybrid method based on OCC followed by locking, which is an integral part of distributed validation and two-phase commit. This advanced OCC method assures that a transaction failing its validation will not be re-executed more than once, in general. Furthermore deadlocks, which are difficult to handle in a distributed environment, are avoided by serializing lock requests. We outline implementation details and compare the performance of the new scheme with distributed two-phase locking.", } @MISC{Bohn89:Distributed, AUTHOR="V. Bohn", TITLE="Performance Evaluation of a Distributed Database System by Means of Discrete Event Simulation", INSTITUTION="Department of Computer Science, University of Kaiserslautern, West Germany", NOTE="Report can be ordered from: Dr. Erhard Rahm, Dept. of Computer Science, University Kaiserslautern, P.O. Box 3049, D-6750 Kaiserslautern, West Germany, (rahm@uklirb.uucp)", YEAR=1989, KEYWORDS="Distributed Systems", ABSTRACT="We investigate the performance behavior of locally distributed database system which use front-end processors to allocate the workload to transaction processing nodes. The performance analysis is based on a complex simulation system which is driven by page reference strings and employs discrete event handling for simulation control. Main parameters of the simulation system include the number of nodes and the multiprogramming level. Response time and throughput results are analysed as well as internal statistics (communication frequency, CPU utilization etc.)", } @MISC{Rahm89:Framework, AUTHOR="E. Rahm", TITLE="A Framework for Workload Allocation in Distributed Transaction Systems", INSTITUTION="Department of Computer Science, University of Kaiserslautern, West Germany", NOTE="Report can be ordered from: Dr. Erhard Rahm, Dept. of Computer Science, University Kaiserslautern, P.O. Box 3049, D-6750 Kaiserslautern, West Germany, (rahm@uklirb.uucp)", YEAR=1989, KEYWORDS="Distributed Systems", ABSTRACT="Ever increasing demands for high transaction rates, limitations of high-end processors, high availability and modular growth considerations are all driving forces towards distributed architectures for transaction processing. A key prerequisite to take advantage of the capacity of a distributed transaction system, however, is an effective strategy for workload allocation. The distribution of the workload should not only achieve load balancing, but also support an efficient transaction processing with a minimum of inter-system communication. To this end, dynamic - yet efficient - schemes for transaction routing have to be employed which are highly responsive to configuration changes and workload fluctuations. We develop a general framework for workload allocation in distributed transaction systems. This framework is based on a classification of distributed architectures and execution models for transaction processing which determine the optimization potential for workload distribution. The framework helps to identify key factors and alternatives in the design of appropriate allocation schemes. Furthermore, it facilitates a comparison of existing schemes and may guide the development of new, more effective protocols.", } @ARTICLE{Harr89:Nestor, AUTHOR="Jim Harris and Michale W. Humes and J. M. Mellichamp and O-Joung Kwon", TITLE="Nestor: Network Engineering System for Topology and Requirements", JOURNAL="Expert Systems", VOLUME=6, NUMBER=3, YEAR=1989, KEYWORDS="Network Design", } @ARTICLE{Kurz89:Defending, AUTHOR="Stanley A. Kurzban", TITLE="Defending Against Viruses and Worms", JOURNAL="SIGUCCS Newsletter", VOLUME=19, NUMBER=3, PAGES="11-23", YEAR=1989, KEYWORDS="Security and Authentication", } @BOOK{Madr89:LANs, AUTHOR="Thomas W. Madro", TITLE="{LANs:} applications of {IEEE/ANSI} 802 standards", PUBLISHER="John Wiley and Sons", ADDRESS="New York, New York", PAGES=308, YEAR=1989, } @MISC{Eric89:Expert, AUTHOR="E. C. Ericson and L. T. Ericson and Daniel Minoli", TITLE="Expert Systems Applications in Integrated Network Management", PUBLISHER="Artech House", YEAR=1989, } @MISC{Muft89:Security, AUTHOR="Sead Muftic and P. Christoffersson and J. Ekberg and J. W. J. Heijnsdijk and F. Law-Min and D. Maroulis and Avnish Patel and P. W. Sanders", TITLE="Security Mechanisms for Computer Networks", PUBLISHER="John Wiley", YEAR=1989, } @BOOK{Chor89:Local, AUTHOR="Dimitris N. Chorafas", TITLE="Local Area Network Reference", PUBLISHER="McGraw-Hill", ADDRESS="New York", PAGES=626, YEAR=1989, } @ARTICLE{Topk89:Information, AUTHOR="Donald M. Topkis", TITLE="Performance Analysis of Information Dissemination by Flooding", JOURNAL=ieeejsac, VOLUME=7, NUMBER=3, PAGES="335-340", YEAR=1989, } @ARTICLE{Whan89:High, AUTHOR="K.-Y. Whang and S. Brady", TITLE="High-Performance Expert Systems - {DBMS} Interface for Network Management and Control", JOURNAL=ieeejsac, VOLUME=7, NUMBER=3, PAGES="408-417", YEAR=1989, } @TECHREPORT{Jain89:Characteristics, AUTHOR="Raj Jain", TITLE="Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes", TYPE="Technical Report", INSTITUTION="Digital Equipment Corporation", NUMBER="DEC-TR-592", YEAR=1989, ABSTRACT="The size of computer networks, along with their bandwidths, is growing exponentially. To support these large, high-speed networks, it is necessary to be able to forward packets in a few microseconds. One part of the forwarding operation consists of searching through a large address database. This problem is encountered in the design of adapters, bridges, routers, gateways, and name servers. Caching can reduce the lookup time if there is a locality in the address reference pattern. Using a destination reference trace measured on an extended local area network, we attempt to see if the destination references do have a significant locality. We compared the performance of MIN, LRU, FIFO, and random cache replacement algorithms and found that the interactive (terminal) traffic in our sample had quite different locality behavior than that of the noninteractive traffic. The interactive traffic did not follow the LRU stack model while the noninteractive traffic did. Examples are shown of the environments in which caching can help as well as those in which caching can hurt, unless the cache size is large.", URL="http://www.cis.ohio-state.edu/~jain/papers/cache\_ps.ps", } @TECHREPORT{Jain89:Comparison, AUTHOR="Raj Jain", TITLE="A Comparison of Hashing Schemes for Address Lookup in Computer Networks", TYPE="Technical Report", INSTITUTION="Digital Equipment Corporation", NUMBER="DEC-TR-566", NOTE="Available from the author at jain\%erlang.dec@decwrl.dec.com", YEAR=1989, ABSTRACT="The trend toward networks becoming larger and faster, and addresses increasing in size, has impelled a need to explore alternatives for fast address recognition. Hashing is one such alternative which can help minimize the address search time in adapters, bridges, routers, gateways, and name servers. Using a trace of address references, we compared the efficiency of several different hashing functions and found that the cyclic redundancy checking (CRC) polynomials provide excellent hashing functions. For software implementation, Fletcher checksum provides a good hashing function. Straightforward folding of address octets using the exclusive-or operation is also a good hashing function. For some applications, bit extraction from the address can be used.", } @ARTICLE{Hac89:Study, AUTHOR="A. Hac and Xiaowei Jin and Jo-Han Soo", TITLE="A Performance Study of Deadlock Prevention Algorithms in a Distributed File System", JOURNAL=spe, VOLUME=19, NUMBER=5, PAGES="461-490", YEAR=1989, } @BOOK{Quar89:Matrix, AUTHOR="J. S. Quarterman", TITLE="The Matrix: Computer Networks and Conferencing Systems Worldwide", PUBLISHER="Digital Press", ADDRESS="Bedford, MA", YEAR=1989, ANNOTE="A detailed survey of all known computer networks in the world. Provides information on connectivity, history, future plans and key personnel.", } @MISC{Boxm89:Sojourn, AUTHOR="O. J. Boxma and H. Daduna", TITLE="Sojourn times in queueing networks", INSTITUTION="CWI. Dept. of Operations Research, Statistics, and System Theory", ADDRESS="Amsterdam", NUMBER="R 891", YEAR=1989, KEYWORDS="Queueing Theory", } @MISC{Waal89:Interconnected, AUTHOR="P. de Waal and N. van Dijk", TITLE="Interconnected networks of queues with randomized arrival and departure blocking", INSTITUTION="CWI; Department of Operations Research, Statistics, and System Theory", ADDRESS="Amsterdam", NUMBER="R 8934", YEAR=1989, KEYWORDS="Queueing Theory", } @MISC{Shap89:SOS, AUTHOR="M. Shapiro and Yvon Gourhant and Sabine Habert and Laurence Mosseri and Michel Ruffin and Celine Valot", TITLE="{SOS:} An Object-Oriented Operating System - Assessment and Perspectives", VOLUME=2, NUMBER=4, PAGES="287-338", YEAR=1989, KEYWORDS="Distributed Systems", } @TECHREPORT{Anis89:Notion, AUTHOR="Nikolay Anisimov", TITLE="A Notion of Petri Net Entity for Communication Protocol Design", INSTITUTION="Institute of Automation and Control Processes", ADDRESS="Vladivostok, USSR", YEAR=1989, KEYWORDS="Protocol Verification", ABSTRACT="The paper discusses a formal model that is intended to support a modular approach to the design and verification of concurrent systems. A new notion of entity is introduced which is defined as Petri net together with a set of labelings, with each labeling treated as an access point designed for communication with other entities or for the observation of the behaviour of an entity itself. Operations on entities, such as parallel composition, abstraction, encapsulation and autocomposition, are defined. A notion of equivalence of entities is introduced based on bisimulation. The equivalence is shown to be a congruence relation with respect to the operations introduced. Methods of representing entities by predicate/transition nets and with the aid of an algebra of regular Petri nets are discussed. Finally, the application of the above model to some problems of communication protocols theory is illustrated. [Copies available from the author at Institute of Automation and Control Processes; Far East division of the USSR Academy of Sciences; 5, Radio st.; Vladivostok, 690032; USSR]", } @TECHREPORT{Scot89:Overview, AUTHOR="M. Scott", TITLE="An overview of Lynx", TYPE="Technical Report", INSTITUTION="University of Rochester Computer Science Department", NUMBER="TR 308", PAGES=27, YEAR=1989, KEYWORDS="Distributed Systems", ABSTRACT="A programming language can provide much better support for interprocess communication than a library package can. Most message-passing languages limit this support to communication between the pieces of a single program, but this need not be the case. Lynx facilitates convenient, typesafe message-passing not only within applications, but also between applications, and among distributed collections of servers. Specifically, it addresses issues of compiler statelessness, late binding, and protection that allow run-time interaction between processes that were developed independently and that do not trust each other. Implementation experience with Lynx has yielded important insights into the relationship between distributed operating systems and language run-time support packages, and into the inherent costs of high-level message-passing semantics.", } @BOOK{Stam89:Business, AUTHOR="David A. Stamper", TITLE="Business data communications (2nd ed.)", PUBLISHER="Benjamin/Cummings", ADDRESS="Menlo Park, California", PAGES=556, YEAR=1989, } @BOOK{Stal89:ISDN, AUTHOR="W. Stallings", TITLE="{ISDN:} an introduction", PUBLISHER="Macmillan", ADDRESS="New York", PAGES=418, YEAR=1989, } @BOOK{Keis89:Local, AUTHOR="Gerd E. Keiser", TITLE="Local Area Networks", PUBLISHER="McGraw-Hill", ADDRESS="New York, New York", PAGES=420, YEAR=1989, } @BOOK{Free89:Computer, AUTHOR="J. R. Freer", TITLE="Computer Communications and networks", PUBLISHER="Plenum Publishing Corp.", ADDRESS="New York, New York", PAGES=432, YEAR=1989, } @BOOK{Kauf89:Practical, AUTHOR="F.-J. Kauffels", TITLE="Practical {LANs} analysed", PUBLISHER="Halsted Press", ADDRESS="New York", PAGES=334, YEAR=1989, } @MISC{Stal89:Handbook, AUTHOR="W. Stallings and P. V. Mockapetris and Sue McLeod and Tony Michel and C. Partridge and K. McCloghrie", TITLE="Handbook of Computer-Communications Standards Volume 3: The {TCP/IP} Protocol Suite, Second Edition", PUBLISHER="Howard W. Sams and Co", YEAR=1989, } @TECHREPORT{Ferg89:Microeconomic, AUTHOR="Donald F. Ferguson and Y. Yemini and C. Nikalson", TITLE="Microeconomic Algorithms for Load Balancing in Distributed Computing Systems", INSTITUTION="T. J. Watson Research Center, Yorktown Heights", YEAR=1989, } @ARTICLE{Keph89:Dynamics, AUTHOR="J. O. Kephart and Tad Hogg and Bernardo A. Huberman", TITLE="Dynamics of computational ecosystems.", JOURNAL="Physical Review A", VOLUME=40, PAGES="404-421", YEAR=1989, } @INCOLLECTION{Mitc89:Pricing, AUTHOR="B. Mitchell", TITLE="Pricing Local Exchange Services: A Futuristic View", BOOKTITLE="Perspectives on the Telephone Industry", EDITOR="J. H. Alleman and R. D. Emmerson", PUBLISHER="Ballinger", YEAR=1989, } @INCOLLECTION{Tayl89:Generic, AUTHOR="William E. Taylor", TITLE="Generic Costing and Pricing Problems in the New Network: How Should Costs be Defined and Assessed", BOOKTITLE="New Regulatory Concepts, Issues, and Controversies", PUBLISHER="Institute of Public Utilities, Michigan State University", YEAR=1989, } @ARTICLE{Wils89:Efficient, AUTHOR="R. J. Wilson", TITLE="Efficient and Competitive Rationing", JOURNAL="Econometrica", VOLUME=57, NUMBER=1, PAGES="1-40", YEAR=1989, } @ARTICLE{Agar89:Analytical, AUTHOR="A. Agarwal and M. Horowitz and John L. Hennessy", TITLE="An analytical cache model", JOURNAL=tocs, VOLUME=7, NUMBER=2, PAGES="184-215", YEAR=1989, REFERENCES=26, KEYWORDS="Cache memory; model; performance evaluation; hit ratio; MVA", } @MISC{Ahma89:High, AUTHOR="Hazim Ahmadi and J. G. Beha and W. Denzel and A. Engbersen and others", TITLE="High-speed modular switching apparatus for circuit and packet switched traffic", PUBLISHER="European patent application no. 87115341.7, date of filing 20.10.87, EP 0 312 628", ADDRESS="München", PAGES="15+21 fig.", YEAR=1989, KEYWORDS="ATM; STM; packet switching; switching network; self routing", } @ARTICLE{Akav89:Hierarchical, AUTHOR="G. Y. Akavia and L. Kleinrock", TITLE="Hierarchical use of dedicated channels", JOURNAL=pe, VOLUME=9, NUMBER=2, PAGES="135-142", YEAR=1989, REFERENCES=12, KEYWORDS="Hierarchical network; communication network; queueing system", } @ARTICLE{Akyi89:Product, AUTHOR="Ian Akyildiz", TITLE="Product Form Approximations for Queueing Networks with Multiple Servers and Blocking", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=1, PAGES="99-114", YEAR=1989, KEYWORDS="Queueing network; blocking; finite capacity; performance evaluation; performance measure; binomial coefficient", ABSTRACT="Queueing networks with blocking have become an important research topic in performance evaluation in recent years. Various typesof blocking within queueing networks have been studied by several investigators. In this work, the following type of blocking is examined. Upon completing of its service, a job attempts to enter a new station.", } @ARTICLE{Alti89:Queueing, AUTHOR="T. Altiok", TITLE="Queueing modeling of a single processor with failures", JOURNAL=pe, VOLUME=9, NUMBER=2, PAGES="93-102", YEAR=1989, REFERENCES=7, KEYWORDS="Queueing system; reliability; performance evaluation", } @ARTICLE{Bacc89:Acyclic, AUTHOR="François Baccelli and W. A. Massey and Donald F. Towsley", TITLE="Acyclic fork-join queuing networks", JOURNAL=jacm, VOLUME=36, NUMBER=3, PAGES="615-642", YEAR=1989, REFERENCES=27, KEYWORDS="Queueing system; queueing network; performance evaluation; synchronization; end-to-end delay", } @ARTICLE{Badr89:Optimal, AUTHOR="Hussein Badr and S. Podar", TITLE="An optimal shortest-path routing policy for network computers with regular mesh-connected topologies", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=10, PAGES="1362-1371", YEAR=1989, REFERENCES=22, KEYWORDS="Routing algorithm; shortest path", ABSTRACT="We present a new probabilistic routing policy, ``Z Routing Policywithin the class of nonadaptive, shortest-path routing policies for regular mesh-connected topologies such as n-dimensional toroids and hypercubes. The focus of our attention is routing in networks of computers in a distributed computing environment, the so-called ``network computers''", } @ARTICLE{Bila89:Merging, AUTHOR="G. Bilardi", TITLE="Merging and Sorting Networks with the Topology of the Omega network", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=10, PAGES="1396-1403", YEAR=1989, KEYWORDS="Omega network; interconnection network; permutation network; sorting network", ABSTRACT={We consider a class of comparator networks obtained from the "omega" permutation network by replacing each switch with a comparator exchanger of atbitrary direction. These networks are all isomorphic to each other, have merging capabilities, and can be us ed as building blocks of sorting networks in ways different fromthe standard merge-sort scheme.}, } @ARTICLE{Bonu89:Fast, AUTHOR="M. A. Bonuccelli", TITLE="A Fast Time Slot Assignment Algorithm for {TDM} Hierarchical switching Systems", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=8, PAGES="870-874", YEAR=1989, REFERENCES=19, KEYWORDS="TDM; time division multiplex; hierarchical network; circuit switching; traffic matrix; TDMA; time division multiple access", ABSTRACT="In this paper, we present a fast algorithm for the time slot assignment in TDM hierarchical switching systems. The algorithm produces a conflict-free time slot assignment for a given frame time where $M$ is the system size. Thus, we give a positive answer to an important open questions proposed by Eng and Acampora.", } @ARTICLE{Brow89:Token, AUTHOR="Geoffrey Brown and M. G. Gouda and Chengke Wu", TITLE="Token Systems that Self-Stabilize", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=6, PAGES="845-852", YEAR=1989, KEYWORDS="Delay system; token system; self stabilization", ABSTRACT="We present a new class of mutual exclusion systems, in which processes circulate one token, and each process enters its criticalsection when it receives the token. Each system in the class is self-stabilizing, i. e. if starts at any state, possibly one where many tokens exist in the system, it is guaranteed to convergeto a good state where exactly one token exists in the system.", } @INPROCEEDINGS{Burg89:Architektur, AUTHOR="L. Burger", TITLE="Architektur eines wissensbasierten Netzwerkplanungssystems", BOOKTITLE="Kommunikation in verteilten Systemen", ADDRESS="Stuttgart", PAGES="818-833", YEAR=1989, LANGUAGE="German", REFERENCES=37, KEYWORDS="Network planning", ABSTRACT="Der Beitrag beschreibt Methoden für den Entwurf von Rechnernetzen und Ansätze zur Integration dieser Methoden in fortgeschrittenen Netzwerkplanungssystemen. Es wird die Architektur des Netzwerkplanungssystems PLANET vorgestellt, das mit Hilfe von Techniken der Künstlichen Intelligenz unterschiedliche Methoden integriert. Das System ist in der Lage, anwendungsnah formulierte Probleme entgegenzunehmen und die zur Lösung der Probleme geeigneten", } @ARTICLE{Chan89:Queueing, AUTHOR="Y. Chandramouli and M. F. Neuts", TITLE="A Queueing Model for Meteor Burst Packet Communication Systems", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=10, PAGES="1024-1030", YEAR=1989, KEYWORDS="Performance evaluation; method; queueing system; packet radio", ABSTRACT="A discrete time queueing model for the performance of meteor burst packet communications systems is analyzed using matrix analytic methods. A meteor burst system uses ionized layers by naturally occurring meteor bursts in the earth's atmosphere to reflect radio signals. Due to its nuclear survivability, inherent privacy, and low cost, such a method of communication has gained considerable interest especially in the defense community.", } @ARTICLE{Cido89:DistributedNetworks, AUTHOR="I. Cidon and M. Sidi", TITLE="Distributed Assignment Algorithms for Multihop Packet Radio networks", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=10, PAGES="1353-1361", YEAR=1989, KEYWORDS="Distributed algorithm; multihop; packet radio; slot assignment; spatial channel reuse; TDMA; time division multiple access", ABSTRACT="New distributed dynamic channel assignment algorithms for a mul tihop pacet radio network are introduced. The algorithms ensure conflict-free transmissions by the nodes of the network. The basic idea of the algorithms is to split the shared channel into a control segment and a transmission segment.", } @ARTICLE{Conc89:Hierarchical, AUTHOR="A. I. Concepcion", TITLE="A hierarchical computer architecture for distributed simulation", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=2, PAGES="311-319", YEAR=1989, REFERENCES=14, KEYWORDS="Distributed simulation", ABSTRACT="A methodolgy is developed to map hierarchical modular discrete event models onto a distributed simulator archictecture", } @ARTICLE{Conw89:Mean, AUTHOR="A. E. Conway and E. de Souza and S. S. Lavenberg", TITLE="Mean value analysis by chain of product form queueing networks", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=3, PAGES="432-442", YEAR=1989, REFERENCES=9, KEYWORDS="MVA; queueing network", } @ARTICLE{Dadu89:Simultaneous, AUTHOR="H. Daduna", TITLE="Simultaneous busy periods for nodes in a stochastic network", JOURNAL=pe, VOLUME=9, NUMBER=2, PAGES="103-109", YEAR=1989, REFERENCES=19, KEYWORDS="Queueing network; busy period; MVA; product form", } @ARTICLE{Eage89:Speedup, AUTHOR="D. L. Eager and J. L. Zahorjan and Ed Lazowska", TITLE="Speedup versus efficiency in parallel systems", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=3, PAGES="408-423", YEAR=1989, REFERENCES=16, KEYWORDS="Parallel computing; parallel software; performance evaluation", } @ARTICLE{ElGu89:Arbitration, AUTHOR="F. El Guibaly", TITLE="Design and analysis of arbitration protocols", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=2, PAGES="161-171", YEAR=1989, REFERENCES=26, KEYWORDS="Arbitration protocol; modeling; performance evaluation", ABSTRACT="Five arbiration protocols, commonly used in digital systems, are modelled and their hardware implementations are discussed. Their performance (delay time) is analysed.", } @PHDTHESIS{Falk89:Markov, AUTHOR="E. Falkenberg", TITLE="Über Markov-Ketten vom M/G-Typ", SCHOOL="Technische Hochschule Darmstadt FB Mathematik", ADDRESS="Darmstadt, Germany", VOLUME="D 17", PAGES=127, YEAR=1989, LANGUAGE="German", REFERENCES=73, KEYWORDS="Queueing system; M/G/N", } @ARTICLE{Garz89:Nonhierarchical, AUTHOR="M. Garzia", TITLE="Nonhierarchical Communications Networks: An Application of Compartmental Modeling", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=6, PAGES="555-564", YEAR=1989, REFERENCES=21, KEYWORDS="Circuit switching; communication network; control; network topology; overflow; routing; overload control; network management; differential equation; modeling", ABSTRACT="Compartmental modeling is applied to nonhierarchical circuit- switched networks allowing a formulation of network dynamics in terms of a system of deterministic equations among global varia bles. Network dynamics under stress conditions of overload and damage are examined, and steady-state results demonstrate the expected bistability property.", } @ARTICLE{Gavi89:System, AUTHOR="Bezalel X Gavish and I. Neuman", TITLE="A System for Routing and Capacity Assignment in Computer Communication Networks", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=4, PAGES="360-366", YEAR=1989, REFERENCES=26, KEYWORDS="Computer network; routing algorithm; LAN; queueing network; network planning", ABSTRACT="The joint problem of selecting a primary route for each communicating pair and a capacity value for each link in computer communications net works is considered. The network topology and traffic characteristics are given; a set of candidate routes and of candidate capacities for each link are also available. The goal is to obtain the least costly feasible design where the costs include both capacity and queuing components.", } @ARTICLE{Gerk89:ISDN, AUTHOR="P. Gerke", TITLE="{ISDN} und {ATM} - ein neuer Weg in die Telekommunikation des 21. Jahrhunderts", JOURNAL=fernmeldepraxis, VOLUME=66, NUMBER=21, PAGES="873-891", YEAR=1989, LANGUAGE="German", REFERENCES=7, KEYWORDS="ATM; survey; introduction strategy", } @ARTICLE{Hack89:Untersuchung, AUTHOR="K.-D. Hackbarth", TITLE="Untersuchung über die Kosten einer Teilnehmer-Teilnehmer-Beziehung im {BISDN}", JOURNAL=fernmelde, ADDRESS="Darmstadt", VOLUME=43, NUMBER="3/4", PAGES="1-56", YEAR=1989, LANGUAGE="German", REFERENCES=18, KEYWORDS="Communication network; network planning; cost", } @ARTICLE{Hert89:Vektor, AUTHOR="F. R. Hertweck", TITLE="Vektor- und Parallelrechner: Vergangenheit, Gegenwart, Zukunft", JOURNAL=it, VOLUME=31, PAGES="5-22", YEAR=1989, LANGUAGE="German", REFERENCES=34, KEYWORDS="Parallel computing; vector processor", } @ARTICLE{Herz89:Leistungsbewertung, AUTHOR="U. Herzog", TITLE="Leistungsbewertung und Modellbildung für Parallelrechner", JOURNAL=it, VOLUME=31, PAGES="31-38", YEAR=1989, LANGUAGE="German", REFERENCES=35, KEYWORDS="Parallel computing; performance evaluation", } @ARTICLE{Hort89:Parallel, AUTHOR="P. D. Hortensius and Raymond McLeod and H. C. Card", TITLE="Parallel random number generation for {VLSI} systems using cellular automata", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=10, PAGES="1466-1473", YEAR=1989, REFERENCES=16, KEYWORDS="random number generation; parallel computing; cellular automata", } @ARTICLE{Ibe89:Analyis, AUTHOR="Oliver C. Ibe and X. Cheng", TITLE="Performance analyis of asymmetric single-buffer polling systems", JOURNAL=pe, ADDRESS="Amsterdam", VOLUME=10, NUMBER=1, PAGES="1-14", YEAR=1989, REFERENCES=21, KEYWORDS="Polling; asymmetric load; performance evaluation", } @ARTICLE{Jajs89:Fault, AUTHOR="A. Jajszczyk and J. Tyszer", TITLE="Fault Diagnosis of Digital Switching Networks", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=7, PAGES="732-739", YEAR=1989, REFERENCES=18, KEYWORDS="Switching network; error analysis; PCM; interconnection network", ABSTRACT="Methods of fault detection and location for separate digital switching matirces as well as a wide class of switching networks are proposed. First, it is assumed that stuck-type faults can affect only a single component of a network. A model of a switching matrix is presented and fault equivalences are shown. The problem of multiple fault detection is also considered.", } @ARTICLE{Jaya89:Throughput, AUTHOR="A. P. Jayasumana", TITLE="Throughput Analysis of the {IEEE} 802.4 Priority Scheme", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=6, PAGES="565-571", YEAR=1989, REFERENCES=12, KEYWORDS="LAN; token bus; IEEE 802.4; priority; media access control; throughput analysis", ABSTRACT="An analytical model for the priority scheme of the IEEE 802.4 token bus standard is presented. The model relates the throughput of each priority class of messages to the traffic intensities of different classes, the target-rotation-times, and the hi-pri-token-hold-time. Simulations results are used to evaluate the accuracy of the model.", } @ARTICLE{Kall89:Planning, AUTHOR="P. J. M. Kallenberg", TITLE="Planning a local network using remote digital units", JOURNAL="ATT International: Trends in telecommunications", VOLUME=5, NUMBER=1, PAGES="31-38", YEAR=1989, REFERENCES=3, KEYWORDS="Network planning; local network; optimization", } @ARTICLE{Karm89:Integrated, AUTHOR="V. Karmarkar and J. G. Kuhl", TITLE="An Integrated Approach to Distributed Demand Assignment in Multiple-Bus Local Networks", JOURNAL=ieeetc, VOLUME=38, NUMBER=5, PAGES="679-695", YEAR=1989, KEYWORDS="LAN; DAMA; demand assignment multiple access; gated service; CSMA/CD; media access control; token system; multiple bus system", ABSTRACT="Multiple-bus local networks (MBLN`s) provide an architectura simple solution to serve high-reliability-high capacity local area network (LAN) applications. Access mechanisms for MBLN`s pos sessing stability and favorable delay characteristics are developed in this paper. A new technique is proposed that uses a sing le explicit tiken to achieve demand assignment multiple access to arbitrate access on all buses in the system.", } @ARTICLE{Keil89:Preempt, AUTHOR="Julian Keilson and L. D. Servi", TITLE="The preempt-resume {M/G/1} queue with feedback and clocked schedules", JOURNAL=pe, VOLUME=9, NUMBER=3, PAGES="191-208", YEAR=1989, REFERENCES=18, KEYWORDS="Queueing system; M/G/1; feedback; priority; clock schedule", } @ARTICLE{Kim89:Fork, AUTHOR="C. Kim and A. K. Agrawala", TITLE="Analysis of a fork-join queue", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=2, PAGES="250-255", YEAR=1989, REFERENCES=12, KEYWORDS="Queueing system; fork-join queue; synchronization; virtual waiting time; performance evaluation", } @ARTICLE{King89:Queueing, AUTHOR="P. King and N. Shacham", TITLE="Queueing models for buffers with dial-up servers", JOURNAL=pe, VOLUME=10, NUMBER=2, PAGES="129-145", YEAR=1989, REFERENCES=20, KEYWORDS="Queueing system; server vacation; overflow traffic", } @MISC{Lave89:Selected, AUTHOR="S. S. Lavenberg", TITLE="Selected publications 1987", PUBLISHER="per", VOLUME=16, NUMBER="2-4", PAGES="13-16", YEAR=1989, REFERENCES=58, KEYWORDS="Queueing system; bibliography", ABSTRACT="Journal publications, confernce proceedings, research reports", } @ARTICLE{Lave89:Perspective, AUTHOR="S. S. Lavenberg", TITLE="A perspective on queueing models of computer performance", JOURNAL=pe, ADDRESS="Amsterdam", VOLUME=10, NUMBER=1, PAGES="53-76", YEAR=1989, REFERENCES=111, KEYWORDS="Queueing system; queueing network; performance evaluation", } @ARTICLE{Lee89:Queue, AUTHOR="T. T. Lee", TITLE="{M/G/1/N} queue with vacation time and limited service discipline", JOURNAL=pe, VOLUME=9, NUMBER=3, PAGES="181-190", YEAR=1989, REFERENCES=12, KEYWORDS="Queueing system; M/G/1/S; vacation time", } @ARTICLE{Lee89:Bound, AUTHOR="G. Lee", TITLE="A Performance Bound of Multistage Combining Networks", JOURNAL=ieeetc, VOLUME=38, NUMBER=10, PAGES="1387-1395", YEAR=1989, KEYWORDS="Buffered network; hot spot; multiprocessor system; multistage interconnection network; parallel computing; performance evaluation; supercomputer", ABSTRACT="Concurrent requests by many processors to a shared variable on a shared memory machine can create contention that will be serio us enough to stall large machines. ``Combining'', in which several requests for the same variable can be combined into a single request, has been suggested as an effective method of alleviating this contention.", } @ARTICLE{Levy89:Delay, AUTHOR="H. M. Levy", TITLE="Delay computation and dynamic behaviour of non-symmetric polling systems", JOURNAL=pe, ADDRESS="Amsterdam", VOLUME=10, NUMBER=1, PAGES="35-51", YEAR=1989, REFERENCES=25, KEYWORDS="Polling; delay analysis; asymmetric load", } @ARTICLE{Lieb89:Routing, AUTHOR="F. Liebl and K. Nüßler", TITLE="Routing-Algorithmen für paketvermittelnde Datennetze - Vergleichende Simulationsergebnisse und optimierte Anwendungen im Datex-P-Netz", JOURNAL=ntzarchiv, VOLUME=11, NUMBER=1, PAGES="23-32", YEAR=1989, LANGUAGE="German", REFERENCES=17, KEYWORDS="Packet switching; routing algorithm", ABSTRACT="Seit 1981 unterhält die Deutsche Bundespost das paketvermittelnde Datennetz Datex-P. Es wird ein Simulationsmodell vorgestellt, das Datex-P geeignet abbildet und als Grundlage für Vergleichevon Routing-Algorithmen verwandt werden kann. Der erste Vergleichstest behandelt dabei in der Literatur vorgeschlagende Verfahren, die bereits in einem früheren Beitrag ausführlich beschrieben worden waren. Eine zweite Studie beschäftigt sich mit Modifikationen", } @ARTICLE{Matt89:Diskrete, AUTHOR="F. Mattern and H. Mehl", TITLE="Diskrete Simulation - Prinzipien und Probleme der Effizienzsteigerung durch Parallelisierung", JOURNAL=infspec, VOLUME=12, PAGES="198-210", YEAR=1989, LANGUAGE="German", REFERENCES=71, KEYWORDS="Discrete event simulation; distributed simulation; survey; speedup; functional partitioning", ABSTRACT="This article presents the traditional simulation methodologies and analyzes them with respect to potential parallelism. Problems and opportunities are shown, references to more detailed studies are given. In forthcoming article the theories and methods of parallel and distributed simulation will be described.", } @ARTICLE{Mela89:Class, AUTHOR="B. Melamed", TITLE="A class of methods for generating autocorrelated uniform variates", JOURNAL=bstj, ADDRESS="Holmdel, NJ", PAGES="24 + 12 figs.", YEAR=1989, REFERENCES=19, KEYWORDS="random number generation; correlated variate; uniform variate; autocorrelation", ABSTRACT="TES: Transform-Expand-Sample method", } @ARTICLE{Moll89:Class, AUTHOR="Mart L. Molle", TITLE="Analysis of a class of distributed queues with applications", JOURNAL=pe, VOLUME=9, PAGES="271-286", YEAR=1989, REFERENCES=17, KEYWORDS="Queueing system; LAN; cyclic service", } @ARTICLE{Nomu89:Basic, AUTHOR="M. Nomura and T. Fuji and Naohisa Ohta", TITLE="Basic characteristics of variable rate video coding in {ATM} environment", JOURNAL=ieeejsac, VOLUME="JSAC-7", NUMBER=5, PAGES="752-760", YEAR=1989, REFERENCES=17, KEYWORDS="Packet video; ATM; traffic source model; burstiness; VBR; variable bitrate coding; distribution; autocorrelation", } @INPROCEEDINGS{Nusl89:Planning, AUTHOR="K. Nüßler", TITLE="Planning and Performance of the {Datex-P} Network", BOOKTITLE="Kommunikation in verteilten Systemen", ORGANIZATION="ITG", ADDRESS="Stuttgart, Germany", PAGES="582-596", YEAR=1989, REFERENCES=3, KEYWORDS="DATEX-P; routing algorithm; packet switching; network", ABSTRACT="The Deutsche Bundespost introduced its public packet switched data network in 1980. The paper reports on the planning methodology applied to the network with special emphasis of the routing mechanism in use. To illustrate the efictiveness of current planning and management procedures a brief overview of some measured performance criteria is given.", } @ARTICLE{Pate89:Feedback, AUTHOR="M. Paterok and O. Fischer", TITLE="Feedback queues with preemption distance priorities", JOURNAL=per, VOLUME=17, NUMBER=1, PAGES="136-145", YEAR=1989, REFERENCES=19, KEYWORDS="Queueing system; priority; feedback", } @ARTICLE{Perr89:Computationally, AUTHOR="Harry Perros and P. M. Snyder", TITLE="A computationally efficient approximation algorithm for feed-forward open queueing networks with blocking", JOURNAL=pe, VOLUME=9, NUMBER=3, PAGES="217-224", YEAR=1989, REFERENCES=5, KEYWORDS="Queueing network; blocking; approximation", } @ARTICLE{Pham89:Optimal, AUTHOR="X. H. Pham and F. Schreiber", TITLE="The optimal strategy {SRPT} in priority systems of digital communication networks", JOURNAL=aeu, VOLUME=43, NUMBER=3, PAGES="129-134", YEAR=1989, REFERENCES=14, KEYWORDS="Queueing system; preemptive priority; SRPT; shortest remaining processing time; performance evaluation; M/G/1", } @ARTICLE{Rose89:Rapid, AUTHOR="C. A. Rose", TITLE="Rapid Optimal Scheduling for Time-Multiplex Switches Using a Cellular Automaton", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=5, PAGES="500-509", YEAR=1989, REFERENCES=7, KEYWORDS="Switching system; TDM; time division multiplex; traffic matrix; cellular automata; scheduling; packet switching", ABSTRACT="An optimal scheduling algorithm is derived in this paper which may be implemented with a special-purpose parallel computer (cellular automaton) and allows extremely rapid computation of schedules; the scheduling time for an $N=1000$, $C=100$ switch is measured in milliseconds ($N$ inputs, $N$ outputs, $C$ time slots per frame).", } @ARTICLE{Ross89:Optimal, AUTHOR="Keith W. Ross and D. Tsang", TITLE="Optimal Circuit Access Policies in an {ISDN} Environment: A Markov Decision Approach", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=9, PAGES="934-939", YEAR=1989, REFERENCES=14, KEYWORDS="ISDN; traffic model; network; model; access control; product form; circuit switching; TDM; time division multiplex", ABSTRACT="A Markov decision process (MDP) approach is employed to obtain optimal access policies for three models: the flexible scheme access-port model where a single link is shared; the contiguous schme access -port model where wide-band calls are required do occupy specific contiguous regions of the TDM frame; the network-access model where a call holds several channels in different links simultaneously.", } @BOOK{Ruck89:Kanalzugriffsprotokoll, AUTHOR="J. Rückert", TITLE="Ein Kanalzugriffsprotokoll für Datenfunknetze mit Stationen beschränkter Mobilität", PUBLISHER="Hüthig Verlag", PAGES=101, YEAR=1989, LANGUAGE="German", REFERENCES=80, KEYWORDS="Packet radio; access protocol; MAT", } @ARTICLE{Sait89:Optimal, AUTHOR="H. Saito", TITLE="Optimal control of variable rate coding in integrated voice/data packet networks", JOURNAL=pe, VOLUME=10, NUMBER=2, PAGES="115-128", YEAR=1989, REFERENCES=28, KEYWORDS="Queueing system; flow control; VBR; variable bitrate coding; packet switching; voice/data integration", } @ARTICLE{Serv89:Stochastic, AUTHOR="L. D. Servi and D. D. Yao", TITLE="Stochastic bounds for queueing systems with limited service schedules", JOURNAL=pe, VOLUME=9, PAGES="247-261", YEAR=1989, REFERENCES=24, KEYWORDS="Queueing system; GI/G/1; cyclic service; server vacation; approximation", } @ARTICLE{Shar89:Efficient, AUTHOR="S. M. Sharrock and H. C. Du", TITLE="Efficient {CSMA/CD-Based} Protocols for Multiple Priority Classes", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=7, PAGES="943-954", YEAR=1989, KEYWORDS="CSMA/CD; multiple priority; persistent; protocol; reservation", ABSTRACT="Efficient, reservation-based CSMA/CD protocols for handling multiple-priority-class traffic are presented. Improving upon previous proposals, which require a reservation for each transmission attempt, the new protocols allow the transmission of a varying-length stream of packets with just a single reservation.", } @ARTICLE{Verb89:Variable, AUTHOR="Willem Verbiest and Luc Pinnoo", TITLE="A variable bit rate video codec for asynchronous transfer mode networks", JOURNAL=ieeejsac, VOLUME="JSAC-7", NUMBER=5, PAGES="761-770", YEAR=1989, REFERENCES=9, KEYWORDS="ATM; VBR; variable bitrate coding; packet video; codec", } @ARTICLE{Zien89:Angen, AUTHOR="M. Zientalski and R. Sobczak", TITLE="Angenäherte Analyse der Warteschlange mit beschränkter Kapazität und Wartezeit", JOURNAL=nte, VOLUME=39, NUMBER=1, PAGES=5, YEAR=1989, LANGUAGE="German", REFERENCES=2, KEYWORDS="Queueing system; limited waiting time; M/M/1/S; performance evaluation", } @ARTICLE{Chla89:Models, AUTHOR="I. Chlamtac and A. Ganz", TITLE="Performance Models of Asynchronous Multitrunk {HYPERchannel} Networks", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=2, PAGES="138-146", YEAR=1989, KEYWORDS="HYPERchannel; architecture; performance evaluation", ABSTRACT="The HYPERchannel communication network based on one to four trunks, or channels is considered. We develop closed queueing models with dependent servers which characterize the network performance as a function of the number of channels, the channel load, the number of stations and the packet length distribution. For analyzing the network behavior with constant packet length we introduce techniques for representing the actual asynchronous.", } @PHDTHESIS{Fisc89:Modellierung, AUTHOR="W. Fischer", TITLE="Modellierung und Analyse des Netzzugangssystems für das dienstintegrierte Digitalnetz {ISDN}", SCHOOL="Universität Stuttgart, Institut für Nachrichenvermittlung und Datenverarbeitung", ADDRESS="Stuttgart, Germany", PAGES=153, YEAR=1989, LANGUAGE="German", REFERENCES=99, KEYWORDS="ISDN; traffic theory; modeling; simulation", } @ARTICLE{Gerl89:Topology, AUTHOR="M. Gerla and José Augusto Suruagy Monteiro and R. A. Pazos", TITLE="Topology design and bandwidth allocation in {ATM} networks", JOURNAL=ieeejsac, VOLUME=7, NUMBER=8, PAGES="1253-1262", YEAR=1989, REFERENCES=19, KEYWORDS="ATM; Topological Design; Bandwidth Allocation", } @INPROCEEDINGS{Morg89:Queueing, AUTHOR="Samuel P. Morgan", TITLE="Queueing disciplines and passive congestion control in byte-stream networks", BOOKTITLE=infocom, VOLUME=2, PAGES="711-720", NOTE="also IEEE transaction on Communications, COM-39, 7, 1097-1106", YEAR=1989, REFERENCES=19, KEYWORDS="Packet Switching; queueing discipline; FIFO; round robin; performance evaluation; comparison", ABSTRACT="This paper deals with queueing disciplines for a vlass of wide- area virtual-circuit data networks. Messages on each virtual circuit are transmitted logically as streams of bytes. A small number of successive bytes are collected into a packet and provided with an address header. Packets from different virtual circuits are intermingled on trunks and are relayed from one node of the network to another.", } @ARTICLE{Oie89:Throughput, AUTHOR="Yuji Oie and S. Nishio and Toshiharu Hasegawa", TITLE="Throughput Analysis of Blocked Access Tree Algorithms with Mini-slots", JOURNAL=cnis, VOLUME=17, NUMBER=3, PAGES="201-221", YEAR=1989, REFERENCES=18, KEYWORDS="Random access; stability; collision resolution; throughput analysis", ABSTRACT="This paper analyzes the maximum stable throughput of two Q-ary blocked access tree algorithms with minislots: one (TA/M-BF) assumes that something/nothing binary feedback information is availiable in a mini-slot, and the other (TA/M-TF) assumes ternary feedback.", } @TECHREPORT{Star89:Validation, AUTHOR="P. H. Starke", TITLE="Validation of Petri Net Model by {'PAN'}", INSTITUTION="Sektion Mathematik der Humboldt-Universität Berlin", YEAR=1989, KEYWORDS="Petri net; distributed system; concurrent system", ABSTRACT="The article introduces the functions of the software tool PAN for validating Petri Net Models. PAN is able to deal with various types of Place/Transition nets.", } @ARTICLE{Suda89:TreeProtocols, AUTHOR="T. Suda and S. B. Morris", TITLE="Tree {LAN} with Collision Avoidance: Station and Switch Protocols", JOURNAL=cnis, VOLUME=17, NUMBER=2, PAGES="101-110", YEAR=1989, REFERENCES=10, KEYWORDS="LAN; access protocol; broadcast; collision avoidance", ABSTRACT="Describe some tree LANs that use collision avoidance switches as broadcast star, CASB tree, CAMB tree and tinker tree. These LANs have the potential of combining the benefits of random access with concurrency of transmission and excellent network utilization.", } @ARTICLE{Suda89:TreePerformance, AUTHOR="S. B. Morris and T. Suda and T. C. Nguyen", TITLE="A Tree {LAN} with Collision Avoidance: Photonic Switch Design and Simulated Performance", JOURNAL=cnis, VOLUME=17, NUMBER=2, PAGES="89-100", YEAR=1989, REFERENCES=6, KEYWORDS="LAN; performance evaluation; access protocol; simulation", ABSTRACT="After briefly describing the camb tree, we discuss the suitability of this network for high-speed, lightwave communications, and we propose a possible implementation of a collision avoidance switch using current photonic technology.", } @BOOK{Bolc89:Leistungsbewertung, AUTHOR="G. Bolch", TITLE="Leistungsbewertung von Rechensystemen", ISBN="3-519-02279-6", PUBLISHER="Teubner Verlag", ADDRESS="Stuttgart", PAGES="1-310", YEAR=1989, LANGUAGE="German", KEYWORDS="Performance evaluation; computer system", ABSTRACT="Modellerstellung; Warteschlangenmodelle von Rechensystemen; Markov-Prozesse; Numerische Analyseverfahren; Exakte Analyse von Produktformnetzen; Approximative Analyse von Produktformnetzen; Approximative Analyse von Nicht Produktformnetzen", } @ARTICLE{Dega8903:Fast, AUTHOR="J. J. Degan and Gottfried Luderer and A. K. Vaidya", TITLE="Fast packet technology for future switches", JOURNAL=atttj, VOLUME=68, NUMBER=2, PAGES="36-50", MONTH="March/April", YEAR=1989, REFERENCES=30, KEYWORDS="Packet switching; fast packet switching; switching system; Banyan network; architecture; survey", ABSTRACT="In this paper, we give a high-level sketch of the evolution of fast packet switch technology starting with the first packet switches and ending with some architectures that offer promise as potential switching vehicles for Broadband ISDN. We shall be using examples of AT\\&T experimental switch architectures to illustrate the evolution and technical capabilities.", } @INPROCEEDINGS{Kuhn89:Broadband, AUTHOR="P. J. Kühn", TITLE="Broadband Access to {ISDN}", BOOKTITLE="IFIP TC6 / ICCC Joint Conference on ISDN in Europe", PUBLISHER="North Holland", ADDRESS="The Hague", PAGES="453-463", YEAR=1989, KEYWORDS="ATM; architecture", } @INPROCEEDINGS{Kuhn89:ISDN, AUTHOR="P. J. Kühn", TITLE="From {ISDN} to {IBCN}", BOOKTITLE="IFIP 11th World Computer Congress", PUBLISHER="North Holland", ADDRESS="San Francisco", PAGES="479-486", YEAR=1989, KEYWORDS="ATM; ISDN; IBCN; architecture", } @BOOK{Neut89:Structured, AUTHOR="M. F. Neuts", TITLE="Structured stochastic matrices of {M/G/1} type and their applications", ISBN="0-8247-8283-6", PUBLISHER="Marcel Dekker, New York and Basel", PAGES=510, YEAR=1989, REFERENCES=1400, KEYWORDS="Queueing theory; queueing system; matrix geometric method; algorithm; Markov chain; Markovian queueing system", } @ARTICLE{Rath89:ATM, AUTHOR="Erwin P. Rathgeb and T. H. Theimer and M. Huber", TITLE="{ATM} Switches -- Basic Architectures and their Performance", JOURNAL=dacs, VOLUME=2, NUMBER=4, PAGES="227-236", YEAR=1989, REFERENCES=35, KEYWORDS="ATM; switching system; architecture; performance evaluation", } @INPROCEEDINGS{Ali89:Neural, AUTHOR="Mehmet M. K. Ali and H. Q. Nguyen", TITLE="A Neural Network Implementation of an Input Access Scheme in a High-Speed Packet Switch", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=2, PAGES="1192-1196 (32.7)", YEAR=1989, REFERENCES=9, KEYWORDS="Neural network; packet switching; BISDN; simulation", ABSTRACT="In this paper a neural network implementation of an input access scheme in a high-speed packet switch for Broadband ISDN is presented.", } @INPROCEEDINGS{Amin89:Support, AUTHOR="B. Amin-Salehi and D. R. Spears", TITLE="Support of Transport Services in {BISDN}", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=3, PAGES="1467-1472 (41.3)", YEAR=1989, REFERENCES=7, KEYWORDS="ATM; BISDN; SDH; synchronous digital hierarchy; connectionless service", ABSTRACT="This paper presents the current view of the broadband network architecture.", } @INPROCEEDINGS{Andr89:Transient, AUTHOR="J. M. Andrewarth and P. E. Cantrell", TITLE="Transient Approximations for Jackson Networks", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=2, PAGES="954-958 (26.8)", YEAR=1989, REFERENCES=18, KEYWORDS="M/M/1; Jackson net; approximation; simulation; transient analysis", ABSTRACT="Two closure approximations for the M/M/1 queue are extended to a Jackson network.", } @INPROCEEDINGS{Ash89:Dynamic, AUTHOR="G. R. Ash and E. Oberer", TITLE="Dynamic routing in the {AT\\&T} Network -- improved service quality at lower cost", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="303-308 (9.1)", YEAR=1989, REFERENCES=8, KEYWORDS="Dynamic routing; ISDN; measurement; switching network", ABSTRACT="The introduction of Dynamic Non-Hierarchical Routing into the AT\\&T Switched Network was completed in 1987. It has resulted in a marked improvement in AT\\&T network connection availability while simultaneously reducing network costs. The paper describes the concept of dynamic routing and how it was implemented in the network over a several-year perios by a multi-organizational team within AT\\&T.", } @INPROCEEDINGS{Ayan89:Method, AUTHOR="Ender Ayanoglu and I. Chih-Lin", TITLE="A method of computing the coefficients of the network reliability polynomial", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="331-337 (9.6)", YEAR=1989, REFERENCES=8, KEYWORDS="Reliability; routing; error control", ABSTRACT="The reliability polynomial of a network provides a benchmark to evaluate a network topology by quantifying the probability of one or more existing operational paths between two given nodes, given the probabilities of failure of the communication links. We introduce a method to calculate the coefficients of the reliability polynomial of a network when the probabilities of link failure are independent and identical", } @INPROCEEDINGS{Berg89:Preventing, AUTHOR="Arthur W. Berger and J. Kent and M. V. Stein", TITLE="Preventing overload and verifying link stability in an implementation of the {DPNSS} layer 2 protocol", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="175-179 (5.5)", YEAR=1989, REFERENCES=4, KEYWORDS="PABX; low level protocol; overload control", ABSTRACT="The Digital Private Network Switching System (DPNSS) layer 2 protocol specification does not explicitly indicate methos of layer 2 overload control or link stability verification. paper describes how AT\\&T's 5ESS-PRX switch has implemented these feature. The key to spreventing and controlling overload is to explicitly ignore some received retransmissions of incoming frames.", } @INPROCEEDINGS{Cata89:Improvement, AUTHOR="V. Catania and L. Milazzo and L. Vita", TITLE="Performance-reliability improvement in a distributed system", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="319-326 (9.4)", YEAR=1989, REFERENCES=12, KEYWORDS="Performability; LAN; fiber optics; Markov chain; reliability", ABSTRACT="In this paper, the authors present assessment of an optical fibre LAN in which some strategies to increase fault tolerance have been defined. By means of a stochastic model based on a Markov Chain with an absorbent state, the authors have assessed the basic para- meter linked to network reliability. In particular the increase in Mean Time to Failure and performability achieved by introducing a new recovery process are derived.", } @INPROCEEDINGS{Chao89:Multiple, AUTHOR="C. Y. Chao and M. Ilyas", TITLE="Performance Analysis of Multiple-Packet Messages in Uni-Directional Bus Networks", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=2, PAGES="949-953 (26.7)", YEAR=1989, REFERENCES=11, KEYWORDS="Persistent; protocol; performance evaluation; simulation", ABSTRACT="In this paper, we consider a slotted $p(i)$-persistent protocol and study the effects of random message length.", } @INPROCEEDINGS{Chem89:Adaptive, AUTHOR="Prosper Chemouil and M. Lebourges and P. Gauthier", TITLE="Performance evaluation of adaptive traffic routing in a metropolitan network: a case study", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="314-318 (9.3)", YEAR=1989, REFERENCES=14, KEYWORDS="Adaptive routing; MAN; switching network; telephony; simulation", ABSTRACT="This paper is concerned with a performance analysis of adaptive traffic routing in the telephone network of the city of Marseilles, France. Simulations are presented and analyzed which emphasize the role of state-dependent routing in network efficiency.", } @INPROCEEDINGS{DiBe89:Dynamic, AUTHOR="A. Di Benedetto and P. La Nave and C. Sisto", TITLE="Dynamic routing of the {ITALCABLE} telephone traffic: experiences and perspectives", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="309-313 (9.2)", YEAR=1989, REFERENCES=4, KEYWORDS="Dynamic routing; E.170; telephony; design", ABSTRACT="This paper first describes the characteristics of the dynamic routing strategy based on statistical (10) sampling adopted by Italcable since 1983 on its policentric network with the ``GTAI'' system. At last a new dynamic routing strategy, which combines some of the mechanisms specified by CCITT Recommendations E.170 and which will be implemented in the future, is described.", } @INPROCEEDINGS{Ghaf89:New, AUTHOR="Hatem M. Ghafir and C. B. Silio Jr", TITLE="A new approach to modeling multiple access circuit-switched rings", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="293-297 (8.6)", YEAR=1989, REFERENCES=15, KEYWORDS="Delay; throughput; circuit switching; multiple access; LAN; ring; imbedded Markov chain; M/G/1; vacation system; simulation", ABSTRACT="We model delay-throughput performance of a class of multiple access circuit-switched ring local area networks (LANs) that allow for multiple messages to be transferred concurently on the ring. Using a two-dimensional imbedded Markov chain we develop a generalized M/G/1 vacation model with Bernoulli schedules in which the system is analyzed at service completion and vacation termination epochs.", } @INPROCEEDINGS{Hdia89:Hand, AUTHOR="M. T. Hdiao and S. Jiang", TITLE="A hand-shake protocol for spread spectrum multiple access networks", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="288-292 (8.5)", YEAR=1989, REFERENCES=11, KEYWORDS="Protocol; spread spectrum; multiple access; analysis; Markov chain; throughput", ABSTRACT="A receiver based protocol for spread spectrum multiple access networks is proposed and analyzed. This scheme is based on a hand-shake procedure before any formal transmission of data packets. The protocol is number of simultaneous transmissions. The system is modeled as a two dimensional Markov chain from which the throughput can be determined. Numerical results are presented and compared with other protocols.", } @INPROCEEDINGS{Ishi89:Signalling, AUTHOR="Hiroshi Ishii and M. Kawarasaki", TITLE="{BISDN} Signalling Protocol Capabilities", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=3, PAGES="1462-1466 (41.2)", YEAR=1989, REFERENCES=2, KEYWORDS="ATM; BISDN; signalling protocol", ABSTRACT="This paper clarifies basic requirements for BISDN signalling protocols.", } @INPROCEEDINGS{Iyen89:Switching, AUTHOR="A. Iyengar and Magda El Zarki", TITLE="Switching Prioritized Packets", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=2, PAGES="1181-1186 (32.5)", YEAR=1989, REFERENCES=8, KEYWORDS="ATM; real time; priority; packet video; packet voice", ABSTRACT="This paper investigates methods to increase the suitability of packet switching for time-critical applications and to specify packets that can be discarded in the event of resource exhaustion.", } @INPROCEEDINGS{Jabb89:Degradation, AUTHOR="B. Jabbari and Y.-Q. Zhang", TITLE="Performance Degradation in Heterogeneous Local Computer Network Interconnections", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=2, PAGES="919-923 (26.2)", YEAR=1989, REFERENCES=10, KEYWORDS="CSMA/CD; token ring; token bus; gateway; protocol", ABSTRACT="Three scenarios resulting from combinations of CSMA/CD, token ring and token bus protocols have been analyzed and graphically presented in this paper.", } @INPROCEEDINGS{Jere89:Transient, AUTHOR="L. Jereb and Marco {Ajmone Marsan}", TITLE="Transient Performance Analysis of Nonpersistent {CSMA} and {CSMA/CD} Protocols", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=2, PAGES="939-943 (26.5)", YEAR=1989, REFERENCES=7, KEYWORDS="CSMA; carrier sense multiple access; CSMA/CD; transient analysis; throughput; packet delay", ABSTRACT="in order to obtain reliable performance predictions, it is necessary to study the protocol behaviour in transient conditions. This paper presents a technique for the analysis of slotted non-persistent CSMA and CSMA-CD protocols in such an environment.", } @INPROCEEDINGS{Jian89:Integrated, AUTHOR="X. Jiang and J. S. Meditch", TITLE="Integrated Services Fast Packet Switching", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=3, PAGES="1478-1482 (41.5)", YEAR=1989, REFERENCES=33, KEYWORDS="ATM; switching network; fast packet switching; packet video; nalysis", ABSTRACT="A new fast packet switch, called the FP switch, which supports integrated voice-data-video services, is introduced.", } @INPROCEEDINGS{Kado89:Distributed, AUTHOR="M. Kadoch and A. K. Elhakeem", TITLE="A distributed queue metropolitan area network for combined video, voice, wideband data and narrowband data", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="152-156 (5.1)", YEAR=1989, REFERENCES=5, KEYWORDS="Priority; delay loss model; queueing network; M/M/1; analysis; MAN; DQDB; IEEE 802.6", ABSTRACT="The physical media is the double bus networks of the type adopted by IEEE standard. In this paper we supplement the previous efforts of distributed queueing by hybrid reservation protocols amenable to integrating of voice, video and different data types. In the following, we analyze the performance of the underlying protocols, discuss the system aspects and the different priority schemes involved.", } @INPROCEEDINGS{Krai89:Traffic, AUTHOR="B. Kraimeche", TITLE="Traffic Control in an {ISDN} multiplexor", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="585-599 (17.1)", YEAR=1989, REFERENCES=4, KEYWORDS="BISDN; STM; ATM; traffic control; hybrid switching; analysis; flow control", ABSTRACT="A combination of synchronous and asynchronous transfer modes (STM/ATM) at a broadband ISDN interface may lead to efficient multiplexing of isochronous and nonisochronous types of traffic if proper access and cell allocation controls are applied. This paper examines traffic control at such a hybrid multiplexor, and presents results on its performance", } @INPROCEEDINGS{Kuro89:TDMA, AUTHOR="N. Kuroyanagi", TITLE="{TDMA} {LAN} with multiple bus topology for wide area applications", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="590-596 (17.2)", YEAR=1989, REFERENCES=5, KEYWORDS="LAN; MAN; TDMA; time division multiple access; delay; voice/data integration; throughput; analysis", ABSTRACT="This paper proposes a new system configuration which achieves TDMA functions on a connected bus topology for wide area applications, resulting in an integrated voice-data transmission capability, a high throughput, connection portability for stations and high reliability.", } @INPROCEEDINGS{Kwok89:Transparent, AUTHOR="C. K. Kwok and B. Mukherjee", TITLE="On Transparent Bridging of {CSMA/CD} Networks", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="185-190 (5.7)", YEAR=1989, REFERENCES=17, KEYWORDS="LAN; store-and-forward; bridge; cut-through switching; CSMA/CD; approximation; simulation", ABSTRACT="This paper addresses the problem of interconnecting CSMS/CD LANs via a transparent bridge. We present an approximate performance analysis of a multisegment CSMA/CD LAN whose segments are connected by a transparent bridge which can be either of the normal store-and-forward type or of the novel cut-through variety. The analysis is verified via simulation.", } @INPROCEEDINGS{Laza89:Switching, AUTHOR="Aurel A. Lazar and R. Gidron and A. Temple", TITLE="A Switching Architecture for Asynchronous Time Sharing", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=2, PAGES="1166-1172 (32.3)", YEAR=1989, REFERENCES=27, KEYWORDS="ATM; switching network; architecture", ABSTRACT="In this paper an operating implementation is described in detail.", } @INPROCEEDINGS{Li89:Space, AUTHOR="Song Li", TITLE="Performance of a Non-Blocking Space-Division Packet Switch With Correlated Input Traffic", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=3, PAGES="1754-1763 (49.1)", YEAR=1989, REFERENCES=16, KEYWORDS="Nonblocking; space division multiplex; packet switching; analysis; correlation", ABSTRACT="This paper studies the performance of non-blocking space-division packet switches in a correlated input traffic environment.", } @INPROCEEDINGS{Mart89:Designing, AUTHOR="P. Martini and M. Rupprecht", TITLE="Designing High Speed Controllers for High Speed Local Area Networks", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="170-174 (5.4)", YEAR=1989, REFERENCES=16, KEYWORDS="Network control system; architecture; HSLAN; analysis", ABSTRACT="In this paper we compare the performance of network controllers to the performance of medium access protocols. The results show that state-of-the-art network controllers are very likely to become the bottlenecks in future high speed networks.", } @INPROCEEDINGS{Mate89:Evolution, AUTHOR="B. Materna and B. J. N. Vaughan and C. W. Britney", TITLE="Evolution from {LAN} and {MAN} Access Networks Towards the Integrated {ATM} Network", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=3, PAGES="1455-1461 (41.1)", YEAR=1989, REFERENCES=10, KEYWORDS="LAN; MAN; BISDN; UNI; user network interface; gateway", ABSTRACT="This paper structures the evolving network into local (LAN), metropolitan (MAN) and BISDN levels.", } @INPROCEEDINGS{Mehr89:Improved, AUTHOR="N. Mehravari", TITLE="Improved multiple access schemes for very high speed optical fiber local area networks using a passive star topology", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="272-277 (8.2)", YEAR=1989, REFERENCES=14, KEYWORDS="Multiple access; high speed; data network; Aloha; slotted Aloha; analysis", ABSTRACT="In [11], a number of random-access protocols were introduced and analyzed for a very high speed optical data network based on a passive star topology. In this paper we provide a number of more efficient protocols for the same hardware architecture and characterize their improved performance. We concentrate on the most simple algorithms which are based on Aloha protocol and do not require any kind of carrier sensing.", } @INPROCEEDINGS{Moha89:ISDN, AUTHOR="O. E. Moharram", TITLE="Performance analysis of {ISDN} switching systems", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="622-626 (17.7)", YEAR=1989, REFERENCES=8, KEYWORDS="ISDN; switching system; D-channel; approximation; signalling protocol", ABSTRACT="A broadband packet switch adopting a Batcher-banyan interconnection network is described.", } @INPROCEEDINGS{Pond89:Throughput, AUTHOR="L. C. Pond and V. Li", TITLE="Throughput Analysis of {CSMA} Access Policies in Radio Determination Satellite Service", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="617-621 (17.6)", YEAR=1989, REFERENCES=5, KEYWORDS="Throughput; analysis; CDMA; code division multiple access; packet radio; satellite radio; spread spectrum", ABSTRACT="Policies for accessing a packet radio network, under the assumptions of the L-channel CDMA model and non-unity receiver idle probability, are proposed and analytical tools to evaluate their performance are developed. These policies and tools are applicable to random access packet radio networks, such as the Radio Determination Satellite Service (RDSS) systems, which require wideband or spread spectrum techniques", } @INPROCEEDINGS{Rang89:Study, AUTHOR="J. Rangarajan and Kenneth Vastola", TITLE="A study of priority at the transport layer in local area networks", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="597-603 (17.3)", YEAR=1989, REFERENCES=8, KEYWORDS="Priority; transport layer; simulation; IEEE 802.4; IEEE 802.2; MAP; delay", ABSTRACT="In the Computer Integrated Manufacturing (CIM) environment and other integrated services types of networks, short time critical messages share network resources with bulk data transfer, creating the need for priority schemes. The OSI reference model defines priority to be primarily a part of the functionality of the Medium Access Control sublayer of Data Link layer. In this paper we present results from a simulation study", } @INPROCEEDINGS{Rubi89:Integrated, AUTHOR="I. Rubin and John Lee", TITLE="Performance analysis of integrated data/voice star topology circuit-switched networks", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="157-162 (5.2)", YEAR=1989, REFERENCES=16, KEYWORDS="Circuit switching; voice/data integration; LAN; MAN; blocking; analysis; approximation", ABSTRACT="We consider integrated data/voice circuit-switched networks which assume a star topology consisting of local area networks (LANs) interconnected through a backbone metroplitan area network (MAN). The stations are classified into two categories: data and voice stations; they are characterized by different arrival rate and session-length statistics.", } @INPROCEEDINGS{Sarr89:Effect, AUTHOR="M. Sarraf", TITLE="Effect of Slot Size on {TDMA} Performance in Presence of Per Slot Overhead", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="604-610 (17.4)", YEAR=1989, REFERENCES=8, KEYWORDS="TDMA; time division multiple access; optimization; analysis", ABSTRACT="In this paper the problem of optimum slot size in Time Division Multiplexing (TDM) scheme in presence of per slot overhead has been addressed. Optimum slot size has been derived as a function of input rate, message length distribution, overhead perslot, and number of stations. It is also shown that how one will be penalized by deviating from this optimum slot size.", } @INPROCEEDINGS{Sarr89:Queueing, AUTHOR="M. Sarraf", TITLE="Queueing Time for the Outbound Call Management System", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=2, PAGES="26.6 (944-948)", YEAR=1989, KEYWORDS="Queueing system; analysis", ABSTRACT="In this paper, the average time to empty a queue, once it is formed, is given, along with the average time the customer at the head of the queue has to wait before he or she gets served.", } @INPROCEEDINGS{Schm89:New, AUTHOR="L. Schmickler and C. Goerg", TITLE="Performance Evaluation of a New {CSMA/CD} Protocol Based on the {SRPT} Principle", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=2, PAGES="26.3 (924-929)", YEAR=1989, REFERENCES=20, KEYWORDS="SRPT; Shortest Remaining Processing Time; LAN; CSMA/CD; simulation", ABSTRACT="In this paper the SRPT principle is applied to the Ethernet LAN using the CSMA/CD access protocol.", } @INPROCEEDINGS{Sen89:Diverse, AUTHOR="S. Sen and R. D. Doverspike and S. I. Vohnout", TITLE="Diverse Routing in the Unified Facilities Optimizer", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="327-330 (9.5)", YEAR=1989, REFERENCES=7, KEYWORDS="Routing; alternate routing; fiber optics; network; design", ABSTRACT="Geographically diverse routing is essential for robust network design. We discuss an algorithm that will provide a priimary route and a geographically diverse protection route. The focus is on optical fiber networks, and our development is in the context of the framework provided by the Unified Facilities Optimizer.", } @INPROCEEDINGS{Wang89:Stability, AUTHOR="Stephen Wang and J. A. Silvester", TITLE="Stability of heterogeneous slotted {ALOHA} networks", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="267-271 (8.1)", YEAR=1989, REFERENCES=16, KEYWORDS="Slotted ALOHA; stability; analysis; throughput; delay", ABSTRACT="In this paper, the previoulsy reported approximate steady state iterative model is used for stability analysis of arbitrary slotted ALOHA networks. The model accomodates various buffer capacity assumptions and ALOHA transmission protocol variants. The stability analysis of the approximate model is validated by comparision to exact analyses for simple networks.", } @ARTICLE{Evan89:Mathematical, AUTHOR="Steve Evans", TITLE="A Mathematical Model and Related Problems of Optimal Management and Design in a Broadband Integrated Services Network", JOURNAL="Journal of the Australian Mathematical Society, Series B", VOLUME=31, NUMBER=2, PAGES="150-175", YEAR=1989, REFERENCES=19, KEYWORDS="BISDN; ATM; connection admission control; analysis; performance evaluation; virtual path", } @INPROCEEDINGS{Gihr89:Fairness, AUTHOR="O. Gihr", TITLE="The Fairness Issue in High Speed Local Area Networks", BOOKTITLE="4th Australian Teletraffic Research Seminar", ADDRESS="Bond", YEAR=1989, REFERENCES=16, KEYWORDS="Performance evaluation; DQDB; simulation; heavy load; fairness", ABSTRACT="With the development of high speed lans, the question of a fair sharing of the bandwidth among staions arose. As the distances between stations are widened, propagation delays also increase. The meadia access protocol bases therefore its decisions on information of the state of other stations which has been altered meanwhile. This paper discusses the fairness issue and uses simulation to investigate the behavior of dqdb under overload and norma", } @INPROCEEDINGS{Liro89:Cognitive, AUTHOR="Y. Lirov and S. Ravikumar and D. S. Clair and O. Yue", TITLE="Cognitive diagnostic expert system for circuit pack troubleshooting", BOOKTITLE="3rd International Conference Expert Systems Leading Edge in Production and Operations Management", ADDRESS="Hilton Head", PAGES="667-674", YEAR=1989, REFERENCES=8, KEYWORDS="Expert system; error analysis; C programming language; PROLOG", ABSTRACT="CODES is a semi-automatic diagnostic tool for trougleshooting decircuit packs. It suggest the best tests to perform to determinecause of defect by consulting a database of circuit pack informaand testing procedures.", } @INPROCEEDINGS{Wong89:Throughput, AUTHOR="J. W. Wong", TITLE="Throughput of {DQDB} under Heavy Load", BOOKTITLE=efoc, ADDRESS="Amsterdam", YEAR=1989, REFERENCES=5, KEYWORDS="Performance evaluation; heavy load; DQDB; fairness", ABSTRACT="The throughput performance of the DQDB media access protocol is investigated. We focus on the behavior of this protocol when thenetwork is under heavy load, i.e., when the data queues of all active stations are never empty. The station throughputs for the case of two active stations are derived analytically. Simulation is used when the number of active stations is larger. The results show that there is a throughput discrepancy among stations.", } @BOOK{Stol89:Test, AUTHOR="W. Stoll", TITLE="Test von {OSI-Protokollen}", ISBN="3-540-518224-X", PUBLISHER="Springer-Verlag", ADDRESS="Berlin", YEAR=1989, LANGUAGE="German", KEYWORDS="Communication network; standardization; protocol performance; protocol testing", ABSTRACT="Automatische Generierung von Testdaten; Das Karlsruher Testsystem; TRANS-CHECK-Verfahren; Teststrategie; Testsequenzen für den Automaten; Zeitliche Abfolge der Testausfürung; Automaten", } @ARTICLE{Luca89:Single, AUTHOR="David M. Lucantoni and K. S. Meier-Hellstern and M. F. Neuts", TITLE="A Single-Server Queue with Server Vacations and a Class of non-renewal Arrival Processes", JOURNAL=aap, VOLUME=22, NUMBER=1, PAGES="676-705", YEAR=1989, REFERENCES=29, KEYWORDS="MAP/G/1; server vacation; performance evaluation; analysis; matrix analytic method", } @ARTICLE{Obar89:Efficient, AUTHOR="H. Obara and Tetsujiro Yasushi", TITLE="An Efficient Contention Resolution Algorithm for Input Queueing {ATM} Cross-Connect Switches", JOURNAL=dacs, VOLUME=2, NUMBER=4, PAGES="261-267", YEAR=1989, REFERENCES=13, KEYWORDS="ATM; switching block; input buffer; architecture; arbitration; scheduling; performance evaluation; analysis; cross connect; Batcher-Banyan", ABSTRACT="This paper describes an efficient contention resolution algo- rithm and its distributed implementation for large capacity input queueing cross-connect switches, which will establish virtual paths in future broadband ATM networks. The proposed algorithm achieves a maximum throughput of 76\%.", } @ARTICLE{Wull89:Comparison, AUTHOR="R. Wulleman and T. Van Landegem", TITLE="Comparison of {ATM} Switching Architectures", JOURNAL=dacs, VOLUME=2, NUMBER=4, PAGES="211-225", YEAR=1989, REFERENCES=29, KEYWORDS="ATM; switching; architecture; survey; classification; buffer management", ABSTRACT="In a first step this paper describes alternative switching tech-niques for the basic building block (switching element) of a switching node. A common model architecture of the switching element is drafted. A classification of switching elements described in the literature is derived and the influence on the complexity and pereformance is weighted. In a second step the switching node architecture is further elaborated according to", } @ARTICLE{Bier89:Video, AUTHOR="D. Biere and W. Meurer and T. Kummerow", TITLE="Video-Codec und Endgeräte für das {ISDN-Bildtelefon}", JOURNAL=ntz, ISBN="0027-707X", VOLUME=42, PAGES="136-145", YEAR=1989, LANGUAGE="German", REFERENCES=1, KEYWORDS="Video coding; video telephony; ISDN; hardware; design", } @PHDTHESIS{Geig89:Untersuchung, AUTHOR="U. Geiger", TITLE="Untersuchung der Eigenschaften von Koppelvielfachen als Bausteine in Netzen mit asynchronem Transfer-Modus", SCHOOL="Lehrstuhl für Nachrichten- und Vermittlungstechnik, Universität des Saarlandes, Saarbrücken", ADDRESS="Saarbrücken, Germany", PAGES=142, YEAR=1989, LANGUAGE="German", REFERENCES=44, KEYWORDS="ATM; fast packet switching; switching network; poisson process; M/G/1; stream traffic; service time; service discipline; simulation", } @ARTICLE{Leun89:Operating, AUTHOR="W. H. Leung and Gottfried Luderer", TITLE="The Network Operating System Concept for Future Services", JOURNAL=atttj, PAGES="23-35", YEAR=1989, REFERENCES=9, KEYWORDS="packet switching", } @PHDTHESIS{Mert89:Selection, AUTHOR="M. K. Mertsch", TITLE="On Performance Analysis and Selection Criteria of Random Number generators for Simulations", SCHOOL="Institute for Electronic Systems and Switching University of Dortmund", ADDRESS="Dortmund, Germany", YEAR=1989, KEYWORDS="random number generation; simulation", } @ARTICLE{Ahre89:Avoid, AUTHOR="J. Ahrens", TITLE="How to avoid logarithms in comparisons with uniform random variables", JOURNAL=comp, VOLUME=41, PAGES="163-166", NOTE="Fascicle 1-2", YEAR=1989, KEYWORDS="random variate generation", } @ARTICLE{Ahre89:Alias, AUTHOR="J. Ahrens and U. Dieter", TITLE="An alias method for sampling from the normal distribution", JOURNAL=comp, VOLUME=42, PAGES="159-170", NOTE="Fascicle 2", YEAR=1989, KEYWORDS="random variate generation", } @ARTICLE{Akyi89:Central, AUTHOR="Ian Akyildiz and H. von Brand", TITLE="Central server models with multiple job classes, state dependent routing, and rejection blocking", JOURNAL=ieeese, VOLUME="SE-15", NUMBER=10, PAGES="1305-1312", YEAR=1989, KEYWORDS="Queueing network; analysis", } @ARTICLE{Baer89:Signalisiersystem, AUTHOR="M. Baer and W. Zach and U. Bratschi", TITLE="Signalisiersystem {ZZK} Nr.7 besteht Bewährungsprobe im Schweizer Fernmeldenetz", JOURNAL=siemenstr, VOLUME=12, NUMBER=6, PAGES="184-187", YEAR=1989, LANGUAGE="German", KEYWORDS="Signalling; common channel; CCS", } @TECHREPORT{Bolc89:PEPSY, AUTHOR="G. Bolch and H. Jung", TITLE="{PEPSY} -- performance evaluation and prediction system", INSTITUTION="Interner Bericht, Institut für Mathematische Maschinen und Datenverarbeitung, Universität Erlangen", ADDRESS="Erlangen", YEAR=1989, KEYWORDS="Computer tool; performance evaluation", } @ARTICLE{Bosc89:Kommunikationstechnik, AUTHOR="R. Bosch", TITLE="Kommunikationstechnik im {ISDN}", JOURNAL="Bosch Technische Berichte", ADDRESS="Stuttgart", VOLUME=8, NUMBER=6, YEAR=1989, LANGUAGE="German", KEYWORDS="ISDN", } @ARTICLE{Camb89:CCITT, AUTHOR="E. Cambri and M. Smouts", TITLE="{CCITT} No. 7 network as the basis for advanced public network services", JOURNAL=ec, ADDRESS="Paris", VOLUME=63, NUMBER=4, PAGES="306-313", YEAR=1989, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Conw89:Product, AUTHOR="A. E. Conway", TITLE="Product-form and insensitivity in circuit-switched networks with failing links", JOURNAL=pe, VOLUME=9, NUMBER=3, PAGES="209-215", YEAR=1989, KEYWORDS="Queueing network; product form", } @BOOK{Conw89:Queueing, AUTHOR="A. E. Conway and Nicolaos D. Georganas", TITLE="Queueing Networks -- Exact Computational Algorithms: A Unified Theory Based on Decomposition and Aggregation", PUBLISHER="The MIT Press, Cambridge.", YEAR=1989, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Deik89:SIQUEUE, AUTHOR="H. Deike-Glindemann and S. Nolte and G. Rosentreter", TITLE="{SIQUEUE-PET:} Eine Umgebung zur graphischen Modellierung und quantitativen Analyse von Rechensystemen", JOURNAL=aninf, NUMBER=10, PAGES="446-457", YEAR=1989, LANGUAGE="German", KEYWORDS="Computer tool; performance evaluation", } @ARTICLE{Devr89:Random, AUTHOR="L. Devroye", TITLE="On random variate generation when only moments or Fourier coefficients are known", JOURNAL="Mathematics and Computers in Simulation", VOLUME=31, NUMBER="1-2", PAGES="71-89", YEAR=1989, KEYWORDS="random variate generation", } @ARTICLE{Drig89:Dienste, AUTHOR="R. Drignath and R. Gruner", TITLE="Dienste und ihre Anwendungen in einem Intelligenten Netz", JOURNAL=ntz, VOLUME=42, NUMBER=10, PAGES="634-637", YEAR=1989, LANGUAGE="German", KEYWORDS="Intelligent network", } @ARTICLE{Ever89:Note, AUTHOR="David Everitt", TITLE="A note on the pseudoconservation laws for cyclic service systems with limited service disciplines", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=7, PAGES="781-783", YEAR=1989, KEYWORDS="Queueing system; cyclic service; analysis", } @ARTICLE{Fren89:ISDN, AUTHOR="K. J. Frensch", TITLE="{ISDN} -- Start in eine neue Kommunikationsära", JOURNAL=siemenstr, VOLUME=12, NUMBER="1-2", PAGES="5-9", YEAR=1989, LANGUAGE="German", KEYWORDS="ISDN", } @ARTICLE{Funk89:SS7, AUTHOR="G. Funke", TITLE="{SS7} -- Ein universelles Zeichengabesystem für heute, morgen, ... übermorgen?", JOURNAL=pkitm, ADDRESS="Nürnberg", NUMBER=3, PAGES="7-16", YEAR=1989, LANGUAGE="German", KEYWORDS="Signalling protocol", } @ARTICLE{Glyn89:Extensions, AUTHOR="P. W. Glynn and W. Whitt", TITLE="Extensions of the queueing relations $L=\lambda {W$} and $H=\lambda {G$}", JOURNAL=or, VOLUME=37, NUMBER=4, PAGES="634-644", YEAR=1989, KEYWORDS="Queueing theory; Little's formula", } @INPROCEEDINGS{Gree89:Solution, AUTHOR="A. G. Greenberg and J. McKenna", TITLE="Solution of closed, product form, queueing networks via the {RECAL} and {Tree-RECAL} methods on a shared memory multiprocessor", BOOKTITLE=sigmetrics, PAGES="127-135", YEAR=1989, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Ishi89:New, AUTHOR="H. Ishikawa", TITLE="New concept in telecommunications network architecture", JOURNAL=nttrev, VOLUME=1, NUMBER=4, PAGES="79-86", YEAR=1989, KEYWORDS="Communication network; ISDN", } @INPROCEEDINGS{Kasc89:Computer, AUTHOR="P. A. Kaschube", TITLE="Computer simulation as a {CCS} network performance analysis and assessment tool (abstract)", BOOKTITLE="National bureau of standards ok II", ADDRESS="Rosemont", VOLUME=43, PAGES=948, YEAR=1989, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Kies89:Simple, AUTHOR="P. C. Kiessler", TITLE="A simple proof of the equivalence of input and output intervals in Jackson networks of single server nodes", JOURNAL=or, VOLUME=37, NUMBER=4, PAGES="645-647", YEAR=1989, KEYWORDS="Queueing network; product form", } @ARTICLE{Koni89:PASTA, AUTHOR="D. König and V. Schmidt", TITLE={On the {"PASTA"} property and a further relationship between customer and time averages in stationary queueing systems}, JOURNAL=comstat, VOLUME=5, NUMBER=2, PAGES="261-272", YEAR=1989, KEYWORDS="Queueing theory; number of elements in system", } @TECHREPORT{Lemp89:Umweltsimulator, AUTHOR="W. Lemppenau", TITLE="Umweltsimulator für den Funktions- und Lasttest von Nachrichtenvermittlungssystemen", TYPE="Bericht über verkehrstheoretische Arbeiten", INSTITUTION="Institut für Nachrichtenverarbeitung und Datenverarbeitung, Universität Stuttgart", ADDRESS="Stuttgart, Germany", NUMBER=47, YEAR=1989, LANGUAGE="German", } @INPROCEEDINGS{Mart89:Signalling, AUTHOR="I. Martin Sancho and R. Casares Gallego", TITLE="Signalling network planning: A pragmatic approach in the Spanish telecommunication network", BOOKTITLE="Networks", ADDRESS="Palma de Mallorca", PAGES="307-312 (12)", YEAR=1989, KEYWORDS="Signalling; common channel; CCS; network planning", } @INPROCEEDINGS{Mors89:GTE, AUTHOR="J. D. Morse", TITLE="{GTE} common channel signaling network reliability analysis", BOOKTITLE="Networks", ADDRESS="Palma de mallorca", PAGES="313-318 (1)", YEAR=1989, KEYWORDS="Signalling; common channel; CCS", } @INCOLLECTION{Ohta89:Engineering, AUTHOR="M. Ohta", TITLE="Engineering of congestion control in a large scale network", BOOKTITLE="Network Planning in the 's", EDITOR="L. Lada", PUBLISHER="Elsevier Science Publishers BV, Amsterdam", PAGES="301-305", YEAR=1989, KEYWORDS="Signalling; common channel; CCS", } @INCOLLECTION{Olmo89:Methodology, AUTHOR="F. Olmos Gomez and M. Perez Marroden and J. Sole Gil", TITLE="Methodology for planning the common channel signalling network", BOOKTITLE="Network Planning in the 's", EDITOR="L. Lada", PUBLISHER="Elsevier Science Publishers BV, Amsterdam", PAGES="293-300", YEAR=1989, KEYWORDS="Signalling; common channel; CCS; network planning", } @ARTICLE{Onvu89:Note, AUTHOR="R. O. Onvural", TITLE="A note on the product form solutions of multiclass closed queueing networks with blocking", JOURNAL=pe, VOLUME=10, NUMBER=3, PAGES="247-253", YEAR=1989, KEYWORDS="Queueing network; analysis", } @ARTICLE{Onvu8902:Equivalencies, AUTHOR="R. O. Onvural and Harry Perros", TITLE="Some equivalencies between closed queueing networks with blocking.", JOURNAL=pe, VOLUME=9, NUMBER=2, PAGES="111-118", YEAR=1989, KEYWORDS="Queueing network; analysis", } @ARTICLE{Onvu89:Approximate, AUTHOR="R. O. Onvural and Harry Perros", TITLE="Approximate throughput analysis of cyclic queueing networks with finite buffers", JOURNAL=ieeese, VOLUME="SE-15", NUMBER=6, PAGES="800-808", YEAR=1989, KEYWORDS="Queueing network; analysis", } @BOOK{Pres89:Numerical, AUTHOR="William H. Press and Brian P. Flannery and Saul A. Teukolsky and William T. Vetterling", TITLE="Numerical Recipes in Pascal: The Art of Scientific Computing", PUBLISHER="Cambridge University Press", ADDRESS="Cambridge", YEAR=1989, KEYWORDS="Numerical method; Numerical software", } @ARTICLE{Segu89:DPC700, AUTHOR="J. Seguret and J. Lamy and M. Lapierre", TITLE="{DPC700} signaling transfer points and deployment of common channel signaling No. 7 networks", JOURNAL="Commutation and transmission", VOLUME=11, NUMBER=2, PAGES="23-34", YEAR=1989, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Sezg89:Discussion, AUTHOR="F. Sezgin", TITLE="Discussion of {[L-ECUYER} 1988]", JOURNAL=cacm, VOLUME=32, NUMBER=8, PAGES="1019-1020", YEAR=1989, KEYWORDS="random number generation", } @ARTICLE{Toss89:Ebene, AUTHOR="R. Tosse", TITLE="Ebene-2-Baugruppen für das Zeichengabesystem Nr. 7 mit Einchipmikrorechner", JOURNAL=nte, VOLUME=39, NUMBER=8, PAGES="296-298", YEAR=1989, LANGUAGE="German", KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Dijk89:Simple, AUTHOR="N. van Dijk", TITLE="A simple throughput bound for large closed queueing networks with finite capacities", JOURNAL=pe, VOLUME=10, NUMBER=3, PAGES="153-167", YEAR=1989, KEYWORDS="Queueing network; analysis", } @ARTICLE{Whit8911:Interpolation, AUTHOR="W. Whitt", TITLE="An interpolation approximation for the mean workload in a {GI/G/1} queue", JOURNAL=or, VOLUME=37, NUMBER=6, PAGES="936-952", MONTH="November/December", YEAR=1989, KEYWORDS="Queueing theory; number of elements in system", } @TECHREPORT{Cido89:Distributed, AUTHOR="I. Cidon and Y. Ofek", TITLE="Distributed Fairness algorithms for Local Area Networks with Concurrent Transmissions", INSTITUTION="IBM Research Division, T. J. Watson Research Center", ADDRESS="Yorktown Heights, New York", NUMBER=15051, PAGES=24, YEAR=1989, REFERENCES=11, KEYWORDS="Fairness; LAN; MAN; HSLAN; ring network", ABSTRACT="In this work, it is shown how multiple nodes can access a ring network concurrently in a fair manner. Traditionally, most ring and bus networks allow only a single user to transmit at any given time (e.g., token ring, Ethernet, DQDB). Concurrent access or spatial bandwidth reuse enables the simultaneous transmissions over disjoint segments of a bi-directional ring, and therefore, can significantly increase the effective throughput, by a factor of four or more. Spatial bandwidth reuse can be easily implemented using a full-duplex buffer insertion or slotted techniques. However, these techniques may also cause starvation and thus has an inherent fairness problem. Two types of fairness algorithms are presented, global and local; both are shown to be stable and fault tolerant. The global fairness mechanism provides a complete fairness and is immune to control messages loss or duplication. This global algorithm views the whole ring as a single resource, while the local fairness algorithm views the ring as multiple disjoint resources. The local fairness mechanism is triggered only if potential starvation exists and is usually restricted only to segments of interfering nodes. If the segment of the interfering nodes covers the whole ring, we show that the local mechanism is equivalent to the global one. The combination of a full-duplex buffer insertion ring, spatial reuse, reliable fairness mechanism, and the exploitation of the recent advent in fiber-optic technology are the basis for the MetaRing network architecture. This network is currently being prototyped at the IBM T.J. Watson Research Center.", } @INPROCEEDINGS{Eng89:Multi, AUTHOR="K. Y. Eng and M. Santoro", TITLE="Multi-Gb/s Optical Cross-Connect Switch Architectures: {TDM} versus {FDM} Techniques", BOOKTITLE=globecom, YEAR=1989, KEYWORDS="FDMA; frequency division multiple access; optical LAN; wdm=wavelength division multiplex; TDM; time division multiplex; star network", } @MISC{Horv89:FDVDI, AUTHOR="S. Horvath and G. Mityko and G. Crauwels", TITLE="{FDVDI}", PUBLISHER="Presentation to ANSI X3T9.5, December 6-7, 1989", PAGES=32, YEAR=1989, KEYWORDS="Fddi; access protocol; LAN; MAN; hslan", ABSTRACT="A new MAC protocol for isochronous and asynchronous connections is presented. The protocol called Fiber Distributed Video/Voice Data Interface (FDVDI) is designed for ATM and as FDDI follow on.", } @ARTICLE{Liew89:Three, AUTHOR="S. C. Liew and K. W. Lu", TITLE="A Three-Stage Architecture for Very Large Packet Switches", JOURNAL=dacs, VOLUME=2, NUMBER=4, PAGES="303-316", YEAR=1989, REFERENCES=14, KEYWORDS="ATM; Fast packet switching; switching network; architecture; nput buffer; output buffer; batcher-banyan", ABSTRACT="The paper proposes a 3-stage broadband packet switch architec- ture with more than 16000 ports for a future central office. Theswitch is constructed by interconnecting many independent switchmodules of small size which can be implemented using modifications of various well studied switch fabric designs. Multiple paths are provided for each input/output pair, and the techniqueof channel grouping is used to decrease delay and increase.", } @ARTICLE{Moll89:Metropolitan, AUTHOR="J. F. Mollenauer", TITLE="Metropolitan area network update: The global {LAN} is getting closer", JOURNAL=datacommunications, PAGES="109-118", YEAR=1989, REFERENCES=1, KEYWORDS="Man; lan", ABSTRACT="This paper presents the roll of MANs in the communications area.", } @MASTERSTHESIS{Zipp89:Aufbau, AUTHOR="H.-G. Zipperer", TITLE="Aufbau und Betrieb eines Verbindungsnetzwerks zur dynamischen Erzeugung von Transputer-Topologien", SCHOOL="Diplomarbeit Nr. 632 am Institut für Informatik Universität Stuttgart", ADDRESS="Stuttgart, Germany", PAGES=60, YEAR=1989, REFERENCES=7, KEYWORDS="Transputer; distributed processing; network topology", ABSTRACT="Hardware and software of a transputer board for a PC are described", } @TECHREPORT{Dama89:Fast, AUTHOR="Spiridon Damaskos and Dinesh Verma", TITLE="Fast Establishment of Real-Time Channels", TYPE="Technical Report", INSTITUTION="UC Berkeley", PAGES="1-10", YEAR=1989, KEYWORDS="realtime traffic prioritization deterministic channels packet delay channel establishment", ABSTRACT="A real-time channel [Fer89a] is a simplex connection between two nodes characterized by parameters representing the performance requirements of the client. In this paper, we consider fast establishment of real-time channels, i.e., data can be sent on a real-time channel without waiting for a connection establishment to be confirmed by the destination. [Fer89a] Real-Time Communication in Packet-Switching Wide-Area Networks, Ferrari, Domenico, Tech Report TR-89-022, International Computer Science Institute, Berkeley, June 1989 (Available via anonymous ftp to icsi-ftp.Berkeley.EDU as /pub/techreports/1992/tr-92-001.ps.Z)", URL="ftp://tenet.berkeley.edu/DamVer89a.ps", } @BOOK{Watk89:Art, AUTHOR="John Watkinson", TITLE="The art of digital audio", ISBN="0-240-51270-1", PUBLISHER="Focal Press", PAGES="503 pages", YEAR=1989, KEYWORDS="book; audio; digital sound recording", ABSTRACT="1: Why Digital?, 1.1: The advantages of digital audio, 1.2: The opportunities, 1.3: Some typical machines outlined, 1.4: Disadvantages, Further reading; 2 Conversion, 2.1 Types of digitization, 2.2 Information content of audio, 2.3 Sampling and aliasing, 2.4 Quantizing, 2.5 Filter design, 2.6 Choice of sampling rate, 2.7 Basic digital-to-analog conversion, 2.8 Basic analog-to-digital conversion, 2.9 Imperfections of converters, 2.10 Oversampling theory, 2.11 An oversampling DAC, 2.12 Oversampling ADCs, 2.13 Spectral Coding; 3 Digital audio coding and processing, 3.1 Introduction to logic, 3.2 Binary codes, 3.3 Binary adding, 3.4 Level metering, 3.5 Gain control, 3.6 Digital filter, 3.7 Mixing and crossfading, 3.8 Companding, 3.9 Timebase correction, 3.10 RAM timebase correction, 3.11 FIFO timebase correction; 4 Advanced digital audio processing, 4.1 Phase linearity, 4.2 Transforms and convolution, 4.3 FIR and IIR filters compared, 4.4 FIR filters, 4.5 IIR filters , 4.6 The z-transform, 4.7 Bandpass filters, 4.8 Higher order filters; cascading, 4.9 Pole/zero positions, 4.10 The need for sampling-rate conversion, 4.11 Categories of rate conversion , 4.12 Integer ratio conversion, 4.13 Fractional-ratio conversion, 4.14 Variable-ratio conversion, 4.15 Structure of digital mixing desks, 4.16 Effects; 5 Digital audio interconnects, 5.1 PCM-F1 interconnect, 5.2 PCM-1610 interconnect, 5.3 PCM-3324 interconnect, 5.4 Melco interconnect, 5.5 AES/EBU interconnect, 5.6 Parallel interfacing, 5.7 MADI - multi-channel audio digital interface, 5.8 MADI data transmission, 5.9 MADI frame structure, 5.10 MADI audio channel format, 5.11 Fibre-optic interfacing, 5.12 Synchronizing, 5.13 Introduction to NICAM 728, 5.14 NICAM 728 frame structure, 5.15 The NICAM sound/data block, 5.16 Companding, scaling, and parity; 6 Digital recording and channel coding, 6.1 Channel SNR and tape consumption, 6.2 Head noise and head to tape speed, 6.3 Basic digital recording, 6.4 Jitter windows, 6.5 Shortcomings of the channel, 6.6 Simple codes, 6.7 Group codes, 6.8 Convolutional RLL codes, 6.9 Randomized NRZ, 6.10 Partial response, 6.11 Graceful degradation, 6.12 Synchronizing References; 7 Error correction, 7.1 Sensitivity of messages to error, 7.2 Error mechanisms, 7.3 Interpolation, 7.4 Error handling, 7.5 Parity, 7.6 Wyner-Ash code, 7.7 Crossword code, 7.8 Hamming code, 7.9 Hamming distance, 7.10 Cyclic codes, 7.11 Burst correction, 7.12 Fire code, 7.13 B-adjacent code, 7.14 Reed-Solomon code, 7.15 Interleaving, 7.16 Crossinterleaving, 7.17 Practical examples, 7.18 Editing interleaved recordings; 8 Rotary head recorders, 8.1 Use of video recorders, 8.2 Pseudo", } @MISC{Auer89:Research, AUTHOR="Joshua Auerbach", TITLE="Research Report: A Protocol Conversion Toolkit", ORGANIZATION="IBM", YEAR=1989, } @ARTICLE{Bott89:Rationale, AUTHOR="J. H. Botterill", TITLE="Design Rationale of the {AS/400} User Interface", JOURNAL=ibmsj, VOLUME=28, NUMBER=3, PAGES="443-464", YEAR=1989, } @ARTICLE{Char89:Application, AUTHOR="D. A. Charland", TITLE="The Application System/400 Help Facility -- Design Philisophy and Considerations", JOURNAL=ibmsj, VOLUME=28, NUMBER=3, PAGES="424-442", YEAR=1989, } @ARTICLE{Clar89:Application, AUTHOR="B. E. Clark and M. J. Corrigan", TITLE="Application System/400 Performance Characteristics", JOURNAL=ibmsj, VOLUME=28, NUMBER=3, PAGES="407-423", YEAR=1989, } @ARTICLE{dAri89:Message, AUTHOR="L. d'Arielli", TITLE="A Message Management System for Personal Computers", JOURNAL=ibmsj, VOLUME=28, NUMBER=3, PAGES="479-493", YEAR=1989, } @INPROCEEDINGS{Gass89:Digital, AUTHOR="M. Gasser and others", TITLE="The Digital Distributed System Security Architecture", BOOKTITLE="National Computer Security Conference", YEAR=1989, } @INCOLLECTION{Gunt89:Path, AUTHOR="N. Gunther", TITLE="Path Integral Methods for Computer Performance Analysis", BOOKTITLE="Information Processing Letters 32", PUBLISHER="Elsevier Science Publishers", PAGES="7-13", YEAR=1989, } @TECHREPORT{ISO89:OSI, AUTHOR="I. S. O", TITLE="{OSI} Routeing Framework", TYPE="ISO/TR", INSTITUTION="International Standards Organization", NUMBER=9575, YEAR=1989, } @TECHREPORT{Juen89:Integrity, AUTHOR="R. R. Jueneman", TITLE="Integrity Controls for Military and Commerial Applications, {II}", INSTITUTION="Computer Sciences Corporation", NUMBER="CSC/PR-89/3001", NOTE="Invitational Workshop on Data Integrity, 1/25-27/89", YEAR=1989, } @MISC{Ludw89:Special, AUTHOR="L. F. Ludwig", TITLE="Special {UITF} Working Group for {NRI}", ORGANIZATION="Bellcore", YEAR=1989, } @INPROCEEDINGS{Mank89:Limiting, AUTHOR="A. Mankin and Ken Thompson", TITLE="Limiting Factors in the Performance of the Slow-start {TCP} Algorithms", BOOKTITLE=usenixw, PAGES="219-228", YEAR=1989, } @ARTICLE{Pine89:Test, AUTHOR="II Pine", TITLE="Design, Test and Validation of the Application System/400 through Early User Involvement", JOURNAL=ibmsj, VOLUME=28, NUMBER=3, PAGES="376-385", YEAR=1989, } @ARTICLE{Schl89:System, AUTHOR="D. L. Schleicher and R. W. Taylor", TITLE="System Overview of the Application System/400", JOURNAL=ibmsj, VOLUME=28, NUMBER=3, PAGES="360-375", YEAR=1989, } @ARTICLE{Shu89:Visual, AUTHOR="N. C. Shu", TITLE="Visual Programming: Perspectives and Approches", JOURNAL=ibmsj, VOLUME=28, NUMBER=4, PAGES="525-568", YEAR=1989, } @ARTICLE{Sula89:New, AUTHOR="R. A. Sulack and R. J. Lindner and D. N. Dietz", TITLE="A New Development Rhythm of {AS/400} Software", JOURNAL=ibmsj, VOLUME=28, NUMBER=3, PAGES="386-406", YEAR=1989, } @ARTICLE{Summ89:Local, AUTHOR="R. C. Summers", TITLE="Local-Area Distributed Systems", JOURNAL=ibmsj, VOLUME=28, NUMBER=2, PAGES="227-240", YEAR=1989, } @ARTICLE{Dyke89:Object, AUTHOR="R. P. Ten Dyke and C. J. Kunz", TITLE="Object-Oriented Programming", JOURNAL=ibmsj, VOLUME=28, NUMBER=3, PAGES="465-478", YEAR=1989, } @MANUAL{Lond89:Research, AUTHOR="University College London", TITLE="Research in Computer Science 1988/1989", INSTITUTION="University College London", NUMBER="TR 164", YEAR=1989, } @ARTICLE{Burg89:Management, AUTHOR="J. L. Burgin", TITLE="Management of Capacity and Control in Broadband {ISDN}", JOURNAL=dacs, VOLUME=2, PAGES="155-165", YEAR=1989, } @ARTICLE{Brya8901:Fast, AUTHOR="J. Bryant", TITLE="A fast classifier for image data", JOURNAL=pattern, VOLUME=22, NUMBER=1, PAGES="45-48", YEAR=1989, ABSTRACT="A technique for nearest neighbour classification is described which is approximately three times as fast as the usula method. Although the new classifier was developed specifically for image data, tests on simulated random data show a significant improvement can be achieved using periodic reordering of class attractors.", } @ARTICLE{Dunc8901:Relaxation, AUTHOR="J. S. Duncan and W. Frei", TITLE="Relaxation labeling using continuous label sets", JOURNAL="Pattern recognition Letters", VOLUME=9, NUMBER=1, PAGES="27-37", YEAR=1989, ABSTRACT="An approach to relaxation labeling is presented that considers problems where the label are members of continuous sets, implying a natural ordering that permits computational efficiency and algorithm implementation using simple modular circuit elements.", } @BOOK{Pool89:Study, AUTHOR="I. Poole and Daniel B. Long and G. P. Otto", TITLE="A study of the theoretical limits of probabilistic relaxation labeling", PUBLISHER="Dept. Computer Science, University College London", NOTE="Research Note RN/89/22", YEAR=1989, ABSTRACT="The fundamental limits of excellence for any Probabilistic Relaxation Labeling scheme have been investigated for 1D Markov chains. The principal result is that {\em no\/} scheme exists which will generate probabilities whose conditioning region grows by one window width at each iteration. It is also shown that an optimal scheme requires a sequence of iteration specific updating functions, and that these functions will depend on the class-conditional data distributions. The possibility of extending these results to the 2-D case is discussed.", } @TECHREPORT{Mogu89:Simple, AUTHOR="J. C. Mogul", TITLE="Simple and Flexible Daragram Access Controls for Unix based Gateways", TYPE="Research Report", INSTITUTION="DEC WRL", PUBLISHER="December", NUMBER="89/4", YEAR=1989, } @INCOLLECTION{Spec89:Distributed, AUTHOR="A. Z. Spector", TITLE="Distributed Transaction Processing Facilities", BOOKTITLE="Distributed Systems", EDITOR="Sape Mullender", PUBLISHER="ACM Press", PAGES="191-214", YEAR=1989, KEYWORDS="Concurrency control recovery", } @INCOLLECTION{Weih89:Using, AUTHOR="William Edward Weihl", TITLE="Using Transactions in Distributed Applications", BOOKTITLE="Distributed Systems", EDITOR="Sape Mullender", PUBLISHER="ACM Press", PAGES="215-235", YEAR=1989, KEYWORDS="Concurrency control recovery", } @INCOLLECTION{Birm89:Exploiting, AUTHOR="K. Birman and T. A. Joseph", TITLE="Exploiting Replication in Distributed Systems", BOOKTITLE="Distributed Systems", EDITOR="Sape Mullender", PUBLISHER="ACM Press", PAGES="319-367", YEAR=1989, KEYWORDS="Concurrency control recovery", } @BOOK{Youn89:Technical, AUTHOR="M. Young", TITLE="The Technical Writer's Handbook", PUBLISHER="University Science", ADDRESS="Mill Valley, California", YEAR=1989, KEYWORDS="electronic publishing; writing", } @TECHREPORT{Muel89:European, AUTHOR="Guenter Mueller and L. Mackert", TITLE="European Networking Center, Annual Report 1989", TYPE="Annual Report", INSTITUTION="IBM European Networking Center", ADDRESS="Heidelberg, Germany", NUMBER="43.9007", YEAR=1989, KEYWORDS="ENC; IBM; DIME; OVID; DACNOS; PODA-2; EARN; RACE; ESPRIT", ABSTRACT="This annual report describes the research and prototyping work at ENC. All activities are of a long term nature and were designed and initiated in conjunction with our partners throughout Europe. Though IBM's commitment to the research areas described in this report is apparent the activities at ENC do not express or imply any statement on the company's products or future announcements.", } @INPROCEEDINGS{Shib89:End, AUTHOR="Yoshitaka Shibata and Judith H. Irven", TITLE="The End-to-End Performance of Multimedia Information Services: Data Analysis and Simulation", BOOKTITLE="Twenty-2nd Annual Hawaii International Conference on System Sciences", EDITOR="Bruce D. Shriver", ADDRESS="Hawaii, Hawaii", VOLUME=2, PAGES="838-847", YEAR=1989, KEYWORDS="multimedia", ABSTRACT="In this paper the end-to-end performance of a general multimedia information retrieval service, operating across a local area network (LAN) using the TCP/IP packet protocols, is evaluated for various message sizes representative of full-color and gray-scale images, and a typical text article. The end-to-end performance, as seen by the user, must take into account not only transmission network, but also the hardware and software components of the source and user terminals, plus the total number of users requesting service at one time. First several parameters of each component are precisely analyzed using measurements and decomposition method; these are then used in a queueing model for computer simulation. Also we are able to verify and tune this simulation model by comparing its results with actual measurements taken on a laboratory prototype. Then, by varying component parameters in the model and observing the effect on the overall performance, we can quantify the effects of many critical parameters, including the network transmission speed, CPU power of the source and user computers, disk I/O speed access time, the packet size and window size of the upper protocol layers, the user ``think time'' and background traffic on the network. Finally, we use the model to predict future system performance which may be anticipated as next generation components evolve.", } @TECHREPORT{Bowm89:Univers, AUTHOR="Mic Bowman and L. L. Peterson and Andrey Yeatts", TITLE="Univers: An Attribute-Based Name Server", INSTITUTION="University of Arizona", YEAR=1989, } @ARTICLE{Bowm8904:Univers, AUTHOR="Mic Bowman and L. L. Peterson and Andrey Yeatts", TITLE="Univers: An Attribute-Based Name Server", JOURNAL=spe, VOLUME=20, NUMBER=4, PAGES="403-424", YEAR=1989, } @TECHREPORT{Livn89:Modular, AUTHOR="M. Livny", TITLE="Modular Simulation DeNet", INSTITUTION="University of Wisconsin, Madison", YEAR=1989, } @BOOK{Ewer89:Visuomotor, TITLE="Visuomotor Coordination: Amphibians, Comparisons, Models, and Robots", EDITOR="J.-P. Ewert and M. A. Arbib", PUBLISHER="Plenum", YEAR=1989, } @TECHREPORT{Cace89:Measurements, AUTHOR="R. Caceres", TITLE="Measurements of Wide-Area {Internet} Traffic", INSTITUTION="University of California, Berkeley", YEAR=1989, } @ARTICLE{Fuji8902:Measurements, AUTHOR="R. M. Fujimoto", TITLE="Performance Measurements of Distributed Simulation Strategies", JOURNAL="Transactions of The society for Computer Simulation", PUBLISHER="The Society for Computer Simulation", VOLUME=6, NUMBER=2, PAGES="89-132", YEAR=1989, } @TECHREPORT{Heyb89:Netsim, AUTHOR="A. T. Heybey", TITLE="Netsim Manual", INSTITUTION="MIT", YEAR=1989, } @INPROCEEDINGS{Bako89:IBM, AUTHOR="H. B. Bakoglu and others", TITLE="{IBM} Second generation {RISC} machine organization", BOOKTITLE=icc, PAGES="133-149", YEAR=1989, } @ARTICLE{Lync8903:Project, AUTHOR="Anne Lynch", TITLE="Project Jefferson and the development of research skills", JOURNAL="Reference Services Review", VOLUME=17, NUMBER=3, PAGES="91-97", YEAR=1989, } @INCOLLECTION{Bran89:RP3, AUTHOR="W. C. Brantley and K. P. McAuliffe and T. A. Ngo", TITLE="{RP3} Performance Monitoring Hardware", BOOKTITLE="Instrumentation for Future Parallel Computing Systems", EDITOR="M. Simmons and R. Koskela and I. Bucher", PUBLISHER="ACM Press", ADDRESS="New York", PAGES="35-48", YEAR=1989, } @INCOLLECTION{Malo89:Multiprocessor, AUTHOR="Allen D. Malony", TITLE="Multiprocessor instrumentation: approaches for Cedar", BOOKTITLE="Instrumentation for Future Parallel Computing Systems", EDITOR="M. Simmons and R. Koskela and I. Bucher", PUBLISHER="ACM Press", ADDRESS="New York", PAGES="1-34", YEAR=1989, } @TECHREPORT{Wall89:Link, AUTHOR="David W. Wall", TITLE="Link Time Code Modification", TYPE="Research Report", INSTITUTION="DECWRL", NUMBER="89/17", YEAR=1989, } @BOOK{Akl89:Parallel, AUTHOR="S. Akl", TITLE="The design and analysis of parallel algorithms", PUBLISHER="Prentice Hall", YEAR=1989, } @INPROCEEDINGS{Jone89:Experience, AUTHOR="Doug Jones and Chien-Chun Chou and Debra Renk and S. C. Bruell", TITLE="Experience with Concurrent Simulation", BOOKTITLE=wsc, PAGES="756-764", YEAR=1989, } @ARTICLE{Jone8901:Concurrent, AUTHOR="Doug Jones", TITLE="Concurrent Operations on Priority Queues", JOURNAL=cacm, VOLUME=32, NUMBER=1, PAGES="132-137", YEAR=1989, } @ARTICLE{Luba8901:Efficient, AUTHOR="B. D. Lubachevsky", TITLE="Efficient Distributed Event-Driven Simulations of Multiple-Loop Networks", JOURNAL=cacm, VOLUME=32, NUMBER=1, PAGES="111-123", YEAR=1989, } @INPROCEEDINGS{Reyn89:Spectrum, AUTHOR="P. F. Reynolds", TITLE="A spectrum of options for parallel simulation", BOOKTITLE=wsc, PAGES="325-332", YEAR=1989, } @TECHREPORT{Know89:System, AUTHOR="Who Knows", TITLE="System Reference: System Calls and C Library Routines", INSTITUTION={{"}Alliant Computer Systems Corporation}, YEAR=1989, } @ARTICLE{Chad89:Conditional, AUTHOR="K. M. Chadny and R. H. Sherman", TITLE="The conditional event approach to distributed simulation", JOURNAL=distsim, PAGES="93-99", YEAR=1989, } @ARTICLE{Ayan89:Parallel, AUTHOR="R. Ayani", TITLE="A parallel simulation scheme based on distances between objects", JOURNAL=distsim, PAGES="113-118", YEAR=1989, } @ARTICLE{Prei89:Yaddes, AUTHOR="B. R. Preiss", TITLE="The Yaddes distributed discrete event simulation specification and execution environment", JOURNAL=distsim, PAGES="139-144", YEAR=1989, } @ARTICLE{Ande89:Spin, AUTHOR="Thomas Anderson", TITLE="The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors", JOURNAL=ieeepds, YEAR=1989, } @INPROCEEDINGS{Blum89:Designing, AUTHOR="M. Blum and Sampath Kannan", TITLE="Designing Programs that Check Their Work", BOOKTITLE="21st ACM STOC", PAGES="86-97", YEAR=1989, } @ARTICLE{Bolo89:Simple, AUTHOR="W. Bolosky and R. Fitzgerald and M. Scott", TITLE="Simple but effective techniques for {NUMA} memory management", JOURNAL=acmosrev, ADDRESS="Litchfield Park", VOLUME=23, NUMBER=5, PAGES="19-31", YEAR=1989, } @INPROCEEDINGS{Sato89:TENT, AUTHOR="F. Sato and others", TITLE="{TENT} - Test Sequence Generation Tool for Communication Systems", BOOKTITLE="FORTE II", PAGES="1-5", YEAR=1989, } @PROCEEDINGS{89:2th, TITLE="2th {IFIP} {WG6.1} Intern. Workshop on Protocol Test Systems, Berlin, {F.R.G.}", BOOKTITLE="2th IFIP WG6.1 International Workshop on Protocol Test Systems, Berlin, F.R.G.", EDITOR="J. de Meer and L. Mackert and W. Effelsberg", SERIES="IFIP Transactions", PUBLISHER="North-Holland", YEAR=1989, } @INPROCEEDINGS{Nord89:SPIMS, AUTHOR="Erik Nordmark and P. Gunningberg", TITLE="{SPIMS:} A Tool for Protocol Implementation Performance Measurements", BOOKTITLE=lcn, ADDRESS="Minneapolis, Minnesota", PAGES="222-229", YEAR=1989, } @PROCEEDINGS{Brin89:9th, TITLE="9th Intern. Symposium on Protocol Specification, Testing and Verification, Enschede, The Netherlands", BOOKTITLE="9th International Symposium on Protocol Specification, Testing and Verification, Enschede, The Netherlands", EDITOR="E. Brinksma and G. Scollo and C. A. Vissers", SERIES="IFIP Transactions", PUBLISHER="North-Holland", YEAR=1989, } @INPROCEEDINGS{Haye89:Signalling, AUTHOR="Ian J. Hayes and M. Mowbray and G. A. Rose", TITLE="Signalling System No. 7, The Network Layer", BOOKTITLE="9th International Symposium on Protocol Specification, Testing and Verification, Enschede, The Netherlands", EDITOR="E. Brinksma and G. Scollo and C. A. Vissers", SERIES="IFIP Transactions", PUBLISHER="North-Holland", PAGES="3-14", YEAR=1989, } @INPROCEEDINGS{Weze89:CO, AUTHOR="C. D. Wezeman", TITLE="The {CO-OP} Method for Compositional Derivation of Conformance Testers", BOOKTITLE="9th International Symposium on Protocol Specification, Testing and Verification, Enschede, The Netherlands", EDITOR="E. Brinksma and G. Scollo and C. A. Vissers", SERIES="IFIP Transactions", PUBLISHER="North-Holland", PAGES="145-160", YEAR=1989, } @INPROCEEDINGS{Tret89:Test, AUTHOR="J. Tretmans", TITLE="Test Case Derivation from {LOTOS} Specifications", BOOKTITLE="Formal Description Techniques", PAGES="345-359", YEAR=1989, } @INPROCEEDINGS{Brms89:TESDL, AUTHOR="L. Brömstrup and D. Hogrefe", TITLE="{TESDL:} Experience with Generating Test Cases from {SDL} Specifications", BOOKTITLE="SDL", PAGES="267-279", YEAR=1989, } @INPROCEEDINGS{Baum89:Test, AUTHOR="B. Baumgarten and A. Giessler and R. Platten", TITLE="Test Derivation from Net Models", BOOKTITLE="9th International Symposium on Protocol Specification, Testing and Verification, Enschede, The Netherlands", EDITOR="E. Brinksma and G. Scollo and C. A. Vissers", SERIES="IFIP Transactions", PUBLISHER="North-Holland", YEAR=1989, } @TECHREPORT{Grea89:Double, AUTHOR="David Greaves", TITLE="The Double-slot Slotted Ring Protocol {(DSR)}", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 89-5", YEAR=1989, URL="ftp://ftp.cam-orl.co.uk:/pub/docs/ORL/tr.89.5.ps.Z", } @TECHREPORT{Hopp89:Multiple, AUTHOR="Andrew Hopper and A. E. Jones and Dimitris Lioupis", TITLE="Multiple vs Wide Shared Bus Multiprocessors", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 89-3", NOTE="Proceedings of the 16th Annual International Symposium of Computer Architecture, May 1989, Jerusalem, Israel. pp.300-306. Reprinted in 'Cache and Interconnect Architectures in Multiprocessors', Kluwer Academic Publishers, 1990", YEAR=1989, ABSTRACT="In this paper, we compare the simulated performance of a family of multiprocessor architectures based on a global shared memory. The processors are connected to the memory through caches that snoop on or more shared buses in a crossbar arrangement. We have simulated a number of configurations in order to assess the relative performance of multiple versus wide bus machines, with varying amounts of prefetch. Four programs, with widely differing characteristics, were run on each configuration. The configurations that gave the best all-round results were multiple narrow buses with 4 words of prefetch.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.89.3.ps.Z", } @TECHREPORT{Samu89:Applying, AUTHOR="Christer Samuelsson and Manny Rayner", TITLE="Applying Explanation-Based Learning to Natural language Processing (2)", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R89-15", YEAR=1989, ABSTRACT="Explanation-based learning is a technique which attempts to optimize performance of a rule-based system by adding new rules constructed from generalizations of successfully-solved examples. The paper summarizes previous work showing how this idea can be used in natural language processing, and describes experiments in which the EBL method was applied to the CHAT-80 system of Pereira and Warren. In particular, we address the problem of assuring the utility of learning a rule, since the benefit of a learned rule may not outweigh the increased search time incurred in checking its applicability. We show that this problem can be overcome in the NL domain by indexing acquired rules by their lexical constraints, which in general vastly reduces the number of potentially applicable rules. Such an indexing method was implemented and timing studies were made comparing its access speed to that of normal linear search. The indexing scheme required an average access time of 35 - 40 ms independent of the number of learned rules. The results suggest that the overhead of the indexing scheme is small.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--89-15--SE.ps.Z", } @TECHREPORT{Jans89:Finding, AUTHOR="and Manny Rayner", TITLE="Finding out = Achieving Decidability", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R89-16", YEAR=1989, ABSTRACT="We present a framework for reasoning about the concepts of 'knowing what' and 'finding out', in which the key concept is to identify 'finding out the answer to question Q' with 'achieving a situation in which Q is decidable'. We give examples of how the framework can be used to formulate non-trivial problems involving the construction of plans to acquire and use information, and go on to demonstrate that these problems can often be solved by systematic application of a small set of goal-directed backward-chaining rules. In conclusion, it is suggested that systems of this kind are potentially implementable in l-Prolog, a logic programming language based on higher-order logic.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--89-16--SE.ps.Z", } @PHDTHESIS{Ferg89:Application, AUTHOR="Donald F. Ferguson", TITLE="The Application of Microeconomics to the design of resource allocation and control algorithms in Distributed Systems", SCHOOL="Dept. of Computer Science, Columbia University", ADDRESS="New York, New York", YEAR=1989, KEYWORDS="resource allocation; microeconomics", } @BOOK{Hogr89:Estelle, AUTHOR="D. Hogrefe", TITLE="Estelle, {LOTOS} und {SDL} - Standard Spezifikationssprachen für verteilte Systeme", PUBLISHER="Springer Verlag", YEAR=1989, KEYWORDS="Estelle; Lotos; Sdl", } @BOOK{Miln89:Communication, AUTHOR="R. Milner", TITLE="Communication and Concurrency", PUBLISHER="Prentice Hall International", YEAR=1989, KEYWORDS="Ccs", } @BOOK{Tane89:Computer, AUTHOR="A. S. Tanenbaum", TITLE="cn", EDITION="2nd", PUBLISHER="Prentice-Hall International", YEAR=1989, } @ARTICLE{Brad8902:Computing, AUTHOR="R. Braden and David A. Borman and C. Partridge", TITLE="Computing the {Internet} Checksum", JOURNAL=ccr, VOLUME=19, NUMBER=2, PAGES="86-94", YEAR=1989, KEYWORDS="internet; checksum; assembler; TCP; IP", } @INPROCEEDINGS{Abu89:Psi, AUTHOR="H. Abu-Amara and T. Balraj and T. P. Barzilai and Y. Yemini", TITLE="Psi: A Silicon Compiler for very fast protocol processing", BOOKTITLE="Protocols for high-speed Networks", EDITOR="H. Rudin and R. Williamson", ORGANIZATION="{IFIP} WG 6.1/WG 6.4", PUBLISHER="North-Holland", PAGES="181-195", YEAR=1989, KEYWORDS="silicon; vlsi; compiler; hardware; optimize", } @ARTICLE{Chin8905:Statistics, AUTHOR="H. S. Chin and J. W. Goodge and R. Griffiths and D. J. Parish", TITLE="Statistics of video signals for viewphone-type pictures", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=5, PAGES="826-832", YEAR=1989, REFERENCES=12, KEYWORDS="Packet video; ATM; traffic source model; statistics; VBR", } @ARTICLE{Liu8902:Polynomial, AUTHOR="Jia Liu and Kang G. Shin", TITLE="Polynomial Testing of Packet Switching Networks", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=2, PAGES="202-217", YEAR=1989, KEYWORDS="Packet switching; test tool; multistage interconnection network; polynomial testing; shift register sequences", ABSTRACT="A functional testing method called ``polynomial testing'' is proposed to test packet switching networks (PSN`s) used in multiprocessor systems. For the purpose of concreteness, we focus on applying the method to packet switching multistage interconnection networks (PMIN`s). A multiple stuck-at (MSA) fault model is developed first, and then faults are diagnosed at two different levels: ``network level'' and ``switch level''.", } @ARTICLE{Anon902:Bibliography, AUTHOR="Anonymous", TITLE="Bibliography of recent publications on computer communication", JOURNAL=ccr, VOLUME=19, NUMBER=2, PAGES="102-128", YEAR=1989, REFERENCES=300, KEYWORDS="Bibliography; computer communication", } @ARTICLE{Nler89:Planning, AUTHOR="K. N ler", TITLE="Planning and Performance of the {Datex-P} Network", JOURNAL="ITG Kommunikation in verteilten Systemen", ADDRESS="Stuttgart, Germany", PAGES="582-596", YEAR=1989, REFERENCES=3, KEYWORDS="DATEX-P; routing algorithm; packet switching; NETWORK", ABSTRACT="The Deutsche Bundespost introduced its public packet switched data network in 1980. The paper reports on the planning methodology applied to the network with special emphasis of the routing mechanism in use. To illustrate the efictiveness of current planning and management procedures a brief overview of some measured performance criteria is given.", } @INPROCEEDINGS{Sche89:Cut, AUTHOR="R. Schehrer", TITLE="On a cut-off priority queueing system with hysteresis and unlimited waiting room", BOOKTITLE="ITC Specialist Seminar", ADDRESS="Adelaide, Australia", PAGES="7.5 1-8", NOTE="Computer networks and ISDN systems, 20 (1-5), 1990, 45-56", YEAR=1989, REFERENCES=17, KEYWORDS="Queueing system; delay loss model; cut-off priority", ABSTRACT="This paper deals with cut-off priority queuing systems with hysteresis and unlimited waiting room which have shown to be suitable for overload protection. A recursive method as well as an explicit solution is presented for the exact calculation of such systems. Results are shown in examples.", } @ARTICLE{Dijk89:LCFS, AUTHOR="N. van Dijk", TITLE="An {LCFS} Finite Buffer Model with finite Source Batch Input", JOURNAL=aap, ADDRESS="Israel", VOLUME=26, PAGES="372-380", YEAR=1989, REFERENCES=18, KEYWORDS="Queueing system; LIFO; closed-form expression; Normalization constant", } @ARTICLE{Zieg8905:Mechanism, AUTHOR="Chaim Ziegler and Gerald Weiss and E. Friedmann", TITLE="Implementation Mechanism for Packet Switched Voice Conferencing", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=5, PAGES="698-706", YEAR=1989, REFERENCES=18, KEYWORDS="Packet switching; Voice conference; LAN", } @ARTICLE{Arth8906:HYPASS, AUTHOR="E. Arthurs and Matthew S. Goodman and M. P. Vecchi and Haim Kobrinski", TITLE="{HYPASS:} An optoelectronic hybrid packet switching system", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=6, PAGES="645-648", YEAR=1989, REFERENCES=26, KEYWORDS="Fast packet switching; switching block; architecture; arbitration; input buffer; broadband", ABSTRACT="A new architecture is presented for an optoelectronic Hybrid Packet Switching System (HYPASS) for the distribution of multiple bitrate broadband services. HYPASS is based on an input buffered/output controlled arbitration protocol. The internal routing and interconnection utilizes a passive optical transport network with wavelength tunable laser transmitters and fixed wavelength receivers. This single stage multiwavelength ...", } @ARTICLE{May8903:Algorithmen, AUTHOR="F. May", TITLE="Algorithmen und Realisierung eines {ISDN-Bildtelefon-Codecs}", JOURNAL=ntz, ISBN="0027-707X", ADDRESS="Germany", VOLUME=42, NUMBER=3, PAGES="130-133", YEAR=1989, LANGUAGE="German", REFERENCES=9, KEYWORDS="ISDN; video telephony; algorithm; realization; hardware; video coding; image transfer", } @PHDTHESIS{Pick89:Netzknoten, AUTHOR="H.-J. Pick", TITLE="Netzknoten nur mit Direktverbindungen in Netzen mit Asynchronem Transfer-Modus", SCHOOL="Lehrstuhl für Nachrichten- und Vermittlungstechnik, Universität des Saarlandes", ADDRESS="Saarbrücken, Germany", PAGES=204, YEAR=1989, LANGUAGE="German", REFERENCES=79, KEYWORDS="ATM; graph theory; routing algorithm; shufflenet; delay analysis; loss probability; loss calculation; simulation", } @INPROCEEDINGS{Toyo89:Flexible, AUTHOR="Kan Toyoshima and M. Sasagawa and Ikuo Tokizawa", TITLE="Flexible Surveillance Capabilities for {ATM-Based} Transmission Systems", BOOKTITLE=icc, ADDRESS="Boston, Massachusetts", PAGES="699-704", YEAR=1989, REFERENCES=5, KEYWORDS="ATM; virtual path; virtual channel; transmission system", } @ARTICLE{Eage8902: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", YEAR=1989, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Aart8901:Simulated, AUTHOR="Emile Aarts and P. van Laarhoven", TITLE="Simulated annealing: An Introduction", JOURNAL="Statistica neerlandica", ADDRESS="Netherlands", VOLUME=43, NUMBER=1, PAGES="31-52", YEAR=1989, KEYWORDS="combinatorial method; optimization; simulated annealing; travelling salesman problem; TSP", ABSTRACT="Simulated annealing is a general approach for approximately solving large combinatorial optimization problems. The algorithm is based on an intriguing combination of ideas from at first sight completely unrelated fields of science, viz. combinatorial optimization and statistical physics. On the one hand the algorithm can be viewed as an analogue of an algorithm used i", } @ARTICLE{Agni89:Interrelationships, AUTHOR="S. R. Agnihothri", TITLE="Interrelationships between Performance Measures for the Machine-Repairman Problem", JOURNAL=navres, VOLUME=36, PAGES="265-271", YEAR=1989, KEYWORDS="performance measure; machine-repair-man model; work conservation; repair", ABSTRACT="The machine-repairman problem with heterogeneous machines and multiple repairmen is considered. It is assumed that machine up times and repair times have general distributions, and a work-conserving service discipline is employed. Under these general assumptions, steady-state relationships between performance measures are examined for the individual machines. Also, various performance measures are defined for the aggregat", } @ARTICLE{Alam89:Recursive, AUTHOR="M. Alam and V. Mani", TITLE="Recursive Solution Technique in a Multi-Server Bi-Level Queueing System with Server Breakdowns", JOURNAL=ieeer, VOLUME=38, NUMBER=4, PAGES="416-421", YEAR=1989, KEYWORDS="reliability", ABSTRACT="This paper presents a multi-server, first-come, first-served queueing system that alternates between two modes of system operation. In one mode all $s$ servers are available and in the other mode, only $s-1$ servers are available for serving the customers. This is due to breakdown of one of the servers. The random variables representing the system with $s$ servers and $s-1$ servers have exponential distributions. In such a system", } @ARTICLE{Alst89:Booking, AUTHOR="J. Alstrup and S.-E. Andersson and S. Boas and O. B. G. Madsen and others", TITLE="Booking Control Increases Profit at Scandinavian Airlines", JOURNAL="Interfaces", VOLUME=19, PAGES="10-19", YEAR=1989, KEYWORDS="decision theory; application; reservation; transportation; air decision analysis", ABSTRACT="Planes are overbooked to avoid empty seats.", } @ARTICLE{Alti89:Approximate, AUTHOR="T. Altiok", TITLE="Approximate Analysis of Queues in Series with Phase-Type Service Times and Blocking", JOURNAL=or, VOLUME=37, NUMBER=4, PAGES="601-610", YEAR=1989, KEYWORDS="tandem queue", } @INPROCEEDINGS{Arhn89:Simulering, AUTHOR="J. Arhnung", TITLE="Simulering af Telefoninet", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=18, YEAR=1989, LANGUAGE="Danish", KEYWORDS="Simulation; digital network; communication network", ABSTRACT="Indlægget omhandler en simuleringsunders gelse af forskellige udformninger af det digitale net, hvor det ene net forudsætter, at enhver lokalcentral er forbundet til 2 transitcentraler, mens det andet forudsætter forbindelse til 3 transitcentraler.", } @INPROCEEDINGS{Arvi89:Numerical, AUTHOR="Ake Arvidsson", TITLE="The Numerical Accuracy of a Markovian Model of a Multi Server System with Rejection and Priorities", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", YEAR=1989, KEYWORDS="Multiserver; markov; analytical model; Markovian model of system behaviour; numerical result; numeric calculation; simulation", ABSTRACT="In a series of papers,(1)-(4), we have developed a markovian model of a multi server system with rejection and priorities. We will now present a comprehensive study of its numerical accuracy. The investigation is performed by comparing simulated results to analytically obtained ones. The relative differencies between the values of the two methods are found to be a few percent over a wide range of parameter values. We also", } @ARTICLE{Asha8901:Practice, AUTHOR="J. Ashayeri and L. Gelders", TITLE="Practice of Simulation in manufactoring and Logistic Systems", JOURNAL="Belgian Journal of Operations Research, Statistics and Computer Science", ADDRESS="Belgium", VOLUME=29, NUMBER=1, PAGES="47-66", YEAR=1989, KEYWORDS="Simulation; manufacturing system; simulation method", } @ARTICLE{Ashf89:Using, AUTHOR="R. W. Ashford and E. M. L. Beale", TITLE="Using Martingales to Make Stochastic Simulations More Precise", JOURNAL=ejor, VOLUME=38, PAGES="86-93", YEAR=1989, KEYWORDS="Simulation; simulation method; martingale", } @ARTICLE{Auge8901:Implantation, AUTHOR="J.-M. Auger and S. Bertaux", TITLE="Implantation de la Méthode des Formes Produits Matricielles pour l'Exploitation du n,p Fork-Join", JOURNAL=rairo, ADDRESS="France", VOLUME=23, NUMBER=1, PAGES="17-42 (paper 24)", YEAR=1989, LANGUAGE="French", KEYWORDS="modeling; fork-join queue; Petri net; stochastic system; Markov", } @ARTICLE{Awer89:Compact, AUTHOR="B. Awerbuch and A. Bar-Noy and N. Linial and D. Peleg", TITLE="Compact Distributed Data Structures for Adaptive Routing", JOURNAL="CWI Quarterly", PUBLISHER="Centrum voor Wiskunde en Informatica, Amsterdam", VOLUME=2, NUMBER=4, PAGES="277-305", YEAR=1989, KEYWORDS="Adaptive routing; routing", } @ARTICLE{Bacc89:Sample, AUTHOR="François Baccelli and W. A. Massey", TITLE="A Sample Path Analysis of the {M/M/1} Queue", JOURNAL=jap, VOLUME=26, PAGES="418-422", YEAR=1989, KEYWORDS="transient analysis; busy period; random walk", ABSTRACT="Bessel functions; Reflection principle", } @INPROCEEDINGS{Back89:TRANA, AUTHOR="P. Backlund and R. Bäckström", TITLE="{TRANA} - Trafikal Nätövervakning med Statistisk Analys", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", YEAR=1989, LANGUAGE="Swedish", KEYWORDS="statistics; analysis; network management; network control system", ABSTRACT="TRANA är en övervakningsmodell för övervakning av förändringar i trafikunderlaget till lågspärrsvior. Modellen är enkelt uppbyggd, enkel att använda och utgör grund för fortatt även peka ut överdimensionerade vior. Modellen erbjuder ringen, snabb reaktion kontra minskad andel falska utpekningar. TRANA utnyttjar veckans TCBH-värde i ordinarie trafikmätning. Förutsatt att veckan tillhör högsäsong, erhålls genom statistisk b", } @INPROCEEDINGS{Bäck89:DAM, AUTHOR="R. Bäckström", TITLE="{DAM} - {ETT} System för Trafikal Övervakning av Datexnätet", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES="V.1", YEAR=1989, LANGUAGE="Swedish", KEYWORDS="data network; network management; traffic analysis; traffic control", ABSTRACT="DAM (Datex - Analyserade Mätresultat) är ett system för analys och presentation av trafikmätningsresultat från datex-nätet. Det är helt uppbyggt kring data som produceras av datexstationerna och kräver därför ingen manuell datainmatning via tangentbord. Initiativ till utveckling av systemet togs i avsikt att skapa ett redskap som ger möjlighet att överblicka den totala trafiksitiationen i nätet. Därutöver ger DAM emellert", } @ARTICLE{Ball89:ECR900, AUTHOR="M. Ballard and D. Verhulst", TITLE="{ECR900} Digital Cellular Mobile Radio System", JOURNAL=ec, VOLUME=63, NUMBER=1, PAGES="45-51", YEAR=1989, KEYWORDS="Mobile radio; MAT; cellular system", ABSTRACT="Scheduled for initial installation in 1991, ECR900 will be among the first cellular mobile systems to implement GSM standards. By the end of the century more than ten million users will benefit from pan-European digital mobile communications.", } @ARTICLE{Bark89:Numerical, AUTHOR="V. A. Barker", TITLE="Numerical Solution of Sparse Singular Systems of Equations Arising from Ergodic markov Chains", JOURNAL="Communications Statistics - Stochastic Models", VOLUME=5, NUMBER=3, PAGES="335-381", YEAR=1989, KEYWORDS="Markov chain; sparse matrix; stationary process", ABSTRACT="Stationary distributions", } @ARTICLE{Batt89:Queueing, AUTHOR="R. Batta", TITLE="A Queueing-Location Model with Expected Service Time Dependent Queueing Disciplines", JOURNAL=ejor, VOLUME=39, PAGES="192-205", YEAR=1989, KEYWORDS="Queueing system; nonlinear optimization", ABSTRACT="Location in a congested environment", } @ARTICLE{Batt89:Location, AUTHOR="R. Batta and O. Berman", TITLE="A Location Model for a Facility Operating as an M/G/k Queue", JOURNAL=networks, VOLUME=19, PAGES="717-728", YEAR=1989, KEYWORDS="Model; M/G/N; queueing theory; queueing system", } @ARTICLE{Belo8902:Application, AUTHOR="P. P. Belobaba", TITLE="Application of a Probabilistic Decision Model to Airline Seat Inventory Control", JOURNAL=or, VOLUME=37, NUMBER=2, PAGES="183-197", YEAR=1989, KEYWORDS="reservation", } @ARTICLE{Bitr8904:Tradeoff, AUTHOR="G. R. Bitran and D. Tirupati", TITLE="Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks", JOURNAL=or, VOLUME=37, NUMBER=4, PAGES="547-564", YEAR=1989, KEYWORDS="Queueing network; manufacturing system", } @TECHREPORT{Blon89:Queue, AUTHOR="C. Blondia and P. Semal", TITLE="The Queue Length Distribution in a {FIFO} {M/G/1} Multi-Queueing System", INSTITUTION="Philips Research Laboratory", ADDRESS="Brussels, Belgium", NUMBER="PRLB\_123\_0017\_CD\_CC", PAGES=19, YEAR=1989, KEYWORDS="M/g/1", } @TECHREPORT{Blon89:Discrete, AUTHOR="C. Blondia and T. H. Theimer", TITLE="A Discrete-Time Model for {ATM} Traffic", INSTITUTION="Philips Research Laboratory", ADDRESS="Brussels, Belgium", NUMBER="PRLB\_123\_0018\_CD\_CC", PAGES=16, NOTE="also University of Stuttgart, Germany, UST\_123\_0022\_CD\_CC", YEAR=1989, KEYWORDS="ATM; traffic source model; discrete time", ANNOTE="RACE-1022; TG8", } @ARTICLE{Bhm89:Network, AUTHOR="W. Böhm and G. Ullman", TITLE="Network Management", JOURNAL=ec, VOLUME=63, NUMBER=1, PAGES="10-16", YEAR=1989, KEYWORDS="Osi", ABSTRACT="Most present private networks have grown step by step as users have required new facilities and services. As a result, management of these networks, which frequently uses incompatible protocols, has become a difficult and costly task. New approaches offer the promise of more integrated, and therefore more cost-effective network management.", } @ARTICLE{Bond89:Finite, AUTHOR="A. B. Bondi", TITLE="An Analysis of Finite Capacity Queues with Priority Scheduling and Common or Reserved Waiting Areas", JOURNAL="Computers and Operations Research", VOLUME=16, NUMBER=3, PAGES="217-233 (paper 14)", YEAR=1989, KEYWORDS="Finite capacity; finite queue; method; priority; steady state probability; poisson process; preemptive resume queue; preemptive scheduling; cs", ABSTRACT="We present an efficient method for computing the steady state probabilities of a finite capacity queue with exponential service. Poisson arrivals, non-preemptive or preemptive-resume priority scheduling, and common or reserved waiting areas for high and low priority packets. Numerical results are presented for the complete sharing (CS), complete partition (CP), sharing with minimum allocation (SMA), and sharing with maxim", } @ARTICLE{Bran89:GI, AUTHOR="A. Brandt", TITLE="On the {GI/M/oo} Service System with Batch Arrivals and Different Types of Service Distributions", JOURNAL=qs, VOLUME=4, PAGES="351-368", YEAR=1989, KEYWORDS="stationary process; binomial moments; time-stationary probabilities", ABSTRACT="We study the infinite-server system with batch arrivals and $s$ different types of customers. With probability pi an arriving customer of type i (i =1, ... , s) and requires an exponentially distributed service time with parameter ui. For this system it is shown that the binomial moments of the s-variate distribution of the number of type-$i$ customers in the system at batch arrivals", } @TECHREPORT{Butt89:Leaky, AUTHOR="M. Butto and A. Tonietti", TITLE="An Analysis of the Leaky-Bucket Policing Mechanism", INSTITUTION="COST-224", ADDRESS="Italy", NUMBER="TD (89) 015", PAGES=9, YEAR=1989, KEYWORDS="Leaky Bucket; Policing Function", } @TECHREPORT{Cava89:Effectiveness, AUTHOR="E. Cavallero and A. Tonietti", TITLE="Effectiveness of the Leaky-Bucket Policing Mechanism with Bursty Sources", INSTITUTION="COST-224", NUMBER="TD (89) 0", YEAR=1989, KEYWORDS="Leaky Bucket; policing function; bursty traffic", } @ARTICLE{Cell89:Matrix, AUTHOR="F. E. Cellier and C. M. Rimvall", TITLE="Matrix environments for continuous system modeling and simulation", JOURNAL="Simulation", VOLUME=52, NUMBER=4, PAGES="141-149", YEAR=1989, KEYWORDS="software engineering; simulation; database; computer-aided analysis; interactive programs; simulation environments", ABSTRACT="In any future standard for continuous simulation languages, it is of primary importance that the data and program structures are made sufficiently general and flexible. In this paper, the use of matrix structures in modeling and simulation, and the impact of matrix environments on the design of simulation languages and their experimental frames will be", } @ARTICLE{Chak89:Algorithms, AUTHOR="S. Chakravarthy and F. Neuts", TITLE="Algorithms for the Design of Finite-Capacity Service Units", JOURNAL=navres, VOLUME=36, PAGES="147-165", YEAR=1989, KEYWORDS="Ph/ph/n", } @ARTICLE{Chin89:Networks, AUTHOR="K.-T. E. Chin and R. Serfozo", TITLE="Networks of Queues with Blocking and Load Balancing", JOURNAL="Progress in Materials Handling and Logistics", PUBLISHER="Springer Verlag", VOLUME=1, PAGES="199-207", YEAR=1989, KEYWORDS="Queueing Network; Load Balancing; Blocking", } @TECHREPORT{Chof89:VLC, AUTHOR="J. P. Choffray and B. Macq and B. Van Caillie", TITLE="{VLC} and Buffer Regulation for Video Transmission in {ATM} networks", INSTITUTION="COST-211bis Simulation Subgroup", NUMBER="SIM/89/40", PAGES=7, YEAR=1989, KEYWORDS="ATM; Video Service; Buffer Management", ABSTRACT="The main advantages for video transmission in ATM networks is the ability to transmit with variable rate and constant quality instead of constant rate transmission with varying quality. Therefore, we have studied first the validity of the RM8 VLC use at a rate of 2Mbps and then the way of regulate variable rates for such ATM networks.", } @TECHREPORT{Chri89:Epsilon, AUTHOR="J. P. R. Christensen and B. J. Oommen", TITLE="Epsilon-Optimal Stubborn Learning Mechanisms", INSTITUTION="Copenhagen Telephone Company, UB", ADDRESS="Copenhagen, Denmark", NUMBER="07-04", PAGES=30, YEAR=1989, KEYWORDS="Expert system", ABSTRACT="Learning automata", } @ARTICLE{Chri89:Axiomatic, AUTHOR="J. P. R. Christensen and C. Rasmussen", TITLE="Axiomatic Characterizations of Inhomogeneous Poisson Point Processes {(IPPP)} Their Mixtures and Random Translations", JOURNAL="Contemporary Mathematics", VOLUME=49, PAGES="87-96", YEAR=1989, KEYWORDS="Poisson Process; Point Process", ABSTRACT="In this paper we characterize by axioms of independence and homogeneity Inhomogeneous Poisson Point Processes (in the follwing paper called IPPP) and a special class of mixtures of such processes. Some auxiliary results are given showing that our results are discussed as background. Random translations of IPPP are considered as IPPP in two dimensions. This is used to give much simpler proofs of extensions of results due t", } @INPROCEEDINGS{Chri89:Point, AUTHOR="J. P. R. Christensen and C. Rasmussen", TITLE="On Point Processes which are {IPPP} at each point but not globally {IPPP,} their infinite divisibility and mixing", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=22, YEAR=1989, KEYWORDS="Poisson Process; Point Process", ABSTRACT="We show by simple and direct construction that there exist point processes such that each point has a neighbourhood, with the property that the restriction of the process to this neighbourhood is an Inhomogeneous Poisson Point Process(IPPP), but the global structure of the point process is not Poissonian. Although the simplest cases are trivially infinitely divisible, we show that by mixing two suitable infinite divisible", } @ARTICLE{Coop89:Heterogeneous, AUTHOR="R. B. Cooper and S. Paalkurthi", TITLE="Heterogeneous-Server Loss Systems with ordered Entry: An Anomaly", JOURNAL=orl, VOLUME=8, PAGES="347-349", YEAR=1989, KEYWORDS="Loss system", ABSTRACT="Insensitivity", } @TECHREPORT{Cosm89:Correlation, AUTHOR="J. P. Cosmas and A. C. Odinma-Okafor", TITLE="The Correlation of a Conditional Replenishment Video Codec and {GMDP} Source Models", INSTITUTION="Queen Mary College, London, England", ADDRESS="London, Great Britain", NUMBER="QMC\_123\_0023\_CD\_CC", PAGES=13, NOTE="RACE-1022; TG8", YEAR=1989, KEYWORDS="Video coding", } @TECHREPORT{bis89:Extension, AUTHOR="COST-211 bis", TITLE="Extension of {CCITT} Visual Communication Codec for Operation in {ATM} Networks", INSTITUTION="COST-211 bis Simulation Subgroup", NUMBER="SIM/89/43", PAGES=9, YEAR=1989, KEYWORDS="Video Coding; CCITT; Communication Network", } @TECHREPORT{bis89:First, AUTHOR="COST-211 bis", TITLE="First attempts of picture coding on {ATM} networks", INSTITUTION="COST-211bis Simulation Subgroup", NUMBER="SIM/89/44", PAGES=13, YEAR=1989, KEYWORDS="Video Coding; ATM; Field Trial", } @ARTICLE{Dall89:Approximate, AUTHOR="Y. Dallery and R. David and X.-L. Xie", TITLE="Approximate Analysis of Transfer Lines with Unreliable Machines and Finite Buffers", JOURNAL=ieeeac, VOLUME="AC-34", NUMBER=9, PAGES="943-953", YEAR=1989, KEYWORDS="Transfer; Reliability; Finite Buffer; Approximation; Analysis", } @ARTICLE{Devr89:Global, AUTHOR="L. Devroye", TITLE="On Global Costs and Nyquist's Theorem in Random Variate Generation", JOURNAL=mor, VOLUME=14, NUMBER=2, PAGES="224-236", YEAR=1989, KEYWORDS="random variate; analysis; algorithm; characteristic function; expectation", ABSTRACT="Nyquist's theorem; rejection method; expected time complexity; analytical functions; density", } @ARTICLE{Werr89:Tabu, AUTHOR="D. de Werra and A. Hertz", TITLE="Tabu Search Techniques {(A} Tutorial and an Application to neural Networks)", JOURNAL=ors, VOLUME=11, PAGES="131-141", YEAR=1989, KEYWORDS="Optimization; Algorithm; Neural Network", ABSTRACT="Tabu Search is a general heuristic procedure for global optimization. Based on simple ideas it has been extremely efficient in getting almost optimal solutions for many types of difficult combinatorial optimization problems. The principles of Tabu Search are described and illustrations are given. An example of problem type where the use of Tabu Search has drastically cut down the computational effort is presented.", } @ARTICLE{Dick89:Monte, AUTHOR="B. H. Dickman and M. J. Gilman", TITLE="Monte Carlo Optimization", JOURNAL="Journal of Optimization Theory and Applications", VOLUME=60, NUMBER=1, PAGES="149-157", YEAR=1989, KEYWORDS="mathematical programming technique; Monte Carlo simulation; stochastic system; stochastic methods", ABSTRACT="Optimization techniques for solving mathematical programming problems have been the focus of some debate. This no reviews the debate and puts these stochastic methods in their proper perspective.", } @TECHREPORT{Drew89:Statistical, AUTHOR="W. Drews", TITLE="Statistical analyses of bit streams from a variable rate H.261-based video codec", INSTITUTION="COST-211 bis Simulation Subgroup", NUMBER="SIM/89/42", PAGES=9, YEAR=1989, KEYWORDS="Variable Rate; Measurement; Video Coding", } @ARTICLE{Dzie89:Bounds, AUTHOR="A. Dziech and A. R. Pach", TITLE="Bounds on the Throughput of an Unslotted Aloha Channel in the Case of a Heterogeneous Users' Population", JOURNAL="Kybernetika", VOLUME=25, NUMBER=6, PAGES="476-485", YEAR=1989, KEYWORDS="ALOHA; Heterogeneous Traffic; Throughput Analysis", ABSTRACT="In this paper we give an upper bound on the intensity of successful packet transmissions and the throughput of an unslotted Aloha channel in the case of a heterogeneous users' population. These bounds have been derived under the only assumption of stationarity and independence of traffic streams generated by the users. They are obtained by means of the results from the theory of random pulse stream and depend only on the", } @INPROCEEDINGS{Ekst89:Intelligent, AUTHOR="G. Ekstedt and A. Rudberg and L. Söderberg and M. Axelsson", TITLE="Intelligent Networks. Architectural Principles and an Economical Analysis", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES="X.2.1-10", YEAR=1989, KEYWORDS="IN; Distributed System; Decentralized Control", ABSTRACT="This is a study about centralized and distributed Intelligent Networks (IN). The study is an economical analysis of at what degree or magnitude it is economically motivated to distribute logic and data in an Intelligent Network. The results in the study comes from calculations made on a national model network as well as on a metropolitan model network.", } @INPROCEEDINGS{Erra89:Flow, AUTHOR="A. Erramilli and R. Singh", TITLE="A Flow Equivalent Model of the Fork and Join Queue", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=18, YEAR=1989, KEYWORDS="Flow Equivalence; Fork-Join Queue; Queueing System; Cycle Time; Approximation", ABSTRACT="The fork and join queue is an extended queueing construct which has applications in computer and communication systems. We consider the closed fork and join system with M exponential servers in parallel and a population of W tasks, and develop a recursive algorithm that permits the approximate calculation of cycle time and throughput for large values of M and W. The cycle times obtained this way are within 6\% of simulatio", } @ARTICLE{Faki89:Product, AUTHOR="D. Fakinos and K. Sirakoulis", TITLE="Product-Form Distributions for an M/G/k Group-Arrival Group-Departure Loss System", JOURNAL=aap, VOLUME=21, PAGES="721-724", YEAR=1989, KEYWORDS="multiserver", ABSTRACT="In this work we investigate under what circumstances the equilibrium distribution of the numbers of groups of various sizes in a certain M/G/k group-arrival group-departure loss system can be obtained in a closed product form.", } @ARTICLE{Falc89:Nu, AUTHOR="S. Falck and T. Petterson and S. Reinholdsson", TITLE="Nu förfinas systemen för mätning av teletrafik", JOURNAL=tele, ADDRESS="Sweden", NUMBER=3, PAGES="69-73", YEAR=1989, LANGUAGE="Swedish", } @ARTICLE{Fali89:Periodic, AUTHOR="G. I. Falin", TITLE="Periodic Queues in Heavy Traffic", JOURNAL=aap, VOLUME=21, PAGES="485-487", YEAR=1989, KEYWORDS="Poisson arrivals; Poisson process; diffusion approximation", ABSTRACT="An analytic approach to the diffusion approximation in queueing due to Burman (1979) is applied to the M(t)/G/1/oo queueing system with periodic Poisson arrivals. We show that under heavy traffic the virtual waiting time process can be approximated by a certain Wiener process with reflecting barrier at 0.", } @INPROCEEDINGS{Feng89:Response, AUTHOR="B. Feng and P. J. Emstad", TITLE="Response Time Analysis of Broadcast Videotex Systems", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=8, YEAR=1989, KEYWORDS="Communication Network; Information System; Interactive Mode; Teletex; Analysis; Response Time", ABSTRACT="Videotex is an interactive information system which provides users with low-cost real-time access to information. In such a system, user requests are forwarded to a service computer where the desired information is retrieved and sent back to the user. In this study, we focus on modelling of videotex system where information requests (and acknowledgments) can be sent via low capacity point-to-point network, while the infor", } @ARTICLE{Fuji89:Network, AUTHOR="K. Fujimoto and Y. Hibino and T. Oimatsu", TITLE="Network Operations Expert Systems", JOURNAL=recl, VOLUME=37, NUMBER=1, PAGES="15-21", YEAR=1989, KEYWORDS="Survey; Expert System; ISDN; Intelligent Network; Network Management", ABSTRACT="This paper presents the architecture of the intelligent network operations systems for ISDN in NTT, and examples of their application. These intelligent network operations systems employing knowledge-base technology are presently being incorporated into network operations systems that were constructed based on conventional information processing technology. The knowledge-base systems are designed on the basis of NTT's tot", } @ARTICLE{Gles89:Gamma, AUTHOR="L. J. Gleser", TITLE="The Gamma Distribution as a Mixture of Exponential Distributions", JOURNAL="The American Statistician", VOLUME=43, NUMBER=2, PAGES="115-117", YEAR=1989, KEYWORDS="Decreasing hazard rate; pooled data", ABSTRACT="A gamma distribution with arbitrary scale parameter theta and shape parameter $r<1$ can be represented as a scale mixture of exponential distributions.", } @ARTICLE{Gree89:Queueing, AUTHOR="B. S. Greenberg", TITLE="{M/G/1} Queueing Systems with Returning Customers", JOURNAL=jap, VOLUME=26, PAGES="152-163", YEAR=1989, KEYWORDS="call reattempt; laplace transform", ABSTRACT="Geometric orbits", } @ARTICLE{Guim89:Simulation, AUTHOR="R. C. Guimaraes and B. G. Kingsman", TITLE="Simulation - Optimisation: The method and its application in the analysis of grain terminal operations", JOURNAL=ejor, VOLUME=41, PAGES="44-53", YEAR=1989, KEYWORDS="simulation; optimization", ABSTRACT="Sea transport; port facilities; grains", } @ARTICLE{Hadj8903:Theorem, AUTHOR="L. M. Hadjyisky and K. T. Atanassov", TITLE="Theorem for Representation of the Neuronal Networks by Generalized Nets", JOURNAL="AMSE Review", PUBLISHER="AMSE Press", VOLUME=12, NUMBER=3, PAGES="47-54", YEAR=1989, KEYWORDS="Neural network; Petri net", ABSTRACT="Generalised nets; GN", } @INPROCEEDINGS{Haug89:Trafikkbetraktninger, AUTHOR="R. B. Haugen and E. Lykke Jensen", TITLE="Trafikkbetraktninger Omering Intelligente Mett", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", YEAR=1989, LANGUAGE="Norwegian", KEYWORDS="Planning; forecasting; traffic prediction", } @INPROCEEDINGS{Hauk89:Trfikkstudie, AUTHOR="J. Haukeland and J. Ytterhaug", TITLE="Trfikkstudie av det Digitale Nettet i Stavanger Teleområde", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=30, YEAR=1989, LANGUAGE="Norwegian", KEYWORDS="Planning; Communication Network; Traffic Source; Signalling", ABSTRACT="Alcatel STK har i samarbeid med televerket i Stavanger gjennomf rt en omfattende trafikkstudie av System 12 nettet i Stavanger teleområde. Formålet med studien har fra vår side være å evaluere S12 og signaleringssystem No.7 i en reell driftssituasjon. Vi har også kunnet studere ulike trafikkparametre og karakteristika ved abonnentoppf rselen i nettet. En sideeffekt har være en detaljert evaluering og forbedring av det int", } @INPROCEEDINGS{Hedl89:Statistisk, AUTHOR="C. Hedlund", TITLE="Statistisk Analys av Belastningsvariationer under en Vecka i en Station", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=26, YEAR=1989, LANGUAGE="Swedish", KEYWORDS="Method; Analysis; Workload; NIL", ABSTRACT="I detta bidrag beskrivs en metod att med statistiska metoder analysera mätdata från en station i drift. Mätningar har gjorts på processorbelastning och anropsintensitet. Grundlast, kapacitet och medelbelastning per koppel kan utläsas ur resultatet.", } @INPROCEEDINGS{Helv89:Simulering, AUTHOR="B. E. Helvik", TITLE="Simulering av Systemer med Tid mellom Hendelser i Ekstremt Ulike Tidsskalaer; Et Eksempel", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", YEAR=1989, LANGUAGE="Norwegian", KEYWORDS="ATM; Resource Allocation; Virtual Channel", ABSTRACT="Hendelsene i et ATM system foregår på ulike nivåer. Tiden mellom hendelser på de ulike nivåene kan variere med st rrelsesordener. For eksempel er det stor forskjell på tid mellom opp-og ned-kobling av virtuelle forbindelser, og tid mellom pakke-ankomster til en ATM-node. For node formål er det nskelig å simulere de ulike nivåene samtidig, for eksempel for å studere effektene på pakkeankomst-nivået av å bruke ressursallok", } @INPROCEEDINGS{Helv89:Modelling, AUTHOR="B. E. Helvik and N. Stol", TITLE="On the Modelling of {ATM} Traffic Processes", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=18, YEAR=1989, KEYWORDS="Random Process; Arrival Process; ATM; Traffic Source Model; Correlation", ABSTRACT="Properties of the ATM traffic process is discussed, especially the mixture of traffic from different types of sources, the modelling of various mixtures, and the effects of multiplexing and splitting. These properties ought to be taken into account in traffic activities like analysis, simulation and synthetic traffic generation. The paper focuses on the correlation structure of a cell stream at various points in the netwo", } @INPROCEEDINGS{Hemm89:Politifunksjoner, AUTHOR="H. Hemmer and P. T. Huth", TITLE="Politifunksjoner i {ATM-Nett}", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=22, YEAR=1989, LANGUAGE="Norwegian", KEYWORDS="ATM; Simulation; Policing Function; Source Policing", ABSTRACT="Det er utviklet et simuleringsprogram for evaluering av ulike politifunksjoner i et ATM-nett. Programmet er på cellenivå og kan også benyttes til kapasitetstudier av ATM-nett med ulike trafikkilder. Eksperimenter viser at trafikk uten flere begrensninger enn maksimalverdi og middelverdi gj r det vandkelig å dimensjonere politifunksjonene. Legger man på begrensninger i varighet av burster og minimum tid mellom burster vise", } @ARTICLE{Hend89:Insensitivity, AUTHOR="W. Henderson and P. Taylor", TITLE="Insensitivity of Processes with Interruptions", JOURNAL=jap, VOLUME=26, PAGES="242-258", YEAR=1989, KEYWORDS="genaralized semi Markov process; partial balance; product form", ABSTRACT="The theory of insensitivity within generalised semi-Markov processes is extended to cover classes of models in which the generally distributed lifetimes can be terminated prematurely by the deaths of negative exponentially distributed life-times. As a consequence of this approach it is shown that there exist classes of processes which are insensitive with respect to", } @ARTICLE{Heym89:Numerical, AUTHOR="D. P. Heyman and A. Reeves", TITLE="Numerical Solution of Linear Equations Arising in Markov Chain Models", JOURNAL="ORSA Journal on Computing", VOLUME=1, NUMBER=1, PAGES="52-60", YEAR=1989, KEYWORDS="Queueing System; Markov Chain; Numerical Method", } @ARTICLE{Ho8901:Special, AUTHOR="Yu-Chi Ho", TITLE="Special Issue on Dynamics of Discrete Event Systems", JOURNAL=ieeeproc, VOLUME=77, NUMBER=1, PAGES=221, YEAR=1989, KEYWORDS="Closed queueing network; perturbation analysis; discrete event system", ABSTRACT="Cao, Xi-Ren: A Comparison of the Dynamics of Continuous and Discrete Event Systems; Perturbation analysis of discrete dynamic systems (DEDSs) is a new technique which provides estimates of the sensitivity of system performance based on one sample path of the system. This paper reviews the results of perturbation analysis pertaining to closed queueing networks", } @ARTICLE{Hord89:Constrained, AUTHOR="A. Hordijk and F. Spieksma", TITLE="Constrained Admission Control to a Queueing System", JOURNAL=aap, VOLUME=21, PAGES="409-431", YEAR=1989, KEYWORDS="convex combination; stationary distributions; actions and states; threshhold optimal policy; thinning optimal policy; flow control; linear programming; stationary process", } @ARTICLE{Hunt89:Implied, AUTHOR="P. J. Hunt", TITLE="Implied Costs in Loss Networks", JOURNAL=aap, VOLUME=21, PAGES="661-680", YEAR=1989, KEYWORDS="optimization; loss system", } @ARTICLE{Hunt89:Critically, AUTHOR="P. J. Hunt and F. P. Kelly", TITLE="On Critically Loaded Loss networks", JOURNAL=aap, VOLUME=21, PAGES="831-841", YEAR=1989, KEYWORDS="blocking; loss system", ABSTRACT="This paper studies the behaviour of large loss networks, paying particular attention to links in a certain critical loading where the load offered very nearly matches capacity. We correct and extend an earlier central limit theorem for the stationary distribution of a loss network with critically loaded links. We then use this result to show that acceptance probabilities have a limiting product-form decomposition, despite", } @ARTICLE{Inam89:Product, AUTHOR="H. Inamori", TITLE="Product Form Solution for Loss Systems with Multi-Class Batch Arrival Customers", JOURNAL="The Transactions of the IEICE", VOLUME="E.72", NUMBER=5, PAGES="623-632", YEAR=1989, KEYWORDS="multiserver; ISDN", } @INPROCEEDINGS{Jens89:Trafikkforskning, AUTHOR="E. Lykke Jensen", TITLE="Trafikkforskning i Norge: Pionerene {T.} Engset og {L.A.} Joys", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", YEAR=1989, LANGUAGE="Norwegian", KEYWORDS="Traffic engineering; survey", ABSTRACT="History", } @TECHREPORT{John89:Simulating, AUTHOR="Stephen Johnson", TITLE="Simulating {ATM} Networks", INSTITUTION="COST-224", NUMBER="TD(89) 41", PAGES=5, YEAR=1989, KEYWORDS="ATM; communication network; simulation", } @ARTICLE{Kao89:Random, AUTHOR="C. Kao", TITLE="A Random Number Generator for Microcomputers", JOURNAL=jors, VOLUME=40, NUMBER=7, PAGES="687-691", YEAR=1989, KEYWORDS="microcomputer; PC; random number", } @TECHREPORT{Kapu89:Transient, AUTHOR="P. K. Kapur and R. B. Garg", TITLE="Transient solutions of a software reliability model with imperfect debugging and error generation", INSTITUTION="Department of Operational Rersearch, University of Delhi", ADDRESS="Dehli, India", PAGES=13, YEAR=1989, KEYWORDS="Reliability", ABSTRACT="In this paper we obtain transient solutions of a software reliability model based on the assumption that failure rate is proportional to the errors remaining under imperfect debugging and finite error generation, which is more realistic in nature. We also obtain the transient probabilities of errors remaining, mean number of faults remaining, unconditional reliability and expected number of failures till time $t$.", } @TECHREPORT{Kare89:Software, AUTHOR="N. Kareer and P. K. Kapur and P. S. Grover", TITLE="An S-shaped software reliability growth model with two types of errors", INSTITUTION="Department of Operational Research, University of New Delhi", ADDRESS="Delhi, India", PAGES=23, YEAR=1989, KEYWORDS="Reliability", ABSTRACT="An S-shaped software reliability growth model (SRGM) based on a non-homogeneous Poisson process (NHPP) with two type of errors has been proposed. The errors have been classified depending upon their severity. We have estimated the model parameters and obtained the optimum release policies which minimize the cost subject to achieving a given level of reliability. Numerical results illustrating the applicability of the problem", } @INPROCEEDINGS{Kari89:Factors, AUTHOR="H. H. Kari", TITLE="Performance Factors of the Micro Computer based Local Area Networks", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES="X.4.1-10", YEAR=1989, KEYWORDS="LAN", ABSTRACT="This paper describes the basic performance factors of a normal microcomputer based local area network. The performance of the network system can be represented by the time required to complete a request made for a network service. Instead of just giving the average access time on this paper also the distribution profile of the access time is measured. The weight of the different parameters of the network system are illustrated.", } @INPROCEEDINGS{Karl89:Different, AUTHOR="J. Karlsson", TITLE="Different Dedication Strategies for Link Allocation in an {IBCN}", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES="VII.1.1-12", YEAR=1989, KEYWORDS="Resource allocation", ABSTRACT="The traffic characterics for an IBCN is discussed, further a model for an outward trunk group in a transit node is presented. The investigations made are focused on allocation principles in respect of blocking probability and utilization of the resources. Different methods to dedicate devices for the broadband services are investigated. Firstly, statical and dynamical dedication is separated and, for the statical dedication", } @ARTICLE{Ketc89:Information, AUTHOR="M. G. Ketcham and R. E. Shannon and G. L. Hogg", TITLE="Information structures for simulation modeling of manufacturing systems", JOURNAL="Simulation", VOLUME=52, NUMBER=2, PAGES="59-67", YEAR=1989, KEYWORDS="hierarchical modeling; simulation; database; information theory; simulation database", ABSTRACT="This paper presents an information-based approach to simulation modeling and an information-based simulation environment called IBIS. IBIS uses information relationships to structure simulation models and to coordinate multiple models at different levels of hierarchical development. Because of its database orientation, IBIS models do not exist as programming code but exist in the form of information", } @INPROCEEDINGS{Kilk89:Comparison, AUTHOR="K. Kilkki", TITLE="Performance Comparison of {ATM} Switch Structures", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES="IV.3.1-8", YEAR=1989, KEYWORDS="ATM; switching block; architecture; comparison", ABSTRACT="Principles of ATM (Asynchronous Transfer Mode) are well known: Fixed lengths packets (cells) with a header containing important information such as packet number , the route, the virtual circuit number etc.. ATM utilises statistical characteristic of generation of information and arrival of different nodes, by sending the packets on a FIFO basis on the first available empty timeslots. In the ATM an end-to-end route is first", } @ARTICLE{Kira8902:Integrated, AUTHOR="A. S. Kiran and A. Schloffer and D. M. Hawkins", TITLE="An integrated simulation approach to design of flexible manufacturing systems", JOURNAL="Simulation", VOLUME=52, NUMBER=2, PAGES="47-52", YEAR=1989, KEYWORDS="design; flexible manufacturing system; cellular manufacturing; FMS", ABSTRACT="Simulation has been used in the design of manufacturing cells at General Dynamics - Pomona Division. At the preliminary design stage, mean value analysis has been used to define basic system characteristics and to develop design alternatives. Siman simulation language and a specifically designed user interface have been utilized in evaluaing alternative designs. The performance of the final design", } @ARTICLE{Koen89:, AUTHOR="E. Koenigsberg", TITLE="The Analysis of {AS/RS} Performance", JOURNAL="Progress in Materials Handling and Logistics", VOLUME=1, PAGES="133-150", YEAR=1989, KEYWORDS="Manufacturing system", } @ARTICLE{Koga89:Exact, AUTHOR="Y. Kogan", TITLE="Exact analysis for a class of simple, circuit-switched networks with blocking", JOURNAL=aap, VOLUME=21, PAGES="952-955", YEAR=1989, KEYWORDS="generating function; multiserver; convolution algorithm; generating and partition functions", ABSTRACT="We consider the same circuit switching problems as Mitra (1). The calculation of the blocking probabilities is reduced to finding the partition function for a closed exponential pseudo-network with L-1 customers. This pseudo-network differs from that in (1) in one respect only: service rates at nodes 1, 2, ... , p depend on the queue length. The asymptotic expansion developed in (1) follows", } @INPROCEEDINGS{Körn89:Routing, AUTHOR="U. Körner and M. Pióro", TITLE="A Routing Rule for Open Queueing Networks", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES="IX.6.1-8", YEAR=1989, KEYWORDS="Queueing network; routing", ABSTRACT="A routing principle, which in some sense tries to minimize total network delays, is introduced. The idea is based on the concept of the expected increase in the accumulated waiting times (¯AWT) for calls in a packets switched network. When a new call should be set up, a choice of a path is made, in a way so that delays for other calls in the network are minimized. Analytical expression for the basic entry, ¯AWT, is derived", } @TECHREPORT{Korn89:Overload, AUTHOR="U. Körner and B. Wallström and C. Nyberg", TITLE="On Overload control of {SPC-Systems}", INSTITUTION="Department of Communication Systems, Lund Institute of Technology", ADDRESS="Lund, Sweden", NUMBER=101, PAGES=80, YEAR=1989, KEYWORDS="SPC; overload control", } @ARTICLE{Kouv8902:Optimal, AUTHOR="D. D. Kouvatsos and A. T. Othman", TITLE="Optimal Flow Control of End-to-End Packet-Switched Network with Random Routing", JOURNAL="IEE Proceedings, Part E", ADDRESS="Great Britain", VOLUME=136, NUMBER=2, PAGES="90-100", YEAR=1989, KEYWORDS="Packet switching; flow control", } @TECHREPORT{Kouv89:Approximate, AUTHOR="D. D. Kouvatsos and A. K. Simpson", TITLE="Approximate Methods for General {RPS} Reconnection Delay Models", INSTITUTION="Computing Systems Modelling Research Group, University of Bradford", ADDRESS="Bradford, Great Britain", NUMBER="DDK/AKS-13", PAGES=28, YEAR=1989, KEYWORDS="Queueing system", } @ARTICLE{Kouv89:Maximum, AUTHOR="D. D. Kouvatsos and N. Tabet-Aouel", TITLE="A Maximum Entropy Priority Approximation for a Stable {G/G/1} Queue", JOURNAL=acta, VOLUME=27, PAGES="247-286", YEAR=1989, KEYWORDS="Queueing system; G/G/1", } @TECHREPORT{Kouv89:Hierarchical, AUTHOR="D. D. Kouvatsos and P. J. Tomaras", TITLE="Hierarchical Decomposition of General Queueing Networks Given Subset and Aggregate Constraints", INSTITUTION="Computing Systems Modelling Research Group, University of Bradford", ADDRESS="Bradford, Great Britain", NUMBER="DDK/PJM-2", PAGES=17, YEAR=1989, KEYWORDS="Queueing network; decomposition", } @ARTICLE{Kouv89:MEM, AUTHOR="D. D. Kouvatsos and N. P. Xenios", TITLE="{MEM} for Arbitrary Queueing networks with Multiple General Servers and Repetitive-Service Blocking", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=10, PAGES="169-195", YEAR=1989, KEYWORDS="Queueing network", } @ARTICLE{Lamb89:Generalization, AUTHOR="A. Lambros and A. Pombortsis and A. Sideridis and D. G. Tambouratzis", TITLE="A Generalization of the Erlang's B-formaula", JOURNAL=rairo, VOLUME=23, NUMBER=3, PAGES="283-288", YEAR=1989, KEYWORDS="Erlang B formula; multiserver; telex", } @ARTICLE{Lee8902:Approximate, AUTHOR="Hwang-Soo Lee and S. M. Pollock", TITLE="Approximate Analysis for the Merge Configuration of an Open Queueing Network with Blocking", JOURNAL="IEE Transactions", ADDRESS="Great Britain", VOLUME=21, NUMBER=2, PAGES="122-129", YEAR=1989, KEYWORDS="Queueing network", ABSTRACT="A merge configuration of open queueing networks with exponential service times and finite buffers is analysed. We offer an iterative algorithm to approximate the steady-state probabilities for each queue of the system. The procedure decomposes the queueing network into individual queues and analyses each individual queue in isolation. An M/M/1/N or M/G/1/N model is used for the analysis of the merging queues. An M/M/1/N w", } @ARTICLE{LeGa8901:Loss, AUTHOR="F. Le Gall", TITLE="About Loss Probabilities for General Routing Policies in Circuit-Switched Networks", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=1, PAGES="57-59", YEAR=1989, KEYWORDS="Circuit switching; loss probability", ABSTRACT="In this paper, we derive from the Markovian analysis a relationsship between the intensities of offered traffics and loss probabilities in circuit-switched networks with general routing policies. This relation was first derived by N.I. Bech and then by P. Le Gall in the simple overflow case, i.e., primary trunk-groups overflowing on to a secondary trunk group.", } @INPROCEEDINGS{Lind89:Traffical, AUTHOR="K. Lindberger", TITLE="Traffical Analysis of Statistical Multiplexing in {ATM-networks}", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", YEAR=1989, KEYWORDS="ATM; statistical multiplexing", ABSTRACT="The purpose of this paper is to suggest queueing and loss models in different time scales which will describe the traffical variations and their essential effect on the dimensioning of the links in a multiservice ATM network with a given GOS. Furthermore the models are meant to be applied to mixtures of traffic types with different characteristics. A key question to answer with these models is whether statistical multiple", } @ARTICLE{Lo89:Two, AUTHOR="C.-C. Lo and A. Kershenbaum", TITLE="A Two-Phase Algorithm and Performance Bounds for the Stat-Star Concentrator Location Problem", JOURNAL=ieeecom, VOLUME=37, NUMBER=11, PAGES="1151-1163", YEAR=1989, KEYWORDS="multidrop", ABSTRACT="The introduction of concentrators in a centralized telecommunication network offers a number of advantages; most important, it provides a cost-effective way to connect the network. The star-star (SS) network model is considered. The star-star concentrator location problem (SSCLP) is then examined. The SSCLP is NP-complete. It can be formulated as a 0-1 integer programming problem. A two-phase algorithm is developed to sol", } @INPROCEEDINGS{Lore89:Abonett, AUTHOR="R. Lorentzen", TITLE="Abonett - An {EDP-Based} Planning Tool for Cost Effective Design of Subscriber Network Part One - Algorithm Description", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=12, YEAR=1989, KEYWORDS="Network planning; access network", ABSTRACT="This note gives a brief presentation of ABONETT which is an EDP-based tool for planning of subscriber networks. In this Part One the optimization algorithm which is based on graph theory is described. In Part Two the user interface and experience gained from the practical use of ABONETT are discussed.", } @INPROCEEDINGS{Luba89:Influence, AUTHOR="J. Lubacz and M. Pióro and A. Tomaszewski", TITLE="The Influence of Repeat Attempts on the Effectiveness of Call Routing", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=8, YEAR=1989, KEYWORDS="Routing", ABSTRACT="The paper considers call routing strategies in telephone networks. Its main purpose is to examine the influence of repeat attempts of blocked calls on the traffic handling efficiency of routing strategies in non-hierarchical networks.", } @ARTICLE{Maca8903:Risky, AUTHOR="P. Macaluso", TITLE="A Risky Business - An Introduction to Monte Carlo Venture Analysis", JOURNAL=byte, PUBLISHER="McGraw Hill", VOLUME=9, NUMBER=3, PAGES="179-192", YEAR=1989, KEYWORDS="Forecasting", } @ARTICLE{Macl89:Generation, AUTHOR="N. M. Maclaren", TITLE="The Generation of Multiple Independent Sequences of Pseudorandom Numbers", JOURNAL="Applied Statist.", VOLUME=38, NUMBER=2, PAGES="351-359", YEAR=1989, KEYWORDS="linear congruential generator; parallel computing; packet switching; random number; spectral test; Lehmer; Multiplicative congruential; Wichman-Hill", ABSTRACT="The use of multiple Wichman-Hill generators with coprime moduli is shown to give an efficient algorithm, with proven degree of independence between sequences. The validation of large numbers of such generators is shown to be feasible on current computers, as is the store needed for the composite generator.", } @INPROCEEDINGS{Mads89:Estimation, AUTHOR="H. Madsen and B. F. Nielsen", TITLE="Estimation of Traffic Models for a Packet-Switched Network", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", YEAR=1989, KEYWORDS="Packet switching", ABSTRACT="The purpose of this analysis is to investigate the use of phase-type distributions to model traffic characteristics in packet-switched networks. We have chosen to investigate the holding time distribution for various traffic streams in the Danish packet-switched network PAXNET. Although this distribution seldom is used directly for planning purposes(but rather distributions for packet-arrivals and packet-lengths during bu", } @ARTICLE{McKe89:Generalization, AUTHOR="J. McKenna", TITLE="A Generalization of Littles's Law to Moments of Queue Lengths and Waiting Times in closed, product-Form Queueing Networks", JOURNAL=jap, VOLUME=26, PAGES="121-133", YEAR=1989, KEYWORDS="Little's formula", } @INPROCEEDINGS{Mejl89:Burst, AUTHOR="L. Mejlbro and Annemarie B. Nielsen", TITLE="Burst Detection", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=16, YEAR=1989, KEYWORDS="Traffic source model", ABSTRACT="A method for characterization of different sources with respect to burst arrivals. The method is based on measurement of the traffic in certain time intervals.", } @ARTICLE{Mell8902:Statistical, AUTHOR="J. M. Mellichamp and Y. H. Park", TITLE="A statistical expert system for simulation analysis", JOURNAL="Simulation", VOLUME=52, NUMBER=2, PAGES="134-139", YEAR=1989, KEYWORDS="expert system; simulation; database; statistical issues; simulation analysis", ABSTRACT="Efforts on a number of fronts are being made to enhance the usefulness of simulation as a tool for analysis. Graphical input, animation, automated program generation, model management utilities, and user interactive environments all addresses the issue of ease of use. Even with the current emphasis in this regard, simulation suffers from several shortcomings which preclude even gre", } @INPROCEEDINGS{Melt89:Måleutstyr, AUTHOR="O. Melteig", TITLE="Måleutstyr for {ATM}", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES="IV.2.1-6", YEAR=1989, LANGUAGE="Norwegian", KEYWORDS="ATM", ABSTRACT="De telefonsvitsjer vi har i drift i dag bygger på prinsipper der det har være mulig å teste egenskapen gjennom mer eller mindre gode modeller for simulering på datamaskin. I dagens linjesvitsjede systemer har sp rsmålet f rst og fremst dreiet seg om respondtidene under oppsetting av forbindelsene. I et ATM-nett vil en få deler av disse prosedyrene også etter at forbindelsen er satt opp, og anropshyppigheten, - om man får", } @ARTICLE{Meye89:Stochastic, AUTHOR="C. H. Meyer", TITLE="Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems", JOURNAL="SIAM Review", VOLUME=31, NUMBER=2, PAGES="240-272", YEAR=1989, KEYWORDS="Markov chain; stationary process; stochastic matrix; near complete decomposability; stationary distributions; stochastic complementation; nearly reducible systems; Simon-Ando theorem", ABSTRACT="A concept called stochastic complementation is an idea which occurs naturally, although not always explicitly, in the theory and application of finite Markov chains. This paper brings this idea to the forefront with an explicit definition and a development of some of its properties. Applications of stochastic complementation", } @ARTICLE{Mino89:Network, AUTHOR="M. Minoux", TITLE="Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications", JOURNAL="Network", VOLUME=19, PAGES="313-360", YEAR=1989, KEYWORDS="Network planning", } @TECHREPORT{Mitr89:Time, AUTHOR="N. Mitrou and T. Orinos", TITLE="Time Priorities in {ATD} Switching Elements", INSTITUTION="NTUA", ADDRESS="Athens, Greece", NUMBER="NTUA\_123\_0028\_PR\_CC", PAGES=9, YEAR=1989, KEYWORDS="ATM; queueing system; priority", ANNOTE="RACE-1022; TG8", } @ARTICLE{Miya8904:Comparison, AUTHOR="M. Miyazawa", TITLE="Comparison of the Loss Probability of the {GIx/GI/1/k} Queues with a Common Traffic Intensity", JOURNAL=jorsj, ADDRESS="Japan", VOLUME=32, NUMBER=4, PAGES="505-516", YEAR=1989, KEYWORDS="single server", ABSTRACT="The loss probabilities of the GIx/GI/1/k queues, which means the batch arrival GI/GI/1/k queues, are compared when the queues have a common waiting capacity k, a common batch size distributions, and a common traffic intensity. We prove that, if the interarrival time and service time distributions are NBUE (NWUE), then the loss probabilities are not greater (less) than those of the corresponding Mx/M/1/k queues. The strong", } @ARTICLE{Monm8904:Methods, AUTHOR="Clyde L. Monma and D. F. Shallcross", TITLE="Methods for Designing Communications Networks with Certain Two-Connected Survivalibility Constraints", JOURNAL=or, VOLUME=37, NUMBER=4, PAGES="531-541", YEAR=1989, KEYWORDS="Communication network; reliability", } @ARTICLE{Mura89:Expected, AUTHOR="Kurenai Murakami", TITLE="Expected Applications of Artificial Intelligence Technology", JOURNAL=recl, VOLUME=37, NUMBER=1, PAGES="1-2", YEAR=1989, KEYWORDS="artificial intelligence", } @ARTICLE{Nain89:Interchange, AUTHOR="P. Nain", TITLE="Interchange Arguments for Classical Scheduling Problems in Queues", JOURNAL="Systems \& Control Letters", VOLUME=12, PAGES="177-184", YEAR=1989, KEYWORDS="scheduling; stochastic system; optimization; blocking", ABSTRACT="Stochastic Scheduling; Coupling; Index-rule.", } @BOOK{Nare89:Learning, AUTHOR="K. S. Narendra and M. A. L. Thathachar", TITLE="Learning Automata - An Introduction", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1989, KEYWORDS="Expert system", ABSTRACT="Chapter 9: Applications of Learning Automata. pp. 359-418.", } @INPROCEEDINGS{Niel89:Tool, AUTHOR="B. F. Nielsen", TITLE="A Tool for the Performance Analysis of Product Form Queueing Networks - {ANQUE}", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=18, YEAR=1989, KEYWORDS="Queueing network", ABSTRACT="A new tool to assist in the analysis of queueing networks with product form solutions is developed. The input part is a praphic presentation of the queueing network with several visual aids. Calculations are performed by means of three different algorithms. The tool is primarily intended for use in the study of manufacturing systems, thus including the capability of analyzing queues with finite buffers.", } @TECHREPORT{Nils89:Networks, AUTHOR="O. K. Nilsson and J. Rasmussen", TITLE="Networks 89. Fourth International Network Planning Symposium", INSTITUTION="Jydsk Telefon, centraldivisionen, Netplansektionen", ADDRESS="Aarhus, Denmark", PAGES=23, YEAR=1989, KEYWORDS="Conference report", } @ARTICLE{Niu89:Duality, AUTHOR="S.-C. Niu and R. B. Cooper", TITLE="Duality and Other Results for {M/G/1} and {GI/M/1} Queues, via a New Ballot Theorem", JOURNAL=mor, VOLUME=14, NUMBER=2, PAGES="281-293", YEAR=1989, KEYWORDS="busy period; idle period; waiting time; M/G/1; GI/M/N", ABSTRACT="Ballott theorems; duality", } @ARTICLE{Nobe8908:Practical, AUTHOR="R. D. Nobel", TITLE="Practical Approximations for Finite-Buffer Queueing Models with Batch Arrivals", JOURNAL=ejor, VOLUME=3, NUMBER=8, PAGES="44-55", YEAR=1989, KEYWORDS="Queueing system; batch arrival", } @INPROCEEDINGS{Norr89:Importance, AUTHOR="I. Norros and J. T. Virtamo", TITLE="Importance Sampling Simulation Studies on the Discrete Time nD/D/1 Queue", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES="VI.3.1-16", YEAR=1989, KEYWORDS="Simulation; importance sampling", ABSTRACT="The discrete time nD/D/1 queueing system with periodic arrivals and deterministic service time is studied with an importance sampling method. Tools for a priori analysis of importance sampling with product measures are developed.", } @INPROCEEDINGS{Ormh89:Testproblemer, AUTHOR="T. Ormhaug", TITLE="Testproblemer og Krav til Testopplegg i {ATM-Pilotsystem}", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=12, YEAR=1989, LANGUAGE="Norwegian", KEYWORDS="ATM; testing", ABSTRACT="I l pet av få år vil det bli satt i drift pilotnett for demonstrasjon og verifisering av ATM-prinsippet. Det skal også utvikles testutstyr og testrutiner for bruk i slike nett. Det er viktig at kravene til både testutstyr og pilotanlegg formuleres tidlig, da det er sterke både knomiske og praktiske grunner til å forenkle denne type anleggog og utstyr mest mulig. Det er imidlertid viktig at man for fors kene ikke forenkle", } @ARTICLE{Orns89:Ergodic, AUTHOR="D. S. Ornstein", TITLE="Ergodic Theory, Randomness, and ``Chaos''", JOURNAL="Science", VOLUME=243, PAGES="182-187", YEAR=1989, KEYWORDS="ergodicity", ABSTRACT="Chaos; Kaos", } @ARTICLE{Osaw8902:Discrete, AUTHOR="H. Osawa", TITLE="Discrete-time Storage Models with Negative Binomial Inflow", JOURNAL=jorsj, ADDRESS="Japan", VOLUME=32, NUMBER=2, PAGES="218-232", YEAR=1989, KEYWORDS="Queueing theory", } @INPROCEEDINGS{Ster89:Resource, AUTHOR="O. Sterb and H. Pettersen", TITLE="Resource Allocation in {ATM-network}", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES="II.3 (20)", YEAR=1989, KEYWORDS="ATM; Resource allocation", ABSTRACT="Admission Control is the procedure to decide whether a new connection can be accepted by the ATM network. The decision is based on the resources occupied by the existing connections and the characteristics of the new connection. The mean allocation scheme, the maximum allocation scheme and two-moment allocation schemes are discussed. Models for calculating blocking probabilities and carried load on the links are developed", } @INPROCEEDINGS{Parv89:Peak, AUTHOR="A. Parviala", TITLE="Peak-Hour and Other Peaks of Day", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=14, YEAR=1989, KEYWORDS="Traffic measurement", ABSTRACT="Measurement of a day's peak intensities are needed for dimensioning and grade-of-service control. When choicing the measurement routine, the peak intensities outside the peak-hour are basis for the modelling and the dimensioning methods. On basis of quarter-hour intensities measured from live traffic, and paper: -i. the nature of the peak-hour among the other peak intensities of a day, -ii. how far the assumtion of equili", } @ARTICLE{Pear89:Extended, AUTHOR="C. Pearce", TITLE="Extended Continued Fractions, Recurrence Relations and Two-Dimensional Markov Processes", JOURNAL=aap, VOLUME=21, PAGES="357-375", YEAR=1989, KEYWORDS="call reattempt; search for customers", } @ARTICLE{Pede89:Simuleret, AUTHOR="J. M. Pedersen", TITLE="Simuleret udgl dning - en global optimeringsmetode", JOURNAL="DORSnyt - medlemsblad for Dansk Selskab for Operationsanalyse, Nr. 82, juni", ADDRESS="Denmark", PAGES="36-49", YEAR=1989, LANGUAGE="Danish", KEYWORDS="Optimization; algorithm; simulated annealing", ABSTRACT="I denne artikel præsenteres en generel, global optimeringsteknik, simuleret udgl dning (på engelsk simulated annealing), der bygger på analogi til statistisk mekanik. Teknikken bliver gennemgået og præsenteret i forskellige billeder. Analogien til fysiske systemer er benyttet til at forbedre metoden.", } @INPROCEEDINGS{Pett89:Dirigering, AUTHOR="H. Pettersen", TITLE="Dirigering i Fjernnettet - En Simuleringsstudie", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=18, YEAR=1989, LANGUAGE="Norwegian", KEYWORDS="Network planning; simulation", ABSTRACT="Det presenteres resultater en simuleringsstudie av ulike dirigeringsmetoder anvendt på toppnivået i fjernnettet. Unders kelsen omfatter normalbelastning, overbelastning, skjevbelastning og linkfeil i nettet. Det identifiseres en enkel, adaptiv metode som gir et fleksibelt og robust nett med god trafikkavvikling når det er betydelig avvik mellom dimensjoneringsantagelsene og den virkelige påtrykte trafikken.", } @INPROCEEDINGS{Piri89:Availability, AUTHOR="A. Pirinen", TITLE="On the Availability of a Starlike Telecommunication Network", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=8, YEAR=1989, KEYWORDS="Network planning; availability", ABSTRACT="In this paper we consider the notion of availability in conjunction of telecommunication networks witch statistically independent routes. A network is assumed to form a repairable coherent system. The basic idea is to use networks of a starlike form (a pure star) as moduli in determining the availability of a network. We introduce a new definition for the availability of a starlike network and enlarge that to concern also", } @ARTICLE{Posa89:Numerical, AUTHOR="A. Posafalvi and J. Sztrik", TITLE="A Numerical Approach to the Repairman Problem with Two Different Types of Machine", JOURNAL=jors, VOLUME=40, NUMBER=9, PAGES="797-803", YEAR=1989, KEYWORDS="failure; machine-repair-man model", ABSTRACT="Machine availability; Operative utilization; Repairman problem.", } @ARTICLE{Posa89:Heterogeneous, AUTHOR="A. Posafalvi and J. Sztrik", TITLE="On the heterogeneous machine interference problem with priority and ordinary machines", JOURNAL=ejor, VOLUME=41, PAGES="54-63 (paper 331)", YEAR=1989, KEYWORDS="machine-repair-man model; Little's formula; running time; repair time; operative utilization; machine availability", } @ARTICLE{Pour89:Tandem, AUTHOR="B. Pourbabai", TITLE="Tandem Behaviour of a Telecommunication System with Repeated Calls: A Markovian Case with Buffers", JOURNAL=jors, VOLUME=40, NUMBER=7, PAGES="671-680", YEAR=1989, KEYWORDS="approximation; interdeparture time; Markov process; overflow; call reattempt; superposition", } @INPROCEEDINGS{Rahk89:Trafikmätningar, AUTHOR="K. Rahko and R. Winberg", TITLE="Trafikmätningar i ett telematiskt servicenät i Finland", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", YEAR=1989, LANGUAGE="Finnish", ABSTRACT="PTV-Tele i Finland har under några års tid upprätthållit ett videotexnåt, som främst baserar sig på PTV-Teles paketkopplade datanåt, Datapak, samt på telefonnätet. Eftersom det till nätet har kopplats många tjänst, som baserar sig på andra än videotex-system, betonas numera att det är fråga om ett telematiskt servicenät. Servicen marknadsförs under namnet TeleSampo.", } @ARTICLE{Rama89:Random, AUTHOR="M. M. Ramakrishna", TITLE="Analysis of random probing hashing", JOURNAL=ipl, VOLUME=31, PAGES="83-90", YEAR=1989, KEYWORDS="Performance evaluation; hash coding", ABSTRACT="double hashing", } @ARTICLE{Rama89:Modeling, AUTHOR="C. S. Ramanjaneyulu and V. V. S. Sarma", TITLE="Modeling Server-Unreliability in Closed Queueing Networks", JOURNAL=ieeer, VOLUME=38, NUMBER=1, PAGES="90-95", YEAR=1989, KEYWORDS="distributed computing system; closed queueing network; approximation", ABSTRACT="approximate solution; server unreliability", } @TECHREPORT{Robe89:Multi, AUTHOR="J. W. Roberts", TITLE="Multi-Rate link systems", INSTITUTION="COST-224", NUMBER="TD(89) 40", PAGES=2, YEAR=1989, KEYWORDS="Link system; multirate switching", } @TECHREPORT{Robe89:Characterising, AUTHOR="J. W. Roberts", TITLE="Characterising a Superposition of Periodic Cell Streams", INSTITUTION="COST-224", NUMBER="TD (89) 37", PAGES=5, YEAR=1989, KEYWORDS="ATM; traffic source model; superposition", } @TECHREPORT{Robe89:Comments, AUTHOR="J. W. Roberts", TITLE="Comments on ``Effectiveness of the Leaky Bucket Policing Mechanism with Bursty Sources''", INSTITUTION="COST-224", NUMBER="TD(89) 33", PAGES=2, YEAR=1989, KEYWORDS="ATM; source policing; leaky bucket", } @ARTICLE{Rums89:Insensitivity, AUTHOR="M. Rumsewicz and W. Henderson", TITLE="Insensitivity with Age-Dependent Routing", JOURNAL=aap, VOLUME=21, PAGES="398-408", YEAR=1989, KEYWORDS="product form; queueing network; routing; partial balance; age-dependent routing", ABSTRACT="The theory of insensitivity is extended to include processes where some of the routing probabilities of the process are made dependent upon the length of time the generally distributed variables have been alive. Examples of such systems are given, including networks of queues with age-dependent routing.", } @INPROCEEDINGS{Rydn89:Waiting, AUTHOR="T. Rydén", TITLE="Waiting Times in Access Buffers", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES="IX.5.1-14", YEAR=1989, KEYWORDS="SPC; access control", ABSTRACT="An access buffer is a buffer in an SPC-exchange where new calls are placed before they are accepted by the exchange. Under the assumptions that the arrival process is Poissonian, that calls are fetched from the buffer at equidistant points of the time, and that the system is in a stationary state, results regarding the waiting time for a call in the buffer are derived. These results include the mean waiting time", } @ARTICLE{Sand89:Priority, AUTHOR="D. Sandhu and M Posner", TITLE="A Priority {M/G/1} Queue with Application to Voice/Data Communication", JOURNAL=ejor, VOLUME=40, PAGES="99-108", YEAR=1989, KEYWORDS="queueing system; communication", } @ARTICLE{Sawa8904:Airline, AUTHOR="K. Sawaki", TITLE="An Analysis of Airline Seat Allocation", JOURNAL=jorsj, ADDRESS="Japan", VOLUME=32, NUMBER=4, PAGES="411-419", YEAR=1989, KEYWORDS="reservation", ABSTRACT="In this paper we consider the airline seat allocation between high and low fares with and without stochastic cancellations. We also analyze the problem of simultaneously determining seat allocation and overbooking levels for two different classes of passengers, which also extends the existing literature in three ways. First, the cost of lost sales, which has been ignored in the existing literature, is explicitly incorporated", } @ARTICLE{Seng89:Perturbation, AUTHOR="B. Sengupta", TITLE="A Perturbation Method for Solving Some Queues with Processor Sharing Disciplines", JOURNAL=jap, VOLUME=26, PAGES="209-214", YEAR=1989, KEYWORDS="delay time; communication system; soujourn times", } @ARTICLE{Seng89:Invariant, AUTHOR="B. Sengupta", TITLE="An Invariant Relationship for the {G/G/1} Queue", JOURNAL=aap, VOLUME=21, PAGES="956-957", YEAR=1989, KEYWORDS="virtual waiting time; time in system; FIFO; FCFS; time in system by customer in service", ABSTRACT="In this note, we show that for a stationary FCFS G/G/1 queue, the virtual waiting time and the time spent in the system by the customer in service have the same distribution. We assume that the latter is zero if the queue is empty.", } @ARTICLE{Serf89:Markovian, AUTHOR="R. Serfozo", TITLE="Markovian Network Processes: Congestion-Dependent Routing and Processing", JOURNAL=qs, VOLUME=5, PAGES="5-36", YEAR=1989, KEYWORDS="Markov process; queueing network; dependency; routing; machine-repair-man model; Poisson process", ABSTRACT="Markovian network process; Dependent nodes and routing; Palm probability; Moving unit see time averages", } @ARTICLE{Shar8902:Distribution, AUTHOR="M. Sharafali and P. R. Parthasarathy", TITLE="On the Distribution of a Busy Period for the Many Server Poisson Queue", JOURNAL="Opsearch", VOLUME=26, NUMBER=2, PAGES="125-132", YEAR=1989, KEYWORDS="Queueing system; arrival process; busy period", ABSTRACT="In this paper we provide a simple method to obtain the distribution of a busy period for the M/M/c queue.", } @ARTICLE{Shar89:Initial, AUTHOR="O. P. Sharma and J. Dass", TITLE="Initial Busy Period Analysis for a Multichannel Markovian Queue", JOURNAL="Optimization", VOLUME=20, NUMBER=3, PAGES="317-323", YEAR=1989, KEYWORDS="busy period; recurrence formula; matrix", ABSTRACT="Initial busy period; Cramer's rule; tridiagonal matrix", } @ARTICLE{Shar89:Transient, AUTHOR="O. P. Sharma and N. Ravichandran and J. Dass", TITLE="Transient Analysis of Multiple-Unit Reliability Systems", JOURNAL=navres, VOLUME=36, PAGES="255-264", YEAR=1989, KEYWORDS="Markov system; reliability; instationary process; P.K. Kapur", ABSTRACT="A general Markovian model representing several multiple-unit redundant repairable systems is proposed and its transient behaviour is studied. Specifically, for multiple-unit reliability system the reliability and availability functions are derived in an explicit form for the transient case. The stationary availability and mean time to system failure are deduced from the main results as special cases.", } @ARTICLE{Shar89:Time, AUTHOR="S. D. Sharma", TITLE="On a Non-Markovian Time-Dependent Queueing System", JOURNAL=jap, VOLUME=26, PAGES="142-151", YEAR=1989, KEYWORDS="independent random variable", ABSTRACT="Non-Markovian departures.", } @ARTICLE{Shio8901:Optimization, AUTHOR="T. Shioyama and H. Kise", TITLE="Optimization in Production Systems: A Survey On Queueing Approaches", JOURNAL=jorsj, ADDRESS="Japan", VOLUME=32, NUMBER=1, PAGES="34-55", YEAR=1989, KEYWORDS="manufacturing system; queueing theory; survey; FMS", ABSTRACT="This paper surveys recent work on queueing approaches to a number of optimization problems in production systems, especially modern jobbing production systems (or multi-item small lot production systems) represented by flexible manufacturing systems (FMS). This paper outlines optimization problems concerning with such aspects of the system design and control as workloading, job selection, production rate control, producation", } @ARTICLE{Smir8902:Converse, AUTHOR="S. N. Smirnov", TITLE="Converse of an Ergodic Theorem of Sevastyanov", JOURNAL="SIAM, Theory of Probability and Its Applications", VOLUME=34, NUMBER=2, PAGES="346-348", YEAR=1989, KEYWORDS="Stochastic theory", ABSTRACT="Sevastyanov; Insensitivity", } @ARTICLE{Sode89:Arkitektur, AUTHOR="L. Soderberg", TITLE="Arkitektur for Intelligente Net", JOURNAL=ericssonr, ADDRESS="Stockholm, Sweden", VOLUME=1, PAGES="13-22", YEAR=1989, LANGUAGE="Swedish", KEYWORDS="In", } @ARTICLE{Stec89:Operating, AUTHOR="K. E. Stecke", TITLE="Design and Operating Issues in Flexible Manufacturing", JOURNAL="Progress in Materials Handling and Logistics", ADDRESS="Berlin, Germany", VOLUME=1, PAGES="291-299", YEAR=1989, KEYWORDS="Manufacturing system", } @INPROCEEDINGS{Svin89:Sperrfrie, AUTHOR="I. Svinnset", TITLE="Sperrfrie {ATM-svitsjenettverk}", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", YEAR=1989, LANGUAGE="Swedish", KEYWORDS="ATM; switching block", ABSTRACT="I denne artikkelen betrakter vi et nettverk av ATM-svitsjeblokker. En slik svitsjeblokk kan være en TDM-buss, en matrise av ATM-busser,en ringbasert svitsj eller for eksempel et Batcher-Banyan nettverk om av 2x2 svitsjeelementer. Vi velger derfor å bruke begrepet blokk om byggestenene i et ATM-svitsjenettverk siden den enkelte blokk kan være bygd opp av flere mindre elementer som hver for seg kan svitsje.", } @ARTICLE{Taka89:Ballots, AUTHOR="L. Takacs", TITLE="Ballots, Queues and Random Graphs", JOURNAL=jap, VOLUME=26, PAGES="103-112", YEAR=1989, KEYWORDS="limiting distribution; connectedness; exact and limit distributions", } @ARTICLE{Taka8904:Polling, AUTHOR="H. Takagi", TITLE="Analysis of Polling Systems with a Mixture of Exhaustive and Gated Service Disciplines", JOURNAL=jorsj, ADDRESS="Japan", VOLUME=32, NUMBER=4, PAGES="450-461", YEAR=1989, KEYWORDS="Polling system; exhaustive service; gated service", } @ARTICLE{Temp89:Flexible, AUTHOR="H. Tempelmeier and H. Kuhn and U. Tetzlaff", TITLE="Performance evaluation of flexible manufacturing systems with blocking", JOURNAL=ijpr, VOLUME=27, NUMBER=11, PAGES="1963-1979", YEAR=1989, KEYWORDS="blocking; FMS", ABSTRACT="Analytical approximations for the performance af flexible manufacturing systems (FMS) with blocking of machines due to limited local buffers are presented. The approximations are based on a detailed analysis of FMS configurations used in industry. The method proposed uses informations generated by applying the classical closed queueing network (CQN) model to the FMS. The approximations developed are tested against similar", } @TECHREPORT{Thei89:How, AUTHOR="T. H. Theimer", TITLE="How to Compute the Moments of a {GMDP}", INSTITUTION="University of Stuttgart", ADDRESS="Stuttgart, Germany", NUMBER="UST\_123\_0022\_CD\_CC", PAGES=6, YEAR=1989, KEYWORDS="ATM; traffic source model", ANNOTE="RACE-1022 (TG8)", } @INPROCEEDINGS{Tidb89:Dimensioning, AUTHOR="S.-E. Tidblom", TITLE="On Dimensioning of Buffers in an {ATD} Node", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES="IV.1.1-22", YEAR=1989, KEYWORDS="ATM; switching network; comparison", ABSTRACT="We are here studying a model for a very simplified ATD node. Our interest is focused on the queues of packets in the buffers in front of the outgoing links. These buffers have a finite, but large, number of queueing places and service time is deterministic. A simple and efficient approximation of the distribution of the number of packets in the system (queue + server) is derived. This distribution is then used for finding", } @ARTICLE{Tsai8901:Convergence, AUTHOR="Wei K. Tsai", TITLE="Convergence of Gradient Projection Routing Methods in an Asynchronous Stochastic Quasi-Static Virtual Circuit Network", JOURNAL=ieeeac, VOLUME="AC-34", NUMBER=1, PAGES="20-33", YEAR=1989, KEYWORDS="ATM; virtual channel", } @ARTICLE{Tsou89:Monotonicity, AUTHOR="Pantelis Tsoucas and J. Walrand", TITLE="Monotonicity of Throughput in Non-Markovian Networks", JOURNAL=jap, VOLUME=26, PAGES="134-141", YEAR=1989, KEYWORDS="blocking; closed queueing network", } @ARTICLE{Arem89:Discrete, AUTHOR="B. van Arem", TITLE="Discrete Time Analysis of a Slotted Transmission System", JOURNAL="Computers and Operations Research", VOLUME=16, NUMBER=2, PAGES="101-111", YEAR=1989, KEYWORDS="Discrete time analysis", } @ARTICLE{Wal89:Monotonicity, AUTHOR="J. van der Wal", TITLE="Monotonicity of the Throughput of a Closed Exponential Queueing network in the Number of Jobs", JOURNAL=ors, VOLUME=11, PAGES="97-100", YEAR=1989, KEYWORDS="Closed queueing network; queueing theory", ABSTRACT="convexity", } @ARTICLE{Dijk89:Blocking, AUTHOR="N. van Dijk", TITLE="Blocking of Finite Source Inputs which require simultaneous Servers with General Think and Holding Times", JOURNAL=orl, VOLUME=8, PAGES="45-52", YEAR=1989, KEYWORDS="finite source; product form; insensitivity", ABSTRACT="This paper studies a multi-server loss system with a finite source input of sources that require simultaneous serving by several servers. The stationary distribution of busy sources is extended to general think and holding times and proven to be of an insensitivity product form. The proof is simple and self-contained. Moreover, the arrival theorem is shown to hold and used to compute blocking probabilities.", } @ARTICLE{Dijk89:Proof, AUTHOR="N. van Dijk", TITLE="A Proof of Simple Insensitive Bounds for a Pure Overflow System", JOURNAL=jap, VOLUME=26, PAGES="113-120", YEAR=1989, KEYWORDS="loss probability; upper bound; lower bound; Markov chain", ABSTRACT="Insensitive", } @ARTICLE{Dijk89:Comments, AUTHOR="N. van Dijk", TITLE="Comments on Yao and Buzacott's ``Modelling a Class of Flexible Manufacturing Systems with Reversible Routing''", JOURNAL=or, VOLUME=37, NUMBER=5, PAGES="845-846", YEAR=1989, KEYWORDS="Manufacturing system; performance evaluation; network; tandem queue; product form", ABSTRACT="Recently, in an elegant paper, D.D. Yao and J.A. Buzacott argued that Jackson's celebrated product form applies to various FMS (flexible Manufacturing System) topologies with reversible routing. This note aims to point out the possibility of nonreversible extensions (Point 1) and the validity of their results under general nonexponential services (point 2), as could have been concluded from the literature.", } @ARTICLE{Vasi8906:Learning, AUTHOR="A. V. Vasilakos", TITLE="Learning Automata for Data Communication Routing Problem", JOURNAL="Kybernetika", VOLUME=25, NUMBER=6, PAGES="486-493", YEAR=1989, KEYWORDS="Adaptive routing; data communication", ABSTRACT="A decentralized adaptive routing technique based on learning automata is presented for computer communication networks. Messages are routed by the automata selecting suitable outgoing links, with the delay experienced by a message used as a feedback response for updating future selection strategy. This simple feedback policy which is a realistic representation of the actual feedback received in communication networks is s", } @ARTICLE{Vass89:Testing, AUTHOR="G. Vassilacopoulos", TITLE="Testing for initialization bias in simulation output", JOURNAL="Simulation", VOLUME=52, NUMBER=4, PAGES="151-153", YEAR=1989, KEYWORDS="simulation; testing; initialization bias; simulation output", ABSTRACT="A test is presented for detecting the presence of initialization bias in the mean of a simulation output process. The test is based on a standard sequence of linear combinations of the ranks of the simulation observations. The validity and power of the test are illustrated by applying it to a large number of independently seeded experiments on the M/M/s queue with s=1 and s=4.", } @INPROCEEDINGS{Veir89:Traffic, AUTHOR="B. Veir", TITLE="Traffic Measurement on Variable Bit Rate {(VBR)} Sources with Application to Charging Principles", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES="VIII.2 (18)", YEAR=1989, KEYWORDS="ATM; traffic measurement", ABSTRACT="The paper proposes a method making it possible to measure traffic from variable bit rate (VBR) sources as they occur in the emerging Asynchronous Transfer Mode (ATM) networks. The method is a kind of mixture of a sampling process as it is known from classical communication engineering and of the Karlsson scanning method as it is used in the telephone networks in the Scandinavian countries and in Germany.", } @TECHREPORT{Virt89:Elementary, AUTHOR="J. T. Virtamo", TITLE="Some Elementary Considerations on Control, Policing and Charging in {ATM} Systems", INSTITUTION="COST-224", ADDRESS="Finland", NUMBER="TD (89) 34", PAGES=3, YEAR=1989, KEYWORDS="ATM; source policing; charging", } @INPROCEEDINGS{Voig89:Av, AUTHOR="H. Voigt", TITLE="Studie av Dynamiken i Ett Nät med Överbelastade Noder", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=8, YEAR=1989, LANGUAGE="Swedish", KEYWORDS="Overload control", ABSTRACT="Trafikbilden i ett nät förändras ständigt. För det mesta är förändringarna mjuka ibland inträffar händelser som förändrar situationen radikalt, t.ex. naturkatastrof eller kabelbrott. Även små omdiringar av trafik kan för delar av nätet upplevas som radikala förändringar. Oavsett orsak till eller omfattning av dynamiken är det virktigt med väl fungerande skyddsmekanismer, både belastningsregleringar i noderna och nätöverva", } @ARTICLE{Wagn8904:Decade, AUTHOR="H. Wagner and M. H. Rothkopf and C. J. Thomas and H. J. Miser", TITLE="The Next Decade in Operations Research: Comments on the {CONDOR} Report", JOURNAL=or, VOLUME=37, NUMBER=4, PAGES="664-672", YEAR=1989, KEYWORDS="Queueing theory", } @TECHREPORT{Wall89:Solution, AUTHOR="J. F. E. Wallin", TITLE="The Solution of Difference Equations in Telephone Traffic Theory", INSTITUTION="Neher Laboratories, PTT Research", ADDRESS="Netherlands", NUMBER="Publication 40 RNL/8", PAGES=45, YEAR=1989, KEYWORDS="Traffic theory; difference equation; Brockmeyer function; binomial moments", } @ARTICLE{Wein89:Capacity, AUTHOR="L. M. Wein", TITLE="Capacity Allocation in Generalized Jackson Networks", JOURNAL=orl, VOLUME=8, PAGES="143-146", YEAR=1989, KEYWORDS="network; network design; Brownian approximation", ABSTRACT="We consider a capacity allocation problem for a generalized Jackson network (a Jackson network with general interarrival time and service time distributions). The problem is to determine the service rate (or capacity) that minimizes the expected equilibrium customer delay subject to a linear budget constraint on the capacities. The problem is analyzed using a Brownian approximation of the generalization", } @ARTICLE{Wrig8904:Model, AUTHOR="M. Wright", TITLE="A Performance Model of Packet Switched Networks with Bursty Traffic", JOURNAL=infor, VOLUME=27, NUMBER=4, PAGES="418-429", YEAR=1989, KEYWORDS="Packet switching; bursty traffic", } @ARTICLE{Wu89:Maximum, AUTHOR="J. S. Wu and W. C. Chan", TITLE="Maximum Entropy Analysis of Multiple-server Queueing Systems", JOURNAL=jors, VOLUME=40, NUMBER=9, PAGES="815-825", YEAR=1989, KEYWORDS="information theory; queueing system", } @ARTICLE{Yao89:Modeling, AUTHOR="D. D. Yao", TITLE="Modeling Flexible Manufacturing Systems Using Product-form Queueing Networks", EDITOR="J. A. White and Jr. I.W. Pence", JOURNAL="Progress in Materials Handling and Logistics", PUBLISHER="Springer-Verlag", VOLUME=1, PAGES="223-235", YEAR=1989, KEYWORDS="Manufacturing system; queueing network; product form", } @ARTICLE{Yosh8901:Application, AUTHOR="M. Yoshida and D. Namba and S. Ikeda and M. Baba", TITLE="Application of Knowledge Engineering to Computer System Diagnosis", JOURNAL=recl, ADDRESS="Japan", VOLUME=37, NUMBER=1, PAGES="9-14", YEAR=1989, KEYWORDS="Knowledge engineering", ABSTRACT="This paper describes methods for applying knowledge engineering techniques to the identification of faulty hardware components in a computer system and to the support of high-performance database design. The techniques described here simplify construction of systems having no definite algorithm or whose diagnostic object structures may have an infinite variety in each target system. In the knowledge representation of the", } @ARTICLE{Yuha89:Modeling, AUTHOR="S. J. Yuhaski and Jonathan Smith", TITLE="Modeling Circulation Systems in Buildings Using State Dependent Queueing Models", JOURNAL=qs, VOLUME=4, PAGES="319-338", YEAR=1989, KEYWORDS="state dependent queueing; queueing network; planning", ABSTRACT="Facility Planning", } @ARTICLE{Inam8901:Control, AUTHOR="H. Inamori and H. Yoshino and H. Komagata and Y. Yasuda", TITLE="Performance Evaluation for Control Channel Access Schemes in Mobile Satellite Communication Systems", JOURNAL="The Transactions of the IEICE", VOLUME="E72", NUMBER=1, PAGES="43-54", YEAR=1989, KEYWORDS="Satellite radio; access protocol", ABSTRACT="This paper presents ``busy/idle signal'' scheme for control channel in mobile satellite communication systems. In the design of channel access schemes in mobile satellite communication systems, the following three factors must be taken into account: (1) a control channel is shared by call setup signals and response signals, (2) differences in propagation delays occur depending on the distance between the satellite and the m", } @ARTICLE{Ishi8907:Analytical, AUTHOR="K. Ishida and J. Miyao and T. Kikuno and N. Yoshida", TITLE="On Analytical Evaluation of Cluster-Based Routing for Real-Time Computer Networks", JOURNAL="The Transactions of the IEICE", VOLUME=72, NUMBER=7, PAGES="843-851", YEAR=1989, KEYWORDS="Computer network; network planning; routing", } @ARTICLE{Ishi8901:Simulation, AUTHOR="K. Ishida and J. Miyao and N. Yoshida", TITLE="A Simulation Experiment on Optimality of Path Length for Hierarchical Routing Schemes", JOURNAL="The Transactions of the IEICE", VOLUME="E72", NUMBER=1, PAGES="4-6", YEAR=1989, KEYWORDS="Hierarchical routing; simulation", ABSTRACT="We present comparative analysis of average behaviour based on path length for hierarchical routing schemes. The analyzed schemes are K-scheme (by Kamoun et al.), G-scheme (by Garcia et al.), and I-scheme (by the authors). The analysis is performed by simulation experiments. The results show that I-scheme is superior to both K- and G-schemes, and that K-scheme is better than G-scheme with respect to path length. Additional", } @ARTICLE{Ishi8901:KBMS, AUTHOR="S. Ishigaki and I. Morihara and K. Kushima", TITLE="{KBMS} - An Expert System Building Tool", JOURNAL=recl, ADDRESS="Japan", VOLUME=37, NUMBER=1, PAGES="3-7", YEAR=1989, KEYWORDS="Expert system", ABSTRACT="KBMS (Knowlwdge-Base Management System) is an expert system building tool that assigns first priority to practicality of ease of use. Intended for application to real domains, KBMS features knowledge expression capability, a high-speed inference function which can be applied across many domains, an easy-to-use knowledge base structure, and ready adaptability to a network environment.", } @ARTICLE{Itoh8902:Telephone, AUTHOR="H. Itoh", TITLE="Telephone Calling Behavior Model", JOURNAL=recl, ADDRESS="Japan", VOLUME=37, NUMBER=2, PAGES="149-154", YEAR=1989, KEYWORDS="Telephony; traffic source model", ABSTRACT="A mathematical model based on the probability of a call being made to each called party is developed in which the probability is expressed by two parameters: N, number of parties a user calls, and beta: a value expressing call concentration to each party. The model is used to evaluate a telephone system which makes a personal directory automatically by learning from the users telephone calling behaviour. The evaluation is", } @INPROCEEDINGS{Jaco89:Fluid, AUTHOR="S. B. Jacobsen and Lars Dittmann and K. Moth", TITLE="A Fluid Flow Queueing Model for Heterogeneous On/Off Traffic", BOOKTITLE="NTS 8", ADDRESS="Otnäs, Sweden", PAGES=16, YEAR=1989, KEYWORDS="Queueing system; fluid flow model", ABSTRACT="This paper extends the well known Fluid Flow queueing model for identical on/off sources, also called the uniform arrival and service model, to the case with heterogeneous on/off traffic. The equilibrium buffer distribution is found to a set of first order differential equations. All eigenvalues are found as roots of a set of uncomplicated functions and the eigenvalues are found as coeffcients.", } @ARTICLE{Abde8901:Spread, AUTHOR="A. H. Abdelmonem and T. N. Saadawi", TITLE="Performance Analysis of Spread Spectrum Packet Radio Network with Channel Load Sensing", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=1, PAGES="161-166", YEAR=1989, REFERENCES=19, KEYWORDS="CDMA; Packet Radio; Spread Spectrum; Performance Evaluation", } @ARTICLE{Arnb8902:Graphical, AUTHOR="J. C. Arnbak and J. H. Bons and J. W. Vieveen", TITLE="Graphical correspondence in electronic-mail networks using personal computers", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=2, PAGES="257-267", YEAR=1989, REFERENCES=14, KEYWORDS="Computer Network; Communication Network; Graphics; Graphical Input", } @ARTICLE{Asch8908:Digital, AUTHOR="G. Ascheid and M. Oerder and J. Stahl and Heinrich Meyr", TITLE="An All Digital Receiver Architecture for Bandwidth Efficient Transmission at High Data Rates", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=8, PAGES="804-813", YEAR=1989, REFERENCES=19, KEYWORDS="Data Communication; High Speed; Transmission", } @ARTICLE{Bahr8907:Maximum, AUTHOR="K. A. Bahr", TITLE="Maximum-Integration als Lösung für Paketvermittlung in {TK-Anlagen}", JOURNAL=ntz, ADDRESS="Germany", VOLUME=12, NUMBER=7, PAGES="418-422", YEAR=1989, LANGUAGE="German", REFERENCES=6, KEYWORDS="Data Network; Packet Switching; X.25; ISDN", } @ARTICLE{Bar8912:Collision, AUTHOR="A. Bar-David and M. Sidi", TITLE="Collision Resolution Algorithms in Multistation Packet Radio Networks", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=12, PAGES="1387-1391", YEAR=1989, REFERENCES=12, KEYWORDS="Multiple Access; Packet Radio; Collision Resolution", } @ARTICLE{Bate8904:General, AUTHOR="A. Bateman", TITLE="A General Analysis of Bit Error Probability for Reference-Based {BPSK} Mobile Data Transmission", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=4, PAGES="398-402", YEAR=1989, REFERENCES=16, KEYWORDS="Data Communication; Mobile Radio; Bit Error; Probability; Analysis; Fading", } @ARTICLE{Beet8901:Nutzung, AUTHOR="B. H. Beetz", TITLE="Nutzung von Breitband-Kommunikationsnetzen in der Weiterbildung", JOURNAL=ntz, ADDRESS="Germany", VOLUME=12, NUMBER=1, PAGES="14-19", YEAR=1989, LANGUAGE="German", REFERENCES=20, KEYWORDS="Broadband; Communication Network; Application", } @ARTICLE{Bern8901:User, AUTHOR="R. C. Bernhardt", TITLE="User access in portable radio systems in co-channel interference environment", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=1, PAGES="49-58", YEAR=1989, REFERENCES=14, KEYWORDS="Multiple Access; Communication Network; Mobile Radio; Access Control; Simulation", } @ARTICLE{Bodn8903:Modeling, AUTHOR="B. L. Bodnar and A. C. Liu", TITLE="Modeling and performance analysis of single-bus tightly coupled multiprocessors", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=3, PAGES="464-470", YEAR=1989, REFERENCES=14, KEYWORDS="Distributed System; Queueing System; Performance Evaluation; Multiprocessor System; Shared Bus", } @ARTICLE{Buch8908:VSAT, AUTHOR="J.-D. Büchs", TITLE="{VSAT} - Sprach- und Datenkommunkation über private Satellitenterminals", JOURNAL=ntz, ADDRESS="Germany", VOLUME=12, NUMBER=8, PAGES="511-515", YEAR=1989, LANGUAGE="German", KEYWORDS="Data Network; Satellite Radio; ISDN; Communication Network", } @ARTICLE{Choi8911:Waiting, AUTHOR="D. Choi", TITLE="Waiting Time Jitter Reduction", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=11, PAGES="1231-1236", YEAR=1989, REFERENCES=5, KEYWORDS="Multiplexing; Waiting Time; Jitter; Analysis; Reduction", } @ARTICLE{Cimi8912:Optical, AUTHOR="Len Cimini", TITLE="Optical Phase Division Multiplexing for Local Communications Applications", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=12, PAGES="1282-1292", YEAR=1989, REFERENCES=25, KEYWORDS="Optical LAN; Bus; Multiplexing", } @ARTICLE{Coop8912:Broadband, AUTHOR="M. Cooperman and A. Paige and R. W. Sieber", TITLE="Broadband Video Switching", JOURNAL=ieeecm, VOLUME=27, NUMBER=12, PAGES="26-30", YEAR=1989, REFERENCES=10, KEYWORDS="Broadband; Fast Packet Switching; B-ISDN; Hardware", } @ARTICLE{Davi8905:Random, AUTHOR="R. David and A. Fuentes and B. Courtois", TITLE="Random Pattern Testing Versus Deterministic Testing of {RAM's}", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=5, PAGES="637-650", YEAR=1989, REFERENCES=28, KEYWORDS="RAM; Testing; Markov Chain", } @ARTICLE{Davi8901:Meteor, AUTHOR="S. Davidovici and E. G. Kanterakis", TITLE="Performance of a Meteor-Burst Communication System Using Packet Messages with Variable Data Rates", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=1, PAGES="6-17", YEAR=1989, REFERENCES=23, KEYWORDS="Packet Radio; performance evaluation; variable rate", } @ARTICLE{DelR8904:New, AUTHOR="E. Del Re and Romano Fantacci and D. Maffucci", TITLE="A New Speech Signal Scrambling Method for Secure Communications: Theory, Implementation, and Security Evaluation", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=4, PAGES="474-480", YEAR=1989, REFERENCES=9, KEYWORDS="Communication System; Scrambler; Security; Implementation", } @ARTICLE{Fang8902:Communication, AUTHOR="Z. Fang and Xiao Li and L. M. Ni", TITLE="On the Communication Complexity of Generalized {2-D} Convolution on Array Processors", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=2, PAGES="184-194", YEAR=1989, REFERENCES=27, KEYWORDS="Convolution Algorithm; Parallel Algorithm; Array Processor; Communication Model; Hypercube; Shuffle Exchange", } @ARTICLE{Fili8905:Structural, AUTHOR="J. Filipiak", TITLE="M-Architecture: A Structural Model of Traffic Management and Control in Broadband {ISDNs}", JOURNAL=ieeecm, VOLUME=27, NUMBER=5, PAGES="25-31", YEAR=1989, REFERENCES=20, KEYWORDS="Broadband; Communication; ATM; Network Architecture; Traffic Control; Heterogeneous Traffic", } @ARTICLE{Fosc8912:Reliability, AUTHOR="G. J. Foschini", TITLE="Reliability of the Repelling Carrier Method of Implementing Optical {FDMA}", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=12, PAGES="1275-1281", YEAR=1989, REFERENCES=11, KEYWORDS="Optical LAN; Multiple Access", } @ARTICLE{Fran8905:Comments, AUTHOR="Colin Frank and M. B. Pursley", TITLE="Comments on ``Packet Error Probabilities in Frequency-Hopped Spread-Spectrum Packet Radio Networks - Memoryless Frequency-Hopping Patterns Considered''", JOURNAL=ieeetc, VOLUME="COM-37", NUMBER=5, PAGES="295-298", YEAR=1989, REFERENCES=5, KEYWORDS="Packet radio; bit error; non-Markov process; error probability", ABSTRACT="refers to article by Georgiopoulos, M., IEEE Transactions on Communications, COM-36 (6), June 1988, pp. 720-723", } @ARTICLE{Ganz8910:Path, AUTHOR="A. Ganz and I. Chlamtac", TITLE="Path Allocation Access Control in Fiber Optic Communication Systems", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=10, PAGES="1372-1382", YEAR=1989, REFERENCES=20, KEYWORDS="Star Network; High Speed; Optical LAN; Access Control; Switching Methodology; Performance Evaluation", } @ARTICLE{Gavi8908:Optical, AUTHOR="Bezalel X Gavish and P. Trudeau and M. Dror and M. Gendreau and L. G. Mason", TITLE="Optical-fiber network design under reliability constraints", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=8, PAGES="1181-1187", YEAR=1989, REFERENCES=14, KEYWORDS="Circuit Switching; Network Design; Reliability", } @ARTICLE{Gbur8903:Note, AUTHOR="P. Gburzynski and P. Rudnicki", TITLE="A Note on the Performance of {ENET} {II}", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=3, PAGES="424-427", YEAR=1989, REFERENCES=5, KEYWORDS="Protocol Engineering; Protocol Performance; Comparison; Ethernet", } @ARTICLE{Gees8908:Funding, AUTHOR="B. M. Geeslin", TITLE="Funding the Future Telecommunication Infrastructure", JOURNAL=ieeecm, VOLUME=27, NUMBER=8, PAGES="24-27", YEAR=1989, REFERENCES=5, KEYWORDS="Communication System; Future Outlook; Forecasting", } @ARTICLE{Grot8904:Prozeßdaten, AUTHOR="G. Groth and W. Kienzle", TITLE="Prozeßdaten bermittlung in öffentlichen Netzen", JOURNAL=ntz, ADDRESS="Germany", VOLUME=12, NUMBER=4, PAGES="210-213", YEAR=1989, LANGUAGE="German", REFERENCES=6, KEYWORDS="Data Transmission; Application; Public Network; Survey", } @ARTICLE{Grot8904:Bewertung, AUTHOR="G. Groth and R. Schnee", TITLE="Bewertung von öffentlichen Übermittlungsdiensten für Prozeßdaten bermittlung", JOURNAL=ntz, ADDRESS="Germany", VOLUME=12, NUMBER=4, PAGES="220-224", YEAR=1989, LANGUAGE="German", REFERENCES=6, KEYWORDS="Data Transmission; Public Network; Application; Survey", } @ARTICLE{Guer8903:Französischer, AUTHOR="L.-P. Guerini", TITLE="Französischer Schiffbruch mit Glasfaser-Breitbandnetz", JOURNAL=ntz, ADDRESS="Germany", VOLUME=42, NUMBER=3, PAGES="170, 172", YEAR=1989, LANGUAGE="German", KEYWORDS="Broadband; Fiber Optics; Network Planning", } @ARTICLE{Ha8902:Personal, AUTHOR="T. T. Ha", TITLE="Personal Computer Communications Via {VSAT} Networks", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=2, PAGES="235-245", YEAR=1989, REFERENCES=21, KEYWORDS="Satellite radio; PC; CDMA; multiple access; network Design; network management; error control; performance evaluation", } @ARTICLE{Habb8901:ALOHA, AUTHOR="Isam M. I. Habbab and Mohsen Kavehrad and C.-E. W. Sundberg", TITLE="{ALOHA} with Capture Over Slow and Fast Fading Radio Channels with Coding and Diversity", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=1, PAGES="79-88", YEAR=1989, REFERENCES=20, KEYWORDS="Packet Radio; Fading; ALOHA; Multiple Access; Delay Throughput Characteristics", } @ARTICLE{Haya8902:Personal, AUTHOR="K. Hayashi and C. Motegi", TITLE="Personal Computer Image Communications Using Facsimile", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=2, PAGES="276-282", YEAR=1989, REFERENCES=13, KEYWORDS="Image Transfer; PC; Protocol Implementation; Man-Machine Interaction", } @ARTICLE{Hong8912:Minumum, AUTHOR="J. P. Hong and X. Tan and Donald F. Towsley", TITLE="A Performance Analysis of Minumum Laxity and Earliest Deadline Scheduling in a Real-Time System", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=12, PAGES="1736-1744", YEAR=1989, REFERENCES=14, KEYWORDS="Real time; Scheduling; Performance Evaluation; Markov Chain", } @ARTICLE{Kien8904:Anforderungen, AUTHOR="W. Kienzle and K. Weber", TITLE="Anforderungen an die Prozeßdaten bermittlung aus Anwendersicht", JOURNAL=ntz, ADDRESS="Germany", VOLUME=12, NUMBER=4, PAGES="214-219", YEAR=1989, LANGUAGE="German", REFERENCES=4, KEYWORDS="Data Transmission; Public Network; Application; Overview; Availability", } @ARTICLE{Knod8908:Universelles, AUTHOR="D. Knodel", TITLE="Universelles Telekommunikationsnetz für Breitbanddienste", JOURNAL=ntz, ADDRESS="Germany", VOLUME=12, NUMBER=8, PAGES="494-501", YEAR=1989, LANGUAGE="German", REFERENCES=11, KEYWORDS="Broadband; Communication Network; Data Network; ISDN; B-ISDN; Network Design; Switching Component", } @ARTICLE{Kohl8912:Medical, AUTHOR="Jagdish C. Kohli", TITLE="Medical Imaging Applications of Emerging Broadband Networks", JOURNAL=ieeecm, VOLUME=27, NUMBER=12, PAGES="8-16", YEAR=1989, REFERENCES=19, KEYWORDS="Image Transfer; Broadband; Application", } @ARTICLE{Lehn8908:Efficient, AUTHOR="J. S. Lehnert", TITLE="An Efficient Technique for Evaluating Direct-Sequence Spread-Spectrum Multiple-Access Communications", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=8, PAGES="851-858", YEAR=1989, REFERENCES=11, KEYWORDS="Multiple Access; Spread Spectrum; Error Probability", } @ARTICLE{Lewi8902:Bandwidth, AUTHOR="J. M. Lewis", TITLE="Bandwidth Utilization of a Large Local Area Network", JOURNAL=ieeecm, VOLUME=27, NUMBER=2, PAGES="25-30", YEAR=1989, REFERENCES=8, KEYWORDS="LAN; Utilization; Measurement; DECNET; ETHERNET; VAX/VMS", } @ARTICLE{Liew8902:Comments, AUTHOR="S. C. Liew", TITLE="Comments on ``Fundamental Conditions Governing {TDM} Switching Assignments in Terrestrial and Satellite Networks''", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=2, PAGES="187-189", YEAR=1989, REFERENCES=2, KEYWORDS="TDM; Switching; Satellite Radio; Max Flow; Proof", ABSTRACT="Original paper by Eng, K.Y.; Acampora, A.S. IEEE Transactions Comm. COM-35, July 1987, pp. 755-761", } @ARTICLE{Liew8912:New, AUTHOR="S. C. Liew and K. W. Lu", TITLE="New Architecture for Diversity in Fiber Loop Networks", JOURNAL=ieeecm, VOLUME=27, NUMBER=12, PAGES="31-37", YEAR=1989, REFERENCES=7, KEYWORDS="Broadband; Multiplexing; Fiber Optics; Alternate Routing; Architecture", } @ARTICLE{Lin8910:Fiber, AUTHOR="Y. Lin and D. R. Spears and M. Yin", TITLE="Fiber-Based Local Access Network Architectures", JOURNAL=ieeecm, VOLUME=27, NUMBER=10, PAGES="64-73", YEAR=1989, REFERENCES=52, KEYWORDS="Optical LAN; Network Architecture; Network Topology; TDM; ATM", } @ARTICLE{Link8904:Kosten, AUTHOR="V. Link and R. Dinges", TITLE="Kosten der Prozeßdaten bermittlung in öffentlichen Netzen", JOURNAL=ntz, ADDRESS="Germany", VOLUME=12, NUMBER=4, PAGES=226, YEAR=1989, LANGUAGE="German", REFERENCES=5, KEYWORDS="Data Transmission; Cost; Telephone Channel; TELEX; DATEX-L; DATEX-P", } @ARTICLE{Lu8910:Secure, AUTHOR="Wen-Pai Lu and M. Sundareshan", TITLE="Secure Communication in {Internet} Environments: A Hierarchical Key Management Scheme for End-To-End Encryption", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=10, PAGES="1014-1023", YEAR=1989, REFERENCES=16, KEYWORDS="Computer Communication; Security; Encryption", } @ARTICLE{Mgel8912:DFS, AUTHOR="M. Mägele and M. Morgenroth and D. Plesse and H. W rtz", TITLE="{DFS-Kopernikus} geht in Betrieb", JOURNAL=ntz, ADDRESS="Germany", VOLUME=12, NUMBER=12, PAGES=762, YEAR=1989, LANGUAGE="German", REFERENCES=4, KEYWORDS="Satellite Radio; Data Network", } @ARTICLE{Masu8905:Tolerance, AUTHOR="H. Masuyama and T. Ichimori", TITLE="Tolerance of Double-Loop Computer Networks to Multinode Failures", JOURNAL=ieeetc, VOLUME=38, NUMBER=5, PAGES="738-741", YEAR=1989, REFERENCES=6, KEYWORDS="Computer Network; Ring Network; Fault Tolerance", } @ARTICLE{Minz8902:New, AUTHOR="S. E. Minzer and D. R. Spears", TITLE="New Directions in Signaling for Broadband {ISDN}", JOURNAL=ieeecm, VOLUME=27, NUMBER=2, PAGES="6-14(, 52)", YEAR=1989, REFERENCES=30, KEYWORDS="B-ISDN; ATM; Signalling Protocol; Q.931; ISDN; Fast Packet Switching", } @ARTICLE{Mroz8904:Fernablesen, AUTHOR="D. Mrozinski", TITLE="Fernablesen von Zählerständen mit Zweidraht-Bus und Temex", JOURNAL=ntz, ADDRESS="Germany", VOLUME=42, NUMBER=4, PAGES="240-242", YEAR=1989, LANGUAGE="German", KEYWORDS="Data Network; application", } @ARTICLE{Mhlb8901:Mehrpunkt, AUTHOR="L. M hlbach and M. Arif and K. Hopf and G. Romahn", TITLE="Mehrpunkt-Telekonferenzen - Nutzeruntersuchungen mit verschiedenen Varianten", JOURNAL=ntz, ADDRESS="Germany", VOLUME=12, NUMBER=1, PAGES=8, YEAR=1989, LANGUAGE="German", REFERENCES=14, KEYWORDS="Teleconference; Field Trial", } @ARTICLE{Mura8903:Control, AUTHOR="Kurenai Murakami and M. Katoh", TITLE="Control Architecture for Next-Generation Communication Networks Based on Distributed Databases", JOURNAL=ieeejsac, VOLUME="SAC-7", NUMBER=3, PAGES="418-423", YEAR=1989, REFERENCES=5, KEYWORDS="Communication Network; Routing; Control System; Distributed Database; Switching System; High Speed; Signalling", } @ARTICLE{Murt8905:VSAT, AUTHOR="K. M. S. Murthy and K. D. Gordon", TITLE="{VSAT} Networking Concepts and New Applications Development", JOURNAL=ieeecm, VOLUME=27, NUMBER=5, PAGES="43-49", YEAR=1989, REFERENCES=9, KEYWORDS="Satellite Radio; Broadcast; WAN; ISDN; Application", } @ARTICLE{Proh8903:Decoupling, AUTHOR="C. G. Prohazka", TITLE="Decoupling Link Scheduling Constraints in Multihop Packet Radio Networks", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=3, PAGES="455-458", YEAR=1989, REFERENCES=10, KEYWORDS="Multihop; Packet Radio; Computer Network; TDM; Time Slot", } @ARTICLE{Purs8911:Variable, AUTHOR="M. B. Pursley and S. D. Sandberg", TITLE="Variable-Rate Coding for Meteor-Burst Communications", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=11, PAGES="1105-1112", YEAR=1989, REFERENCES=8, KEYWORDS="Packet radio; VBR; Reed-Solomon Code; Throughput; Performance evaluation", } @ARTICLE{Quat8906:Far, AUTHOR="T. F. Quatieri and Gerald C. O'Leary", TITLE="Far-Echo Cancellation in the Presence of Frequency Offset", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=6, PAGES="635-644", YEAR=1989, REFERENCES=19, KEYWORDS="Echo Canceller; Modem", } @ARTICLE{Ried8908:Überregionales, AUTHOR="M. Riede and B. Widmann", TITLE="Überregionales Hochgeschwindigkeitsnetz unter Nutzung des {VBN}", JOURNAL=ntz, ADDRESS="Germany", VOLUME=12, NUMBER=8, PAGES="480-485", YEAR=1989, LANGUAGE="German", REFERENCES=11, KEYWORDS="Broadband; Communication; High Speed; Data Network; Ethernet; FDDI; FDDI-II", } @ARTICLE{Robr8912:Test, AUTHOR="A. A. Robrock", TITLE="Test Yourself: How Much Do You Know About International Communications?", JOURNAL=ieeecm, VOLUME=27, NUMBER=12, PAGES="38-40", YEAR=1989, KEYWORDS="Telephony; Communication System", } @ARTICLE{Sale8908:Code, AUTHOR="Jawad A. Salehi", TITLE="Code Division Multiple-Access Techniques in Optical Fiber Networks - Part {I:} Fundamental Principles", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=8, PAGES="824-833", YEAR=1989, REFERENCES=14, KEYWORDS="CDMA; Fiber Optics; Communication System; Autocorrelation", } @ARTICLE{Schm8907:Programm, AUTHOR="W. Schmitt and G. von der Straten", TITLE="Das Programm ``Race'' nach der zweiten Ausschreibung", JOURNAL=ntz, ADDRESS="Germany", VOLUME=42, NUMBER=7, PAGES="428-433", YEAR=1989, LANGUAGE="German", REFERENCES=9, KEYWORDS="Broadband; communication; planning; implementation", } @ARTICLE{Shar8902:VSAT, AUTHOR="R. L. Sharma", TITLE="{VSAT} Network Economics: A Comparative Analysis", JOURNAL=ieeecm, VOLUME=27, NUMBER=2, PAGES="31-35", YEAR=1989, REFERENCES=2, KEYWORDS="Satellite Radio; Communication System; Cost; Comparison; Economic Evaluation", } @ARTICLE{Shar8901:Global, AUTHOR="S. E. Sharp", TITLE="Global Networks", JOURNAL=ieeecm, VOLUME=27, NUMBER=1, PAGES="20-21", YEAR=1989, KEYWORDS="Communication System", } @ARTICLE{Shen8912:Optimal, AUTHOR="S. Shenker and A. Weinrib", TITLE="The Optimal Control of Heterogeneous Queueing Systems: A Paradigm for Load-Sharing and Routing", JOURNAL=ieeetc, VOLUME="C-38", NUMBER=12, PAGES="1724-1735", YEAR=1989, REFERENCES=29, KEYWORDS="Queueing System; optimal control; Analysis; Optimization; Multiserver; Routing; Scheduling", } @ARTICLE{Shwa8911:Erasure, AUTHOR="A. Shwartz and M. Sidi", TITLE="Erasure, capture, and noise errors in controlled multiaccess networks", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=11, PAGES="1228-1231", YEAR=1989, REFERENCES=12, KEYWORDS="Communication System; ALOHA; Multiple Access; Failure; Error Analysis; Throughput Performance", } @ARTICLE{Spin8905:Event, AUTHOR="J. M. Spinelli and Robert Gallager", TITLE="Event-Driven Topology Broadcast Without Sequence Numbers", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=5, PAGES="468-474", YEAR=1989, REFERENCES=17, KEYWORDS="Network Topology; Event Driven; Broadcast", } @ARTICLE{Stor8908:Throughput, AUTHOR="J. S. Storey and F. A. Tobagi", TITLE="Throughput Performance of an Unslotted Direct-Sequence {SSMA} Packet Radio Network", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=8, PAGES="814-823", YEAR=1989, REFERENCES=19, KEYWORDS="Packet Radio; Spread Spectrum; Multiple Access; Fully Connected Network; Viterbi; Error Control; Throughput Performance; Approximation", } @ARTICLE{Wagn8903:WDM, AUTHOR="S. S. Wagner and Haim Kobrinski", TITLE="{WDM} Applications in Broadband Telecommunication Networks", JOURNAL=ieeecm, VOLUME=27, NUMBER=3, PAGES="22-30", YEAR=1989, REFERENCES=39, KEYWORDS="Broadband; Communication Network; Application", } @ARTICLE{Wu8906:Random, AUTHOR="Chengke Wu and V. Li", TITLE="Random Access for a Multibeam Satellite with Dynamic Transponder Switching", JOURNAL=ieeecom, VOLUME="COM-37", NUMBER=6, PAGES="651-655", YEAR=1989, REFERENCES=5, KEYWORDS="Packet Switching; Multiple Access; Satellite Radio; Random Access; Slotted ALOHA", } @ARTICLE{Yoko8904:Grade, AUTHOR="Tadahiro Yokoi and K. Kodaira", TITLE="Grade of Service in the {ISDN} Era", JOURNAL=ieeecm, VOLUME=27, NUMBER=4, PAGES="46-50", YEAR=1989, REFERENCES=24, KEYWORDS="GOS; Specification; Method; CCITT; ISDN", } @BOOK{Berg89:Leistungsmodellierung, AUTHOR="G. Bergholz", TITLE="Leistungsmodellierung von Rechnersystemen", ISBN="3-05-500474-4", PUBLISHER="Akademie-Verlag Berlin", ADDRESS="Berlin, Germany", PAGES=223, YEAR=1989, LANGUAGE="German", REFERENCES=113, KEYWORDS="Modeling; performance model; performance evaluation", ABSTRACT="Einführung in die Leistungsmodellierung von Rechnersystemen; Strukturelle Beschreibung sequentiell-paralleler Prozesse mit Hilfedes Forderungslaufplanes; Stochastische Modellierung sequentiel l-paralleler Prozesse; Ausgewählte Bedienungssysteme der Leistungsmodellierung; Struktureller Aufbau der Rechenprozesse eines Rechnersystems; Modellierung der Stapelverarbeitung; Modellierung der Dialogverarbeitung; Optimale Gestaltung des Rechnersystems", } @TECHREPORT{Cido89:Asynchronous, AUTHOR="I. Cidon and M. Sidi", TITLE="Performance Analysis of Asynchronous Transfer Mode {(ATM)} Systems", TYPE="Research Report", INSTITUTION="IBM", NUMBER="RC 14395", PAGES=16, YEAR=1989, REFERENCES=9, KEYWORDS="ATM; multiplexer; performance evaluation; ND/D/1", ABSTRACT="We study various performance issues related to ATM systems. Specifically, the grade of performance provided by an ATM system to both real-time and non real-time traffic is analysed. The underlaying queueing model is a discrete time queue with peridic arrivals and i.i.d. arrivals that correspond to real-time and non real-time traffic resp. We develop efficient computational algorithms (recursive computation) for obtaining the delay distribution", } @INPROCEEDINGS{Amem89:Architecture, AUTHOR="S. Amemiya and H. Takeo and K. Tezuka and K. Iguchi", TITLE="An Architecture of Optical Passive Bus for Broadband {CPN}", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", PAGES="46.2", YEAR=1989, KEYWORDS="Architecture; ATM; broadband; CPN", } @BOOK{Bler89:Handbuch, AUTHOR="R. Bäßler and A. Deutsch", TITLE="Handbuch der Nachrichtenelektronik - Nachrichtennetze", PUBLISHER="VEB Verlag Technik", ADDRESS="Germany", YEAR=1989, KEYWORDS="Capacity planning; communication network; network planning; planning; traffic theory", } @ARTICLE{Bult89:Propagation, AUTHOR="Robert J.C. Bultitude and G. K. Bedal", TITLE="Propagation Charakteristics on Microcellular Urban Mobile Radio Channels at 910 {MHz}", JOURNAL=ieeejsac, VOLUME=7, NUMBER=1, PAGES="31-39", YEAR=1989, REFERENCES=22, KEYWORDS="Mobile radio; radio channel", ABSTRACT="It has been proposed in current literature that future urban mobile radio systems be configured with many small cells having low-powered base stations with street-lamp-level antennas. This configuration contrasts wirh conventional designs for urban mobile systems in which one centrally located, high-powered base station with an elevated antenna is employed to serve a large coverage area. The results of measurements made to determine propagation", } @ARTICLE{Cohe89:Distributed, AUTHOR="Richard M. Cohen and A. Segall", TITLE="Distributed query algorithms for high-speed networks", JOURNAL=phsn, PUBLISHER="Elsevier Science Publishers B.V. (North-Holland), IFIP 1989", PAGES="269-276", YEAR=1989, REFERENCES=6, KEYWORDS="Packet switching; routing algorithm", ABSTRACT="In order to exploit the transmission rate of networks that use high-speed communication techniques, the time required to process packets in intermediate nodes must be as small as possible. Consequntly, distributed network protocols must be redesigned whenapplied to networks with high-speed links, where some priority should be given to simplify the code at the nodes. The present paper intruduces such a protocol.", } @BOOK{Gold89:Smalltalk, AUTHOR="A. Goldberg and D. Robson", TITLE="Smalltalk-80: The Language", ISBN="0-201-13688-0", PUBLISHER="Addison-Wesley Series in Computer Science, Addison Wesley", ADDRESS="Reading, Massachusetts", YEAR=1989, KEYWORDS="Event driven; object-oriented programming; simulation", ABSTRACT="The first part of the book introduces the Smalltalk-80 approach to information representation and manipulation; it also provides an overview of the syntax of the language. The second section contains specifications of the kinds of objects already present in the Smalltalk-80 programming environment. New kinds of objects can be added by a programmer, but a wide variety of objects come with the standard system. An example of adding new kinds of ob", } @BOOK{Gona89:Multiprozessor, AUTHOR="M. Gonauser and M. Mrva", TITLE="Multiprozessor-Systeme: Architektur und Leistungsbewertung", ISBN="3-540-50262-9", PUBLISHER="Springer", ADDRESS="Berlin, Germany", YEAR=1989, LANGUAGE="German", REFERENCES=137, KEYWORDS="Architecture; interconnection network; multiprocessor; multiprocessor system; performance evaluation", ABSTRACT="Das Buch behandelt den Aufbau und die Bedeutung von Multiprozessor-Systemen. Die beschriebenen Systeme - und zwar sowohl kommerziell verfügbare als auch erst im Forschungsstadium befindliche - werden auf ihre relevanten Merkmale hin untersucht und einander gegenuebergestellt. Die resultierende Klassifikation ist in dieser Form in der Literatur noch nicht vorhanden. Sie schafft zum einen Licht im Begriffsdickicht und kann zum anderen als Basis f", } @ARTICLE{Jacq89:EFFICIENT, AUTHOR="P. Jacquet and P. M hlethaler", TITLE="{AN} {EFFICIENT} {HIGH-SPEED} {ACCESS} {PROTOCOL} {FOR} {BROADCAST} {NETWORKS}", JOURNAL=phsn, PUBLISHER="Elsevier Science Publishers B.V. (North-Holland), IFIP", PAGES="237-254", YEAR=1989, REFERENCES=10, KEYWORDS="Hslan; man; tree network", ABSTRACT="This paper introduces new high-speed access protocols which canwork on various LAN topologies (star, tree, unidirectional media) and also on satellite networks. These protocols are based on free access tree algorithms. Performance evaluations have bee carried out both with simulations and analytical models; the matching between these two approaches is good. The analytical model provides the distribution of the delay under sym. Poisson traffic.", } @BOOK{Anon89:Common, AUTHOR="Anonymous", TITLE="A Common Sense Guide to Network Management", PUBLISHER="Digital", YEAR=1989, KEYWORDS="Network management; overview", ABSTRACT="This guidebook describes a common-sense level of knowledge about managing networks. It encourages readers to properly manage their networks and prepares them for future advances in management technology.", } @ARTICLE{Poll89:Vs, AUTHOR="G. P. Pollini and Z. Haas", TITLE="{E-BAMA} vs. {RAMA}", JOURNAL=ieeenet, PAGES="18-25", YEAR=1989, REFERENCES=10, KEYWORDS="Lan; media access control; performance evaluation", ABSTRACT="Under certain conditions, one of these two multiple-access protocols for mobile wireless communication offers superior throughput delay.", } @ARTICLE{Wagn89:Techniques, AUTHOR="D. B. Wagner and E. D. Lazowska and B. N. Bershad", TITLE="Techniques for efficient shared-memory parallel simulation", JOURNAL="Distributed Simulation Simulation series of the SCS", PAGES="29-37", YEAR=1989, REFERENCES=23, KEYWORDS="Common memory; distributed simulation", ABSTRACT="This paper presents a number of techniques for efficient shared memory parallel simulation. All of these techniques have been implemented in Synapse, an integrated programming environment / runtime system that supports efficient parallel discrete-event simulation on shared-memory multiprocessors. A new technique for artificial blocking and deadlock avoidance, lazy blocking avoidance, is build directly into Synapse's multi-threated run-time kern", } @ARTICLE{Colb89:Applications, AUTHOR="C. J. Colbourn and P. van Oorshot", TITLE="Applications of Combinatorial Design in Computer Science", JOURNAL=acmcs, VOLUME=21, PAGES="223-250", YEAR=1989, } @INPROCEEDINGS{Schu89:How, AUTHOR="M. Schulze and G. A. Gibson and Randy H. Katz and D. A. Patterson", TITLE="How Reliable is a {RAID?}", BOOKTITLE="COMPCON", PAGES="118-123", YEAR=1989, } @INPROCEEDINGS{Cope89:Comparison, AUTHOR="G. Copeland and T. W. Keller", TITLE="A Comparison of High-Availability Media Recovery Techniques", BOOKTITLE="ACM SIGMOD Conference", PAGES="98-109", YEAR=1989, } @ARTICLE{Ostb89:Contribution, AUTHOR="O. Ostberg and B. Lindstrom and P-O. Renhall", TITLE="Contribution of display size to speech intelligibility in video-phone systems", JOURNAL="International Journal of Human-Computer Interaction", VOLUME=1, PAGES="149-159", YEAR=1989, ABSTRACT="Widespread use of videophones has been limited due to cost factors and human factors. If demands for image size and quality were relaxed while preserving the communicational value added by visual data, low end videophones may become feasible. After a review of pertinent research, we describe an experiment indicating modest visual augmentation significantly aids speech intelligibility. The results suggest several directions for further research.", URL="http://ijhci.engr.ucf.edu/IJHCI\%20VOLUME\%201.htm", } @INPROCEEDINGS{Ash89:Dynamic, AUTHOR="G. R. Ash and E. Oberer", TITLE="Dynamic routing in the {AT\&T} Network -- improved service quality at lower cost", BOOKTITLE=globecom, ADDRESS="Dallas, Texas", VOLUME=1, PAGES="303-308 (9.1)", YEAR=1989, REFERENCES=8, KEYWORDS="Dynamic routing; ISDN; measurement; switching network", ABSTRACT="The introduction of Dynamic Non-Hierarchical Routing into the AT\\&T Switched Network was completed in 1987. It has resulted in a marked improvement in AT\\&T network connection availability while simultaneously reducing network costs. The paper describes the concept of dynamic routing and how it was implemented in the network over a several-year perios by a multi-organizational team within AT\\&T.", } @ARTICLE{Gun:bench, AUTHOR={Per Gunningberg and Mats Bj{\"o}rkman and Erik Nordmark and Stephen Pink and P. Sj{\"o}din and J.-E. Str{\"o}mqu}, TITLE="Application protocols and performance benchmarks", JOURNAL="IEE Communications Magazine", VOLUME=27, NUMBER=6, YEAR=1989, } @INPROCEEDINGS{Sjo:probe, AUTHOR={P. Sj{\"o}din and Per Gunningberg and Erik Nordmark and S. Pin}, TITLE="Towards protocol benchmarks", BOOKTITLE="Protocols for High Speed Networks", PUBLISHER="North-Holland", YEAR=1989, } @INPROCEEDINGS{Cors89:Distributed, AUTHOR="Scott Corson and Anthony Ephremides", TITLE="A Distributed Routing Algorithm for Mobile Radio Networks", BOOKTITLE="of Military Communications Conference", YEAR=1989, } @ARTICLE{Bacc8901:Queueing, AUTHOR="François Baccelli and Armand M. Makowski", TITLE="Queueing Models for Systems with Synchronization Constraints", JOURNAL=ieeeproc, VOLUME=77, NUMBER=1, PAGES="138-161", MONTH=jan, YEAR=1989, KEYWORDS="queueing theory", ABSTRACT="The authors consider queuing that occur naturally in the study of a class of resource-sharing problems under synchronization constraints such as resequencing and fork-join primitives. These queuing models are amenable to a representation in terms of a state recursion. The proposed methods of analysis are complementary and draw on classical ideas of queuing theory as well as on mathematical tools from the theory of stochastic ordering and ergodic theory. The state recursion is at the center of all aspects of the analysis, be it for developing the exact solutions, obtaining bounds on system performance or establishing the stability conditions. The ideas are illustrated on simple models of resequencing and fork-join synchronization, with emphasis put on deriving computable bounds on the performance measures.", } @ARTICLE{Cass8901:Sample, AUTHOR="Christos Cassandras and Stephen G. Strickland", TITLE="Sample Path Properties of Timed Discrete Event Systems", JOURNAL=ieeeproc, VOLUME=77, NUMBER=1, PAGES="59-71", NOTE="Special issue on Dynamics of Discrete Event Systems", MONTH=jan, YEAR=1989, KEYWORDS="perturbation analysis; discrete event systems", } @ARTICLE{Cohe8901:Algebraic, AUTHOR="G. L. Cohen and Pierre Moller and Jean-Pierre Quadrat and Michel Viot", TITLE="Algebraic Tools for the Performance Evaluation of Discrete Event Systems", JOURNAL=ieeeproc, VOLUME=77, NUMBER=1, PAGES="39-58", NOTE="Special issue on Dynamics of Discrete Event Systems", MONTH=jan, YEAR=1989, KEYWORDS="discrete event systems", } @ARTICLE{Glyn8901:GSMP, AUTHOR="P. W. Glynn", TITLE="A {GSMP} Formalism for Discrete Event Systems", JOURNAL=ieeeproc, VOLUME=77, NUMBER=1, PAGES="14-23", NOTE="Special issue on Dynamics of Discrete Event Systems", MONTH=jan, YEAR=1989, KEYWORDS="discrete event systems", } @ARTICLE{Hand8901:Evolution, AUTHOR="Rainer Händel", TITLE="Evolution of {ISDN} Towards Broadband {ISDN}", JOURNAL=ieeenet, VOLUME=3, NUMBER=1, PAGES="7-13", MONTH=jan, YEAR=1989, REFERENCES=12, KEYWORDS="ISDN; B-ISDN; ATM cell header; overview; forecasting; CCITT; user interface; network planning; protocol model; frame structure", ABSTRACT="Since about 1985, worldwide activities to evolve Integrated Services Digital Network (ISDN) into an optical-fiber-based universal broadband network have resulted in the first baseline documents, such as CCITT Recommendation I.121. The Asynchronous Transfer Mode has been established as a key element of Broadband ISDN (BISDN). The adoption of the G.707-709 recommendations on the new digital transmission hierarchy will also strongly influence further BISDN development. This article addresses network aspects of the forthcoming BISDN, including some special impacts of ATM on network scenarios and network evolution.", } @ARTICLE{Inan8901:Algebras, AUTHOR="Kemal M. Inan and P. Varaiya", TITLE="Algebras of Discrete Event Models", JOURNAL=ieeeproc, VOLUME=77, NUMBER=1, PAGES="24-38", NOTE="Special issue on Dynamics of Discrete Event Systems", MONTH=jan, YEAR=1989, KEYWORDS="discrete event systems", } @ARTICLE{Rama8901:Control, AUTHOR="Peter J. G. Ramadge and W. Murray Wonham", TITLE="The Control of Discrete Event Systems", JOURNAL=ieeeproc, VOLUME=77, NUMBER=1, PAGES="81-98", NOTE="Special issue on Dynamics of Discrete Event Systems", MONTH=jan, YEAR=1989, } @ARTICLE{Rosb8901:Resequencing, AUTHOR="Zvi Rosberg and N. Shacham", TITLE="Resequencing delay and buffer occupancy under the selective-repeat {ARQ}", JOURNAL=ieeeit, VOLUME=35, NUMBER=1, PAGES="166-173", MONTH=jan, YEAR=1989, ABSTRACT="Consider a communication network that regulates retransmissions of erroneous packets by a selective-repeat (SR) automatic repeat request (ARQ) protocol. Packets are assigned consecutive integers, and the transmitter continuously transmits them in order until a negative acknowledgement or a time-out is observed. The receiver, upon receipt of a packet, checks for errors and returns positive/negative acknowledgment (ACK/NACK) accordingly. Only packets for which either NACK or time-out have been observed are retransmitted. Under SR ARQ, the receiver accepts packets that are out of order and must store them temporarily if it has to deliver them in sequence. The resequencing buffer requirements and the resulting packet delay constitute major factors in overall system considerations. The authors derive the distributions of the buffer occupancy and the resequencing delay at the receiver under a heavy traffic situation. This enables the network designer to determine how much buffer capacity at the receiver guarantees certain specified performance measures.", } @ARTICLE{Ross8901:Optimal, AUTHOR="Keith W. Ross and D. D. Yao", TITLE="Optimal Dynamic Scheduling in Jackson Networks", JOURNAL=ieeeac, VOLUME="AC-34", NUMBER=1, PAGES="47-53", MONTH=jan, YEAR=1989, ANNOTE="Type-independent probabilistic routing. Two traffic types: interactive, with constraint on average delay, and non-interactive. Investigates policies to mimimize a weighted sum of the average delays for the noninteractive traffic types.", } @INPROCEEDINGS{Shac8901:Packet, AUTHOR="N. Shacham", TITLE="Packet resequencing under reliable transport protocols", BOOKTITLE="Hawaii International Conference on System Sciences", ADDRESS="Kailua-Kona, Hawaii", VOLUME=3, PAGES="716-723", MONTH=jan, YEAR=1989, KEYWORDS="resequencing; transport protocol", ABSTRACT="The authors constructs mathematical models that are used to derive both message resequencing delay and buffer occupancy. The models incorporate the important system parameters, such as acknowledgment delay, error rate for both packets and acknowledgments, number of receivers, and transmission rate. They are used to analyze several system configurations: (1) a transmitter-receiver pair communicating over a single channel; (2) multiple parallel channels, of diverse characteristics, which are available for the transmitter to send its message on; and (3) broadcast environment in which the transmitter has to send its message reliably to several receivers. Using these models, the author derives the distribution of resequencing delay and buffer occupancy for all these configurations and obtains limiting expressions for the worst-case scenario, in which the probability of correct message reception tends to zero. These results are discussed, and the effects of the aforementioned system parameters of the resequencing performance are determined.", } @ARTICLE{Suri8901:Perturbation, AUTHOR="R. Suri", TITLE="Perturbation Analysis: The State of the Art and Research Issues Explained via the {G/G/1} Queue", JOURNAL=ieeeproc, VOLUME=77, NUMBER=1, PAGES="114-137", NOTE="Special issue on Dynamics of Discrete Event Systems", MONTH=jan, YEAR=1989, } @ARTICLE{Scho8901:Packet, AUTHOR="Eve Schooler and Stephen Casner", TITLE="A Packet-Switched Multimedia Conferencing System", JOURNAL=sigois, VOLUME=10, NUMBER=1, PAGES="12-22", MONTH=jan, YEAR=1989, KEYWORDS="multimedia; packet voice", ABSTRACT="The Multimedia Conferencing Project, a collaborative effort between ISI and BBN Systems and Technologies Corporation, has developed an experimental system for real-time, multisite conferences. The three essential components of the conferencing environment are voice, video, and a shared workspace. The underlying communication model is based on packet-switched voice and video protocols for real-time data, operating in the Internet. Due to high bandwidth requirements, communication is currently possible only over the Wideband Satellite Network (WBnet). The BBN Diamond/MMCONF system provides a shared workspace and is used for the presentation and collaborative editing of mixed media documents. It runs on a Sun workstation along with the multimedia control program (MMCC) that establishes conference connections and controls the video cameras and monitor. This paper describes the architecture of the multimedia conferencing system, giving an introduction to each of the system's components. It presents the prototype conference configuration at ISI, describes the usage of the system, and discusses our experience with the system. It concludes with a summary of future directions.", URL="ftp://ftp.isi.edu/pub/hpcc-papers/mmc/sigois.ps", } @ARTICLE{Gech8901:Conceptual, AUTHOR="Jerry Gechter and Peter O'Reilly", TITLE="Conceptual issues for {ATM}", JOURNAL=ieeenet, VOLUME=3, NUMBER=1, PAGES="14-16", MONTH=jan, YEAR=1989, REFERENCES=6, KEYWORDS="ATM; network architecture", ABSTRACT="Critique of ATM.", } @ARTICLE{Tolc8901:Project, AUTHOR="D. J. Tolcher", TITLE="Project Admiral - the management of services on an int= ernet", JOURNAL="British Telecom Technical Journal (UK)", VOLUME=7, NUMBER=1, PAGES="20-24", MONTH=jan, YEAR=1989, } @INPROCEEDINGS{Lanz8901:Implementation, AUTHOR="L. Lanzillo and C. Partridge", TITLE="Implementation of Dial-up {IP} for {UNIX} Systems", BOOKTITLE="Winter USENIX Technical Conference", PUBLISHER="USENIX Association", ADDRESS="San Diego, California", MONTH=jan, YEAR=1989, ABSTRACT="CSNET has developed a software package to support the sending of Internet Protocol (IP) datagrams over dial-up phone lines. This driver can automatically establish and disconnect phone calls as IP traffic dictates. This code works in binary-only BSD systems.", } @ARTICLE{Chou8901:Modified, AUTHOR="A. N. Choudhary and W. Kohler and John Stankovic and Donald F. Towsley", TITLE="A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution", JOURNAL=ieeese, VOLUME=15, NUMBER=1, PAGES="10-17", MONTH=jan, YEAR=1989, } @ARTICLE{Rosb8901:TDM, AUTHOR="Zvi Rosberg and M. Sidi", TITLE="{TDM} Policies in Multistation Packet Radio Networks", JOURNAL=ieeecom, VOLUME=37, NUMBER=1, PAGES="31-38", MONTH=jan, YEAR=1989, } @ARTICLE{Wild8901:One, AUTHOR="C. Mitchell and P. Wild", TITLE="One-Stage One-Sided Rearrangeable Switching Networks", JOURNAL=ieeecom, VOLUME=37, NUMBER=1, PAGES="52-56", MONTH=jan, YEAR=1989, } @ARTICLE{Bube8901:Broadcast, AUTHOR="R. G. Bubenik and J. S. Turner", TITLE="Performance of a Broadcast Packet Switch", JOURNAL=ieeecom, VOLUME=37, NUMBER=1, PAGES="60-69", MONTH=jan, YEAR=1989, } @INPROCEEDINGS{Mank8901:Limiting, AUTHOR="A. Mankin and Ken Thompson", TITLE="Limiting Factors in the Performance of Jacobson's {TCP} Algorithms", BOOKTITLE="Winter USENIX Technical Conference", PUBLISHER="USENIX Association", ADDRESS="San Diego, California", MONTH=jan, YEAR=1989, ABSTRACT="Jacobson and Karels' Slow-start TCP offers an effective approach to Internet congestion control. Limiting factors for the Slow-start algorithms were explored by measuring the performance of the Berkeley 4.3+ Slow-start implementation in the presence of increasing gateway load. Two network performance measurement tools, tcptrace and NETMON/iptrace, were developed for this purpose, and are available in source-code form from the authors. The measurements of Slow-start TCP illustrate both the adaptive range of the algorithms, and also some limitations of the Slow-start technique of estimating gateway congestion.", } @INPROCEEDINGS{Raeb8901:Discuss, AUTHOR="Ken Raeburn and Jon A. Rochlis and Stan Zanarotti and William Sommerfield", TITLE="Discuss: An Electronic Conferencing System for a Distributed Computing Environment", BOOKTITLE="Winter USENIX Technical Conference", PUBLISHER="USENIX Association", ADDRESS="San Diego, California", MONTH=jan, YEAR=1989, ABSTRACT="As computers and computer networks become commonplace, electronic communication is rising in importance and utility. The challenge is to take a large, distributed computing environment and build a system which allows its users to communicate effectively and efficiently with each other. This paper compares and contrasts several common types of electronic communication, focusing on electronic conferencing. We describe the implementation of such a system, Discuss, for the computing environment found at MIT. Issues covered include the basic model of an electronic meeting, the currently implemented user interfaces, separation of user interface from underlying operations, splitting the workload between client and server, communications issues created by the heterogeneous environment, authentication and authorization, notification, and unification of the numerous subordinate UNIX. libraries into a coherent whole. The paper next summarizes the Discuss system's current usage, then closes with a discussion of its possible future development.", } @ARTICLE{Lync8901:INTEROP, AUTHOR="Dan Lynch", TITLE="{INTEROP} 88 - A Landmark Event in Internetworking", JOURNAL=ccr, VOLUME=19, NUMBER=1, PAGES="11-12", MONTH=jan, YEAR=1989, } @ARTICLE{Case8901:Case, AUTHOR="J. D. Case and C. Partridge", TITLE="Case Diagrams: A First Step to Diagrammed Management Information Bases", JOURNAL=ccr, VOLUME=19, NUMBER=1, PAGES="13-16", MONTH=jan, YEAR=1989, REFERENCES=2, ABSTRACT="A method for pictorially representing objects in a Management Information Base (MIB) used for network management is presented. Although the method presented here is limited in the kinds of information it can display, the authors believe that some method for diagramming MIBs like the one described here will be needed in the future.", } @ARTICLE{Spaf8901:Internet, AUTHOR="Eugene Spafford", TITLE="The {Internet} Worm Program: An Analysis", JOURNAL=ccr, VOLUME=19, NUMBER=1, PAGES="17-57", MONTH=jan, YEAR=1989, REFERENCES=14, ABSTRACT="On the evening of 2 November 1988, someone infected the Internet with a worm program. That program exploited flaws in utility programs in systems based on BSD-drived versions of UNIX. The flaws allowed the program to break into those machines and copy itself, thus infecting those systems. This program eventually spread to thousands of machines, and disrupted normal activities and Internet connectivity for many days. This report gives a detailed description of the components of the worm program -- data and functions. It is based on study of two completely independent reverse-compilations of the worm and a version disassembled to VAS assembly language. Almost no source code is given in the paper because of current concerns about the state of the ''immune system'' of Internet hosts, but the description should be detailed enough to allow the reader to understand the behavior of the program. The paper contains a review of the security flaws exploited by the worm program, and gives some recommendations on how to eliminate or mitigate their future use. The report also includes an analysis of the coding style and methods used by the author(s) of the worm, and draws some conclusions abouth his abilities and intent.", URL="http://www.acm.org/sigcomm/ccr/archive/1989/jan89/spaf.ps", } @ARTICLE{Mogu8901:Experimental, AUTHOR="J. C. Mogul", TITLE="The Experimental Literature of the Internet: An Annotated Bibliography", JOURNAL=ccr, VOLUME=19, NUMBER=1, PAGES="58-71", MONTH=jan, YEAR=1989, REFERENCES=8, ABSTRACT="The DARPA Internet is the most successful experiment in heterogeneous internetworking. It connects computer systems from almost every major vendor, using a wide variety of wide-area and local-area network technology, and is in continual use by thousands of people. This annotated bibliography covers the literature of the Internet as an experiment: publications which convey the experience acquired by the experimenters.", } @ARTICLE{Lai8901:Nodal, AUTHOR="W. S. Lai", TITLE="Network and Nodal Architectures For the Internetworking Between Frame Relaying Services", JOURNAL=ccr, VOLUME=19, NUMBER=1, PAGES="72-84", MONTH=jan, YEAR=1989, REFERENCES=6, ABSTRACT="Frame relaying is a new CCITT-recommended packet mode bearer service in ISDNs for data communications. Its major characteristics are out-of-band call control and link layer mulitplexing. Requirements for the interworking between frame relaying services are the support for a multi-network, multi-vendor environment, and the integration of call control. After a comparison of the service characteristics of packet switching, circuit switching, and frame relaying, we conclude that the inter-nodal interworking strategy meets these requirements better than the internet-work interworking strategy. To understand better the requirements of a network architecture for the provision of frame relaying service, and to lend support for the standardization of the inter-nodal interworking strategy, a preliminary view on the functional structure of a network node is presented.", } @ARTICLE{Mill8901:Wiretap, AUTHOR="D. L. Mills", TITLE="Wiretap: An Experimental Multiple-Path Routing Algorithm", JOURNAL=ccr, VOLUME=19, NUMBER=1, PAGES="85-98", MONTH=jan, YEAR=1989, REFERENCES=7, KEYWORDS="adaptive rounting; diversity routing; packet radio; verterbi algorithm", ABSTRACT="This paper introduces Wiretap, an experimental routing algorithm which computes maximum-likelihood diversity routes for packet-radio stations sharing a common broadcast channel, but with some stations hidden from others. The wiretapper observes the paths (source routes) used by other stations sending traffic on the channel and, using a heuristic set of factors and weights, constructs speculative paths for its own traffic. The algorithm is presented as an example of maximum-likelihood routing and database management techniques useful for richly connected networks of mobile stations. Of particular interest are the mechanisms to compute, select, rank and cache a potentially large number of speculative routes when only limited computational resources are available. A prototype implementation has been constructed and tested for the AX.25 packet-radio channel now in widespread use in the amateur-radio community. Its design is similar in many respects to the SPF algorithm used in the ARPANET and NSFNET backbone networks, and is in fact a variation of the Viterbi algorithm, which constructs maximum-likelihood paths on a graph according to a weighted sum of factors assigned to the nodes and edges.", } @ARTICLE{Koch8901:Hygiene, AUTHOR="Bryan Kocher", TITLE="A Hygiene Lesson", JOURNAL=cacm, VOLUME=32, NUMBER=1, PAGES=3, MONTH=jan, YEAR=1989, ABSTRACT="Editorial on the Internet worm.", } @INPROCEEDINGS{Yeon8901:UNIX, AUTHOR="Wengyik Yeong and M. L. Schoffstall and M. S. Fedor", TITLE="A {UNIX} Implementation of the Simple Network Management Protocol", BOOKTITLE="Winter USENIX Technical Conference", PUBLISHER="USENIX Association", ADDRESS="San Diego, California", MONTH=jan, YEAR=1989, ABSTRACT="The many choices in network products available today from a diversity of vendors clearly indicates the need for a single, non-proprietary solution to the problem of managing all the entities in the existing TCP/IP Internet. The Simple Network Management Protocol (SNMP) is a solution to the network management needs of Local Area Networks, as well as the greater Internet. This paper describes the design and implementation of software conforming to the SNMP for computer systems running Berkeley 4.2/4.3 and related operating systems. The implementation described herein includes all software necessary for the management of machines running such operating systems: a network management station for UNIX, and an SNMP agent (server) intended to run on similar systems.", } @ARTICLE{Ride8901:Protocols, AUTHOR="Michael J. Rider", TITLE="Protocols for {ATM} Access Networks", JOURNAL=ieeenet, VOLUME=3, NUMBER=1, PAGES="17-22", MONTH=jan, YEAR=1989, REFERENCES=7, ABSTRACT="Advances in computing and other technologies have produced a significant and rapid increase in the demand of new communications services. In seeking a cost-effective way to reach these new opportunities, the industry is moving toward the development of an integrated, service-generic access network. In contrast, today's network consists of separate circuit and packet networks that are optimized to provide performance and service control advantages to a specific service. Integration of traditionally separate voice and data transport, as well as the inclusion of image and video services, have of necessity produced the need for an access transport system that represents the best performance compromise across all services. The emergence of high- speed packet data multiplexing and switching technologies, coupled with low error-performance fiber transmissions, have offered such a compromise.", } @ARTICLE{Byrn8901:Broadband, AUTHOR="William R. Byrne and Toomas A. Kilm and Bruce Nelson and Marius D. Soneru", TITLE="Broadband {ISDN} Technology and Architecture", JOURNAL=ieeenet, VOLUME=3, NUMBER=1, PAGES="23-28", MONTH=jan, YEAR=1989, } @ARTICLE{Acom8901:Overview, AUTHOR="A. S. Acampora and Mark Karol", TITLE="An Overview of Lightwave Packet Networks", JOURNAL=ieeenet, VOLUME=3, NUMBER=1, PAGES="29-41", MONTH=jan, YEAR=1989, REFERENCES=27, } @INPROCEEDINGS{Mart8901:Experience, AUTHOR="Brian Martin and Charles Bergan and W. A. Burkhard and Jehan-Francois Paris", TITLE="Experience With {PARPC}", BOOKTITLE="Winter USENIX Technical Conference", PUBLISHER="USENIX Association", ADDRESS="San Diego, California", PAGES="1-12", MONTH=jan, YEAR=1989, ABSTRACT="PARPC provides an interprocess communication mechanism based on the semantics of a procedure call. PARPC programs always execute a single logical thread of control but may execute multiple physical threads of control. PARPC provides users with a well defined, high level network process model of execution and a familiar program development model supporting heterogeneous, non-uniform environments. The administrative overhead of PARPC is minimal because users administer their own distributed programs and existing UNIX mechanisms for access control and resource accounting are utilized. Our experiences indicate that PARPC has been an effective system for the development and administration of distributed programs.", } @INPROCEEDINGS{Lee8901:Integrating, AUTHOR="G. Lee", TITLE="Integrating {UNIX} Terminal Services into a Distributed Operating System", BOOKTITLE="Winter USENIX Technical Conference", PUBLISHER="USENIX Association", ADDRESS="San Diego, California", PAGES="29-42", MONTH=jan, YEAR=1989, ABSTRACT="One solution to the problem of integrating the terminal services of a UNIX host into a distributed operating system is to implement the distributed operating system as a guest layer in UNIX and then to add a software interface that runs on the host and translates between the terminal services of the host and the distributed operating system. Such an interface was implemented at the Lawrence Livermore National Laboratory. Design issues and decisions that preceded software development are discussed, followed by details of software operation. Development experiences that would be applicable to a similar effort are described.", } @INPROCEEDINGS{Call8901:Automounter, AUTHOR="Brent Callaghan and Tom Lyon", TITLE="The Automounter", BOOKTITLE="Winter USENIX Technical Conference", PUBLISHER="USENIX Association", ADDRESS="San Diego, California", PAGES="43-51", MONTH=jan, YEAR=1989, ABSTRACT="This paper describes the automounter - an automatic filesystem mounting service distributed with Sun Microsystems version of the Unix, operating system (SunOs). The automounter detects access to remote filesystems and mounts them on demand. This action is transparent to users and programs. Automounted filesystems are automatically unmounted after a period of inactivity. The map files that control the automounter can specify multiple locations for filesystems replicated across a network and can describe mount hierarchies. Automount maps can be administered on a single machine through local files or across a Yellow Pages domain.", } @INPROCEEDINGS{Jusz8901:Improving, AUTHOR="Chet Juszczak", TITLE="Improving the Performance and Correctness of an {NFS} Server", BOOKTITLE="Winter USENIX Technical Conference", PUBLISHER="USENIX Association", ADDRESS="San Diego, California", PAGES="52-64", MONTH=jan, YEAR=1989, ABSTRACT="The Network File System (NFS) utilizes a stateless protocol between clients and servers; the major advantage of this statelessness is that NFS crash recovery is very easy. An NFS client simply con- tinues to send a request until it gets a response from the server. However, this client retry model also has disadvantages: a server can receive multiple copies of the same request. The processing of duplicate requests is an expense of server effort that is better spent elsewhere. Worse than that, it can result in incorrect results. This paper describes a work avoidance technique that utilizes a cache on the server to avoid the needless processing of duplicate client requests. An implementation of this technique has resulted in a significant increase in server bandwidth. A beneficial side effect is that it can help avoid the destructive re-application of non-idempotent operations. It can be used in any NFS server implementation, requires no client modifications, and in no way violates the NFS crash recovery design.", } @INPROCEEDINGS{Duff8901:Viral, AUTHOR="T. J. Duff", TITLE="Viral Attacks on {UNIX} System Security", BOOKTITLE="Winter USENIX Technical Conference", PUBLISHER="USENIX Association", ADDRESS="San Diego, California", PAGES="165-172", MONTH=jan, YEAR=1989, ABSTRACT="Executable files in the Ninth Edition of the UNIX system contain small amounts of unused space, allowing small code sequences to be added to them without noticeably affecting their functionality. A program fragment that looks for binaries and introduces copies of itself into their slack space will transitively spread like a virus. Such a virus program could, like the Trojan Horse, harbor Greeks set to attack the system when run by sufficiently privileged users or from infected set-userid programs. The author wrote such a program (without the Greeks) and ran several informal experiments to test its characteristics. In one experiment, the code was planted on one of Center 1127's computers and spread in a few days through the Datakit network to about forty machines. The virus escaped during this test onto a machine running an experimental secure UNIX system, with interesting (and frustrating for the system's developers) consequences. Viruses of this sort must be tiny to fit in the small amount of space available, and consequently are very timid. There are ways to construct similar viruses that are not space-constrained and can therefore spread more aggressively and harbor better-armed Greeks. As an example, we exhibit a frighteningly virulent portable virus that inhabits shell scripts. Viruses rely on users and system administrators being insufficiently vigilant to prevent them from infiltrating systems. I outline a number of steps that people ought to take to make infiltration less likely. Numerous recent papers have suggested modifications to the UNIX system kernel to interdict viral attacks. Most of these are based on the notion of `discretionary access controls.' These proposals cannot usually be made to work, either because they make unacceptable changes in the `look and feel' of the UNIX system's environment or they entail placing trust in code that is inherently untrustworthy. In reply to these proposals, I suggest a small change to the UNIX system permission scheme that may be able to effectively interdict viral attacks without serious effect on the UNIX system's functioning and habitability.", } @INPROCEEDINGS{Fori8901:Shared, AUTHOR="Alessandro Forin and Joseph Barrera and Richard Sanzi", TITLE="The Shared Memory Server", BOOKTITLE="Winter USENIX Technical Conference", PUBLISHER="USENIX Association", ADDRESS="San Diego, California", PAGES="229-244", MONTH=jan, YEAR=1989, } @INPROCEEDINGS{Tsai8901:Trusted, AUTHOR="Chii-Ren Tsai and V. D. Gligor and W. Burger and Mark Carson and P. S. Cheng and Janet A. Cugini and Mathew S. Hecht and Shau-Ping Lo", TITLE="A Trusted Network Architecture for {AIX} Systems", BOOKTITLE="Winter USENIX Technical Conference", PUBLISHER="USENIX Association", ADDRESS="San Diego, California", PAGES="457-471", MONTH=jan, YEAR=1989, } @INPROCEEDINGS{Seel8901:Tour, AUTHOR="Donn Seeley", TITLE="A Tour of the Worm", BOOKTITLE="Winter USENIX Technical Conference", PUBLISHER="USENIX Association", ADDRESS="San Diego, California", PAGES="287-304", MONTH=jan, YEAR=1989, ABSTRACT="On the evening of November 2, 1988, a self-replicating program was released upon the Internet. This program (a worm) invaded VAX and Sun-3 computers running versions of Berkeley UNIX and used their resources to attack still more computers. Within the space of hours this program had spread across the U.S., infecting hundreds or thousands of computers and making many of them unusable due to the burden of its activity. This paper provides a chronology for the outbreak and presents a detailed description of the internals of the worm, based on a C version produced by decompiling.", } @TECHREPORT{Hsu8901:Transaction, AUTHOR="Meichun Hsu and Va-On Tam", TITLE="Transaction Synchronization in Distributed Shared Virtual Memory Systems", TYPE="Technical Report", INSTITUTION="Havard University, Center for Research in Computing Technology", ADDRESS="Cambridge, Massachusetts", NUMBER="TR-05-89", MONTH=jan, YEAR=1989, } @ARTICLE{Humb8901:Topology, AUTHOR="P. A. Humbelt and Stuart R. Soloway", TITLE="Topology Broadcast Algorithms", JOURNAL=cnis, VOLUME=16, NUMBER=3, PAGES="179-186", MONTH=jan, YEAR=1989, } @ARTICLE{Turm8901:Bell, AUTHOR="B. Turman and R. Rubin", TITLE="Bell Operating Company Packet Interfaces Between Networks and Subnets", JOURNAL=cnis, VOLUME=16, NUMBER=3, PAGES="187-196", MONTH=jan, YEAR=1989, } @ARTICLE{Agga8901:Simulation, AUTHOR="S. Aggarwal and Z. Har'el", TITLE="Simulation Analysis of Protocols in an Integrated Software Environment", JOURNAL=cnis, VOLUME=16, NUMBER=3, PAGES="197-216", MONTH=jan, YEAR=1989, } @ARTICLE{Tcha8901:Link, AUTHOR="D.-W. Tcha and C.-Y. Jin", TITLE="Link-by-Link Bandwidth Allocation in an Integrated Voice/Data Network Using the Fuzzy Set Principle", JOURNAL=cnis, VOLUME=16, NUMBER=3, PAGES="217-228", MONTH=jan, YEAR=1989, } @ARTICLE{Frat8901:PR, AUTHOR="L. Fratta and J. Wozniak", TITLE="{PR-EXPRESS:} Collision-free Access Protocol for Packet Radio Networks", JOURNAL=cnis, VOLUME=16, NUMBER=3, PAGES="229-242", MONTH=jan, YEAR=1989, } @ARTICLE{Lenz8901:OSIRIDE, AUTHOR="Luniano Lenzini", TITLE="The {OSIRIDE-Interest} Iniative: Status and Trends", JOURNAL=cnis, VOLUME=16, NUMBER=3, PAGES="243-256", MONTH=jan, YEAR=1989, } @TECHREPORT{Pang8901:Throughput, AUTHOR="Joseph Pang and F. A. Tobagi", TITLE="Throughput Approximation for the Generalized Timer Based Protocol for Token Passing Systems", TYPE="Technical Report", INSTITUTION="Stanford University", NUMBER="CSL-TR-89-375", NOTE="Available for \$5.10 from Naomi Schulman, Computer systems Laboratory, Stanford University, Stanford, CA 94305-4055, (415-723-1430)", MONTH=jan, YEAR=1989, ABSTRACT="Recently, a timer based integrated access protocol has been adopted by two major local area network (LAN) standards, the IEEE 802.4 Token Bus Standard [1] and the ANSI drafted Fiber Distributed Data Interface Standard [2]. This timer based approach is capable of providing bounded access delay for real-time traffic (i.e., traffic with stringent delay requirements), multiple classes of service, and efficient use of the communication channel [3]-[4]. Based on a careful examination of the dynamical behaviour of the timer based protocol under heavy traffic, we have been able to generalize the underlying idea behind the protocol and proposed a new class of access control schemes in [5]. We have also established in [5] important results pertaining to the bandwidth allocation under heavy traffic and upper bounds on token cycles under general traffic for the generalized control schemes. Although the results on bandwidth allocation obtained in [5] are very useful for first-cut design purposes, they are only applicable under heavy traffic. In this report, we are interested in obtaining the station throughputs for the generalized control schemes under arbitrary input traffic. Based on the assumption that the variances of station service times are small, we develop a simple and yet very good approximation for the station throughputs, that is dependent only on the average data arrival rates at the stations. Using this approximation, we can determine whether a station in the system is stable or not. Furthermore, if a station is not stable, its throughput can be obtained from the approximation. This approximation is also applicable to the timer based protocol used in the LAN standards [1]-[2].", } @TECHREPORT{Spin8901:Reliable, AUTHOR="J. M. Spinelli", TITLE="Reliable communication on data links", TYPE="Technical Report", INSTITUTION="Computer Science Department, University of California at Berkeley", NUMBER="CICS-P-102", MONTH=jan, YEAR=1989, } @MISC{Mitc8901:Multi, AUTHOR="C. Mitchell", TITLE="Multi-destination secure electronic mail", VOLUME=32, NUMBER=1, PAGES="13-15", NOTE="Note: This article describes problems in RFC 989 which are believed to have been fixed by RFC 1040", MONTH=jan, YEAR=1989, ABSTRACT="Electronic mail messages are often sent to more than one destination; this gives rise to problems when security is required. A recent draft for a standard for securing electronic mail messages suggests a novel mechanism for solving the problem. Unfortunately, as shown herein, the solution is flawed and can allow the construction of fake messages which will pass the authenticity tests.", } @ARTICLE{Jalo8901:Resilient, AUTHOR="P. Jalote", TITLE="Resilient Objects in Broadcast Networks", JOURNAL=ieeese, VOLUME=15, NUMBER=1, PAGES="68-71", MONTH=jan, YEAR=1989, KEYWORDS="Reviews", } @ARTICLE{Jajo8901:Pessimistic, AUTHOR="Sushil Jajodia and David Mutchler", TITLE="A pessimistic consistency control algorithm for replicated files which achieves high availability", JOURNAL=ieeese, VOLUME=15, NUMBER=1, PAGES="39-46", MONTH=jan, YEAR=1989, KEYWORDS="Distributed Systems", } @TECHREPORT{Ferr8901:Guaranteeing, AUTHOR="D. Ferrari", TITLE="Guaranteeing Performance for Real-Time Communications in Wide-Area Networks", TYPE="Technical Report", INSTITUTION="UC Berkeley CS Division", NUMBER="Technical Report 89/", MONTH=jan, YEAR=1989, ABSTRACT="An algorithm for implementing channels (w/ various types of performance guarantees) in an Internetwork.", URL="ftp://tr-ftp.cs.berkeley.edu/pub/tech-reports/csd/csd-89-485", } @TECHREPORT{Weav8901:Specification, AUTHOR="Alfred Weaver and Timothy W. Strayer and Bert J. Dempsey", TITLE="Specification for a real-time transport protocol", TYPE="Technical Report", INSTITUTION="Computer Science Department, University of Virginia", ADDRESS="Charlottesville, Virginia", NUMBER="TR-89-02", MONTH=jan, YEAR=1989, REFERENCES=12, KEYWORDS="real-time systems; deadline", ABSTRACT="Conventional standard transport protocols do not adequately support distributed real-time systems. An ideal protocol would ensure that at all times the communications subsystem is working on the task (message) of the most value to the overall system. In this paper we investigate how to develop a flexible and potent discrimination scheme based on importance, an abstract concept that measures the degree to which a task contributes to the overall system goal. We examine typical communication subsystems for what can and can not be expected from such a policy. Finally, we review our chain of reasoning in reaching a proposal for a scheme implementable within currently existing or developing transport protocols.", URL="ftp://uvacs.cs.virginia.edu/pub/techreports/CS-89-02.ps.Z", } @TECHREPORT{Deik89:Separable, AUTHOR="H. Deike-Glindemann and W. Knaup and I. Koch and F. Noack", TITLE="Performance-Bounds-Verfahren für separable Warteschlangennetze", INSTITUTION="Fachbereich Informatik IV, Universität Dortmund", ADDRESS="Dortmund", MONTH=jan, YEAR=1989, LANGUAGE="German", KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Souz8901:Calculating, AUTHOR="E. de Souza and H. R. Gail", TITLE="Calculating availability and performability measures of repairable computer systems using randomization", JOURNAL=jacm, VOLUME=36, NUMBER=1, PAGES="171-193", MONTH=jan, YEAR=1989, KEYWORDS="queueing theory", } @ARTICLE{Souz8901:Calculating, AUTHOR="E. de Souza and S. S. Lavenberg", TITLE="Calculating joint queue-length distributions in product-form queuing networks", JOURNAL=jacm, VOLUME=36, NUMBER=1, PAGES="194-207", MONTH=jan, YEAR=1989, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Shan8901:Second, AUTHOR="J. G. Shanthikumar and D. D. Yao", TITLE="Second-order stochastic properties in queueing systems", JOURNAL=ieeeproc, VOLUME=77, NUMBER=1, PAGES="162-170", MONTH=jan, YEAR=1989, KEYWORDS="Queueing network; product form; analysis", } @TECHREPORT{Almq8901:Measured, AUTHOR="K. Almquist and Ross Anderson and E. D. Lazowska", TITLE="The Measured Performance of Parallel Dynamic Programming Implentations", INSTITUTION="University of Washington, Seattle", NUMBER="89-01-03", MONTH=jan, YEAR=1989, } @UNPUBLISHED{Cher8901:Time, AUTHOR="D. R. Cheriton", TITLE="Time Synchronized Communication", NOTE="DRAFT", MONTH=jan, YEAR=1989, } @TECHREPORT{Hutc8901:Implementing, AUTHOR="N. Hutchinson and L. L. Peterson", TITLE="Implementing Protocols in the x-Kernel", INSTITUTION="University of Arizona, Tucson", NUMBER="TR 89-1", MONTH=jan, YEAR=1989, } @UNPUBLISHED{Korn8901:Processor, AUTHOR="K. Korner and L. Ramos", TITLE="Processor Scheduling in Distributed Systems", NOTE="University of Southern California", MONTH=jan, YEAR=1989, } @ARTICLE{Oust8901:Beating, AUTHOR="J. Ousterhout and F. Douglis", TITLE="Beating the {I/O} Bottleneck: a case for log-structured file systems", JOURNAL=acmosrev, VOLUME=23, NUMBER=1, PAGES="11-28", MONTH=jan, YEAR=1989, REFERENCES=16, KEYWORDS="file system; cache", ABSTRACT="CPU speeds are improving at a dramatic rate, while disk speeds are not. This technology shift suggests that many engineering and office applications may become so I/O-limited that they cannot benefit from further CPU improvements. This paper discusses several techniques for improving I/O performance, including caches, battery backed-up caches, and cache logging. We then examine in particular detail an approach called log-structured file systems, where the file system's only representation on disk is in the form of an append-only log. Log-structured file systems potentially provide order-of-magnitude improvements in write performance. When log-structured file systems are combined with arrays of small disks (which provide high bandwidth) and large main-memory file caches (which satisfy most read accesses), we believe it will be possible to achieve 1000-fold improvements in I/O performance over today's systems.", } @ARTICLE{Righ8901:Distributed, AUTHOR="Rhonda Righter and J. Walrand", TITLE="Distributed Simulation of Discrete Event Systems", JOURNAL=ieeeproc, VOLUME=77, NUMBER=1, MONTH=jan, YEAR=1989, } @TECHREPORT{Fuji8901:Time, AUTHOR="R. M. Fujimoto", TITLE="Time Warp on a Shared Memory Multiprocessor", INSTITUTION="Computer Science Department, University of Utah", ADDRESS="Salt Lake City, UT 84112", NUMBER="UUCS-88-021a", MONTH=jan, YEAR=1989, } @TECHREPORT{McCa8901:Geometric, AUTHOR="Scott McCallum and Bruno Buchberger", TITLE="Geometric Modelling Based on Logic and Algebra", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-89-01", MONTH=jan, YEAR=1989, } @ARTICLE{Bern8901:Shortest, AUTHOR="M. W. Bern and R. L. Graham", TITLE="The Shortest Network Problem", JOURNAL="Scientific American", MONTH=jan, YEAR=1989, KEYWORDS="Network optimization; shortest path; network theory", } @TECHREPORT{Birr8901:Introduction, AUTHOR="A. D. Birrell", TITLE="An Introduction to Programming with Threads", TYPE="SRC Research Report", INSTITUTION="Digital", NUMBER=35, MONTH=jan, YEAR=1989, KEYWORDS="threads; operating systems; concurrent programming", ABSTRACT="This paper provides an introduction to writing concurrent programs with ``threads''. A threads facility allows you to write programs with multiple simultaneous points of execution, synchronizing through shared memory. The paper describes the basic thread and synchronization primitives, then for each primitive provides a tutorial on how to use it. The tutorial sections provide advice on the best ways to use the primitives, give warnings about what can go wrong and offer hints about how to avoid these pitfalls. The paper is aimed at experienced programmers who want to acquire practical expertise in writing concurrent programs.", URL="http://gatekeeper.dec.com/pub/DEC/SRC/research-reports/abstracts/src-rr-035.html", } @ARTICLE{Reim8902:Open, AUTHOR="M. I. Reiman and B. Simon", TITLE="Open Queueing Systems in Light Traffic", JOURNAL=mor, VOLUME=14, NUMBER=1, PAGES="26-59", MONTH=feb, YEAR=1989, KEYWORDS="queueing theory", } @UNPUBLISHED{Schu8902:SIMUL, AUTHOR="Henning Schulzrinne", TITLE="{SIMUL} simulation system manual", NOTE="internal memorandum", MONTH=feb, YEAR=1989, URL="ftp://gaia.cs.umass.edu/pub/Schu89:Simul.ps.Z", } @ARTICLE{Frie8902:Packet, AUTHOR="Edward M. Friedman and Chaim Ziegler", TITLE="Packet voice communications over {PC-based} local area networks", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="211-218", MONTH=feb, YEAR=1989, KEYWORDS="packet voice; local area networks; silence detection", ABSTRACT="This paper reports on experimental implementations of packet voice communication systems over two types of personal-computer (PC)-based local area networks. The first is a Proten proNET token-passing ring network, and the second is an Ethernet network. System configuration, operation, and performance are described for both networks. Models of network performance to estimate the maximum allowable number of active voice stations without incurring intolerable packet loss are presented for each system. The models are defined for systems with and without silence detection. PC-based implementation issues are also discussed.", ANNOTE="Mentions station-induced delays.", } @ARTICLE{Bhuy8902:Multiprocessor, AUTHOR="L. Bhuyan and Q. Yang and D. P. Agrawal", TITLE="Performance of multiprocessor interconnection networks", JOURNAL=ieeecomp, VOLUME=22, NUMBER=2, PAGES="25-37", MONTH=feb, YEAR=1989, } @ARTICLE{Rama8902:Mass, AUTHOR="Kadangode K. Ramakrishnan and J. S. Emer", TITLE="Performance Analysis of Mass Storage Service Alternatives for Distributed Systems", JOURNAL=ieeecom, VOLUME=15, NUMBER=2, PAGES="120-133", MONTH=feb, YEAR=1989, ABSTRACT="In this paper, we consider the performance of alternative mass storage services for a client-server style distributed system. Some qualitative arguments are presented on the ramifications of implementations of mass storage services at various levels of the storage semantics hierarchy. This paper concentrates, in particular, on contrasting disk and files services. The functionality of disk and file services are distinguished by their primitive operations: individual disk block access, for the disk service; and individual file block access, for the file service. This difference results in different partitionings of the computation between the client and server, as well as different network communication requirements. To understand the ramifications of such differences between the services, this paper presents performance estimates for basic disk and file services. To provide a commensurate comparison of the performance of the two services, a uniform closed queueing network model was developed that accurately portrayed this computation/communication tradeoff. Detailed parameterization of the model was done through measurements of prototype systems. The workload applied to the mass storage service is based on measurements of timesharing systems performed in earlier studies. In addition to the basic comparisons, performance estimates for several design alternatives are also presented. Some of these performance enhancing alternatives were: caching of file/disk blocks and file-opens, kernel-based services, and using a network interface able to do gather write to eliminate data copies.", } @ARTICLE{Onun8902:Personal, AUTHOR="J. O. Onunga and R. W. Donaldson", TITLE="Personal Computer Communications on Intrabuilding Power Line {LAN's} {USing} {CSMA} with Priority Acknowledgements", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="180-191", MONTH=feb, YEAR=1989, } @ARTICLE{Vuon8902:Low, AUTHOR="Son Vuong and Angus Ma", TITLE="A Low-Cost and Portable Local Area Network For Interconnecting {PC's} Using Electric Power Lines", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="192-201", MONTH=feb, YEAR=1989, } @ARTICLE{Aica8902:Radio, AUTHOR="M. Aicardi and F. Davoli and A. Giordano", TITLE="Radio\\_ISA\\_Net: A Single-Hop Centralized Packet Radio Network for {PC-to-Mainframe} Interconnection", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="219-226", MONTH=feb, YEAR=1989, } @ARTICLE{Dier8902:Packet, AUTHOR="R. J. Diersing and J. W. Ward", TITLE="Packet Radio in the Amateur Satellite Service", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="226-234", MONTH=feb, YEAR=1989, } @ARTICLE{Cope8902:Data, AUTHOR="J. A. Copeland", TITLE="Data Compression Technique for {PC} Communications", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="246-248", MONTH=feb, YEAR=1989, } @ARTICLE{Cole8902:Architecture, AUTHOR="Randolph E. Cole and J. H. Burns", TITLE="An Architecture for a Mobile {OSI} Mail Access System", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="249-256", MONTH=feb, YEAR=1989, } @ARTICLE{Haus8902:Networking, AUTHOR="S. E. Hauser and M. I. Felsen and M. J. Gill and G. R. Thoma", TITLE="Networking {AT-Class} Computers for Image Distribution", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="268-276", MONTH=feb, YEAR=1989, } @ARTICLE{Blum8902:PC, AUTHOR="R. E. Blumberg and D. Walters", TITLE="A {PC-Based} Multimedia Document Manager", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="283-290", MONTH=feb, YEAR=1989, } @ARTICLE{Okam8902:Identity, AUTHOR="Eiji Okamoto and K. Tanaka", TITLE="Identity-Based Information Security Management System for Personal Computer Networks", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="290-294", MONTH=feb, YEAR=1989, } @ARTICLE{Will8902:PC, AUTHOR="M. H. G. Willems", TITLE="Design of a {PC} Interface Card for Office Communications Using the {ISDN} Basic Access", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="295-302", MONTH=feb, YEAR=1989, } @ARTICLE{Feld8902:Benevolent, AUTHOR="Robert E. Felderman and Eve Schooler and L. Kleinrock", TITLE="The Benevolent Bandit Laboratory: A Testbed for Distributed Algorithms", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="303-311", MONTH=feb, YEAR=1989, } @ARTICLE{Burg8902:Networking, AUTHOR="W. B rger", TITLE="Networking of Secure Systems", JOURNAL=ieeejsac, VOLUME=7, NUMBER=2, PAGES="312-318", MONTH=feb, YEAR=1989, } @INPROCEEDINGS{Liao8902:Incremental, AUTHOR="I-En Liao and Minkui Liu", TITLE="Incremental Protocol Verification Using Deductive Database System", BOOKTITLE="5th International Conference on Data Engineering", MONTH=feb, YEAR=1989, ABSTRACT="Reachability analysis has been widely used in validating and verifying communication protocols; however, it is incapable of expressing the verification procedure elegantly, and it also suffers from the state space explosion problem. A new approach using the relational database system due to Lai and Lee does alleviate the above problems. In this paper, we first incorporate the predicate logic into the relational algebraic approach so that the recursive definitions are permitted and different functional properties of a protocol can be proved by providing users with a uniform query interface. Next, we apply our approach to incremental verification, which allows for a complex protocol to be verified incrementally. Our scheme is intended to cut down the verification time by saving the explored global-state transitions in the database so that whenever the specification is modified and the verification needs to be performed again, only a small portion of the database will be updated without regenerating all the global states from the initial state.", } @TECHREPORT{Moor8902:Smu, AUTHOR="Greg S. Moore and Murat M. Tanik", TITLE="Smu/seas network simulation in paws/gpsm", INSTITUTION="SMU Tech. Reports, Dept. Computer Science and Engineering", NUMBER="89-CSE-6", MONTH=feb, YEAR=1989, KEYWORDS="Modelling and Simulation", ABSTRACT="This project concerns the use of the PAWS software package to evaluate and generate a performance analysis of the School of Engineering and Applied Sciences computer network at SMU. The project has been developed over two semesters because of the large amount of computer network information needed and the complexity of PAWS. This report outlines the entire procedure followed during the course of this project. All work has been directed towards the development of the PAWS (Performance Analysts Workbench System) program which generates performance analyses of the SEAS computer network.", } @TECHREPORT{Kess8902:Distributed, AUTHOR="R. E. Kessler and M. Livny", TITLE="An Analysis of Distributed Shared Memory Algorithms", TYPE="Technical Report", INSTITUTION="Computer Sciences Department, University of Wisconsin", ADDRESS="Madison, Wisconsin", NUMBER="Tr 825", NOTE="Available from Technical Report Librarian, Computer Sciences Department, University of Wisconsin, 1210 W. Dayton Street, Madison, WI 53706 USA", MONTH=feb, YEAR=1989, ABSTRACT="This paper describes results obtained in a study of algorithms to implement a Distributed Shared Memory in a distributed (loosely coupled) environment. Distributed Shared Memory is the implementation of shared memory across multiple nodes in a distributed system. This is accomplished using only the private memories of the nodes by controlling access to the pages of the shared memory and transferring data to and from the private memories when necessary. We analyze alternative algorithms to implement Distributed Shared Memory, all of them based on the ideas presented in kai li dissertation The Distributed Shared Memory algorithms are analyzed and compared over a wide range of conditions. Application characteristics are identified which can be exploited by the Distributed Shared Memory algorithms. We will show the conditions under which the algorithms analyzed in this paper perform better or worse than the other alternatives. Results are obtained via simulation using a synthetic reference generator.", } @TECHREPORT{Eise8902:Computer, AUTHOR="Ted Eisenberg and David Gries and Juris Hartmanis and Don Holcomb and M. Stuart Lynn and Thomas Santoro", TITLE="The Computer Worm: A Report to the Provost of Cornell University on an Investigation Conducted by the Commission of Preliminary Enquiry", INSTITUTION="Cornell University", ADDRESS="Ithaca, New York", MONTH=feb, YEAR=1989, ABSTRACT="Note: The Cornell Report on the Morris worm. For more information on the report call Cornell at 607-255-3324. Portions reprinted in the June issue of Communications of the ACM.", } @INPROCEEDINGS{Hofi8902:Flow, AUTHOR="J. Höfig and T. Uhl", TITLE="Analysis of Flow Control Techniques on Hop Network Access Level in Computer Communication Networks", BOOKTITLE="Congress Kommunikation in verteilten Systemen", ADDRESS="Stuttgart", PAGES="612-626", MONTH=feb, YEAR=1989, KEYWORDS="computer network; flow control", ABSTRACT="In this paper an analysis and comparison of different simultaneously active flow control rules on hop and network access level is presented. The investigation base on a queueing network model representation of a store-and-forward node with finite buffer capacity as well on a homogeneous network model. Beside the presentation of different system performance values, using known flow control rules, two new dynamic rules are developed.", } @ARTICLE{Kric8902:ATM, AUTHOR="W. Krick", TITLE="{ATM} - Ein Übermittlungskonzept nicht nur für Breitbanddienste", JOURNAL=pkitm, ADDRESS="Nürnberg", PAGES="39-44", MONTH=feb, YEAR=1989, LANGUAGE="German", REFERENCES=7, KEYWORDS="ATM; survey", } @ARTICLE{Roeh8902:Knocking, AUTHOR="W. C. Roehr", TITLE="Knocking on users' doors: Signaling system 7", JOURNAL=datacommunications, VOLUME=18, NUMBER=2, PAGES="147-160", MONTH=feb, YEAR=1989, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Seli8902:Mastering, AUTHOR="D. R. Seligman", TITLE="Mastering {SS7} takes a special vocabulary", JOURNAL=datacommunications, VOLUME=18, NUMBER=2, PAGES="163-165", MONTH=feb, YEAR=1989, KEYWORDS="Signalling; common channel; CCS", } @TECHREPORT{Brau8902:NSFNET, AUTHOR="H. Braun", TITLE="The {NSFNET} Routing Architecture", TYPE="RFC -", INSTITUTION="USC Information Sciences Institute", NUMBER=1093, MONTH=feb, YEAR=1989, } @ARTICLE{Krau8902:Computerization, AUTHOR="R. Kraut and S. Dumasi and S. Koch", TITLE="Computerization, Productivity, and Quality of Work Life", JOURNAL=cacm, VOLUME=32, NUMBER=2, PAGES="220-238", MONTH=feb, YEAR=1989, } @ARTICLE{Thom8902:Efficient, AUTHOR="J. R. Thompson and A. J. Smith", TITLE="Efficient (Stack) Algorithms for Analysis of Write-Back and Sector Memories", JOURNAL=tocs, VOLUME=7, NUMBER=1, PAGES="78-116", MONTH=feb, YEAR=1989, } @ARTICLE{Lint8902:Composing, AUTHOR="Mark Linton and John M. Vlissides and Paul R. Calder", TITLE="Composing User Interfaces with InterViews", JOURNAL=ieeecomp, PUBLISHER="IEEE", MONTH=feb, YEAR=1989, KEYWORDS="X and grphics", } @TECHREPORT{Wido8902:Trace, AUTHOR="Jennifer Widom and David Gries and F. Schneider", TITLE="Trace-Based Network Proof Systems: Expressiveness and Completeness", INSTITUTION="Cornell University, Computer Science Department", NUMBER="TR89-966", PAGES=32, MONTH=feb, YEAR=1989, ABSTRACT="We consider incomplete trace-based network proof systems for safety properties, identifying extensions that are necessary and sufficient to achieve relative completeness. We then consider the expressiveness required of any trace logic that encodes these extensions.", } @ARTICLE{Ball8903:SONET, AUTHOR="Ralph Ballart and Yau-Chau Ching", TITLE="{SONET:} Now It's the Standard Optical Network", JOURNAL=ieeecm, VOLUME=27, NUMBER=3, PAGES="8-15", MONTH=mar, YEAR=1989, KEYWORDS="SONET", } @ARTICLE{Hui8903:Transport, AUTHOR="Joseph Hui", TITLE="Network, Transport, and Switching Integration for Broadband Communications", JOURNAL=ieeenet, VOLUME=3, NUMBER=2, PAGES="40-51", MONTH=mar, YEAR=1989, REFERENCES=16, KEYWORDS="BISDN; TDM; ATM", ABSTRACT="High-level overview of single-slot and multi-slot TDM, ATM, hybrid TDM.", } @ARTICLE{Suda8903:Packetized, AUTHOR="T. Suda and T. T. Bradley", TITLE="Packetized voice/data integrated transmission on a token passing ring local area network", JOURNAL=ieeecom, VOLUME=37, NUMBER=3, PAGES="238-244", MONTH=mar, YEAR=1989, REFERENCES=7, KEYWORDS="packet voice; voice/data integration; network; token ring; LAN; talkspurt", ABSTRACT="The performance is investigated of a token-passing ring network with packetized voice/data mixed traffic through extensive simulations. Both data and voice users are modeled in the simulations. Data users produce bursty traffic. Voice traffic is modeled as having alternating talkspurts and silences, with generation of voice packets at a constant rate during talkspurts and no packet generation during silence periods. Token passing ring local area networks are shown to effectively handle both voice and data traffic. The effects of system parameters (e.g., voice packet length, talkspurt/silence lengths, data traffic intensity, and limited exhaustive service disciplines) on network performance are discussed.", } @TECHREPORT{Brow8903:Block, AUTHOR="Geoffrey Brown and M. G. Gouda and Russ Miller", TITLE="Block Acknowledgement: Redesigning the Window Protocol", TYPE="Technical Report", INSTITUTION="University of Texas", ADDRESS="Austin, Texas", NUMBER="TR-89-02", MONTH=mar, YEAR=1989, KEYWORDS="flow control; transport protocol", ABSTRACT="We describe a new version of the window protocol where message sequence numbers are taken from a finite domain and where both message disorder and loss can be tolerated. Most existing window protocols achieve only one of these two goals. Our protocol is based on a new method of acknowledgement, called block acknowledgement, where each acknowledgement message has two numbers $m$ and $n$ to acknowledge the reception of all data messages with sequence numbers ranging from $m$ to $n$. Using this method of acknowledgement, the proposed protocol achieves the two goals while maintaining the same data transmission capability of the traditional window protocol.", } @TECHREPORT{Wils8903:Experiments, AUTHOR="I. Wilson and D. Milway and Andrew Hopper", TITLE="Experiments in digital video for workstations", TYPE="Technical Report", INSTITUTION="Olivetti Research Limited", ADDRESS="Cambridge, England", NUMBER="ORL-89-2", MONTH=mar, YEAR=1989, KEYWORDS="multimedia; workstation architecture; packet video", ABSTRACT="This paper describes experimental work in the use of digital video by computer workstations. The approach is essentially practical, since the aims of the research were to gain experience with the handling of video, and to investigate some of the system aspects of its integration into the workstation environment. The motivation for the work is explained, along with the compromises which were necessary to make the work possible. The hardware and software tools used in the experimentation are described, and the experiences gained from the first trial applications are discussed.", } @ARTICLE{Stan8903:Decentralized, AUTHOR="John Stankovic", TITLE="Decentralized Decision Making for Task Reallocation in a Hard Real-Time System", JOURNAL=ieeetc, VOLUME=38, NUMBER=3, PAGES="341-355", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Arbo8903:Security, AUTHOR="P. Arbouw", TITLE="Security in Multiple, Inter-Enterprise and Cascaded Networks", BOOKTITLE="7th Worldwide Congress Computer and Communications Security and Protection", ADDRESS="Paris, France", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Le8903:Information, AUTHOR="Y. Le-Roux", TITLE="Information Security in a Local Area Network Integrating Different Worldwide Networks - The Security of {DECWorld'88}", BOOKTITLE="7th Worldwide Congress Computer and Communications Security and Protection", ADDRESS="Paris, France", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Buck8903:Use, AUTHOR="D. Buckley", TITLE="The Use of {RSA} Public Key Encryption Techniques for Securing Large {EFT-POS} Networks", BOOKTITLE="7th Worldwide Congress Computer and Communications Security and Protection", ADDRESS="Paris, France", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Pail8903:Public, AUTHOR="J-C. Pailles", TITLE="A Public key based Solution for Secured Data Communication", BOOKTITLE="7th Worldwide Congress Computer and Communications Security and Protection", ADDRESS="Paris, France", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Diff8903:Protection, AUTHOR="W. Diffie", TITLE="Protection of Terminal to Host Communications by End-to-End Cryptography", BOOKTITLE="7th Worldwide Congress Computer and Communications Security and Protection", ADDRESS="Paris, France", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Burg8903:Networking, AUTHOR="W. Burger and N. Vasudevan", TITLE="Networking of Secure {AIX} and Xenix Systems", BOOKTITLE="7th Worldwide Congress Computer and Communications Security and Protection", ADDRESS="Paris, France", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Pink8903:Access, AUTHOR="D. Pinkas", TITLE="An Access Control Model for Distributed Systems Based on the Use of Trusted Authorities", BOOKTITLE="7th Worldwide Congress Computer and Communications Security and Protection", ADDRESS="Paris, France", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Chu8903:Global, AUTHOR="P. Chu and Minkui Liu", TITLE="Global State Graph Reduction Techniques for Protocol Validation", BOOKTITLE="IEEE 8th International Phoenix Conference on Computers and Communications (PCCC)", MONTH=mar, YEAR=1989, ABSTRACT="The Extended Finite State Machine (EFSM) model has been widely accepted and used as the underlying model for many existing protocol specification languages. In the EFSM model, the behavior of each protocol entity is described as an Finite State Machine (FSM), and a set of context variables declared for the entity may be accessed during state transitions. One of the most severe difficulties in using reachability analysis for protocol validation in the EFSM model is the global state explosion problem. The problem is caused in part by a wide range of possible values that could be taken on by a context variable. To alleviate the effect of context variables on the global state explosion problem, two global state graph reduction techniques are proposed in this paper. In the first reduction technique, we define a global state equivalence based on dead variable sets as studied in the area of program flow analysis. The global state graph is then generated taking the global state equivalence into consideration. An upper bound for the effect of the first reduction technique on the reduction of the global state graph is shown to demonstrate how the first reduction technique may best perform. Finally, the second reduction technique based on a similar reasoning is derived to complement the first reduction technique.", } @ARTICLE{Kami8903:Photonic, AUTHOR="Ivan P. Kaminow", TITLE="Non-Coherent Photonic Frequency-Multiplexed Access Networks", JOURNAL=ieeenet, VOLUME=3, NUMBER=2, PAGES="4-12", MONTH=mar, YEAR=1989, REFERENCES=40, } @ARTICLE{Vann8903:Combining, AUTHOR="Giovanni Vannucci", TITLE="Combining Frequency-Division and Code-Division Multiplexing in a High-Capacity Optical Network", JOURNAL=ieeenet, VOLUME=3, NUMBER=2, PAGES="21-30", MONTH=mar, YEAR=1989, REFERENCES=33, } @ARTICLE{Sale8903:Emerging, AUTHOR="Jawad A. Salehi", TITLE="Emerging Optical Code-Division Multiple Access Communications Systems", JOURNAL=ieeenet, VOLUME=3, NUMBER=2, PAGES="31-39", MONTH=mar, YEAR=1989, REFERENCES=28, } @ARTICLE{Lu8903:ARQ, AUTHOR="D. Lu and J.-F. Chang", TITLE="Analysis of {ARQ} Protocols via Signal Flow Graphs", JOURNAL=ieeecom, VOLUME=37, NUMBER=3, PAGES="245-251", MONTH=mar, YEAR=1989, } @ARTICLE{Chen8903:Strongly, AUTHOR="Wei-Peng Chen and Nian-Chyi Huang", TITLE="The Strongly Connecting Problem on Multihop Packet Radio Networks", JOURNAL=ieeecom, VOLUME=37, NUMBER=3, PAGES="293-294", MONTH=mar, YEAR=1989, } @ARTICLE{Glad8903:Data, AUTHOR="H. M. Gladney", TITLE="Data Replicas in Distributed Information Services", JOURNAL=tods, VOLUME=14, NUMBER=1, PAGES="75-97", MONTH=mar, YEAR=1989, KEYWORDS="Reviews", } @ARTICLE{Rene8903:Performance, AUTHOR="R. van Renesse and H. van Staveren and A. S. Tanenbaum", TITLE="The Performance of the Amoeba Distributed Operating System", JOURNAL=spe, VOLUME=19, NUMBER=3, PAGES="223-234", MONTH=mar, YEAR=1989, ABSTRACT="Amoeba is a capability-based distributed operating system designed for high-performance interactions between clients and servers using the well-known RPC model. The paper starts out by describing the architecture of the Amoeba system, which is typified by specialized components such as workstations, several services, a processor pool, and gateways that connect other Amoeba systems transparently over wide-area networks. Next the RPC interface is described. The paper presents performance measurements of the Amoeba RPC on unloaded and loaded systems. The time to perform the simplest RPC between two user processes has been measured to be 1.4 ms. Compared to SUN 3/50's RPC, Amoeba has one ninth of the delay, and over three times the throughput. Finally we describe the Amoeba file server. The Amoeba file server is so fast that it is limited by the communication bandwidth. To the best of our knowledge this is the fastest file server yet reported in the literature for this class of hardware.", } @TECHREPORT{Care8903:Conflict, AUTHOR="M. Carey and M. Livny", TITLE="Conflict Detection Tradeoffs for Replicated Data", TYPE="Technical Report", INSTITUTION="Computer Sciences Department, University of Wisconsin", ADDRESS="Madison, Wisconsin", NUMBER="Tr 826", NOTE="Available from Technical Report Librarian, Computer Sciences Department, University of Wisconsin, 1210 W. Dayton Street, Madison, WI 53706 USA", MONTH=mar, YEAR=1989, ABSTRACT="Many concurrency control algorithms have been proposed for use in distributed database systems. Despite the large number of available algorithms, and the fact that distributed database systems are becoming a commercial reality, distributed concurrency control performance tradeoffs are still not well understood. In this paper we examine some of these tradeoffs by using a detailed model of a distributed DBMS to study a set of representative algorithms, including several derivatives of the two-phase locking, timestamp ordering, and optimistic approaches to distributed concurrency control. In particular, we examine the performance of these algorithms as a function of data contention for various levels of data replication and ``distributedness'' of accesses to replicated data. The results provide some interesting insights into how the tradeoffs between early and late conflict detection vary as a function of message cost, and should prove useful to distributed database system designers.", } @TECHREPORT{Cohr8903:Specification, AUTHOR="D. L. Cohrs and Barton P. Miller", TITLE="Specification and Verification of Network Managers for Large Internets", TYPE="Technical Report", INSTITUTION="Computer Sciences Department, University of Wisconsin", ADDRESS="Madison, Wisconsin", NUMBER="Tr 832", NOTE="Available from Technical Report Librarian, Computer Sciences Department, University of Wisconsin, 1210 W. Dayton Street, Madison, WI 53706 USA", MONTH=mar, YEAR=1989, ABSTRACT="Large internet environments are increasing the difficulty of network management. Integrating increasing numbers of autonomous subnetworks (each with an increasing number of hosts) makes it more difficult to determine if the network managers of the subnetworks will interoperate correctly. We propose a high level, formal specification language, NMSL, as an aid in solving this problem. NMSL has two modes of operation, a descriptive mode and a prescriptive mode. In its descriptive mode, NMSL specifies abstractions for the network components and their instantiations, and verifies the consistency of such a specification. The abstractions include the data objects and processes in a network management system. These abstractions are instantiated on network elements. Network elements are grouped together in the specification of domains of administration. An extension mechanism is provided to allow for the specification of new management characteristics that the basic language cannot express. In its prescriptive mode, NMSL generates configuration information directly from a consistent specification. This information is used to configure network management processes to make their operation consistent with their specifications. Standard management protocols (such as the emerging ISO or IETF standards) can be used to incorporate the configuration information into running management processes.", } @INPROCEEDINGS{Gerc8903:Limited, AUTHOR="Gokhan Gercek", TITLE="Limited Service Token Ring with Local Message Priorities", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="122-126", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Thra8903:Distributed, AUTHOR="K. Thrampoulidis and V. Makios", TITLE="Distributed Reconfiguration Algorithm for a Unidirectional Optional Bus Local Area Network", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="127-132", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Cama8903:Fault, AUTHOR="P. Camarda and M. Gerla", TITLE="Fault-Tolerance in Multichannel Local Area Networks", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="133-137", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Borc8903:CSMA, AUTHOR="R. L. Borchardt and M. A. Boyana and T. T. Ha", TITLE="{CSMA} and {CMSA/CD} with Random Signal Powers", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="138-143", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Borc8903:Packet, AUTHOR="R. L. Borchardt and T. T. Ha", TITLE="Packet Communications in a Multipath Fading Mobile Radio Network", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="160-165", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Wang8903:Novel, AUTHOR="Chia-Jiu Wang and U. Cheng and T.-Y. Yan", TITLE="Novel Network Test-Bed Simulators", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="166-170", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{McKi8903:Multicast, AUTHOR="Philip McKinley and Jia Liu", TITLE="Multicast Tree Construction in Bus-Based Networks", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="171-177", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Bede8903:Inactivity, AUTHOR="S. Bederman", TITLE="Inactivity Detection on an {ISDN} B-Channel", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="178-182", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Haya8903:Go, AUTHOR="Yukuo Hayashida and M. Komatsu and N. Sugimachi and Y. Yoshida", TITLE="{Go-Back-N} System with Limited Retransmissions", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="183-189", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Welz8903:FDDI, AUTHOR="T. Welzel", TITLE="{FDDI} and {BWN} Backbone Networks: A Performance Comparison Based on Simulation", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="190-194", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Sgar8903:Simulation, AUTHOR="M. Asgarkhani and Krzysztof Pawlikowski", TITLE="Simulation Studies of Mixed Traffic on Satellite Channels Using {TDMA-Reservation} Protocol", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="195-200", MONTH=mar, YEAR=1989, LANGUAGE="English", } @INPROCEEDINGS{Gait8903:Bounding, AUTHOR="S. Gaitonde and D. Jacobson and A. V. Pohm", TITLE="Bounding Delay on a Token Ring Network with Voice, Data and Facsimile Applications: A Simulation Study", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="201-206", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Eu8903:Sampling, AUTHOR="J. H. Eu", TITLE="A Sampling Approach to Real-Time Performance Monitoring of Digital Transmission Systems", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="207-213", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Chun8903:Routing, AUTHOR="Tein Y. Chung and S. Rai and D. P. Agrawal", TITLE="A Routing Scheme for Datagram and Virtual Circuit Services in the {MSN}", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="214-218", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Mitc8903:Analytical, AUTHOR="Tom Mitchell and A. Nilsson", TITLE="Analytical Results for the Error Free Spiral Computer Network Topology", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="219-223", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Papa8903:Interconnection, AUTHOR="P. Papantoni-Kazakos", TITLE="Interconnection Algorithms in Multi-hop Packet Radio Topologies", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="224-230", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Chow8903:Message, AUTHOR="Shyamal Chowdhury", TITLE="On Message Resequencing in Computer Networks", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="231-237", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Oest8903:Tcp, AUTHOR="C. Oestereicher", TITLE="{TCP/IP} - {XNS} - {X.25} Gateways", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="238-241", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Ross8903:Theory, AUTHOR="D. A. Ross", TITLE="Theory of Nonoverlapping Packet Arrivals", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="242-247", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Chao8903:Fast, AUTHOR="C. Y. Chao and M. Ilyas", TITLE="Fast Reconfigurable Communication Networks", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="248-252", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Rahu8903:Dynamic, AUTHOR="V. Rahuraman and Harsha Sirisena", TITLE="Dynamic Entry-to-Exit Flow Control for Virtual Circuit Networks", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="253-259", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Jo8903:Abstraction, AUTHOR="C-H. Jo and D. G. Fisher and Karen George", TITLE="Abstraction and Specification of Local Area Networks", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="337-343", MONTH=mar, YEAR=1989, } @TECHREPORT{Ande8903:Framework, AUTHOR="D. P. Anderson and R. Wahbe", TITLE="A Framework for Multimedia Communication in a General-Purpose Distributed System", INSTITUTION="University of California at Berkeley, CS Division", ADDRESS="Berkeley, California", NUMBER="UCB/CSD 89/498", MONTH=mar, YEAR=1989, KEYWORDS="continuous media; multimedia; real-time services; IPC; DASH", ABSTRACT="Motivates the design given in TR 88/462, gives some comparisons, and discusses implications for protocol and local system design. Description of channel parameters supercedes TR 88/462. --- Next-generation distributed computer systems will support network communication of digital multimedia (audio and video) traffic. Evolving hardware technology will provide the necessary performance. However, difficult design issues arise in the software structure of such a system. We consider three related issues: 1) What basic IPC abstractions can accommodate the likely range of traffic types? 2) How can IPC functions such as security and flow control be optimally assigned to system layers? 3) How can host resources such as CPU time and memory be optimally allocated? In response to these questions, we have defined channels, an IPC abstraction with security, reliability, and performance parameters. The channel abstraction underpins the network communication architecture of DASH, an experimental distributed system. In DASH, IPC functions are dynamically assigned to the layer in which they can be performed most efficiently, and the allocation policies for kernel resources are dictated by the performance needs of IPC. All IPC (loacl and request/reply as well as multimedia) is handled in a single framework.", URL="ftp://tr-ftp.cs.berkeley.edu/pub/tech-reports/csd/csd-89-498", } @INPROCEEDINGS{Hac8903:Comparison, AUTHOR="A. Hac and Xiaowei Jin and Jo-Han Soo", TITLE="A Performance Comparison of Deadlock Prevention and Detection Algorithms", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="473-480", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Corr8903:Error, AUTHOR="Antonio Corradi and P. Mello and A. Natali", TITLE="Error Recovery Mechanism for Remote Procedure Call-Based Systems", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="502-509", MONTH=mar, YEAR=1989, } @INPROCEEDINGS{Kuma8903:Systems, AUTHOR="D. Kumar", TITLE="Systems Whose Distributed Simulation Requires Low Overhead", BOOKTITLE="8th International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE", ADDRESS="Scottsdale, Arizona", PAGES="520-527", MONTH=mar, YEAR=1989, } @MISC{Levy8903:Distributed, AUTHOR="Eric Levy and Avi Silberschatz", TITLE="Distributed File Systems", NUMBER="TR-89-04", NOTE="Report is available for \$3.00 from Department of Computer Sciences, Technical Report Center, Taylor Hall 2.124, University of Texas at Austin, Austin, Texas, 78712-1188", MONTH=mar, YEAR=1989, ABSTRACT="Distributed File Systems are essential for sharing of data and storage space in a distributed system. A viewpoint that emphasizes the dispersed structure and decentralization of both data and control in the design of such systems is established. The concepts of location transparency, fault tolerance and scalability are defined and discussed in the context of Distributed File Systems. It is claimed that the principle of distributed operation is fundamental for a fault tolerant and scalable Distributed File System. Alternatives for the semantics of sharing and methods for providing access to remote files are also presented. A survey of current systems, namely Unix United, Locus, Sprite, Sun's Network File System, and ITC's Andrew, illustrates the discussed concepts and demonstrates various implementations and design alternatives. Based on the assessment of these systems, a point is made that a departure from the approach of extending centralized file systems over the network is necessary to accomplish sound Distributed File System design.", } @ARTICLE{Cota8903:Algorithm, AUTHOR="B. A. Cota and R. G. Sargent", TITLE="An algorithm for parallel discrete event simulation using common memory", JOURNAL=sigsim, ISBN="0-8186-1946-3", ADDRESS="Tampa, Florida", VOLUME=20, NUMBER=1, PAGES="23-31", NOTE="Proc. 22nd annual simulation symposium (ACM SIGSIM)", MONTH=mar, YEAR=1989, REFERENCES=12, KEYWORDS="Distributed simulation; algorithm; common memory", } @ARTICLE{Madi8903:Efficient, AUTHOR="V. Madisetti and J. Walrand and D. Messerschmitt", TITLE="Efficient distributed simulation", JOURNAL=sigsim, ISBN="0-8186-1946-3", ADDRESS="Tampa, Florida", VOLUME=20, NUMBER=1, PAGES="5-21", NOTE="Proc. 22nd annual simulation symposium (ACM SIGSIM)", MONTH=mar, YEAR=1989, REFERENCES=27, KEYWORDS="Distributed simulation; rollback", } @TECHREPORT{Abbo8903:RPC, AUTHOR="Mark Abbott and N. Hutchinson and Sean O'Malley and L. L. Peterson", TITLE="{RPC} in the x-Kernal: Evaluating New Design Techniques", INSTITUTION="University of Arizona, Tucson", NUMBER="TR 89-4", MONTH=mar, YEAR=1989, } @ARTICLE{Ball8903:Methodology, AUTHOR="B. P. Ballou and G. Kumar-Tayi", TITLE="Methodology for Allocating Resources for Data Quality Enhancement", JOURNAL=cacm, VOLUME=32, NUMBER=3, PAGES="320-329", MONTH=mar, YEAR=1989, } @ARTICLE{Hart8903:Human, AUTHOR="H. R. Hartson and D. Hix", TITLE="Human-Computer Interface Development: Concepts and Systems", JOURNAL=acmcs, VOLUME=21, NUMBER=1, PAGES="5-92", MONTH=mar, YEAR=1989, } @TECHREPORT{Marc8903:Port, AUTHOR="W. S. Marcus and D. W. McMillian", TITLE="Port Controller Functionality and Architectures for {ATM} Switching", INSTITUTION="Bellcore", NUMBER="TM-ARH-014116", MONTH=mar, YEAR=1989, } @ARTICLE{Drag8903:Efficient, AUTHOR="C. Dragone", TITLE="Efficient {$N} \times {N$} Star Couplers Using Fourier Optics", JOURNAL=ieeejlt, VOLUME="LT-7", NUMBER=3, PAGES="479-489", MONTH=mar, YEAR=1989, } @ARTICLE{Link8903:Frequency, AUTHOR="Richard A. Linke", TITLE="Frequency Division Multiplexed Optical Networks Using Heterodyne Detection", JOURNAL=ieeenet, VOLUME=3, NUMBER=3, PAGES="13-20", MONTH=mar, YEAR=1989, REFERENCES=53, } @INPROCEEDINGS{Crow8903:FDDI, AUTHOR="Jon Crowcroft", TITLE="{FDDI} and Broadband {ISDN.} Interconnection", BOOKTITLE="ACTES Telematiques a Grande Vitesse (Workshop)", ADDRESS="Liege", MONTH=mar, YEAR=1989, } @MISC{Chap8903:Defining, AUTHOR="N. P. Chapman", TITLE="Defining, analyzing and implementing communication protocols using attribute grammars", PAGES=30, NOTE="Formal Aspects of Computing 2 4 October-December 1990 359-392", MONTH=mar, YEAR=1989, ABSTRACT="A new approach to describing communication protocols is introduced. In the style of a formal language, the protocol is considered as the set of all legal sequences of symbols that can be exchanged by the communicating processes. Although context free grammars cannot adequately describe such sequences, it is shown that attribute grammars may be used. Examples are given which show that common protocol features such as interleaving, windowing and flow control can be described by attribute grammars.", } @INPROCEEDINGS{Kim8903:Features, AUTHOR="W. Kim", TITLE="Features of the {ORION} object-oriented programming database system", BOOKTITLE="Object oriented Concepts, Applications, and Database", ORGANIZATION="Addison Wesley", MONTH=mar, YEAR=1989, } @ARTICLE{Wrig8903:Linear, AUTHOR="M. Wright and K. M. Anstreicher and Clyde L. Monma", TITLE="Linear Programming Today, part 1-3", JOURNAL="SIAM News", MONTH=mar, YEAR=1989, KEYWORDS="Linear programming; LP", ABSTRACT="1. A Brief History of Linear Programming - From Fourier to the Ellipsoid Algorithm. 2. Progress in Interior Point Algorithms Since 1984. 3. Successful Implementations of Interior Algorithms.", } @INPROCEEDINGS{Cass8904:Optimal, AUTHOR="Christos Cassandras and Michelle Hruby Kallmes and Donald F. Towsley", TITLE="Optimal Routing and Flow Control in Networks with Real-Time Traffic", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="Ottawa, Canada", PAGES="784-791", MONTH=apr, YEAR=1989, KEYWORDS="flow control; routing; real-time; packet dropping", ABSTRACT="We address the problem of flow control and routing and routing of real-time traffic in a network where messages must arrive at their destination within given deadlines; otherwise they are considered lost. Performance in this case is measured in terms of the probability of losing a message. For the case of $n$ parallel links, the problem is formulated as one of optimal flow allocation and solved under general conditions. It is shown that for a FCFS service discipline and admission policy rejecting messages before link assignment is optimal when the load exceeds a critical value. Thus, we take advantage of the fact that if some messages will exceed their deadlines anyway, it is beneficial not to admit them in the first place. An efficient algorithm for explicitly solving the problem is presented and specific examples are analyzed. We also discuss the applicability of on-line algorithms for this problem when modeling assumptions cannot be made.", ANNOTE="random packet dropping", } @INPROCEEDINGS{Chip8904:Scheduling, AUTHOR="Renu Chipalkatti and James F. Kurose and Donald F. Towsley", TITLE="Scheduling Policies for Real-Time and Non-Real Time Traffic in a Statistical Multiplexer", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="774-783", MONTH=apr, YEAR=1989, REFERENCES=17, KEYWORDS="statistical multiplexer; queueing discipline; performance; real-time; scheduling; MLT; QLT", ABSTRACT="We examine the performance of several policies for scheduling real-time and non-real-time messages in a statistical multiplexer. The performance metric for the real-time traffic is the percentage of messages not transmitted within their deadlines; the performance metric for the non-real-time traffic is The scheduling policies are: 1)First Come First Served (FCFS), 2) Head of the Line Priority, in which real-time packets are given priority, 3) Maximum Laxity Threshold (MLT) Policy, and 4) Queue Length Threshold (QLT) Policy. Under the MLT policy priority is given to the real-time traffic when the minimum laxity is below some threshold. The QLT policy gives priority to the non-real-time traffic whenever the number of queued non-real-time packets is above some threshold. Our results show that the FCFS policy causes relatively high losses for the real-time traffic while providing relatively low message delays for the non-real-time traffic; the converse holds true for the strict Priority discipline. Both the MLT and QLT discipline schemes allow the designer to explicitly tradeoff the performance realized by each traffic class by using an appropriately chosen value for the threshold parameter. We observe little difference in the performance tradeoffs available using these two policies and consequently conclude that the QLT policy is more practical, as it is simpler to implement. Numerical results are given throughout the paper to support our observations.", ANNOTE="policies: FCFS, head-of-line priority for real-time, minimum laxity with priority for real-time if laxity below threshold (MLT), queue length threshold (QLT) with priority for non-realtime if queue length above threshold; recommends QLT", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Chla8904:Purely, AUTHOR="I. Chlamtac and A. Ganz and G. Karmi", TITLE="Purely Optical Networks for Terabit Communication", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="887-896", MONTH=apr, YEAR=1989, REFERENCES=27, KEYWORDS="optical networks", ABSTRACT="Emerging applications require a substantially higher bandwidth than the one offered by current networks. The technology necessary for providing the high bandwidth on the optical fibers, by means of Wavelength Division Multiplexing (WDM) exists. However, none of the network architectures proposed so far can efficiently tap this bandwidth, due to the limitations imposed by the processing, buffering and switching required in these solutions. In this paper we propose a novel architectural approach that meets the high bandwidth requirements by introducing a communication architecture based on lightpaths - purely optical transmission paths in the network. Since lightpaths form the building block of the proposed architecture, its performance hinges on their efficient establishment and management. We show that although the problem of optimally establishing lightpaths is NP-Complete, distributed heuristics provide near optimal solutions for several of the basic problems motivated by the Lightpath architecture.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Come8904:FLOWS, AUTHOR="D. Comer and R. Yavatkar", TITLE="{FLOWS:} Performance Guarantees in Best Effort Delivery Systems", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="100-109", MONTH=apr, YEAR=1989, REFERENCES=29, KEYWORDS="congestion control", ABSTRACT="A best effort delivery system provides a connectionsless, datagram service in which the packets may be delayed or dropped in the presence of congestion. The underlying network does not make any guarantees about performance to an application. Performance needs of various applications differ greatly and applications such as packet voice and video have strict performance requirements. Existing network architectures and protocols do not make provisions for applications to specify their performance needs, and communication architectures do not have mechanisms that satisfy and guarantee performance. We introducee a network level communication abstraction called flow. A flow is a communication channel that has specific performance characteristics associated with its traffic. The underlying delivery system guarantees to meet performance requirements of a flow once it accepts a flow request. Upper layers use flow to implement transport level protocols and high performance applications. This paper describes the concept of flows in detail and present algorithms that implement flows in a high speed packet switched network under development at Purdue University.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{DaSi8904:Class, AUTHOR="Luiz A. DaSilva and David Petr and Victor S. Frost", TITLE="A Class-oriented Replacement Technique for Lost Speech Packets", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1098-1105", MONTH=apr, YEAR=1989, REFERENCES=13, KEYWORDS="packet voice", ABSTRACT={A replacement technique for lost speech packets is presented. This technique is based on the classification of the packets into four distinct classes: background noise, voiced speech, fricatives and "other". Different encoding schemes and lost packet replacement techniques are used for each class. Results of subjective tests indicate that giving preferential delivery treatment to packets based on class can be used to improve subjective quality. The replacement strategy renders the reconstructed signal indistinguishable from the original utterance for packet loss rates up to 47\% for background noise packets, 8\% for fricative packets, and 4\% for "other" packets. For voiced packets, the replacement is distinguishable from the original signal even for packet loss rates lower than 5\%, but significant improvement may be possible by reducing the memory associated with the voiced speech coding process.}, ANNOTE="classifies packets into background noise, voiced speech, fricatives and ``other'', allows losses of up to 47\% for noise, 8\% for fricative and 4\% for other packets; voiced packets are more sensitive, with loss noticeable for less than 5\%; no TASI", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Chan8904:Mobile, AUTHOR="R. F. Chang and V. Li", TITLE="Performance Analysis of Mobile Packet Radio Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1084-1088", MONTH=apr, YEAR=1989, REFERENCES=11, KEYWORDS="queueing theory; integrated voice-data networks", ABSTRACT="A model is proposed for analyzing the performance of a Mobile Packet Radio Network. In this network a node is allowed to move around with a random velocity. Hence, the distribution of the number of nodes in one's transmission circle is dependent on the mobility of the nodes. We develop a queueing model to evaluate this distribution and the effects of node mobility on system performance. This effect cannot be obtained by the classical two-dimensional Poisson model. It is found that an optimal power radius is dependent on the node mobility.", ANNOTE="$M/\tilde{D}/1/K$ model for each node", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Ferg8904:Economy, AUTHOR="Donald F. Ferguson and Christos N. Nikolaou and Y. Yemini", TITLE="An Economy for Flow Control in Computer Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="110-118", MONTH=apr, YEAR=1989, REFERENCES=25, KEYWORDS="congestion control", ABSTRACT="This paper presents a flow control mechanism based onan economic model of optimum decentralized decision making. The virtual circuits (VCs) of the network are considered as economic agents competing for link capacity resources. Each VC is equipped with a preference relation defining its individual throughput-delay goals. VCs are endowed with certain budgets whch they use to purchase capacity resources in a purely competitive economy. Prices of link capacities are iteratively adjusted to reach an equilibrium of supply and demand. The paper makes 3 contributions to the study of flow control protocols. First, it presents fully decentralized flow control algorithms that allocate capacity to reflect both, varying priorities among VCs as well as their varied preferences and needs. Second, we establish taht the flow control algorithms results in Pareto-optimal allocation of capacities. This implies that the algorithms accomplish optimally fair allocation of resources given the set priorities and preferences. Third, experimental evidence is provided that the algorithms converge rapidly.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Kobz8904:Head, AUTHOR="John Kobza", TITLE="A Head-Of-Line Approximation to Delay-Dependent Scheduling in Integrated Packet-Switched Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1106-1113", MONTH=apr, YEAR=1989, REFERENCES=14, KEYWORDS="packet voice", ABSTRACT="Packet switching is one means of providing integrated voice/data communications. Voice packets have a finite lifetime, representing the time between packet generation and playback. If a packet misses its playback time, it is dropped, degrading customer speech quality. The chief cause of packet loss is the variability of end-to-end delay due to queueing at intermediate nodes. The queueing discipline used within the network directly affects this delay variance. In an integrated environment, scheduling must provide adequate performance for all classes. We first used simulation to compare the performance of several queueing disciplines for trunk scheduling at a packet switch with only voice traffic. A delay-dependent priority scheme, the Budgeted Residual-Life Dependent Discipline (BURD), resulted in the lowest packet loss rate at the node. We then used BURD and a Head-Of-Line discipline, to construct scheduling policies for networks with integrated traffic. We found it was possible to approximate the performance of the delay-dependent priority schemes using more easily implemented Head-Of-Line schemes and still provide adequate service for data traffic.", ANNOTE="Simulation study of single packet switch for voice traffic. Compares FCFS, HOL, delay dependent disciplines. The latter include: packet residual-life activated discipline (PRAD), budgeted residual-life dependent discipline (BURD) and recommended delay-based head-of-line (RmHOL). Generally, BURD yields the lowest loss. Path length is uniformly distributed between 1 and 3 hops. Ages packets by prepending two nodes. Half the traffic at nodes two and three comes from previous node. External arrivals are Poisson. Packets that exceed their lifetime are dropped. Also investigates integrated traffic including data traffic (small/large packets) with FCFS over all three classes, delay-dependent voice (DDV) and head-of-line voice (HOLV). Paper recommends HOLV.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Leun8904:Single, AUTHOR="K. K. Leung and M. Eisenberg", TITLE="A Single-Server Queue with Vacations and Gated Time-Limited Service", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="Ottawa, Canada", PAGES="897-906", MONTH=apr, YEAR=1989, KEYWORDS="queueing theory", ABSTRACT="The paper analyzes an $M/G/1$ queue with server vacations and gated time-limited service. We first derive a functional equation which characterizes the amount of work, $U\_p$, at the server's return from a vacation. To solve the equation, we employ an interesting numerical technique in which the complementary cumulative function for $U\_p$ is closely approximated by a weighted sum of Laguerre functions with unknown coefficients. The equation is then transformed into a set of linear equations from which the coefficients can be computed. By the stochastic decomposition and PASTA properties, the average customer response time can be related to the average amount of work found by an arrival. Several numerical examples are included. The model studied in the paper is applicable to analyzing a specific recently proposed communication channel that alternately serves voice and data traffic, token-passing networks with token-holding timers, and other communication and computer systems where timers are used to allocate service among multiple types of customers.", } @ARTICLE{Meie8904:Queue, AUTHOR="K. S. Meier-Hellstern", TITLE="The Analysis of a Queue Arising in Overflow Models", JOURNAL=ieeecom, VOLUME=37, NUMBER=4, PAGES="367-372", MONTH=apr, YEAR=1989, KEYWORDS="queueing theory", ABSTRACT="Methodology is presented for analyzing a queueing submodel which frequently arises in the study of overflow models --- a finite capacity, multiserver queue with exponentially distributed service times, and arriving traffic consisting of a Poisson parcel and several overflow parcels. By modeling the overflow parcels as interrupted Poisson processes, an exact queueing analysis is possible. The analysis yields 1) the steady-state queue length distribution, and for each input parcel, 2) the steady-state queue length distribution at arrivals, 3) the probability that an arriving call is blocked (parcel blocking), and 4) the waiting time distribution of an arriving call, in addition to a complete characterization of the overflow due to each parcel.", ANNOTE="see \cite{Meie88:Parcel}.", } @INPROCEEDINGS{Mele8904:Nonblocking, AUTHOR="R. Melen and J. S. Turner", TITLE="Nonblocking Networks for Fast Packet Switching", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="548-557", MONTH=apr, YEAR=1989, REFERENCES=15, KEYWORDS="fast packet switching", ABSTRACT="We define and study an extension of the classical theory of nonblocking networks that is applicable to multirate circuit and fast packet/ATM switching systems. We determine conditions under which the Clos, Cantor and Benes networks are strictly nonblocking. We also determine conditions under which the Benes network and variants of the Cantor and Clos networks are rearrangeable. We find that strictly nonblocking operation can be obtained for multirate traffic with essentially the same complexity as in the classical context.", URL="http://www.comsoc.org/confs/infocom/", } @PROCEEDINGS{8904:Agenda, TITLE="An Agenda for Research in Networking and Communications", ORGANIZATION="National Science Foundation", ADDRESS="Washington, D.C.", NOTE="Report to the NSF Division of Networking and Communications Research and Infrastructure by Members of the Workshop held April 30 to May 2, 1989, Airlie House, Virginia", MONTH=apr, YEAR=1989, KEYWORDS="BISDN", } @INPROCEEDINGS{Paru8904:Framework, AUTHOR="G. M. Parulkar and J. S. Turner", TITLE="Towards a Framework for High Speed Communication in a Heterogeneous Networking Environment", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="Ottawa, Canada", PAGES="655-667", MONTH=apr, YEAR=1989, REFERENCES=18, KEYWORDS="transport protocol; high-speed networks", ABSTRACT="In this paper we attempt to formulate a framework for high speed communication in an environment comprising a mix of subnetworks with widely varying characteristics. Recent work on high speed wide area packet switching systems is expected to lead to the development of large public networks capable of supporting applications ranging from low speed data to voice, high speed data and video. If such networks are to realize their full potential, they must be designed to operate in an environment that includes networks with widely varying characteristics. Since the early seventies, much of the work on computer communication has been directed toward the development of protocols that allow interworking among computers, operating systems and communication subnetworks of different types. These efforts have culminated in the Arpa Internet Protocol Suite which has introduced a number of ideas of fundamental importance. Since the development of the internet protocols, the technological context in which we find ourselves has changed dramatically. The development of high speed LANs and workstations, and the growing role of supercomputers in scientific computing have led to new and largely unfulfilled requirements for high speed computer communication. These needs have been difficult to satisfy for a combination of reasons. First, existing wide-area computer networks have been unable to support the data rates required and second, the existing end-to-end protocols and host computers are unable to deliver the data to the application at those rates. On the other hand, fiber optic transmission systems are being introduced rapidly into the national communications infrastructure offering vast amounts of bandwidth at fairly modest costs. Several research groups at industrial and academic laboratories around the world have demonstrated that new high speed packet switching techniques can make these resources available in a flexible fashion, but up to now these groups have failed to consider the need to operate in a complex networking environment consisting of autonomous and/or technologically dissimilar subnetworks. We feel that it is important to recognize that this kind of heterogeneous environment is here to stay and if we are to make the best possible use of new developments in networking, we need to establish a framework that supports such diversity. In this paper we attempt to address these issues. We first provide some background on both the current internet model and high speed packet switching. We then outline the major elements of an extended internet model that allows interworking of new high speed packet networks with a wide range of other networks, including current data networks and national telephone networks. Finally, we discuss some end-to-end and host interface issues.", ANNOTE="Suggests light-weight Internet protocols, domain-oriented addressing, parametric description of subnet capabilities; discusses issues of datagram traffic in circuit-switched subnets, and vice versa; argues for application-specific transport protocols.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Patt8904:Three, AUTHOR="John F. Patterson and Carmen Egido", TITLE="Three Keys to the Broadband Future: A View of Applications", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="611-616", MONTH=apr, YEAR=1989, REFERENCES=17, KEYWORDS="BISDN; applications", ABSTRACT="We suggest three keys for unlocking the broadband future based on an analysis of human and societal communication needs. We adopt a framework that distinguishes three categories of communication need: access to people, access to information, and access to information processing. Within this framework, we argue that applications that emphasize shared visual material, that accommodate advertisers as important end-users, and that include effective security provisions may play a crucial role in realizing the broadband future.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Rubi8904:Message, AUTHOR="I. Rubin and Montasser Quaily", TITLE="Performance Analysis of message delay limited synchronous communication and queueing systems", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="51-58", MONTH=apr, YEAR=1989, REFERENCES=4, ABSTRACT="We carry out analysis and performance comparison s of synchronous discrete-time queueing systems operating under a message waiting-time or delay-time constraint. A system employing a wait-time constraint imposes a limit on the maximum number of time-slots a message is allowed to spend in the system queue, prior to the start of its service. A system which employs a message delay-time constraint, imposes a limit upon the total residence-time (in slots) of a message within the system. Such systems are of key importance for communication network applications. Four different system admission and preemption policies are investigated. Under either a wait-time constraint or a delay-time limit, newly arriving messages are either always admitted (and then properly dismissed if their required residence limits are not met); or a determination is made upon arrival on whether the new message can be served to completion within its required time limit, and only then this message is admitted. We investigate and compare the delay-throughput performance of these admission and service-preemption policies, for synchronous discrete-time communications and processing systems modeled as a single server Geom/G/1 discrete-time queueing system. Such models are used to describe various multiplexing and demand-assigned (reservation-based) multiple-access communication network systems, operating under message delay limits.", ANNOTE="Bounded wait. Discrete-time $Geo/G/1$ (one arrival per slot) queue with message waiting time or delay-time constraint.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Stas8904:Multiplexing, AUTHOR="G. I. Stassinopoulos and J. Tsiligaridis", TITLE="Multiplexing in the {ATM} environment", BOOKTITLE="Mediterranean Electrotechnical Conference (MELCON)", ADDRESS="Lisbon, Portugal", PAGES="425-428", MONTH=apr, YEAR=1989, ABSTRACT="The authors analyze a typical multiplexer setup where the interplay between packet loss and delay is vividly illustrated. Arrival statistics are realistically contrasted for real-time (voice) and nonreal-time (data) packets. A multiplexer of real- and nonreal-time data is presented; it is considered as a generic network element appearing either within a user integrated service terminal or within a more elaborate user premises network accessing a packet switched integrated broadband communication facility. Markov analysis is performed for an asynchronous transfer mode (ATM) environment. Numerical results are presented.", } @INPROCEEDINGS{Timm8904:Broadband, AUTHOR="Stephen Timms", TITLE="Broadband Communications: The Commercial Impact", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="602-610", MONTH=apr, YEAR=1989, KEYWORDS="Bisdn", ABSTRACT="This paper summarizes and updates research carried out by Ovum for its report of the same title, published in 1987. It outlines the major technologies and commercial applications underlying the development of broadband communications, and forecasts the speed of its introduction.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Tsai8904:Fairness, AUTHOR="Wei K. Tsai and P. E. Cantrell and Jeffrey Goos", TITLE="Fairness of Optimal Routing in Virtual Circuit Data Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="119-126", MONTH=apr, YEAR=1989, REFERENCES=19, ABSTRACT={Fairness in multiple path optimal routing algorithms in virtual circuit data networks is investigated. Fairness measures are developed to evaluate optimal routings. Several objective functions are considered to be possible replacements of the average packet delay objective function widely used in optimal routing algorithms. These objective functions are evaluated for various network and traffic configurations. Using the fairness measures developed, our numerical study shows that the objective function which is in the "integral form" of the average packet delay achieves perfect fairness while sacrificing only a nominal increase in the average packet delay. The current ARPANET routing algorithm can be shown to equivalently performing an on-line optimization using this "integral form" of objective function. Our numerical study also confirms the conjecture by Bertsekas and Gallager that the form of objective function does not affect the average packet delay in any significant way.}, ANNOTE="Routing", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Wrig8904:Characterization, AUTHOR="D. Wright and Michael To", TITLE="A Characterization of Telecommunication Services in the 1990s", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="624-631", MONTH=apr, YEAR=1989, REFERENCES=19, ABSTRACT="This paper presents a characterization of voice, data, facsimile, image, audio and video telecommunication services of the next decade. User oriented features such as performance criteria are related to transport requirements. A broad diversity of services is described and these are then classified into groups from a transport perspective. This leads to implications on cell priority designation for asynchronous time division multiplexing (ATDM). One of the service groups is shown to offer a scenario for the introduction of ATDM which is attractive both to the user and the telco.", ANNOTE="Divides traffic into interactive and distribution, then into conversational, messaging and retrieval \cite{CCIT88:I.121}; provides examples", URL="http://www.comsoc.org/confs/infocom/", } @ARTICLE{Yama8904:Error, AUTHOR="Yutaka Yamamoto and Thomas Wright", TITLE="Error Performance in Evolving Digital Networks Including {ISDN's}", JOURNAL=ieeecm, PAGES="12-18", MONTH=apr, YEAR=1989, ANNOTE="bounds on BER for different services; defines error-free seconds and similar measurements; modeling of error distribution.", } @INPROCEEDINGS{Rama8904:Distributed, AUTHOR="R. Ramaswami and Keshab K. Parhi", TITLE="Distributed Scheduling of Broadcasts in a Radio Network", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="497-504", MONTH=apr, YEAR=1989, REFERENCES=18, ABSTRACT="We present a distributed algorithm for obtaining an efficient and conflict-free broadcasting schedule in a multi-hop packet radio network. The inherent broadcast nature of the radio channel enables a node's transmission to be received by all other nodes within range. Multiple transmissions can be scheduled simultaneously because of the multi-hop nature of the network. We first show that the construction of a broadcasting schedule of minimum length is NP complete, and then present a centralized algorithm based on a sequential graph coloring heuristic to construct minimal length schedules. We then propose a distributed implementation of this algorithm, which is based on circulating a token through the nodes in the network.", URL="http://www.comsoc.org/confs/infocom/", } @ARTICLE{Yang8904:Platform, AUTHOR="Yi Yang and Steven E. Butner", TITLE="A Platform for Experimental Real-Time Sensory Based Robot Control", JOURNAL=ieeesmc, VOLUME=19, NUMBER=4, PAGES="853-860", MONTH=apr, YEAR=1989, } @INPROCEEDINGS{Gers8904:Congestion, AUTHOR="A. Gersht and K.-H. Lee", TITLE="A congestion control framework for {ATM} networks", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="Ottawa, Canada", PAGES="701-710", MONTH=apr, YEAR=1989, KEYWORDS="ATM; congestion control", ABSTRACT="In this paper we propose a congestion control framework for ATM networks. Specifically, we suggest that the network provides two different services: express service and first-class service. Express service is appropriate for real-time applications (e.g., voice and video) whereas first-class service is appropriate for non-real-time applications (e.g., data). To provide such services, the proposed congestion control scheme prevents congestion inside the network by controlling the congestion at two levels: VC level and packet level. The VC-level control takes place during the call setup in the form of (logical) bandwidth reservation for individual VCs; this control limits the maximum bandwidth reservation levels of links/nodes on the route by way of call blocking, so as to prevent congestion inside the network due to VC traffic overload. On the other hand, the packet-level control is exercised across the network interface in the form of choking/relieving of only first-class VC traffic in case of congestion. Express VC traffic is not subject to any flow control. At each intermediate node, transit packets are simply relayed with no traffic control. We discuss various issues related to this scheme and analyze its performance.", } @INPROCEEDINGS{Morg8904:Queueing, AUTHOR="Samuel P. Morgan", TITLE="Queueing discipline and passive congestion control in byte-stream networks", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="Ottawa, Canada", PAGES="711-720", MONTH=apr, YEAR=1989, REFERENCES=19, KEYWORDS="Datakit; round robin; performance evaluation; FIFO; packet switching; queueing discipline", ABSTRACT="We compare the performance of first-in-first-out and round-robin packet service disciplines at the trunk nodes of byte-stream networks, including priority service for single-packet messages. We survey delay and throughput characteristics as a function of traffic mix, packet size, traffic intensity, and the ratio of trunk speed to access line speed. Exact and approximate analyses are compared with the results of simulations. Under normal traffic conditions, most disciplines will give acceptable mean delay if the ratio of trunk speed to access line speed is sufficiently high. Under congestion, round-robin disciplines have better fairness properties than first-in-first-out disciplines, in that they protect well-behaved users against hogs.", } @INPROCEEDINGS{Welc8904:Graceful, AUTHOR="P. H. Welch", TITLE="Graceful termination -- graceful resetting", BOOKTITLE="Applying transputer based parallel machines --- the 10th occam User Group Technical Meeting", EDITOR="André Bakkers", ORGANIZATION="Occam User Group (OUG)", ADDRESS="Enschede, Netherlands", PAGES="310-317", MONTH=apr, YEAR=1989, KEYWORDS="occam; transputer; resetting; process control; termination; parallel processing", ABSTRACT="Correct --- let alone graceful --- termination of parallel systems is sometimes thought to be a difficult problem. This is particularly imagined to be so under the pure message-passing MIMD discipline of occam and transputer networks, where global operations (like setting a shared flag or abortions) are not allowed and where time-outs cannot be set for every communication. This paper describes some common, but erroneous, occam approaches to this problem and contrasts them with what can be done in Ada. These methods are all rejected on the grounds of insecurity and performance overheads. A simple, legal, secure and efficient occam method is then presented. This method also solves a much more important problem -- the general (or partial) resetting of a parallel systme (or sub-system). The resetting mechanism is quite independent of the parallel application algorithm, which can therefore be developed without worrying about such matters. This separation of concerns is good software engineering and is fully supported by the occam philosophy. Finally, an application of this resetting mechanism is described that permits the dynamic reconstruction of occam network topologies.", } @UNPUBLISHED{Arvi8904:New, AUTHOR="K. Arvind", TITLE="A new probabilistic algorithm for clock synchronization", INSTITUTION="Department of Computer and Information Science, University of Massachusetts at Amherst", NOTE="Spring Project Note", MONTH=apr, YEAR=1989, KEYWORDS="clock synchronization; distributed systems", ABSTRACT="We present a new averaging probabilistic clock synchronization algorithm, based on the redundant transmission of multiple synchronization messages, that can guarantee a much lower upper bound on the deviation between clocks than most existing algorithms. Our algorithm is probabilistic in the sense that the upper bound on the deviation that it guarantees has a probability of invalidity associated with it. The probability of invalidity, i.e., the probability that the deviation exceeds the guaranteed maximum deviation, may however be made extremely small by sufficiently increasing the number of messages transmitted. We prove that an upper bound on the probability of invalidity decreases exponentially with the number of messages, i.e., the probability of invalidity itself decreases exponentially or better.", } @INPROCEEDINGS{Todd8904:Compatible, AUTHOR="T. D. Todd", TITLE="A Compatible {ISDN} gateway for broadband metropolitan area networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="810-817", MONTH=apr, YEAR=1989, REFERENCES=14, ABSTRACT="In this paper a novel gateway design (referred to as T-SWIFT) is presented for integrating the flow of voice streams into existing broadband cable systems. The interface between the integrated voice subnetwork and the cable system is realized by a metropolitan area gateway (or MAG) which is implemented at the broadband cable headend. In T-SWIFT, an intelligent scheduling algorithm in the MAG dynamically allocates channel bandwidth using a variation of the data switch-filtering and fixed-frame synchronous voice/data integration techniques introduced in [2] and [13] respectively. The MAG accomplishes this by coordinating the transmission of inbound and outbound voice talkspurts in an upwardly compatible fashion with respect to the existing CSMA/CD data stations. Thus previously installed stations require no modification. Results are presented which indicate that the T-SWIFT design performs significantly better than previous compatible voice/data integration methods.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Cido8904:Recursive, AUTHOR="I. Cidon and M. Sidi", TITLE="Recursive Computation of Steady-State probabilities in priority queues", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="47-50", MONTH=apr, YEAR=1989, REFERENCES=10, KEYWORDS="Queueing system; priority; steady state probability", ABSTRACT="We derive recursive formulas for computing the state probabilities in priority queueing systems (preemptive and non-preemptive). The derivation is based only on the general structure of the generating function involved, and thus is simpler and more general than previous methods. We also discuss the applications of the method to other queueing systems.", } @INPROCEEDINGS{Szym8904:Markov, AUTHOR="T. H. Szymanski and Salman Shaikh", TITLE="Markov chain analysis of packet-switched banyans with arbitrary switch sizes, queue sizes, link multiplicities and speedups", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="960-971", MONTH=apr, YEAR=1989, REFERENCES=27, KEYWORDS="banyan network; markov chain; analysis", ABSTRACT="Approximate Markov chains for the performance of banyan networks built with basic switches of arbitrary size containing input queues, output queues or a combination of input buffers and output queues are presented. These chains are also extended to model banyans where each link is replaced by a number of parallel links. Comparisons with simulations indicate that the chains are reasonably accurate for practical network loads. It is shown that banyans built with switches containing a combination of single input buffers and output queues outperforms banyans built with switches containing only input queues or only output queues. Banyans built with larger nodes are shown to outperform banyans built with smaller nodes. It is also shown that banyan based networks with multiple links can be designed to have extremely low blocking probabilities.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Mart8904:High, AUTHOR="P. Martini", TITLE="High Speed Bridges for High Speed Local Area Networks --- Packets per Second vs. Bits per Second", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="474-483", MONTH=apr, YEAR=1989, REFERENCES=25, KEYWORDS="LAN", ABSTRACT="Progress in optical component design allows ever increasing channel capacity for Local Area Networks (LANs). Now that we have become familiar with data rates in the range of 10 Mb/s the next step is already in front of us. Upcoming standards for High Speed Local Area Networks (HSLANs), prototypes and even products commercially available make HSLANs operating at data rates exceeding 100 Mb/s move into the focus of interest. During the last few years many problems with respect to the design of MAC-protocols for these communication systems have been solved. It turned out that considerable modifications of protocols designed for LANs could not be avoided. However, there are still many problems to solve with respect to high speed bridges interconnecting LANs and HSLANs. In this paper we compare the performance of bridges to the performance of the HSLAN itself. The results show that state-of-the-art bridges are very likely to become the bottlenecks in future high speed backbone networks.", ANNOTE="In the paper the performance of bridges is compared to the performance of the HSLAN itself. The results show that state-of-the-art bridges are very likely to become the bottlenecks in future high speed backbone networks. Coefficient-of-variation modeling of bridges from LAN to token-ring HSLAN; diffusion equation; file transfer and interactive traffic", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Shu8904:Synchronization, AUTHOR="J. C. Shu and Minkui Liu", TITLE="A Synchronization Model for Protocol Conversion", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="276-284", MONTH=apr, YEAR=1989, REFERENCES=12, ABSTRACT="Protocol conversion is to resolve the incompatibility between protocols so that users on different networks can communicate with each other. This paper presents a formal model to analyze two aspects of conversion problems: translation and synchronization. The purpose of the translation is to map messages in one protocol to those in another protocol, whereas the synchronization is to hold matched messages for carrying out the translation. An algorithm is then given to construct a valid converter. The algorithm itself is low in space complexity, and yields a converter with several merits: concurrent processing, easy debugging, minimum work on development, and easy implementation for half-gateways.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Rust8904:Rule, AUTHOR="Lillian Ruston and P. K. Sen", TITLE="A Rule-Based System for Packet Radio Network design", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="512-519", MONTH=apr, YEAR=1989, REFERENCES=12, ABSTRACT="In broadcast networks such as packet radio networks, network capacity depends on network connectivity, yet the exact nature of the capacity/connectivity relationship defines simple categorization. This paper introduces a general method capable of improving network capacity by altering connectivity values, and remains sufficiently broad to allow use on a wide range of packet radio network topologies, traffic requirements, and protocols. The approach uses artificial intelligence techniques to formulate design rules which quantitatively describe individual aspects of the capacity/connectivity dependence. Incorporation of the design rules into a rule-based computer optimization program produces, on average, 15-25\% capacity improvement for both random and regular network inputs. Optimization results lead to conclusions about efficient network topology and operation, and permit further capacity/connectivity generalizations. The approach used, as well as many of the rules developed, go beyond the domain of packet radio networks, and are applicable to many general network design problems.", URL="http://www.comsoc.org/confs/infocom/", } @ARTICLE{Schn8904:Distributed, AUTHOR="N. Schneidewind", TITLE="Distributed System Software Design Paradigm with Application to Computer Networks", JOURNAL=ieeese, VOLUME=15, NUMBER=4, PAGES="402-412", MONTH=apr, YEAR=1989, ABSTRACT="A paradigm for the system and software design of distributed systems is presented with application to an actual large scale computer network involving both local area networks and a wide area network. A number of design principles are offered with particular reference to how they can be applied to the design of distributed systems. The major contribution of this paper to the field of distributed systems is an explanation of how to make design decisions about distributed systems in a way which will enhance maintainability and understandability of the software and, at the same time, result in good system performance. Our aim is to recognize the implications for software quality of various decisions which must be made in the process of specifying a distributed system.", } @ARTICLE{Need8904:Report, AUTHOR="R. M. Needham and A. J. Herbert", TITLE="Report on the Third European {SIGOPS} Workshop: ``Autonomy or Interdependence in Distributed Systems''", JOURNAL=acmosrev, VOLUME=23, NUMBER=2, PAGES="3-19", MONTH=apr, YEAR=1989, } @ARTICLE{Bogg8904:Errata, AUTHOR="David R. Boggs and J. C. Mogul and Christopher A. Kent", TITLE="Errata for ``Measured Capacity of an Ethernet: Myths and Reality''", JOURNAL=ccr, PUBLISHER="sigcomm", VOLUME=19, NUMBER=2, PAGES=10, MONTH=apr, YEAR=1989, REFERENCES=4, ANNOTE="Note: A correction to a paper in Proc. ACM SIGCOMM '88.", URL="http://www.acm.org/sigcomm/ccr/archive/1989/apr89/boggs.ps", } @ARTICLE{Borm8904:Implementing, AUTHOR="David A. Borman", TITLE="Implementing {TCP/IP} on a Cray Computer", JOURNAL=ccr, PUBLISHER="sigcomm", VOLUME=19, NUMBER=2, PAGES="11-15", MONTH=apr, YEAR=1989, ABSTRACT="Cray Research has been supplying TCP/IP networking code with its UNICOS operating system since February 1986. In the past three years, this code has been improved and optimized, yieldng up to two orders of magnitude improvement in performance. This paper addresses some of the issues that were addressed to achieve these changes, and some of the other changes that have been made to fit the TCP/IP code into a Cray environment.", URL="http://www.acm.org/sigcomm/ccr/archive/1989/apr89/borman.ms.tbl", } @ARTICLE{Nowi8904:Transport, AUTHOR="Bill Nowicki", TITLE="Transport Issues in the Network File System", JOURNAL=ccr, PUBLISHER="sigcomm", VOLUME=19, NUMBER=2, PAGES="16-20", MONTH=apr, YEAR=1989, REFERENCES=10, URL="http://www.acm.org/sigcomm/ccr/archive/1989/apr89/nowicki.ps", } @ARTICLE{Pete8904:Overview, AUTHOR="L. L. Peterson", TITLE="An Overview of {UNP}", JOURNAL=ccr, PUBLISHER="sigcomm", VOLUME=19, NUMBER=2, PAGES="21-31", MONTH=apr, YEAR=1989, REFERENCES=13, ABSTRACT="The paper gives a brief introduction to UNP: the Universal Naming protocol. UNP specifies a generic attibute-based name server upon which a variety of high-level naming services--including white- and yellow-page services--can be built.", URL="http://www.acm.org/sigcomm/ccr/archive/1989/apr89/unp.ps", } @ARTICLE{Bell8904:Security, AUTHOR="S. M. Bellovin", TITLE="Security Problems in the {TCP/IP} Protocol Suite", JOURNAL=ccr, PUBLISHER="sigcomm", VOLUME=19, NUMBER=2, PAGES="32-48", MONTH=apr, YEAR=1989, REFERENCES=54, ABSTRACT="The TCP/IP protocol suite, which is widely used today, was developed under the sponsorship of the Department of Defense. Despite that, there are a number of serious security flaws inherent in the protocols, regardless of the correctness of any implementations. We describe a variety of attacks based on these flaws, including sequence number spoofing, routing attacks, source address spoofing, and authentication attacks. We also present defenses against these attacks, and conclude with a discussion of broad-spectrum defenses such as encryption.", URL="http://www.acm.org/sigcomm/ccr/archive/1989/apr89/smb.ps", } @ARTICLE{Barz8904:Notable, AUTHOR="H. W. Barz", TITLE="Notable Abbreviations in Telecommunications - Second Edition", JOURNAL=ccr, PUBLISHER="sigcomm", VOLUME=19, NUMBER=2, PAGES="67-85", MONTH=apr, YEAR=1989, } @ARTICLE{Plum8904:TCP, AUTHOR="William W. Plummer", TITLE="{TCP} Checksum Function Design", JOURNAL=ccr, PUBLISHER="sigcomm", VOLUME=19, NUMBER=2, PAGES="95-101", MONTH=apr, YEAR=1989, REFERENCES=13, } @ARTICLE{Stav8904:Limited, AUTHOR="I. Stavrakakis and D. Kazakos", TITLE="A Limited Sensing Protocol for Multiuser Packet Radio Systems", JOURNAL=ieeecom, VOLUME=37, NUMBER=4, PAGES="353-359", MONTH=apr, YEAR=1989, } @INPROCEEDINGS{Arno8904:Nectar, AUTHOR="Emmanuel A. Arnould and Francois J. Bitz and E. Cooper and R. D. Sansom and Peter Steenkiste", TITLE="The Design of Nectar: A Network Backplane for Heterogeneous Multicomputers", BOOKTITLE="3rd International Conference on Architectural Support for Programming Languages and Operating Systems", PUBLISHER="ACM", ADDRESS="Boston", PAGES="205-216", NOTE="Also available as Technical Report CMU-CS-89-101, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213.", MONTH=apr, YEAR=1989, ABSTRACT="Nectar is a ``network backplane'' for use in heterogeneous multicomputers. The initial system consists of a star-shaped fiber-optic network with an aggregate bandwidth of 1.6 gigabits/second and a switching latency of 700 nanoseconds. The system can be scaled up by connecting hundreds of these networks together. The Nectar architecture provides a flexible way to handle heterogeneity and task-level parallelism. A wide variety of machines can be connected as Nectar nodes and the Nectar system software allows applications to communicate at a high level. Protocol processing is off-loaded to powerful communication processors so that nodes do not have to support a suite of network protocols. We have designed and built a prototype Nectar system that has been operational since November 1988. This paper presents the motivation and goals for Nectar and describes its hardware and software. The presentation emphasizes how the goals influenced the design decisions and led to the novel aspects of Nectar.", } @ARTICLE{Rabi8904:Efficient, AUTHOR="Michael O. Rabin", TITLE="Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance", JOURNAL=jacm, VOLUME=36, NUMBER=2, PAGES="335-348", MONTH=apr, YEAR=1989, ABSTRACT="An Information Dispersal Algorithm (IDA) is developed that breaks a file $F$ of length $L=|F|$ into $n$ pieces $Fi$, $1<=i<=n$, each of length $|Fi|=L/m$, so that every $m$ pieces suffice for reconstruction $F$. Dispersal and reconstruction are computationally efficient. The sum of the lengths $|Fi|$ is $(n/m)*L$. Since $n/m$ can be chose to be close to 1, the IDA is space efficient. IDA has numerous applications to secure and reliable storage of information in computer networks and even on single disks, to fault-tolerant and efficient transmission of information in networks, and to communications between processors in parallel computers. For the latter problem provably time-efficient and highly fault-tolerant routing on the n-cube is achieved, using just constant size buffers.", } @ARTICLE{Gall8904:ISDN, AUTHOR="C. Gallager", TITLE="Beyond {ISDN:} A {LAN} interface for integrated voice and data", JOURNAL="Telecommunications", VOLUME=23, NUMBER=4, PAGES="75-80", MONTH=apr, YEAR=1989, KEYWORDS="LAN; ISDN; standard; IEEE 802.9; voice/data integration", ABSTRACT="The emerging IEEE 802.9 standard will enable end users to access all types of services through a single interface.", } @INPROCEEDINGS{Lehn8904:Methods, AUTHOR="R. Lehnert", TITLE="Methods and tools for discrete-event digital simulation of communication networks", BOOKTITLE={ITG-Fachtagung"Stochastische Modelle und Methoden in der Informationstechnik"}, ADDRESS="Nürnberg", PAGES=6, MONTH=apr, YEAR=1989, REFERENCES=10, KEYWORDS="Simulation; switching system", ABSTRACT="This paper gives an overview of methods and techniques used to model the flow of messages in a communication network. The basicmechanisms to control the clock of a simulator are presented. The problem of simulating large networks with a big ratio of resolution in time of the processes modelled is stated. In a conventional simulation environment run on a general purpose computer this results in a big consumption of computing power.", } @INPROCEEDINGS{Lehn8904:Switching, AUTHOR="R. Lehnert", TITLE="Performance analysis of switching elements for {ATM} switches", BOOKTITLE={ITG-Fachtagung"Stochastische Modelle und Methoden in der Informationstechnik"}, ADDRESS="Nürnberg", PAGES=7, MONTH=apr, YEAR=1989, REFERENCES=6, KEYWORDS="ATM; performance evaluation; queueing system", ABSTRACT="In this paper an overview of architectures for switching elements which are currently under discussion e.g., in the RACE project 1022 is given. The architectures are compared with respect to the amount of buffer places needed, the cell loss probability and delay characteristics. Some first results are given for the influence of priority connections in a switching element.", } @INPROCEEDINGS{Newm8904:Fast, AUTHOR="P. Newman", TITLE="Fast packet switching for broadband {ISDN}", BOOKTITLE="IEE Conference on telecommunications networks", ADDRESS="London", PAGES="391-395", MONTH=apr, YEAR=1989, REFERENCES=35, KEYWORDS="ATM; survey; switching block", } @INPROCEEDINGS{Sche8904:Baseline, AUTHOR="R. Schehrer and T. Uhl", TITLE="Performance analysis of baseline interconnection networks", BOOKTITLE="ISDN in Europe, 25.-27", ADDRESS="The Hague", PAGES="T2-3", MONTH=apr, YEAR=1989, REFERENCES=10, KEYWORDS="ATM; switching block; Banyan network; delay; performance evaluation", } @INPROCEEDINGS{Scho8904:Mixed, AUTHOR="Frederik Carel Schoute", TITLE="Mixed traffic patterns and traffic capacity in {ISDN}", BOOKTITLE="ISDN in Europe", ADDRESS="The Hague", PAGES="T 2-1", MONTH=apr, YEAR=1989, REFERENCES=6, KEYWORDS="ATM; traffic model; traffic pattern", ABSTRACT="Three levels of resolution (time scales): Connection, action, transmission level; see ITC 12 paper", } @INPROCEEDINGS{Chen8904:Input, AUTHOR="Jinghu Chen and R. Guerin", TITLE="Input Queueing of an Internally Non-Blocking Packet Switch with Two Priority Classes", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="529-537", MONTH=apr, YEAR=1989, REFERENCES=25, KEYWORDS="Packet switching; priority; nonblocking; performance evaluation; integrated services; priority; packet voice; fast packet switch; performance evaluation", ABSTRACT="This paper analyzes an NxN non-blocking packet switch with two priority classes which can be used to support traffics with different requirements. Real time traffic such as voice is assigned high priority to satisfy its strict delay requirement while data traffic uses a lower priority and utilizes the remaining system capacity. The switch operation is slotted, and at each time packet slots arrivals at teh inputs have Bernoulli distributions with different probabilities for high and low priority classes. Packets of both priority classes can be queued when waiting for service and the service discipline is FCFS within each priority class. This is in contrast with [6] where only low priority packets are queued. The priority discipline is preemptive at both the inputs and outputs where high priority packets always prevail over low priority packets. The paper provides explicit expressions for blocking probabilities and average delays. It also studies system stability and shows that the maximum throughput can in fact be higher than with no priority.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Wu8904:Capacity, AUTHOR="G. Wu and J. W. Mark", TITLE="Capacity Allocation for Integrated Voice/Data Transmission at a Packet Switched {TDM}", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="429-438", MONTH=apr, YEAR=1989, REFERENCES=16, KEYWORDS="Packet switching; voice/data integration; bandwidth allocation; performance evaluation", ABSTRACT="The integrated transmission of voice and data at a time-division multiplexer (TDM) is discussed and analyzed. The system operates in a frame format and the channel capacity is governed by the frame size. The allocation of channel capacity for the transmission of voice and data is performed by a controller. Digital speech interpolation (DSI) and embedded coding techniques are used to enhance the transmission efficiency and to facilitate the implementation of multiplexing. Using a dynamic programming approach a capacity allocation policy, which jointly optimizes the voice/data performances, is introduced. Numerical results indicate that the aggregate throughput of the system can be improved with a slight degradation in voice quality.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Dell8904:Access, AUTHOR="F. D. Priscoli and M. Listanti and A. Roveri and A. Vernucci", TITLE="Access and switching techniques in an {ATM} user-oriented satellite system", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario", PAGES="632-640", MONTH=apr, YEAR=1989, REFERENCES=13, KEYWORDS="ATM; switching; access protocol; media access control; satellite radio", ABSTRACT="ATM techniques are at present under consideration for the evolu-tion of terrestrial networks towards broadband capabilities. In this paper ATM was examined in view of its potential utilizationin a user-oriented satellite system. This paper is based upon the work performed by the authors in the framework of an exploratory study, financed by the European Space Agency (ESA), which intended to ascertain the potential benefits of ATM in the", } @INPROCEEDINGS{Li8904:Study, AUTHOR="Song Li and M. J. Lee", TITLE="A Study of Traffic Imbalances in a Fast Packet Switch", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="538-547", MONTH=apr, YEAR=1989, REFERENCES=5, KEYWORDS="Packet switching; performance evaluation; analysis; switching system; input buffer; asymmetric load; transient analysis", ABSTRACT="This paper studies the performance of a non-blocking space division packet switch given that traffic are imbalanced at input and output. Analysis shows that the performance of packet queueing delay at switch input, as well as the entire throughput of the switch, can be adversely affected by such imbalances. The work is then extended to examine a transient imbalance case, where the switch experiences the alternation of two transient periods, each at a different traffic imbalance mode. The alternation is modeled by a two state Markov chain. Both balanced and imbalanced cases can be viewed as the two extremes of the transient case. We observe that the system throughput and the queueing performance in the transient case heavily depend on both mean sojourn time and steady state probability at each imbalance mode.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Sun8904:SFPS, AUTHOR="Yongli Sun and M. Gerla", TITLE="{SFPS:} A Synchronous Fast Packet Switching Architecture for Very High Speeds", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="641-646", MONTH=apr, YEAR=1989, REFERENCES=18, KEYWORDS="Hybrid switching; architecture; ATM; fast packet switching; circuit switching; optical switching", ABSTRACT="There are intrinsic limitations in the fast packet switch approach for broadband integrated services as networks evolve to very high speed (multi-gigabit rate) to accommodate applications like high-definition TV. In this paper, a new switching architecture Synchronous Fast Packet Switching (SFPS) is proposed where an optical space switch provides a circuit switching type transmission to applications with rigid delay requirement and continuous traffic pattern (e.g. video). Additionally, a fast packet switch fabric is connected to the space switch to handle packets of more conventional applications. The transmission scheme and the switch design are described.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Bovo8904:Load, AUTHOR="Andreas Bovopoulos and Aurel A. Lazar", TITLE="Load balancing algorithms for Jacksonian networks with acknowledgement delays", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="749-757 (7D.3)", MONTH=apr, YEAR=1989, REFERENCES=10, KEYWORDS="queueing network; analysis", ABSTRACT="Load balancing algorithms for Jacksonian networks are derived. The state of the network is represented by the total number of packets for which the source has not yet received an acknowledgement. The networks studies are subject to state independent routing and, state dependent and state independent flow control. The objective is to maximize the throughput of the network so that the end-to-end expected packet time delay does not exceed an upper bound. The optimal flow control is shown to be of a window type, while the routing policy balances the traffic inside the network. Several load balancing algorithms are evaluated.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Lee8904:Congestion, AUTHOR="K.-H. Lee and Y. Lim", TITLE="Performance Analysis of the Congestion Control Scheme in Signaling System No. 7", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="691-700 (7C.1)", MONTH=apr, YEAR=1989, REFERENCES=11, KEYWORDS="Signalling; common channel; CCS; performance evaluation", ABSTRACT="This paper analyzes the performance of the congestion control scheme in Signaling System No. 7 (SS7). Unlike many other congestion control schemes used in data networks, it uses a threshold control along with a choking mechanism. We develop two analytic models that we use to study the steady-state performance and the triggering behavior of the congestion control scheme. Both models are amenable to simple solution techniques. Numerical examples are provided that reveal the dynamics of the congestion control scheme with respect to various control parameters. From these results, we suggest a set of guidelines for the determination of the congestion control parameters to obtain a good performance of the signaling network.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Rits8904:British, AUTHOR="D. Ritson and T. Johnson", TITLE="British Telecom {CCITT} No. 7 common channel signalling: Past, present and future", BOOKTITLE="2nd IEE National Conference on Telecommunications", PAGES="21-26", MONTH=apr, YEAR=1989, KEYWORDS="Signalling; common channel; CCS", } @TECHREPORT{Ande8904:Implications, AUTHOR="Thomas Anderson", TITLE="The Performance Implications of Spin-Waiting Alternatives for Shared-Memory Multiprocessors", INSTITUTION="University of Washington, Seattle", NUMBER="89-04-03", MONTH=apr, YEAR=1989, } @ARTICLE{Brus8904:Unified, AUTHOR="Paul Brusil and D. Stokesberry", TITLE="Toward a Unified Theory of Managing Large Networks", JOURNAL=ieeespec, VOLUME=26, NUMBER=4, PAGES="39-42", MONTH=apr, YEAR=1989, } @TECHREPORT{Case8904:Simple, AUTHOR="J. D. Case and J. R. Davin and M. S. Fedor and M. L. Schoffstall", TITLE="A Simple Network Management Protocol", TYPE="RFC -", INSTITUTION="Network Information Center, SRI International", NUMBER=1098, MONTH=apr, YEAR=1989, } @INPROCEEDINGS{Cohn8904:Architecture, AUTHOR="R. Cohn and others", TITLE="Architecture and Compiler Tradeoffs for a Long Instruction Word Microporcessor", BOOKTITLE="3rd International Conference on ASPLOS III", MONTH=apr, YEAR=1989, } @ARTICLE{Fren8904:Volume, AUTHOR="K. A. Frenkel", TITLE="Volume Rendering", JOURNAL=cacm, VOLUME=32, NUMBER=4, PAGES="426-435", MONTH=apr, YEAR=1989, } @ARTICLE{Gong8904:Security, AUTHOR="L. Gong", TITLE="On Security in Capability-Based Systems", JOURNAL=acmosrev, VOLUME=23, NUMBER=2, PAGES="56-60", MONTH=apr, YEAR=1989, } @ARTICLE{Haes8904:Management, AUTHOR="D. G. Haeschke and D. A. Kettler", TITLE="Network Management and Congestion in the {U.S.} Telecommunications Network", JOURNAL=ieeecom, VOLUME="COM-29", NUMBER=4, PAGES="376-385", MONTH=apr, YEAR=1989, } @TECHREPORT{Levy8904:Modules, AUTHOR="H. M. Levy and others", TITLE="On the Non-Duality of Modules and Objects for Distributed Programming", INSTITUTION="University of Washington, Seattle", NUMBER="89-04-04", MONTH=apr, YEAR=1989, } @ARTICLE{Loep8904:Covert, AUTHOR="K. Loepere", TITLE="The Covert Channel Limiter Revisited", JOURNAL=acmosrev, VOLUME=23, NUMBER=2, PAGES="39-44", MONTH=apr, YEAR=1989, } @TECHREPORT{Neum8904:Virtual, AUTHOR="B. Clifford Neuman", TITLE="The Virtual System Model for Large Distributed Operating Systems", INSTITUTION="University of Washington, Seattle", NUMBER="89-01-07", MONTH=apr, YEAR=1989, } @ARTICLE{Peac8904:Deadlock, AUTHOR="J. K. Peacock", TITLE="Deadlock Avoidance in Loosely-Coupled Multiprocessors with Finite Buffer Pools", JOURNAL=acmosrev, VOLUME=23, NUMBER=2, PAGES="20-24", MONTH=apr, YEAR=1989, } @ARTICLE{RenJ8904:Effect, AUTHOR="J. F. Ren and Yutaka Takahashi and Toshiharu Hasegawa", TITLE="An Analysis of the Effect of Multiversions on the Performance of Timestamp Algorithms", JOURNAL=ieeejsac, VOLUME=7, NUMBER=3, PAGES="354-363", MONTH=apr, YEAR=1989, } @INPROCEEDINGS{Lian8904:Gateway, AUTHOR="Song-Chyau Liang and James Yee", TITLE="A Gateway Allocation Algorithm for Interconnecting Existing Data Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="468-473", MONTH=apr, YEAR=1989, REFERENCES=12, ABSTRACT="This paper considers the problem of interconnecting two virtual circuit networks. More specifically, the problem is to determine (i) which nodes (one from each network) should be connected by gateways and (ii) the routing assignments to minimize the routing costs subject to a limitation on the cost of the gateways. This problem is NP-hard. We formulate the problem as a linear combinatorial optimization problem. We propose a two phase algorithm to obtain good solutions. The first phase is a greedy heuristic algorithm. The second phase is an algorithm based upon Lagrangian relaxation with the subgradient method. This method has been implemented. In our computational experiments, the method determines gateway locations to interconnect networks (of various sizes) that are within a few percent of an optimal solution in a few minutes of CPU time.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Lin8904:Distributed, AUTHOR="Y. Lin and James Yee", TITLE="A distributed routing algorithm for virtual circuit data networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario Canada", PAGES="200-207", MONTH=apr, YEAR=1989, REFERENCES=29, ABSTRACT="In this paper, the routing problem in virtual circuit networks is considered. In virtual circuit networks, all of the packets in a session are transmitted over exactly one path established between the origin and the destination. We consider the problem of choosing a path for each origin-destination pair so as to minimize the average number of packets in the network. We consider the usual formation of this problem as a nonlinear multicommodity flow problem with integer decision variables. The emphasis of this work is to develop a distributed algorithm to solve this optimization problem. The basic approach in this work is Lagrangean Relaxation which has been a common and successful technique in solving many difficult combinatorial optimization problems. We develop a multiplier update technique which facilitates the solution of the nonlinear integer programming problem using distributed computation. In computational experiments, our distributed algorithm determines solutions that are within 1\% of an optimal solution in minutes of CPU time for networks with 26 to 61 nodes.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Maxe8904:Comparison, AUTHOR="N. F. Maxemchuk", TITLE="Comparison of Deflection and Store-and-Forward Techniques in the Manhattan Street and Shuffle-Exchange Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="800-809", MONTH=apr, YEAR=1989, REFERENCES=10, ABSTRACT="The Manhattan Street Network (MS-Net) and Shuffle-Exchange Network (SX-Net) are two-connected networks with significantly different topologies. Fixed size packets are transmitted between nodes in these networks. The nodes are synchronized so that all of the packets that are received by a node within a slot transmission time arrive at a switching point simultaneously. Instead of storing large numbers of packets at intermediate nodes, a deflection strategy, similar to hot-potato routing, is used. There are characteristics of the MS-Net that make it well suited for deflection routing. With no buffers, 55-70\% of the throughput with an infinite number of buffers has been obtained, and with a single buffer per node, the throughput increases to 80-90\%. It is also noted that, with uniform load, the throughput does not decrease significantly as the network utilization increases. Therefore, additional flow control mechanisms are not required to achieve the highest network throughput. The SX-Net does not have the characteristics of the MS-Net. However, deflection routing still provides a significant portion of the available throughput. In the SX-Net, more buffers are required than in the MS-Net and a flow control mechanism must be used to achieve the greatest throughput.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Pang8904:Generalized, AUTHOR="Joseph Pang and F. A. Tobagi", TITLE="Generalized Access Control Strategies for Token Passing Systems", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="332-341", MONTH=apr, YEAR=1989, REFERENCES=9, ABSTRACT="Recently, a timer based integrated access protocol has been adopted by two major token passing local area network standards, the IEEE 802.4 Token Bus Standard [1] and the Fiber Distributed Data Interface (FDDI) Standard [2]. In this paper, we present a generalization of the above timer based protocol. While retaining all the favorable properties of the original timer based protocol and providing much higher flexibility, this new class of protocols is particularly designed to avoid undesirable oscillatory behaviour at high load. We show that, under heavy traffic, the station service times of the token system employing the new class of protocols converge. We also derive tight upper bounds on token cycles under arbitrary loading conditions. This study not only enriches the design space of integrated services token systems, but also provides meaningful insights into the dynamics inherent in the protocol.", URL="http://www.comsoc.org/confs/infocom/", } @MISC{Kirs8904:Mail, AUTHOR="P. T. Kirstein and S. E. Kille", TITLE="Mail Converting Relaying Functions in the {CCIRN} Community Operating in April 1989].", MONTH=apr, YEAR=1989, } @INPROCEEDINGS{Aron8904:VOX, AUTHOR="B. Arons and Carl Binding and K. A. Lantz and Chris Schmandt", TITLE="The {VOX} audio server", BOOKTITLE="Multimedia 2nd IEEE COMSOC International Multimedia Communications Workshop", ADDRESS="Ottawa, Ontario", MONTH=apr, YEAR=1989, KEYWORDS="multimedia; audio; audio server; window system", ABSTRACT="In the recent past, user interfaces have vastly improved due to the widespread availability of high-resolution graphics displays. It is now a new challenge to incorporate other media into the user interface. We strongly believe that audio and video will be a key component of next-generation interfaces. Towards this end, we are developing an audio server that supports the integration of voice and audio features into the user interface. Application areas in which we are particularly interested include telephone management, voice annotation, real-time teleconferencing, conversational answering machines, and more generally, computer-based tools to support collaborative work. The intent of the VOX audio server is to accomplish for audio what current state-of-the-art window servers (such as the X Window System) have done for graphics. VOX provides integrated access to and control of audio, voice, and telephony capabilities. It provides for the dynamic configuration of audio devices and their sharing between multiple client applications. We also believe that the server architecture can be extended to support other media, particularly video.", } @TECHREPORT{Tayl8904:Role, AUTHOR="Kimberly E. Taylor", TITLE="The Role of Inhibition in Asynchronous Consistent-Cut Protocols", INSTITUTION="Cornell University, Computer Science Department", NUMBER="TR89-995", PAGES=19, MONTH=apr, YEAR=1989, ABSTRACT="We present results relevant to the development of consistent-cut protocols. Consistent-cut protocols are those which are based on finding a consistent global state in an underlying distributed computation; they are used for a variety of applications such as system checkpointing and deadlock detection. We formally define what it means for a protocol to be non-inhibitory, which intuitively means that it does not prevent any actions from occurring in an underlying system computation. We prove that there is no non-inhibitory consistent-cut protocols for FIFO systems of one message per bidirectional channel (up to $\frac {1}{2} (n^{2} - n$, for completely connected networks). We present two protocols, one non-inhibitory requiring up to two messages between each pair of neighboring nodes in a network and the other inhibitory and requiring only $3(n - 1)$ messages total. In most networks, these results illustrate a tradeoff between the amount of necessary communication and the willingness to inhibit actions of the underlying system. Additionally, our inhibitory protocol also works for non-FIFO systems, thus illustrating that the inhibitory condition is exactly what is required to develop consistent-cut protocols for non-FIFO systems which satisfy our model.", } @ARTICLE{Plum8904:IEN, AUTHOR="William W. Plummer", TITLE="{IEN-45:} {TCP} Checksum Function Design", JOURNAL=ccr, VOLUME=19, NUMBER=2, MONTH=apr, YEAR=1989, } @INPROCEEDINGS{Egge8904:Effect, AUTHOR="S. J. Eggers and Randy H. Katz", TITLE="The Effect of Sharing on the Cache and Bus Performance of Parallel Programs", BOOKTITLE=asplos, PAGES="257-270", MONTH=apr, YEAR=1989, } @INPROCEEDINGS{Webe8904:Cache, AUTHOR="Wolf-Dietrich Weber and A. Gupta", TITLE="Analysis of Cache Invalidation Patterns in Multiprocessors", BOOKTITLE=asplos, PAGES="243-256", MONTH=apr, YEAR=1989, } @ARTICLE{Sidh8904:Formal, AUTHOR="Deepinder Sidhu and T. Leung", TITLE="Formal Methods for Protocol Testing: A Detailed Study", JOURNAL=ieeese, VOLUME=15, NUMBER=4, PAGES="413-426", MONTH=apr, YEAR=1989, } @TECHREPORT{Schr8904:Program, AUTHOR="H. Schröder and P. Strazdins", TITLE="Program Compression on the Instruction Systolic Array", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-89-21", MONTH=apr, YEAR=1989, } @TECHREPORT{zur8904:Tests, AUTHOR="Joachim von zur", TITLE="Tests and Algorithms for permutation polynomials", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-89-08", MONTH=apr, YEAR=1989, } @TECHREPORT{Lend8904:Unification, AUTHOR="P. Lenders", TITLE="Unification of {IF} and {DO} Statements in {GC}", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-89-07", MONTH=apr, YEAR=1989, } @TECHREPORT{Bere8904:Search, AUTHOR="B. Beresford-Smith and J. Breckling and B. Millar and H. Schröder", TITLE="Search Algorithms for Isolated Word Recognition", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-89-06", MONTH=apr, YEAR=1989, } @TECHREPORT{Kris8904:Systolic, AUTHOR="E. V. Krishnamurthy and M. Kunde and M. Schimmler and H. Schröder", TITLE="Systolic Computation of Tensor Products", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-89-05", MONTH=apr, YEAR=1989, } @TECHREPORT{Lend8904:Semantics, AUTHOR="P. Lenders and H. Schröder", TITLE="A Semantics for Instruction Systolic Arrays", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-89-04", MONTH=apr, YEAR=1989, } @TECHREPORT{Lend8904:Programmable, AUTHOR="P. Lenders and H. Schröder", TITLE="A Programmable Special Purpose Device for Mathematical Morphology", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-89-03", MONTH=apr, YEAR=1989, } @TECHREPORT{Bere8904:Fault, AUTHOR="B. Beresford-Smith and H. Schröder", TITLE="Fault tolerance in Hypercube", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-89-02", MONTH=apr, YEAR=1989, } @ARTICLE{Lars8904:Digital, AUTHOR="Tony Larsson", TITLE="Digital Mobile networks and {ISDN}", JOURNAL="ISDN in Europe", ADDRESS="The Hague, Netherlands", PAGES="137-143", MONTH=apr, YEAR=1989, KEYWORDS="Isdn", } @INPROCEEDINGS{Akyi8904:Application, AUTHOR="Ian Akyildiz and J. Liebeherr", TITLE="Application of Norton's Theorem on Queueing Networks with Finite Capacities", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="914-923", MONTH=apr, YEAR=1989, REFERENCES=25, KEYWORDS="queueing networks; loss system; parametric analysis; performance evaluation; blocking; throughput", ABSTRACT="The application of Norton's theorem from electrical circuit theory on queueing networks with infinite capacities is well-known and very useful for cases where a node of the network should be analyzed under different workload. In this work a method is developed which allows the application of Norton's theorem on queueing networks with finite capacities. A node is arbitrarily selected and the subnetwork containing all remaining nodes are replaced by a composite node with infinite capacity. The entire network is reduced to a two-node network having the node of interest and the composite node. Although blocking causes interdependencies between nodes in the network the selected node is totally isolated from the rest of the network by constructing phases in the server which reflect the blocking events. An algorithm is given to compute the parameters of the phases. Several examples are discussed to demonstrate the efficiency and generality of the technique. Comparisons with simulation results show that the proposed technique provides accurate results for throughput values.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Behr8904:Delay, AUTHOR="Amir B. Behroozi-Toosi and R. R. Rao", TITLE="Delay Analysis of an Asymmmetric, Buffered Random Access System", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="558-563", MONTH=apr, YEAR=1989, REFERENCES=8, KEYWORDS="delay analysis; random multiple access; asymmetric load; burstiness", ABSTRACT="In this paper we study a random multiple access system with a finite population of buffered, asymmetric users. We find an upper bound to the mean total delay experienced by a user, including the queueing delay. Our analysis facilitates an understanding of the interrelationship among delay, burstiness, the degree of asymmetry and the number of users.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Besh8904:Poissonian, AUTHOR="M. E. Beshai", TITLE="The Poissonian-Spectrum Method for Treating a Loss System Serving Non-Poissonian Multi-Bit-Rate Traffic", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1010-1019", MONTH=apr, YEAR=1989, REFERENCES=8, KEYWORDS="performance evaluation; loss system; spectral analysis", ABSTRACT="This paper present a two-component simplification of the powerful Poissonian-spectrum method of analysing a loss systems serving a mixture of non-Poissonian multi-bit-rate traffic streams. The spectrum concept is implicit in Delbrouck's recursions for homogeneous and heterogeneous traffic and has its roots in Hayward's rather simplistic, yet accurate, method of treating homogeneous peaked traffic. The Poissonian-spectrum representation is not unique. To determine the sensitivity of the method to the spectrum shape, we study three distinctly different representations. With appropriate selection of the spectrum shape, the method reduces to simple recursions. We use a layman's approach to derive these recursions as a natural extension of the Roberts-Kaufman recursion. The case of smooth traffic requires careful considerations, which are discussed in the paper.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Bets8904:Configuration, AUTHOR="J. Betser and A. Avritzer and J. W. Carlyle and W. J. Karplus", TITLE="Configuration Synthesis for a Heterogenous Backbone Cluster and a {PC-Interface} Network", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario,Canada", PAGES="400-407", MONTH=apr, YEAR=1989, REFERENCES=25, KEYWORDS="Backbone network; network design; modeling; capacity assignment", ABSTRACT="In this paper we address the design of Locus [PopeWalk85] family networks rendering PCI service. Given are the expected user workload, the hardware costs and the performance constraints. The workload consists of three classes of users: Interactive, High-Interactive, and Communication Intensive. The number of PC's is given and is equal to the number of users. We show that the problem can be reduced to a discrete Capacity and Flow Assignment (CFA) problem. The backbone capacity assignment is inspired by the Lagrangian Decomposition Approach [Fox66]. It starts from a backbone capacity assignment which matches the initial flow and chooses a backbone server upgrade that gives the greatest response time reduction per Dollar. At this point we apply the flow deviation method and iterate until the constraints are met. We present several computational examples of network configuration synthesis, that emphasize the significance and generality of the results obtained.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Chin8904:Integrated, AUTHOR="K. S. Ching and Hwang-Soo Lee", TITLE="Integrated Voice and Data Transmission in Packet Radio Network", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="420-428", MONTH=apr, YEAR=1989, REFERENCES=7, KEYWORDS="Voice/Data Integration; Packet Radio; simulation; protocol; TDMA; CSMA", ABSTRACT="A multiaccess scheme, which is a variation of movable slot TDM and p-persistent CSMA, proposed for voice only or integrated voice and data transmission in a packet radio network. Simulations are performed in order to examine the performance characteristics of the proposed scheme under various system parameter values.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Choi8904:Data, AUTHOR="S. Choi and H. S. Park and H. G. Bahk and Young-Keun Park and C. Kim", TITLE="Implementation of Data Capability in {TDX-1A} System", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="408-414", MONTH=apr, YEAR=1989, REFERENCES=5, KEYWORDS="Circuit Switching; ISDN; Network Design; Switching System", ABSTRACT="The Circuit Switched Digital Capability (CSDC) is expected to play a major role in the evolution of the old telephone network to the ISDN. This paper describes the implementation method of the CSDC in the TDX-1A system with a brief introduction of the TDX-1A system.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Cies8904:Programmable, AUTHOR="R. Cieslak and A. Fawaz and Sonia R. Sachs and P. Varaiya and J. Walrand and A. Li", TITLE="The Programmable Network Prototyping System", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="393-399", MONTH=apr, YEAR=1989, REFERENCES=21, KEYWORDS="Network Planning; Design; Protocol Implementation; Hardware", ABSTRACT="The Programmable Network Prototyping System (PNPS) is a rapid-prototyping tool used for emulating a wide variety of communication networks. Such a facility allows one to implement a suite of protocols in a given environment and examine the effects of parameter changes on performance, thereby tuning the protocol. There are two parts to the PNPS hardware; the reusable hardware modules and the control and observation system. The reusable hardware modules consist of a channel emulator and a collection of node emulators. The channel emulator can be programmed to behave like a variety of network topologies, and each node emulator is configured to behave like a node on a network under study. The control and observation system links these modules together for configuration, experimentation, and monitoring purposes. there are three phases to using PNPS. First, the various components of a proposed network are designed. Next, the components are combined and run on the hardware while its behavior is monitored. Finally, the monitoring data is analyzed in order to evaluate the network design. A menu-driven user interface guides the user through the various tools of the system.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Dill8904:Adaptive, AUTHOR="J. C. Dill and J. A. Silvester", TITLE="Adaptive Algorithms for Improving the Throughput of {CDMA} Packet Radio Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1078-1083", MONTH=apr, YEAR=1989, REFERENCES=6, KEYWORDS="CDMA; packet radio; network; throughput performance; adaptive routing; delay throughput characteristics", ABSTRACT="In this paper we present two adaptive techniques, involving selection and channel access, which significantly improve the throughput and delay performance of a multihop, receiver directed CDMA packet radio network. Routing is accomplished by choosing among potential next nodes in a distributed fashion, based on the simple metric of queue length. Additionally, de facto preference is given to congested nodes by the channel access protocol, based on queue length ratios, in order to increase their (outbound) throughput, without increasing the number of channel collisions. These algorithms have the effect of spreading network traffic more evenly across the network, thereby alleviating the congestion at bottleneck nodes, so that network throughput approaches that analytically predicted using a homogeneity assumption. Simulation results are presented which quantify the achieved improvement for networks with varying connectivity fractions.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Dimi8904:Routing, AUTHOR="Dragomir D. Dimitrijevic and B. Maglaris and R. R. Boorstyn", TITLE="Routing in Multiple Domain Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1047-1056", MONTH=apr, YEAR=1989, REFERENCES=4, KEYWORDS="distributed routing; decentralized control; network design; delay analysis", ABSTRACT="We investigate routing in packet switched networks that consist of two individually controlled domains. Each domain controller determines a static routing plan for requirements that are contained within its domain and for requirements that are addressed to nodes in the other domain. We propose two routing algorithms assuming that each controller has limited information on the configuration of the other domain. Numerical examples are provided that compare the delay performance of such algorithms with the optimal routing of a centralized scheme that has full information and control over both domains. Implication of distributed control on network design are explored.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Geor8904:Window, AUTHOR="L. Georgiadis and M. Paterakis", TITLE="Performance Analysis of Window Type Random-Access Algorithms for Packet Radio Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="505-511", MONTH=apr, YEAR=1989, REFERENCES=8, KEYWORDS="packet radio; random access; performance evaluation; delay distribution", ABSTRACT="A method for delay distribution analysis of Window Random-Access algorithms is presented. The window size is allowed to vary during the operation of the algorithm. It is shown that the quantities of interest can be related to the solution of appropriate infinite systems of linear equations. Once the constants and the coefficients of the unknowns of a system are determined, bounds on the solution can be developed by applying previously developed methodologies. The method is applied to the delay distribution analysis of the Capetanakis's Window Random-Access algorithm and the Part-and-Try algorithm, both under binary C-NC feedback.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Haye8904:Blocking, AUTHOR="J. F. Hayes and Georglos Stamatelos", TITLE="Blocking in an {ISDN} Switch", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1003-1009", MONTH=apr, YEAR=1989, REFERENCES=4, KEYWORDS="Broadband; B-ISDN; switching; blocking; performance evaluation", ABSTRACT="The context of the problem is broadband optical networks which carry a wide range of traffic classes in an integrated fashion. The focus is upon so called stream traffic in which each class is allocated different quantities of bandwidth for the duration of a call. An exact analysis of the blocking conditions experienced by different classes of traffic demanding transmission through an N1 x N0 switch is presented. No particular structure is assumed for the switch besides its capability of resolving output port contention by rearranging the input traffic. The present work is considered a two-dimensional generalization of an analysis for a single trunk. Its efficiency lies on the linearity of the necessary computations, thus the relative independence from the dimensionality of the switch.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Lee8904:Efficient, AUTHOR="M. J. Lee and James Yee", TITLE="An Efficient Near-Optimal Algorithm for the Joint Traffic and Trunk Routing Problem in Self-Planning Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="127-135", MONTH=apr, YEAR=1989, REFERENCES=15, KEYWORDS="Circuit switching; dynamic routing; flow control; network topology; network capacity", ABSTRACT="A self-planning network is a circuit-switched network where the effective topology and capacities can be dynamically changed according to the traffic conditions. The joint problem of determining the best configuration and routing assignment is a fundamental problem in teh design of a self-planning network. In this paper, we first formulate the configuration and routing problem (or the joint trunk and traffic routing problem) as a mixed integer nonlinear minimization problem. Then we prove certain properties about the problem structure. These properties lead to an efficient algorithm that determines near-optimal configurations and routing assignments. We also compute a lower bound in order to evaluate the quality of the solution. The algorithm was coded and tested on several networks. Our computational experiments clearly show that the performance of a self-planning network is always better than the same network without the trunk routing capability. The reduction in average packet delay is as much as 67\%.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Levy8904:Polling, AUTHOR="H. M. Levy and M. Sidi", TITLE="Polling systems with correlated arrivals", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="907-913", MONTH=apr, YEAR=1989, REFERENCES=27, KEYWORDS="Polling system; cyclic service; performance evaluation; exhaustive service; gated service; conservation law", ABSTRACT="In this paper we analyze polling systems with correlated arrivals, namely, the arrival processes of customers to the queues are not assumed to be independent. We consider cyclic polling systems with N queues, general service time distribution in each queue and general switch-over times. For both the exhaustive and the gated service disciplines we derive the necessary equations for computing the N expected waiting time figures. A ``pseudo'' conservation law for these systems is also derived. The analysis approach can be applied to other polling systems with correlated arrivals.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Lin8904:Switch, AUTHOR="T.-P. Lin", TITLE="Switch Access Architecture for Quad Voice Lines with Data On-Demand Per {ISDN} {BRI}", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="647-684", MONTH=apr, YEAR=1989, REFERENCES=10, KEYWORDS="ISDN; access protocol; architecture; Q.931; signalling protocol", ABSTRACT={A single international standard Integrated Services Digital Network (ISDN), Basic Rate Interface (BRI) is arranged so that either a data terminal and two voice terminals, three voice terminals, or four voice terminals can be operated simultaneously through the interface. This paper introduces the switch access architecture for "quad voice lines with data on-demand per ISDN BRI". Various technical topics are discussed: the proposed switch access architecture, BRI S/T interface Bit Framing requirement, and Q.931 call control procedures required for the new service. The study results show that relatively simple additional hardware could be used to upgrade an existing ISDN 5ESS switch to quad voice lines with data capability per BRI.}, URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Okad8904:Considerations, AUTHOR="H. Okada and S. Saekol and Y. Tezuka", TITLE="Performance Considerations on Resolvable-Contention-Ring Networks for Fiber Optic {LANs}", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1029-1037", MONTH=apr, YEAR=1989, REFERENCES=10, KEYWORDS="optical LAN; ring network; performance evaluation", ABSTRACT="Resolvable-Contention-ring or simply ReC-ring bases on the control protocol of Contention-ring and have an effective collision resolution mechanism in addition. This mechanism reuses the control information for the normal collision detection of Contention-ring and requires no substantial software and/or hardware overhead. ReC-ring covers the whole advantages of Contention-ring and solves its inherent problem, unestimable frame delay, without any loss on protocol simplicity. The objectives of this paper are 1) to show the performance advantages of ReC-ring in comparison with typical ring control methods like IEEE 802.5 Token ring, ANSI FDDI I Token-ring, Slotted-ring and Contention-ring, numerically, and 2) to consider the possibility and its validity of priority mechanism of ReC-ring for multi-media high speed communication networks.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Rama8904:Integration, AUTHOR="G. Ramamurthy and R. S. Dighe", TITLE="Integration of High Speed Continuous Stream Data Traffic in a Broadband Packet Network", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1063-1071", MONTH=apr, YEAR=1989, REFERENCES=9, KEYWORDS="network design; network optimization; voice/data integration; broadband; high speed; distributed control; flow control", ABSTRACT="Integration of voice and data into an unified network has a lot of economic appeal. To optimize the performance of such an integrated network, a clear understanding of their widely differing traffic characteristics and service needs is necessary. With the advent of high speed networks, there has been a tendency to simplify flow/congestion control functions at lower levels (of the OSI model) and relegate them to higher levels. This study shows that a class of traffic, namely host-to-host file transfers can experience severe degradation in performance due to lack of proper control in such networks. A simple distributed rate-based flow control scheme is proposed which solves the problem, without affecting the performance of the network. The scheme is easily implemented, the control is totally distributed and managed by the sources. The rate is negotiated at call setup time and entails very little overhead. A detailed simulation model is built to quantify the problems and verify the solution.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Ravi8904:Integrated, AUTHOR="C. R. Raviraj and E. V. Jones", TITLE="An Integrated Services Local Area Network with Hybrid Access", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="439-447", MONTH=apr, YEAR=1989, REFERENCES=15, KEYWORDS="LAN; broadcast; bus; hybrid; access protocol; CSMA/CD; voice/data integration; TDMA", ABSTRACT="This paper proposes a broadcast bus type integrated services local area network with hybrid access. The proposed media access protocol: Slot Reservation - CSMA/CD uses an adaptive speech coding technique to provide a TDMA like service to voice stations and a CSMA/CD type service to data stations. Hence contention between voice stations is totally avoided. Furthermore contention between voice and data stations is kept to a very low level.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Sant8904:Standard, AUTHOR="Jr. Santos and J. Orozco and O. Alimenti", TITLE="Performance Evaluation of Standard {LAN} Protocols in Time-Constrained Environments", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1020-1028", MONTH=apr, YEAR=1989, REFERENCES=13, KEYWORDS="performance evaluation; LAN; protocol performance; time constrained communication; token bus; IEEE 802.4; token ring; IEEE 802.5; CSMA/CD; IEEE 802.3", ABSTRACT="A comparative evaluation of standard local area networks operating in time-constrained environments is performed. The analyzed protocols are Token Bus (IEEE 802.4), Token Ring (IEEE 802.5), and a modified version of CSMA/CD (IEEE 802.3); the priority disciplines necessary to make the system crisis-free are discussed in connection with the relationships between the slot-time, the number of nodes in the network and their crisis-times. In each case, the efficiency and the production of the system (in Mb/s) as functions of the length of the data field are determined.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Sous8904:Channel, AUTHOR="Elvino S. Sousa", TITLE="On Channel Power Sensing in Terrestrial Spread Spectrum Packet Radio Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1072-1077", MONTH=apr, YEAR=1989, REFERENCES=10, KEYWORDS="packet radio; spread spectrum", ABSTRACT="In this paper we consider the possibility of obtaining performance gains by employing channel power sensing in the channel access protocol of a terrestrial spread spectrum packet radio network as a generalization of the CSMA protocol of narrow band networks. Channel load sensing is viewed as a method of estimating the interference at the receiver based on the interference measured at the transmitter. To do this a bivariate probability distribution function of the interference at the two locations is required. This distribution function is difficult to obtain analytically. We give simulation results for the case of a random network.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Suda8904:Study, AUTHOR="T. Suda and K. Goto", TITLE="Performance Study of a Tree {LAN} with Collision Avoidance", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="59-68", MONTH=apr, YEAR=1989, REFERENCES=9, KEYWORDS="Random access; LAN; tree network; collision avoidance; performance evaluation; approximation; star network; protocol", ABSTRACT="Packet collisions and their resolution create a performance bottleneck in random access LANs. A hardware solution to this problem is to use a collision avoidance switch. This switch allows the implementation of random access protocols without the penalty of collision among packets. In this paper, we first present a design of a broadcast start network that uses a collision avoidance switch. This network combines the benefits of random access (low delay when traffic is light; simple, distributed and therefore robust protocols) with excellent network utilization. We then present performance analyses of a slotted broadcast star network to obtain distributions of the transmission delay: an exact analyses for a network with infinite number of stations, and an approximate analysis for a network with a finite number of stations.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Tan8904:New, AUTHOR="H. H. Tan and T.-Y. Yan", TITLE="A New Free-Access Collision Resolution Algorithm Based Connection Request Procedure for Land Mobile Satellite Systems", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1057-1062", MONTH=apr, YEAR=1989, REFERENCES=19, KEYWORDS="mobile radio; satellite radio; collision resolution; access protocol; delay throughput characteristics; comparison; slotted ALOHA", ABSTRACT="This paper describes a new connection request procedure for the Land Mobile Satellite System (LMSS). The procedure is based on a binary-feedback free-access collision resolution algorithm (CRA) operating over a number of parallel channels. This protocol is shown to achieve a much higher stable throughput than the previously recommended modified slotted ALOHA protocol for making connection requests. The complexity involved in implementing such a protocol is inherently low. Furthermore, this protocol is superior to other multiple-channel obvious blocked-access CRA protocols. By interleaving the time slots among individual channels, it can be applied to multiple-channel land mobile satellite type systems. Simulation results are obtained that demonstrate stable performance up to capacity. Moreover, the delay throughput characteristic is extremely flat over a wide range of traffic input rates.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Tipp8904:Modeling, AUTHOR="D. Tipper and M. Sundareshan", TITLE="Modeling of Computer Networks for Performance Evaluation and Control Under Nonstationary Conditions", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="924-933", MONTH=apr, YEAR=1989, REFERENCES=31, KEYWORDS="computer network; modeling; performance evaluation; instationary process", ABSTRACT="The majority of the available techniques for modeling computer networks in order to conduct studies of performance evaluation or the design of network control strategies are developed under simplifying approximations of steady-state conditions. In this paper, three distinct approaches for modeling computer networks under nonstationary conditions are presented. The first approach employs a queueing theoretic formulation to develop numerical techniques for determining the nonstationary queue dynamics and for estimating the settling time for the queue. In the second approach, use of discrete event simulation techniques for the evaluation of network performance during nonstationary periods is described. The third approach develops a nonlinear state model for representing the dynamics of the packet queues at the various transmission links of the network and establishes a framework for formulating optimal control problems for designing routing and flow control strategies that ensure optimal network performance under both transient and steady-state conditions.", } @INPROCEEDINGS{Varm8904:Reduction, AUTHOR="A. Varma and Suresh Chalasani", TITLE="Reduction of Crosspoints in One-Sided Crosspoint Switching Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="943-952", MONTH=apr, YEAR=1989, REFERENCES=8, KEYWORDS="switching methodology; switching network; implementation", ABSTRACT="In this paper, we establish upper and lower bounds for the number of crosspoints required in a one-sided crosspoint switching network to provide a given level of connectivity. Two modes of operation are considered, namely nonblocking and rearrangeable. A complete nonblocking switch matrix with N ports has (N^2)/2 crosspoints. We show that this number can be reduced by at most N/2 - 1 crosspoints for nonblocking operation. If rearrangeable operation is allowed, however, as many as 25\% of the crosspoints can be removed. We analyze the relationship between the number of crosspoints removed and the maximum number of rearrangements of connections needed. We also introduce algorithms for rearrangement of connections in both single-chip and partitioned implementations with reduced number of crosspoints.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Wang8904:Asymptotic, AUTHOR="Weihong Wang and E. Pinsky", TITLE="An Asymptotic Analysis of Complete Sharing Policy", BOOKTITLE=infocom, ADDRESS="Ottawa, Ont., Canada", PAGES="1038-1046", MONTH=apr, YEAR=1989, REFERENCES=16, KEYWORDS="multiserver; shared resource; arrival process; poisson process; blocking; probability; asymptotic analysis", ABSTRACT="In this paper we consider a model with several classes of customers arriving in independent Poisson processes at a multi-server facility and requiring a specified number of servers for a random period of time (arbitrarily distributed with a finite mean). If these servers cannot be provided, the customers are cleared. The problem is to determine the blocking probabilities. The exact expression is available but is complicated. We will apply a new approximation method of ensemble averaging for the asymptotic analysis of blocking in such systems. The new method gives simple expressions for the average performance measures without an explicit computation of the normalization constant of the steady-state probability distribution. The computation of blocking probability and of other performance measures is reduced to computing a root of a simple algebraic equation. The obtained expressions are shown to be asymptotically correct.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Zhu8904:Synthetic, AUTHOR="Zesheng Zhu", TITLE="Synthetic Design Method of the Computer Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="415-419", MONTH=apr, YEAR=1989, REFERENCES=14, KEYWORDS="Network design; modeling; simulation", ABSTRACT="This paper focusses on the synthetic design method of computer networks. The method consists of the computer network structure design and protocol design which are implemented by modelling and simulation. The software modules and real examples concerning the method are also discussed. At present, all the software modules have been run successfully on the IBM PC/AT.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Wu8904:Reliable, AUTHOR="Jean-Lien C. Wu and Jean-Lien C. Wu and Tien-Yu Huang", TITLE="A reliable token-passing bus {LAN} with reservation", BOOKTITLE=infocom, ADDRESS="Ottwa, Ontario, Canada", PAGES="1-8", MONTH=apr, YEAR=1989, REFERENCES=12, KEYWORDS="token-passing; reservation queue; dual-bus; reverse token; forward token", ABSTRACT="The major advantage of token-passing-bus LAN is it’s collision-free characteristic but its drawback is the overhead in passing the token to idle users when the channel load is light. It is commonly known that the system performance can be increased considerably by increasing the capacity of the bus. One way of increasing the bus capacity, and also the system reliability, is to increase the number of buses. In this paper, we propose adding a second bus to provide high bandwidth as well as reliable service for token-passing-bus LANs. The second bus proposed here normally is used for reservation so that the token on the data bus is dynamically passed to ready users for packet transmission. Furthermore, it will take the place of the data bus when the data bus fails. The protocol discussed here is a reservation token-passing protocol, which not only is collision-free but also minimizes the token-passing delay. The analysis of this dynamic token-passing protocol is provided with both analytical results as well as simulation results.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Mura8904:Token, AUTHOR="M. Murata and K. Shiomoto and H. Miyahara", TITLE="Performance Analysis of Token Ring Networks with Reservation Priority Discipline", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="9-18", MONTH=apr, YEAR=1989, REFERENCES=18, ABSTRACT="We consider a token ring network with priority-mode operation by a reservation discipline, which is adopted by an IEEE standard 802.5. In the reservation discipline, a high-priority station can reserve the next transmission right in the reservation field of the message transmitted by the low-priority station when the reservation field passes through the high-priority station. Then the free token at the high-priority level is passed to the high-priority station. After all messages from the high-priority stations are transmitted, the free token is returned to the station in the downstream of the previous low-priority station. To apply this reservation discipline to an interconnected token ring network system, we construct an analytical model, which consists of low-priority stations with single-buffer and a single high-priority station with infinite buffer, which is intended to represent a bridge. We present an exact analysis for the low-priority stations and an approximate analysis for the high-priority station in the reservation discipline. By our analytical approach, we can treat both cases where the reservation field resides in the message header and in the message trailer. System performance measures (mean waiting times and throughput) derived from our analysis are compared with a mixed discipline, which is an alternative method for priority-mode operation in token ring networks.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Abey8904:Z, AUTHOR="Bandula W. Abeysundara and A. E. Kamal", TITLE="{Z-NET:} A Dual Bus Fiber-Optic {LAN} using Active and Passive Switches", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="19-27", MONTH=apr, YEAR=1989, REFERENCES=18, ABSTRACT="Z-Net is a new high-speed local area network scheme using a dual unidirectional bus architecture and an optical fiber transmission medium. At very light loads, the protocol behavior is similar to a random access scheme, with zero packet delay. As load increases, the operation is similar to an implicit token-passing scheme, ensuring fair, round-robin scheduling among stations. The protocol is completely distributed with no station performing any special function. When collisions occur, one station always continues it’s transmission to completion. Thus, the wastage of bandwidth caused by collisions is minimized. This is achieved using active and passive switches on the busses. Delay performance of Z-Net is superior to Expressnet, Fasnet and Tokenless protocols at very light loads. At heavy load, performance is similar to that of Expressnet, with bounded packet delay. No special mechanisms are used to start new rounds or for transition between random and controlled access modes of transmission. Thus, the proposed scheme has the added advantage of simplicity.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Mera8904:Interconnection, AUTHOR="L. Merakos and H. Xie", TITLE="Interconnection of {CSMA/CS} {LANs} via an N-Port Bridge", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="28-37", MONTH=apr, YEAR=1989, REFERENCES=11, ABSTRACT="The interconnection of CSMA/CD LANs using an N-port bridge is considered. The stability and throughput-delay performance of the interconnected system is analyzed approximately by decomposing it into N consistent but, otherwise, independent LAN subsystems. The performance of a LAN subsystem with bridge priority is evaluated, and the results are used for the performance evaluation of the interconnected system. Simulation results indicate that the decomposition approach provides reasonably accurate performance prediction. Finally, the bridge interconnected system is compared to a system in which the bridge is replaced by a repeater, and the performance advantages of the former system over the latter are quantified.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Dimi8904:Integrated, AUTHOR="Dragomir D. Dimitrijevic and M.-S. Chen", TITLE="An Integrated Algorithm for Probabilistic Protocol Verification and Evaluation", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="69-73", MONTH=apr, YEAR=1989, REFERENCES=6, ABSTRACT="This paper presents an integrated approach to probabilistic verification and performance evaluation of a communication protocol. The approach, following the Best-First rules, generates, verifies, and evaluates states and transitions in a global reachability graph. A new recursion is found to reduce the computational complexity of the procedure from O(n^4) to O((n^2)m) in generating n states and exploring m transitions. This procedure is unique in that (1) it is computationally very efficient and (2) it provides interesting performance and reliability measures such as Mean Time To Unknown, which is the average operation time before any unchecked scenario occurs, and protocol throughput, and (3) it takes important reliability measures as its stopping criteria.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Layu8904:Formal, AUTHOR="Li Layuan", TITLE="A Formal Specification Technique for Communication Protocol", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="74-81", MONTH=apr, YEAR=1989, REFERENCES=5, ABSTRACT="A new formal method for communication protocol specification is presented. FSM, CSP and ADT are mixed and the best features of these approaches can be offered in the formal method. First we briefly describe the formal techniques of communication protocol. We then put forward the hybrid method of protocol specification. Finally, an example, i.e. IEEE 802.3 MAC protocol for LAN described by the proposed formal method, is given.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Jitt8904:Approximate, AUTHOR="C. Jittawiriyanukoon and T. Watanabe and H. Nakanishi and Y. Tezuka", TITLE="Approximate Analytic Method for Computer Systems with Multiple Level Concurrent Programs", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="82-90", MONTH=apr, YEAR=1989, REFERENCES=15, ABSTRACT="This paper deals with closed queueing network models representing computer systems with programs that have variation in concurrent level. For such models, since dimension of state transition matrix for balance equation depends on the number of states, computation by existing approximation methods results in an explosion in the size of this number. In this paper, we propose an innovative approximate analytic method based upon the average concurrent level of overall programs. We found that the use of the proposed method considerably reduces the number of states and thus requires lesser memory of the computing machine. This average concurrency method is a fast algorithm for predicting performance levels of computer systems. Various examples are studied and the accuracy of average concurrency method is determined by comparing results obtained using more exact simulations. The method is adequately accurate vis-à-vis the straightforward method. The reason for this is discussed as well.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{McCo8904:Multistage, AUTHOR="Earl E. McCoy and Pamela Zave", TITLE="Multistage, Multifaceted Analysis of Telecommunications Networks Architectures", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="91-95", MONTH=apr, YEAR=1989, REFERENCES=10, ABSTRACT="An architecture for a telecommunications network is a complex object; to understand it fully and ensure it’s quality we must apply as many forms of automated reasoning and checking as possible. Most formal languages, however, accommodate no analysis algorithms or a very small number of them. A network architecture is also developed incrementally, so that there is a need for analysis at each stage showing that the new increment is internally sound and consistent with previous decisions. This paper shows that a multilanguage approach can provide very useful feedback than the use of any single specification language by itself. The point is illustrated by an architectural model written in two executable specification languages: PAISLey and CSP. The model can be subjected to formal type checking, protocol analysis and timing analysis. In all three cases a notion of consistency between developmental stages of the model is enforced.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Kess8904:Splitting, AUTHOR="Ilan Kessler and M. Sidi", TITLE="Splitting Algorithms in Noisy Channels with Memory", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="136-142", MONTH=apr, YEAR=1989, REFERENCES=16, ABSTRACT="Multiaccess networks in which the shared channel is noisy are considered. We assume a slotted-time collision-type channel, Poisson infinite-user model, and a ternary feedback. Due to the noise in the shared channel, the received signal may be detected as a collision even though no message or a single message is transmitted. This kind of imperfect feedback is referred to as error. A common assumption in all previous studies of multiaccess algorithms in channels with errors is that the channel is memoryless. In this paper we consider the problem of splitting algorithms when the channel is with memory. We introduce a two-state first-order Markovian model for the channel and we analyze the operation of the tree-CRA in this channel. We obtain a stability result, i.e. the necessary conditions on the channel parameters for stability of the algorithm. Assuming that the stability conidtions hold, we calculate the throughput of the algorithm. Extensions to more general channel models are discussed.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Gbur8904:Formal, AUTHOR="P. Gburzynski and P. Rudnicki", TITLE="On Formal Modeling of Communication Channels", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="143-151", MONTH=apr, YEAR=1989, REFERENCES=15, ABSTRACT="Simulation is a very common tool for investigating the performance of communication protocols. However, most papers reporting simulation results do not specify the details of the simulation methods. This renders trustworthy conclusions and comparisons very difficult. The current paper presents a methodology which addresses this specification problem. The methodology forms the foundation of LANSF - a software package for simulation of communication networks. Our approach is centered around a formal model of a single CSMA/CD communication channel. The proposed model reflects all relevant elements of a real channel at the Medium Access Control level.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Kama8904:CSMA, AUTHOR="A. E. Kamal", TITLE="{CSMA/CD} with Two Persistence Factors: A Unified Performance Model for {CSMA/CD}", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="152-162", MONTH=apr, YEAR=1989, REFERENCES=27, ABSTRACT="This paper presents a new type of CSMA/CD protocols: CSMA/CD with two persistence factors. One factor is used to define the protocol action if a station becomes ready when the channel is busy, and the other one is the normal persistence factor used to determine transmission rights. This introduces a family of new protocols which correspond to different values of the persistence factors. The performance model of this protocol also acts as a unified performance model for the slotted CSMA/CD protocol with finite population. The non-persistent, 1-persistent, and p-persistent variants of the CSMA/CD protocols can all be modeled as special cases of this general model. In addition to average performance measures, the output process and the packet delay time distributions are evaluated.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Du8904:Multiple, AUTHOR="Dong-Hui Du and Shih-Fu Chang and Ghanta Subbaro", TITLE="Multiple Packet Multiple Channel {CSMA/CD} Protocols for Local Area Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="163-172", MONTH=apr, YEAR=1989, REFERENCES=20, KEYWORDS="broadband communication; CSMA/CD protocol; multiple channel local area networks; performance analysis", ABSTRACT="Multiple channel architectures have been proposed for broadcasting based local area networks to overcome the problem of deteriorating performance when very high speed communication channel is used. This is the so called Multiple channel Local Area Networks (M-LANs). In a CSMA/CD protocol designed for M-LANs (M-CSMA/CD) a ready station selects only one channel to transmit it's packet according to some channel selection mechanism. In this paper, we propose a new CSMA/CD protocol for M-LAN architecture. In this protocol a station may select and try to transmit the same packet on K (K>=1) channels. If it has been successfully transmitted on more than one channels after the end-to-end propagation delay, it randomly selects one channel to finish its transmission and immediately stop its transmission on the rest of the channels. We shall call this Multi-packet Multi-channel CSMA/CD protocol (MM-CSMA/CD). The performance of the proposed MM-CSMA/CD protocol can be shown to be potentially better thatn those of the M-CSMA/CD protocol and the traditional CSMA/CD protocol.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Coyl8904:Packet, AUTHOR="E. Coyle and J. S. Lehnert", TITLE="Packet Radio and the Factory of the Future", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="208-209", MONTH=apr, YEAR=1989, REFERENCES=6, ABSTRACT="Spread-spectrum packet radio networks are currently being considered for use in the factory of the future. These networks have the resistance to fading and the inherent multiple access capability that are necessary to interconnect the Autonomous Guided Vehicles (AGVs) and other mobile machines and personnel that will be used in the future factory. This paper reports on progress in the design and analysis of spread-spectrum packet radio networks for the factory. This progress includes the accurate analysis of the probability of packet success in a direct sequence spread spectrum communication channel and analytical results on the transient behavior of packet radio networks. The first use of these networks will be to provide communications between a transport system controller and a fleet of AGVs.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Ray8904:Fiber, AUTHOR="A. Ray", TITLE="Fiber-Optic-Based Networks for Computer-Integrated Manufacturing", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="210-211", MONTH=apr, YEAR=1989, REFERENCES=9, ABSTRACT="Advances in Computer-Aided-Design (CAD), Computer-Aided-Engineering (CAE), and Computer-Aided-Manufacturing (CAM), have created islands of automation that do not often very effectively contribute to the overall productivity gain. One major reason is that the individual subsystems do not always have an access to the common information base. The goal of Computer-Integrated Manufacturing (CIM) is to put together the diverse areas of engineering, design and production processes, material inventory, sales and purchasing, and accouting and administration into a single interactive closed loop control system. Essential to this distributed total manufacturing system is the integrated communications network over which the information leading to process interactions, and plant management and control will flow. The architecture and performance of the network that interconnects these diverse functions are of paramount importance to the efficient and reliable operation of integrated manufacturing processes. Such a network must be capable of handling heterogeneous real-time (e.g., data packets for inter-machine communications at the factory floor) and non-real-time (e.g., CAD drawings, design specifications and administrative information) traffic. Furthermore voice and video information may also be integrated with data traffic.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Zitt8904:Multiprocessor, AUTHOR="M. Zitterbart", TITLE="A Multiprocessor Architecture for High Speed Network Interconnections", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="212-218", MONTH=apr, YEAR=1989, REFERENCES=21, ABSTRACT="The development of high speed local area networks imposes new requirements on the performance of gateways used to connect such networks. In this paper a multiprocessor architecture being suitable for the implmentation of high speed gateways is presented. It is based on a horizontal and vertical subdivision of communication systems. The resulting architecture consists of several receive and send pipelines, where every receive and send pipeline is associated to one subnetwork connected to the gateway. The pipeline stages are implemented on several processors which are combined to a processor unit. The internal structure of a processor unit is adapted to the protocol functions that should be implemented on it. It comprises pipeline structures and array strucutures and thus enables temporal parallelism as well as spatial parallelism.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Bern8904:Generalized, AUTHOR="F. Bernabei and M. Listanti", TITLE="Generalized paralled Delta networks: A new class of rearrangeable interconnection networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="219-226", MONTH=apr, YEAR=1989, REFERENCES=13, ABSTRACT="This paper deals with the definition of a class of NxN multistage interconnection networks called Generalized Parallel Delta Networks (GPDNs). This class includes the already known Replicated Delta Networks (RDNs) and Parallel Delta Networks (PDNs). For the GPDNs the rearrangeability condition is given and a routing algorithm for the establishment of any set of connection requests is presented. The proposed algorithm operates in case of GPDNs composed of (2^q)x(2^q) switching elements and it is able to set-up any permutation with a time complexity equal to O(Nlog(base2)N). As far as the implmentation of rearrangeable topologies is concerned, the fields of applicability of RDNs, PDNs and other GPDNs have been investigated. In particular, it has been proved that, if large networks (N>256) have to be implemented, GPDNs structures requires a lower number of switching elements with respect to RDNs and PDNs. This features can be obtained without any impairment on the complexity of the routing algorithm.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Fuji8904:Application, AUTHOR="N. Fujii", TITLE="Application of rearrangement algorithm for digital cross-connect systems control", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="228-233", MONTH=apr, YEAR=1989, REFERENCES=6, ABSTRACT="Digital cross-connect systems (DCSs) are a new type of terminal equipment providing a remote cross-connect control function. DCSs introduce many capabilities for transmission networks. Multiple-stage switch technologies have been adopted as key technologies for DCSs. Basic issues of DCS control include non-blocking for a cross-connect requirement, non-disturbing feature for existing cross-connects and stable control. Recently, DCSs have increased substantially in scale leading to the requirement for even more effective control algorithms. This paper discusses a rearrangement type DCS control algorithm. First, a typical TST switch applicable to DCSs and a typical rearrangement algorithm are introduced. Moreover, the conditions for realizing a non-disturbing rearrangement are summarized. Next, a switch capability evaluation method is proposed and the effect of using this evaluation method to select a switch timeslot for accomodating a connection is shown. Furthermore, by analyzing general DCS control algorithms, a pre-rearrangement technique is developed that decreases blocking in a large-scale DCS control.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Boyc8904:Formalization, AUTHOR="T. Boyce and T. Grenier and R. L. Probert and H. Ural", TITLE="Formalization of {ISDN} {LAPD} for conformance testing", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="234-246", MONTH=apr, YEAR=1989, REFERENCES=17, ABSTRACT={Conformance Testing of a protocol implementation is an integral part of the manufacturing and marketing process of ISDN products. In this paper, we demonstrate the usefulness of a formalization of the specification of ISDN LAPD for designing and developing a comprehensive set of conformance tests. Since many protocol standards are specified in a natural language (i.e. English), we also present and illustrate a method for formalizing protocol specifications with a view to a number of validation activities, including conformance testing. In particular, we show how to utilize our state transition-oriented approach to automatically generate a major component of standard conformance test suites. We also illustrate the use of formalized specifications for verifying the specification by "selective executions", and for validating conformance test cases against the specification.}, URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Barb8904:FTAM, AUTHOR="Michel Barbeau and B. Sarikaya and Srinivas Eswara and Vassilios Koukoulidis", TITLE="{FTAM} Test Design Using an Automated Test Tool", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="251-260", MONTH=apr, YEAR=1989, REFERENCES=20, KEYWORDS="distributed system; software testing; functional analysis; communication protocol; data flow graph; file transfer protocol", ABSTRACT="An experience is presented with an automated test design tool for functional analysis and test derivation of distributed systems formally specified using Estelle, a description technique based on an extended finite-state-machine model. The tool accepts a formal specification of the system and generates control, data flow graphs and unparameterized test sequences. The tool has been used, on an experimental basis, for conformance test design of ISO File, Transfer, Access and Management protocol.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Pete8904:Generalizations, AUTHOR="Patrick Peters and Roy Deruz and Chiun-Teh Sung and Chia-Jiu Wang and B. Meandzija", TITLE="On Generalizations in Networking Software to Encourage Code Portability", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="261-267", MONTH=apr, YEAR=1989, REFERENCES=19, ABSTRACT="Networking software is highly dependent on hardware and operating systems features and therefore difficult to port in an heterogeneous environment. The variety of issues ranges from different byte orderings of a machine word to different access to communication hardware and/or user equipment. We discuss the principal issues involved in porting networking software and report on solutions that have been used to implement a standard environment interface to encourage code portability. This interface has been designed to provide a uniform environment to protocol drivers generated by the Archetype language compiler. We outline the structure of our implementation and elaborate on issues relating to the environment interface.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Jeon8904:Distributed, AUTHOR="Whasook Jeon and C. Kim and Dong Kim", TITLE="Design of a Distributed Isochronous Channel Management Protocol for {IEEE} 802.6 {MAN} {QPSX}", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="268-275", MONTH=apr, YEAR=1989, REFERENCES=10, ABSTRACT="This paper proposes a fully distributed isochronous channel management protocol based on QPSX which is a major candidate of IEEE 802.6 MAN. The system transmits asynchronous traffic and call-setup packets using the distributed queue protocol of QPSX. In the proposed protocol, each station assigns, maintains and deallocates its isochronous channels without communicating with other stations. In order to allocate minimum bandwidth to isochronous traffic, bandwidth allocated to silence calls is used to transmit nonisochronous traffic. At the time of system reconfiguration, channel information is easily modified and communication may continue during recovery. The proposed protocol is compared with the centralized isochronous channel management protocol by simulation. The proposed protocol has shorter data delay, higher isochronous channel utilization and fewer isochronous slots for same volume of traffic than those of the centralized protocol.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Ogie8904:Distributed, AUTHOR="R. G. Ogier and N. Shacham", TITLE="A Distributed Algorithm for finding Shortest Pairs of Disjoint Paths", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="173-182", MONTH=apr, YEAR=1989, REFERENCES=6, ABSTRACT="Providing a pair of disjoint paths between a source and a destination is an effective way to increase the reliability of a communication network. In this paper we present a distributed asynchronous algorithm for finding two disjoint paths of minimum total length from each possible source node to a destination. The algorithm has both node-disjoint and link-disjoint versions, and provides each node with information sufficient to make incremental routing decisions for forwarding packets over the disjoint paths. For a network in which all links have unit length, we show that a synchronous implementation of the algorithm has communication and time complexities O(|E| + D|N|) and O(Dz), respectively, where D is the network's diameter and Dz is the maximum, over all nodes i, of the total number of links in the shortest pair of disjoint paths from i to the destination.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Anto8904:Fast, AUTHOR="John K. Antonio and Garng Huang and Wei K. Tsai", TITLE="A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Structured Data Networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="183-192", MONTH=apr, YEAR=1989, REFERENCES=17, ABSTRACT="A new distributed algorithm is presented which finds the shortest paths from every node in the network to a given destination node. The network topology is assumed to be organizable into a generalized balanced-tree hierarchy (BH). The BH topology is introduced and characterized in this paper, and it is shown that most large interconnected data networks belong to this class. Assuming one processor is available per node in an n node BH topology, the computation and communication time complexities of the proposed algorithm are O(logn) and O[|logn|^2] respectively. (Actually, a communication complexity of O(logn) can be achieved, but due to the space limit the description of this more sophisticated communication scheme is not included in this paper). It is also shown that the algorithm, converges in an asynchronous environment. Therefore, some of the difficulties associated with synchronizing the order of events can be avoided in the actual implementation of the proposed algorithm.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Orda8904:Location, AUTHOR="A. Orda and R. Rom", TITLE="Location of Central Nodes in time varying computer networks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="193-199", MONTH=apr, YEAR=1989, REFERENCES=14, ABSTRACT="Some computer and communication networks require the assignment of certain nodes to perform special, network wide functions such as routing, monitoring etc. The natural question that arises is which is the best network node to perform the function. This is the essence of the location problem. Research in network location problems concentrated on static environments, whereas many problems computer networks related in particular are dynamic in nature. In this work we consider the single facility dynamic-network location problem in a continuous domain time. We first formulate the problem, make some general observations, and then solve it for a discrete time domain. Having become acquainted with the specificities of the problem we then offer a solution to the continuous time domain. Finally, a distributed version of the protocol is outlined and discussed.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Wood8904:Traffic, AUTHOR="C. M. Woodside and G. M. Yee", TITLE="Traffic Relationships in Networks of Tasks", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="285-292", MONTH=apr, YEAR=1989, REFERENCES=16, ABSTRACT="We consider a network of communicating software tasks in a distributed system. Over the period of interest they are permanent concurrent entitites, statically allocated to processors. Tasks communicate by messages sent to ports, sockets, or entries. A task execution is such that for each message received on a certain port, a known average number of other actions take place, including sending of messages and waiting for replies, or reception of messages on some designated port. Various interesting special cases occur. From the behaviour model and parameters of each task, network-wide relationships are obtained that govern the rates of intertask messaging. Certain rates may be taken as independent and they determine the remaining rates. In some cases, a narrowly constrained operating subspace results which contains all feasible task throughput combinations. The relationship covers a variety of types of tasks, and types of communications mechanisms, including both rendezvous and non-blocking send with blocking receive.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Gopa8904:Class, AUTHOR="P. M. Gopal and Bharath K. Kadaba", TITLE="Analysis of A Class of Distributed Directory Algorithms", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="293-302", MONTH=apr, YEAR=1989, REFERENCES=18, ABSTRACT={In this paper, we analyze a class of distributed algorithms for performing the directory function in a network. The directory function involves resolving a resource name to the address of the network node at which it resides. The simplest directory scheme consists of nodes maintaining information about only their own resources, and performing a network-wide search to locate other resources. An obvious extension of this scheme is to provide additional storage or cache at the network nodes to store the results of a previous query for a remote resource, so that a subsequent query for that resource can be resolved locally. We refer to this as the local cache (LC) scheme. We investigate two enhancements of this basic scheme. The first is the regional cache server (RCS) scheme where queries not resolved locally are forwarded to a regional "server" node. Since all nodes in a region forward their queries to the same server, multiple network-wide searches for a given resource are avoided in the region. The servers operate independently of other regional servers. The second scheme is called the cooperating cache servers (CCS) scheme. Here the regional servers cooperate to resolve a query before resorting to a network-wide search. The performance of these schemes in terms of the frequency of network-wide search to locate resources depends on the cache sizes at the nodes and servers, the probability distribution for querying different resources and the cache replacement policy used to displace resources from the cache to accommodate newly discovered ones. The analysis presented in the paper follows the analysis of cache replacement policies for demand paging in computer systems. In particular we investigate two policies - Ao, which is the optimal policy for the LC scheme, and the Least Recently Used policy, which is of practical importance. We extend the LC analysis to the RCS and CCS schemes. We also show that the limiting network search rate attains its maximum when the query distributions at the nodes and the servers are uniform distributions. We illustrate the results via numerical examples.}, URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Will8904:Locating, AUTHOR="C. E. Wills", TITLE="Locating Distributed Information", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="303-311", MONTH=apr, YEAR=1989, REFERENCES=21, ABSTRACT="As part of research into transparent execution of computational services in a distributed environment, two problems we have encountered are how to manage and locate information about service availability and the status of server machines. The key observation about these two problems is that they are not isolated, but each is an instance from a class of distributed information problems. This class is characterized by the inherent distributed nature of the information where each server machine supplies a portion of the total information. In this paper we first examine general techniques for managing distributed information and how various evaluation criteria, when applied to the techniques, are affected by the parameters and scale of a problem. We then illustrate the use of the techniques and the criteria for the problems of locating service and server status information, as well as determining the current status of a user in a distributed environment. In each case we find the best technique to use for the problem based on its parameters.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Bern8904:Optimal, AUTHOR="Jose M. Bernabeu-Auban and Mahmoud Ammar and M. Ahamad", TITLE="Optimal Selection of Multicast Groups for Resource Location in a Distributed System", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="312-321", MONTH=apr, YEAR=1989, REFERENCES=9, ABSTRACT="In this paper we present a protocol to locate (or find) named resources in a distributed system which uses the multicast capabilities of the underlying network. Each node in the network uses a sequence of node groups, and each node group is associated with a unique multicast address. To locate a resource, the searching node sequentially polls each one of the groups until the resource is found. This scheme is generalization of both pure polling and broadcast. Our basic aim is to show how to obtain an optimal division of the nodes into multicast groups. To that end, the protocol is analyzed and an efficient algorithm is given that provides a group division minimizing the expected cost per location operation.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Lein8904:Telescience, AUTHOR="B. M. Leiner", TITLE="Telescience and High Bandwidth Networking", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="96-96", MONTH=apr, YEAR=1989, ABSTRACT="Telescience is the approach and collection of tools that enable productive scientific activity to be carried out using remote resources. By using interactive high-performance telecommunication links between remote ground and space-based laboratories and facilities, support personnel, and geographically dispersed scientific research groups, facilities such as Space Station and the Supercollider become an accessible and integral part of the research environment. Telescience requires high bandwidth networking to be effective. This requirement arises from a number of sources. High rate sensors (such as synthetic aperture radars (SAR) and high resolution infrared spectrometer (HiRIS) can generate data at 300 Mb/s. Interaction with remote laboratories requires transmission of video images. Low delay is required for remote control, implying high bandwidth in the networks. Graphic workstations interacting with supercomputers require high bandwidth connections. Access to remote multimedia databases requires the ability to browse and retrieve such data at high rates and low delay. Tools supporting cooperative research (e.g. multimedia computer supported teleconferencing) requires significant bandwidth and low delay. Finally, as more and more researchers take advantage of networking capabilities, the aggregate bandwidth will grow. In this paper, we discuss the requirements for high bandwidth networking to support telescience and the science community.", URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Patt8904:Multiplexing, AUTHOR="John F. Patterson", TITLE="Beyond Multiplexing and Full-Motion Video: Any Other Uses for Broadband ?", BOOKTITLE=infocom, ADDRESS="Ottawa, Ontario, Canada", PAGES="97-97", MONTH=apr, YEAR=1989, URL="http://www.comsoc.org/confs/infocom/", } @INPROCEEDINGS{Turn8904:Why, AUTHOR="J. S. Turner", TITLE="Why We Need G