@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 techn