@ARTICLE{Barn90:Traffic, AUTHOR="J. A. Barnes and R. L. Disney", TITLE="Traffic Processes in a Class of Finite Markovian Queues", JOURNAL=qs, VOLUME=6, NUMBER=3, PAGES="311-326", YEAR=1990, KEYWORDS="queueing theory", ANNOTE="Arrival, input, output, departure and overflow processes", } @BOOK{Bens90:Television, AUTHOR="K. Blair Benson and Jerry C. Whitaker", TITLE="Television and Audio Handbook for Technicians and Engineers", PUBLISHER="McGraw-Hill", ADDRESS="New York", YEAR=1990, KEYWORDS="packet voice", ANNOTE="CD data: 14.12; TV systems of the world: p. 17.16", } @ARTICLE{Bran90:Single, AUTHOR="A. Brandt and Manfred Brandt and Hannelore Sulanke", TITLE="A Single Server Model for Packetwise Transmission of Messages", JOURNAL=qs, VOLUME=6, NUMBER=3, PAGES="287-310", YEAR=1990, KEYWORDS="discrete time queue", ANNOTE="Batch arrivals (time-dispersed)", } @UNPUBLISHED{Liew90:Comparison, AUTHOR="S. C. Liew and K. W. Lu", TITLE="Comparison of Buffering Strategies for Asymmetric Packet Switch Modules", NOTE="Bellcore memorandum", YEAR=1990, KEYWORDS="fast packet switches", ANNOTE="Asymmetric packet-switch modules with channel grouping and input or output buffers.", } @UNPUBLISHED{Yama90:Control, AUTHOR="Makoto Yamamoto and H. Okada", TITLE="Control Ahead {ATM} Switch Architecture using Broadband Transmission Media", NOTE="Seminar presentation Univ. of Mass. August 1990", YEAR=1990, KEYWORDS="fast packet switching", ANNOTE="CASCH switch: separation of data and header.", } @ARTICLE{Verm9009:Novel, AUTHOR="Mahendra K. Verma and Dimitrios P. Prezas and Jr. Russell and Mostafa Hashem Sherif and Reed Thorkildsen", TITLE="Novel Applications of Speech Processing in {AT\\&T} Network Systems Products", JOURNAL=atttj, VOLUME=69, NUMBER=5, PAGES="77-86", MONTH="September/October", YEAR=1990, KEYWORDS="packet voice; speech coding; speech recognition", ABSTRACT="In this paper, we discuss speech processing applications in the integrated access and cross-connect system, digital cellular telephone system, operator services position system, and intelligent networks. These applications are used to show how the AT\\&T Network Systems product line allows telephone companies and business customers to implement solutions based on end-user characteristics, expectations, and requirements.", ANNOTE="Wideband packet network IACS classifies traffic into voice, voiceband data and data, with support for G.721/G.723 ADPCM and G.727 embedded ADPCM. Compares speech coder complexity in MIPS. Also describes speech recognition for operator assistance.", } @INPROCEEDINGS{Chen90:Optimal, AUTHOR="Wei-Peng Chen and R. R. Muntz", TITLE="Optimal Routing for Closed Queueing Networks", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="3-17", YEAR=1990, } @INPROCEEDINGS{Conw90:New, AUTHOR="A. E. Conway", TITLE="A New Method of Parametric Analysis for Product Form Queueing Networks", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="19-33", YEAR=1990, } @INPROCEEDINGS{Akyi90:Exact, AUTHOR="Ian Akyildiz and N. van Dijk", TITLE="Exact Solution for Networks of Parallel Queues with Finite Buffers", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="35-49", YEAR=1990, } @INPROCEEDINGS{Dijk90:Insensitive, AUTHOR="N. van Dijk", TITLE="An Insensitive Product Form for Discrete-Time Communication Networks", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="77-89", YEAR=1990, } @INPROCEEDINGS{Sado90:Tail, AUTHOR="John Sadowsky and W. Szpankowski", TITLE="On the Analysis of the Tail Queue Length and Waiting Time Distributions of a $GI/G/c$ Queue", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="93-107", YEAR=1990, } @INPROCEEDINGS{Taki90:Resequencing, AUTHOR="T. Takine and T. Hasegawe", TITLE="Resequencing Delay in Preemptive Priority {$M/M/2$} Queues", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="109-121", YEAR=1990, } @INPROCEEDINGS{Fuhr90:Second, AUTHOR="S. W. Fuhrmann", TITLE="Second Moment Relationships for Waiting Times in Queueing Systems with Poisson Input", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="123-129", YEAR=1990, } @INPROCEEDINGS{Reim90:Allocation, AUTHOR="M. I. Reiman", TITLE="Some Allocation Problems for Critically Loaded Loss Systems with Independent Links", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="145-158", YEAR=1990, } @INPROCEEDINGS{Evan90:Optimal, AUTHOR="Steve Evans", TITLE="Optimal Resource Management and Capacity Allocation in a Broadband Integrated Services Network", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="159-173", YEAR=1990, } @INPROCEEDINGS{Gunt90:Bilinear, AUTHOR="N. Gunther", TITLE="Bilinear Model of Blocking Transients in Large Circuit Switching Networks", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="175-189", YEAR=1990, } @INPROCEEDINGS{Leun90:Response, AUTHOR="K. K. Leung", TITLE="Response Time for an Additional Job Served by an Execution/Sleep Scheduling Policy in Priority Systems", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="209-220", YEAR=1990, } @INPROCEEDINGS{Epem90:Mean, AUTHOR="D. H. J. Epema", TITLE="Mean Waiting Times in a General Feedback Queue with Priorities", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="221-35", YEAR=1990, } @INPROCEEDINGS{Fric90:Memory, AUTHOR="C. Fricker and P. Robert", TITLE="A Memory Reference Model for the Analysis of Cache Memories", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="255-269", YEAR=1990, } @INPROCEEDINGS{Rego90:Band, AUTHOR="V. Rego", TITLE="A Band and Bound Technique for Simple Random Algorithms", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="271-278", YEAR=1990, } @INPROCEEDINGS{Shen90:Efficient, AUTHOR="S. Shenker", TITLE="Efficient Network Allocations with Selfish Users", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="279-285", YEAR=1990, } @INPROCEEDINGS{Mass90:Heavy, AUTHOR="W. A. Massey and R. Srinivasan", TITLE="A Heavy Traffic Analysis for Semi-Open Networks", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="289-300", YEAR=1990, } @INPROCEEDINGS{Kouv90:Product, AUTHOR="D. D. Kouvatsos and N. Tabet-Aouel", TITLE="Product-Form Approximations for an Extended Class of General Closed Queueing Networks", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="301-315", YEAR=1990, } @INPROCEEDINGS{Sidi90:Customer, AUTHOR="M. Sidi and H. M. Levy", TITLE="Customer Routing in Polling Systems", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="319-331", YEAR=1990, } @INPROCEEDINGS{Leun90:Waiting, AUTHOR="K. K. Leung", TITLE="Waiting Time Distributions for Token-Passing Systems with Limited-$k$ Service via Discrete Fourier Transforms", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="333-347", YEAR=1990, } @INPROCEEDINGS{Boxm90:Optimization, AUTHOR="O. J. Boxma and H. M. Levy and J. A. Weststrate", TITLE="Optimization of Polling Systems", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="349-361", YEAR=1990, } @INPROCEEDINGS{Taka90:Effects, AUTHOR="H. Takagi", TITLE="Effects of the Target Token Rotation Time on the Performance of a Timed-Token Protocol", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="363-370", YEAR=1990, } @INPROCEEDINGS{Hofr90:Exact, AUTHOR="M. Hofri and Y. Kogan", TITLE="Exact and Asymptotic Analysis of Large Multiple Bus Multiprocessor Systems", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="373-389", YEAR=1990, } @INPROCEEDINGS{Nels90:Contention, AUTHOR="Randolph D. Nelson and Mark S. Squillante", TITLE="Analysis of Contention in Multiprocessor Scheduling", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="391-405", YEAR=1990, } @INPROCEEDINGS{Ghod90:Parallel, AUTHOR="M. Ghodsi and K. Kant", TITLE="Performance Analysis of Parallel Search Algorithms on Multiprocessors", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", PAGES="407-421", YEAR=1990, } @PROCEEDINGS{King90:, TITLE="Performance", BOOKTITLE="Performance", EDITOR="P. J. B. and I. Mitrani and R. J. Pooley", PUBLISHER="North-Holland", ADDRESS="Amsterdam, Holland", YEAR=1990, } @ARTICLE{Sher90:Wideband, AUTHOR="M. H. Sherif and Malaret-Collazo and M. C. Gruensfelder", TITLE="Wideband packet technology in the integrated access and cross-connect system {(IACS)}", JOURNAL="International Journal of Satellite Communications", VOLUME=8, PAGES="437-444", YEAR=1990, KEYWORDS="voice and data integration; wideband packet technology; bandwidth on demand; congestion control; packet cross-connection; network management; virtual private network; LADP; ADPCM; voice packetization; packet voice", ABSTRACT="The integrated access and cross-connect system (IACS) is an AT\\&T product based on the wideband packet technology. The IACS has two compoenents: the integrated access terminal (IAT) and the integrated access controller (IAC). The IAC provides centralized control, operations and maintenance for a network of IATs. An IAT provides direct digital connectivity at 1.536 Mb/s or 2.048 Mb/s to customer terminals and to circuit- and packet-switched networks. It integrates voice, voiceband data, facsimile traffic, digital data, signalling, image and network control into packets of common format. It allows networking in both the circuit and packet domains, offers bandwidth on demand, and achieves graceful degradation of voice quality during congestion.", ANNOTE="three queue priorities: exhaustive non-preemptive for signalling and control; other queues are services until empty or timer expires; queue 0 can preempt other queues; timers range from 0 to 30 ms. Block dropping depends on the current fill of packet queues, computed as a weighted sum of the queue 1 and 2 fill values.", } @ARTICLE{Sher90:CCITT, AUTHOR="M. H. Sherif and Russell J. Clark and G. P. Forcina", TITLE="{CCITT/ANSI} voice packetization protocol", JOURNAL="International Journal of Satellite Communications", VOLUME=8, NUMBER=6, PAGES="429-436", YEAR=1990, KEYWORDS="packet voice; G.764", ABSTRACT="This paper introduces the packetized voice protocol G.PVNP/T1.PVP which is being standardized in both the CCITT and T1Y1. At layer 2, G.PVNP/T1.PVP extends the ISDN LAPD protocol to include packetized voice, thereby potentially allowing the integration of voice and data traffic. Layer 3 specifies procedures to deal with voice-band data traffic and to handle channel-associated signaling.", ANNOTE="CCITT recommended delay limit for international circuits: 400 ms.", } @BOOK{Moor90:Elements, AUTHOR="F. R. Moore", TITLE="Elements of Computer Music", ISBN="0-13-252552-6", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1990, KEYWORDS="computer music; computer sound processing; stereophonic perception", } @TECHREPORT{Hopp90:Pandora, AUTHOR="Andrew Hopper", TITLE="Pandora -- an experimental system for multimedia applications", TYPE="Technical Report", INSTITUTION="Olivetti Research Limited", ADDRESS="Cambridge, England", NUMBER="90-1", YEAR=1990, KEYWORDS="multimedia; packet voice; packet video; workstation architecture", ABSTRACT="Pandora is a joint project between Olivetti Research Cambridge and the University of Cambridge Computer Laboratory. The project is investigating the use of multimedia workstations in a working environment with particular emphasis on digital video. It endeavours to place a camera on the desktop to make generation of multimedia documents as easy as producing text. We are aiming to produce a number of new applications as well as to provide insights into the way computer systems should be designed. The project is in three stages. In the first a peripheral, Pandora's Box, has been designed. This box can be attached to any one of a range of workstations and provides multimedia features. In the second stage a number of such systems are being deployed amongst a community of system developers and application writers. Finally we will use the experimental system in our daily work to evaluate new applications. From the users point of view the normal workstation environment is maintained but additional features are available. This paper describes the design decisions which must be taken when incorporating video in a workstation. A description of the Pandora's Box peripheral which provides multimedia features is given. Finally, the distributed system under construction is discussed.", } @INCOLLECTION{Camp90:DoD, AUTHOR="Andrew T Campbell and Thomas E. Tremain and Vanoy C. Welch", TITLE="The {DoD} 4.8 kbps standard (Proposed Federal Standard 1016)", BOOKTITLE="Advances in Speech Coding", EDITOR="B. Atal and V. Cuperman and A. Gersho", CHAPTER="4.1", PUBLISHER="Kluwer Academic Publishers", YEAR=1990, KEYWORDS="speech coding; CELP", } @ARTICLE{Camp9004:Proposed, AUTHOR="Andrew T Campbell and Thomas E. Tremain and Vanoy C. Welch", TITLE="The Proposed Federal Standard 1016 4800 bps voice coder: {CELP}", JOURNAL=speecht, VOLUME=5, NUMBER=2, PAGES="58-64", MONTH="April/May", YEAR=1990, KEYWORDS="voice coding; CELP", } @TECHREPORT{OTS90:Telecommunications, AUTHOR="Office of Technology and Standards", TITLE="Telecommunications: Analog to Digital Conversion of Radio Voice by 4,800 bit/second Code Excited Linear Prediction {(CELP)}", TYPE="Federal Standard", INSTITUTION="GSA", ADDRESS="Room 6654; 7th \\& D Street SW; Washington, DC 20407 (+1-202-708-9205)", NUMBER="FS-1016", YEAR=1990, KEYWORDS="CELP; low-rate speech coding; packet voice", } @MISC{Kohl90:SunGraph, AUTHOR="M. A. Kohler", TITLE="SunGraph", ORGANIZATION="National Security Agency", ADDRESS="Fort Meade, Virginia", YEAR=1990, KEYWORDS="graphing; digital signal processing; tools", } @INPROCEEDINGS{Atha90:Physically, AUTHOR="William C. Athas", TITLE="Physically Compact, High Performance Multicomputers", BOOKTITLE="7th MIT Conference on Advanced Research in VLSI", ADDRESS="Boston, Massachusetts", PAGES="302-313", YEAR=1990, } @ARTICLE{BaiQ90:Dynamically, AUTHOR="Xu BaiQiang and Nathan Ida", TITLE="A Dynamically Segmented Bus Architecture", JOURNAL="Computers and Electrical Engineering", VOLUME=16, NUMBER=3, PAGES="139-158", YEAR=1990, } @ARTICLE{El90:Scheduling, AUTHOR="Hesham El-Rewini and T. G. Lewis", TITLE="Scheduling Parallel Program Tasks onto Arbitrary Target-Machines", JOURNAL=jpdc, VOLUME=9, PAGES="138-153", YEAR=1990, } @ARTICLE{Fan90:Simultaneous, AUTHOR="Zhenqiang Fan and Kam Hoi Cheng", TITLE="Design and Analysis of Simultaneous Priority Queues", JOURNAL=jpdc, VOLUME=9, NUMBER=4, PAGES="387-397", YEAR=1990, } @BOOK{Hage90:Task, AUTHOR="Gregory D. Hager", TITLE="Task-Directed Sensor Fusion and Planning: a computational approach", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston", YEAR=1990, } @INCOLLECTION{Harm90:Robots, AUTHOR="S. Y. Harmon", TITLE="Robots, Mobile", BOOKTITLE="Encyclopaedia of Artificial Intelligence", PUBLISHER="John Wiley", PAGES="957-963", YEAR=1990, } @INCOLLECTION{Hawl90:Futurebus, AUTHOR="David Hawley", TITLE="Futurebus", BOOKTITLE="Digital Bus Handbook", PUBLISHER="McGraw-Hill", ADDRESS="New York", YEAR=1990, } @INPROCEEDINGS{Luo90:Intelligent, AUTHOR="Ren C. Luo and Tai-Jee Pan and Caglan M. Aras", TITLE="An Intelligent Motion Planning System operating in a Factory Floor", BOOKTITLE="IEEE Workshop on Intelligent Motion Control", ADDRESS="Istanbul, Turkey", VOLUME=1, YEAR=1990, } @ARTICLE{Onyu90:Markovian, AUTHOR="Ibrahim Onyuksel and K. B. Irani", TITLE="Markovian Queueing Network Models for Performance Analysis of a Single-Bus Multiprocessor System", JOURNAL=ieeetc, VOLUME=39, NUMBER=7, PAGES="975-980", YEAR=1990, } @ARTICLE{Perr90:Approximation, AUTHOR="Harry Perros", TITLE="Approximation Algorithms for Open Queueing Networks with Blocking", JOURNAL="Stochastic Analysis of Computer and Communication Systems", VOLUME="TR-89-16", PAGES="451-498", YEAR=1990, } @INPROCEEDINGS{Ragh90:Fine, AUTHOR="R. Raghavan and K. K. Jung and H. Q. Nguyen", TITLE="Fine Grain Parallel Processors and Real-Time Applications: {MIMD} {Controller/SIMD} Array", BOOKTITLE="10th International Conference on Pattern Recognition", ADDRESS="Atlantic City, New Jersey", VOLUME=2, PAGES="324-331", YEAR=1990, } @INPROCEEDINGS{Rind90:Preemptive, AUTHOR="Andrew J Rindos and Jeffrey Haag and I. Viniotis", TITLE="Analysis of The Preemptive Resume Policy With Nonzero Overhead", BOOKTITLE="IEEE Southeatcon", PAGES="861-865", YEAR=1990, } @INPROCEEDINGS{Sha90:Real, AUTHOR="L. Sha and Ragunathan Rajkumar and John Lehocszky", TITLE="Real-Time Scheduling Support in Futurebus+", BOOKTITLE="11th Real-Time Systems Symposium", ADDRESS="Lake Buena Visa, Florida", VOLUME=1, YEAR=1990, } @INCOLLECTION{Lidi90:Requirements, AUTHOR="W. P. Lidinsky", TITLE="Network requirements for data traffic", BOOKTITLE="Perspectives on packetized voice and data communications", EDITOR="William Lidinsky and David Vlack", SERIES="Frontiers in Communications", PUBLISHER="IEEE Press", ADDRESS="New York", PAGES="5-10", YEAR=1990, KEYWORDS="data networks; requirements; client-server", ABSTRACT="The computing community has recently evolved an additional computer system paradigm often referred to as the ``client-server'' model. Fueled by the explosive growth of both personal computers and local area networks, computing systems based on this model are flourishing. The data communications needs of these systems are currently being satisfied by low delay, connectionless networks with broadcast capabilities (e.g., local area networks). Such networks provide services that are substantially different from virtual circuit networks. This paper examines both present and future computing and explores trends in computing technology. It examines the data communications needs of four classes of computing systems: terminal-timesharing, transaction, mainframe, and client-server. Finally, it discusses in detail the communications network characteristics necessary for client-server systems.", } @INCOLLECTION{Lidi90:Packet, AUTHOR="W. P. Lidinsky", TITLE="Packet network interfaces and implementations", BOOKTITLE="Perspectives on packetized voice and data communications", EDITOR="William Lidinsky and David Vlack", SERIES="Frontiers in Communications", PUBLISHER="IEEE Press", ADDRESS="New York", PAGES="11-15", YEAR=1990, KEYWORDS="data networks; requirements; client-server; connectionless; connection-oriented; implementation", } @BOOK{Lidi90:Perspectives, TITLE="Perspectives on packetized voice and data communications", EDITOR="William Lidinsky and David Vlack", SERIES="Frontiers in Communications", ISBN="0-87942-233-5", PUBLISHER="IEEE Press", ADDRESS="New York", YEAR=1990, KEYWORDS="data networks; packet voice", } @INPROCEEDINGS{Oust90:Tcl, AUTHOR="J. Ousterhout", TITLE="Tcl: an embeddable command language", BOOKTITLE=usenixw, ORGANIZATION="Usenix", PAGES="133-146", YEAR=1990, KEYWORDS="Tcl; command language; widget set; programming tools", ABSTRACT="Tcl is an interpreter for a tool command language. It consists of a library package that is embedded in tools (such as editors, debuggers, etc.) as the basic command interpreter. Tcl provides (a) a parser for a simple textual command language, (b) a collection of built-in utility commands, and (c) a C interface that tools use to augment the built-in commands with tool-specific commands. Tcl is particularly attractive when integrated with the widget library of a window system: it increases the programmability of the widgets by providing mechanisms for variables, procedures, expressions, etc.; it allows users to program both the appearance and the actions of widgets; and it offers a simple but powerful communication mechanism between interactive programs.", } @ARTICLE{Sait90:Departure, AUTHOR="H. Saito", TITLE="The departure process of an {$N/G/1$} queue", JOURNAL=pe, VOLUME=11, PAGES="241-251", YEAR=1990, REFERENCES=23, KEYWORDS="departure process; $N$-process; packet voice; packet video; ATM; integrated services; queueing theory; N/G/1; ATM; performance evaluation; queueing system", ABSTRACT="The departure process of an $N/G/1$ queue is investigated. The arrival process called an $N$ process is a versatile point process and includes, for example, a Markov-modulated Poisson process, which is comprised of models of packetized voice and video traffic arrival processes. The first passage analysis yields LSTs of distributions of the interdeparture times. Emphasis is on the interdeparture times of an $N/D/1$ queue. Numerical examples show that correlation of interarrival times is likely to be preserved in interdeparture times, and that the departure of a voice packet multiplexer can be expected to be smoothed for a normal load. The result in this paper enables evaluation of the smoothing effect of burst traffic through nodes in asynchronous transfer mode networks.", } @UNPUBLISHED{Cido90:Control, AUTHOR="I. Cidon and I. Gopal", TITLE="Control mechanisms for high speed networks", NOTE="IBM T. J. Watson Research Center", YEAR=1990, KEYWORDS="PARIS; network control; fast packet switching", ABSTRACT="The high speed communication links and the altered nature of carried traffic has considerably impacted the design and implementation of packet switched networks. In this paper we explore the impact on the control procedures within the network, specifically focusing on the lessons that we have learned from the prototype PARIS network. We believe that most of the conclusions are general and can be applied to any network including ATM based systems.", } @TECHREPORT{Ahma90:Dynamic, AUTHOR="Hazim Ahmadi and Jinghu Chen and R. Guérin", TITLE="Dynamic routing and call control in high-speed integrated networks", TYPE="Technical Report", INSTITUTION="IBM Research Division, T. J. Watson Research Center", ADDRESS="Yorktown Heights, New York", YEAR=1990, KEYWORDS="routing; call control; admission control", ABSTRACT="High-speed networks, based on fast-packet switching, are being proposed and implemented that are capable of carrying a wide variety of connections with different bandwidth requirements and traffic characteristics. This new environment, because of its increased flexibility, poses new problems to the network designer. In particular, the issues of bandwidth allocation, dynamic route computations and call control policies are substantially more complex than in the traditional circuit-switched or packet-switched environments. This paper focuses on dynamic routing and admission control of connections with different traffic requirements. These issues are studied by means of simulations, assuming a bandwidth allocation procedure developed in a companion paper. A routing strategy is proposed that attempts to maximize network throughput while, in the mean time, providing the lowest possible end-to-end delay. This is achieved by accounting for the impact of routing a connection on both link loads and required network resources. In addition, a threshold-based call admission policy, similar in spirit to trunk reservation, is also investigated. The results indicate this call admission policy can help prevent some of the potential unfairness of dynamic routing. However, because of the general network topology assumed, its efficiency is more limited than in the traditional circuit-switched network environment. New policies need to be developed to accomodate these more general networks.", } @TECHREPORT{Cido90:New, AUTHOR="I. Cidon and I. Gopal and S. Kutten", TITLE="New models and algorithms for future networks", TYPE="Technical Report", INSTITUTION="IBM T. J. Watson Research Center", ADDRESS="Yorktown Heights, New York", NOTE="also in the proceedings of the 7th ACM Symposium on Principles of Distributed Computing, Toronto, Canada, August 1988 and in the Proceedings of the 4th Workshop on Distributed Algorithms, Bari, Italy, September 1990.", YEAR=1990, KEYWORDS="ATM; network architecture; distributed algorithms; leader election; routing", ABSTRACT="In future networks transmission and switching capacity will dominate processing capacity. In this paper we investigate the way in which distributed algorithms should be changed in order to operate efficiently in this new environment. We introduce a class of new models for distributed algorithms which make explicit the difference between switching and processing. Based on these new models, we define ``message'' and time complexity measures which capture the true costs in high speed networks more accurately than traditional measures. In order to demonstrate the capabilities of the new model we examine three problems in distributed computation. For the problem of maintaining network topology we devise a broadcast algorithm which takes $O(n)$ ``messages'' and $O(\log n)$ time. For the problem of leader election we present a simple algorithm that uses $O(n)$ ``messages'' and $O(n)$ time. A matching lower bound for a certain class of algorithms is also provided. The third problem, distributed computation of a globally sensitive function, demonstrates some important features and trade-offs in the new network model and emphasizes the differences with the traditional network model. All algorithms described in this paper are better than the best existing algorithms under the new network model.", } @TECHREPORT{Kapl90:Slick, AUTHOR="Michael Kaplan", TITLE="Slick Transport Protocol -- {RTP}", TYPE="Technical Report", INSTITUTION="IBM Watson Research Labs", ADDRESS="Yorktown Heights, New York", NUMBER="90 01", YEAR=1990, KEYWORDS="STP; transport protocol", ABSTRACT="STP is a new high-performance reliable data transport protocol whose guiding philosophical principles are: be optimistic, be fast, be as straightforward as is consistent with the first two principles. Prototype file transfer and remote command execution applications are now running ``on top of'' our STP prototype code. This paper will briefly describe STP.", ANNOTE="implicit connection establishment with data", } @TECHREPORT{Cido90:Metaring, AUTHOR="I. Cidon and Y. Ofek", TITLE="Metaring -- a full-duplex ring with fairness and spatial reuse", TYPE="Technical Report", INSTITUTION="IBM T. J. Watson Research Center", ADDRESS="Yorktown Heights, New York", YEAR=1990, KEYWORDS="local area networks; ring networks; multiple access; slot reuse; synchronous traffic; asynchronous traffic", ABSTRACT="We describe the design principles of a ring network with spatial reuse. Our goal is to provide the same functions of existing designs that do not permit spatial reuse and concurrent transmission. A distributed fairness mechanism for this architecture is presented. The basic fairness mechanism can be extended for implementing multiple priority levels and integration of asynchronous with synchronous traffic. The ring is full duplex and has two basic modes of operation: buffer insertion mode for variable size packets and slotted mode for fixed-size packets. As a result, this architecture is suitable for a wide range of applications and environments. Concurrent access and spatial reuse enable the simultaneous transmissions over disjoint segments of a bidirectional ring, and therefore, can increase the effective throughput, by a factor of four or more. The efficiency of this architecture does not degrade as the bandwidth and physical size of the system increases. The combination of a full-duplex ring, spatial reuse, reliable fairness mechanism and the exploitation of the recent advances in fiber-optic technology are the basis for the Metaring network architecture. This network is currently being prototyped at the IBM T. J. Watson Research Center.", } @TECHREPORT{Jone90:IMS, AUTHOR="Gareth Jones", TITLE="{IMS} {T9000} transputer: benchmark performance", TYPE="Technical Note", INSTITUTION="SGS-Thomson/Inmos", ADDRESS="Bristol, UK", NUMBER=72, YEAR=1990, KEYWORDS="transputer; performance; benchmarks; Whetstone; Dhrystone; T9000", ABSTRACT="This document describes the performance of the IMS T9000 transputer with regard to the execution of some common benchmark programs. The aim of these benchmarks is to show the performance that can be achieved using current generation transputer compilers. The benchmarks used to show performance relative to other processors are the Whetstone and Dhrystone benchmarks. These are both synthetic benchmarks, which, although being subject to what has become known as 'benchmark targeted engineering', are still often quoted with regard to relative processor performance. In order to show the performance that is quite easily achievable using the TMS T9000 transputer, two programs have been used. The first program is a 1024 point complex FFT illustrating floating point performance. The second shows integer performance and is based on the colour transform mathematics required to convert a red, green, blue color image into a cyan, magenta, yellow image which can then be printed.", } @ARTICLE{Wein90:Scheduling, AUTHOR="L. M. Wein", TITLE="Scheduling Networks of Queues - Heavy Traffic Analysis of a 2- Station Network with Controllable Inputs", JOURNAL=or, PUBLISHER="Operations Research Society of America", VOLUME=38, NUMBER=6, PAGES="1065-1078", YEAR=1990, } @ARTICLE{Warf90:Prospects, AUTHOR="B. Warfield and P. Sember", TITLE="Prospects for the Use of Artificial Intelligence in Real Time Network Traffic Management", JOURNAL=cnis, PUBLISHER="North-Holland", VOLUME=20, NUMBER="1-5", PAGES="163-169", YEAR=1990, } @ARTICLE{Kash90:Robust, AUTHOR="A. Kashper and S. S. Katz and G. R. Ash", TITLE="Robust design for switched digital services in a worldwide intelligent network", JOURNAL=cnis, PUBLISHER="North-Holland", ADDRESS="Amsterdam, Netherlands", VOLUME=20, NUMBER="1-5", PAGES="81-88", YEAR=1990, } @ARTICLE{Gers90:Joint, AUTHOR="A. Gersht and R. Weihmayer", TITLE="Joint Optimisation of Data Network Design and Facility Selection", JOURNAL=ieeejsac, PUBLISHER="IEEE", VOLUME=8, NUMBER=9, PAGES="1667-1681", YEAR=1990, ANNOTE="Deals with a method of capacity planning and allocation in network design", } @ARTICLE{Netr90:Implementation, AUTHOR="A. N. Netravali and W. D. Roome and K. Sabnani", TITLE="Design and Implementation of a High Speed Transport Protocol", JOURNAL=ieeecom, VOLUME=38, NUMBER=11, PAGES="2010-2024", YEAR=1990, KEYWORDS="transport protocol; SNR; flow control", ABSTRACT="This paper describes a transport protocol designed for high-speed (> 1 Gbit/s), high-latency (> 60 ms R. T. D.) networks. With a 60 ms RTD on a 1 Gbit/s line, using Go-back-N or a windowing flow control protocol, upto 60Mbits have to be retransmitted if an overflow occurs. The authors new protocol supports three modes of operation: 1) No error and no flow (suitable for lightwieght virtual circuits for terminals) 2) No error control (suitable for packetised voice and video where small errors can go undetected) 3) Full error and flow control (suitable for traditional file transfer etc) Connection establishment is based upon a three way handshake. Prenegotiated buffers are setup which are larger than the RTD $x$ the negotiated bandwidth. State information is passed regularly and frequently between communicating systems as this supposedly makes protocol processing easier. The authors envisage a heirarchially organised multiprocessor based outboard protocol processor, which would link several hosts each with many logical channels to the network. Most performance constraints are to do with the movement of data between the host and the protocol processor and bus contention in the protocol processor. Packets may be grouped together in blocks to simplify the processing. Selective retransmission is used for error recovery to keep down the retransmission costs.", } @ARTICLE{Lync9006:Growth, AUTHOR="C. A. Lynch", TITLE="The growth of Computer Networks: A Status Report", JOURNAL=basis, VOLUME=16, NUMBER=5, PAGES="10-11", MONTH="June -- July", YEAR=1990, ABSTRACT="This paper describes some computer networks on the national level that serve the research and higher education communities. BITNET and Internet connect institutions and have overseas affiliates. These networks are used for electronic mail, file transfers and access to database servers. Networks available to the general public through telephone companies are in the trial stages. Another development is the linking of a number of electronic mail services into wha will become a national system. Some policy and management issues are raised in the paper such as where the funding will come from and how to insure network security. The proposed National Research and Education Network (NREN) is described. This network would provide access to the advanced science equipment such as the space telescope, the superconducting supercollider and national supercomputing centres.", } @INPROCEEDINGS{Cisl90:National, AUTHOR="S. Cisler", TITLE="The National Research and Education Network", BOOKTITLE="Online/CD-ROM Conference", PUBLISHER="Online Inc.", ADDRESS="Weston, Connecticut", PAGES="31-35", YEAR=1990, REFERENCES=5, ABSTRACT="This paper outlines the history of the National Research and Education Network (NREN) effort. Internet is defined as the network of networks serving governmental, research and academic communities in the United States and around the world. The wide bandwidth research network is suggested as the successor to the Internet. The National High Performance Computer Technology Act of 1989 is examined.", } @ARTICLE{Acam9006:Architecture, AUTHOR="A. S. Acampora", TITLE="Architecture and technologies for Terabit Lightwave Networks", JOURNAL=basis, VOLUME=16, NUMBER=5, PAGES="15-16", MONTH="June -- July", YEAR=1990, ABSTRACT="This paper examines a recent research goal in optical technologies - a Terabit lightwave network that assumes the properties of an ``optical ether'', with geographical separation between users being spanned by passive optical components. The oprical ther supports the creation of broadband channels, and since it is devoid of speed contstrining electronics, the channels ma operate autonomously, moving vastamounts of information. All routing and control functions are performed in electronics situated in the network interface units. Some applications of Terabit lightwave networks are telecommunications, distribution of high quality graphics, document and picture archiving and retrieval, access to electronically stored databases and publishing services and the interconnection of supercomputers.", } @INPROCEEDINGS{Cruz90:Iterative, AUTHOR="J. R. Cruz and S. Stidham", TITLE="Iterative methods for determining derivatives of stationary distributions of finite Markove chains", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="142-164", YEAR=1990, REFERENCES=22, KEYWORDS="Markov chain; steady state probability; distribution", ANNOTE="Algorithms for obtaining derivatives of steady state probabilitydistributions of finite Markov chains are presented. The focus is on a conceptually simple approach for developing such algorithms from established methods of computing steady state proba-bility distributions. The prototyp is briefly discussed and the results are presented of applying the approach to LOPSI (Lopsided Iteration) and Neut's Matrix Geometric Methods.", } @INPROCEEDINGS{Elwa90:Theory, AUTHOR="A. I. Elwalid and D. Mitra and T. E. Stern", TITLE="A Theory of Statistical Multiplexing of Markovian Sources: Spectral Expansions and Algorithms", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="238-257", YEAR=1990, REFERENCES=21, KEYWORDS="Markov chain; efficient computer algorithm; theory", ANNOTE="This paper considers the problem of exactly calculating the stationary state distribution of a system which statistically multiplexes the output of $K$ sources. Each source is an N-state Markov chain and its Poisson rate of packet generation is deter-mined by its state.", } @INPROCEEDINGS{Huli90:Comparison, AUTHOR="Zbigniew Hulicki", TITLE="Performance Comparison of Multistage Cube-Type Interconnection Networks", BOOKTITLE="International Zurich Seminar on Digital", ADDRESS="Zurich, Switzerland", PAGES="213-219", YEAR=1990, REFERENCES=30, KEYWORDS="ATM; switching system; multistage interconnection network", } @INPROCEEDINGS{Krie90:Loss, AUTHOR="U. R. Krieger", TITLE="Analysis of a loss system with mutual overflow in a Markovian environment", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="328-348", YEAR=1990, REFERENCES=45, KEYWORDS="Markov system; analysis; loss system; overflow; overview", ABSTRACT="A loss system modelling mutual overflow between two fully available trunk groups is investigated. Assuming exponentially distributed call holding times and two independent Markov modulatedPoisson processes to be offered as arrival streams, a Markovian model is derived and its steady-state distribution is computed by numerical methods. Formulas for the call-congestion rates of of the arrival streams are derived.", } @INPROCEEDINGS{Naka90:Steady, AUTHOR="A. Nakasis and Anthony Ephremides", TITLE="Steady state behaviour of interacting queues - a numerical approach", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="547-568", YEAR=1990, REFERENCES=25, KEYWORDS="Markov chain; steady state analysis; interaction model", ANNOTE="In this paper the authors consider the case of $M$ queues that in-teract according to the model of multiple access transmissions over a collision channel; that is, each queue receives messages that it attempts to transmit in a classical slotted ALOHA fashion. A numerical approach is proposed that permits the calculationwithin any desired accuracy, of the joint queue size distribution as well as of the moments.", } @ARTICLE{Yoon90:Multibuffered, AUTHOR="H. Yoon and K. Y. Lee and Minkui Liu", TITLE="Performance analysis of multibuffered packet switching in multiprocessor systems", JOURNAL=ieeetc, VOLUME="C-39", NUMBER=3, PAGES="319-327", YEAR=1990, REFERENCES=18, KEYWORDS="Packet switching; interconnection network; delta network", ANNOTE="We present a new analytic model and analytic results for the performance of multibuffered packet switching interconnection networks in multiprocessor systems. For multibuffered interconnection networks only simulation results of delta networks are known (1). We first model the wsingle-buffered delta networks using the state transition diagram of a buffer. It is then extended to multibuffering. The analysis is compared with simulation results.", } @TECHREPORT{Gebe90:Paketvermittlungstechnik, AUTHOR="H. Gebehenne", TITLE="Paketvermittlungstechnik", TYPE="Unterrichtsblätter der DBP", INSTITUTION="Deutsche Bundespost", VOLUME=43, NUMBER=4, PAGES=27, YEAR=1990, LANGUAGE="German", REFERENCES=12, KEYWORDS="Packet switching; survey; ISO reference model", } @ARTICLE{Jage90:Zusammenhang, AUTHOR="R. Jäger", TITLE="Zusammenhang zwischen Gebühren und Einnahmen im Telekommunikationsbereich", JOURNAL=fernmelde, ISBN="0015-010-X", ADDRESS="Erlangen, Germany", VOLUME=44, NUMBER="1/2", PAGES=41, YEAR=1990, LANGUAGE="German", REFERENCES=7, KEYWORDS="Traffic source model; parameter estimation; tariff", } @ARTICLE{Knes90:Asymptotic, AUTHOR="Ch. Knessl and C. Tier", TITLE="Asymptotic expansions for large closed queuing networks", JOURNAL=jacm, VOLUME=37, NUMBER=1, PAGES="144-174", YEAR=1990, REFERENCES=19, KEYWORDS="Closed queueing network; BCMP; analysis; approximation", ANNOTE="A new asmptotic method is developed for analyzing closed BCMP queueing networks with a single class (chain) consisting of a large number of customers, a single infinite server queue, and a large number of single server queues with fixed (state independent) service rates.", } @ARTICLE{Ghos90:Dataflow, AUTHOR="D. Ghosal and L. Bhuyan", TITLE="Performance evaluation of a dataflow architecture", JOURNAL=ieeetc, VOLUME="C-39", NUMBER=5, PAGES="615-627", YEAR=1990, REFERENCES=29, KEYWORDS="Closed queueing network; performance evaluation; data flow", ANNOTE="This paper deales with formulation and validation of an analytical approach for the performance evaluation of the Manchester dataflow compputer. The analytical approach is based on closed queueing network models. The average parallelism of the dataflow graph being executed on the dataflow architecture is shown to be related to the population of the closed network.", } @ARTICLE{Krit90:Generalised, AUTHOR="P. S. Kritzinger", TITLE="A generalised analysis of {ARQ} protocol performance in a multiprocess environment", JOURNAL=pe, VOLUME=11, NUMBER=1, PAGES="31-44", YEAR=1990, REFERENCES=18, KEYWORDS="ARQ; MVA; protocol engineering; performance evaluation", ANNOTE="Comparison of stop-and-wait and selective repeat in a multiprocess environment", } @TECHREPORT{Lin90:Determining, AUTHOR="Y. Lin and E. D. Lazowska", TITLE="Determining the global virtual time in a distributed simulation", INSTITUTION="University of Washington", ADDRESS="Seattle, Washington", PAGES=23, YEAR=1990, REFERENCES=15, KEYWORDS="distributed simulation; time warp", ABSTRACT="The virtual time paradigm is a method of organizing and synchronizing distributed systems. An implementation of this paradigm, called the time warp mechanism, is one of the most important simulation protocols. This paper proposes a new algorithm that does not require acknowledgement messages.", } @PHDTHESIS{Klut90:Multiprozessorarchitekturen, AUTHOR="B. Kluth", TITLE="Multiprozessorarchitekturen mit funktionsorientierter Parallelisierung für die stochastische Simulation", ISBN="3-925038-62-0", SCHOOL="RWTH Aachen", ADDRESS="Aachen, Germany", PAGES=178, YEAR=1990, LANGUAGE="German", REFERENCES=83, KEYWORDS="Simulation; distributed simulation; model; RNG; SIMULA; C++", } @ARTICLE{Berb90:Application, AUTHOR="I. Berberana", TITLE="Application of extreme value theory to the analysis of a network simulation", JOURNAL=sigsim, VOLUME=20, PAGES="105-121", NOTE="Proc. 23rd Annual Simulation Conference", YEAR=1990, REFERENCES=15, KEYWORDS="Communication network; queueing network; ATM; simulation", ANNOTE="The objective of this work is to estimate the finite buffer size of the queues such that cells arring to the system at a lower rate than one fixed have a very low probability, usually less than 10E-8, to be rejected. To carry out this task by simulation would require very much computer time. Extreme value theory is employed to estimate, from the results of a reduced simulation, thenecessary buffer sizes.", } @ARTICLE{Kas90:Intelligente, AUTHOR="B. Käs and M. Körkel", TITLE="Intelligente Netze - Spezifische verkehrstheoretische und wirtschaftliche Gesichtspunkte bei der Planung", JOURNAL=fernmelde, PUBLISHER="Verlag für Wissenschaft und Leben (G. G. Heidecker)", ADDRESS="Erlangen, Germany", VOLUME=44, NUMBER=5, PAGES="1-27", YEAR=1990, LANGUAGE="German", REFERENCES=18, KEYWORDS="IN; intelligent network; queueing network; overload control", ANNOTE="Verschiedene Methoden der Überlastabwehr im Zeichengabenetz werden entwickelt und simulativ untersucht. Außerdem werden kostengünstige Standorte für die IN-Einrichtungen ermittelt.", } @TECHREPORT{Vill90:RESTART, AUTHOR="M. Villen-Altamirano and J. Villen-Altamirano", TITLE="{RESTART:} a method for accelerating rare event simulations", TYPE="COST Technical document", INSTITUTION="Telefonica (TID)", ADDRESS="Madrid, Spain", NUMBER="224 TD(90)017", PAGES=11, YEAR=1990, REFERENCES=5, KEYWORDS="Simulation; time series analysis; importance sampling", ANNOTE="REpetitive Simulation Trials After Reaching Thresholds", } @ARTICLE{Kim90:Buffered, AUTHOR="H. Kim and A. Leon-Garcia", TITLE="Performance of buffered Banyan networks under nonuniform traffic patterns", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=5, PAGES="648-658", YEAR=1990, REFERENCES=10, KEYWORDS="Interconnection Network; buffered Banyan network; switching", ABSTRACT="This paper presents an analytical method to evaluate the performance of the bufferd Banyan packet-switching network under nonuniform traffic patterns. It is shown that the nonuniform traffic can have a detrimental effect on the performance of the network. The analytical model is extended to evaluate the performance of multibuffer and parallel Banyan networks. These modified networ ks are shown to have better throughput capacity.", } @ARTICLE{Gorg90:Further, AUTHOR="C. Görg", TITLE="Further results on a new combined strategy based on the {SRPT} principle", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=5, PAGES="568-570", YEAR=1990, REFERENCES=7, KEYWORDS="Queueing discipline; performance evaluation; SRPT; shortest", ABSTRACT="A short introduction to the method of analysis for SRPT/RR is given and it is shown that this combined strategy preserves the essential advantages of the SRPT principle", } @ARTICLE{Ozaw90:Alternating, AUTHOR="T. Ozawa", TITLE="Alternating service queues with mixed exhaustive and K-limited services", JOURNAL=pe, VOLUME=11, NUMBER=3, PAGES="165-175", YEAR=1990, REFERENCES=20, KEYWORDS="Queueing system; polling; exhaustive service", ANNOTE={A single server model with two queues is analyzed. The service discipline used in one queue is "exhaustive" and that in the other queue is K-limited.}, } @ARTICLE{Kauf90:Approximate, AUTHOR="J. S. Kaufman and Wai-Choong Wong", TITLE="Approximate analysis of a cyclic queuing network with applications to a simultaneous resource posession problem", JOURNAL=pe, VOLUME=11, NUMBER=3, PAGES="187-200", YEAR=1990, REFERENCES=7, KEYWORDS="Closed queueing network", } @ARTICLE{Scho90:Open, AUTHOR="Frederik Carel Schoute", TITLE="Open-loop versus closed-loop control of processor loading", JOURNAL=pe, VOLUME=11, NUMBER=3, PAGES="201-208", YEAR=1990, REFERENCES=5, KEYWORDS="Queueing system; overload control; SPC", } @ARTICLE{Dall90:Approximate, AUTHOR="Y. Dallery", TITLE="Approximate analysis of general open queuing networks with restricted capacity", JOURNAL=pe, VOLUME=11, NUMBER=3, PAGES="165-175", YEAR=1990, REFERENCES=43, KEYWORDS="Open queueing network; finite capacity; performance", ANNOTE="We consider an open queueing network having general service time distributions. The total number of customers simultaneously in the network cannot exceed the capacity of the network.", } @INPROCEEDINGS{Gree90:Unboundedly, AUTHOR="A. G. Greenberg and B. D. Lubachevsky and I. Mitrani", TITLE="Unboundedly parallel simulations via recurrence relations", BOOKTITLE="Conference on Measurement and Modeling", ADDRESS="Boulder, Colorado", PAGES="1-12", YEAR=1990, REFERENCES=31, KEYWORDS="Distributed simulation", ANNOTE="Abandoning the distributed event list approach, the simulation problem is posed using recurrence relations. We bring three algorithmic ideas to bear on parallel simulation: parallel prefix computation, parallel merging, and iterative folding.", } @ARTICLE{Bind90:Atmospheric, AUTHOR="B. Binder and P. S. Yu and J. Shapiro", TITLE="An Atmospheric Optical Ring Network", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=1, PAGES="74-81", YEAR=1990, KEYWORDS="Optical switching; ring network", ANNOTE="An experimental 10 Mbits/s token-ring local area network that uses atmospheric optical communication links is described. Objektive and subjektiveve performance results are reported for operation over a 170m-long outdoor path. These data support the following hypoteses. Atmospheric optical communications may find LAN applications as bridges between buildings containing cable subnetworks or as temporary quick-connects for new outlying hosts", } @ARTICLE{Chen90:Addressing, AUTHOR="M.-S. Chen and Kang G. Shin and D. Kandlur", TITLE="Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors", JOURNAL=ieeetc, VOLUME="C-39", NUMBER=1, PAGES="10-18", YEAR=1990, KEYWORDS="Multiprocessor system; routing algorithm; interconnection", ANNOTE="A family of 6-regular graphs, called is considered as a multiprocessor interconnection network. Processing nodes on the periphe ry of an H-mesh are first wrapped around to achieve regularity and homogeneity. The diameter of a wrapped $H$-mesh is shown to be of $O(p)$, where $p$ is the number of nodes in the $H$-mesh. An elegant, distributed routing scheme is developeds for wrapped $H$-meshesso that each node in an H-mesh can compute shortes paths from", } @ARTICLE{Choi90:Adaptive, AUTHOR="M. H. Choi and C. M. Krishna", TITLE="An Adaptive Algorithm to Ensure Differential Service in a Token-Ring Network", JOURNAL=ieeetc, VOLUME="C-39", NUMBER=1, PAGES="19-33", YEAR=1990, KEYWORDS="LAN; token ring; voice/data integration", ANNOTE="We present a distributed and adaptive token-passing algorithm which can be used to maintain the values of a designated performance parameter at the hosts of a token-ring network at a prescribed ratio. The algorithm is simple to implement. We demonstrate its application in keeping the mean waiting times at the varioushosts in a prespecified ratio, in maintaining a designated throughput differential between different classes of customer.", } @ARTICLE{Chou90:Synchronizing, AUTHOR="Chien-Chun Chou and I. Cido and I. Gopal and Shmuel Zaks", TITLE="Synchronizing Asynchronous Bounded Delay Networks", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=2, PAGES="144-147", YEAR=1990, KEYWORDS="Communication network; synchronization", ANNOTE="An efficient way to synchronize an asynchronous network with a bounded delay message delivery is presented. Two types of synchronization algorithms are presented. Both types require an initializing phase that costs messages. The first requires an additional bit in every message and increases the time complexity by a factor of 2. The second does not require any additional bits but increases the time complexity by a factor of 3.", } @ARTICLE{Fdid90:Semaphore, AUTHOR="S. Fdida and Harry Perros and A. Wilk", TITLE="Semaphore Queues: Modeling Multilayered Window Flow Control Mechanisms", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=3, PAGES="309-317", YEAR=1990, KEYWORDS="Packet switching; flow control; queueing network", ANNOTE="We present an open queueing network for analyzing multilayered window flow control mechanisms consisting of different subnetworks. The number of customers in each subnetwork is controlled by a seaphore queue. The queueing network is analyzed approximately using decomposition and aggregation. The approximation was validated against exact numerical and simulation data, and it was found to have an acceptable relative error.", } @ARTICLE{Ganz90:Linear, AUTHOR="A. Ganz and I. Chlamtac", TITLE="A Linear Solution to Queueing Analysis of Synchronous Finite Buffer Networks", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=4, PAGES="440-446", YEAR=1990, KEYWORDS="Queueing network; finite buffer", ANNOTE={We present an approximate solution to slotted communication system with finite population and finite buffer capacity. As in the past we assume symmetric system and present for the first time a "linear" solution involving linear equations whose number is a linear function of the total buffer capacity. We show that the presented model can be applied to existing multiaccess channel protocols in which a single successful transmission can per slot.}, } @ARTICLE{Keil90:Distributed, AUTHOR="Julian Keilson and L. D. Servi", TITLE="A Distributed Poisson Approximation for Preempt-Resume Clocked Schedules", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=2, PAGES="192-198", YEAR=1990, KEYWORDS="Queueing system; preemptive resume queue", ABSTRACT="Many telecommunication systems with time-critical requirements use a preempt-resume clocked schedule. An approximation to the ergodic distribution of the time to completion of a low-priority task is obtained by treating the priority service time distribution as the limit of compound Poisson distributions. Explicit formulae for the mean and variance are given which are highly accura", } @ARTICLE{Lim90:Markovian, AUTHOR="Jae Lim and S. M. Meerkov", TITLE="Performance of Markovian Access Protocols in Satellite Channels", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=3, PAGES="273-276", YEAR=1990, KEYWORDS="Access control; satellite communication", ABSTRACT="In this note, the theory developed in (1) is extended to channels with long propagation delays. Specifically, the performance characteristics of Markovian access control protocols in satellite channels are evaluated. In particular, it is shown that the channel propagation delay may lead to improvements in systems's behavior, to elimination of the saturation effects and to stabilization of the network in a steady state with relatively high chara", } @ARTICLE{Mats90:Effect, AUTHOR="Y. Matsumoto and Yutaka Takahashi and Toshiharu Hasegawa", TITLE="The Effect of Packet Size Distribution on Output and Delay Processes of {CSMA/CD}", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=2, PAGES="199-214", YEAR=1990, KEYWORDS="Lan; csma/cd", ANNOTE="In this paper, an unslotted model of the nonpersistent CSMA/CD protocol is considered an the effect of different packet size dis tribution functions on the system performance is investigated. Under the assumption that packet sizes obey a general distribution function, an exact analysis of the oacket output process on the CSMA/CD channel and the packet delay process at each homogeneous station is presented.", } @ARTICLE{Mats90:Probability, AUTHOR="Y. Matsumoto and Yutaka Takahashi and H. Toshiharu", TITLE="Probability Distribution of Interdeparture Time and Response Time in Multipacket {CSMA/CD} System", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=1, PAGES="54-66", YEAR=1990, KEYWORDS="LAN; CSMA/CD; performance evaluation; analysis", ANNOTE="Carrier-sense multiple access with collision detection is well know as a simple and efficient random access communication protocol in local area networks. In this paper, we present an exact analysis of an asynchronous multipacket CSMA/CD-DFT model and derive 1) the Laplace-Stieltjes transform of the probability distribution function of the pacet interdeparture time, 2) the LST of the pdf of the message interdeparture time, .", } @ARTICLE{Rayc90:Dynamic, AUTHOR="D. Raychuadhuri and J. Harmon", TITLE="Dynamic Performance of {ALOHA-Type} {VSAT} Channels: a simulation study", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=2, PAGES="251-259", YEAR=1990, KEYWORDS="Access control; satellite communication; ALOHA; simulation; performance evaluation", ABSTRACT={This paper presents a simulation study of the dynamic behavior of ALOHA-type protocols used in interactive-data very small aperture terminal networks. A simulation model for quantitative evaluation of random access channel stability in terms of the transient response to a traffic overload pulse is described and the usefulness of a single performance measure defined as "backlog fall time" is established.}, } @ARTICLE{Stav90:Approximation, AUTHOR="I. Stavrakakis and D. Kazakos", TITLE="On the Approximation of the Output Process of Multiuser Random-Access Communication Networks", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=2, PAGES="172-178", YEAR=1990, KEYWORDS="Communication network; access control; output process", ANNOTE="In this paper, Bernoulli and first-order Markov processes are used to approximate the output process of a class of slotted multiuser random-access communication networks. The output process is defined to be the process of the successfully transmitted packets within the network.", } @ARTICLE{Yabu90:Approximate, AUTHOR="M. Yabusaki and Shuji Suzuki", TITLE="Approximate Performance Analysis and Simulation Study for Variable-Channel-Per-Burst {SS-TDMA}", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=3, PAGES="318-326", YEAR=1990, KEYWORDS="burst switching; performance evaluation; simulation", ABSTRACT="This paper analyzes traffic performance of a variable-channel-per-burst satellite-switched TDMA which dynamically reconfigures traffic bursts. An SS-TDMA system with an onboard baseband switch is used as the VCPB application system. Bursts are assigned to each earth station one-by-one. Idle channels of other bursts are transferred to a burst having an insufficient number of idle channels by reconfiguration on a call-by-call basis.", } @ARTICLE{Grav90:Geo, AUTHOR="A. Gravey and Jean Raymond Louvion and P. Boyer", TITLE="On the Geo/D/1 and Geo/D/1/n queues", JOURNAL=pe, VOLUME=11, NUMBER=2, PAGES="117-125", YEAR=1990, REFERENCES=13, KEYWORDS="ATM; queueing system; GEO/D/1; GEO/D/1/N; waiting time", ANNOTE="A discrete-time single server FIFO queue with Bernoulli arrivals and deterministic service times is studied.", } @ARTICLE{Lee90:Modular, AUTHOR="T. T. Lee", TITLE="A modular architecture for very large packet switches", JOURNAL=ieeecom, VOLUME=38, NUMBER=7, PAGES="1097-1106", YEAR=1990, REFERENCES=23, KEYWORDS="ATM; packet switching; switching network; modular", } @ARTICLE{Li90:Nonuniform, AUTHOR="Song Li", TITLE="Nonuniform traffic analysis on a nonblocking space-division packet switch", JOURNAL=ieeecom, VOLUME=38, NUMBER=7, PAGES="1085-1097", YEAR=1990, REFERENCES=10, KEYWORDS="ATM; packet switching; queueing system; GEO/PH/1; analysis", ANNOTE="This paper studies the nonuniform traffic performance on a nonblocking space division packet switch. When an output link is simultaneously contended by multiple input packets, only one can succeed and the rest will be buffered in the queues associated witheach input link. Given the condition that the traffic on each output is not dominated by individual inputs, our study indicates that the output contention involved by packets.", } @ARTICLE{Ding90:Local, AUTHOR="W. Ding and F. Schreiber", TITLE="Local correlation properties of random sequences generated by queueing system {M/M/1}", JOURNAL=aeu, VOLUME=44, NUMBER=5, PAGES="384-389", YEAR=1990, REFERENCES=18, KEYWORDS="Queueing system; M/M/1; output process; correlation", } @INPROCEEDINGS{Garc90:Priorities, AUTHOR="J. L. Garcia and O. Casals", TITLE="Priorities in {ATM} networks", BOOKTITLE="NATO advanced research workshop architecture and performance", ADDRESS="Sophia Antipolis, France", PAGES=10, YEAR=1990, REFERENCES=8, KEYWORDS="ATM; queueing system; priority; MMPP; performance; fast packet switching; space priorities", ANNOTE="In this paper we develop an exact model to evaluate the benefits of using space priorities in an ATM network when the traffic source is bursty. The buffer mechanism modelled is the partial buffer sharing. The bursty source chosen is a Markov modulated Poisson process.", } @ARTICLE{Mark90:Simple, AUTHOR="Z. Markov", TITLE="A simple way for variance reduction of measured loss in teletraffic simulation", JOURNAL=aeu, VOLUME=44, NUMBER=5, PAGES="399-401", YEAR=1990, REFERENCES=5, KEYWORDS="Simulation; output analysis; variance reduction", ANNOTE="The limitation of one random variable causes the variance reduction of the other (dependent) random variable. This fact is used, in a simple adaptation of the known teletraffic simulation roulette method, to reduce the variance of the measured loss of calls.", } @ARTICLE{Nowi90:Analyse, AUTHOR="K. Nowicki and T. Uhl", TITLE="Analyse des Abgangsprozesses im M/G/1-Bulk-System", JOURNAL=aeu, VOLUME=44, NUMBER=5, PAGES="377-383", YEAR=1990, LANGUAGE="German", REFERENCES=9, KEYWORDS="Queueing system; Mx/G/1; output process; bulk system", } @INPROCEEDINGS{Sole90:Traffic, AUTHOR="J. Sole and J. Domingo and J. L. Garcia", TITLE="Traffic burstiness influence on {ATM} switching behavior", BOOKTITLE="4th International Conference on Data Communications and their Applications", ADDRESS="Barcelona, Spain", PAGES="133-147", YEAR=1990, REFERENCES=9, KEYWORDS="ATM; traffic source model; burstiness; switching block", ANNOTE="In this paper we present a study of switching blocks behaviour with bursty cell streams.", } @ARTICLE{Dupu90:NEST, AUTHOR="A. Dupuy and J. W. Schwartz and Y. Yemini and David F. Bacon", TITLE="{NEST:} a network simulation and prototyping testbed", JOURNAL=cacm, VOLUME=33, NUMBER=10, PAGES="63-74", YEAR=1990, REFERENCES=14, KEYWORDS="Simulation; communication network; protocol engineering", ANNOTE="NEST is a graphical environment for simulation and rapid prototyping of distributed networked systems and protocols.", } @ARTICLE{Fuji90:Parallel, AUTHOR="R. M. Fujimoto", TITLE="Parallel discrete event simulation", JOURNAL=cacm, VOLUME=33, NUMBER=10, PAGES="30-53", YEAR=1990, REFERENCES=98, KEYWORDS="Distributed simulation; survey; time warp", ANNOTE="This is a survey of the problems and current state of the in the field.", } @ARTICLE{Glyn90:Likelihood, AUTHOR="P. W. Glynn", TITLE="Likelihood ratio gradient estimation for stochastic systems", JOURNAL=cacm, VOLUME=33, NUMBER=10, PAGES="75-84", YEAR=1990, REFERENCES=18, KEYWORDS="Simulation; optimization; sensitity analysis", } @ARTICLE{LEcu90:Random, AUTHOR="P. L'Ecuyer", TITLE="Random numbers for simulation", JOURNAL=cacm, VOLUME=33, NUMBER=10, PAGES="85-97", YEAR=1990, REFERENCES=101, KEYWORDS="RNG; RVG; survey; method", ANNOTE="This paper gives a survey of the pros and cons of pseudo-RNGs", } @ARTICLE{Ciar90:Performability, AUTHOR="G. Ciardo and Raymond Marie and B. Sericola and K. S. Trivedi", TITLE="Performability analysis using semi-Markov reward process", JOURNAL=ieeetc, VOLUME="C-39", NUMBER=10, PAGES="1251-1264", YEAR=1990, REFERENCES=23, KEYWORDS="Reliability; performability; graceful degradation", ABSTRACT="Fault tolerance and degradable performance has given rise to considerable interest in models for the combined evaluation of performance and reliability. Beaudry [1] proposed a simple method. First we generalize the method to semi-Markov reward process. Second, we remove the restriction requiring the association of zero award to absorbing states only. We illustrate the approach with three interesting applications.", } @ARTICLE{Garc90:Discrete, AUTHOR="M. Garcia", TITLE="Discrete event simulation", JOURNAL=sigsim, VOLUME=21, PAGES="3-13", YEAR=1990, REFERENCES=21, KEYWORDS="Simulation; discrete event simulation; discrete event", ABSTRACT="This overview on discrete event simulation discusses modeling and its role in leading to a understanding of DES, a process for developing models and simulations, mathematical framework to DES.", } @MASTERSTHESIS{Sack90:Verteilte, AUTHOR="F. Sackmann", TITLE="Verteilte Simulation diskreter Ereignisysteme: Parallele Simulation von Teiltests auf einem Parallelrechnersystem (Transputersystem)", TYPE="Diplomarbeit", SCHOOL="Lehrstuhl für Informatik VII, IMMD", ADDRESS="Erlangen, Germany", YEAR=1990, LANGUAGE="German", REFERENCES=44, KEYWORDS="Simulation; discrete event simulation; output analysis", ANNOTE="In der Arbeit wurde ein Ansatz zur Parallelisierung von Simulationen (Statistische Lastteilung) verwirklicht, beidem die einzelnen Teiltests eines Simulationslaufes parallel auf den Prozessoren eine Multiprozessorsystems (Transputersystem) ausgeführt werden.", } @ARTICLE{Dori90:Erzeugung, AUTHOR="H. Döring", TITLE="Erzeugung normalverteilter Zufallsszahlen mit {16-bit-PC}", JOURNAL=nte, ADDRESS="Berlin, Germany", VOLUME=40, NUMBER=8, PAGES="306-309", YEAR=1990, LANGUAGE="German", REFERENCES=6, KEYWORDS="Normal Distribution; Random Number; Comparison; Pascal; PC", } @ARTICLE{Sche90:Cut, AUTHOR="R. Schehrer", TITLE="On a Cut-Off Priority Delay-Loss System with Hysteresis", JOURNAL=aeu, VOLUME=44, NUMBER=5, PAGES="390-398", YEAR=1990, REFERENCES=22, KEYWORDS="cut-off priority; delay loss model; overload control", } @INPROCEEDINGS{Scho90:Strategies, AUTHOR="W. Schödl and M. Tangemann", TITLE="Strategies for Interconnection {HSLANs} to {BISDN} and their Performance", BOOKTITLE="10th International Conference on Computer Communication", YEAR=1990, REFERENCES=21, KEYWORDS="BISDN; HSLAN; performance evaluation; Comparison", } @ARTICLE{Ajmo90:GSPN, AUTHOR="Marco {Ajmone Marsan} and S. Donatelli and F. Neri", TITLE="{GSPN} models of Markovian multiserver multiqueue systems", JOURNAL=pe, VOLUME=11, NUMBER=4, PAGES="227-240", YEAR=1990, REFERENCES=18, KEYWORDS="Queueing system; queueing theory; polling; GSPN; generalized stochastic Petri net", ANNOTE="Exact results for mean waiting times.", } @ARTICLE{Cros90:Product, AUTHOR="S. Crosby and A. Krzesinski", TITLE="Product form solutions for multiserver centres with concurrent classes of customers", JOURNAL=pe, VOLUME=11, NUMBER=4, PAGES="265-282", YEAR=1990, REFERENCES=8, KEYWORDS="Queueing network; product form; BCMP", } @ARTICLE{Rose90:Exponential, AUTHOR="C. Rosenberg and R. Mazumdar and L. Kleinrock", TITLE="On the analysis of exponential queuing systems with randomly changing arrival rates: stability conditions and finite buffer scheme with a resume level", JOURNAL=pe, VOLUME=11, NUMBER=4, PAGES="283-292", YEAR=1990, REFERENCES=14, KEYWORDS="Queueing system; single server; arrival process", ANNOTE="Random fluctuations in the arrival rate are considered.", } @ARTICLE{Harr90:Representation, AUTHOR="P. G. Harrison and N. M. Patel", TITLE="The representation of multistage interconnection networks in queuing models of parallel systems", JOURNAL=jacm, VOLUME=37, NUMBER=4, PAGES="863-898", YEAR=1990, REFERENCES=28, KEYWORDS="Closed queueing network; crossbar; delta network; flow", ANNOTE="This paper considers analytical models of asynchronous, circuit-switched INs in which partial paths are held during path building, beginning with a single crossbar and extending recursivelyto MINs. Since a path must be held between source and destination processors before data can be transmitted, switching networks are passive resources and queueing networks that include them do not therefore have product-form solutions.", } @ARTICLE{Gora90:ASN, AUTHOR="W. Gora", TITLE="{ASN.1} Stand und Trends", JOURNAL=datacom, VOLUME=2, PAGES="114-122", YEAR=1990, LANGUAGE="German", KEYWORDS="ASN.1; abstract syntax notation one; survey", ANNOTE="In dem Artikel werden die wichtigsten Eigenschaften von ASN.1 kurz vorgestellt, sowie auf die Erweiterungen von X.208 ueberblickartig eingegangen.", } @MISC{Spaf90:Computer, AUTHOR="Eugene Spafford and Kathleen A. Heaphy and David J. Ferbrache", TITLE="Computer Viruses: Dealing with Electronic Vandalims and Programmed Threats", PUBLISHER="ADAPSO", YEAR=1990, } @ARTICLE{Chan90:Distributed, AUTHOR="Rajan G. Chandras", TITLE="Distributed Message Passing Operating Systems", JOURNAL=acmosrev, VOLUME=24, NUMBER=1, PAGES="7-17", YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Lore90:IPwatch, AUTHOR="Mark J. Lorence and M. Saryanarayanan", TITLE="{IPwatch:} A Tool for Monitoring Network Locality", JOURNAL=acmosrev, VOLUME=24, NUMBER=1, PAGES="58-80", YEAR=1990, KEYWORDS="Network Management", } @ARTICLE{Benn90:Experience, AUTHOR="John K. Bennett", TITLE="Experience with Distributed Smalltalk", JOURNAL=spe, VOLUME=20, NUMBER=2, PAGES="157-180", YEAR=1990, KEYWORDS="Distributed Programming", } @BOOK{Rose90:Open, AUTHOR="Marshall T. Rose", TITLE="The Open Book: A practical perspective on {OSI}", ISBN="0-13-643016-3", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1990, ANNOTE="A detailed examination of the OSI protocols from the implementor's perspective.", } @MISC{Must90:Multicast, AUTHOR="Ed. Mustaque", TITLE="Multicast Communication in Distributed Systems", PUBLISHER="IEEE", YEAR=1990, } @MISC{Holz90:Validation, AUTHOR="Gerard J Holzmann", TITLE="Design and Validation of Computer Protocols", PUBLISHER="Prentice Hall", YEAR=1990, } @ARTICLE{Stra90:Information, AUTHOR="D. W. Straub and Cynthia Mathis Beath", TITLE="Information Delivery Systems in the 1990's: The Local Integrated Knowledge Network {(LINKNET)}", JOURNAL="Data Base", PUBLISHER="Acm sigbdp", VOLUME=21, NUMBER=1, PAGES="30-40", YEAR=1990, } @ARTICLE{Spez90:Concurrent, AUTHOR="G. Spezzano and D. Talia and M. Vanneschi", TITLE="A Concurrent Programing Support for Distributed Systems", JOURNAL=comp_sys, PUBLISHER="Usenix assoc.", VOLUME=3, NUMBER=3, PAGES="423-448", YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Wagn90:Distributed, AUTHOR="Bernhard Wagner", TITLE="Distributed Spooling in a Heterogeneous Environment", JOURNAL=comp_sys, PUBLISHER="Usenix assoc.", VOLUME=3, NUMBER=3, PAGES="449-478", YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Brac90:Simulation, AUTHOR="B. J. Brachman and S. T. Chanson", TITLE="A Simulation Study of Application Level Message Transfer Using Message Streams", JOURNAL=cnis, VOLUME=19, NUMBER=2, PAGES="79-94", YEAR=1990, KEYWORDS="Applications", } @ARTICLE{Gibs90:IEEE, AUTHOR="R. W. Gibson", TITLE="{IEEE} 802 Standards Efforts", JOURNAL=cnis, VOLUME=19, NUMBER=2, PAGES="95-104", YEAR=1990, KEYWORDS="LANs", } @ARTICLE{Ness90:Terminal, AUTHOR="D. M. Nessett and G. Lee", TITLE="Terminal Services in Heterogeneous Distributed Systems", JOURNAL=cnis, VOLUME=19, NUMBER=2, PAGES="105-128", YEAR=1990, KEYWORDS="Applications", } @ARTICLE{Brun90:Receiver, AUTHOR="H. Bruneel and J. De Vriendt and C. Ysebaert", TITLE="Receiver Buffer Behavior for the Selective-Repeat {ARQ} Protocol", JOURNAL=cnis, VOLUME=19, NUMBER=2, PAGES="129-142", YEAR=1990, KEYWORDS="ARQ", } @ARTICLE{Mura90:Control, AUTHOR="Kurenai Murakami and M. Katoh", TITLE="Control Architecture for Next-Generation Communication Networks Based on Distributed Databases", JOURNAL=ieeejsac, VOLUME=7, NUMBER=3, PAGES="418-423", YEAR=1990, } @ARTICLE{Gbur90:Note, AUTHOR="P. Gburzynski and P. Rudnicki", TITLE="A Note on the Performance of {ENET} {II}", JOURNAL=ieeejsac, VOLUME=7, NUMBER=3, PAGES="424-426", YEAR=1990, } @ARTICLE{Moll90:Comments, AUTHOR="M. K. Molloy", TITLE="Comments on {``A} Note on the Performance of {ENET} {II''}", JOURNAL=ieeejsac, VOLUME=7, NUMBER=3, PAGES="427-430", YEAR=1990, } @ARTICLE{Gadr90:COS, AUTHOR="J. Gadre and C. Rohrer and C. Summers and S. Symington", TITLE="A {COS} Study of {OSI} Interoperability", JOURNAL="Computer Standards and Interfaces", VOLUME=9, NUMBER=3, PAGES="217-238", YEAR=1990, KEYWORDS="OSI", } @ARTICLE{Rama90:Terrestrial, AUTHOR="Ravi Ramaswamy", TITLE="Design of terrestrial/satellite computer communication networks using Slotted {ALOHA} and {SS/TDMA} satellite systems", JOURNAL="Space Communications - International Journal", VOLUME=7, PAGES="139-154", YEAR=1990, KEYWORDS="Network Design", ABSTRACT="With the rate of growth of packet-switched computer communication networks, the future networks are expected to comprise hundreds or thousands of packet switching nodes. In view of the network design and computational time requirements, ultimately the topological design complexity of such large-scale computer communication networks would grow exponentially with the size of the network. Therefore, efficient procedures for the design and operation of large-scale computer communication networks are required. In this paper, a multi-level hierarchial approach is presented for the topological design of a large-scale computer communication network using terrestrial and Slotted ALOHA and Satellite Switched SS/TDMA satellite with terrestrial or mixed-media systems. In this paper, for a given set of packet switching nodal locations, the nodes are initially decomposed into an M-level Hierarchial Clustering (MHC) structure Then, an M-level Hierarchial Topological (MHT) structure is formed over the above MHC structure. Finally, an M-level Hierarchical Routing (MHR) scheme is presented for routing the messages between any source-destination node-pair. Also, an expression for the average time delay of a message in an M-level hierarchically clustered and topologically structured terrestrial and satellite computer communication network is given.", } @MISC{Kong90:Computing, AUTHOR="M. Kong and T. Dineen and P. J. Leach and E. Martin and N. Mishkin and J. Pato and G. Wyant", TITLE="Network Computing System Reference Manual", PUBLISHER="Prentice Hall", PAGES=416, YEAR=1990, } @MISC{Misr90:Business, AUTHOR="J. Misra and Byron Belitsos", TITLE="Business Telecommunications: concepts, technologies and cases in telematics", PUBLISHER="Richard D. Irwin, Inc.", ADDRESS="Homewood, Illinois", PAGES=532, YEAR=1990, } @BOOK{Stev90:UNIX, AUTHOR="W. Richard Stevens", TITLE="{UNIX} Network Programming", ISBN="0-13-949876-1", PUBLISHER="Prentice Hall", YEAR=1990, KEYWORDS="Unix; operating systems; network programming", } @MISC{Tane90:Amoeba, AUTHOR="A. S. Tanenbaum and others", TITLE="The Amoeba Distributed Operating System", YEAR=1990, URL="ftp://midgard.ucsc.edu/", } @ARTICLE{Arno90:Economics, AUTHOR="Richard Arnott and Andre de Palma and Robin Lindsey", TITLE="Economics of a Bottleneck", JOURNAL="Journal of Urban Economics", VOLUME=27, PAGES="111-130", YEAR=1990, } @ARTICLE{MacK90:Optional, AUTHOR="Jeffrey MacKie-Mason", TITLE="Optional Time-of-Use Pricing Can be Pareto Superior or Pareto Inferior", JOURNAL="Economics Letters", VOLUME=33, YEAR=1990, } @TECHREPORT{Kahi90:Commericalization, AUTHOR="Brian Kahin", TITLE="Commericalization of the {Internet}", INSTITUTION="JFK School, Harvard University", NOTE="Report from Workshop held March 1--3, 1990", YEAR=1990, } @ARTICLE{Mend90:Optimal, AUTHOR="H. Mendelson and S. Whang", TITLE="Optimal Incentive-Compatible Priority Pricing for the {M/M/1} Queue", JOURNAL=or, VOLUME=38, PAGES="870-883", YEAR=1990, } @ARTICLE{Omur90:Novel, AUTHOR="J. K. Omura", TITLE="Novel Applications of Cryptography in Digital Communication", JOURNAL=ieeecm, VOLUME=28, NUMBER=5, PAGES="21-29", YEAR=1990, } @ARTICLE{Kauc90:Aspects, AUTHOR="E. Kaucher and Carsten Schulz-Rinne", TITLE="Aspects of self-validating numerics in Banach spaces", JOURNAL="Computer Arithmetic and Self-Validating Numerical Methods", PAGES="269-299", YEAR=1990, KEYWORDS="Banach spaces; numerical mathematics; differential equation; PDE", ABSTRACT="Self-validating methods for two typical classes of partial differential equations are discussed. In the first part implicit formulas for solutions to systems of first order quasilinear PDEs with initial and boundary conditions are developed. The goal is to find expressions suitable for highly parallel computation, in connection with E-verification. The achievable degree of parallelism depends essentially on the type of the PDEs. The systems of PDEs are transformed into a system of algebraic and/or ordinary differential equations which are expanded in the space coordinates. Hence, the original problem may be solved numerically or functionally in parallel for different space coordinates. Furthermore, there exists powerful E-methods for algebraic systems as well as for functoid systems and systems of ODEs. Therefore, the E-verified numerical solution of the PDEs treated in this paper is possible. In the second part, we discuss some iterative functoid processes for the validated computation of parabolic PDEs with initial and boundary conditions. Theoretical background are the W-principles referred to in Walter which together with interval functoids deliver so-called exclusion sets for solutions.", } @ARTICLE{Yang90:Integrated, AUTHOR="Oliver Yang and J. W. Mark", TITLE="Performance analysis of integrated services on a single server system", JOURNAL=pe, VOLUME=11, NUMBER=2, PAGES="79-92", YEAR=1990, REFERENCES=15, KEYWORDS="Queueing system; priority; correlation; analysis; vacation time", } @BOOK{Knut90:TeX, AUTHOR="D. E. Knuth", TITLE="The TeX-Book (revised)", PUBLISHER="Addison Wesley", ADDRESS="Reading, Mass.", YEAR=1990, KEYWORDS="Text processing", } @ARTICLE{Uhl90:New, AUTHOR="T. Uhl and B. Müller-Clostermann", TITLE="Performance analysis of a new network access flow control method in computer communication networks", JOURNAL=ett, VOLUME=1, NUMBER=3, PAGES="247-255", YEAR=1990, REFERENCES=24, KEYWORDS="Packet switching; flow control; performance evaluation", ANNOTE="A new flow control rule for the network access level is introduced and its performance is investigated. The rule is based on measurements of the temporal changes of the traffic intensity. The admission of arriving local packets to a node is regulated dependent on the variations of local and transit traffic and the loadin the neighbouring nodes. The objective of the new rule is to maximize the power for transit packets.", } @INPROCEEDINGS{Rath90:Policing, AUTHOR="Erwin P. Rathgeb and T. H. Theimer", TITLE="The policing function in {ATM} networks", BOOKTITLE=iss, ADDRESS="Stockholm", YEAR=1990, REFERENCES=8, KEYWORDS="ATM; source policing; policing function; performance evaluation", } @ARTICLE{Stre90:Moment, AUTHOR="J. C. Strelen", TITLE="Moment analysis for closed queuing networks and its linearizer", JOURNAL=pe, VOLUME=11, NUMBER=2, PAGES="127-142", YEAR=1990, REFERENCES=37, KEYWORDS="Closed queueing network; queueing theory; MVA; multiclass queueing network; approximation", ANNOTE="Mean value analysis is further developed to become 'moment analysis', a recursive evaluation scheme for moments of the queue lengths and customers' sojourn times at FCFS centers.", } @ARTICLE{Bacc90:Execution, AUTHOR="François Baccelli and Z. Liu", TITLE="On the execution of parallel programs on multiprocessor systems - a queuing theory approach", JOURNAL=jacm, VOLUME=37, NUMBER=2, PAGES="373-414", YEAR=1990, REFERENCES=44, KEYWORDS="Multiprocessor system; queueing network; scheduling; performance evaluation", ABSTRACT="The new class of queueing models, called Synchronized Queueing Networks, is proposed for evaluating the performance of multiprogrammed and multitasked multiprocessor systems, where workloads consist of parallel programs of similar structure and where the scheduling discipline is FIFO.", } @ARTICLE{Rhee90:ATM, AUTHOR="Jaap van der Rhee and Frederik Carel Schoute", TITLE="{ATM} capacity modelling", JOURNAL=ptr, VOLUME=48, NUMBER=2, PAGES="24-32", YEAR=1990, REFERENCES=8, KEYWORDS="ATM; traffic source model; connection admission control", } @TECHREPORT{Hubn90:Finite, AUTHOR="F. Hübner", TITLE="Analysis of a finite capacity asynchronous multiplexer with periodic sources", INSTITUTION="Universität Würzburg, Inst. für Imformatik", ADDRESS="Würzburg, Germany", VOLUME=14, PAGES=13, YEAR=1990, REFERENCES=13, KEYWORDS="ATM; queueing system; discrete time; traffic source model; performance evaluation", } @ARTICLE{Lim90:Delay, AUTHOR="Y. Lim and John Kobza", TITLE="Analysis of a delay-dependent priority discipline in a integrated multiclass traffic fast packet switch", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=5, PAGES="659-665", YEAR=1990, REFERENCES=12, KEYWORDS="Queueing system; HOL priority; single server", ANNOTE="A dynamic packet transmission priority discipline, head-of-the-line with priority jumps, is proposed and analyzed. It is shown that it can make the tail probabilities for the different service classes approximately the same.", } @ARTICLE{Bono90:Adaptive, AUTHOR="F. Bonomi and A. Kumar", TITLE="Adaptive optimal load balacing in a nonhomogeneous multiserver system with a central job scheduler", JOURNAL=ieeetc, VOLUME="C-39", NUMBER=10, PAGES="1232-1250", YEAR=1990, REFERENCES=25, KEYWORDS="Queueing system; multiserver; load balancing", ANNOTE="Multiserver system with individual queues. Additionally a general stream of jobs allocated by a job scheduler.", } @ARTICLE{Dasc90:Uberlaststrategien, AUTHOR="B. Dasch", TITLE="Überlaststrategien in der Paketvermittlung am Beispiel des Systems {EWSP} / Congestion control strategies in packet switching networks examined on the system {EWSP}", JOURNAL=aeu, VOLUME=44, NUMBER=2, PAGES="153-159", YEAR=1990, LANGUAGE="German", REFERENCES=2, KEYWORDS="Overload control; packet switching; switching system", } @TECHREPORT{Tran90:CRMA, AUTHOR="P. Tran-Gia and R. Dittmann", TITLE="Performance Analysis of the {CRMA-Protocol} in High-Speed Networks", INSTITUTION="Institute of Computer Science, University of Würzburg", ADDRESS="Würzburg, Germany", NUMBER=23, PAGES=20, YEAR=1990, REFERENCES=13, KEYWORDS="LAN; MAN; performance evaluation; protocol simulation; high speed; G/G/1; M/G/1", ANNOTE="In this paper a performance analysis of the CRMA (=cyclic reservation multiple access) medium access protocol is presented. The CRMA scheme is proposed as an access mechanism for high-speed LANs and MANs. An approximate computational method is derived to obtain the distribution functions of performance measures of interest like the medium access delay in conjunction with G/G/1 queue with feedback and a M/G/1 queue with server vacation.", } @ARTICLE{Boes90:Least, AUTHOR="F. T. Boesch and A. Satyanarayana and C. L. Suffel", TITLE="Least reliable networks and the reliability domination", JOURNAL=ieeecom, VOLUME=38, NUMBER=11, PAGES="2004-2009", YEAR=1990, KEYWORDS="Communication network; reliability; graph model; graph theory", ANNOTE="A well-know model in communication network reliability consists of an undirected graph whose edges operate independently with the same probability.", } @ARTICLE{Chem90:Integrated, AUTHOR="Prosper Chemouil and J. Filipiak", TITLE="Integrated network management and control", JOURNAL=cnis, VOLUME=20, NUMBER="1-5", PAGES="143-153", YEAR=1990, KEYWORDS="Circuit switching; network management; routing; congestion control", ANNOTE="Circuit switched telephone networks start to be used as provide rs of transport services for intelligent networks with ISDN capabilities. From the traffic point of view this situation is quitenew. Traffic profiles in telephone networks are well predictable so that the network can be dimensioned at the design stage.", } @ARTICLE{Chen90:Noncoherently, AUTHOR="Chi-Ming Chen", TITLE="Performance analysis of a noncoherently combined large aperture optical heterodyne receiver", JOURNAL=ieeecom, VOLUME=38, NUMBER=7, PAGES="1013-1021", YEAR=1990, KEYWORDS="Communication system; performance evaluation", ANNOTE="The performance of a noncoherently combined, multiplemirror heterodyne receiver is analyzed. In the absence of atmospheric turbulence, the performance of the noncoherently combined receiver isshown to be inferior to that of a monolithic, diffraction-limi ted receiver with equivalent aperture area. When atmospheric turbulence is taken into consideration, however, the efficiency of a monolithie aperture heterodyne receiver is limited .", } @ARTICLE{Colo90:Asynchronous, AUTHOR="G. Colombo and C. Scarati and F. Settimo", TITLE="Asynchronous control algorithm for increasing the efficiency of three-stage connecting networks for multipoint services", JOURNAL=ieeecom, VOLUME=38, NUMBER=6, PAGES="898-905", YEAR=1990, KEYWORDS="Satellite radio; rearrangement; blocking; routing; multipoint connection", ANNOTE="This paper studies the problem of designing low complexity control algoreithms for controlling three-stage connecting networks with the objective of improving system performance, namely, blocking probability. The chosen approach is based on the theory of connecting networks and makes use of rearrangement algorithms. These algorithms are applicable to a number of environments, three of which are multipoint connections.", } @ARTICLE{Dall90:K, AUTHOR="W. J. Dally", TITLE="Performance analysis of $k$-ary $n$-cube interconnection networks", JOURNAL=ieeetc, VOLUME="C-39", PAGES="775-785", YEAR=1990, KEYWORDS="Interconnection network; performance evaluation", ANNOTE="This paper analyzes communication networks of varying dimension under the assumption of constant wire bisection. Expressions for the latency, average case throughput, and hot-spot throughput of $k$-ary n-cube networks with constant bisection are derived that agree closely with experimental measurements. It is shown that low-dimensional networks have lower latency and higher hot-spottroughput than high-dimensional networks with the same bisection", } @ARTICLE{Dand90:Hierarchical, AUTHOR="S. Dandamudi and D. L. Eager", TITLE="Hierarchical Interconnection Networks for Multicomputer Systems", JOURNAL=ieeetc, VOLUME="C-39", PAGES="786-797", YEAR=1990, KEYWORDS="Interconnection network", ANNOTE="This paper proposes the use of hierarchical interconnection networks to meet both these requirements. A performance analysis of a class of hierarchical interconnection networks is presented. This analysis includes both static analysis and queueing analy sis. In both cases, the hierarchical networks are shown to have better cost-benefit ratios. The queueing analysis is also validated by several simulation experiments.", } @ARTICLE{Good90:Cellular, AUTHOR="David J. Goodman", TITLE="Cellular packet communications", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=8, PAGES="1272-1280", YEAR=1990, KEYWORDS="Communication system; packet radio", ANNOTE="Celluar mobile radio and residential cordless telephones are twonew communication techniques with repidly growing public acceptance. Present products and services use first-generation technology based on analog voice transmission. Second-generation equipment, conforming to at least five different sets of standards, is on the drawing boards. Based on digital speech transmission.", } @ARTICLE{Haas90:Blazenet, AUTHOR="Z. Haas and D. R. Cheriton", TITLE="Blazenet: A packet-switched wide-are network with photonic data path", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=6, PAGES="818-829", YEAR=1990, KEYWORDS="WAN; packet switching; optical switching", ANNOTE="High-performance wide-area networks area required to interconn ect clusters of computers connected by local area and metropolitan area networks. Optical fiber technology provides long distance channels in the multigigabit per second range. The challenge is to provide switching nodes that handle these data rates with minimum delay, and at reasonable cost.", } @ARTICLE{Hage90:Rate, AUTHOR="C. E. Sundberg", TITLE="The performance of rate - compatible punctured convolutional codesfor digital mobile radio", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=7, PAGES="966-980", YEAR=1990, KEYWORDS="Mobile radio; coding theory; performance evaluation", ANNOTE="In many source coding schemes, the effect of a channel error varies significantly from one bit to another. Hence, to make the best available use of the limited channel coding redudancy, unequ al error protection is needed. In this paper, we study the unequal error protection capabilities of convolutional codes belongi ng to the family of rate-compatible punctured convolutional cod es.", } @ARTICLE{Jose90:Calculation, AUTHOR="K. Joseph", TITLE="Calculation of message length transition probabilities in selecti ve reject {ALOHA} channels", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=8, PAGES="1128-1132", YEAR=1990, KEYWORDS="Communication system; ALOHA; Poisson distribution; radio channel; throughput analysis", ANNOTE="A method is described for the exact calculation of message leng th transition probabilities in asynchronous selective reject ALOHA, channels with Poisson message arrivals. The formulas derivedare used for exact calculation of the throughput characteristicsof example SREJ-ALOHA channels which were previously analyzed using bounds or approximate methode.", } @ARTICLE{Kall90:Type, AUTHOR="Samir Kallel", TITLE="Analysis of a type {II} hybrid {ARQ} scheme with code combining", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=8, PAGES="1133-1137", YEAR=1990, KEYWORDS="Communication protocol; ARQ; coding theory; performance evaluation", ANNOTE="In this paper, we present an analysis of the selective-repeat type II hybrid ARQ scheme, using convolutional coding and exploiting code combining. With code combining, at successive decoding attempts for a data packet, the decoder for error correction operates on a combination of all received sequences for that packet, rather than only on the two most recent received ones as in theconventional type II hybrid ARQ scheme.", } @BOOK{Kanb90:ISDN, AUTHOR="A. Kanbach and A. Körber", TITLE="{ISDN} - Die Technik", PUBLISHER="Hüthig Buch Verlag GmbH", ADDRESS="Heidelberg", PAGES="1-276", YEAR=1990, LANGUAGE="German", KEYWORDS="ISDN; survey", ANNOTE="- ISDN - das universelle Fernmeldenetz - Protokolle als Grundlage der Zeichengabe - Bitübertragungsschicht - Datensicherungsschicht - Realisierung von Dienstmerkmalen - Aufbau von ISDN-Endsystemen - ISDN-spezifische Hardware-Komponenten", } @ARTICLE{Kash90:Flexible, AUTHOR="A. Kashper", TITLE="Introduction of flexible routing for international networks", JOURNAL=cnis, VOLUME=20, NUMBER="1-5", PAGES="137-141", YEAR=1990, KEYWORDS="Communication network; routing; cost function", ANNOTE="This paper summarizes a deployment strategy for flexible routingin international networks. In an earlier paper, we proposed to define flexible routing for international networks based on DNR call processing principles, including originating call control, common channel signaling and crankback capabilities, and investigated the problem of dimensioning multiservice bilateral networ ks assuming that flexible routing is introduced by carriers.", } @ARTICLE{Kuro90:Stack, AUTHOR="James F. Kurose and A. K. Shrivastava and Donald F. Towsley", TITLE="Stack algorithms for random multiple-access networks in the prese nce of asymmetric feedback", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=9, PAGES="1308-1313", YEAR=1990, KEYWORDS="Random access; feedback; throughput analysis; delay analysis", ANNOTE="We propose several possible modifications to the basic stack algorithm for such environments and quantitatively examine the performance of the variosus alternatives. An approximate Markov cha in model is developed to analytically study the time delay vers us throughput performance of the various alternatives and the analytic results are validated through simulation. Representative performance results are given for the alternative stac algoriths", } @ARTICLE{Lam90:Time, AUTHOR="A. Lam and Dilip Sarwate", TITLE="Time-hopping and frequency-hopping multiple-access packet communications", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=6, PAGES="875-888", YEAR=1990, KEYWORDS="Communication system; multiple access; collision detection; throughput analysis", ANNOTE="Time-hooping and frequency-hooping multiple-access packet communication systems are proposed and investigated. In TH/FHMA commmunication systems, a message packet is encoded into serveral subpackets via a Reed-Solomon error correcting code. The subpackets are transmitted over the channel using timehopping and frequency and frequency-hooping patterns.", } @BOOK{Lehn90:Wissensbasierte, AUTHOR="K. Lehner", TITLE="Wissensbasierte Lehrsysteme", ISBN="3-486-21377-6", PUBLISHER="R. Oldenbourg Verlag", ADDRESS="München", PAGES="1-173", YEAR=1990, LANGUAGE="German", KEYWORDS="Expert system", ANNOTE="- Expertensysteme, intelligente Lehrprogramme, Hilfsmittel - GUIDON - Recovery Boiler Tutor - NUGGET - GIST - Bewertung, Extrem-und Problemfälle", } @ARTICLE{Levy90:Polling, AUTHOR="H. M. Levy and M. Sidi", TITLE="Polling systems: applications, modeling, and optimization", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=10, PAGES="1750-1760", YEAR=1990, KEYWORDS="Polling; model; optimization; ARQ", ANNOTE="Polling models have been extensively studied in the two decades. As a result, a large body of knowledge has been built in this area and they became a powerful tool for the performance analysis of a wide variety of important applications. The goal of this paper is to expose the application oriented reader to the modelingand analysis capabilities of polling systems. We review the state-of-the-art in this field, focusing on applications.", } @ARTICLE{Loo90:Digital, AUTHOR="C. Loo", TITLE="Digital transmission through a land mobile satellite channel", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=5, PAGES="693-697", YEAR=1990, KEYWORDS="Satellite radio; mobile radio; error probability; performance evaluation; throughput analysis", ANNOTE="This paper describes an analytical derivation of the probabilityof bit error of noncoherent FSK and coherent PSK signals transmitted through a land mobile satellite channel. The channel characteristics used in the analysis are based on a recently developed model which includes the combined effects of fading and shodowing. Analitical expression for the probability of bit error of FSK and CPSK signals are obtained.", } @ARTICLE{Lu90:Self, AUTHOR="M. Lu and D. Zhang and T. Murata", TITLE="Analysis of Self-Stabilizing Clock Synchronization by Means of Stochastic Petri Nets", JOURNAL=ieeetc, VOLUME="C-39", PAGES="597-604", YEAR=1990, KEYWORDS="SPN; stochastic Petri net; synchronization", ANNOTE="This paper develops a model for analyzing the FCS system of the type supported by a statistical selfdiagnosis. A stochastic Pe tri net model is constructed to derive the self-stability measures of such FCS systems. An example is given to demonstrate the entire modeling and analyzing procedure. The mapping from SPN mod el to Markov model shown in the example can be automated by usi ng an SPN model is an excellent tool in obtaining self.", } @ARTICLE{Magl90:Routing, AUTHOR="B. Maglaris and R. R. Boorstyn and Shivendra Panwar and T. Spirtos and John O'Reilly", TITLE="Routing of voice and data in burst-switched networks", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=6, PAGES="889-897", YEAR=1990, KEYWORDS="ISDN; TDM; time division multiplex; voice/data integration; routing; burst switching", ANNOTE="This paper addresses the static and centralized routing of voice and data traffic in burst switched networks. Since voice and data have markedly different traffic characteristics and performance requirements, their interaction in a unified switching and transmission structure greatly impacts their performance. Voice performance in a burst switched network is primarily measured by end-to-end freeze-out while figures-of-merit for data include.", } @ARTICLE{Mart90:ARQ, AUTHOR="J. Martins and J. de Carvalho", TITLE="{ARQ} protocols with adaptive block size perform better over a wide range of bit error rates", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=6, PAGES="737-739", YEAR=1990, KEYWORDS="Communication protocol; ARQ; error rate; throughput analysis", ANNOTE="The throughput of conventionalARQ protocol, such as the stop-and-wait, go-back-N, and selective repeat, can be improved by dynamically adapting the protocol block length so that it approaches the optimum value for varying channel bit error rates. A very simple algorithm to implement such an adaptive scheme is presentedhere. The algorithm assumes a known block error rate, estimates the bit error rate.", } @ARTICLE{Morg90:Mean, AUTHOR="Samuel P. Morgan and C.-C. Lo", TITLE="Mean message delays for two {packet-FIFO} queueing disciplines", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=6, PAGES="744-746", YEAR=1990, KEYWORDS="Delay analysis; queueing discipline; queueing system; priority; message switching", ANNOTE="We derive expressions for the mean message delay, as a function of message length, when data messages of different lengths arrive asynchronously at a trunk and are divided, as they come in, into packets of some maximum length. The packet of different messages are intermingled and are put onto the trunk either from a single firstin-first-out queue, or from a high-priority and a low-priority queue for single-packet and multiple-packet messages.", } @ARTICLE{Sato90:Broad, AUTHOR="K. Sato and S. Ohta and Ikuo Tokizawa", TITLE="Broad-band {ATM} network architecture based on virtual paths", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=8, PAGES="1212-1222", YEAR=1990, KEYWORDS="Communication system; ATM; broadband; performance evaluation", ANNOTE="This paper explores broad-band transport techniques and network architectures based on the virtual path concept. ATM techniques, when coupled with recent technological innovation, are expected to pave the vay for future universal transport networks. The multiplexing and transport benefits of the ATM have a great impacton network architecture. The virtual path concept, which exploi ts the ATM's capabilities.", } @BOOK{Savo90:Grundlagen, AUTHOR="S. E. Savory", TITLE="Grundlagen von Expertensystemen", ISBN="3-486-21524-8", PUBLISHER="R. Oldenbourg Verlag", ADDRESS="München", PAGES="1-308", YEAR=1990, LANGUAGE="German", KEYWORDS="Expert system", ANNOTE="- was sind Expertensysteme, und wozu sind sie gut - ICE - notwendige theoretische Hintergrundkenntnisse - programieren in Logik - Erstellung eines regelbasierten Systems in zehn Schritten - eine alternative Wissensdarstellung - eine Perspektive für Wissenserwerb", } @ARTICLE{Stav90:Star, AUTHOR="I. Stavrakakis and D. Kazakos", TITLE="Performance analysis of a star topology of interconnected networksunder 2nd-order Markov network output processes", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=10, PAGES="1724-1731", YEAR=1990, KEYWORDS="Random access; interconnection network; performance evaluation; star network; output process", ANNOTE="In this paper, the ideal of approximating the output process of slotted multiuser random access communication networks by a 2nd-order Markov process is introduced. A method is developed to analytically calculate the parameters of the approximate process for a class of random access algorithms. The method is illustrated by considering a specific random access algorithm from that class.", } @ARTICLE{Swid90:Functional, AUTHOR="J. Swiderski", TITLE="Functional dualism of local controllers with respect to congestioncontrol and store- and-forward deadlock prevention in packet networks", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=10, PAGES="1732-1739", YEAR=1990, KEYWORDS="Packet switching; deadlock; congestion control", ANNOTE="The problem of functional dualism of local flow controllers usedin packet networks is investgated. At first, a method for examining networks employing local congestion controllers for exposureto store-and-forward deadlocks is presented. Then a simple analytical approach to performance evaluation of hop-dependent controllers preventing store-and-forward deadlocks is described. Numerical examples given show that in some cases typical local", } @ARTICLE{Tsai90:Token, AUTHOR="Z. h. Tsai and I. Rubin", TITLE="Performance of token schemes supporting delay - constrained priority traffic streams", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=11, PAGES="1994-2003", YEAR=1990, KEYWORDS="Token ring; LAN; IEEE 802.5; performance evaluation", ANNOTE={A symmetric priority-based token network is considered Messages are divided into two priority classes. High-priority messages are assumed to require tight delay constraints. As a result, each station is allowed to establish, at any time, at most a single "real-time" high-priority access connection. High-priority messages are guaranteed access onto the channel within a prescribed limited period.}, } @ARTICLE{Tsan90:Algorithms, AUTHOR="D. Tsang and Keith W. Ross", TITLE="Algorithms to determine exact blocking probabilities for multiratetree networks", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=8, PAGES="1266-1271", YEAR=1990, KEYWORDS="Circuit switching; blocking; tree network; performance evaluation", ANNOTE="We consider a circuit-switched network consisting of multiple-access links connected to a common link. Each call requires circuits on one access link and on the common link. The network supports multiple classes of class specifies a bandwidth requirement, an arrival rate, and a holding-time distribution. Based on a product-form solution for these networks, four algorithms are developed to determine the exact blocking probability for each.", } @BOOK{Wohl90:Planung1, AUTHOR="G. Wöhlbier", TITLE="Planung von Telekommunikationsnetzen, Bd. I", ISBN="3-7685-1489-7", PUBLISHER="R. v. Decker's Verlag, G. Schenck", ADDRESS="Heidelberg", PAGES="1-420", YEAR=1990, LANGUAGE="German", KEYWORDS="Network planning; routing", ANNOTE="1. Der Produktionsprozeß Fernmeldenetz und dessen Prognosen 2. Die verkehrstechnische Gestaltung und Leitungsbedarfsvorhersa ge für das Fernsprechnetz/ISDN 3. Die Planung des Linien- und Leitungsnetzes", } @ARTICLE{Wolf90:Optimum, AUTHOR="R. Wolfe and M. C. Jeruchim and P. M. Hahn", TITLE="On optimum and suboptimum biasing procedures for importance sampl ing in communication simulation", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=5, PAGES="639-647", YEAR=1990, KEYWORDS="Performance evaluation; simulation; time series analysis", ANNOTE="Importance sampling can significantly reduce simulation run timein estimating the bit error probability of digital systems if a suitable procedure is used. In this paper, we consider various aspects of optimum and suboptimum biasing procedures. We show that the strict optimum does not lead to a realistic procedure. Weexamine the subop timal variations that are reasonably implementable.", } @ARTICLE{Beck90:Prospective, AUTHOR="D. Becker and H. F. Savary and H. Verhille", TITLE="Prospective Views on the Alcatel Broadband Architecture", JOURNAL=ec, ADDRESS="Paris", VOLUME=64, NUMBER=2, PAGES="147-155", YEAR=1990, REFERENCES=2, KEYWORDS="Switching system; architecture", } @ARTICLE{Berm90:Service, AUTHOR="L. Bermejo and P. Parmentier and G. H. Petit", TITLE="Service Characteristics and Traffic Models in a Broadband {ISDN}", JOURNAL=ec, ADDRESS="Paris", VOLUME=64, NUMBER=2, PAGES="132-138", YEAR=1990, REFERENCES=8, KEYWORDS="ATM; traffic source model; traffic mix; connection admission control", } @ARTICLE{Bott90:Alcatel, AUTHOR="D. Böttle and M. A. Henrion", TITLE="Alcatel {ATM} Switch Fabric and Its Properties", JOURNAL=ec, ADDRESS="Paris", VOLUME=64, NUMBER=2, PAGES="156-165", YEAR=1990, REFERENCES=10, KEYWORDS="Switching system; architecture; performance evaluation", } @ARTICLE{Bott90:Flexibles, AUTHOR="D. Böttle and G. Eilenberger and K. J. Schrodi", TITLE="Flexibles {ATM-Koppelfeldkonzept} für die Breitbandkommunikation", JOURNAL=ntz, VOLUME=43, NUMBER=11, PAGES="810-815", YEAR=1990, LANGUAGE="German", REFERENCES=6, KEYWORDS="ATM; switching system; architecture", ANNOTE="Entwicklung, Herstellung und Installation von Vermittlungssyste-men mit ATM Koppelfeldern erfordern hohe Investitionen bei den Herstellern und Betreibern dieser Systeme. Folglich sind die Konzepte dieser Systeme so zu wählen, daß auch zukünftige, heutenoch unbekannte Anforderungen durch relativ einfache Anpassungenkostengünstig zu realisieren sind. Ein derartiges zukunftssiche-res Koppelfeldkonzept wurde im Alcatel-Firmenverb. entwickelt.", } @ARTICLE{Coop90:Reasonable, AUTHOR="C. S. Cooper and Kun I. Park", TITLE="A Reasonable Solution to the Broadband Congestion Control Problem", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=2, PAGES="103-115", YEAR=1990, REFERENCES=16, KEYWORDS="ATM; policing function; connection admission control; priority", } @ARTICLE{DAgo90:Universal, AUTHOR="S. D'Agostino and J. David and R. Heiß and Willem Verbiest", TITLE="Universal {ATM} Video Coding Architecture", JOURNAL=ec, ADDRESS="Paris", VOLUME=64, NUMBER=2, PAGES="186-193", YEAR=1990, REFERENCES=7, KEYWORDS="ATM; video coding", } @ARTICLE{Day90:Australian, AUTHOR="A. M. Day and D. M. Dorman", TITLE="Towards an Australian Broadband Network Infrastructure", JOURNAL="Telecommunication Journal of Australia", VOLUME=40, NUMBER=2, PAGES="3-14", YEAR=1990, REFERENCES=11, KEYWORDS="ATM; broadband; MAN; standardization; survey", ANNOTE="This paper provides a broad perspective on the drives, impacts of and evolution to broadband service support in Australia in the decade ahead. It concludes that the 1990s will provide substantial uptake of corporate broadband facilities but that wide-scale deployment of residential switched broadband services willextend beyond the 1990s.", } @ARTICLE{Eckb90:Approach, AUTHOR="A. E. Eckberg and Daniel Luan and David M. Lucantoni", TITLE="An Approach to Controlling Congestion in {ATM} Networks", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=2, PAGES="199-209", YEAR=1990, REFERENCES=18, KEYWORDS="ATM; congestion control; policing function; leaky bucket; flow control; error control", } @ARTICLE{Hira90:Traffic, AUTHOR="Miki Hirano and Nayoa Watanabe", TITLE="Traffic Characteristics and a Congestion Control Scheme for an {ATMNetwork}", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=2, PAGES="211-217", YEAR=1990, REFERENCES=6, KEYWORDS="ATM; congestion control; bursty traffic; analysis; statistical multiplexer; performance evaluation; packet voice; policing function; leaky bucket", } @ARTICLE{Holz90:ATM, AUTHOR="J. Hölzle and W. König and R. Rheinschmitt", TITLE="{ATM-Teilnehmernetze} für integrierte Breitband-Kommunikation", JOURNAL=ntz, VOLUME=43, NUMBER=11, PAGES="802-809", YEAR=1990, LANGUAGE="German", KEYWORDS="ATM; CPN; customer premises network; architecture", ANNOTE="Mit der Einführung des BISDN wird sich für den Teilnehmer einneues und breites Spektrum für neue Anwendungen und Endgeräteder Telekommunikation eröffnen. Die Anwendung des Asynchronen Übermittlungsverfahrens (ATM) und die Berücksichtigung der An-forderungen an künftige Netze führen zu neuen Strukturen fürbreitbandige Teilnehmernetze sowohl im Heimbereich als auch im Büro-bereich.", } @ARTICLE{Hui90:Congestion, AUTHOR="Joseph Hui", TITLE="A Congestion Measure for Call Admission and Traffic Engineering for Multi-Layer Multi-Rate Traffic", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=2, PAGES="127-135", YEAR=1990, REFERENCES=14, KEYWORDS="ATM; routing; connection admission control", } @ARTICLE{Jabb90:Connection, AUTHOR="B. Jabbari", TITLE="A Connection Control Strategy for Bursty Sources in Broadband Packet Networks", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=4, PAGES="351-356", YEAR=1990, REFERENCES=12, KEYWORDS="ATM; connection admission control; loss system; performance evaluation", ABSTRACT="This paper proposes an admission strategy for connection-oriented services at the access node of a broadband integrated packet network based on ATM. Based on an estimate of the probability of cell loss and in the absence of buffering, we determine the number of sources from different classes of bursty traffic which can be accepted. The parameters which are used to describe the traffic sources are average and peak bit rate.", } @ARTICLE{Kosi90:ATM, AUTHOR="R. Kositpaiboon and G. Woodruff and Philip Richards", TITLE="{ATM} Traffic Control for Guaranteed Performance", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=2, NUMBER=3, PAGES="117-125", YEAR=1990, REFERENCES=15, KEYWORDS="ATM; statistical multiplexing; connection admission control", } @ARTICLE{Kowa90:Source, AUTHOR="W. Kowalk", TITLE="Source Policing in {ATD} Networks", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=3, PAGES="267-276", YEAR=1990, REFERENCES=10, KEYWORDS="ATM; policing function; formal technique", ANNOTE="Different aspects of ATD are considered, particularly source po-licing. This notion is defined, some source policing strategies discussed in the literature are surveyed, including the control actions required for network protection. The result of these studies is that only one of the source policing mechanisms analysed is suitable to protect ATD networks sufficiently.", } @ARTICLE{Laza90:Architecture, AUTHOR="Aurel A. Lazar and A. Temple and R. Gidron", TITLE="An Architecture for Integrated Networks that Guarantees Quality ofService", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=2, PAGES="229-238", YEAR=1990, REFERENCES=22, KEYWORDS="ATM; congestion control; bandwidth allocation; switching system", } @INPROCEEDINGS{Mels90:Neural, AUTHOR="P. J. W. Melsa and J. B. Kenney and C. E. Rohrs", TITLE="A Neural Network Solution for Call Routing with Preferential Call Placement", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="1377-1381", YEAR=1990, REFERENCES=8, KEYWORDS="Neural network; path control; routing; switching network", ANNOTE="This paper presents a neural network solution to the problem of routing calls through a three stage interconnection network. Theneural network solution has been shown to select an open path through the network if one exists. The solution uses a Hopfield network with a binary threshold rather than a sigmoidal function. An important feature of this solution is that the weights of the neural network are fixed for all time, and thus are independent", } @ARTICLE{Nies90:Leaky, AUTHOR="G. Niestegge", TITLE="The 'Leaky Bucket' Policing Method in the {ATM} (Asynchronous Transfer Mode) Network", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=2, PAGES="187-197", YEAR=1990, REFERENCES=7, KEYWORDS="ATM; policing function; leaky bucket", } @ARTICLE{Palm90:Experimental, AUTHOR="R. Palmer", TITLE="An Experimental {ATM} Switch for {BISDN} Studies", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=4, PAGES="341-349", YEAR=1990, REFERENCES=14, KEYWORDS="ATM; switching network; Batcher-Banyan", ABSTRACT="This paper describes the architecture, functionality and performance of an experimental ATM switch being developed at the Telecom Australia Research Laboratories as part of its investigations into the broadband ISDN. The proposed switch architecture consists of parallel omega networks preceeded by a Batcher bitonic sorting network. The switching fabric has no internal cell buffering. Cell buffering is provided only at the outputs.", } @ARTICLE{Patt90:ATM, AUTHOR="Achille Pattavina", TITLE="Performance Evaluation of {ATM} Switches with Input and Output Queueing", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=3, PAGES="277-286", YEAR=1990, REFERENCES=18, KEYWORDS="ATM; switching network; input buffer; output buffer; performance evaluation; analysis", ANNOTE="This paper analyses the performance of an ATM switch, in which packet storage capability is provided both at inputs and outputsof the switching fabric which is internally nonblocking. The switch model adopted here jointly adopts internal rate speedup and output channel grouping. The switch performance, for different speed-ups and channel groupings, is evaluated in terms of maximum throughput, packet average delay and loss rate.", } @ARTICLE{Petr90:Priority, AUTHOR="David Petr and Victor S. Frost", TITLE="Priority Cell Discarding for Overload Control in {BISDN/ATM} Networks: An Analysis Framework", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=2, PAGES="219-277", YEAR=1990, REFERENCES=18, KEYWORDS="ATM; congestion control; priority; analysis", } @ARTICLE{Schn90:Wenn, AUTHOR="H. Schneider", TITLE="Wenn mit {ATM} zur Kommunikation zusätzlich das Bild kommt \ldot", JOURNAL=ntz, VOLUME=43, NUMBER=11, PAGES="794-800", YEAR=1990, LANGUAGE="German", REFERENCES=2, KEYWORDS="ATM; survey", ABSTRACT="Hochintegrierte und höchstintegrierte Mikroelektronikbausteine sowie dieLichtwellenleitertechnik machen es möglich, dem Teilnehmer aufwirtschaftliche Weise neben dem Dienst Telefonieren zusätzlicheLeistungsmerkmale und neue Dienste anzubieten. Dabei kann auch dem Bedürfnis, zusätzlich zur Sprachkommunikation Texte, Datenund Bilder mit dem Partner auszutauschen, entgegengekommen werden. Eine besondere Rolle wird dabei die ATM-Technik spielen.", } @INPROCEEDINGS{Schw90:VLSI, AUTHOR="D. B. Schwartz and V. K. Samalam", TITLE="{VLSI} for {ATM} Network Management", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="1387-1392", YEAR=1990, REFERENCES=21, KEYWORDS="ATM; congestion control; traffic measurement; traffic prediction; neural network", ANNOTE="In a broadband ATM network, the ratio of propagation delay to cell transmission time makes traditional end-to-end flow controland congestion control techniques unsuitable. Instead, the flow controller will have to reside at the entry point to the networkand use its knowledge of the source to make control decisions. To maintain the flexibility which is ATM's most attractive property, such controllers will have to use adaptive source model.", } @ARTICLE{Scot90:Getting, AUTHOR="C. J. Scott and M. J. Biggar and D. M. Dorman", TITLE="Getting the Picture - Integrated Video Services in {BISDN}", JOURNAL="Telecommunication Journal of Australia", VOLUME=40, NUMBER=2, PAGES="21-25", YEAR=1990, KEYWORDS="ATM; BISDN; video service; service integration", ANNOTE="Services are the life blood of communication networks, they are the reason such networks exist and the final arbiter of their success. The success of broadband communications will be closelylinked to the acceptability and applicability of the services offered.", } @INPROCEEDINGS{Taka90:Experimental, AUTHOR="Yutaka Takahashi and K. Ando and H. Inoue and E. Amada", TITLE="An Experimental Photonic {ATM} Switching System Using an {InP} Semiconductor Optical Switch", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="1586-1589", YEAR=1990, REFERENCES=5, KEYWORDS="ATM; optical switching; switching system; architecture", ANNOTE="A prototype of a photonic ATM switching system is fabricated andevaluated. It uses a space division type optical switch array for switching optical signals. Each of its highways contains two1.2 Gb/s signals (wavelength division multiplexed) and it has 4x4 optical switch ports. It can realize a total capacity of 9.6Gb/s. An optical signal format and retiming architecture for bitand cell synchronization are proposed. Measurements of basic", } @INPROCEEDINGS{Thyl90:Switch, AUTHOR="L. Thylen and P. Granestrand", TITLE="Switch Arrays for Photonic Switching: Status Review and Prospects", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="1296-1300", YEAR=1990, REFERENCES=13, KEYWORDS="Optical switching; switching system", ANNOTE="The purpose of this paper is to review the status and prospects of LiNbO3 switch arrays in view of system requirements. An experimental switching system is also desribed. Finally, the potential of semiconductor devices with reference to recently reported results, is briefly discussed.", } @ARTICLE{Tirt90:Layered, AUTHOR="E. Tirtaatmadja and C. J. Scott", TITLE="A Layered Modelling of {ATM,} {SDH} and {MAN} Technologies in Broadband {ISDN}", JOURNAL="Telecommunication Journal of Australia", VOLUME=40, NUMBER=2, PAGES="15-20", YEAR=1990, KEYWORDS="ATM; MAN; SDH; synchronous digital hierarchy; broadband; modeling", ANNOTE="This paper considers the roles and relationships between three major new technologies which will be key factors in the evolution of BISDN: the Synchronous Digital Hierarchy (SDH), Metropo-litan Area Networks (MAN) and Asynchronous Transfer Mode (ATM). A layered model is proposed as the basis of analysis and comparison of the three technologies. The model uses four layers to define network functions above the physical transport media.", } @ARTICLE{Wall90:Connection, AUTHOR="E. Wallmeier", TITLE="A Connection Acceptance Algorithm for {ATM} Networks Based on Mean and Peak Bit Rates", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=2, PAGES="143-153", YEAR=1990, REFERENCES=16, KEYWORDS="ATM; connection admission control", } @INPROCEEDINGS{Yama90:Experimental, AUTHOR="M. Yamaguchi and T. Matsunaga and M. Okuno", TITLE="Experimental Photonic Multimedia Switching System using Integrated8x8 Silica-Based Guided-Wave Crossbar Switch", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="1301-1305", YEAR=1990, REFERENCES=11, KEYWORDS="Optical switching; switching system; crossbar; architecture", ANNOTE="An experimental 8-line photonic space-division switching system is demonstrated using a new 8x8 optical crossbar switch. This switch consists of 112 switch elements monolithically integratedby silica-based waveguid techniques. Average insertion loss of aswitch package board is 16.3 dB, and the ratio of signal to accumulated crosstalk averages 7.2 dB. Four types of connections: G4 fax, CSMA/CD lan, NTSC TV, and HD video are successfully", } @INPROCEEDINGS{Youn90:Physical, AUTHOR="K. C. Young and T. C. Banwell and Sheng Chen and R. C. others. Estes", TITLE="Physical design issues for very large {ATM} switching systems", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="1590-1593", YEAR=1990, REFERENCES=3, KEYWORDS="Broadband; switching system; physical design", ANNOTE="In this paper we examine the physical design issues associated with terabit-per-second switching and identify some limitations of current technology. We propose a novel, three-dimensional structure that alleviates some of the connectivity problems and we assess the power delivery and thermal management requirementsof these large switching systems.", } @TECHREPORT{Hui90xx:Switching, AUTHOR="Joseph Hui", TITLE="Switching Integrated Broadband Services by Sort-Banyan Networks", INSTITUTION="Department of Electrical and Computer Engineering, Rutgers University", ADDRESS="Piscataway, New Jersey", NUMBER="90-04", PAGES=23, YEAR=1990, REFERENCES=18, KEYWORDS="ATM; fast packet switching; switching network; architecture; Batcher-Banyan; sorting network; self routing; input buffer", URL="http://www.ece.rutgers.edu", } @INPROCEEDINGS{Ajmo90:Comparison, AUTHOR="Marco {Ajmone Marsan} and F. Neri", TITLE="Performance Comparison of four {MAC} Protocols for Integrated {MANs}", BOOKTITLE="ITS, International Telecomm Symposium", ADDRESS="Rio de Janeiro", PAGES="104-112", YEAR=1990, REFERENCES=13, KEYWORDS="DQDB; FDDI-II; MAN; HSLAN; performance evaluation; simulation; delay; throughput", ANNOTE="The performance of four MAC sublayer protocols proposed for applications in extended LANs and/or MANs integrating different types of traffic are compared: EXPRESSNET, FASNET, QPSX/DQDB, FDDI-II. Performance results in terms of of average and variance packet access delay, channel utilization and percentage of packet loss due to lack of buffers are obtained through simulation for severeal parameters.", } @INPROCEEDINGS{Grav90:Double, AUTHOR="D. J. Graves", TITLE="The Double-Slot Slotted Ring Protocol {(DSR)}", BOOKTITLE="ITS, International Telecomm Symposium", ADDRESS="Rio de Janeiro", PAGES="238-242", YEAR=1990, REFERENCES=9, KEYWORDS="Protocol; HSLAN; MAN; slotted ring; reservation; fairness", ANNOTE="The paper describes the 'double-slot' slotted ring protocol which combines a multilevel priority and fairness guarantee mechanism over a destination release slotted ring. The protocl shall ensure fair bandwidth allocation within each priority level througha distributed reservation algorithm in the media access control layer.", } @ARTICLE{Karo90:High, AUTHOR="Mark Karol and R. D. Gitlin", TITLE="High-Performance Optical Local and Metropolitan Area Networks: Enhancements of {FDDI} and {IEEE802.6} {DQDB}", JOURNAL=ieeejsac, VOLUME="SAC-8", PAGES="1439-1448", YEAR=1990, REFERENCES=29, KEYWORDS="Protocol; HSLAN; MAN; DQDB; FDDI; Shufflenet", ANNOTE="The paper presents several ways to increase throughput and lowerend-to-end delay on the basis of dqdb and fddi without increasing the number of receivers and transmitters at a node. The paper concentrates an a mutliconnected ring architecture which uses a shufflenet scheme as connection topology. This topology providesa highly concurrent logical interconnection patternof nodes while the end-to-end delays are claimed to be reduced by more effici", } @TECHREPORT{Mukh90:Scheduling, AUTHOR="B. Mukherjee and A. E. Kamal", TITLE="Scheduling Variable-Length Messages on Slotted, High-Speed Fiber Optic {LANs/MANs} Using the Continuation-Bit Approach", INSTITUTION="University of California, Davis", ADDRESS="Davis, California", NUMBER="CSE-90", YEAR=1990, REFERENCES=23, KEYWORDS="Protocol; performance evaluation; simulation; delay; MAN; HSLAN", ANNOTE="The paper describes the continuation-bit approach and its application to high-speed LANs/MANs. Overhead is analyzed and comparedwith that of a conventional slotted system. Then the approach is applied to the Pi-persistent protocol, which is an efficient unity-capacity protocol proposed for HSLANs/MANs. Specifically, approximate models are formulated for light and heavy traffic loads. From these models the proper network operating parameters", } @INPROCEEDINGS{As90:Major, AUTHOR="H. van As", TITLE="Major Performance Characteristics of the {DQDB} {MAC} Protocol", BOOKTITLE="ITS, International Telecomm Symposium", ADDRESS="Rio de Janeiro, Brazil", PAGES="113-120", YEAR=1990, REFERENCES=14, KEYWORDS="DQDB; QPSX; MAN; HSLAN; performance evaluation; delay; throughput; simulation", ABSTRACT="The paper shows major performance characteristics of the dqdb mac protocol in different environments. It addresses throughput unfairness under heavy load and and the consequences for the priority mechanism. Then the socalled bandwidth balancing mechanism is considered with respect to the positioning of heavy and low load stations. Finally symmetric and asymmetric traffic environments are compared.", } @INPROCEEDINGS{Zitt90:Parallel, AUTHOR="M. Zitterbart", TITLE="Parallel Protocol Implementations for High Speed Networks", BOOKTITLE="ITS, International Telecomm Symposium", ADDRESS="Rio de Janeiro", PAGES="260-264", YEAR=1990, REFERENCES=15, KEYWORDS="Protocol; parallel computing; protocol implementation", ANNOTE="The paper describes an approach to overcome the upcoming processing bottleneck of communication protocols. The approach is basedon the use of multiprocessor architectures. Several parallel concepts inside network nodes like pipeline and array constructs are outlined and different memory concepts are suggested. Performance measurements of protocol implementations on transputer networks are given in the final section.", } @BOOK{Stal90:Handbook, AUTHOR="W. Stallings", TITLE="Handbook of Computer-Communications: {LAN} Standards", ISBN="0-672-22698-7", PUBLISHER="Howard W. Sams and Company", ADDRESS="North College", VOLUME=2, YEAR=1990, KEYWORDS="Communication network; LAN; standardization; OSI", ANNOTE="1. Local Network Technology 2. Local Network Standards 3. IEEE 802.2 Logical 4. IEEE 802.3 CSMA/CD 5. IEEE 802.4 Token Bus 6. IEEE 802.5 Token Ring 7. Fiber Distributed Data Interface.", } @INPROCEEDINGS{Bioc90:Architectural, AUTHOR="A. Biocca and G. Freschi and A. Forcina and R. Melen", TITLE="Architectural Issues in the Interoperability between {MANs} and the {ATM} Network", BOOKTITLE=iss, ADDRESS="Stockholm", PAGES="4A.3", YEAR=1990, REFERENCES=15, KEYWORDS="ATM; connectionless service; architecture; interconnection", ANNOTE="In this paper the following two concepts are examined: ATM and MANs. An evolution strategy is outlined which exploits their synergies. Furthermore, some technical issues concerning the interworking of MANs and the ATM network are addressed.", } @ARTICLE{Burg90:Dynamic, AUTHOR="J. L. Burgin", TITLE="Dynamic Capacity Management in the {BISDN}", JOURNAL="International Journal of Digital and Analog Communication Systems", VOLUME=3, NUMBER=2, PAGES="161-165", YEAR=1990, REFERENCES=10, KEYWORDS="ATM; bandwidth allocation; capacity assignment; virtual path; dynamic resource allocation", ANNOTE="Use of virtual paths (VPs) in BISDN presents network operators with the ability to make processing intensive resource management decisions for flows of traffic instead of individual connections. Altering the amount of capacity assigned to different VPs provides the ability to reconfigure the network dynamically to respnd to changes in traffic demand. This paper studies the dynamic behaviour of some algorithms for assigning capacity to VPs.", } @INPROCEEDINGS{Croc90:Interworking, AUTHOR="P. Crocetti and Giorgio Gallassi and M. Gerla", TITLE="Interworking of {MANs} and {ATM}", BOOKTITLE="7th ITC Specialist Seminar", ADDRESS="Morristown, New Jersey", PAGES="6.3", YEAR=1990, REFERENCES=4, KEYWORDS="MAN; ATM; connectionless service; interconnection; bandwidth allocation; traffic control", ANNOTE="The authors focus on MAN/ATM interconnection supported by a connectionless service within the ATM network. For the problem of allocating bandwidth to the VPs connecting the gateways they propose a solution which is based on available bandwidth information on the path periodically supplied by the network to the gateway (bandwidth advertising).", } @INPROCEEDINGS{Lela90:LAN, AUTHOR="Will Leland", TITLE="{LAN} Traffic Behaviour from Milliseconds to Days", BOOKTITLE="7th ITC Specialist Seminar", ADDRESS="Morristown, New Jersey", PAGES="6.1", YEAR=1990, REFERENCES=12, KEYWORDS="LAN; traffic measurement", ANNOTE="The authors present results on measurements of LAN traffic (Ethernet) within Bellcore's Morris Research and Engineering Center during August 1989 through January 1990.", } @ARTICLE{Pavl90:Basic, AUTHOR="G. Pavlou and G. Knight", TITLE="Basic Rate {ISDN} Workstation Traffic Pattern", JOURNAL=comcom, VOLUME=13, NUMBER=10, PAGES="587-594", YEAR=1990, KEYWORDS="LAN; traffic measurement", } @INPROCEEDINGS{Ujih90:Architecture, AUTHOR="Y. Ujihashi and Toshihiro Shikama and Kazuji Watanabe and K. Oshima and S. Aoyama", TITLE="An Architecture for Connectionless Data Service in {BISDN}", BOOKTITLE=globecom, ADDRESS="San Diego, California", PAGES="900.3", YEAR=1990, REFERENCES=8, KEYWORDS="ATM; connectionless service; architecture; routing; performance evaluation", ANNOTE="This paper proposes a method to support a connectionless service within BISDN directly via CLSFs. Furthermore, they compare their method with a virtual ring topology in terms of the traffic load within the network and the processing load within the CLSFs.", } @INPROCEEDINGS{Yama90:Connectionless, AUTHOR="Katsuyuki Yamazaki and Y. Ikeda", TITLE="Connectionless Cell Switching Schemes for Broadband {ISDN}", BOOKTITLE=iss, ADDRESS="Stockholm", PAGES="2A.9", YEAR=1990, REFERENCES=8, KEYWORDS="ATM; connectionless service; architecture", ANNOTE="This paper discusses the objectives of connectionless cell switching services within BISDN. Topics especially discussed are architectural issues, addressing and routing mechanisms, andmessage based connectionless cell transfer.", } @INPROCEEDINGS{Berr90:ATM, AUTHOR="L. T. M. Berry", TITLE="{ATM} Traffic Modelled by a Semi-Markov Point Process Source", BOOKTITLE="Australian Video Communications Workshop", ADDRESS="Melbourne", PAGES="27-35", YEAR=1990, REFERENCES=11, KEYWORDS="ATM; source model; packet video; correlation; bursty traffic; semi Markov process", ANNOTE="In this paper some previously studied bursty traffic models are generalized to induce additional correlation possibilities. The purpose of the study is to attempt to define a class of models which may be suitable for characterizing variable bit rate videotraffic both within a continuous and a discrete time context. A semi-Markov framework is chosen in an attempt to retain reasonable tractability.", } @INPROCEEDINGS{Chan90:Multiplexing, AUTHOR="A. Chandan and Nicolaos D. Georganas", TITLE="Multiplexing Multimedia {ATM} Sources: A Cell Loss Analysis", BOOKTITLE="IEEE MULTIMEDIA", ADDRESS="Bordeaux", YEAR=1990, REFERENCES=4, KEYWORDS="ATM; statistical multiplexing; performance evaluation; bursty traffic; analysis; approximation", } @INPROCEEDINGS{Desm90:Discrete, AUTHOR="E. M. Desmet and G. H. Petit", TITLE="Performance Analysis of the Discrete Time Multiserver Queueing system {Geo(N)/D/c/K}", BOOKTITLE="RACE Workshop on Traffic and Performance Aspects in IBCN", ADDRESS="Munich", PAGES=20, YEAR=1990, REFERENCES=7, KEYWORDS="ATM; switching; output buffer; multiserver; analysis; performance evaluation; Markov chain; discrete time; numerical method; finite queue; waiting time; loss probability", ANNOTE="The performance characteristics (system contents and delay distributions, queue overflow probability) are obtained by numerical means. The results are validated against simulations. The relationship between overflow probability and queue size fora range of traffic intensities and for a selected number of servers and inlets are illustrated and discussed.", } @INPROCEEDINGS{Liao90:Heuristic, AUTHOR="K. Liao and L. G. Mason", TITLE="A Heuristic Approach for Performance Analysis of {ATM} Systems", BOOKTITLE=globecom, ADDRESS="San Diego", YEAR=1990, REFERENCES=22, KEYWORDS="ATM; statistical multiplexing; performance evaluation; analysis; approximation; G/D/1; fluid flow model; delay distribution", ANNOTE="We consider in this paper a heuristic approach which is based onthe fluid approximation. In order to remove the possible inaccuracy of the fluid approximation in light to moderate traffic, we propose a G/D/1 adjustment. The performance analysispredicts the buffer content and packet delay distribution which usually have stringent requirements. An infinite buffer is assumed in the analysis.", } @ARTICLE{Rama90:Duality, AUTHOR="V. Ramaswami", TITLE="A Duality Theorem for the Matrix Paradigms in Queueing Theory", JOURNAL="Stochastic Models", VOLUME=6, NUMBER=1, PAGES="151-161", YEAR=1990, REFERENCES=25, KEYWORDS="Queueing system; performance evaluation; analysis; M/G/1; matrix analytic method; GI/M/1; matrix geometric method; phase-type model", ANNOTE="For Markov renewal processes of GI/M/1 type, we define a double transform $R(z,s)$, a generalization of Neuts' rate matrix $R$, and establish an interesting duality theorem. That result expresses $R(z,s)$ explicitly in terms of the double transform $G(z,s)$ of Neuts for a suitably defined dual process of M/G/1 type. For the GI/PH/1 queue, the $G(z,s)$ matrix arising in the duality theorem is identified as the matrix of the dual PH/G/1 queue with a time", } @INPROCEEDINGS{Kato90:Bi, AUTHOR="Y. Kato and H. Hayami and J. Kamoi and Kurenai Murakami", TITLE="A {Bi-CMOS} {ATM} Switching {LSI}", BOOKTITLE="International Zürich Seminar", ADDRESS="Zürich", PAGES="195-210", YEAR=1990, REFERENCES=6, KEYWORDS="ATM; switching; architecture; crossbar; implementation; VLSI; design", ANNOTE="We have fabricated an IC for the ATM switching system which has a throughput of 1.2 Gbps and uses a Bi-CMOS RAM and logic gate array. This paper describes the functional and performance requirements of the ATM switch fabric, an IC designed to meet these requirements, and an actual system application using this IC.", } @INPROCEEDINGS{Patt90:Broadband, AUTHOR="Achille Pattavina", TITLE="A Broadband Packet Switch with Input and Output Queueing", BOOKTITLE=iss, ADDRESS="Stockholm", VOLUME=6, PAGES="11-16", YEAR=1990, REFERENCES=15, KEYWORDS="ATM; switching network; architecture; Batcher-Banyan; self routing; nonblocking; input buffer; output buffer; performance evaluation", ANNOTE="We describe here a broadband packet switch using a Batcher-Banyan interconnection network with input and output queueing that is able to transfer more than one packet per slot to a given switch outlet. A probe-ack contention resolution mechanism is adopted to select the conflict-free paths for the packets to be transfered through the interconnection network. Owing to this scheme buffer overflow at the output ports is prevented.", } @ARTICLE{Armb90:Breitbandanwendungen, AUTHOR="H. Armbrüster and H.-J. Rothamel", TITLE="Breitbandanwendungen und -dienste: Qualitative und quantitative Anforderungen an zukünftige Netze", JOURNAL=ntz, ISBN="0027-707X", VOLUME=43, NUMBER=3, PAGES="150-159", YEAR=1990, LANGUAGE="German", REFERENCES=18, KEYWORDS="Broadband; service integration; introduction strategy; service characterization; interactive; data communication; transmission principle; video conference", } @INPROCEEDINGS{Aiza9005:CCS7, AUTHOR="H. Aizawa and M. J. Golaszewski", TITLE="{CCS7} design experience in Japan and the {USA}", BOOKTITLE=iss, ADDRESS="Stockholm", VOLUME=2, PAGES="147-152 (B4.2)", MONTH="May/June", YEAR=1990, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Ajmo90:TOPNET, AUTHOR="Marco {Ajmone Marsan} and G. Balbo and G. Bruno and Fabio Meri", TITLE="{TOPNET:} A tool for the visual simulation of communication networks", JOURNAL=ieeejsac, VOLUME="SAC-8", NUMBER=9, PAGES="1735-1747", YEAR=1990, KEYWORDS="Computer tool; performance evaluation", } @ARTICLE{Asch90:Generation, AUTHOR="G. Ascheid", TITLE="On the generation of {WMC-distributed} random numbers", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=12, PAGES="2117-2118", YEAR=1990, KEYWORDS="Rvg", } @BOOK{Bock90:ISDN, AUTHOR="P. Bocker", TITLE="{ISDN} -- Das diensteintegrierende digitale Nachrichtennetz: Konzept, Verfahren, Systeme", PUBLISHER="Dritte Auflage, Springer-Verlag", ADDRESS="Berlin", YEAR=1990, LANGUAGE="German", KEYWORDS="ISDN", } @ARTICLE{Boxm90:Pseudoconservation, AUTHOR="O. J. Boxma and W. P. Groenendijk and J. A. Weststrate", TITLE="A pseudoconservation law for service systems with a polling table", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=10, PAGES="1865-1870", YEAR=1990, KEYWORDS="Queueing system; cyclic service; analysis", } @ARTICLE{Calz90:System, AUTHOR="Maria Calzarossa and Raymond Marie and K. S. Trivedi", TITLE="System performance with user behavior graphs", JOURNAL=pe, VOLUME=11, NUMBER=3, PAGES="155-164", YEAR=1990, KEYWORDS="Queueing network; product form", } @ARTICLE{Cazz90:SS7, AUTHOR="M. Cazzaniga and A. Garavelli and A. A. Robrock", TITLE="Implementation of {SS7:} Italtel's experience", JOURNAL=ieeecm, VOLUME=28, PAGES="84-88", YEAR=1990, } @INPROCEEDINGS{Chat9005:Mobile, AUTHOR="B. Chatras and C. Vernhes", TITLE="Mobile application part design principles", BOOKTITLE=iss, ADDRESS="Stockholm", VOLUME=1, PAGES="35-42 (B1.2)", MONTH="May/June", YEAR=1990, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Chau90:Intelligent, AUTHOR="S. Chau and M. Rau and W. Coyle", TITLE="Intelligent network routing using {CCS7} and {ISDN}", BOOKTITLE=globecom, ADDRESS="San Diego", VOLUME=3, PAGES="806.3 (1-5)", YEAR=1990, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Chou90:Comments, AUTHOR="G. L. Choudhury and H. Takagi", TITLE={Comments on "Exact results for nonsymmetric token ring systems"}, JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=8, PAGES="1125-1127", YEAR=1990, KEYWORDS="Queueing system; cyclic service; analysis", } @INPROCEEDINGS{Conw90:Queueing, AUTHOR="A. E. Conway", TITLE="Queueing network modeling of signaling system No. 7", BOOKTITLE=globecom, ADDRESS="San Diego", VOLUME=1, PAGES="406.2 (1-7)", YEAR=1990, KEYWORDS="Signalling; common channel; CCS; performance model", } @ARTICLE{Delb90:Interdeparture, AUTHOR="L. E. N. Delbrouck", TITLE="Interdeparture times in {M/G/1} queueing systems with non-preemptive priority discipline", JOURNAL=orl, VOLUME=9, NUMBER=1, PAGES="65-69", YEAR=1990, KEYWORDS="Queueing system; priority; analysis", } @ARTICLE{Souz90:Note, AUTHOR="E. de Souza and R. R. Muntz", TITLE="A note on the computational cost of the linearizer algorithm for queueing network", JOURNAL=ieeetc, VOLUME="C-39", NUMBER=5, PAGES="840-842", YEAR=1990, KEYWORDS="Queueing network; product form; analysis", } @INPROCEEDINGS{Dist9005:ISDN, AUTHOR="P. Distler and F. Faller", TITLE="Towards an {ISDN} signalling system paving the way for the future", BOOKTITLE=iss, ADDRESS="Stockholm", VOLUME=1, PAGES="49-54 (B1.4)", MONTH="May/June", YEAR=1990, KEYWORDS="Signalling; common channel; CCS", } @TECHREPORT{Fisc90:Waiting, AUTHOR="W. Fischer", TITLE="Waiting Times in Priority Systems with General Arrivals", INSTITUTION="Technical Report, INRS Telecommunications", ADDRESS="Verdun", YEAR=1990, KEYWORDS="Queueing system; priority; analysis", } @ARTICLE{Fuhr90:Intelligente, AUTHOR="W. Fuhrmann", TITLE="Intelligente Vermittlungsfunktionen für Mobilkommunikationsnetze", JOURNAL=ntz, VOLUME=43, NUMBER=4, PAGES="230-236", YEAR=1990, LANGUAGE="German", KEYWORDS="Mobile radio", } @ARTICLE{Fuji90:Error, AUTHOR="M. Fujioka and Y. Ikeda and M. Norigoe", TITLE="Error control criteria in the message transfer part of {CCITT} signaling system No. 7", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=9, PAGES="1630-1636", YEAR=1990, KEYWORDS="Signalling; common channel; CCS; performance evaluation", } @INPROCEEDINGS{Gee9005:British, AUTHOR="R. Gee and D. Ritson", TITLE="British Telecom {CCITT} No. 7 network experience and direction", BOOKTITLE=iss, ADDRESS="Stockholm", VOLUME=1, PAGES="55-60 (B1.5)", MONTH="May/June", YEAR=1990, KEYWORDS="Signalling; common channel; CCS", } @TECHREPORT{Gihr90:Analyse, AUTHOR="O. Gihr", TITLE="Analyse datenflußregulierter Verbindungskonzepte in verteilten Systemen mit mehrschichtiger Protokollarchitektur", TYPE="Bericht über verkehrstheoretische Arbeiten", INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung, Universität Stuttgart", ADDRESS="Stuttgart, Germany", NUMBER=48, YEAR=1990, LANGUAGE="German", KEYWORDS="Communication network; window mechanism; flow control", } @ARTICLE{Gord90:Normalizing, AUTHOR="J. J. Gordon", TITLE="The evaluation of normalizing constants in closed queueing networks", JOURNAL=or, VOLUME=38, NUMBER=5, PAGES="863-869", YEAR=1990, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Gree90:Anti, AUTHOR="L. Green and M. Melamed", TITLE="An {anti-PASTA} result for Markovian systems", JOURNAL=or, VOLUME=38, NUMBER=1, PAGES="173-175", YEAR=1990, KEYWORDS="Queueing theory; number of elements in system", } @INCOLLECTION{Haue90:Intelligente, AUTHOR="H. Hauer and K. Schreier", TITLE="Das Intelligente Netz {(IN)} als Ergänzung zum {ISDN}", BOOKTITLE="ITG-Fachbericht Kommunikation im ISDN --- Erfahrungen und Nutzen", PUBLISHER="VDE-Verlag", VOLUME=113, PAGES="269-274", YEAR=1990, LANGUAGE="German", KEYWORDS="ISDN; intelligent network", } @TECHREPORT{Hube90:Netzknotenkonzept, AUTHOR="M. Huber", TITLE="Ein Netzknotenkonzept für integrierte Durchschaltevermittlung und Paketvermittlung", TYPE="Bericht über verkehrstheoretische Arbeiten", INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung, Universität Stuttgart", NUMBER=49, YEAR=1990, LANGUAGE="German", } @ARTICLE{Ibe90:Polling, AUTHOR="Oliver C. Ibe", TITLE="Analysis of polling systems with mixed service disciplines", JOURNAL=comstat, VOLUME=6, NUMBER=4, PAGES="667-689", YEAR=1990, KEYWORDS="Queueing system; cyclic service; analysis", } @BOOK{Kahl90:ISDN, AUTHOR="P. Kahl", TITLE="{ISDN} -- Das neue Fernmeldenetz der Deutschen Bundespost {TELEKOM.}", PUBLISHER="Dritte Auflage, R. v. Decker's Verlag", ADDRESS="Heidelberg", YEAR=1990, LANGUAGE="German", KEYWORDS="ISDN", } @ARTICLE{Kang90:Graphical, AUTHOR="K. Kang and B. W. Schmeiser", TITLE="Graphical methods for evaluating and comparing confidence-interval procedures", JOURNAL=or, VOLUME=38, NUMBER=3, PAGES="546-553", YEAR=1990, KEYWORDS="Simulation; statistical technique; confidence interval", } @ARTICLE{Keil90:Distributional, AUTHOR="Julian Keilson and L. D. Servi", TITLE="The distributional form of Little's law and the Fuhrmann-Cooper decomposition", JOURNAL=orl, VOLUME=9, NUMBER=4, PAGES="239-247", YEAR=1990, KEYWORDS="Queueing theory; Little's formula", } @ARTICLE{Ladw90:Datenspezifikation, AUTHOR="A. Ladwig and H. König", TITLE="Datenspezifikation mit {ASN.1}", JOURNAL=nte, VOLUME=40, NUMBER=10, PAGES="382-385", YEAR=1990, LANGUAGE="German", KEYWORDS="ASN.1; abstract syntax notation one", } @INPROCEEDINGS{Laws90:Common, AUTHOR="J. J. Lawser and J. Matsumoto and J. M. Pigott", TITLE="Common channel signalling for international services", BOOKTITLE="13th International Switching Symposium (ISS), Ses. B1", ADDRESS="Stockholm", VOLUME=1, PAGES="29-33, Paper 1", YEAR=1990, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Lian90:Signaling, AUTHOR="R. C. Lian and D. M. Rouse and M. Veeraraghavan", TITLE="Signaling architectures, transport, and evolution for broadband services", BOOKTITLE="7th ITC Specialist Seminar on Broadband Technologies", ADDRESS="Morristown", PAGES="15.1", YEAR=1990, KEYWORDS="Signalling", } @ARTICLE{Mela90:Arrivals, AUTHOR="B. Melamed and W. Whitt", TITLE="On arrivals that see time averages", JOURNAL=or, VOLUME=38, NUMBER=1, PAGES="156-172", YEAR=1990, KEYWORDS="Queueing theory; number of elements in system", } @MISC{Pate90:Warteschlangensysteme, AUTHOR="M. Paterok", TITLE="Warteschlangensysteme mit Rückkopplung und Prioritäten.", PUBLISHER="Arbeitsber. des Instituts für Mathematische Masch. und Datenver. (Informatik), Universität Erlangen, Nr.12", ADDRESS="Erlangen", VOLUME=23, YEAR=1990, LANGUAGE="German", KEYWORDS="Queueing system; priority; analysis", } @ARTICLE{Patt90:Approximate, AUTHOR="K. R. Pattipati and M. M. Kostreva and J. L. Teele", TITLE="Approximate mean value analysis algorithms for queuing networks: Existence, uniqueness, and convergence results", JOURNAL=jacm, VOLUME=37, NUMBER=3, PAGES="643-673", YEAR=1990, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Rink90:Intelligent, AUTHOR="W. Rink", TITLE="Intelligent networks", JOURNAL=nte, VOLUME=40, NUMBER=5, PAGES="162-165", YEAR=1990, KEYWORDS="Intelligent network", } @TECHREPORT{Saue90:Integration, AUTHOR="K. P. Sauer", TITLE="Integration von Sprachkommunikation und Datenkommunikation in Lokalen Netzen", TYPE="Bericht über verkehrstheoretische Arbeiten", INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung, Universität Stuttgart", ADDRESS="Stuttgart", NUMBER=50, YEAR=1990, LANGUAGE="German", KEYWORDS="LAN; voice/data integration", } @UNPUBLISHED{Sidi90:Queueing, AUTHOR="M. Sidi and H. M. Levy and S. W. Fuhrmann", TITLE="A queueing network with a single cyclically roving server", PAGES="1-23", NOTE="Unpublished extended version of [Sidi1990].", YEAR=1990, KEYWORDS="Queueing system; cyclic service; analysis", } @ARTICLE{Taka9007:Priority, AUTHOR="H. Takagi", TITLE="Priority queues with setup times", JOURNAL=or, VOLUME=38, NUMBER=4, PAGES="667-677", MONTH="July/August", YEAR=1990, KEYWORDS="Queueing system; priority; analysis", } @ARTICLE{Taki90:Asymmetric, AUTHOR="T. Takine and H. Takagi and Yutaka Takahashi and Toshiharu Hasegawa", TITLE="Analysis of asymmetric single-buffer polling and priority systems without switchover times", JOURNAL=pe, VOLUME=11, NUMBER=4, PAGES="253-264", YEAR=1990, KEYWORDS="Queueing system; cyclic service; analysis", } @ARTICLE{Wenz90:Zeichengabesystem, AUTHOR="G. Wenzel", TITLE="Das Zeichengabesystem {CCITT} Nr.7: Neue Möglichkeiten durch komplexe Netzmanagement-Funktionen", JOURNAL="ITG-Fachbericht Kommunikationsnetze der Zukunft", PUBLISHER="VDE-Verlag GmbH, Berlin", VOLUME=115, PAGES="15-21", YEAR=1990, LANGUAGE="German", KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Wolf9001:Note, AUTHOR="R. W. Wolff", TITLE="A note on {PASTA} and {anti-PASTA} for continuous-time Markov chains.", JOURNAL=or, VOLUME=38, NUMBER=1, PAGES="176-177", MONTH="January/February", YEAR=1990, KEYWORDS="Queueing theory; number of elements in system", } @BOOK{Wohl90:Planung2, AUTHOR="G. Wöhlbier", TITLE="Planung von Telekommunikationsnetzen, Bd. 2", SERIES="Technik der Telekommunikation", PUBLISHER="R. v. Decker's Verlag G. Schenck", ADDRESS="Heidelberg", VOLUME="26/27", YEAR=1990, LANGUAGE="German", KEYWORDS="Network planning; circuit switching; optimization", ANNOTE="Band 2: Dienstspezifische Netze und Einzelaufgaben", } @ARTICLE{Brac90:Dense, AUTHOR="C. A. Brackett", TITLE="Dense Wavelength Division Multiplexing Networks: principles and applications", JOURNAL=ieeejsac, VOLUME="SAC-8", NUMBER=6, PAGES="948-964", YEAR=1990, REFERENCES=68, KEYWORDS="WDM; wavelength division multiplex; star network; LAN; optical LAN; technology; optical switching", ANNOTE="In this paper, we review recent progress on multiwavelength networks, some of the limitations which affect the performance of such networks, and present examples of several network and switch proposals based on these ideas. We also discuss the critical technologies that are essential to progress in this field.", } @ARTICLE{Chen90:Media, AUTHOR="M.-S. Chen and N. R. Dono and R. Ramaswami", TITLE="A Media-Access Protocol for Packet-Switched wavelength division multiaccess metropolitan area networks", JOURNAL=ieeejsac, VOLUME="SAC-8", NUMBER=6, PAGES="1048-1057", YEAR=1990, REFERENCES=20, KEYWORDS="LAN; MAN; WDM; wavelength division multiplex; star; optical LAN", ANNOTE="A dynamic time-wavelength division multiaccess protocol (DT-WDMA) is proposed for metropolitan-sized multichannel optical networks employing fixed wavelength transmitters and tunable optical receivers. Control information is sent over a dedicated signaling channel and data are sent over channels owned by the transmitter. Time is divided into slots on each channel and slots in the control channel are further split into mini-slots.", } @INPROCEEDINGS{Cran90:Implementing, AUTHOR="C. J. Cranfill", TITLE="Issues in Implementing a Public Metropolitan Area Network", BOOKTITLE=icc, PAGES="1572-1575", YEAR=1990, REFERENCES=5, KEYWORDS="Man; implementation; public network", ANNOTE="A Metropolitan Area Network (MAN) is loosely defined, and to most people, it is a means of enabling diverse computing facilities to communicate over high speed links within a city-wide area. This paper defines a MAN and establishes one possible approach to Metropolitan Area Networking. Included are discussions on goals, strategies, current and future technologies, markets, and the issues related to the evolution from MAN to BISDN.", } @ARTICLE{From90:Hybride, AUTHOR="I. Fromm", TITLE="Hybride Netze für Sprachkommunikation und Datenkommunikation", JOURNAL=datacom, PAGES="92-99", YEAR=1990, LANGUAGE="German", KEYWORDS="Dqdb; fddi-ii; man", ANNOTE="This paper highlights the roll of MANs in the area op communication. FDDI-II and DQDB are described and compared.", } @INPROCEEDINGS{Glan90:DenseFDM, AUTHOR="B. S. Glance and O. Scaramucci", TITLE="Dense {FDM} coherent optical network with random access provided by digitally tuned transmitters and receivers", BOOKTITLE="OFC", PAGES="14-15", YEAR=1990, REFERENCES=5, KEYWORDS="WDM; wavelength division multiplex; multichannel; technology; dma=frequency division multiple access", } @INPROCEEDINGS{Henr90:Optical, AUTHOR="P. S. Henry", TITLE="Optical Wavelength Division Multiplex", BOOKTITLE=globecom, YEAR=1990, KEYWORDS="WDM; wavelength division multiplex; optical LAN; protocol", } @ARTICLE{Hint90:Photonic, AUTHOR="H. S. Hinton", TITLE="Photonic Switching Fabrics", JOURNAL=ieeecm, VOLUME=28, NUMBER=4, PAGES="71-89", YEAR=1990, KEYWORDS="Optical switching; star", } @ARTICLE{Imai90:ATMR, AUTHOR="K. Imai and T. Honda and Hideki Kasahara and T. Ito", TITLE="{ATMR:} Ring Architecture for Broadband Networks", JOURNAL="IEEE", PAGES="1734-1738", YEAR=1990, REFERENCES=9, KEYWORDS="ATM; ring network; broadband; hsLAN; man", ANNOTE="A shared-medium networking approach based on an Asynchronous Transfer Mode ring (ATMR) scheme is proposed for constructing broadband networks such as high-speed LANs, Metropolitan Area Networks (MANs), and access networks for Broadband ISDN. The functional requirements for broadband access networks are discussed, followed by a description of ATMR technical features - including protocols, networking and Access Node system architecture.", } @INPROCEEDINGS{Nass90:Cyclic, AUTHOR="M. Nassehi", TITLE="Cyclic-Reservation Multiple-Access Scheme for Gbit/s {LANs} and {MANs} based on Dual-Bus Configuration", BOOKTITLE=efoc, ADDRESS="München", PAGES="246-251", YEAR=1990, REFERENCES=11, KEYWORDS="bus; LAN; protocol; CRMA; cyclic reservation multiple access", ANNOTE="Cyclic-Reservation Multiple-Access (CRMA) is an access scheme for Gbit/s LANs and MANs. CRMA offers high throughput efficiency and fairness independent of the network speed or distance. Nodes can reserve consecutive slots for transmitting each packet, thus facilitating packet reassembly. Furthermore, they experience minimal access delays at low loads. Here, the operation of CRMA on a dual-bus configuration is described.", } @ARTICLE{CCIT90:Requirements, AUTHOR="C. C. ITT", TITLE="Requirements for {GFC} mechanism and a proposed protocol for {GFC}", JOURNAL="Nippon Telegraph and Telephone Corporation (NTT)", YEAR=1990, REFERENCES=4, KEYWORDS="Flow control; ATM", ANNOTE="This contribution discusses requirements for the Generic Flow Contorl (GFC) mechanism at the point SB and SSB which are defined in the accompanied contribution entitled ``Clarification of multipoint physical configurations at the UNI to specify GFC mechanism''. Aproposal for a GFC protocol is also described as a solution for shared medium applications as well as for point-to-point configurations.", } @ARTICLE{CCIT90:Clarification, AUTHOR="C. C. ITT", TITLE="Clarification of multipoint physical configurations at the {UNI} to specify {GFC} mechanism", JOURNAL="Nippon Telegraph and Telephone Corporation (NTT)", PAGES=4, YEAR=1990, KEYWORDS="Flow control", ABSTRACT="This contribution proposes a clarification of physical configurations for the user/network interface of multipoint applications. Based on the revised configurations including multiaccess TE connections, a basic GFC mechanism required for each reference point is discussed.", } @TECHREPORT{JTCS90:Functional, AUTHOR="J. T. C1/SC6/WG6", TITLE="Functional Requirements for High-speed Private Integrated Services Networks based on Shared-medium Access Technology and Study Items for Standardization", INSTITUTION="NTT Communication Switching Laboratories", NUMBER="RTP 71", PAGES=5, YEAR=1990, KEYWORDS="High-speed LAN", ANNOTE="Following the view proposed in the document JTC1SC6 WG6 N16 entitled ``Comments on High-speed Integrated Services Networks and User/Network Interface to High-speed Integrated Services Networks'' submitted by the Japanese National Body at the first WG6 Paris meeting, the functional requirements for High-speed Private Integrated Services Networks (HS-PISN) are discussed with special reference to shared-medium multiaccess network technology.", } @TECHREPORT{JTCS90:New, AUTHOR="J. T. C1/SC6/WG6", TITLE="A New Ring Protocol for {HS-PISN} based on Asynchronous Transfer Mode", INSTITUTION="NTT Communication Switching Laboratories", NUMBER="RTP 71", PAGES=4, YEAR=1990, KEYWORDS="ATM; hslan", ANNOTE="Based on the requirements discussed in the accompanying contribution entitled ``Functional Requirement for HS-PISN based on Shared-medium Access Technology and Study Items for Standardization'' a new multiaccess protocoll based on slotted ring technology with the ATM integrated accessing mode is introduced for HS-PISN construction (ATMR).", } @TECHREPORT{JTCS90:Asynchronous, AUTHOR="J. T. C1/SC6/WG6", TITLE="Specification of the Asynchronous Transfer Mode Ring {(ATMR)} Protocol", INSTITUTION="NTT Communication Switching Laboratories", NUMBER="RTP 71", PAGES=53, YEAR=1990, REFERENCES=10, KEYWORDS="ATM; ring network; HSLAN; MAN", ANNOTE="The specification of the ATMR protocol defines a high-speed multiaccess network protocol based on the Asynchronous Transfer Mode, capable of supporting multimedia services on various networks. The ATMR protocol operates on a slotted ring network which primarily consists of two counter-rotating rings. The protocoll can also be applied to a single ring and the Torus structure defined in the Orwell specification.", } @ARTICLE{Poo90:OSI, AUTHOR="G. S. Poo and W. Ang", TITLE="{OSI} protocol choices for {LAN} environments", JOURNAL=ccr, VOLUME=13, NUMBER=1, PAGES="17-26", YEAR=1990, REFERENCES=46, KEYWORDS="LAN; osi; iso reference model", ANNOTE="This paper provides an in-depth analysis on the requirements of the complimentary services of connectionless versus connection-oriented functions for each layer in oder to select a set of cooperative protocol suites appropriate for use in interconnected heterogeneous local area networks.", } @INPROCEEDINGS{Schw90:XTP, AUTHOR="W. D. Schwaderer", TITLE="{XTP} in {VLSI} Protocol Decomposition for {ASIC} Implementation", BOOKTITLE="15th International Conference on LocalComputer Network", ADDRESS="Minneapolis", PAGES="249-252", YEAR=1990, REFERENCES=3, KEYWORDS="Protocol; transport protocol; vlsi", ANNOTE="The provision of VLSI support for protocols is viewed here as an exercise in decomposition of protocol processing. First, XTP is described as a representative protocol with some new features. Next, a general-purpose VLSI architecture is described that supports XTP and other protocols.", } @TECHREPORT{Ferr90:Scheme, AUTHOR="D. Ferrari and Dinesh Verma", TITLE="A Scheme for Real-Time Channel Establishment in Wide-Area Networks", TYPE="Technical Report", INSTITUTION="UC Berkeley", PAGES="1-24", YEAR=1990, KEYWORDS="realtime multimedia QOS (quality of service) deadline-based scheduling WAN delay guarantees traffic management traffic control ATM simulation flow control channel establishment channel establishment overhead scheduling and flow control overhead statistical vs. deterministic channels burstiness", ABSTRACT="[NOTE - THIS PAPER IS VIRTUALLY IDENTICAL TO FerVer90c WITH FEW MODIFICATIONS]. Multimedia communication involving digital audio and/or digital video has rather strict delay requirements. A real-time channel is defined in this paper as a simplex connection between a source and a destination characterized by parameters representing the performance requirements of the client. A real-time service is capable of creating real-time channels on demand and guaranteeing their performance. These guarantees often take the form of lower bounds on the bandwidth allocated to a channel and upper bounds on the delays to be experienced by a packet on the channel. In this paper, we study the feasibility of providing real-time services on a packet-switched store-and-forward wide-area network with general topology. We describe a scheme for the establishment of channels with deterministic or statistical delay bounds, and present the results of the simulation experiments we ran to evaluate it. The results are encouraging; our approach satisfies the guarantees even in worst-case situations, uses the network's resources to a fair extent, and efficiently handles channels with a variety of offered load and burstiness characteristics. Also, the packet transmission overhead is quite low, and the channel establishment overhead is small enough to be acceptable in most practical cases.", URL="ftp://tenet.berkeley.edu/pub/tenet/Papers/FerVer90a.ps", } @TECHREPORT{Ferr90:Buffer, AUTHOR="D. Ferrari and Dinesh Verma", TITLE="Buffer Space Allocation for Real-Time Channels in a Pachet-Switching Network.", TYPE="Technical Report", INSTITUTION="UC Berkeley", PAGES="1-20", YEAR=1990, KEYWORDS="realtime traffic management resource management QOS (quality of service) distributed rate control queue management channel establishment buffer space management deterministic buffer statistical buffer simulation statistical vs. deterministic channels", ABSTRACT="Broadband integrated networks will have to offer real-time communication services; that is, they will have to transport information with performance guarantees. A paper previously published by the authors presented a scheme for establishing real-time channels in a pure packet-switching network; that scheme did not include any method for allocating buffer space in the network's nodes to the channels being established. This paper completes the description and evaluation of that scheme, since it presents one such method, and some of the results of the extensive simulations performed to test it. The method is found to be correct and to have a low overhead. While the utilization of the buffer space allocated to the statistical channels is often quite low, thereby indicating that our worst-case approach tends to overallocate space to those channels, the space our method gives to deterministic channels seems to be reasonably well utilized.", URL="ftp://tenet.berkeley.edu/pub/tenet/Papers/FerVer90b.ps", } @TECHREPORT{Ferr90:Real, AUTHOR="D. Ferrari and Dinesh Verma", TITLE="Real-Time Communication in a Packet-Switching Network", TYPE="Technical Report", INSTITUTION="UC Berkeley", PAGES="1-15", NOTE="also in Proc. Second International Workshop on Protocols for High-Speed Networks, Palo Alto, November 1990", YEAR=1990, KEYWORDS="realtime multimedia QOS (quality of service) deadline-based scheduling WAN delay guarantees traffic management traffic control ATM simulation flow control channel establishment channel establishment overhead scheduling and flow control overhead statistical vs. deterministic channels burstiness", ABSTRACT="[NOTE - THIS PAPER IS VIRTUALLY IDENTICAL TO FerVer90a WITH FEW MODIFICATIONS. MODIFICATIONS WERE POSSIBLY INCLUDED BECAUSE THE PAPER WAS PREPARED FOR PRESENTATION AT Proc. Second International Workshop on Protocols for High-Speed Networks, Palo Alto, November 1990]. Broadband integrated networks will have to offer real-time communication services; that is, they will have to transport information with performance guarantees. A real-time service is defined as one capable of providing connections with performance guarantees (the real-time channels) on demand and ensuring that the guarantees are always satisfied. These guarantees can be of various types, e.g., a lower bound on the throughput of a connection, an upper bound on delays and delay variation experienced by a packet on a channel, or an upper bound on the packet loss rate. In this paper, we study the feasibility of providing real-time services on a packet-switched store-and-forward wide-area network with general topology. We describe a scheme for the establishment of channels with deterministic or statistical delay and delay variation bounds and bounded loss rates, and present the results of the simulation experiments we ran to evaluate it. The results are encouraging; our approach satisfies the guarantees even in worst-case situations, uses the network's resources to a fair extent, and efficiently handles channels with a variety of offered load and burstiness characteristics. Also, the packet transmission overhead is quite low, and the channel establishment overhead is small enough to be acceptable in most cases.", URL="ftp://tenet.berkeley.edu/pub/tenet/Papers/FerVer90c.ps", } @TECHREPORT{Ferr90:Quality, AUTHOR="D. Ferrari and Dinesh Verma", TITLE="Quality of Service in {ATM} Networks", TYPE="Technical Report", INSTITUTION="UC Berkeley", PAGES="1-16", YEAR=1990, KEYWORDS="ATM admission control traffic management resource management QOS (quality of service) scheduling policy (queue management) ATM; traffic policing traffic enforcement rate control simulation traffic modeling CSIM", ABSTRACT="BISDN networks of the future will have to handle traffic with a wide range of traffic characteristics and performance requirements. In view of the high bandwidth of these networks and the relatively large propagation delays involved in wide-area BISDN networks, the performance requirements can only be provided by reserving resources to communicating clients at the connection establishment time. However, reservation mechanisms for heterogenous bursty traffic usually result in a rather poor utilization of network resources. In this paper, we propose a simple admission control criterion that can be used to reserve resources for bursty as well as smooth traffic with delay and loss sensitivities. Our scheme leads to a reasonable value of the maximum utilization of network bandwidth (about 40\%) for delay sensitive traffic with moderate burstiness (peak-to-average bandwidth ratios of about 4), even under the worst possible conditions. Actual utilizations can be higher if there is smooth traffic or traffic which is not delay-sensitive. Our admission control algorithm uses a well-defined traffic specification scheme which is easy to enforce and verify, and able to accommodate arbitrary degrees of burstiness. Extensive simulation experiments failed to show that our admission control criterion are incorrect, in the sense that the quality of service requirements of the traffic was always met, even in the worst case. Moreover, the scheme is simple and feasible at the high speeds required of BISDN networks.", URL="ftp://tenet.berkeley.edu/pub/tenet/Papers/FerVer90d.ps", } @ARTICLE{Su90:Switching, AUTHOR="Allan Sulkin", TITLE="Switching Video through a {PBX}", JOURNAL=bcr, YEAR=1990, ABSTRACT="video; PBX; switching", } @INPROCEEDINGS{Trev90:Experience, AUTHOR="Sergio Treves", TITLE="Experience from Early Applications of Broadband Professional Communications", BOOKTITLE=icc, PAGES="5-9 (201.2.1-201.2.5)", YEAR=1990, KEYWORDS="broadband applications image communications network planning telemedicine tele-education electronic publishing interactive CAD CAE CAM network modeling and dimensioning", ABSTRACT="Generally, applications constitute the most important aspect in which telecommunication users are concerned. This paper reports on the experience gained in Italy from some early applications of broadband professional communications in the sectors of telemedicine, tele-education, electronic punlishing and industrial design and manufacruring. Network elements and architecture are based on proven technologies related to a pre-broadband ISDN environment.", } @INPROCEEDINGS{Bour90:Heathrow, AUTHOR="J. Bourne and Mark. Balmes and Jim. Justice", TITLE="Heathrow - Experience and Evolution", BOOKTITLE=icc, PAGES="27-31, 203.2.1-203.2.5", YEAR=1990, KEYWORDS="FTTH (fiber to the home) fiber loop fiber distribution POTS ISDN CATV; video transport for WDM", ABSTRACT="Through the installation of fiber to residential customers in the community of Heathrow, Florida, Southern Bell, Northern Telecom and BNR are working to evolve fiber loop technology for large scale deployment. The system at Heathrow delivers POTS, ISDN, and video transport for CATV. POTS was cut into service in June 1988, followed by ISDN in November 1988, and video in June 1989. The design and operation of the system has influenced not only the technology and architecture of future systems but also provisioning methods, splicing techniques and installation of the fiber optic network interface at the customer's premises.", } @INPROCEEDINGS{Jens90:Fiber, AUTHOR="Joseph D. Jensen and William Weeks", TITLE="Fiber to the Pedestal \ldots Then What?", BOOKTITLE=icc, PAGES="32-34, 203.3.1-203.3.3", YEAR=1990, KEYWORDS="fiber distribution FTTC (fiber to the curb) service evolution subscriber loop; architecture ONU (optical network unit) subscriber loop IEEE P1396 Combus", ABSTRACT="Fiber-to-the-Pedestal distribution systems will be cost competitive with POTS on copper by the early 1990's. One major criterion for installed fiber distribution architectures is that a cost-minimized, upgradeable platform is created for future service evolution. The intent of this paper is to present possible avenues for evolution of the fiber pedestal. The effects are analysed on three key components of the fiber-based distribution system; the architecture, the Optical Network Unit, and the subscriber loop. The technical and economic issues regarding the evolution towards various broadband networks are also provided", } @INPROCEEDINGS{Bail90:Redefining, AUTHOR="A. J. Ph. D. Bailetti and H. M. Bender", TITLE="Redefining What is Meant by Quality of Customer Premises Equipment", BOOKTITLE=icc, PAGES="35-38, 204.1.1-204.1.4", YEAR=1990, KEYWORDS="CPE telecommunications management", ABSTRACT="Traditionally, quality of customer premises equipment (CPE) has meant conformance and reliability while quality of after sales service has meant lowest downtime period. It is argued that although these definitions may be adequate when CPE buyers use their communication facilities as internal technical utilities, they are unsuitable when they use them as business resources to create value for customers. The trends likely to prevail well into the 21st century are expected to exert pressure to define CPE quality in terms of conformance to buyers' business strategies, and outmode the concept of quality as conformance to technical specifications developed by quality assurance groups. Five main implications of this change for quality managers are identified.", } @INPROCEEDINGS{Patt90:Implications, AUTHOR="John F. Patterson", TITLE="The Implications of Window Sharing for a Virtual Terminal Protocol", BOOKTITLE=icc, PAGES="66-70, 207.1.1-207.1.5", YEAR=1990, KEYWORDS="shared window WYSIWIS virtual terminal protocol interprocess communication protocol X Window NeWS bridge extra-application communication mutual pointing; personalized cursors display management window state information synchronization virtual terminal protocol guidelines", ABSTRACT="Window sharing permits simultaneous presentation of information on multiple workstations. As a ubiquitous capability, it requires a virtual terminal standard that is in widespread use. This paper considers four ways in which window sharing can affect the definition of a virtual terminal protocol. The concerns are; extra-application communication, application references, autonomous output, and application state. Guidelines are offered to suggest how a virtual terminal protocol might best accommodate window sharing.", } @INPROCEEDINGS{Timm90:Broadband, AUTHOR="Stephen Timms", TITLE="Broadband Communications in the 1990s; a Market Model", BOOKTITLE=icc, PAGES="71-75, 207.2.1-207.2.5", YEAR=1990, KEYWORDS="forecast; broadband market; BISDN; fiber deployment schedules; integrated broadband access (IBA) forecast; residential and business services; equipment markets; market analysis", ABSTRACT="The paper presents a scenario for the development of broadband communications in the course of the next decade, and shows how the scenario has been used by Ovum to project the size of the broadband communications market to the year 2000. Detailed market forecases are included for the USA, UK, France and Germany.", } @INPROCEEDINGS{Bigi90:Marketing, AUTHOR="France. Bigi and G. Cordaro", TITLE="Marketing Perspectives for Business Broadband Services in Europe", BOOKTITLE=icc, PAGES="76-80, 207.3.1-207.3.5", YEAR=1990, KEYWORDS="RACE ETCO CEC EEC EFTA forecast; scenarios for broadband evolution TV HDTV videoconferencing videotelephony facsimile fax market analysis", ABSTRACT="In the context of the RACE programme (Research and Development in Advanced Communication Technologies in Europe) the results of a market research on business broadband services led by the Commission of the European Communities and ETCO are presented, covering the EEC and EFTA countries. Three possible scenarios for the evolution of broadband telecommunications services are analyzed. For each scenerio the forecasts in terms of users in 1996 are presented for the following services; videoconference, videotelephony, high speed data transmission, high speed facsimile, TV and high quality TV transportation, high quality sound transportation.", } @INPROCEEDINGS{Naka90:Personal, AUTHOR="Kohzoh. Nakamura and Masahiro. Takahashi and Nagaharu. Hamada and Tatsuki. Inuzuki and Norifumi. Yanai and Seiji. Maruo and Keiko. Kaneda", TITLE="Personal Multimedia Teleconferencing Terminal", BOOKTITLE=icc, PAGES="123-127, 211.2.1-211.2.5", YEAR=1990, KEYWORDS="MM multimedia ISDN NISDN ADCT teleconference video codec", ABSTRACT="This paper describes design concepts, functions and architecture of a developed personal multimedia teleconferencing terminal which realizes face-to-face like communications over a narrowband ISDN by integrating voice, video, high resolution bilevel graphics, full color still pictures, handwritten images and handwritten pointers.", } @INPROCEEDINGS{Weis90:Desktop, AUTHOR="Christoph Weiss", TITLE="Desktop Video Conferencing - An Important Feature of Visual Communications", BOOKTITLE=icc, PAGES="134-138, 212.1.1-212.1.5", YEAR=1990, KEYWORDS="video videoconferencing videotelephony videoconferencing; desktop videoconferencing; field trial videoconferencing; conference server videoconferencing; prototype", ABSTRACT="Use of the video telephone is normally restricted to two parties. It can be extended by including desk top conference facilities. Employing such facilities from conference rooms or studios tends to restrict spontaneity in their use. This is not the case when a feature of this type is available in the workplace. A multifunctional terminal suitable for this purpose will be demonstrated. A solution will also be presented which makes provision for a conference server for editing sound and picture signals at the switch. Four broadband technology implementation options are described for the video unit and for narrowband technology the particular problems involved are pointed out.", } @INPROCEEDINGS{Goel90:Evolution, AUTHOR="Ernst-Heinrich. Goeldner", TITLE="The Network Evolution Towards {BISDN;} Applications, Network Aspects, Trials (e.g. {BERKOM)}", BOOKTITLE=icc, PAGES="140-144, 212.2.1-212.2.5", YEAR=1990, KEYWORDS="BIGFON BERKOM BERGATE RADKOM medicine medical LAN video videotelephony TV distribution broadband BISDN trials trial testbed applications SMDS ATM STM (synchronous transfer mode) RACE switching", ABSTRACT="Broadband communication is on its way to becoming reality. Several trials and pilot projects challange technology and system development to provide the basis for new applications, which are not possible in existing narrowband networks. This paper deals with some examples of broadband communications, carried out during the field trials BIGFON and BERKOM. A possible evolution from existing narrowband ISDN exchanges to a universal, ATM-based broadband ISDN exchange is outlined, and finally the current work in BERKOM and RACE is summarized.", } @INPROCEEDINGS{Walv90:Broadband, AUTHOR="Edward A. Dr. Walvick", TITLE="Broadband Services, Application and Evolution", BOOKTITLE=icc, PAGES="151-153, 215.1.1-215.1.3", YEAR=1990, KEYWORDS="ISDN; BISDN; NYNEX; transition to BISDN network services; business applications; network services; business applications; SMDS; network services; medical network services; travel network services; publishing network services; advertising network services; realty network services; residential market network services; insurance and legal market", ABSTRACT="This paper addresses the broadband services which NYNEX anticipates offering through its telephone companies. Also addressed is the uses (applications) to which we expect our customers will put these services. Finally, since we recognize that universal availability of broadband will require network investment in the multibillion dollar range, we talk about services which will be rolled out within the next few years and the path along which we can evolve to universal broadband. INTRODUCTION - Telephone companies are going through what may be the most significant change in network architecture since the introduction of central office switches. The introduction of Integrated Services Digital Network (ISDN) will have major impact on both the structure of the network and how our customers use our services. ISDN is designed to allow the network to handle digital (data) services with the same ease as it handles analog (voice) services. The step beyond ISDN is already on the horizon. Although it has not yet been fully defined and will not be ready until the next century, Broadband ISDN (BISDN), otherwise known as the Integrated Broadband Network (IBN) is already being worked on in the laboratories. The NYNEX Corporation is heavily involved in planning for the next generation of services and network architecture. NYNEX has interest in quite a few areas relating to broadband, from the sale of premises products to the provision of professional services such as complete systems integration, network management, training, etc. This paper limits itself to the future of broadband services provided by telephone companies, and the uses which we expect people will make of the services. It emphasizes a transition approach which, by working directly with customers, will move gradually from existing technologies toward a broadband architecture. It is the transition approach which will assure that the telephone networks are designed to meet customer needs.", } @INPROCEEDINGS{Naga90:Improvements, AUTHOR="K+. Nagaraj and J. G. Gruber and J+. Leeson and Bernard Fleury", TITLE="Improvements in Availability and Error Performance of {SONET} Compared to Asynchronous Transport Systems", BOOKTITLE=icc, PAGES="248-254, 224.1.1-224.1.7", YEAR=1990, KEYWORDS="SONET; vs. Async reliability LTE (line terminating equipment) DCS (digital cross-connect systems) ADM (add-drop multiplex) reliability performance objectives DS3 DS1", ABSTRACT="This paper compares SONET and Asynchronous (Async) systems in the context of stringent network error performance and availability requirements for future video, imaging, and other critical services. The paper asserts that the SONET approach should provide superior network performance owing to integrated functionality, resulting in correspondingly less exposure to operationally induced errors and outages, and fewer component failures. An analysis of the preliminary data supports this assertion. Significant improvements are also expected when the analysis is extended to the DS1 level. In particular, it is demonstrated by way of representative SONET and Async based Hypothetical Reference Digital Paths (HRDPs), that the SONET approach significantly reduces the number of circuit packs, manual cross-connect panels and associated jumper cables, patch cords and connectors. Since these components are prone to failure and procedural errors, reduction in their numbers result in a significant improvement in error performance and availability of the transport network 1. INTRODUCTION It is expected that SONET-based Network Elements (NEs) will be widely deployed in access, metropolitan (metro), and toll networks to transport both today's services (e.g., DS0, DS1, DS3) and tomorrow's services . (e.g., High Quality Video, High Resolution Imaging, High Speed Data). Contrary to the existing Async hierarchy, the advantage of the SONET format is the observability of DS0, DS1, and DS3 signals and the consequent ease with which these signals can be manipulated (e.g., multiplexed, Add-Dropped. Cross-Connected). The SONET standard also eliminates the back-to-back DS1 and DS3 intermediate interfaces that are required in today's Async transmission networks. The higher level of integration possible with SONET leads to fewer components at transmission nodes, and, less susceptibility to failures and errors due to both intrinsic causes and maintenance activities. Therefore, this paper asserts that SONET, with inherently fewer equipment components, has the potential to offer improved availability and error performance over Async systems for both current and future services. An analysis of availability and error performance data indicates the degree to which various equipment components contribute to the degradation in availability and error performance of DS3 paths, because of maintenance activities and other causes. This will affect emerging new services (e.g. High Quality Video, High Resolution Imaging, High Speed Data) which generally require more stringent error performance and possibly availability requirements. This paper examines error performance objectives for these new services, and presents preliminary views of these objectives. To test the above assertion, this paper estimates the difference in the availability and error performance of SONET and Async-based transport systems, and compares the results to the network objectives as allocated to the relevant components in the network.", } @INPROCEEDINGS{Apri90:Impact, AUTHOR="Thomas J. Aprille and William S. Brinkley and John W. Mulcahy", TITLE="The Impact of a Synchronous Digital Network on the End-User", BOOKTITLE=icc, PAGES="255-257, 224.2.1-224.2.3", YEAR=1990, KEYWORDS="SONET", } @INPROCEEDINGS{Jian90:Queueing, AUTHOR="X. Jiang and J. S. Meditch", TITLE="A Queueing Model for {ATM-based} Multi-Media Communication Systems", BOOKTITLE=icc, PAGES="264-267 (301.2.1-301.2.4)", YEAR=1990, KEYWORDS="ATM queue; discrete-time; non-preemptive multimedia communications queueing queueing; priority schemes queueing model moment generating function", ABSTRACT="To provide multi-media communications, a carrier system should be able to support certain priority schemes. In this paper, we present analytic results for a discrete-time, non-preemptive priority queueing system which can be used to model ATM-based multi-media communication systems which give different priorities to various types of traffic. 1. Introduction Asynchronous transfer mode (ATM) is the target solution to support future integrated services. ATM systems have the advantages of service and network flexibility, which include decoupling of user services from network capability, dynamic allocation of bandwidth and the ability to serve any combination of different types of traffic [1]. Recently, ATM standards have recommended the allocation of traffic type and priority bits in the header of each cell. Thus, priority schemes can be implemented in ATM switches to accommodate performance requirements for various types of traffic. For multi-media communication systems. ATM is clearly a preferred choice. In this paper, we present some preliminary results for a discrete-time, non-preemptive priority queue which can be used to model ATM based multi-media communication systems. Discrete-time queueing systems have been studied as early as 1958 [2], but relatively few results are available at this time compared to continuous-time queueing systems. However, discrete-time queues are appropriate for modelling ATM systems in which the time axis is slotted and fixed length packets, called cells, are used to transfer information bits. To analyse the performance of priority ATM systems, we developed a model for non-preemptive queues which have general service time distributions since in many proposed multistage, self-routing ATM switches, it may take a number of slots for an ATM cell to pass through the fabric. In addition to specifying the average waiting times, this paper also provides a closed-form solution for the queueing system delay. Thus, higher order moments and probability mass function of delay can be obtained and used, to evaluate performance for delay constrained traffic. In Section 2 of this paper, we give the assumptions. In Section 3, we derive the average waiting time, and in Section 4, we present the derivation for the moment generating function of the time a customer spends in the system. We conclude our paper in Section 5 with a brief discussion of our results.", ANNOTE="Non-preemptive priority queue with general service time distribution and $L$ classes, Bernoulli arrivals. (hgs)", } @INPROCEEDINGS{Saam90:Economic, AUTHOR="Thomas J. Saam", TITLE="The Economic Benefits of {VSAT's}", BOOKTITLE=icc, PAGES="370-375, 304.4.1-304.4.6", YEAR=1990, KEYWORDS="VSAT (Very Small Aperture Satellite Terminals)", ABSTRACT={Very Small Aperture satellite Terminals (VSATs) provide cost-effective solutions for growing telecommunications needs throughout the world. This paper describes several state-of-the-art VSAT systems currently in production and compares their economics with terrestrial networks. A real network example is analyzed in the context of VSAT technology alternatives. INTRODUCTION High-tech ventures are often short-lived. Development costs and unrealistic market expectations cause product failure. However, longevity improves when technology is properly matched with the economic needs of a market. The maturing VSAT industry is a good example. The early history of VSATs includes numerous failed start-ups, volatile contracts, and corporate buy-outs. Edwin B. Parker, an industry pioneer, is recently quoted [1]; "VSATs are still on the bleeding edge of technology.{"} Past ventures like the Satellite Business Systems project failed while attempting to compete with high-bandwidth terrestrial services. Yet the VSAT industry is experiencing a resurgence due to explosive market potential and improved VSAT designs which favor network economics. VSATs offer cost savings for some, but not all, telecommunication application. Cost savings are sensitive to variables in VSAT technology and competing terrestrial market conditions. This paper illustrates how VSAT technology is best matched to market needs by evaluating technology trade-offs. references=; [1] G. Quackenbush, {"}Equatorial Communications Company; A Profile,{"} Telecommunications N. American Ed., Vol. 21, June, 1987, p.49.}, } @INPROCEEDINGS{Vers90:Aspects, AUTHOR="R. A. Verstraete and H. J. M. Decuypere", TITLE="Aspects of Intelligent Networks in an {ATM} Environment", BOOKTITLE=icc, PAGES="434-438, 306B.1.1-306B.1.5", YEAR=1990, KEYWORDS="IN (intelligent networks) ATM call control", ABSTRACT={The goal of Intelligent Networks (IN) is to realize a control architecture with an open-ended functionality such that new features can be introduced in a simple manner. One of the objectives of the Asynchronous Transfer Mode (ATM) is to provide flexible broadband transport resources such that multi-media calls can be created in a simple manner. In this paper we examine the relationship between the goals of ATM and IN. We first describe the background of and motivation for our work, followed by a discussion of some ATM aspects that relate to IN. A brief overview of the fundamental synergy between ATM and IN concludes our contribution. 1. INTRODUCTION The public switched telecommunication network is currently undergoing a rapid evolution, and this fact manifests itself in different aspects of our telecommunication environment. Two aspects are of particular concern in this paper, namely the Asynchronous Transfer Mode (ATM) and Intelligent Networks (IN). Stated briefly, the goal of IN is to realize a control architecture with an open-ended functionality such that it allows new features to be introduced in a simple manner (for instance, though not necessarily, from a remote location) [7,5]. In other words, IN creates a flexible mechanism for providing on a global network basis services such as Call Transfer, Call Completion, Three-Party Service, and other even more complex services. ATM provides a universal bearer capability [3], and multi-media services can be formed by combining multiple transport connections of different characteristics (bandwidth, bit-error-rate, etc.). One of the objectives of the ATM control architecture is therefore to provide flexible transport resources such that transport paths of different characteristics (for example, video, speech, data) can be combined in a simple manner. Our work addresses both the aspects of ATM and IN because the goals of ATM and IN are intimately related to each other, as will be explained in this paper. We attempt to find call control principles that take into account the goals of both ATM and IN. In this paper we first review the context and targets of IN, specifically from the point of view of ATM. The long-term importance of IN is also summarized. We then discuss a number of aspects of ATM that relate to the IN concept. The relationship between ATM and IN is such that one supports the other. A synergy of both concepts is therefore a natural evolution. [3] De Prycker, M., and J. Bauwens, "A Switching Exchange for an Asyncnronous Time Division Based Network, "International Conference on Communications, Seattle, WA, paper 22.3, pp. 774-781 (June 7-10, 1987). [5] Hass, R. J., and R. W. Humes, "Intelligent Network/2; A Network Architecture Concept for the 1990's," International Switching Symposium, Phoenix, AZ, paper A12.1, pp. 944-951 (March 15-20, 1987). [7] Miller, P., "Intelligent Network/2; A Flexible Framework for Exchange Services," Bell Communications Research EXCHANGE, Vol. 3, No. 3, pp. 9-13 (May/June 1987).}, } @INPROCEEDINGS{Wang90:Bandwidth, AUTHOR="Weihong Wang and T. N. Saadawi", TITLE="Bandwidth Allocation for {ATM} Networks", BOOKTITLE=icc, PAGES="439-442 (306B.2.1-306B.2.4)", YEAR=1990, KEYWORDS="ATM bandwidth allocation; dynamic admission control; performance analysis; blocking", ABSTRACT="In this paper the admission control and bandwidth allocation for ATM networks are studied. A dynamic bandwidth allocation algorithm is proposed and shown to improve the bandwidth equitable accessibility and the overall throughput. The ongoing study of the user-controlled bandwidth variation is also briefly described.", } @INPROCEEDINGS{Loop90:Backplane, AUTHOR="John D. Loop", TITLE="A Backplane Based {BISDN} {UNI}", BOOKTITLE=icc, PAGES="443-447, 306B.3.1-306B.3.5", YEAR=1990, KEYWORDS="IEEE P1396; SONET backplane; ATM; SONET; BT terminal; IEEE 802.6; STM (synchronous transfer mode); bus arbitration; E.164; SONET; CDGA (cell detect-generate-arbitrate) function; SONET; add-drop; SONET; superframer; SONET; H4 byte", } @INPROCEEDINGS{Liu90:Fiber, AUTHOR="Minkui Liu", TITLE="From Fiber to the Home to Full Broadband {ISDN}", BOOKTITLE=icc, PAGES="515-520, 308.7.1-308.7.6", YEAR=1990, KEYWORDS="ATM; BISDN; networks; evolution from current; STM (synchronous transfer mode); FTTH (fiber to the home); video; analog vs. digital", } @INPROCEEDINGS{Armb90:Switch, AUTHOR="Brian. Armbruster and F. Mellor", TITLE="Switch Architecture Evolution in {SONET} Networks", BOOKTITLE=icc, PAGES="552-556, 310.1.1-310.1.5", YEAR=1990, KEYWORDS="SONET; resource decoupling; OAM; switching; node architecture; switch", } @INPROCEEDINGS{Okaj90:Inter, AUTHOR="Keisuke. Okajima and Isao Shimbo", TITLE="Inter-Module Communication Capability for a Future {ATM} System", BOOKTITLE=icc, PAGES="557-561, 310.2.1-310.2.5", YEAR=1990, KEYWORDS="ATM; switching; network; self-routing; switching; independent distributed; congestion control; switch design", } @INPROCEEDINGS{Kato90:Development, AUTHOR="Y. Kato and T. Shimoe and Kurenai Murakami", TITLE="A Development of a High Speed Switching {LSIC}", BOOKTITLE=icc, PAGES="562-566, 310.3.1-310.3.5", YEAR=1990, KEYWORDS="ATM; switching; VLSI Bi-CMOS IC RAM; cell buffering; memory access speed; switch; prototype 2x1 ATM; switch design", } @INPROCEEDINGS{Mond90:Cylinder, AUTHOR="Benjamin. Monderer and G. Pacifici and Charles. Zukowski", TITLE="The Cylinder Switch; An Architecture for a Manageable {VLSI} Giga-cell Switch", BOOKTITLE=icc, PAGES="567-571, 310.4.1-310.4.5", YEAR=1990, KEYWORDS="resource allocation; hardware; buffer management; hardware; VLSI; multicasting; multicast; buffer; ring buffer multiplexer; buffer; cylinder buffer; resource allocation; slot reservation; switch design; QOS (quality of service); cell blocking; ATM", } @INPROCEEDINGS{Rama90:Circuit, AUTHOR="G. Ramamurthy and R. S. Dighe", TITLE="Performance Analysis of Circuit-Switched Traffic over a Packet Network", BOOKTITLE=icc, PAGES="572-578 (310.5.1-310.5.7)", YEAR=1990, REFERENCES=8, KEYWORDS="buffer requirements queueing delay voice; video; data integration; circuit switching; packet switching; simulation; queue; modeling performance analysis; stream traffic; ATM; buffer dimensioning; waiting time; simulation", ABSTRACT="Integration of voice, video and data is gaining momemtum with the arrival of fiber-based broadband systems. During the evolutionary stage, such systems have to carry circuit-switched traffic originating from existing circuit-switched systems. In this paper, we look at the buffer sizing issue in such systems. We show that by scheduling packets at the input queue in such a way that they do not arrive back to back at the output queue, the variance of the queueing delay can be considerably reduced. We contrast the buffer requirements when operating at utilizations less than the maximum. We also look at the advantages gained by combining many low-speed circuit-switched traffic streams (such as voice packet streams) with one or more high speed continuous packet streams (such as video packet streams). The method not only reduces the buffer requirements, but also reduces the mean as well as the variance in the queueing delays for low-speed traffic.", } @INPROCEEDINGS{Iguc90:Subscriber, AUTHOR="K. Iguchi and H. Takeo and S. Amemiya and K. Tezuka", TITLE="Subscriber Access Scheme for Broadband {ISDN}", BOOKTITLE=icc, PAGES="663-669, 313.3.1-313.3.7", YEAR=1990, KEYWORDS="BISDN; ring-based subscriber access network (SAN); distributed access control; Polling-REQuest (P-REQ) medium access control (MAC) protocol for passive optical bus; simulation; customer premises network (CPN); multipoint communication; DQDB", } @INPROCEEDINGS{Wagn90:Comparative, AUTHOR="S. S. Wagner and K. W. Lu", TITLE="Comparative Video Distribution Techniques for Broadband Fiber-Optic Subscriber Loops", BOOKTITLE=icc, PAGES="670-674, 313.4.1-313.4.5", YEAR=1990, KEYWORDS="video distribution; passive loop architectures; WDM; optical splitter; component cost projection to late-1990s; NTSC; HDTV; video switch; switched vs. broadcast transport of video; architecture comparison between Active Double Star (ADS); Passive Photonic Loop (PPL); PON (passive optical network); SONET; ATM", } @INPROCEEDINGS{Shai90:Control, AUTHOR="Salman Shaikh and M. Schwartz and T. H. Szymanski", TITLE="Analysis, Control and Design of Crossbar and Banyan Based Broadband Packet Switches for Integrated Traffic", BOOKTITLE=icc, PAGES="761-764, 316.5.1-316.5.4", YEAR=1990, KEYWORDS="Crossbar; Banyan; switch design; preemptive priority control of multiclass traffic; average time delay control of multiclass traffic; Markov chain analysis for Banyan networks with flexible priority schemes; modeling", } @INPROCEEDINGS{Sall90:User, AUTHOR="H. R. Salloum and Susumu Yoneda", TITLE="{B-ISDN} User Network Interface; Implementation of Performance Monitoring Functions Using {SONET} Overhead", BOOKTITLE=icc, PAGES="822-825, 318.2.1-318.2.4", YEAR=1990, KEYWORDS="BISDN; UNI (user network interface); OA\\&M functions required across user network interface; transmission error performance monitoring of UNI using B3 and G1 bytes of SONET overhead; T1S1.1; FEBE (Far End Block Error)", } @INPROCEEDINGS{Fior90:ATM, AUTHOR="G. Fioretto and T. Demaria and F. Perardi and L. Piovano", TITLE="{ATM} Based Network Transport Service", BOOKTITLE=icc, PAGES="826-830, 318.3.1-318.3.5", YEAR=1990, KEYWORDS="ATM; ATM; AAL (ATM adaptation layer); I121; CS (convergence sublayer); SAR (segmentation and reassembly sublayer)", } @INPROCEEDINGS{Sato90:Flexible, AUTHOR="K. Sato and Tokizawa.", TITLE="Flexible Asynchronous Transfer Mode Networks Utilizing Virtual Paths", BOOKTITLE=icc, PAGES="831-838 (318.4.1-318.4.8)", YEAR=1990, REFERENCES=20, KEYWORDS="ATM; VP (virtual path); effect on ATM networks; cross-connect node structures; transmission network design; STM based network with digital path vs. ATM based network with virtual path; labelled deterministic path (LDP); labelled statistical path (LSP); VP (virtual path) management; processing cost; VP (virtual path) management; transmission cost", } @INPROCEEDINGS{Obar90:ATM, AUTHOR="H. Obara and M. Sasagawa and Ikuo Tokizawa", TITLE="An {ATM} Cross-Connect System for Broadband Transport Networks Based on Virtual Path Concept", BOOKTITLE=icc, PAGES="839-843 (318.5.1-318.5.5)", YEAR=1990, REFERENCES=12, KEYWORDS="ATM cross-connect VP (virtual path)", ABSTRACT="Design of a large capacity ATM cross-connect system is presented that uses an input queueing scheme and a self-routing switch. To improve switch efficiency, a new contention control algorithm has been proposed and its distributive design is shown. A planer honogeneous self-routing switch is also proposed for easy expansion of switch size.", } @INPROCEEDINGS{Vett90:Multiresolution, AUTHOR="M. Vetterli and Dimitris Anastassiou", TITLE="A Multiresolution Approach for All-Digital {HDTV}", BOOKTITLE=icc, PAGES="881-885, 320.2.1-320.2.5", YEAR=1990, KEYWORDS="HDTV; multiresolution coding; subband and Pyramid resolution enhancement using nonlinear interpolation", ABSTRACT="In this paper, we investigate the feasibility of a fully digital HDTV production, processing, coding and transmission standard that will be a true alternative to analog television. An all digital HDTV should become economically feasible towards the end of the century. Such a television system is defined as a medium range technological goal, and will have a direct impact on various technologies, including computers, telecommunications, and high speed VLSI. We describe research directions as well as current progress, especially with respect to hierarchical representations and coding methods, nonlinear interpolation techniques and joint source-channel coding for digital channels. Multiresolution techniques are central to our approach, because they are useful for compression, joint source-channel coding and for compatibility.", } @INPROCEEDINGS{Flan90:Planning, AUTHOR="T. Flanagan", TITLE="Planning a {SONET} Network", BOOKTITLE=icc, PAGES="909-914, 321.2.1-321.2.6", YEAR=1990, KEYWORDS="SONET FiberWorld S/DMS TransportNode S/DMS AccessNode S/DMS SuperNode SONET; deployment strategies", ABSTRACT="This paper examines the transition from today's asynchronous network to tomorrow's advanced all-SONET network. It shows how to trigger the first SONET span, how to attain the maximum benifits of SONET as it penetrates the network, how to build survivable networks and how to ensure that a SONET network can grow to position operating companies and inter-exchange carriers for future broadband service revenues.", } @INPROCEEDINGS{Balm90:Managing, AUTHOR="Mark. Balmes and L. T. Corley and Jr. Pucko", TITLE="Managing the Transition to {SONET}", BOOKTITLE=icc, PAGES="924-926, 321.5.1-321.5.3", YEAR=1990, KEYWORDS="SONET SONET; deployment strategies", ABSTRACT="This paper will address the BellSouth strategy for deploying SONET elements. The major factors affecting the early deployment of synchronous systems are covered. The key SONET network elements and their applications in theOA network are described. Finally, the steps for transitioning the BellSouth network from asynchronous to synchronous systems are outlined.", } @INPROCEEDINGS{Jaya90:High, AUTHOR="Nuggehally S. Jayant", TITLE="High Quality Coding of Telephone Speech and Wideband Audio", BOOKTITLE=icc, PAGES="927-931 (322.1.1-322.1.5)", YEAR=1990, KEYWORDS="coding; speech; coding; audio; coder", ABSTRACT="This paper is a review of digital speech technology, with emphasis on applications demanding high quality reproduction of the speech signal. Examples of such applications are network telephony, ISDN terminals for audio teleconferencing and systems for the storage of audio signals that include the important sub-class of wideband speech.", ANNOTE="Overview of coding methods for high-quality transmission. CCITT G.711 PCM, G.721 ADPCM, G.722 7 kHz. DSI, TASI, DCME; TASI advantage of 2.5", } @INPROCEEDINGS{Bran90:Transform, AUTHOR="K. Brandenburg and H. Gerhauser", TITLE="Transform Coding of High Quality Digital Audio at Low Bit Rates - Algorithms and Implementation", BOOKTITLE=icc, PAGES="932-936, 322.2.1-322.2.5", YEAR=1990, KEYWORDS="coding; coder coding; transform DSP (digital signal processing) coding; entrophy", ABSTRACT="Low bit rate coding schemes for coding high quality digital audio at bit rates of 64 to 128 kbit/sec. per channel are described. LC-ATC (Low-Complexity Adaptive Transform Coding) and OCF (Optimum Coding in the Frequency domain) both use transform coding to get high redundancy removal and high adaptation to the perceptual requirements. OCF uses entrophy coding of the spectral values for increased coding efficiency and flexibility of the coder. Real time implementations using DSP32(C) and DSP 56000 digital signal processors are presented in both algorithms. Results using listening tests and Noise-to-Mask Ratio (NMR) are given. CD-quality can be achieved at 2bit/sample. At 64 kbit/sec., the quality at 15kHz bandwidth is still higher than todays FM radio.", } @INPROCEEDINGS{Stol90:High, AUTHOR="Gerhard. Stoll and Y. F. Dehery", TITLE="High Quality Audio Bit-Rate Reduction System Family for Different Applications", BOOKTITLE=icc, PAGES="937-941, 322.3.1-322.3.5", YEAR=1990, KEYWORDS="coder codec coding; audio", ABSTRACT="Some new audio codecs for high quality audio signals are adapted to basic psychoacoustic signal processing principles for a significant reduction of the bit-rate of a digital audio signal. The sub-band coding system MUSICAM (Masking-pattern Universal Sub-band Integrated Coding And Multiplexing), which is developed for different applications for French, Dutch and German engineers, makes use of the spectral and temporal masking effects and allows bit-rates down to about 100 kbit/s per monophonic channel, without impairing the subjective quality of the CD for any critical signal. With a bit rate of 64 kbit/s the subjective quality comes close to that of the CD for most of the signals. This high gain in coding is possible because only those details of the signal are transmitted which will effectively be perceived by the listener.", } @INPROCEEDINGS{Ohta90:Video, AUTHOR="Naohisa Ohta and M. Nomura and Nobuyuki. Tokura and Katsuaki. Kikuchi", TITLE="Video Distribution on {ATM-Based} Optical Ring Networks", BOOKTITLE=icc, PAGES="976-980, 323.4.1-323.4.5", YEAR=1990, KEYWORDS="DQDR (distributed queueing double ring) VP (virtual path)", ABSTRACT="Video distribution over an optical ring network based on Asynchronous Transfer Mode (ATM) techniques is described. The proposed network has the flexibility and reliability needed for broadband multimedia access including anticipated high-quality video. The properties and multimedia access algorithms of the proposed ring network are described. The flexible path concept, essential for efficient video distribution, is also described. A video distribution system design is shown along with video signal characteristics and an evaluation of multiplexing performance. Cell loss protection methods utilizing robust layered coding and cell-loss protection algorithms are discussed.", } @INPROCEEDINGS{Stei90:Generic, AUTHOR="R. Steinmetz and Hermann. Schmutz and Bernd. Schoner and Michael. Wasmund", TITLE="Generic Support for Distributed Multimedia Applications", BOOKTITLE=icc, PAGES="1451-1457, 338.3.1-338.3.7", YEAR=1990, KEYWORDS="API; unix; resource allocation; multimedia; synchronization of objects", ABSTRACT="This paper addresses the question of how to build a convenient application programming interface for multimedia applications in a distributed and heterogeneous environment. According to the objectives of distribution transparency with autonomy of nodes, presentation transparency, device independence and the handling of resource allocation by the underlying system, a concept is developed for this new area of applications. The model comprises resources operating as sources and sinks of transient and persistent information. These resources and their interactions appear as capabilities at the application programming interface. Applications do not distinguish between local and remote operations and resources. Authorization is integrated as the protection attribute of the capabilities. The model supports a level of abstraction where unnecessary details - such as device dependencies - are made transparent to application programs.", } @INPROCEEDINGS{Kim90:Real, AUTHOR="Yung B. Kim and Andre G. Vacroux", TITLE="Real-time Computer Network Performance Analysis Based on {ISO-OSI} Transport Service Definition", BOOKTITLE=icc, PAGES="1464-1468, 338.5.1-338.5.5", YEAR=1990, KEYWORDS="realtime; OSI; ISO; QOS (quality of service); ethernet; TCP/IP; TP4 ISO 8073-1986; TSAP", ABSTRACT="Computer network performance has been analysed extensively for specific networks, usually by using off-line methods. However, a unified on-line method should be sought for future open systems and integrated services because of the on-going integration of similar or different networks, mission-critical network applications and the requirement for transport Quality of Services. Considering the seven layer ISO/OSI model, the Transport layer appears to be the most appropriate for achieving independence from a specific network type. However, to date, there has not been any real-time performance analysis done at this level. This paper provides a method for analyzing the end-to-end real-time performance at the transport service access points.", } @UNPUBLISHED{Bowm90:Univers, AUTHOR="Mic Bowman and others", TITLE="Univers: A Name Server for the Next Generation {Internet}", NOTE="University of Arizona", YEAR=1990, } @TECHREPORT{Chen90:Synchronous, AUTHOR="Sheng Chen and L. T. Wu", TITLE="A Synchronous Wideband Switch in an Interoffice Hubbing Architecture", INSTITUTION="Bell Communications Research", ADDRESS="Morristown, New Jersey", NOTE="Draft", YEAR=1990, } @TECHREPORT{Cher90:VMP, AUTHOR="D. R. Cheriton and A. Gupta and P. D. Boyle and H. A. Goosen", TITLE="The {VMP} Multiprocessor: Initial Experience, Refinements and Performance Evaluation", INSTITUTION="Computer Science Dept., Stanford University", ADDRESS="Stanford, California", NOTE="Draft", YEAR=1990, } @UNPUBLISHED{Finn90:Designing, AUTHOR="Finn G. C.", TITLE="Designing a Rapid Packet Switch for High Capacity Channels", NOTE="ISI", YEAR=1990, } @MISC{Finn90:World, AUTHOR="J. Finnegan", TITLE="The World According to Finnegan", ORGANIZATION="Oceanview University", YEAR=1990, } @UNPUBLISHED{Hick90:High, AUTHOR="J. Hickey and W. S. Marcus", TITLE="The Implementation of a High Speed {ATM} Packet Switch Using {CMOS} {VLSI}", NOTE="Bellcore", YEAR=1990, } @UNPUBLISHED{Hira90:High, AUTHOR="T. Hirata and others", TITLE="A High Speed Protocol Processor to Boost Gateway Performance", NOTE="Hitachi, Ltd.", YEAR=1990, } @TECHREPORT{Hugh90:Continuous, AUTHOR="J. P. Hughes", TITLE="Continuous Protocol for Long Distance Communication Links", INSTITUTION="Network Systems Corporation", ADDRESS="Brooklyn Park, Minnesota", YEAR=1990, } @MANUAL{ISO90:Information, AUTHOR="I. S. O", TITLE="Information processing systems -- Open Systems Interconnection -- Specification of Abstract Syntax Notation One {(ASN.1)}", NOTE="International Standard ISO-8824", YEAR=1990, } @ARTICLE{King90:Computational, AUTHOR="D. T. Kingsbury", TITLE="Computational Science: An Essential Research Approach", JOURNAL="EDU Magazine", NUMBER=53, PAGES="5-9", MONTH="Spring", YEAR=1990, } @INPROCEEDINGS{Lauw90:Collabporation, AUTHOR="J. Chris Lauwers and K. A. Lantz", TITLE="Collabporation Awareness in Suuport of Collaboration Transparency: Requirements for the Next Generation of Shared Window Systems", BOOKTITLE="CHI Conference on Human Factors in Computing Systems", YEAR=1990, } @TECHREPORT{Lee90:Further, AUTHOR="Pil Joong Lee and Shiang-feng Lee", TITLE="Further Results on High-Speed Scrambling at Lower Clock Rates", INSTITUTION="Bell Communications Research", ADDRESS="Morristown, NJ", NOTE="Draft", YEAR=1990, } @TECHREPORT{Lela90:Load, AUTHOR="Will Leland and Teunis Ott", TITLE="Load-balancing Heuristics and Process Behavior", INSTITUTION="Bell Communications Research", ADDRESS="Morristown, New Jersey", NOTE="DRAFT", YEAR=1990, } @UNPUBLISHED{Ludw90:Multi, AUTHOR="L. F. Ludwig", TITLE="Multi-Media in {ISDN} and {BISDN:} A Paradigm Shift Driven by Evolving User Technology and Applications", NOTE="Advance Copy - to appear in Bellcore Digest", YEAR=1990, } @UNPUBLISHED{Marc90:CMOS, AUTHOR="W. S. Marcus and J. Hickey", TITLE="A {CMOS} Batcher and Banyan Chip Set for {B-ISDN}", NOTE="Bellcore", YEAR=1990, } @UNPUBLISHED{Mean90:Truly, AUTHOR="B. Meandzija and Peter Ho", TITLE="Towards Truly Open Systems", NOTE="Southern Methodist University", YEAR=1990, } @ARTICLE{Merc90:AD, AUTHOR="V. J. Mercurio and B. F. Meyers and A. M. Nisbet and G. Radin", TITLE="{AD/Cycle} Strategy and Architecture", JOURNAL=ibmsj, VOLUME=29, NUMBER=2, PAGES="170-188", YEAR=1990, } @MISC{Netw90:Annual, AUTHOR="Merit Computer Network", TITLE="Annual Report 1990", ORGANIZATION="Merit", YEAR=1990, } @UNPUBLISHED{Mill90:Long, AUTHOR="D. Miller and A. Pope and R. Waters", TITLE="Long-Haul Networking of Simulators", NOTE="BBN", YEAR=1990, } @ARTICLE{Moor90:Multimedia, AUTHOR="D. J. Moore", TITLE="Multimedia Presentation Development Using the Audio Visual Connection", JOURNAL=ibmsj, VOLUME=29, NUMBER=4, PAGES="494-508", YEAR=1990, } @UNPUBLISHED{Ohno90:Optical, AUTHOR="K. Ohno and others", TITLE="Optical High Speed Token Ring System", NOTE="Matsushita Electric Industrial Co., Ltd.", YEAR=1990, } @UNPUBLISHED{Pete90:Highly, AUTHOR="L. L. Peterson and Sean O'Malley", TITLE="A Highly-Structured Network Software Architecture", NOTE="U. of Ariz", YEAR=1990, } @ARTICLE{Saga90:Repository, AUTHOR="J. M. Sagawa", TITLE="Repository Manager Technology", JOURNAL=ibmsj, VOLUME=29, NUMBER=2, PAGES="209-227", YEAR=1990, } @INBOOK{Saty90:Distributed, AUTHOR="M. Satyanarayanan", TITLE="A Survey of Distributed File Systems", BOOKTITLE="Annual Review of Computer Science", PUBLISHER="Annual Reviews Inc.", VOLUME=4, PAGES="73-104", YEAR=1990, } @UNPUBLISHED{Schm90:Audio, AUTHOR="C. Schmand and M. A. McKenna", TITLE="An Audio and Telephone Server for Multi-Media Workstations", NOTE="MIT Media Laboratory", YEAR=1990, } @MISC{Shen90:Making, AUTHOR="S. Shenker", TITLE="Making Greed Work in Networks: A Game-Theoretic Analysis of Gateway Queueing Algorithms", ORGANIZATION="XEROX Parc", NOTE="talk", YEAR=1990, } @TECHREPORT{Sinc90:Extended, AUTHOR="W. Sincoskie and C. Cotton", TITLE="Extended Bridge Algorithms for Large Networks", INSTITUTION="Bell Communications Research", ADDRESS="Morristown, New Jersey", YEAR=1990, } @UNPUBLISHED{Stee90:Eliminating, AUTHOR="Peter Steenkiste and R. D. Sansom and E. Cooper", TITLE="Eliminating the Operating System Bottleneck in High Performance Networking", NOTE="Carnegie Mellon University", YEAR=1990, } @UNPUBLISHED{Taka90:FDDI, AUTHOR="O. Takada and others", TITLE="An {FDDI} Bridge for the High-Speed Multimedia Backbone {LAN}", NOTE="Hitachi, Ltd", YEAR=1990, } @TECHREPORT{Tele90:Technologies, AUTHOR="Televerket", TITLE="Technologies for the Future: A Report on Televerket's {R\\&D} Activities", INSTITUTION="Televerket", YEAR=1990, } @TECHREPORT{Wu90:Packet, AUTHOR="L. T. Wu and E. Arthurs and W. Sincoskie", TITLE="A Packet Network for {BISDN} Applications", INSTITUTION="Bell Communications Research", ADDRESS="Morristown, New Jersey", NOTE="Model Paper: International Zurich Seminar on Digital Communications", YEAR=1990, } @BOOK{Gira90:Routing, AUTHOR="Andre Girard", TITLE="Routing and Dimensioning in Circuit-Switched Networks", PUBLISHER="Addison-Wesley", YEAR=1990, } @INPROCEEDINGS{Esak90:Simple, AUTHOR="H. Esaki and Kazuaki Iwamura and T. Kodama", TITLE="A Simple and Effective Admission Control Method for and {ATM} Network", BOOKTITLE=globecom, PAGES="300.5.1", YEAR=1990, } @INPROCEEDINGS{Grif90:Connection, AUTHOR="T. R. Griffiths", TITLE="Analysis of a Connection Acceptance Strategy for {ATM} Network", BOOKTITLE=globecom, PAGES="505.4.1", YEAR=1990, } @INPROCEEDINGS{Crow9010:TCP, AUTHOR="Jon Crowcroft", TITLE="{TCP/IP} - Co-existence and migration to {OSI} - paths to follow", BOOKTITLE="Interoperability Workshop", ADDRESS="London", MONTH="October/November", YEAR=1990, } @MANUAL{Jaco90:TCPDUMP, AUTHOR="V. Jacobson and others", TITLE="tcpdump(1), {BPF}", TYPE="Unix Manual Page", YEAR=1990, } @TECHREPORT{BBC90:Bit, AUTHOR="B. B. C", TITLE="Bit Rate Reduction of Digital Television for Long Distance Transmission", INSTITUTION="BBC", YEAR=1990, KEYWORDS="34 Mbps Full motion Video", } @ARTICLE{Mila90:Shared, AUTHOR="P Milazzo", TITLE="Shared Video under Unix", JOURNAL=unixr, YEAR=1990, } @TECHREPORT{CCIT90:H.261, AUTHOR="C. C. ITT", TITLE="{H.261:} Video Codec for audiovisual services at px64 kbit/s", TYPE="{CCITT} White book", INSTITUTION="CCITT", NUMBER="H.261", YEAR=1990, KEYWORDS="H.261; video; video compression", } @TECHREPORT{CCIT90:H.221, AUTHOR="C. C. ITT", TITLE="{H.221:} Frame structure for a 64 to 1920 kbit/s channel in audiovisual services", TYPE="{CCITT} White book", INSTITUTION="CCITT", NUMBER="H.221", YEAR=1990, KEYWORDS="H.221; video; video transport", } @INPROCEEDINGS{Zhan90:Virtual, AUTHOR="L. Zhang", TITLE="Virtual Clock: A New Traffic Control Algorithm for {PSNs}", BOOKTITLE=sigcomm, ADDRESS="Philadelphia, Pennsylvania", YEAR=1990, } @MISC{Luth90:Digital, AUTHOR="Arch Luther", TITLE="Digital Video in the {PC} Environment", YEAR=1990, KEYWORDS="DVI video compression authorware", } @ARTICLE{Zhan90:Oscillating, AUTHOR="L. Zhang and D. D. Clark", TITLE="Oscillating behavior of network traffic: a case study simulation", JOURNAL=internet, VOLUME=1, PAGES="101-112", YEAR=1990, KEYWORDS="congestion", } @INPROCEEDINGS{Sait90:Modelling, AUTHOR="H. Saito and Kawashima Konosuke", TITLE="Performance modelling of integrated voice and data communication networks", BOOKTITLE="Stochastic Analysis of Computer and Communication Systems (edited by H. Takagi)", ORGANIZATION="North-Holland", YEAR=1990, KEYWORDS="Traffic control; ATM; BISDN; integrated communication systems", } @INBOOK{Zdon90:Readings, TITLE="Readings in object-oriented database systems", EDITOR="Stanley B. Zdonik and David Maier", CHAPTER="Fundamentals of Object-Oriented Databases", PUBLISHER="Morgan Kaufmann", YEAR=1990, } @INPROCEEDINGS{Leno90:Directory, AUTHOR="Lenoski and others", TITLE="The Directory-Based Cache Coherence Protocol for the {DASH} Multiprocessor", BOOKTITLE="17th Annual International Symposium on Computer Architecture", PAGES="148-159", YEAR=1990, } @ARTICLE{Dubo90:Memory, AUTHOR="M. Dubois and C. Scheurich", TITLE="Memory Access Dependencies in Shared Memory Multiprocessors", JOURNAL=ieeese, VOLUME="SE-16", NUMBER=6, PAGES="660-674", YEAR=1990, } @BOOK{Henn90:Computer, AUTHOR="John L. Hennessy and D. A. Patterson", TITLE="Computer Architecture: A Quantitative Approach", PUBLISHER="Morgan Kaufmann", YEAR=1990, } @INPROCEEDINGS{Cido90:Distributed, AUTHOR="I. Cidon and I. Gopal and Michael Kaplan and S. Kutten", TITLE="Distributed control for paris", BOOKTITLE="9th Annual ACM Symposium on Principles of Distributed Computing", YEAR=1990, } @BOOK{Teno90:Full, AUTHOR="Carol Tenopir and Jung Soon Ro", TITLE="Full Text Databases", SERIES="New Directions in Information Management", PUBLISHER="Greenwood Press", ADDRESS="New York", VOLUME=21, YEAR=1990, } @TECHREPORT{Borg90:Long, AUTHOR="A. Borg and others", TITLE="Long Address Traces from {RISC} Machines: Generation and Analysis", INSTITUTION="DEC WRL", NUMBER="Research Report 89/1", YEAR=1990, } @ARTICLE{Vrie9001:Reducing, AUTHOR="Ronald C. De Vries", TITLE="Reducing Null Messages in Misra's Distributed Discrete Event Simulation Method", JOURNAL=ieeese, VOLUME=16, NUMBER=1, PAGES="82-91", YEAR=1990, } @ARTICLE{Lin9004:Exploiting, AUTHOR="Y. Lin and E. D. Lazowska", TITLE="Exploiting Lookahead in Parallel Simulation", JOURNAL=ieeepds, VOLUME=1, NUMBER=4, PAGES="457-469", YEAR=1990, } @INPROCEEDINGS{Wagn90:Techniques, AUTHOR="D. B. Wagner and E. D. Lazowska and B. N. Bershad", TITLE="Techniques for efficient shared-memory parallel simulation", BOOKTITLE="SCS Multiconference: Advances in Parallel and Distributed Simulation", PAGES="29-37", YEAR=1990, } @INPROCEEDINGS{Cai90:Algorithm, AUTHOR="Wentong Cai and S. J. Turner", TITLE={An Algorithm for Distributed Discrete-Event Simulation --The "Carrier Null Message" Approach}, BOOKTITLE="SCS Multiconference: Advances in Parallel and Distributed Simulation", PAGES="3-8", YEAR=1990, } @INPROCEEDINGS{Cota90:Framework, AUTHOR="B. A. Cota and R. G. Sargent", TITLE="A Framework for Automatic Lookahead Computation in Conservative Distributed Simulations", BOOKTITLE="SCS Multiconference: Advances in Parallel and Distributed Simulation", PAGES="56-59", YEAR=1990, } @INPROCEEDINGS{Lipt90:Time, AUTHOR="Richard Lipton and David W. Mizell", TITLE="Time Warp vs. Chandy-Misra: A Worst-Case Comparison", BOOKTITLE="SCS Multiconference: Advances in Parallel and Distributed Simulation", PAGES="137-143", YEAR=1990, } @PROCEEDINGS{Davi90:3th, TITLE="3th {IFIP} {WG6.1} Intern. Workshop on Protocol Test Systems, McLean, Virginia, {U.S.A.}", BOOKTITLE="3th IFIP WG6.1 International Workshop on Protocol Test Systems, McLean, Virginia, U.S.A.", EDITOR="I. Davidson and D. M. Litwack", SERIES="IFIP Transactions", PUBLISHER="North-Holland", YEAR=1990, } @PROCEEDINGS{Logr90:10th, TITLE="10th Intern. Symposium on Protocol Specification, Testing and Verification, Ottawa, Ontario, Canada", BOOKTITLE="10th International Symposium on Protocol Specification, Testing and Verification, Ottawa, Ontario, Canada", EDITOR="L. Logrippo and R. L. Probert and H. Ural", SERIES="IFIP Transactions", PUBLISHER="North-Holland", YEAR=1990, } @INPROCEEDINGS{Galb90:Linear, AUTHOR="R. J. v. Galbbeek", TITLE="The linear time - branching time spectrum", BOOKTITLE="CONCUR (LNCS 458)", PAGES="278-297", YEAR=1990, } @INPROCEEDINGS{Sidh90:Probabilistic, AUTHOR="Deepinder Sidhu and Chi-ching Chang", TITLE="Probabilistic testing of protocols", BOOKTITLE="3rd International Workshop on Protocol Test Systems", YEAR=1990, } @INPROCEEDINGS{Sidh90:Protocol, AUTHOR="Deepinder Sidhu", TITLE="Protocol Testing -- The first ten years, the next ten years", BOOKTITLE="10th International Symposium on Protocol Specification, Testing and Verification, Ottawa, Ontario, Canada", EDITOR="L. Logrippo and R. L. Probert and H. Ural", SERIES="IFIP Transactions", PUBLISHER="North-Holland", PAGES="45-68", YEAR=1990, } @TECHREPORT{Hari90:Kernel, AUTHOR="S. Haridi and", TITLE="Kernel Andorra Prolog and its Computational Model", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R90-02", YEAR=1990, ABSTRACT="The logic programming language framework Kernel Andorra Prolog is defined by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive languages and nondeterministic transformational languages may be specified. The framework is based on constraints. The languages Prolog, GHC, Parlog, and Atomic Herbrand, are all executable in the Kernel Andorra Prolog computation model. There are instances of the framework in which all of these languages are embeddable.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--90-02--SE.ps.Z", } @TECHREPORT{Carl90:Efficiency, AUTHOR="Mats Carlsson", TITLE="On the Efficiency of Optimising Shallow Backtracking in Prolog", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R90-03", YEAR=1990, ABSTRACT="The cost of backtracking has been identified as one of the bottlenecks in achieving peak performance in compiled Prolog programs. Much of the backtracking in Prolog programs is shallow, i.e. is caused by unification failures in the head of a clause when there are more alternatives for the same procedure, and so special treatment of this form of backtracking has been proposed as a significant optimisation. This paper describes a modified WAM which optimises shallow backtracking. Four different implementation approaches are compared. A number of benchmark results are presented, measuring the relative tradeoffs between compilation time, code size, and run time. The results show that the speedup gained by this optimisation can be significant.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--90-03--SE.ps.Z", } @TECHREPORT{Carl90:Aurora, AUTHOR="Mats Carlsson and Peter Szeredi", TITLE="The Aurora Abstract Machine and its Emulator", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R90-05", YEAR=1990, ABSTRACT="Aurora is a prototype or-parallel implementation of the full Prolog language for shared-memory multiprocessors, developed as part of an informal research collaboration known as the 'Gigalips Project'. This report describes the abstract machine of the implementation, expressed in terms of a Prolog engine adapted for or-parallel execution by means of the SRI model. An algorithmic interface defining the communication between the engine and scheduler components of each Aurora process is described, and enables different engine and scheduler components to be used interchangeably. Both the in-terface and the engine are fundamentally revised versions of those used in previous generations of the implementation.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--90-05--SE.ps.Z", } @TECHREPORT{Karl90:Muse, AUTHOR="Roland Karlsson and Khayry Mohamend Ali", TITLE="The Muse approach to {OR-parallel} Prolog", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R90-09", YEAR=1990, ABSTRACT="Muse(Multi-sequential Prolog engines) is a simple and efficient approach to Or-parallel execution of Prolog programs. It is based on having several sequential Prolog engines, each with its local address space, and some shared memory space. It is cur-rently implemented on a 7-processors machine with local/shared memory constructed at SICS, a 16-processors Sequent Symmetry, a 96-processors BBN Butterfly I, and a 45-processors BBN Butterfly II. The sequential {{SICStus}} Prolog system has been adapted to Or-parallel implementation. Extra overhead associated with this adapta-tion is very low in comparison with the other approaches. The speed-up factor is very close to the number of processors in the system for a large class of problems. The goal of this paper is to present the Muse execution model, some of its imple-mentation issues, a variant of Prolog suitable for multiprocessor implementations, and some experimental results obtained from two different multiprocessor systems.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--90-09--SE.ps.Z", } @TECHREPORT{Jons90:Compositional, AUTHOR="Bengt Jonsson", TITLE="Compositional specification and verification of distributed systems", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R90-10", YEAR=1990, ABSTRACT="We present a method for specification and verification of distributed systems that communicate via asynchronous message-passing. The method handles both safety and liveness properties. It is compositional, i.e., a specification of a composite system can be obtained from specifications of its components. Specifications are given as labeled transition systems with fairness properties, using a program-like notation with guarded multiple assignments. A specification denotes a set of allowed sequences of message transmissions and receptions, in analogy with the way finite automata are used as acceptors of finite strings. A lower-level specification implements a higher-level specification if all sequences allowed by the lower-level specification are also allowed by the higher-level one. We present a verification technique which reduces the problem of verifying the correctness of an implementation to classical verification conditions. Safety properties are verified by establishing a simulation between transition systems. Liveness properties are verified using methods for proving termination under fairness assumptions. Since specifications can be given at various levels of abstraction, the method is suitable in a development process where a detailed implementation is developed from an abstract specification through a sequence of refinement steps. The method is applied to a sliding window protocol, and to an algorithm by Thomas for updating a distributed database.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--90-10--SE.ps.Z", } @TECHREPORT{Gamb90:Contract, AUTHOR="Björn Gambäck and Manny Rayner", TITLE="Contract bridge as a Micro-world for reasoning about communication agents", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R90-11", YEAR=1990, ABSTRACT="We argue that bidding in the game of Contract Bridge can profitably be regarded as a micro-world suitable for experimenting with pragmatics. We sketch an analysis in which a 'bidding system' is treated as the semantics of an artificial language, and show how this 'language', despite its apparent simplicity, is capable of supporting a wide variety of common speech acts parallel to those in natural languages; we also argue that the reason for the relatively unsuccessful nature of previous attempts to write strong Bridge playing programs has been their failure to address the need to reason explicitly about knowledge, pragmatics, probabilities and plans. We give an overview of Pragma, a system currently under development at SICS, which embodies these ideas in concrete form, using a combination of rule-based inference, stochastic simulation, and 'neural-net' learning. Examples are given illustrating the functionality of the system in its current form.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--90-11--SE.ps.Z", } @TECHREPORT{Hans90:Logic, AUTHOR="H. Hansson and Bengt Jonsson", TITLE="A logic for reasoning about time and reability", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R90-13", YEAR=1990, ABSTRACT="We present a logic for stating properties such as, 'after a request for service there is at least a 98:045 probability that the service will be carried out within 2 seconds'. The logic extends the temporal logic CTL by Emerson, Clarke and Sistla with time and probabil- ities. Formulas are interpreted over discrete time Markov chains. We give algorithms for checking that a given Markov chain satis- fies a formula in the logic. The algorithms require a polynomial number of arithmetic operations, in size of both the formula and:003. This research report is a revised and extended version of a paper that has appeared under the title 'A Framework for Reasoning about Time and Reliability' in the Proceeding of the 10th IEEE Real-time Systems Symposium, Santa Monica CA, December 1989. This work was partially supported by the Swedish Board for Technical Development (STU) as part of Esprit BRA Project SPEC, and by the Swedish Telecommunication Administration.1the Markov chain. A simple example is included to illustrate the algorithms.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--90-13--SE.ps.Z", } @TECHREPORT{Land90:Moving, AUTHOR="Anders Landin and S. Haridi", TITLE="Moving the shared memory closer to the processors {DDM}", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R90-17", YEAR=1990, ABSTRACT="Multiprocessors with shared memory are considered more general and easier to program than message-passing machines. The scalability is, however, in favor of the latter. There are a number of proposals showing how the poor scalability of shared memory multiprocessors can be improved by the introduction of private caches attached to the processors. These caches are kept consistent with each other by cache-coherence protocols. In this paper we introduce a new class of architectures called Cache Only Memory Architectures (COMA). These architectures provide the programming paradigm of the shared-memory architectures, but are believed to be more scal- able. COMAs have no physically shared memory; instead, the caches attached to the processors containallthe memory in the system, and their size is therefore large. A datum is allowed to be in any or many of the caches, and will automat- ically be moved to where it is needed by a cache-coherence protocol, which also ensures that the last copy of a datum is never lost. The location of a datum in the machine is completely decoupled from its address. We also introduce one example of COMA: the Data Diffusion Machine (DDM). The DDM is based on a hierarchical network structure, with processor/memory pairs at its tips. Remote accesses generally cause only a limited amount of traffic over a limited part of the machine. The architecture is scalable in that there can be any number of levels in the hierarchy, and that the root bus of the hierarchy can be implemented by several buses, increasing the bandwidth.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--90-17--SE.ps.Z", } @BOOK{Stee90:Abstract, AUTHOR="Douglas Steedman", TITLE="Abstract syntax notation One {(ASN.1):} The Tutorial and Reference", ISBN="1-871802-06-7", PUBLISHER="Technology Appraisals, Ltd.", ADDRESS="London", YEAR=1990, KEYWORDS="programming languages; ASN.1; presentation layer; tutorial", } @ARTICLE{Sand9005:Xpress, AUTHOR="R. Sanders and Alfred Weaver", TITLE="The Xpress Transfer Protocol {(XTP)} - A Tutorial", JOURNAL=ccr, VOLUME=20, NUMBER=5, PAGES="67-80", YEAR=1990, KEYWORDS="Xtp", } @INPROCEEDINGS{Zitt90:Parallelism, AUTHOR="M. Zitterbart", TITLE="Parallelism in transport oriented communication protocols", BOOKTITLE="5th Jerusalem Conference on Information Tehonlogy (JCIT)", EDITOR="IEEE Communications Society", PAGES="206-13", YEAR=1990, KEYWORDS="parallel; high speed; protocols", } @INPROCEEDINGS{Mann90:Hierachy, AUTHOR="Z. Manna and A. Pnuelli", TITLE="A Hierachy of Temporal Properties", BOOKTITLE="9th PODC", ORGANIZATION="ACM", PAGES="377-408", YEAR=1990, KEYWORDS="temporal logic", } @ARTICLE{Patt90:Computational, AUTHOR="John F. Patterson and F. B. Talbot and R. Slowinski and J. Weglaz", TITLE="Computational experience with a bachtraching algorithm for solving a general calss of precedence and resource-constrained scheduling problems", JOURNAL=ejor, VOLUME=49, PAGES="68-79", YEAR=1990, KEYWORDS="OR; operational research; backtracking; scheduling; fortran", } @PHDTHESIS{Wick90:Multiprocessor, AUTHOR="Thomas Wicki", TITLE="A Multiprocessor-Based Controller Architecture or High-Speed Communication Protocol Processing", SCHOOL="ETHZ", YEAR=1990, KEYWORDS="transputer; optimize", } @ARTICLE{Chen90:State, AUTHOR="T. Cheng and C. C. S. Sin", TITLE="A state-of-the-art review of parallel-machine scheduling research", JOURNAL=ejor, VOLUME=47, PAGES="271-292", YEAR=1990, KEYWORDS="OR; RO; scheduling; survey", } @ARTICLE{Laue9003:Ph, AUTHOR="H. C. Lauer", TITLE="On Ph.D. thesis proposals in computing science", JOURNAL="The Computer Journal", VOLUME=18, NUMBER=3, PAGES="279-281", YEAR=1990, KEYWORDS="Ph. D. thesis proposal; these; plan de these", } @INPROCEEDINGS{Gust90:Including, AUTHOR="Jan Gustafsson and Harry Rudin", TITLE="Including a queue in a formal-description-driven protocol performance analysis", BOOKTITLE="Protocol Specification, Testing, and Verification, IX", EDITOR="E. Brinksma and G. Scollo and C. A. Vissers", ORGANIZATION="IFIP", PUBLISHER="Esevier Science Publishers B. V. (North Holland)", PAGES="247-258", YEAR=1990, } @ARTICLE{Jger9001:Zusammenhang, AUTHOR="R. Jäger", TITLE="Zusammenhang zwischen Geb hren und Einnahmen im Telekommunikationsbereich", JOURNAL=fernmelde, ISBN="0015-010-X", ADDRESS="Erlangen, Germany", VOLUME=44, NUMBER="1/2", PAGES=41, YEAR=1990, LANGUAGE="German", REFERENCES=7, KEYWORDS="Traffic source model; parameter estimation; tariff; charging", } @ARTICLE{Dasc9002:Überlaststrategien, AUTHOR="B. Dasch", TITLE="Überlaststrategien in der Paketvermittlung am Beispiel des Systems {EWSP}", JOURNAL=aeu, ADDRESS="Germany", VOLUME=44, NUMBER=2, PAGES="153-159", YEAR=1990, LANGUAGE="German", REFERENCES=2, KEYWORDS="Overload control; packet switching; switching system", } @INPROCEEDINGS{Schd90:Strategies, AUTHOR="W. Schödl and M. Tangemann", TITLE="Strategies for Interconnection {HSLANs} to {B-ISDN} and their Performance", BOOKTITLE="10 International Conference on Computer Communication", ADDRESS="Tel Aviv, Israel", YEAR=1990, REFERENCES=21, KEYWORDS="B-ISDN; HSLAN; performance evaluation; Comparison; interconnection", } @ARTICLE{LaRu9004:Technique, AUTHOR="William Wood Larue and Victor S. Frost", TITLE="A technique for extrapolating the End-to-End performance of {HDLC} links for a range of lost packet rates", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=4, PAGES="461-466", YEAR=1990, KEYWORDS="Communication system; HDLC; performance evaluation; simulation; measurement", ABSTRACT="This paper presents a technique for extrapolating the cudto-end delay performance of an HDLC network for a range of lost packet rates. These lost packets could arise from bit errors or discarding due to network congestion. The extrapolation technique can be based on a simulation or measurement. Simulation results are presented to demonstrate the effectiveness of this technique.", } @BOOK{Hui90:Switching, AUTHOR="Joseph Hui", TITLE="Switching and traffic theory for integrated broadband networks", ISBN="0-7923-9061-X", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/Dordrecht/London", PAGES=347, YEAR=1990, KEYWORDS="broadband; switching; performance evaluation; traffic theory", } @ARTICLE{Lin9001:Queueing, AUTHOR="A. Y. Lin and J. A. Silvester", TITLE="Queueing Analysis of an {ATM} Switch with Multichannel Transmission Groups", JOURNAL=per, ADDRESS="Boulder, Colorado", VOLUME=18, NUMBER=1, PAGES="96-105", YEAR=1990, REFERENCES=30, KEYWORDS="ATM; B-ISDN; switching block; output buffer; performance evaluation; analysis; discrete time; batch arrival; multiserver", ABSTRACT="The discrete-time D[A]/D/c/B queueing system is studied. We con-sider both a bulk arrival process with constant bulk inter- arrival time and general bulk-size distribution and a periodic arrival process. The service/transmission times are determinis- tic and the system provides for a maximum of c servers with a buffer size B. This queueing system is motivated by the study ofan ATM switch with multichannel transmission groups.", } @ARTICLE{Kim9003:Self, AUTHOR="H. Kim and A. Leon-Garcia", TITLE="A Self-Routing Multistage Switching Network for Broadband {ISDN}", JOURNAL=ieeejsac, VOLUME="SAC-8", NUMBER=3, PAGES="459-466", YEAR=1990, REFERENCES=11, KEYWORDS="ATM; switching network", } @ARTICLE{Dosh9001:Queueing, AUTHOR="B. T. Doshi", TITLE="Queueing systems with vacations -- a survey", JOURNAL=qs, VOLUME=1, NUMBER=1, PAGES="29-66", YEAR=1990, KEYWORDS="Queueing system; vacation system; analysis", } @TECHREPORT{Seid90:Simple, AUTHOR="R. Seidel", TITLE="A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons", INSTITUTION="Institute for Computer Science, Department of Mathematics, Freie Universität Berlin", ADDRESS="Berlin, Germany", VOLUME="B-90-07", PAGES="1-16", YEAR=1990, REFERENCES=13, KEYWORDS="Algorithm", ABSTRACT="This paper presents a very simple incremental randomized algorithm for computing the trapezoidal decomposition induced by a set $S$ of $n$ line segments in the plane. If $S$ is given as a simple polygonal chain the expected running time of the algorithm is $O(n log* n)$. This leads to a simple algorithm of the same complexity for triangulating polygons.", } @TECHREPORT{Rubi90:Communication, AUTHOR="I. Rubin and Montasser Ouaily", TITLE="Performance of Communication and Queueing Processors under Message Delay Limits", INSTITUTION="Department of Electrical Engineering, University of California", ADDRESS="Los Angeles, California", YEAR=1990, ABSTRACT="Queueing theory (bounded wait). See \cite{Rubi88:Performance}.", } @INPROCEEDINGS{Aage90:Excess, AUTHOR="F. A. Aagesen and B. E. Helvik", TITLE="Excess Process Policing of Video Sources", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="VII.4.1-14", YEAR=1990, KEYWORDS="Source policing", ABSTRACT="Policing is an important function in B-ISDN networks, which primary objective is to prevent the users from violating ``the contract'' so that other users do not suffer from this misuse. Ensurance of a fair chatging is also expressed as an important policing objective. Hence, contract violation must be considered even if the violation does not cause decrease of the GOS for the users that their contracts. This paper is concerned", } @INPROCEEDINGS{Aars90:Om, AUTHOR="E. Aarstad", TITLE="Om multipleksing av {ATM-kilder}", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="VI.5.1-10", YEAR=1990, LANGUAGE="Danish", KEYWORDS="ATM; bursty traffic; buffer length; multiplexing", ABSTRACT="Artikkelen behandler endel sider ved multipleksing av trafikk i et ATM-nett. Gjennom en sensitivitetsanalyse unders kes hvordan valg av forskjellige fordelingsfunksjoner i en kildemodell påvirker celletapet ved multipleksing. Forkus legges på betydningen av ulike burstkarakteristikker. Det unders kes også hvordan sensitiviteten varierer med st rrelser som bufferlengde, burstlengde og antall multipleksede kilder. Resultate", } @ARTICLE{Albi90:Queueing, AUTHOR="S. L. Albin and Barrett and D. Ito and J. E. Mueller", TITLE="A Queueing Network Analysis of a Health Center", JOURNAL=qs, VOLUME=7, PAGES="51-61", YEAR=1990, KEYWORDS="queueing network", ABSTRACT="Health applications", } @INPROCEEDINGS{Ande90:Problems, AUTHOR="H. K. Andersen", TITLE="Problems in dimensioning the interworking functions for {GSM} plmn", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="X.4.1-13", YEAR=1990, KEYWORDS="Data traffic; data communication; data network; network; network design", ABSTRACT="This paper gives a description of the interworking functions in the GSM network for supporting data traffic internally and to other networks. A list of the main problems in dimensioning these functions is given.", } @ARTICLE{Ande90:Random, AUTHOR="S. L. Anderson", TITLE="Random Number Generators on Vector Supercomputers and other Advanced Architectures", JOURNAL="SIAM Review", VOLUME=32, NUMBER=2, PAGES="221-251", YEAR=1990, KEYWORDS="random number; random number testing; packet switching; multitasking; vectorization", ABSTRACT="This paper is divided into three parts. The first part surveys the more common techniques for generating and testing uniformly distributed random numbers. The second part considers the efficient generation of random numbers on vector computers. The third part discusses the generation and use of random numbers in multitasking environments (which may include multiple processor computers).", } @INPROCEEDINGS{Arvi90:New, AUTHOR="X. Arvidsson", TITLE="A new approach to superposition non-Poissonian arrival streams", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="VI.3.1-13", YEAR=1990, KEYWORDS="Superposition; method; multiserver; priority; arrival process; modeling", ABSTRACT="A new method to merge several non-poissonian traffics into a compound parcel is intruduced. Although primarily intended for the model of a multi-server system with rejection and priorities previously developed by the author, its principal ideas may be generally useful when modelling complicated arrival processes, in particular if dynamic performance characteristics are studied. The key concepts of the approach is to characterize", } @ARTICLE{Asmu90:Exponential, AUTHOR="S. Asmussen", TITLE="Exponential Families and Regression in the Monte Carlo Study of Queues and Random Walks", JOURNAL="The Annals of Statistics", VOLUME=18, NUMBER=4, PAGES="1851-1867", YEAR=1990, KEYWORDS="Monte carlo simulation; regression analysis; random walk; queueing system; exponential queueing network", } @TECHREPORT{Atan90:Generalized, AUTHOR="K. T. Atanassov", TITLE="A Generalized Net, Representing the Travelling Salesman Problem", INSTITUTION="Institute for Microsystems", ADDRESS="Sofia, BG", PAGES=4, YEAR=1990, KEYWORDS="Spn", ABSTRACT="Generalized nets; GN", } @TECHREPORT{Azem90:Pygmalion, AUTHOR="M. Azema-Barac and M. Hewetson and M. Recce and J. Taylor and others", TITLE="Pygmalion, Neural Network Programming Environment", INSTITUTION="Esprit Project 2059", ADDRESS="Belgium", PAGES=11, YEAR=1990, KEYWORDS="Neural network; programming environment; programming", } @ARTICLE{Biag90:Note, AUTHOR="G. Biagini and M. E. Goldfeder", TITLE={A Note on {"A} Closed Form Solution for the G/M/r Machine Interference Model" by {B.D.} Bunday and {E.} Khorram}, JOURNAL=ijpr, VOLUME=28, NUMBER=6, PAGES="1215-1217", YEAR=1990, KEYWORDS="G/m/n; model; closed-form expression", } @ARTICLE{Bono90:Case, AUTHOR="F. Bonomi and B. T. Doshi and J. S. Kaufman and Tien-Chien Lee and A. Kumar", TITLE="A Case Study of an Adaptive Load Balancing Algorithm", JOURNAL=qs, VOLUME=7, PAGES="23-49", YEAR=1990, KEYWORDS="load balancing; queueing theory; multiprocessor system; stochastic approximation; call processing", ABSTRACT="In this paper we present an effective load balancing algorithm for a multi-processor architecture designed for the real time switching of telephone calls. By modidying an algorithm developed for an abstract queueing model, which is of independent interest by itself, we propose a hybrid load balancing algorithm and study its performance in a simulation test-bed. This case-study de", } @ARTICLE{Bran90:Representation, AUTHOR="A. Brandt and Manfred Brandt and Hannelore Sulanke", TITLE="A Representation of a Discrete Distribution By its Binomial Moments", JOURNAL=jap, VOLUME=27, PAGES="208-214", YEAR=1990, KEYWORDS="Stochastic process", ABSTRACT="Jordan's formula", } @INPROCEEDINGS{Carl90:MTM, AUTHOR="E. Carlsson and U. Henriksson", TITLE="{MTM:} Mellanlagring av Trafik Mätdata från {AXE}", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="IX.2.1-3", YEAR=1990, LANGUAGE="Norwegian", KEYWORDS="Measurement; Switching System", } @ARTICLE{Carm90:Heterogeneity, AUTHOR="D. G. Carmichael", TITLE="Heterogeneity in Deterministic Finite Source Queues", JOURNAL=ces, VOLUME=7, NUMBER=1, PAGES="11-19", YEAR=1990, KEYWORDS="queueing theory; finite source; finite queue; heterogeneity; deterministic; earthmoving operations", ABSTRACT="The paper examines the influence of heterogeneous behaviour on the output of finite source queues. specifically general procedures are established for deterministic assumptions which by analogy with the homogeneous case should provide an upper bound on queue output. Considerations of priority treatment of customers arises when customers present", } @ARTICLE{Cohe90:Paradox, AUTHOR="Johanne Cohen and F. P. Kelly", TITLE="A Paradox of Congestion in a Queueing Network", JOURNAL=jap, VOLUME=27, PAGES="730-734", YEAR=1990, KEYWORDS="Queueing theory; congestion control; Braess's paradox; Nash equilibria; non-cooperative game", ABSTRACT="In an uncongested transportation network, adding routes and capacity to an existing network must decrease, or at worst not change, the average time individuals require to travel through the network from a source to a destination. Braess (1968) discovered that the same is not true in congested networks. Here we give an example of a queueing network in which added capacity", } @ARTICLE{DeAr90:Improving, AUTHOR="J. DeArman", TITLE="Improving Random Number Generators on Micro-Computers", JOURNAL="Computers and Operations Research", VOLUME=17, NUMBER=3, PAGES="283-295", YEAR=1990, KEYWORDS="random number; PC", ABSTRACT="Some random number generators in micro-computer software are found to have serial correlations at low-order lags. Experiments using composite generator methods are performed in an attempt to remove these serial correlations. Success is achieved when proper input parameter settings are used to direct the composite generator methods. A procedure is presented whereby these methods are applied to the global (entire sample) an", } @ARTICLE{Douk90:Application, AUTHOR="G. I. Doukidis and R. J. Paul", TITLE="A Survey of the Application of Artificial Intelligence Techniques within the {OR} Society", JOURNAL=jors, VOLUME=41, NUMBER=5, PAGES="363-375", YEAR=1990, KEYWORDS="artificial intelligence; expert system; survey", } @ARTICLE{Egle90:Simulated, AUTHOR="R. W. Eglese", TITLE="Simulated Annealing: A Tool for Operational Research", JOURNAL=ejor, VOLUME=46, PAGES="271-281", YEAR=1990, KEYWORDS="heuristics; optimization", ABSTRACT="Simulated annealing", } @ARTICLE{Elpe90:Machine, AUTHOR="T. Elperin and I. Weissberg and E. Zahavi", TITLE="Machine Design Optimization by the Monte Carlo Annealing Method", JOURNAL="Engineering Optimization", VOLUME=5, PAGES="193-203", YEAR=1990, KEYWORDS="Optimization", } @ARTICLE{Faki90:Group, AUTHOR="D. Fakinos", TITLE="On the M/G/k Group-Arrival Loss System", JOURNAL=ejor, VOLUME=44, PAGES="75-83", YEAR=1990, KEYWORDS="M/G/1/S; loss system; bulk arrival; equilibrium distribution; multiserver", } @ARTICLE{Faki90:Equilibrium, AUTHOR="D. Fakinos", TITLE="Equilibrium Queue Size Distributions for Semi-Reversible Queues", JOURNAL="Stochastic Processes and their Applications", VOLUME=36, PAGES="331-337", YEAR=1990, KEYWORDS="queueing system; product form; queueing network; reversibility", } @ARTICLE{Faki90:Relation, AUTHOR="D. Fakinos", TITLE="On the Relation Between Partial Balance and Insensitivity", JOURNAL=jap, VOLUME=27, PAGES="445-451", YEAR=1990, KEYWORDS="Markov process; delay time; soujourn times", ABSTRACT="Direct and simple proofs are given of the equivalence of partial balance over a set of states and the fact that the corresponding equilibrium distribution is insensitive to nominal sojourn time in that set and independent of its past and remaining duration. By a counter-example it is shown that solely insensitivity is not sufficient for partial balance.", } @ARTICLE{Fali90:Retrial, AUTHOR="G. I. Falin", TITLE="A Survey of Retrial Queues", JOURNAL=qs, VOLUME=7, PAGES="127-168", YEAR=1990, KEYWORDS="call reattempt; multichannel; single server; queue length; waiting time; busy period; limit theorem; numerical method; single and multiple channel", ABSTRACT="We present a survey of the main results and methods of the theory of retrial queues, concentrating on markovian single- and multi-channel systems. For the single channel case we consider the main model as well as models with batch arrivals, multiclasses, customer impatience, double connections, control devices, two-way communication and buffer. The stochastic processes arising from these models are", } @INPROCEEDINGS{Falk90:Shortest, AUTHOR="L. Falk", TITLE="Shortest Queue Routing", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="III.2.1-11", YEAR=1990, KEYWORDS="Packet switching; routing; routing algorithm; approximation; analytical model", ABSTRACT="A model of a packet-switched network with window flow control and optimal routing is presented. The network is modelled as 2 different parallel queues, each representing a route and the node in which packets have to wait for access to the network is modelled as a queue. Both exact and approximate results are considered. As a result we also get a good approximation for the state probabilities of the general shortest queue", } @ARTICLE{Glov90:Tabu, AUTHOR="F. Glover", TITLE="Tabu Search: A Tutorial", JOURNAL="Interfaces", VOLUME=20, NUMBER=4, PAGES="74-94", YEAR=1990, KEYWORDS="Survey; Tutorial; Mathematical Method", } @INPROCEEDINGS{Grün90:SIMENTS, AUTHOR="I. Grünbæk", TITLE="{SIMENTS} {B-ISDN} Activities", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="I.3.1-14", YEAR=1990, KEYWORDS="Communication Network; ATM; ISDN; Broadband; Field Trial", ABSTRACT="Broadband communication is on its way to becoming reality. Several trials and pilot projects challenge technology and system development to provide the basis for new applications, outside the scope of existing narrowband networks. This paper deals with some examples of broadband communications, carried out during the field trials BIGFON and BERKOM. A possible evoluation from existing ISDN exchanges to a universal ATM-base", } @ARTICLE{Hadj90:Generalized, AUTHOR="L. M. Hadjyisky and K. T. Atanassov", TITLE="A Generalized Net, Representing the elements of one New Neuron Network Set", JOURNAL="AMSE Review", PAGES=5, YEAR=1990, KEYWORDS="Neural network; Petri net", ABSTRACT="Generalized nets; GN", } @ARTICLE{Hans90:Estimation, AUTHOR="C. K. Hansen and P. Thyregod", TITLE="Estimation of the Mean Cumulative Number of Failures in a Repairable System with Mixed Exponential Component Lifetimes", JOURNAL="Quality and Reliability Engineering International", VOLUME=6, PAGES="320-340", YEAR=1990, KEYWORDS="Superimposed renewal process; field failures; exponential regression; least squares estimation; renewal process; failure; regression analysis", } @ARTICLE{Hare90:Convexity, AUTHOR="A. Harel", TITLE="Convexity Property of the {Erlang} Loss Formula", JOURNAL=or, VOLUME=38, NUMBER=3, PAGES="499-503", YEAR=1990, KEYWORDS="queueing system; loss system; design of queues", ABSTRACT="We prove that the throughput of the M/G/x/x system is jointly concave in the arrival and service rates. We also show that the fraction of customers lost in the M/G/x/x system is convex in the arrival rate, if the traffic intensity is below some ro and concave if the traffic intensity is greater than ro. For 18 or less servers, ro is less than one. For 19 or more servers, ro is between 1 and 1.5. Also the", } @INPROCEEDINGS{Hatl90:Om, AUTHOR="E. Hatlebakk", TITLE="Om diskret event simulering og metodens yteevne", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="IX.4.1-5", YEAR=1990, LANGUAGE="Norwegian", KEYWORDS="Simulation; simulation method; discrete event simulation", ABSTRACT="Metoden diskret evnet simulering er mye benyttet i analyser i teletrafikk. Den benyttes ofte som et supplement til analytiske metoder eller på komplekse problemer som er vanskelig å analysere ved analytiske metoder. En har i det siste benyttet i forbindelse med studier av ATM, og da har sp rsmmålet om metodens yteevne blitt aktuelt på flere måter.", } @INPROCEEDINGS{Haug90:Historisk, AUTHOR="R. B. Haugen", TITLE="Historisk oversikt", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="V.2", YEAR=1990, LANGUAGE="Norwegian", KEYWORDS="Survey; history; overview", } @INPROCEEDINGS{Hauk90:Hvordan, AUTHOR="J. Haukeland", TITLE="Hvordan Dimensjonere en System 12 Sentral", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="II.4.1-II.4.8", YEAR=1990, LANGUAGE="Norwegian", KEYWORDS="Design; Switching System; Mobile Radio; Computer Performance", ABSTRACT="Foredraget vil gi en overordnet beskrivelse av trafikkrelaterte dimensjoneringsregler samt en kort beskrivelse av en modell benyttet for å evaluere prosessorbelasting og responstider. Nært knyttet til System 12 familien er også l sninger for GSM (det digitale pan-europeiske mobiltelefonsystemet) og IN (intelligente nett). Disse vil bli kort beskrevet uten nærmere beskrivelse av regler for dimensjonering.", } @INPROCEEDINGS{Hemm90:Sammensatte, AUTHOR="H. Hemmer and P. T. Huth", TITLE="Sammensatte Funksjoner for Politovervåking", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="VII.1.1-18", YEAR=1990, LANGUAGE="Norwegian", KEYWORDS="ATM; Simulation; Policing Function; Source Policing", ABSTRACT="Det er utf rt evaluering av av ulike politifunksjoner med utgangspunkt i ulike kontraktsparametre og kildetyper. Til arbeidet er det benyttet et simuleringsprogram på cellenivå med ulike politifunksjoner og kilder implementert. Eksperimenter har vist at kilder som skal overvåkes må ha en mer begrensende kontrakt enn en ren middelverdi. Vi bruker derfor begrepet virtuell middelverdi, som er middelverdi over fast tidsinterv", } @TECHREPORT{Hofi90:Stationary, AUTHOR="J. Höfig", TITLE="Stationary and Dynamic Behaviour of Controlled Priority Cut-Off Systems", INSTITUTION="Institute for Electronic Systems and Switching, University of Dortmund", ADDRESS="Dortmund, Germany", PAGES=18, YEAR=1990, KEYWORDS="Queueing system; cut-off priority", } @INCOLLECTION{Hewe90:Pygmalion, AUTHOR="M. Hewetson", TITLE="Pygmalion Neural Network Programming Environment. Overview", BOOKTITLE="Esprit Project", PUBLISHER="European Commission", PAGES=30, YEAR=1990, KEYWORDS="neural network", } @ARTICLE{Hsu90:Queueing, AUTHOR="G.-H. Hsu", TITLE="A Survey of queueing Theory", JOURNAL="Annals of Operations Research", VOLUME=24, PAGES="29-43", YEAR=1990, KEYWORDS="Queueing theory; survey; China", ABSTRACT="This paper is intended to give a survey of the main results of queueing theory in China. It consists of five parts: (1) the transient behaviour of typical queueing systems; (2) classical problems; (3) approximation theory; (4) model structure; (5) applications.", } @INPROCEEDINGS{Iver90:Convolution, AUTHOR="V. B. Iversen and Y. Liu", TITLE="The Performance of Convolution Algorithms for Evaluating the Total Loss in an {ISDN} System", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="IV.3.1-14", YEAR=1990, KEYWORDS="loss system", ABSTRACT="We present an overview of algorithms for the exact evaluation of the total load in multi-slot ISDN and B-ISDN (ATM) system. We compare and discuss the algorithms and conclude that the convolution algorithm by Iversen is the most efficient algorithm.", } @INPROCEEDINGS{Iver90:Generalized, AUTHOR="V. B. Iversen and Annemarie B. Nielsen", TITLE="A Generalized Policing Mechanism Based on the Leaky Bucket", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="VII.3.1-8", YEAR=1990, KEYWORDS="ATM; leaky bucket", ABSTRACT="A generalized version of the Leaky Bucket, witch is equivalent to a Fixed (Jumping) Interval Average mechanism with a credit counter is introduced. The fundamental operation is counting, which is also of importance for eg. connection acceptance control, charging, and load monitoring. A hierarchy of parallel policing functions to cover the different time scales can be implemented in a simple way.", } @INPROCEEDINGS{Jens90:Status, AUTHOR="E. Lykke Jensen", TITLE="Status for {ATM} in {RACE}", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="I.2.1-16", YEAR=1990, KEYWORDS="ATM", ABSTRACT="Flere av prosjektene i forskningsprogrammet RACE har aktiviteter relatert til ATM. Ved prosjektstart forelå ingen standarder for dette overf ringsprinsippet. Nå er de f rste ATM-standardene kommet fra CCITT. De har medf rt en oppdadtering av flere RACE prosjekter. RACE har publishert en liste med mye arbeidsoppgaver for de kommende 4-5 år. Den gir signaler om den videre utviklingen av ATM i forskningsprogrammet.", } @ARTICLE{Jun90:Approximate, AUTHOR="K. P. Jun and Harry Perros", TITLE="An Approximate Analysis of Open Tandem Queueing Networks with Blocking and General Service Times", JOURNAL=ejor, VOLUME=46, PAGES="123-135", YEAR=1990, KEYWORDS="tandem queue; blocking; Cox distribution", } @ARTICLE{Kapu9002:Cost, AUTHOR="P. K. Kapur", TITLE="Cost-Reliability Optimum Release Policies for a Software System with Testing Effort", JOURNAL="Opsearch", VOLUME=27, NUMBER=2, PAGES="109-116", YEAR=1990, KEYWORDS="Software engineering", ABSTRACT="This paper discusses optimum release policies for a software system minimising the expected software cost, simultaneously meeting the reliability requirement and incorporating the effect of testing effort expenditure. Software reliability growth models are based on non-homogeneous Poisson process. Assuming particular forms of testing effort functions, optimum policies are derived. A numerical example is given at the end.", } @ARTICLE{Kapu90:Optimal, AUTHOR="P. K. Kapur and R. B. Garg", TITLE="Optimal Software Release Policies for Software Reliability Growth Models under Imperfect Debugging", JOURNAL=rairo, VOLUME=24, NUMBER=3, PAGES="295-305", YEAR=1990, KEYWORDS="software; mean lifetime; release policies; imperfect debugging; life cycle", ABSTRACT="In this paper we discuss two software reliability models (SRGMs) under imperfect debugging based on a non-homogeneous Poisson Process (NHPP). Parameters of the models are estimated and optimal release policies are discussed. Numerical results are presented at the end.", } @ARTICLE{Kell90:Routing, AUTHOR="F. P. Kelly", TITLE="Routing and Capacity Allocation in Networks with Trunk Reservation", JOURNAL=mor, VOLUME=15, NUMBER=4, PAGES="771-793", YEAR=1990, KEYWORDS="network flow; alternate routing; dynamic routing; approximation; optimization; cost; fixed point approximation; implied cost", ABSTRACT="In this paper we extend recent work on routing and capacity allocation in circuit-switched networks to include the possible use of trunk reservation. Trunk reservation is an easily implemented control mechanism which allows priority to be given to chosen traffic streams. It has the potential to be an extremely efficient control mechanism, but its use on any single link of a network", } @ARTICLE{Khal90:Star, AUTHOR="Z. Khalil and G. I. Falin", TITLE="A Star-like Circuit-Switching Network with Multistage Service", JOURNAL=aap, VOLUME=22, PAGES="965-967", YEAR=1990, KEYWORDS="network optimization; likelihood ordering; optimal network performance", ABSTRACT="A star-like circuit-switching network with multistage service is considered. Likelihood ratio ordering is used to show that there exists an optimal threshold for the mean number of messages processed through the network as a function of the input traffic intensity.", } @INPROCEEDINGS{Kilk90:Comparison, AUTHOR="K. Kilkki", TITLE="Performance Comparison of {ATM} Switch Structures", BOOKTITLE="NTS 8", ADDRESS="Kjeller, Norway", PAGES="IV.3.1-10", YEAR=1990, KEYWORDS="ATM; switching block; comparison", ABSTRACT="This paper deals with the performance of ATM switch structures. Switches can be categorized into one of six topologies:input buffer, output buffer, distributed output buffer, common memory, interconnection network and parallel ring. The comparison is based on three analytical model and on a simulation model. Input buffer and interconnection network structures need some modifications to achieve a adequate performance.", } @ARTICLE{Kist90:Warteschlangen, AUTHOR="K. P. Kistner and M. S. Switalski", TITLE="Warteschlangen-Netzwerke in der hierarchischen Produktionsplanung", JOURNAL=ors, ADDRESS="Germany", VOLUME=12, PAGES="89-101", YEAR=1990, LANGUAGE="German", KEYWORDS="queueing network; production system", ABSTRACT="FMS; Production planning", } @ARTICLE{Klei90:Synchronous, AUTHOR="M. Klein", TITLE="The Synchronous Digital Hierarchy: Principles, Variants and Applications", JOURNAL=ptr, VOLUME=48, NUMBER=4, PAGES="20-27", YEAR=1990, KEYWORDS="Sdh", ABSTRACT="The introduction of the Synchronous Digital Hierarchy (SDH) promises a homogeneous transmission network worldwide. Basic principles of the SDH, the status of the international standardisation, and unresolved problems are described. Examples demonstrate the flexibility of SDH-based equipment and networks with respect to present needs as well as future applications.", } @ARTICLE{Klim9003:Optimization, AUTHOR="G. P. Klimov", TITLE="Optimization of the Order of Service", JOURNAL="Belgian Journal of Operations Reserach, Statistics and Computer Science", ADDRESS="Belgium", VOLUME=30, NUMBER=3, PAGES="45-53", YEAR=1990, KEYWORDS="Service discipline", } @INPROCEEDINGS{Knut90:Modelling, AUTHOR="A. Knutsson", TITLE="Modelling the Dynamics of Traffic Systems using Martingales: The Fight between Voice, Data, and Video Traffic in an {ATM} system", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="III.5.1-9", YEAR=1990, KEYWORDS="Martingale", } @MISC{Kühn90:International, AUTHOR="P. J. Kühn", TITLE="The International Teletraffic Congresses and the Teletraffic Theory", ADDRESS="Lyngby, Denmark", PAGES=12, NOTE="Paper dedicated to Professor Dr. Arne Jensen on his 70th birthday", YEAR=1990, KEYWORDS="Queueing theory; survey; ITC", } @INPROCEEDINGS{Lars90:Three, AUTHOR="B. D. Larsen and A. L. Kragh", TITLE="Three different ways to evaluate a Cellular Mobile Telephone System", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="III.1.1-9", YEAR=1990, KEYWORDS="Mobile radio", ABSTRACT="We present a comparative study of three methods for analysis and evaluation of an open queueing network with rejection and repeated call attempts in the nodes. The methods are used to analyze models of the Nordic Mobile Telephone System (NMT). The NMT system is modelled as an open queueing network to which three traffic types are offered; mobile-to-land (MTL), land-to-mobile (LTM) and hand-over.", } @ARTICLE{Lars9005:Queue, AUTHOR="R. E. Larson", TITLE="The Queue Inference Engine: Deducing Queue Statistics from Transactional Data", JOURNAL=ms, VOLUME=36, NUMBER=5, PAGES="586-601", YEAR=1990, KEYWORDS="Queueing theory", } @ARTICLE{Law9005:Secrets, AUTHOR="A. M. Law and M. G. McComas", TITLE="Secrets of Successfull Simulation Studies", JOURNAL="Industrial Engineering", VOLUME=22, NUMBER=5, PAGES="47-52", YEAR=1990, KEYWORDS="Simulation; output analysis", } @ARTICLE{Lee90:Approximation, AUTHOR="Hwang-Soo Lee and S. M. Pollock", TITLE="Approximation analysis of Open Acyclic Exponential Queueing Networks with Blocking", JOURNAL=or, VOLUME=38, NUMBER=6, PAGES="1124-1134", YEAR=1990, KEYWORDS="queueing system; analysis; limit theorem", } @INPROCEEDINGS{Lind90:Trafikvariationer, AUTHOR="G. Lind", TITLE="Trafikvariationer i Könät", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="III.3", YEAR=1990, LANGUAGE="Norwegian", ABSTRACT={Bidraget kommer att redovisa fortsatta studier inom det område som introducerades i bidraget "Utvidningar av könätsteorin" vid NTS 8 i Helsingfors 1989. Studierna avser undersökning av hur man kan modellera trafikvariationer i könät.}, } @INPROCEEDINGS{Lind90:Programvarufel, AUTHOR="Lindahl", TITLE="Programvarufel i realtidssystem och hur man undviker dem", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", YEAR=1990, LANGUAGE="Norwegian", ABSTRACT="1. Metoder 2. Felgrupper 3. Förslag på Åtgärder", } @INPROCEEDINGS{Løke90:Innledning, AUTHOR="B. Løken", TITLE="Innledning til diskusjon om innf ringsstrategier for {B-ISDN} i telenettene", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="VIII.3", YEAR=1990, LANGUAGE="Norwegian", KEYWORDS="B-ISDN", } @INPROCEEDINGS{Lund90:Alcatels, AUTHOR="M. Lund", TITLE="Alcatels {ATM-program}", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="VIII.2.1-15", YEAR=1990, KEYWORDS="ATM; switching block", } @ARTICLE{Maco90:Uniform, AUTHOR="J. H. Macomber and C. C. White", TITLE="An n-Dimensional Uniform Random Number Generator Suitable for {IBM-Compatible} Microcomputers", JOURNAL="Interfaces", VOLUME=20, NUMBER=3, PAGES="49-59", YEAR=1990, KEYWORDS="simulation; random number", ABSTRACT="The uniform random number generator is the basic building block used in computer-based Monte Carlo and simulation studies. Mixed congruential random number generators, such as those intrinsic to MS-DOS or PC-DOS BASIC, have a number of shortcomings that make them unsuitable in multidimensional studies. A random number generator that overcomes these shortcomings is the generalized feedback shift register generator, an algorithm", } @INPROCEEDINGS{Mads90:Use, AUTHOR="H. Madsen and B. F. Nielsen", TITLE="The use of phase type distributions for modelling packet-switched traffic", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="VI.4.1-17", YEAR=1990, KEYWORDS="Arrival process; packet switching", ABSTRACT="As a basis for using approximation with phase type distributions traffic measurements from the Danish packed-switched network PAXNET are used. Parameters are estimated with several different methods and the performance of the various methods is investigated. Especially the properties of peak-hour traffic are studied.", } @ARTICLE{Mars90:Universal, AUTHOR="G. Marsaglia and A. Zaman and W. W. Tsang", TITLE="Toward a Universal Random Number Generator", JOURNAL="Statistics \& Probability Letter", VOLUME=8, NUMBER=1, PAGES="35-39", YEAR=1990, KEYWORDS="random number", ABSTRACT="This article describes an approach towards a random number generator that passes all of the stringent tests for randomness we have put to it, and that is able to produce exactly the same sequence of uniform random variables in a wide variety of computers, including TRS80, Apple, Mackintosh, Commodore, Kaypro, IBM PC, AT, PC and AT clones, Sun, Vax, IBM 360/370, 3090, Amdahl, CDC Cyber and even 205 ETA supercomputers.", } @ARTICLE{Msso90:Computation, AUTHOR="E. Másson and Yixin Wang", TITLE="Introduction to Computation and Learning in Artificial Neural Networks", JOURNAL=ejor, NUMBER=47, PAGES="1-28", YEAR=1990, KEYWORDS="neural network; process; optimization; learning; adaptive processes", ABSTRACT="A short historical overview of the development of artificial neural networks is given and some of the concepts used within the field are introduced. We describe then 5 network models: The perceptron, the Hopfield network, the Hopfield-Tank net, the boltzmann machine and the Kohonen self-organizing network. The description of each model consists of topology, dynamics of computation and learnin", } @INPROCEEDINGS{Melt90:Verifikasjons, AUTHOR="O. Melteig", TITLE="Verifikasjons- og måleutstyr for {ATM-konseptet} fra {PARASOL}", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="VI.1", YEAR=1990, LANGUAGE="Norwegian", KEYWORDS="ATM; Traffic generator", ABSTRACT="Verifikasjon av ATM-konseptet vil bli foretatt gjennom sanntidsmålinger i demonstrasjonsnettverk som nå er under bygging ved flere laboratorier i Europa. Som en forlengelse av verifikasjonsmålingene, vil vi få en prosess der leverand rene av brukerutstyr tilstreber best mulig tjenestekvalitet innenfor de kategorier av pris og bitrate som nettoperat ren leverer, mens nettoperat rene vil s ke å optimalisere resursbruken i n", } @INPROCEEDINGS{Meye90:Empirisk, AUTHOR="F. Meyer and J. Rasmussen", TITLE="Empirisk Unders gelse af Usikkerhed ved Måling af Trafikintensitet", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="IX.1.1-6", YEAR=1990, LANGUAGE="Norwegian", KEYWORDS="Traffic measurement", ABSTRACT="Til enhver trafikmåling knytter der sig en række usikkerheder på måleresultaternes overensstemmelse med den faktiske trafik. I den konkrete anvendelse af måleresultaterne b r man have et overblik over de usikkerhedsmomenter, der g r sig gældende. Denne artikel giver et bud på en metode, hvormed usikkerhedsmomenterne i en trafikmåling kan vurderes. Metoden består i at analysere afvigelserne på dobbeltmålinger.", } @ARTICLE{Mokh9003:Typology, AUTHOR="P. L. Mokhtarian", TITLE="A Typology of Relationships Between Telecommunications and Transportation", JOURNAL="Transportation Research", VOLUME="24A", NUMBER=3, PAGES="231-242", YEAR=1990, KEYWORDS="Bibliography", } @ARTICLE{Nawi9005:Look, AUTHOR="W. M. Nawijn", TITLE="Look-Ahead Policies for Admission to a Single Server Loss System", JOURNAL=or, VOLUME=38, NUMBER=5, PAGES="854-862", YEAR=1990, KEYWORDS="Loss system; single server", } @INPROCEEDINGS{Nørg90:Output, AUTHOR="K. Nørgaard and M. Hansen", TITLE="Output traffic from an {ATM-node}", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="II.5.1-4", YEAR=1990, KEYWORDS="ATM; output process", ABSTRACT="How is a traffic process changed, after it has passed a node in the ATM network? In order to model the process, we focus on the change in two parameters, autocorrelation and coefficient of variation of inter-arrival times: The decrease in the one leads to an increase in the other. We find an empirical approximate linear relation. We approximate a process to these parameters and find, that they enable us to calculate accurately", } @INPROCEEDINGS{Norr90:ATM, AUTHOR="I. Norros and J. T. Virtamo", TITLE="{ATM} traffic measurement by logarithmic histogram counting", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="VII.2.1-6", YEAR=1990, KEYWORDS="ATM; traffic measurement", ABSTRACT="The interconnected problems of policing, traffic measurement and charging form a true ``Bermuda triangle'' which is threatening the whole concept of a public ATM network.", } @TECHREPORT{Nybe90:Load, AUTHOR="C. Nyberg", TITLE="Load Estimation for an M/G/1-Queue", INSTITUTION="Dept. of Computer Systems, Lund Institute of Technology", ADDRESS="Lund, Sweden", NUMBER=102, PAGES=10, YEAR=1990, KEYWORDS="M/g/1", ABSTRACT="The report is focused on the work performed by a single server with a queue during a finite time interval. This work can be used as an estimation of the load of the queue. The problem which has a number of applications arose when studying different mechanisms for overload control of SPC-systems. For intervals of constant length, the first two moments of the metric are given but for exponentially distributed", } @TECHREPORT{Nybe90:Overload, AUTHOR="C. Nyberg and U. Körner and B. Wallström", TITLE="Overload Control in {SPC-Systems.} Some Basic Lessons", INSTITUTION="Department of Com. Systems, Lund Inst. of Technology", ADDRESS="Lund, Sweden", NUMBER=102, PAGES=13, NOTE="Two Short Papers on Overload Control of Switching Nodes; presented at NTS-8", YEAR=1990, KEYWORDS="Overload control", ABSTRACT="The scope of this report is to highlight, evaluate and compare three different principles for overload control of a central processor (CP) in sn SPC-system. The principles have in common that new arrivals may be throttled or even totally blocked under periods of overload. These actions are taken based on information of the current CP-queue length, of the average CP-load during", } @INPROCEEDINGS{Nybe90:Priorities, AUTHOR="C. Nyberg and U. Körner and B. Wallström", TITLE="Priorities and Overload Control", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="III.4.1-4", YEAR=1990, KEYWORDS="SPC; priority; overload control", ABSTRACT="Overload control mechanisms must be implemented in SPC-systems in order to prevent switching capacity from decreasing as a result of increasing overload of the control system, i.e. the system must continue to show good throuhht characteristics also under periods of overlosd. When monitoring an overload, here by counting new calls under a time interval, new calls are either throttled or totally blocked. In an ISDN environment", } @ARTICLE{Nyga9004:Neural, AUTHOR="K. E. Nygard and P. Juell and N. Kadaba", TITLE="Neural Networks for Selecting Vehicle routing Heuristics", JOURNAL="ORSA Journal on Computing", VOLUME=2, NUMBER=4, PAGES="353-364", YEAR=1990, KEYWORDS="Neural network; routing", } @INPROCEEDINGS{Ormh90:Svitsjeblokker, AUTHOR="T. Ormhaug and O. Oesterboe", TITLE="Svitsjeblokker i {ATM.} Egenskaper avhengig av svitsjearkitektur og trafikkforutsentninger", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="II.2", YEAR=1990, LANGUAGE="Norwegian", KEYWORDS="ATM; loss probability", ABSTRACT="Svitsjing av ATM-trafikk innebærer funksjioner fpr rom-svitsjing og statistisk multipleksing av celler på utgående forbinbdelser. En st rre svitsj forutsettes å bygges opp av et nett av svitsje-elementer eller svitsje-blokker. I foredraget gj res en sammenligning av ulike l sninger som er foreslått for å realisere svitsje-blokker. Egenskapene vil avhenge av ytre forutsetninger gitt ved trafikkkildene, og hvordan svitsje-b", } @ARTICLE{Papa90:Relations, AUTHOR="X. Papaconstantinou and D. Bertsimas", TITLE="Relations Between the Prearrival and Postdeparture State Probabilities and the {FCFC} Waiting Time Distribution in the Ek/G/s Queue", JOURNAL=navres, VOLUME=37, PAGES="135-149", YEAR=1990, KEYWORDS="Queueing system; waiting time", ABSTRACT="We generalize a theorem by Burke concerning the relations between the prearrival and the postdeparture state probabilities and we establish the relation of the postdeparture probabilities and the FCFS waiting time distribution in the Ek/G/s queue. Based on these results, an exact probabilistic method for the explicit evaluation of the stationary FCFS waiting time distribution of the Ek/G/s queue", } @INPROCEEDINGS{Pett90:Dirigering, AUTHOR="H. Pettersen", TITLE="Dirigering og ressursallokering i {ATM} nett", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="IV.2 (10)", YEAR=1990, LANGUAGE="Norwegian", KEYWORDS="ATM", ABSTRACT="ATM er et forbindesesorientert nett og f lgelig vil en del av prinsippene for dirigering i linjesvitsjede nett kunne komme til anvendelse i et ATM nett. Imidlertid vil dirigeringen kunne gj res betinget av ATM spesifikke egenskaper som variabel eller konstant bitrate trafikk, QOS krav og båndbreddebehov. Avgj rende for dette vil være avveininger mellom statistisk multipleksingsgevinst og kompleksitet i kontrollsystemet.", } @ARTICLE{Pier90:Artificial, AUTHOR="S. Pierre and H.-H. Hoang", TITLE="An Artificial Intelligence Approach to Improving Computer Communications Network Topologies", JOURNAL=jors, VOLUME=41, NUMBER=5, PAGES="405-418", YEAR=1990, KEYWORDS="computer network; optimization", } @INPROCEEDINGS{Pils90:Samband, AUTHOR="I. Pilsäter and T. Rålenius", TITLE="Samband mellan underhållsstrategier och tillförlitlighetskrav på nätkomponenter", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="X.2.1-7", YEAR=1990, LANGUAGE="Norwegian", ABSTRACT="I det här bidraget visas hur generell analytisk metod för tillförlitlighetsplanering med fördel kan tillämpas gemensamt av nätoperatör och leverantör i samband med utveckling av framtida telesystem. Gäller det inköp av befintliga produkter/system är det i första nätoperatören som är aktiv. I bidraget visas också hur en avvägning mellan satsning på funktionssäkerhet i nätkomponenter och satsning på underhållsäkerhet kan gö", } @TECHREPORT{Quer90:Multicopy, AUTHOR="Ulrich Quernheim and Stephan Jacobs", TITLE="Multicopy {ARQ} Error Control Techniques for Multipoint Satellite Links", INSTITUTION="Institute Informatik IV, RWTH Aachen", ADDRESS="Germany", PAGES=14, YEAR=1990, KEYWORDS="Satellite radio", } @INPROCEEDINGS{Rahk90:Historisk, AUTHOR="K. Rahko", TITLE="Historisk översikt; Trafikforskning i Finland på 1990-talet", BOOKTITLE="NTS", ADDRESS="Kjeller, Norway", YEAR=1990, LANGUAGE="Finnish", } @ARTICLE{Rama90:Probabilistic, AUTHOR="M. F. Ramalhoto", TITLE="Probabilistic Modelling in Engineering - Queueing Theory", JOURNAL="European Journal of Engineering Education", VOLUME=15, PAGES="235-241", YEAR=1990, KEYWORDS="Queueing theory", } @INPROCEEDINGS{Rasm90:Asynchronous, AUTHOR="C. Rasmussen", TITLE="Asynchronous transfer mode, why and how", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="I.1.1-5", YEAR=1990, KEYWORDS="ATM; survey", ABSTRACT="The goal of this paper is to discuss the role of asynchronous transfer mode in future broadband networks. Asynchronous transfer mode is here considered not only as ATM but generally as any not synchronous transfer mode. ATM is given special attention being the official technique for B-ISDN according to CCITT, but only the main principles are discussed. It is tentatively concluded that future broadband networks are likely", } @ARTICLE{Ross90:Teletraffic, AUTHOR="Keith W. Ross and D. Tsang", TITLE="Teletraffic Engineering for Product-Form Circuit-Switched networks", JOURNAL=aap, VOLUME=22, PAGES="657-675", YEAR=1990, KEYWORDS="telephony; reversibility; convolution algorithm; Norton's theorem", ABSTRACT="We develop a performance modeling methodology for product-form circuit-switched networks. These networks allow for: arbitrary topology and link capacities; Poisson and finite population arrivals; multiple classes of calls, each class with a different route and bandwidth requirement; conference as well as point-to-point calls. the methodology is first applied to generalized tree networks, which consist of multiple access", } @ARTICLE{Sali90:Descriptive, AUTHOR="E. Saliby", TITLE="Descriptive Sampling: A Better Approach to Monte Carlo Simulation", JOURNAL=jors, VOLUME=41, NUMBER=12, PAGES="1133-1142", YEAR=1990, KEYWORDS="Monte Carlo simulation; sampling; variance reduction", } @INPROCEEDINGS{Sand90:Ericssons, AUTHOR="L. Sandström", TITLE="Ericssons {ATM} program", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="VIII.1", YEAR=1990, KEYWORDS="ATM; survey", } @ARTICLE{Scoz9003:Merged, AUTHOR="R. Scozzafava", TITLE="A merged Approach to Stochastics in Engineering Curricula", JOURNAL="European Journal of Engineering Education", VOLUME=15, NUMBER=3, PAGES="243-250", YEAR=1990, KEYWORDS="Stochastic theory", } @ARTICLE{Seil90:Use, AUTHOR="A. F. Seila and J. Banks", TITLE="Use An Electronic Spreadsheet As a Decision support System", JOURNAL="Industrial Engineering", VOLUME="22 (1987)", NUMBER=5, PAGES="40-46", YEAR=1990, KEYWORDS="simulation", } @TECHREPORT{Shis90:Overload, AUTHOR="R. Shishkova and B. Tsankov", TITLE="Overload Control in an {STM} Environment", INSTITUTION="Technical University of Sofia, Institute of Telecommunications", ADDRESS="Sofia, Romania", PAGES=8, YEAR=1990, KEYWORDS="ISDN; GOS; overload control", ABSTRACT="With the integrated services networks with circuit switching (STM environment), serving calls with different arrival rates there are two major problems that have attracted the attention od specialists: traffic performance evaluation and grade of service (GOS) control. Serving multirate traffic by means of a common trunk group results in mutual influence between the different streams that is especially strong in the case of", } @ARTICLE{Sobe90:Throughput, AUTHOR="M. J. Sobel", TITLE="Throughput Maximization in a Loss Queueing System with heterogeneous Servers", JOURNAL=jap, VOLUME=27, PAGES="693-700", YEAR=1990, KEYWORDS="M/M/N/S; heterogeneous server; throughput; throughput maximization; matching customers with servers", ABSTRACT="Assigning each customer to the fastest idle server is shown to maximize throughput (equivalently, minimize blocking probability) in a queueing model with Poisson arrivals, heterogeneous exponential servers, and no waiting room. If a cost structure is imposed on this model, under specified conditions the same policy minimizes the expected discounted cost and the long-term", } @INPROCEEDINGS{Sole90:Komplekse, AUTHOR="R. R. Solem", TITLE="Komplekse system- Hva har vi vunnet og hva har vi tapt", BOOKTITLE="NTS", ADDRESS="Kjeller, Norway", YEAR=1990, LANGUAGE="Norwegian", } @ARTICLE{Stan90:Queues, AUTHOR="Robert E. Stanford", TITLE="On Queues with Impatience", JOURNAL=aap, VOLUME=22, PAGES="768-769", YEAR=1990, KEYWORDS="Queueing system; impatient customer", ABSTRACT="Time-out", } @INPROCEEDINGS{Stef90:Generalized, AUTHOR="M. Stefanova-Pavlova and R. Christov and E. Dincheva", TITLE="Generalized-Net Model of a Flexible Manufacturing System", BOOKTITLE="2nd Scientific Session of the Mathematical Foundation of Artificial Intelligence Seminar (IM-MFAIS)", ADDRESS="Sofia, Bulgaria", PAGES="40-42", YEAR=1990, KEYWORDS="Manufacturing system; Petri net", ABSTRACT="Generalized nets; GN", } @INPROCEEDINGS{Stor90:Utbyggingsstrategi, AUTHOR="K. Stordahl", TITLE="Utbyggingsstrategi for Oslonettet", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="X.1.1-4", YEAR=1990, LANGUAGE="Danish", ABSTRACT="Foredraget gir en oversikt over nåværende nettstrukturer samt planer og strategier for videre utbygging i Olso teledistrikt.", } @ARTICLE{Sure90:Arranging, AUTHOR="S. Suresh and W. Whitt", TITLE="Arranging Queues in Series: A Simulation Experiment", JOURNAL=ms, VOLUME=36, NUMBER=9, PAGES="1080-1091", YEAR=1990, KEYWORDS="queueing network; tandem queue; interdeparture time; queueing system; simulation; approximation; decomposition; approximation; parametric decomposition approximations", ABSTRACT="For given external arrival process and given service-time distributions, the object is to determine the order of infinite-capacity single server queues in series that minimizes the long-run average sojourn time per customer. We gain additional insight into this queueing design problem, and congestion in non-Markov open queueing networks more generally, by performing simulations for", } @INPROCEEDINGS{Tidb90:Analytiska, AUTHOR="S.-E. Tidblom", TITLE="Analytiska spärrberäkningar för gruppväljaren i {AXE}", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", PAGES="II.3.1-17", YEAR=1990, LANGUAGE="Norwegian", KEYWORDS="Blocking", ABSTRACT="Huvuduppgiften för en växel är att länka samman en abonnent med en annan. Den anhet som svarar för detta kallas gruppväljaren. Dess teknik är avancerad men principen är ändå förhållandevis ankel. Det handlar om att organisera flödet av tidluckor så att abonnenterna kan kommunicera med varandra - gruppväljaren är ett system för hantering av tidluckor.", } @INCOLLECTION{Tijm90:Good, AUTHOR="H. Tijms", TITLE="Good Probabilistic Ideas are often Simple", BOOKTITLE="Twenty-Five years of Operations Research in the Netherlands: papers dedicated to Gijs de Leve", SERIES="CWI Tract", PUBLISHER="Centrum voor Wiskunde en Informatik", NUMBER=70, PAGES="127-141", YEAR=1990, KEYWORDS="overflow; inventory system", ABSTRACT="The applied fields of inventory and queueing lies at the heart of stochastic operations research. this paper deals with two typical problems from these fields and shows how they can be solved by using simple probabilistic methods.", } @ARTICLE{Tosi90:Multiple, AUTHOR="P. Tosirisuk and J. Chandra", TITLE="Multiple Finite Source Queueing Model with Dynamic Priority Scheduling", JOURNAL=navres, VOLUME=37, PAGES="365-381", YEAR=1990, KEYWORDS="machine-repair-man model; Palm", ABSTRACT="This article involves the study of a multiple finite source queueing model with a single server and dynamic, nonpreemptive priority service discipline. The input to the queue is comprised of customers from multiple finite sources. The time which the customer spend at the corresponding sources are exponentially distributed. The service of the customers can follow exponential, Erlang, or hyperexponential probability", } @ARTICLE{Dijk90:Simple, AUTHOR="N. van Dijk", TITLE="On a Simple Proof of Uniformization for Continuous and Discrete-State Continuous-Time Markov Chains", JOURNAL=aap, VOLUME=22, PAGES="749-750", YEAR=1990, KEYWORDS="Queueing theory; Markov chain", } @INPROCEEDINGS{Veir90:Generalized, AUTHOR="B. Veir", TITLE="Generalized Karlsson Measurements for {ATM-Networks}", BOOKTITLE="NTS 9", ADDRESS="Kjeller, Norway", YEAR=1990, KEYWORDS="ATM; traffic measurement", ABSTRACT="The paper first sets the context in which the generalized Karlsson measurements should be seen and then continues with a statement of the requirements to the method. Then a brief review of the procedure is given with a new proof and through an example the limitations in the proof are elucidated. Finally some source models for real coded video data are evaluated in order to show what kinds of results one can expect", } @TECHREPORT{Vida90:Computerized, AUTHOR="V. V. Vidal", TITLE="Computerized Tools for Decision-Making", INSTITUTION="IMSOR, The Technical University of Denmark", ADDRESS="Lyngby, Denmark", PAGES=19, NOTE="Gulbenkian Lecture on ``Science in the Modern World'', Lisbon, Portugal", YEAR=1990, KEYWORDS="Decision theory", } @MISC{Voro90:Two, AUTHOR="Y. A. Vorontsov", TITLE="Two-Moment Analysis of Queueing Systems and Networks", PAGES=10, NOTE="Private note", YEAR=1990, KEYWORDS="moment approximation; queueing network", ABSTRACT="Two-moment approximation", } @INPROCEEDINGS{Wall90:Beräkning, AUTHOR="B. Wallström", TITLE="Beräkning av transienta förlopp inom belastningsreglering", BOOKTITLE="NTS", ADDRESS="Kjeller, Norway", YEAR=1990, LANGUAGE="Swedish", } @ARTICLE{Wang90:Service, AUTHOR="Irving Y. Wang and T. G. Robertazzi", TITLE="Service Stage Petri Net Models with Product Form Solution", JOURNAL=qs, VOLUME=7, NUMBER=8, PAGES="355-374", YEAR=1990, KEYWORDS="Petri net; stochastic system; product form; multiprocessor; dining philosophers model; protocol; alternating bit protocol", ABSTRACT="A class of service stage Petri net models whose equilibrium probabilities satisfy local balance equations is presented. Examples of their applicability include bus oriented multi-processor interconnections, the classical dining philosophers problem and the alternating bit protocol. The natural topological space for embedding the state transition lattice for this class of SSPN is shown to be a", } @ARTICLE{Wang90:Profit, AUTHOR="K. H. Wang", TITLE="Profit Analysis of the Machine-Repair Problem with a single Server Station Subject to Breakdowns", JOURNAL=jors, VOLUME=41, NUMBER=12, PAGES="1153-1160", YEAR=1990, KEYWORDS="machine-repair-man model; breakdown", ABSTRACT="Machine availability; profit; station breakdown", } @ARTICLE{Will90:Individual, AUTHOR="H. Willie", TITLE="Individual Blocking Probabilities in the Loss System {G1} + ... + {GN/M/1/0}", JOURNAL=qs, VOLUME=6, PAGES="109-112", YEAR=1990, KEYWORDS="blocking; superposition; loss system; stationary process", ABSTRACT="Individual call blocking; Stationary point process; Insensitivity.", } @ARTICLE{Xie90:Markov, AUTHOR="M. Xie", TITLE="A Markov Process Model for Software Reliability Analysis", JOURNAL="Applied Stochastic Models and Data Analysis", VOLUME=6, PAGES="207-213", YEAR=1990, KEYWORDS="software; reliability; stochastic system; Markov process; maximum likelihood estimation", ABSTRACT="Software reliability", } @ARTICLE{Yama9003:Invariance, AUTHOR="G. Yamazaki", TITLE="Invariance Relations in Single Server Queues with {LCFS} Service Discipline", JOURNAL="Annals Institute Statistical Mathematics", VOLUME=42, NUMBER=3, PAGES="475-488", YEAR=1990, KEYWORDS="Queueing system; single server; LIFO", } @ARTICLE{Zhan90:Analytical, AUTHOR="Z. Zhang", TITLE="Analytical Results for Waiting Time and System Size Distribution in Two Parallel Queueing Systems", JOURNAL=siapp, VOLUME=50, NUMBER=4, PAGES="1176-1193", YEAR=1990, KEYWORDS="waiting time; response time; parallel queue", ABSTRACT="Response time and system size Process", } @ARTICLE{Zhua90:Mean, AUTHOR="L. Zhuang and K. S. Hindi", TITLE="Mean Value analysis for Multiclass Closed Queueing Network Models of Flexible Manufacturing Systems with Limited Buffers", JOURNAL=ejor, VOLUME=46, PAGES="366-379", YEAR=1990, KEYWORDS="closed queueing network; performance evaluation; product form", ABSTRACT="FMS", } @BOOK{Hert90:Nachrichtentechnik, AUTHOR="E. Herter and W. Lörcher", TITLE="nte", ISBN="3-446-15964-9", PUBLISHER="Carl Hanser Verlag", ADDRESS="München, Germany", VOLUME="5. Aufl.", PAGES=430, YEAR=1990, LANGUAGE="German", REFERENCES=400, KEYWORDS="Communication; switching; transmission; control; network; ISDN; modulation theory; coding theory; information theory; traffic theory", ABSTRACT="Das Buch gibt einen Überblick über das Gebiet der Nachrichtentechnik unter besonderer Betonung der Nachrichtennetze. Ein kurzer Abschnitt (ca. 12 Seiten) behandelt die Grundlagen der Nachrichtenverkehrstheorie.", } @BOOK{Sieg90:Grundlagen, AUTHOR="G. Siegmund", TITLE="Grundlagen der Vermittlungstechnik", PUBLISHER="Alcatel SEL", ADDRESS="Stuttgart, Germany", VOLUME="3. Ausg.", YEAR=1990, LANGUAGE="German", REFERENCES=15, KEYWORDS="Switching network; traffic theory; circuit switching; DATEX-L; DATEX-P; ISDN; signalling; D-channel; CCS; B-ISDN; ATM; packet switching", ABSTRACT="Das Buch enthält eine allgemeine Einführung in die Vermittlungstechnik mit einem kleinen Anteil (6 Seiten) Verkehrstheorie sowieeiner ausf hrlicheren Darstellung des ISDN. (O)", } @BOOK{Wosc90:Informationstechnik, AUTHOR="E.-G. Woschni", TITLE="Informationstechnik", ISBN="3-341-00838-1", PUBLISHER="Verlag Technik", ADDRESS="Berlin, Germany", VOLUME="4. Aufl.", PAGES=391, YEAR=1990, LANGUAGE="German", REFERENCES=100, KEYWORDS="Theory; survey; electrotechnics; information theory; coding theory; modulation theory", ABSTRACT="Theoretische Nachrichtentechnik: Signal, System, Information, Codierung , Modulation (O: IfN-BM: 93.8.35196.002)", } @ARTICLE{Key9010:Distributed, AUTHOR="P. B. Key and Graham Cope", TITLE="Distributed Dynamic Routing Schemes", JOURNAL=ieeecm, VOLUME=28, NUMBER=10, PAGES="54-64", YEAR=1990, REFERENCES=25, KEYWORDS="Distributed Routing; Dynamic Routing", ABSTRACT="Dynamic routing in a circuit-switched network is a way of providing flexibility at the switched level. Flexibility is required to adapt to changing and volatile traffic demands; to cope with forecasting uncertainties, shifts in traffic patterns, and the introduction of new services; and to provide resilience against individual network failures. In other words, dynamc routing, by allowing the path a call takes through the network to vary with time.", } @ARTICLE{Ash9010:Control, AUTHOR="G. R. Ash", TITLE="Design and Control of Networks with Dynamic Nonhierarchical Routing", JOURNAL=ieeecm, VOLUME=28, NUMBER=10, PAGES="34-40", YEAR=1990, REFERENCES=12, KEYWORDS="Design; Control; Dynamic Routing", ABSTRACT="This article illustrates the dramatically improved performance of Dynamic Nonhierarchical Routing (DNHR) networks with examples from operational experience. The authors conclude that DNHR has laid the foundation for a significant quality advance by dramatically improving network service and robustness, particularly in responding to abnormal traffic and failure conditions, and speculate that dynamic routing will grow significantly in sophisticat", } @ARTICLE{Regn9010:State, AUTHOR="J. Regnier and W. H. Cameron", TITLE="State-Dependent Dynamic Traffic Management for Telephone Networks", JOURNAL=ieeecm, VOLUME=28, NUMBER=10, PAGES="42-53", YEAR=1990, REFERENCES=19, KEYWORDS="Network; Network Management; Dynamic Routing", ABSTRACT="This article first presents a description of Dynamic Traffic Management (DTM). It then reviews the main design considerations which have led to the system's being designed as it is. Finally, it provides a quantitative overview of the benefits the system has ben shown to provide in typical (Canadian) networks.", } @ARTICLE{Wolf9010:Advanced, AUTHOR="R. W. Wolf", TITLE="Advanced Techniques For Managing Telecommunications Networks", JOURNAL=ieeecm, VOLUME=28, NUMBER=10, PAGES="76-81", YEAR=1990, REFERENCES=11, KEYWORDS="Network; Network Management", ABSTRACT="The article describes the advanced techniques presently by AT\&T to manage traffic flow in its Worldwide Intelligent Network.", } @ARTICLE{Chem9010:Dynamically, AUTHOR="Prosper Chemouil and J. Filipiak and P. Gauthier", TITLE="Performance Issues in the Design of Dynamically Controlled Circuit-Switched Networks", JOURNAL=ieeecm, VOLUME=28, NUMBER=10, PAGES="90-95", YEAR=1990, REFERENCES=43, KEYWORDS="Design; Circuit Switching; Network; Dynamic Routing", ABSTRACT="The article analyzes the evolution of circuit-switched networks with respect to the functional innovations that allowed for new traffic controls. Then it is considered the technical alternatives for routing techniques and their integration with congestion and flow control.", } @BOOK{Albe90:Netze, AUTHOR="A. Albensöder", TITLE="Netze und Dienste der Deutschen Bundespost {TELEKOM}", PUBLISHER="TTK R. v. Decker", ADDRESS="Germany", YEAR=1990, LANGUAGE="German", KEYWORDS="Isdn; telephony", } @INPROCEEDINGS{Alt90:Deterministic, AUTHOR="H. Alt and T. Hagerup and K. Mehlhorn and F. P. Preaparata", TITLE="Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones", BOOKTITLE=iss, ADDRESS="Stockholm, Sweden", PAGES=28, YEAR=1990, REFERENCES=12, KEYWORDS="Distributed simulation; parallel computing", ABSTRACT="We describe a deterministic simulation of PRAMs on module parallel computers (MPCs) and on processor networks of bounded degree. The simulating machines have the same number n of processors as the simulated PRAM, and if the size of the PRAM's shared memory is the polynomial in n, each PRAM step is simulated by O(log n) MPC steps. ... As an important part of the simulation, we use a new technique for dynamically averaging out a given work load.", } @INCOLLECTION{Apel90:Techniques, AUTHOR="J. Apel and F. Ferrero and L. Grossi and J. E. Hansen", TITLE="Implementation techniques for {LION} (Local Integrated Optical Network)", BOOKTITLE="High Speed Local Area Networks II", PUBLISHER="Elsevier, Science Publishers B.V. (North-Holland)", ADDRESS="Netherlands", PAGES="207-221", YEAR=1990, REFERENCES=15, KEYWORDS="Hslan; implementation; optical lan", ABSTRACT="The paper outlines objectives and results so far achieved for the Esprit Project 169 aiming at the conception and prototype development of a local integrated optical network (LION) with a transmission rate of 140 and, in a second stage, 565 Mbit/s. Emphasis is given upon the basic system and network concepts adopted to meet the global requirements stated in the definition phase ofthe project.", } @INPROCEEDINGS{Bowe90:Scalable, AUTHOR="T. F. Bowen and G. Gopal and G. Herman", TITLE="A Scalable Database Architecture for Network Services", BOOKTITLE=iss, ADDRESS="Stockholm, Sweden", VOLUME="V-45-5", PAGES="B7.3", YEAR=1990, REFERENCES=15, KEYWORDS="Architecture; broadband; broadcast; database; intelligent network", ABSTRACT="propose a novel alternative: the Datacycle architecture. By employing high bandwidth fiber optic channels to distribute database contents past processing elements in the network, the Datacycle approach both supports a general, highly functional interface to the contents of the database and scales to support very high transaction volumes.", } @PROCEEDINGS{Dall90:LAN, TITLE="Issues in {LAN} Management, {II:} Proceedings of the {IFIP} {TC6/WG6,} 4a International Symposium on the Management of Local Communications Systems", EDITOR="I. N. Dallas and E. B. Spratt and J.-P. Cabanel", ISBN="0-444-88918-3", PUBLISHER="IFIP, North-Holland", ADDRESS="Amsterdam, Netherlands", YEAR=1990, REFERENCES=6, KEYWORDS="Conference report; distributed system; LAN; network management", } @INPROCEEDINGS{Maxe90:Problems, AUTHOR="N. F. Maxemchuk", TITLE="Problems Arising from Deflection Routing: Live-lock, Lockout, Congestion and Message Reassembly", BOOKTITLE="NATO advanced research workshop Architecture and performance issues of high capacity LANs and MANs", ADDRESS="Italy", YEAR=1990, KEYWORDS="Distributed routing; routing; routing algorithm", ABSTRACT="Deflection routing (in slotted metropolitan area networks): when there are no buffers available in a node, packets of data are forced to take longer paths through the network. This technique uses only local information at a node. Problems: live-lock (packets are transmitted continuously, but never reach their destination); source lock-out (sources occupy all empty slots); congestion (increased use of network resources by deflection routing lea", } @ARTICLE{Siet90:Comeback, AUTHOR="R. Sietmann", TITLE="Comeback der Leitungsvermittlung?", JOURNAL="Funkschau", ADDRESS="Germany", VOLUME=13, PAGES="54-57", YEAR=1990, LANGUAGE="German", KEYWORDS="Circuit switching; wdm", } @PHDTHESIS{Valt90:Entwicklung, AUTHOR="R. Valta", TITLE="Entwicklung einer Methodik zur Beschreibung von offenen Rechnernetzen als Grundlage für integriertes betreiberorientiertes Netzmanagement", SCHOOL="TU München, Informatik", ADDRESS="München, Germany", YEAR=1990, LANGUAGE="German", REFERENCES=99, KEYWORDS="Network management; open system", } @INPROCEEDINGS{Munt90:Disk, AUTHOR="R. R. Muntz and J. C.S. Lui", TITLE="Performance Analysis of Disk Arrays Under Failure", BOOKTITLE="VLDB Conference", PAGES="162-173", YEAR=1990, } @INPROCEEDINGS{Ston90:Distributed, AUTHOR="Michael Stonebraker and G. A. Schloss", TITLE="Distributed {RAID} - A New Multiple Copy Algorithm", BOOKTITLE="6th International Conference on Data Engineering", PAGES="430-437", YEAR=1990, } @INPROCEEDINGS{Gray90:Parity, AUTHOR="J. P. Gray and Bob Horst and M. J. Walker", TITLE="Parity Striping of Disk Arrays: Low-Cost Reliable Storage with Acceptable Throughput", BOOKTITLE="VLDB Conference", PAGES="148-172", YEAR=1990, } @INPROCEEDINGS{Hsia90:Chained, AUTHOR="H. Hsiao and D. DeWitt", TITLE="Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines", BOOKTITLE="Data Engineering", PAGES="456-465", YEAR=1990, } @INPROCEEDINGS{Ghan90:Hybrid, AUTHOR="S. Ghandeharizadeh and D. DeWitt", TITLE="Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines", BOOKTITLE="VLDB", PAGES="481-492", YEAR=1990, } @MISC{Hans90:Efficient, AUTHOR="Michael J. Hanson", TITLE="Efficient reading of papers in science and technology", PAGES=2, YEAR=1990, KEYWORDS="reading; summarization", ABSTRACT="This brochure is intended to help you read scientific papers and get more out of them. It provides an effective approach to reading such papers.", } @BOOK{Corm90:Introduction, AUTHOR="Thomas Cormen and Charles Leiserson and Ronald L. Rivest", TITLE="Introduction to Algorithms", ISBN="0-07-013143-0", PUBLISHER="McGraw-Hill", ADDRESS="New York", YEAR=1990, KEYWORDS="algorithms; theory; sorting; data structures; graphs", } @ARTICLE{Ofek9006:Flow, AUTHOR="Y. Ofek", TITLE="Flow Control and Dead-lock Avoidance on the Partial Hypergraph", JOURNAL=comcom, VOLUME=13, NUMBER=5, PAGES="283-289", MONTH="Jun", YEAR=1990, ABSTRACT="The optical hypergraph is a distributed network in which each edge of the hypergraph is a multiple-access broadcast medium constructed as a passive optical star coupler. The partial optical hypergraph can be also viewed as a centralized switching network. The nodes with two ports (switch nodes) are centered in one location, and the nodes with one port (external nodes) are distributed within an area of 0-20 kilometers around the switching nodes. The main result of this work is a flow control protocol for an arbitrary traffic pattern, which includes algorithms for preventing overflows, while maintaining the maximum switching capability of the switch nodes. Overflow prevention may cause dead-locks, so an algorithm for avoiding dead-locks is shown. These algorithms are realized at the network interface and therefore, can operate in real-time at a traffic rate of over a gigabit/sec per link. This network architecture demonstrates a close relationship between centralized and distributed systems. Potential applications of the partial optical hypergraph are varied and include large distributed databases, metropolitan area networks, factory automation, fault tolerant and real-time networks.", } @TECHREPORT{Ofek90:Integration, AUTHOR="Y. Ofek", TITLE="Integration of Multi-ring on the MetaRing Architecture", TYPE="Research Report", INSTITUTION="IBM", NUMBER=16058, YEAR=1990, ABSTRACT="The MetaRing architecture is a full-duplex ring with fairness and spatial bandwidth reuse. Concurrent access and spatial reuse enable the simultaneous transmissions over disjoint segments of a bi-directional ring, and therefore, can increase the effective throughput, in each direction, by a factor of four or more. The fairness mechanism for this architecture is distributed; based on a control signal that regulates the access to the ring, and is extremely simple and robust. The efficiency of this architecture does not degrade as the bandwidth and physical size of the system increases. In this work we describe the principles for constructing a single MetaRing system that is composed of multiple rings. The motivation for such a structure is to increase the spatial reuse and to enhance the fault tolerance of the system. Each ring in this structure can be viewed as a cluster of users with relatively higher internal interaction than external interaction with users in other clusters.", } @ARTICLE{Sale90:System, AUTHOR="K. Salem and H. Garcia-Molina", TITLE="System {M:} A Transaction Processing Testbed for Memory Resident Data", JOURNAL=ieeekde, VOLUME=2, PAGES="161-172", YEAR=1990, } @ARTICLE{Whan9001:Query, AUTHOR="K.-Y. Whang and R. Krishnamurthy", TITLE="Query Optimization in a Memory-Resident Domain Relational Calculus System", JOURNAL=tods, VOLUME=15, NUMBER=1, PAGES="67-95", YEAR=1990, } @ARTICLE{Verm9009:Novel, AUTHOR="Mahendra K. Verma and Dimitrios P. Prezas and Stuart Russell and M. H. Sherif and Reed Thorkildsen", TITLE="Novel Applications of Speech Processing in {AT\&T} Network Systems Products", JOURNAL=atttj, VOLUME=69, NUMBER=5, PAGES="77-86", MONTH="September/October", YEAR=1990, KEYWORDS="packet voice; speech coding; speech recognition", ABSTRACT="In this paper, we discuss speech processing applications in the integrated access and cross-connect system, digital cellular telephone system, operator services position system, and intelligent networks. These applications are used to show how the AT\\&T Network Systems product line allows telephone companies and business customers to implement solutions based on end-user characteristics, expectations, and requirements.", ANNOTE="Wideband packet network IACS classifies traffic into voice, voiceband data and data, with support for G.721/G.723 ADPCM and G.727 embedded ADPCM. Compares speech coder complexity in MIPS. Also describes speech recognition for operator assistance.", } @TECHREPORT{Tele90:Technologies, AUTHOR="Televerket", TITLE="Technologies for the Future: A Report on Televerket's {R\&D} Activities", INSTITUTION="Televerket", YEAR=1990, } @ARTICLE{Deer90:Indexing, AUTHOR="S. Deerwester and Susan Dumais and G. Furnas and T. Landauer and R. Harshman", TITLE="Indexing by Latent Semantic Analysis", JOURNAL="Journal of the American Society for Information Science", VOLUME=41, YEAR=1990, LANGUAGE="English", } @PROCEEDINGS{Hrip90:Arden, AUTHOR="George Hripcsak and Paul D. Clayton and T. Allan Pryor and Peter Haug", TITLE="The Arden Syntax for Medical Logic Modules", ORGANIZATION="Proc Annual Symposium on Computer Applications in Medical Care", YEAR=1990, LANGUAGE="English", ABSTRACT="The Arden Syntax for sharing medical knowledge bases is described. Its current focus is on knowledge that is represented as a set of independent modules that can provide therapeutic suggestions, alerts, diagnosis scores, etc. The syntax is based largely upon HELP and the Regenstrief Medical Record System. Each module, called a Medical Logic Module or MLM, is made of slots grouped into maintenance, library, and knowledge categories. The syntax has provisions for querying a clinical database and representing time. Several clinical information systems were analyzed and appear to be compatible with the syntax. The syntax has been tested for syntactic ambiguities using the tools lex and yacc. Four institutions are currently in the process of adopting the Arden Syntax for their decision-support systems.", } @INPROCEEDINGS{Hager:caco, AUTHOR="Erik Hagersten and Seif Haridi and David Warren", TITLE="The Cache-Coherence Protocol of the Data Diffusion Machine", BOOKTITLE="Cache and Interconnect Workshop", YEAR=1990, } @ARTICLE{DeMo9001:Message, AUTHOR="L. F. Moraes", TITLE="Message delay analysis for a {TDMA} scheme operating under a preemptive priority discipline", JOURNAL=ieeecom, VOLUME=38, NUMBER=1, PAGES="67-73", MONTH=jan, YEAR=1990, KEYWORDS="discrete time queue", ABSTRACT="A TDMA (time-division multiple-access) access-control scheme operating under a preemptive message-based priority discipline is considered and analyzed. The system considered is general, so that an arbitrary number of slots can be allocated to different stations, on a uniformly (equally) spaced basis, in each frame. Under the assumptions of a Poisson message arrival stream and random message lengths governed by a general distribution, it is shown how the Laplace-Stieltjes transform of the actual message waiting time and the delay distributions can easily be obtained, for each priority class, at each of the network stations. Using these results, explicit formulas for any moment of the message delay for any priority class can be obtained. In particular, e pressions for the first two moments of the message waiting time and for the average delay of class-$k$ messages are derived.", } @ARTICLE{Bier9001:Annotated, AUTHOR="Ernst Biersack", TITLE="Annotated Bibliography on Network Interconnection", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="22-41", MONTH=jan, YEAR=1990, KEYWORDS="BISDN; routing; naming; bibliography", ABSTRACT="This annotated bibliography covers the various aspects of network interconnection. It contains a list of papers dealing with interconnection at different layers of the ISO OSI reference model and covers topics such as interconnection among various types of networks, backbone networks, standardization efforts, interconnection techniques, formal approaches, network management, protocol issues, addressing and naming, routing, performance evaluation, gateway implementations, and existing products.", } @ARTICLE{Chan9001:Integration, AUTHOR="C. J. Chang and XiuLi Chao and M. Pinedo", TITLE="Integration of Discrete-Time Correlated Markov Processes in a {TDM} System", JOURNAL="Probability in the Engineering and Informational Sciences", VOLUME=4, NUMBER=1, PAGES="29-56", MONTH=jan, YEAR=1990, KEYWORDS="packet voice; integrated services", ABSTRACT="In this paper, we consider a discrete-time queueing model for a Time Division Multiplexing (TDM) system with integration of voice and data (a model introduced by Li and Mark). The voice traffic is a superposition of $N$ Markov chains, which alternate between two states: the talkspurt state and the silence state. The data traffic is Poisson and independent of the voice sources. We show that the average queue size is increasing in certain correlation coefficients of the voice sources, increasing convex in the number of voice sources, and increasing convex in the data traffic intensity. However, it is decreasing convex in the number of channels. These structural results yield various bounds. To take video traffic into account as well, we adapt a model of Maglaris et al. In their model, video traffic is generated by a continuous-state autoregressive Markov process that matches the average rate and the autocovariance of the output of a video coder. We show that if we replace their autoregressive model by a two-state Markov chain model with the same rate and correlation coefficient, we obtain an upper bound for the queue size. This replacement enables us to treat the video traffic as a voice source and use the techniques developed for dealing with voice/data integration to obtain bounds and estimates.", } @ARTICLE{Chla9001:Rationale, AUTHOR="I. Chlamtac and William R. Franta", TITLE="Rationale, Directions, and Issues Surrounding High Speed Networks", JOURNAL=ieeeproc, VOLUME=78, NUMBER=1, PAGES="94-120", MONTH=jan, YEAR=1990, KEYWORDS="BISDN; high-speed networks", } @TECHREPORT{Doer9001:Light, AUTHOR="Willibald Doeringer and Doug Dykeman and Matthias Kaiserswerth and Bernd Meister and Harry Rudin and R. Williamson", TITLE="A Survey of Light-Weight Transport Protocols for High-Speed Networks", TYPE="Technical Report", INSTITUTION="IBM Research Division, Zürich Research Laboratory", ADDRESS="Rüschlikon, Switzerland", MONTH=jan, YEAR=1990, KEYWORDS="transport protocol", } @UNPUBLISHED{Ferr9001:Study, AUTHOR="Josep M. Ferrandiz and Aurel A. Lazar", TITLE="A Study of Loss in {$N/GI/1$} Queueing Systems", NOTE="Department of Electrical Engineering and Center for Telecommunications Research, Columbia University, New York, New York", MONTH=jan, YEAR=1990, KEYWORDS="queueing theory", ANNOTE="Superposition of two $N$-processes. Probability of having $n$ class 2 arrivals between two class 1 arrivals is of matrix geometric form. Closed forms for packet loss probability and conditional probability of consecutive blocking for one of the classes.", } @UNPUBLISHED{Ferr9001:Time, AUTHOR="Josep M. Ferrandiz and Aurel A. Lazar", TITLE="Time Changes in Markov Chains", NOTE="Department of Electrical Engineering and Center for Telecommunications Research, Columbia University, New York, New York", MONTH=jan, YEAR=1990, KEYWORDS="queueing theory", } @ARTICLE{Maxe9001:Routing, AUTHOR="N. F. Maxemchuk and Magda El Zarki", TITLE="Routing and Flow Control in High-Speed Wide-Area Networks", JOURNAL=ieeeproc, VOLUME=78, NUMBER=1, PAGES="204-221", MONTH=jan, YEAR=1990, KEYWORDS="congestion control", } @ARTICLE{Part9001:Slow, AUTHOR="C. Partridge", TITLE="How Slow is One Gigabit Per Second?", JOURNAL=ccr, VOLUME=20, NUMBER=1, PAGES="44-53", MONTH=jan, YEAR=1990, REFERENCES=5, KEYWORDS="BISDN; high-speed networking", ABSTRACT="At first blush, one would expect that increasing data network transfer rates by two orders of magnitude (from the ubiquitous 10 Mbit speed of today's LANs to the greater than 1 gigabit-per-second speeds we expect of networks in the early 1990's) would severely impact our choice of network protocols and architectures. This report presents the strawman argument that, in fact, moving to one-gigabit data rates presents surprisingly few problems.", } @ARTICLE{Robi9001:Congestion, AUTHOR="J. T. Robinson", TITLE="Congestion Control in {BBN} Packet-Switched Networks", JOURNAL=ccr, VOLUME=20, NUMBER=1, PAGES="76-90", MONTH=jan, YEAR=1990, REFERENCES=12, KEYWORDS="congestion control", ANNOTE="Explains disadvantages of window-based and discarding-based flow control for traffic with retransmissions. Algorithm allocates link and CPU utilization over period $T$ for each end-to-end (packet switch) connection and throttles streams with leaky bucket scheme. The source obtains a resource ration as the minimum of all resource rations along the path.", URL="http://www.acm.org/sigcomm/ccr/archive/1990/jan90/robinson.ps", } @ARTICLE{Toba9001:Fast, AUTHOR="F. A. Tobagi", TITLE="Fast Packet Switch Architectures for Broadband Integrated Services Digital Networks", JOURNAL=ieeeproc, VOLUME=78, NUMBER=1, PAGES="133-167", MONTH=jan, YEAR=1990, REFERENCES=36, KEYWORDS="ATM; switching network; interconnection network; Banyan; fast packet switching; survey; ISDN", ANNOTE="Overview of published sb architectures", } @ARTICLE{Deme9001:Analysis, AUTHOR="Alan Demers and S. Keshav and S. Shenker", TITLE="Analysis and simulation of a fair queueing algorithm", JOURNAL=internet, VOLUME=1, NUMBER=1, PAGES="3-26", MONTH=jan, YEAR=1990, KEYWORDS="congestion control; flow control; queueing algorithms; fair queueing", ABSTRACT="We discuss gateway queueing algorithms and their role in controlling congestion in datagram networks. A fair queueing algorithm, based on an earlier suggestion by Nagle, is proposed. Analysis and simulations are used to compare this algorithm to other congestion control schemes. We find that fair queueing provides several important advantages over the usual first-come-first-served queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth, and protection from ill-behaved sources.", } @TECHREPORT{Goli9001:Approximate, AUTHOR="Praveen Goli and James F. Kurose and Donald F. Towsley", TITLE="Approximate minimum laxity scheduling algorithms for real-time systems", TYPE="Technical Report", INSTITUTION="Department of Computer and Information Sciences, University of Massachusetts", ADDRESS="Amherst, Massachusetts", NUMBER="TR 90-88", MONTH=jan, YEAR=1990, KEYWORDS="minimum laxity; FIFO; scheduling", ABSTRACT="Minimum laxity (ML) scheduling is a well-known policy for determining the order in which jobs are permitted to access a resource in a soft-real system. In such systems, a job must either begin or complete service (depending on the type of time constraint) within some specified amount of time after its arrival to the system or be lost. Previously-developed queueing theoretic models have shown that ML scheduling is optimal for a large class of queueing systems in the sense of minimizing the fraction of jobs that are lost (and hence not served) due to exceeding their time constraints. One possible drawback of ML scheduling is that the identity of the job with the closest deadline (minimum laxity) must be determined at the scheduling point -- a potentially expensive run-time cost, especially when the number of queued jobs is large. In this paper we present four scheduling disciplines that approximate the behavior of ML scheduling and enjoy the advantage of having a run-time cost which is independent of the number of queued customers. Simulation results show that the best of these scheduling algorithms performs to within 5\% of ML over a wide range of traffic loads and deadline distributions.", URL="ftp://ftp.cs.umass.edu/pub/", } @ARTICLE{Kita9001:Speech, AUTHOR="Nobuhiko Kitawaki and Hiromi Nagabuchi and Masahiro Taka and Kenzo Takahashi", TITLE="Speech coding technology for {ATM} networks", JOURNAL=ieeecm, VOLUME=28, NUMBER=1, PAGES="21-27", MONTH=jan, YEAR=1990, LANGUAGE="English", KEYWORDS="speech coding; ATM; packet voice; integrated voice-data networks; compression; ADPCM (adaptive pulse code modulation); LSB dropping; quality assessment", ABSTRACT="Speech coding for ATM networks.", } @UNPUBLISHED{Awer9001:Communication, AUTHOR="B. Awerbuch and I. Cidon and S. Kutten", TITLE="Communication optimal maintenance of dynamic trees", NOTE="Labororatory for Computer Science, MIT and IBM Watson Research Center", MONTH=jan, YEAR=1990, KEYWORDS="communications protocols; static networks; dynamic networks; adaptive protocols; complexity; causality; routing; spanning tree", ABSTRACT="In this paper, we show that keeping track of history enables significant improvements in communication complexity of dynamic spanning protocols. Namely, we reduce the communication complexity from $\Theta(F)$ to $\Theta(V)$, thus achieving the lower bound. Our improvement in communication comes on the expense of slight increase in time, from $\Theta(V)$ to $\Theta(V \log V)$. Our work does not use unbounded counters. This proves, for the first time, that amortized communication complexity, i.e., incremental cost of adapting to a single topological change, can be smaller than the communication complexity of solving the problem from scratch. Our results can be used to reduce the complexity of other tasks such as: general compiler translating protocols for static networks to work in an environment of changing topology, maintaining distributed databases, fast hardware broadcasting in the new-generation networks, etc.", } @INPROCEEDINGS{Bell9001:Pseudo, AUTHOR="S. M. Bellovin", TITLE="Pseudo-network drivers and virtual networks", BOOKTITLE=usenixw, ORGANIZATION="Usenix", ADDRESS="Washington, D.C.", PAGES="229-244", MONTH=jan, YEAR=1990, KEYWORDS="API; sockets; pseudo-terminal; operating systems; network programming interfaces; security; authentication", ABSTRACT="Many operating systems have long had pseudo-teletypes, inter-process communication channels that provide terminal semantics on one end, and a smart server on the other. We describe an analogous concept, pseudo-network drivers. One end of the driver appears to be a real network device, with the appropriate interface and semantics; data written to it goes to a program, however, rather than to a physical medium. Using this and some auxiliary mechanisms, we present a variety of applications, including system test, network monitoring, dial-up TCP/IP, and ways to both improve and subvert network security. Most notably, we show how pseudo-network devices can be used to create virtual networks and to provide encrypted communication capability. We describe two implementations, one using a conventional driver for socket-based systems, and one using stream pipes for System V.", } @INPROCEEDINGS{Vess9001:Implementing, AUTHOR="Ian Vessey and G. Skinner", TITLE="Implementing Berkeley sockets in System V Release 4", BOOKTITLE=usenixw, ORGANIZATION="Usenix", ADDRESS="Washington, D.C.", PAGES="177-193", MONTH=jan, YEAR=1990, KEYWORDS="API; sockets; operating systems; network programming interfaces; System V; TLI; streams; SVR4; protocol implementation", ABSTRACT="A major goal of the UNIX System V, Release 4 (SVR4) development effort has been to unify divergent lines of UNIX development into a single system offering the best features of its progenitors. A closely related goal has been to augment the programming interface to ``capture'' applications written for other UNIX variants, by making the facilities they depend on available in the unified system. The socket interface is a cornerstone of the 4BSD networking facilities, so its presence in SVR4 is an absolute necessity for application capture. This paper describes the design of the SVR4 socket implementation, the implementation problems we encountered, and their solutions.", } @INPROCEEDINGS{Heim9001:Traffic, AUTHOR="Steven A. Heimlich", TITLE="Traffic characterization of the {NSFNET} national backbone", BOOKTITLE=usenixw, ORGANIZATION="Usenix", ADDRESS="Washington, D.C.", PAGES="207-227", MONTH=jan, YEAR=1990, KEYWORDS="traffic measurements; Internet; NSFNET; TCP; UDP; traffic characterization; packet train: Poisson arrivals; cache hit ratio", ABSTRACT="Traditionally, models of packet arrival in communication networks have assumed Poisson arrival patterns. An earlier study of a local area network at MIT found that traffic followed a more general model, called the ``packet train''. This study verifies the existence of packet trains on the NSFNET national backbone network. Packet train characteristics are categorized by application and transport protocols, network topology (traffic which is local to the monitored node's regional network or in transit), and level of utilization. The strength of the model is shown to be related both to utilization and to protocol. Performance of protocol implementations may be improved by taking advantage of packet trains, performing per train rather than per packet processing. In addition, route prefetching based on the existence of packet trains is shown to be more effective than caching destination addresses alone.", ANNOTE="T1 NSFNET with PC RT nodes and 1 ms clock; TCP and UDP; overall, interarrival time is roughly exponential", } @INPROCEEDINGS{Lein9001:Two, AUTHOR="Allan Leinwand and Jeff Okamoto", TITLE="Two network management tools (how many packets would a packet router route if a packet router could route packets?)", BOOKTITLE=usenixw, ORGANIZATION="Usenix", ADDRESS="Washington, D.C.", PAGES="195-205", MONTH=jan, YEAR=1990, KEYWORDS="network management; user interfaces", ABSTRACT="In 1986, the Hewlett Packard Company (HP) installed its own TCP/IP network, called the HP NET Internet. As of this writing, the number of systems nears 20,000, linked by over 200 cisco system routers (specifically cisco Systems Advanced Gateway Servers). The HP NET Internet encompasses the continental United States, England, France, West Germany, Switzerland, Japan, Australia, Singapore, and other locations in the Far East, Latin America and Canada. Approximately 150 -- 180 Gigabytes of data per month is transferred via the HP NET Internet.", } @ARTICLE{Jaco9001:Fast, AUTHOR="Andrew R. Jacob", TITLE="A survey of fast packet switches", JOURNAL=ccr, VOLUME=20, NUMBER=1, PAGES="54-64", MONTH=jan, YEAR=1990, REFERENCES=9, KEYWORDS="Fast packet switching; ATM; switching network; performance", ABSTRACT="With the advent of optical fiber and its large bandwidth, many services, such as packetized data, voice, and video, are now becoming available on physical transmission lines. The high data rates, however, have created a demand for high speed switching. Included among the different strategies which have been proposed are fully- and non-fully-connected switches, intelligent and non-intelligent switching nodes, broadcast capability, input and output queueing, input concentration and output reentry, and path preallocation. Most switches have a modular design. This paper compares the Knockout Switch, a switch designed by Jonathan Turner, a switch designed by Joseph Hui and Edward Arthurs, and the Starlite Switch based on the strategies listed above. Advantages and disadvantages are cited and conclusions have been made about the tradeoffs involved with operating conditions. Finally, future issues affecting fast packet switching are described.", ANNOTE="This paper compares the Knockout-Switch design by Turner, a switch designed by Hui and Arthurs and the Starlite switch.", } @INPROCEEDINGS{Lui9001:Evaluating, AUTHOR="J. C.S. Lui and R. R. Muntz", TITLE="Evaluating Bounds on Steady State Availability of repairable systems from Markov models", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="469-489", MONTH=jan, YEAR=1990, REFERENCES=14, KEYWORDS="Markov chain; analysis; approximation; transition matrix", ABSTRACT="In this paper a method is presented for bounding steady state availability and at the same time, drastically reduce the size of the Markov chains that must be solved. This paper extends a method of analysis, developed in reference [7], to allow piecewise generation of the transition matrix such that at each step the bounds can be incrementally improved.", } @INPROCEEDINGS{Reib9001:Splitting, AUTHOR="Andrew Reibman", TITLE="A splitting technique for Markov chain transient solution", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="396-408", MONTH=jan, YEAR=1990, REFERENCES=15, KEYWORDS="Markov chain; approximation; numerical method; iterative", ANNOTE="In this paper an approximate numerical technique for solving cyclic Markov chains is investigated. The basic approach is to break the Markov chain into two acyclic sub-chains, and iteratively combine their solution. An easily computable error bound allows the accuracy to be bounded before the computation begins.", } @INPROCEEDINGS{Saad9001:Projection, AUTHOR="Y. Saad", TITLE="Projection Methods for the Numerical Solution of Markov Chain Models", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="490-504", MONTH=jan, YEAR=1990, REFERENCES=20, KEYWORDS="Markov chain; approximation; method; iterative method", ANNOTE="This paper gives an overview of projection methods for computingstationary probability distributions for Markov chain models. A general projection method is a method which seeks an approximation from a subspace of small dimension to the original problem. Thus, the original matrix problem of size $N$ is approximated by one of dimension $m$, typically much smaller than $N$. These methodsare effective in solving linear and nonlinear and eigenvalue problems.", } @INPROCEEDINGS{Schw9001:Aggregation, AUTHOR="P. Schweitzer", TITLE="A Survey Of Aggregation-disaggregation in Large Markov Chains", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="53-80", MONTH=jan, YEAR=1990, REFERENCES=78, KEYWORDS="Markov chain; survey", ANNOTE="This paper surveys results since 1984 on aggregation-disaggregation for Markov chains. The topics covered include alternative forms of the aggregate equations; alternative forms of the disaggregation equations; alternative schemes for iterative aggregation-disaggregation; aggregation for generalized birth-and death processes and aggregation for nearly-completely-decomposa-ble systems.", } @INPROCEEDINGS{Sema9001:Computing, AUTHOR="P. Semal and P.-J. Courtois", TITLE="Computing Conditional Distributions of Queueing Network Matrices", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="349-374", MONTH=jan, YEAR=1990, REFERENCES=16, KEYWORDS="Conditional distribution; queueing network; matrix", ANNOTE="This paper addresses the problem of computing conditional steady-state distributions in large Markovian queueing networks. An algebraic framework is introduced to describe and analyze decom-position techniques which yield these distributions. In the second part of the paper, properties of polyhedra of Perron-Frobenius eigenvectors are used to analyze the accuracy of these methods when they are applied to more general queueing networks.", } @INPROCEEDINGS{Wies9001:Markov, AUTHOR="Jeffrey E. Wieselthier and Anthony Ephremides", TITLE="Some Markov chain problems in the evaluation of multiple-access protocols", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="258-282", MONTH=jan, YEAR=1990, REFERENCES=6, KEYWORDS="Markov chain; approximation; performance evaluation", ANNOTE="This paper reviews models for several variants of a class of multiple-access protocols in communication systems, each of which is characterized by an underlying Markov chain of infinitedimension. The performance evaluation of these protocols requires an accurate estimate of the steady-state vectors of these Markov chains. For each case the form of the Markov chains and the computational techniques of truncation and approx. are discussed", } @ARTICLE{Shin9001:Number, AUTHOR="Behrooz Parhami", TITLE="On the Number of Acceptable Task Assignments in Distributed Computing Systems", JOURNAL=ieeetc, VOLUME="C-39", NUMBER=1, PAGES="99-110", MONTH=jan, YEAR=1990, KEYWORDS="Parallel computing; scheduling", ANNOTE="In a distributed computing system, a job is usually decomposed into several cooperating tasks which are then assignet to a set of processors in the system to exploit the inherent parallelism in job execution. The distributed computing system and cooperating tasks can be represented by a processor graph, respectively. And edge between a pair of nodes in represents the existence of direct communications between the two corresponding tasks.", } @ARTICLE{Pinn9001:Provisioning, AUTHOR="E. L. Pinnes", TITLE="Provisioning Services on Digital Switching Systems", JOURNAL=ieeenet, VOLUME=4, NUMBER=1, PAGES="13-17", MONTH=jan, YEAR=1990, REFERENCES=14, } @ARTICLE{Aida9001:Service, AUTHOR="Salah E. Aidarous and Don A. Proudfoot and Xi-Nam Dam", TITLE="Service Management in Intelligent Networks", JOURNAL=ieeenet, VOLUME=4, NUMBER=1, PAGES="18-24", MONTH=jan, YEAR=1990, REFERENCES=8, } @ARTICLE{Yu9001:Customer, AUTHOR="C. Yu", TITLE="Customer Service Provisioning in Intelligent Networks", JOURNAL=ieeenet, VOLUME=4, NUMBER=1, PAGES="25-28", MONTH=jan, YEAR=1990, REFERENCES=2, ABSTRACT="Despite the convenience of using Functional Components (FCs) as service building blocks, service provisioning in the Intelligent Network (IN) still presents major problems. We focus here on issues of responsiveness to customers. When customers are allowed to provision new IN services, we have to consider whether the set of FCs can be directly used by customers without causing problems. Further, we have to consider whether the set of FCs is flexible enough to construct the services customers are likely to want. This artile investigates customer service provisioning problems and flexibility in using the IN FCs. Based on our discussion, we also propose methods to support integrity control for service development. For concreteness, we focus on the set of FCs defined in Bellcore's IN/1+.", } @ARTICLE{Brus9001:Assuring, AUTHOR="Gary Brush and Norman Marlow", TITLE="Assuring the Dependability of Telecommunications Networks and Services", JOURNAL=ieeenet, VOLUME=4, NUMBER=1, PAGES="29-34", MONTH=jan, YEAR=1990, REFERENCES=27, ABSTRACT="A strategic asset of telecommunications service providers in today's marketplace is the dependability of their services. In brief, users will consider a service dependable if it works the way they want it to. As the domestic network has evolved, the dependability of telephone service as we know it is the result of careful planning by network design engineers, equipment vendors, and those responsible for operating and maintaing the network equipment. Recognizing the spiraling growth of new technology and potential for new services, as well as concerns recently expressed about the dependability of the public network, this paper outlines a service dependability management process intended to assure high quality telecommunications service as we move forward with ISDN, the Intelligent Network, Common Channel Signalling, broadband service capabilities, and other new network service concepts. This process shoud be of interest to those designing, deploying, and provisioning future networks.", } @ARTICLE{Civa9001:Self, AUTHOR="Seyhan Civanlar and B. T. Doshi", TITLE="Self-Healing in Wideband Packet Networks", JOURNAL=ieeenet, VOLUME=4, NUMBER=1, PAGES="35-39", MONTH=jan, YEAR=1990, REFERENCES=10, ABSTRACT="With the strategy proposed in this paper, nondisruptive trunk monitoring (self-monitoring) at the data link layer of an Open System Interconnection (OSI) reference model is performed to detect facility failure of under 1s. The Bit Error Rate(BER) on a transmission link is estimated based on the counts of the number of packets with Cyclic Redundancy Check (CRC) errors at the data link layer. This failure detection strategy can respond to link failure for any given traffic mix by the provisioning of duration and level of unacceptable sustained BER.", } @ARTICLE{Wirt9001:Ceres, AUTHOR="Niklaus Wirth", TITLE="Ceres-Net: A Low-cost Computer Network", JOURNAL=spe, VOLUME=20, NUMBER=1, PAGES="13-24", MONTH=jan, YEAR=1990, } @ARTICLE{Mill9001:Internet, AUTHOR="D. L. Mills and Paul Schragger and Michael Davis", TITLE="{Internet} Architecture Workshop: Future of the {Internet} System Architecture and {TCP/IP} Protocols", JOURNAL=ccr, VOLUME=20, NUMBER=1, PAGES="6-17", MONTH=jan, YEAR=1990, KEYWORDS="High-Speed Networking", ABSTRACT="The Internet Architecture Task Force (INARC) is a unit of the Internet Activities Board (IAB), which oversees the research, development and standards of the Internet community and TCP/IP protocol suite. This is a report on the INARC workshop held at the University of Delaware on 1-2 June 1989 at which the future of the Internet and its protocols, as well as their relevance to other protocol communities, was explored and debated.", URL="http://www.acm.org/sigcomm/ccr/archive/1990/jan90/inarc.ps", } @ARTICLE{Paru9001:Generation, AUTHOR="G. M. Parulkar", TITLE="The Next Generation of Internetworking", JOURNAL=ccr, VOLUME=20, NUMBER=1, PAGES="18-43", MONTH=jan, YEAR=1990, REFERENCES=37, KEYWORDS="high-speed networking", ABSTRACT="This paper describes a research effort concerned with the design of the next generation of internet architecture, which has been necessitated by two emerging trends. First, there will be at least a few orders of magnitude increase in data rates of communication networks in the next few years. For example, researchers are already prototyping networks with data rates of up to a few hundred Mbps, and are planning networks with data rates up to a few Gbps. Second, researchers from all disciplines of science, engineering, and humanities plan to use the communication infrastructure to access widely distributed resources in order to solve bigger and more complex problems. These trends provide new challenges and opportunities to researchers in the communication field. One such challenge is the design of what we call the very high speed internet (VHSI) abstraction which can help efficiently support guaranteed levels of performance for a variety of applications, and can cope with ever increasing diversity of underlying networks with rapidly growing user population and needs. Our strategy towards achieving this ambitious goal comprises the following: 1) Design, specification, and prototype implementation of a novel multipoint congram-oriented service that can work well with connection-oriented and datagram high speed networks, can provide variable grade service on a need basis to its applications, and can provide adequate reconfigurability to deal with survivability requirements due to network failures. 2) Design and implementation of gateway architectures that can support data rates of a few hundred Mbps, can interface with diverse networks, and can implement the congram-oriented service without becoming a performance bottleneck. 3) Development of analytical and simulation models to evaluate important tradeoffs associated with the design of a congram-oriented protocol, the resource management on diverse networks, and the design of new gateway architectures.", } @ARTICLE{Mill9001:Accuracy, AUTHOR="D. L. Mills", TITLE="On the Accuracy and Stability of Clocks Synchronized by the Network Time Protocol in the {Internet} System", JOURNAL=ccr, VOLUME=20, NUMBER=1, PAGES="65-75", MONTH=jan, YEAR=1990, REFERENCES=25, KEYWORDS="Network Synchronization", ABSTRACT="This paper describes a series of experiments involving over 100,000 hosts of the Internet system and located in the U.S., Europe and the Pacific. The experiments are designed to evaluate the availability, accuracy and reliability of international standard time distribution using the Internet and the Network Time Protocol (NTP), which has been designated an Internet Standard protocol. NTP is designed specifically for use in a large, diverse internet system operating at speeds from mundane to lightwave. In NTP a distributed subnet of time servers operating in a self-organizing, hierarchical, master-slave configuration exchange precision timestamps in order to synchronize host clocks to each other and national time standards via wire or radio. The experiments are designed to locate Internet hosts and gateways that provide time by one of three time distribution protocols and evaluate the accuracy of their indications. For those hosts that support NTP, the experiments determine the distribution of errors and other statistics over paths spanning major portions of the globe. Finally, the experiments evaluate the accuracy and reliability of precision timekeeping using NTP and typical Internet paths involving ARPANET, NSFNET and regional networks. The experiments demonstrate that timekeeping throughout most portions of the Internet can be maintained to an accuracy of a few tens of milliseconds and a stability of a few milliseconds per day, even in cases of failure or disruption of clocks, time servers or networks.", URL="http://www.acm.org/sigcomm/ccr/archive/1990/jan90/mills.ps", } @TECHREPORT{Sand9001:Xpress, AUTHOR="R. Sanders", TITLE="The Xpress Transfer Protocol {(XTP)} - A Tutorial", TYPE="Technical Report", INSTITUTION="Computer Science Department, University of Virginia", ADDRESS="Charlottesville, VA 22903", NUMBER="TR-89-10", MONTH=jan, YEAR=1990, KEYWORDS="High-Speed Networking", } @ARTICLE{Rayc9001:Slotted, AUTHOR="D. Raychaudhuri and K. Joseph", TITLE="Performance Evaluation of Slotted {ALOHA} with Generalized Retransmission Backoff", JOURNAL=ieeecom, VOLUME=38, NUMBER=1, PAGES="117-121", MONTH=jan, YEAR=1990, KEYWORDS="Performance Analysis", } @ARTICLE{Mats9001:Probability, AUTHOR="Y. Matsumoto and Yutaka Takahashi and Toshiharu Hasegawa", TITLE="Probability Distributions of Interdeparture Time and Response Time in Multipacket {CSMA/CD} Systems", JOURNAL=ieeecom, VOLUME=38, NUMBER=1, PAGES="54-66", MONTH=jan, YEAR=1990, KEYWORDS="Performance Analysis", } @ARTICLE{Suns9001:Interconnection, AUTHOR="C. A. Sunshine", TITLE="Network Interconnection and Gateways", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="4-11", MONTH=jan, YEAR=1990, KEYWORDS="Network Protocols", } @ARTICLE{Boch9001:Design, AUTHOR="Gregor V. Bochmann and Pierre Mondain-Monval", TITLE="Design Principles for Communication Gateways", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="12-21", MONTH=jan, YEAR=1990, REFERENCES=19, ABSTRACT="The purpose of this paper is to define principles that apply to the design of communication gateways between heterogeneous computer systems, and to identify strategies to solve incompatibilities in a systematic manner. The importance of communication service common properties is explored in detail. The modification of the service available for interworking due to subset selection and service concatenation is discussed. Various methods of adaptation are described. Two architectural options for the design of communication gateways are explored, namely conversion at the service level or at the PDU level. While the former is conceptually simpler, various optimizations are possible through the latter approach. A method for deriving the specification of a protocol adapter from the two protocol specifications is also given. All these issues are explained with a number of simple examples.", } @ARTICLE{Varg9001:Transparent, AUTHOR="George Varghese and R. Perlman", TITLE="Transparent Interconnection of Incompatible Local Area Networks Using Bridges", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="42-48", MONTH=jan, YEAR=1990, REFERENCES=15, KEYWORDS="LANs", ABSTRACT="No single LAN technology is sufficient to interconnect all the computers in a given plant, campus, or site. Thus, it is desirable to combine different types of LAN's, using a device called a bridge, to produce an Extended LAN. Some LAN's in the Extended LAN may have incompatible Data Link formats. Thus, a bridge may need to encapsulate a frame originating on LAN A inside the Data Link header of another (incompatible) LAN B in order to allow the type A frame to travel over LAN B. In general, frames sent between any pair of LAN's in the Extended LAN must be encapsulated across every incompatible LAN in the path between the LAN's. Bridges learn their routing information from information contained in frames they forward. Besides the problems of distinguishing various kinds of encapsulated and unencapsulated frames, the encapsulating protocol used by bridges must also solve the learning problem. This leads to a new set of considerations and solutions. We begin with a rough solution, and refine it using informal arguments and examples to lead to the final description. The stages in the description roughly mimic the design process.", } @ARTICLE{Cole9001:Experience, AUTHOR="Randolph E. Cole", TITLE="Experience and Analysis of Network Interconnection", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="49-56", MONTH=jan, YEAR=1990, REFERENCES=24, KEYWORDS="Multiprotocol Environments", ABSTRACT="This paper describes some of the research work at University College London on Network Interconnection. A particular approach to internetworking is discussed and compared to other approaches reported in the literature. The architecture of a LAN based interconnection is described, and some important concepts are deduced. These concepts are discussed in light of the current theory of protocol interaction and two protocol conversion techniques are compared. The problems of addressing and access control in general network interconnection are described and a case is made for application layer relaying as the general solution.", } @ARTICLE{Rose9001:Transition, AUTHOR="Marshall T. Rose", TITLE="Transition and Coexistence Strategies for {TCP/IP} to {OSI}", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="57-66", MONTH=jan, YEAR=1990, REFERENCES=34, KEYWORDS="Multiprotocol Environments", ABSTRACT="The U.S. DoD Internet site of protocols (commonly known as TCP/IP) is the de facto open (nonproprietary) standard for computer-communications in multivendor and multiadministration networks. TCP/IP has enjoyed unprecedented success as the open systems solution of choice for interconnecting networks and hosts. However, some feel that protocols based on the Open Systems Interconnection (OSI) model and promulgated by the International Organization for Standardization (ISO) will eventually achieve dominance and enjoy even greater success than TCP/IP. This situation motivates us to explore methods for transition and coexistence between the two protocol suites.", } @ARTICLE{Svob9001:Heterogeneity, AUTHOR="Liba. Svobodova and P. Janson and Eduard Mumprecht", TITLE="Heterogeneity and {OSI}", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="67-79", MONTH=jan, YEAR=1990, REFERENCES=54, KEYWORDS="OSI", ABSTRACT="Heterogeneity is the fundamental problem OSI was designed to conquer. However, in spite of the availability of concrete public standards, global interoperability in the present very heterogeneous world of computer systems and networks is not easy to achieve. Incompatibilities hindering interoperability arise even within the realm of OSI. In this paper, we review the different aspects of heterogeneity that need to be resolved to achieve global interoperability, and specifically, to provide global transport service. We concentrate on the problems of interconnecting computer networks and systems that employ different protocols: 1) different subsets of OSI standards, and 2) OSI and non-OSI protocols. We discuss the issues of protocol conversion, and outline integrated naming, addressing, and directory mechanisms for interconnecting OSI and non-OSI domains. More subtle aspects of interoperability are examined for the case of the OSI transport protocol class 4 in mixed LAN/WAN networks.", } @ARTICLE{Naka9001:Feasibility, AUTHOR="K. Nakao and Sadao Obana and Satoshi Nishiyama and Toshiaki Tanaka", TITLE="Feasibility Study for Worldwide Videotex Interworking", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="80-92", MONTH=jan, YEAR=1990, REFERENCES=10, ABSTRACT="There is an increasing demand for the interworking of heterogeneous videotex systems. This paper presents the results of a study of the feasibility realizing a real time information retrieval service operating between different worldwide videotex systems via gateway facilities that use conversion of data syntax and processing of the videotex information structure (VIA). Two separate evaluations were carried out, both using response time as the performance criterion. One was for communication processes at both of two gateways, and the other was for data syntax conversion at the local host. Both approaches are considered as kernel functions in the gateway system. The results of each evaluation were favorable in the sense that response time for the total system using gateways compared favorably to the response time in current direct videotex access over the packet switched public data network.", } @ARTICLE{Ferr9001:GIFT, AUTHOR="Maria Lorenza Ferrer and F. Fluckiger and Giorgio Heiman and Giovanni Mirabelli and Elisabetta Pace and Enzo Valente", TITLE="{GIFT:} A Multiple Gateway for File Transfer, Access, and Management", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="99-106", MONTH=jan, YEAR=1990, REFERENCES=19, KEYWORDS="Multiprotocol Environments", ABSTRACT="A multiprotocol converter allowing file access, transfer, and management and remote job entry between different network protocols is presented. The gateway architecture and the protocol conversion model, mediated by a File System, are described. It will be shown that this approach greatly reduces the complexity of the multiprotocol conversion problem. Some examples of the gateway implementation are given. The gateway, entirely designed and developed by an international collaboration, has been in real production since 1985.", } @ARTICLE{Lenz9001:Earth, AUTHOR="Luniano Lenzini and R. Popescu-Zeletin", TITLE="From the Earth to the Sky and Back", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="107-118", MONTH=jan, YEAR=1990, REFERENCES=19, ABSTRACT="Data communication is a key issue in the planned European space mission. This paper describes the interconnection approach for end-to-end communication concentrating on the models and protocols to be adopted for integrating networks with heterogeneous technologies and applications with diverse characteristics. The paper reviews the mission environment and focuses on approaches for providing end-to-end communication between application processes residing in systems located in the sky and on the ground based on OSI/RM protocols and Telemetry/Telecommand protocols. Furthermore, it outlines a number of possible approaches dealing with end-to-end communication when the phsycial connectivity between the sky and the ground is missing as a result of system topology.", } @ARTICLE{Calv9001:Formal, AUTHOR="Ken Calvert and S. S. Lam", TITLE="Formal Methods for Protocol Conversion", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="127-142", MONTH=jan, YEAR=1990, REFERENCES=35, ABSTRACT="We consider ways of overcoming a protocol mismatch using protocol conversion. Three different methods for finding a protocol converter are described. Two of these are ``bottom up'' in nature, and involve relating the conversion system to existing protocols. The third approach, which is new, is ``top down'': the desired global properties of the conversion system are used in deriving the converter. An example is used to illustrate each method. We discuss more general forms of the abstract problem in the context of layered network architectures.", } @ARTICLE{Auer9001:TACT, AUTHOR="Joshua Auerbach", TITLE="{TACT:} A Protocol Conversion Toolkit", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="143-159", MONTH=jan, YEAR=1990, REFERENCES=31, ABSTRACT="This paper describes TACT, a toolkit (or software function library) for synthesizing conversions between different transport interfaces. TACT classifies transport interfaces according to their abstraction type or basic model of communication. Each actual transport interface is converted to or from a canonical form for its abstraction type, and TACT provides sufficient abstraction converters to convert between all of the canonical forms. A TACT coversion is accomplished by combining some number of elementary conversions which execute in series. Also provided are remedies for other sources of heterogeneity, such as differences in endpoint naming or buffer management. A program which has been augmented with TACT functions can adapt to different available transports at run time. This paper describes the toolkit, constrasts it with other approaches, shows how it can be used to solve various problems, and provides details on its implementation.", } @ARTICLE{Mark9001:Distributed, AUTHOR="Tasso Markas and Mark Royals and Nick Kanopoulos", TITLE="On Distributed Fault Simulation", JOURNAL=ieeecomp, PUBLISHER="IEEE", VOLUME=23, NUMBER=1, PAGES="40-54", MONTH=jan, YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Carl9001:Monitoring, AUTHOR="Ugo Carlini and R. Vaccaro and Umberto Villano", TITLE="The Monitoring of Inter-process Communications in Distributed Systems", JOURNAL=future, PUBLISHER="Elsevier", VOLUME=5, NUMBER=4, PAGES="359-364", MONTH=jan, YEAR=1990, KEYWORDS="Distributed Systems", } @INPROCEEDINGS{Emer9001:Integrated, AUTHOR="J. S. Emer and William Edward Weihl", TITLE="Integrated Interactive Access to Heterogeneous Distributed Services", BOOKTITLE=usenixw, PUBLISHER="Usenix association", ADDRESS="Washington, DC", MONTH=jan, YEAR=1990, KEYWORDS="Distributed Systems", ABSTRACT="In this paper, we consider how to provide interactive users with uniform and integrated access to heterogeneous distributed services. Access to distributed services though a single interface has many advantages. One is that it provides the user with an integrated interface environment that allows easy interaction between uses of distinct services. Another is that it simplifies creation of interfaces to new services by obviating the need to create a custom interface for that particular service. As a particular instance of such an interface, we examine the use of editors as an interface to distributed services. To date, the means provided within editors for accessing services has been relatively ad-hoc. In this paper, we examine the more general technique of using remote procedure call as the service access paradigm. This technique is shown to have many advantages including: ease of integration of new services; allowing for more powerful services since they can be written in languages and on hardware platforms appropriate to the service; and allowing access to remote data and access from multiple sites.", } @TECHREPORT{Bark9001:Raised, AUTHOR="Paul Barker", TITLE="Issues raised by an {X.500} pilot service", TYPE="Technical Report", INSTITUTION="University College London", NUMBER="RN/90/5", MONTH=jan, YEAR=1990, KEYWORDS="Directory Services", } @TECHREPORT{Bark9001:Managing, AUTHOR="Paul Barker", TITLE="Managing data derived from multiple sources in an {X.500} Directory", TYPE="Technical Report", INSTITUTION="University College London", NUMBER="RN/90/6", MONTH=jan, YEAR=1990, KEYWORDS="Directory Services", } @TECHREPORT{Bark9001:Directory, AUTHOR="Paul Barker", TITLE="Directory System Configuration Guide", TYPE="Technical Report", INSTITUTION="University College London", NUMBER="RN/90/7", MONTH=jan, YEAR=1990, KEYWORDS="Directory Services", } @INPROCEEDINGS{Walt9001:Construction, AUTHOR="S. M. Walton and G. Knight", TITLE="The Construction of a Connectionless Ethernet {ISDN} Gateway", BOOKTITLE="Open Systems and Interoperability Online Conference", PAGES=10, MONTH=jan, YEAR=1990, KEYWORDS="multiprotocol gateways", } @ARTICLE{Hill9001:Wavelength, AUTHOR="G. W. Hill", TITLE="Wavelength Domain Optical Network Techniques", JOURNAL=ieeeproc, VOLUME=78, PAGES="121-132", MONTH=jan, YEAR=1990, KEYWORDS="High-Speed Networks", } @ARTICLE{Rubi9001:Media, AUTHOR="I. Rubin and J. Baker", TITLE="Media Access Control for High-Speed Local Area and Metropolitan Area Communications Networks", JOURNAL=ieeeproc, VOLUME=78, PAGES="168-203", MONTH=jan, YEAR=1990, KEYWORDS="High-Speed Networks", } @TECHREPORT{Gray9001:Leases, AUTHOR="Cary G. Gray and D. R. Cheriton", TITLE="Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency", TYPE="Technical Report", INSTITUTION="Computer Systems Laboratory, Stanford University", NUMBER="CSL-TR-90-409", MONTH=jan, YEAR=1990, KEYWORDS="Distributed File Systems", ABSTRACT="Caching introduces the overhead and complexity of ensuring consistency, reducing some of its performance benefits. In a distributed system, caching must deal with the additional complications of communication and host failures. Leases are proposed as a time-based mechanism that provides efficient consistent access to cached data in distributed systems. Non-Byzantine failures affect performance, not correctness, with their effect minimized by short leases. An analytic model and an evaluation for file access in the V system show that leases of short duration provide good performance. The impact of leases on performance grows more significant in systems of larger scale and higher processor performance. [To order, call +1 415-723-1430]", } @ARTICLE{Aho9001:Protocol, AUTHOR="Alfred. V. Aho and Barry S. Bosik and Stephen J. Griesmer", TITLE="Protocol testing and verification within {AT\\&T}", JOURNAL=atttj, VOLUME=69, NUMBER=1, PAGES="4-6", MONTH=jan, YEAR=1990, KEYWORDS="Protocol Testing and Verification", } @ARTICLE{Bert9001:Overview, AUTHOR="H. V. Bertine and W. B. Elsner and Pramode K. Verma and Kamlesh T. Tewani", TITLE="Overview of Protocol Testing Programs, Methodologies, and Standards", JOURNAL=atttj, VOLUME=69, NUMBER=1, PAGES="7-16", MONTH=jan, YEAR=1990, KEYWORDS="Protocol Testing and Verification", } @ARTICLE{Uyar9001:Algorithmic, AUTHOR="M. Ü. Uyar and A. M. Lapone and K. Sabnani", TITLE="Algorithmic Verification of {ISDN} Network Layer Protocol", JOURNAL=atttj, VOLUME=69, NUMBER=1, PAGES="17-31", MONTH=jan, YEAR=1990, KEYWORDS="Protocol Testing and Verification", } @ARTICLE{Holz9001:Algorithms, AUTHOR="Gerard J Holzmann", TITLE="Algorithms for Automated Protocol Verification", JOURNAL=atttj, VOLUME=69, NUMBER=1, PAGES="32-44", MONTH=jan, YEAR=1990, KEYWORDS="Protocol Testing and Verification", } @ARTICLE{HarE9001:Software, AUTHOR="Z. Har'el and Robert P. Kurshan", TITLE="Software for Analytical Development of Communications Protocols", JOURNAL=atttj, VOLUME=69, NUMBER=1, PAGES="45-59", MONTH=jan, YEAR=1990, KEYWORDS="Protocol Testing and Verification", } @ARTICLE{Sher9001:Protocol, AUTHOR="M. H. Sherif and M. Ü. Uyar", TITLE="Protocol Modeling for Conformance Testing: Case Study for the {ISDN} {LAPD} Protocol", JOURNAL=atttj, VOLUME=69, NUMBER=1, PAGES="60-83", MONTH=jan, YEAR=1990, KEYWORDS="Protocol Conformance Testing", } @ARTICLE{Bush9001:Conformance, AUTHOR="Mathew Bush and Kris Rasmussen and F. S. Wong", TITLE="Conformance Testing Methodologies for {OSI} Protocols", JOURNAL=atttj, VOLUME=69, NUMBER=1, PAGES="84-100", MONTH=jan, YEAR=1990, KEYWORDS="Protocol Conformance Testing", } @ARTICLE{Dahb9001:Algorithm, AUTHOR="A. Dahbura and K. Sabnani and M. Ü. Uyar", TITLE="Algorithm Generation of Protocol Conformance Tests", JOURNAL=atttj, VOLUME=69, NUMBER=1, PAGES="101-118", MONTH=jan, YEAR=1990, KEYWORDS="Protocol Conformance Testing", } @ARTICLE{Hubb9001:Deterministic, AUTHOR="Darrell Hubbard", TITLE="Deterministic Execution Testing of {FSM-Based} Protocols", JOURNAL=atttj, VOLUME=69, NUMBER=1, MONTH=jan, YEAR=1990, KEYWORDS="Protocol Testing and Verification", } @TECHREPORT{Goud9001:Stabilizing, AUTHOR="M. G. Gouda and T. Herman", TITLE="Stabilizing Unison", TYPE="Technical Report", INSTITUTION="Computer Science Department, University of Texas at Austin", NUMBER="TR-90-01", PAGES=7, MONTH=jan, YEAR=1990, KEYWORDS="Time Synchronization", ABSTRACT="We present an elegant implementation of ``clocks'' in distributed synchronous systems. The implementation is stabilizing in the following sense. Starting from any state, the clocks are guaranteed to reach ``unison'' where they show the same time, and the shown time is incremented in each step.", } @INPROCEEDINGS{Cruz9001:Iterative, AUTHOR="J. R. Cruz and S. Stidham Jr", TITLE="Iterative methods for determining derivatives of stationary distributions of finite Markov chains", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="142-164", MONTH=jan, YEAR=1990, REFERENCES=22, KEYWORDS="Markov chain; steady state probability; distribution; iterative method; algorithm", ANNOTE="Algorithms for obtaining derivatives of steady state probability distributions of finite Markov chains are presented. The focus is on a conceptually simple approach for developing such algorithms from established methods of computing steady state proba-bility distributions. The prototyp is briefly discussed and the results are presented of applying the approach to LOPSI (Lopsided Iteration) and Neut's Matrix Geometric Methods.", } @INPROCEEDINGS{Dijk9001:Importance, AUTHOR="N. van Dijk", TITLE="The importance of bias-terms for error bounds and comparison results", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="640-663", MONTH=jan, YEAR=1990, REFERENCES=46, KEYWORDS="Markov chain; error bound; comparison; perturbation; queueing network", ANNOTE="Some recent results are surveyed and unified showing that bias terms of Markov reward structures are essential to conclude error bound or monotonicity results for steady state measures when dealing with: perturbations, finite truncations, system modifications, or system comparisons (bounds). The results are illustrated by a non-product form queueing network example with practicalphenomena as blocking, overflow and breakdowns.", } @MANUAL{CCITT90:Draft, AUTHOR="C. C. ITT (International Telegraph Study Gr XVIII", TITLE="Draft 1990 {BISDN} Recommendations", MONTH=jan, YEAR=1990, } @ARTICLE{Danz9001:High, AUTHOR="Peter Danzig and Stephen W. Melvin", TITLE="High Resolution Timing with Low Resolution Clocks and a Microsecond Timer for Sun Workstations", JOURNAL=acmosrev, VOLUME=24, NUMBER=1, PAGES="23-26", MONTH=jan, YEAR=1990, } @ARTICLE{McLe9001:Modeling, AUTHOR="John McLean", TITLE="The Specification and Modeling of Computer Security", JOURNAL=ieeecomp, VOLUME=23, NUMBER=1, PAGES="9-16", MONTH=jan, YEAR=1990, } @TECHREPORT{Laza9001:Object, AUTHOR="Aurel A. Lazar", TITLE="Object-Oriented Modeling of the Architecture of Integrated Networks", TYPE="CTR Technical Report", INSTITUTION="Center for Telecommunications Research, Columbia University", ADDRESS="New York", NUMBER="167-90-04", MONTH=jan, YEAR=1990, URL="ftp://ftp.ctr.columbia.edu/CTR-Research/comet/public/papers/90/LAZ90d.ps.gz", } @INPROCEEDINGS{Selt9001:Disk, AUTHOR="Margo Seltzer and Pi-Chun Chen and J. Ousterhout", TITLE="Disk Scheduling Revisited", BOOKTITLE=usenixw, ADDRESS="Washington, DC", MONTH=jan, YEAR=1990, URL="ftp://ftp.cs.berkeley.edu/ucb/raid/papers/usenix90.ps", } @ARTICLE{Post9001:Cuckoo, AUTHOR="reviewed by Jon Postel", TITLE="The Cuckoo's Egg by Cliff Stoll", JOURNAL=ccr, VOLUME=20, NUMBER=1, MONTH=jan, YEAR=1990, } @ARTICLE{Mill9001:Measured, AUTHOR="D. L. Mills", TITLE="Measured Performance of the Network Time Protocol in the {DARPA/NSF} {Internet} System", JOURNAL=ccr, VOLUME=20, NUMBER=1, MONTH=jan, YEAR=1990, } @ARTICLE{McKi9001:Multicast, AUTHOR="Philip McKinley and Jia Liu", TITLE="Multicast tree construction in bus-based networks", JOURNAL=cacm, VOLUME=133, NUMBER=1, PAGES="29-43", MONTH=jan, YEAR=1990, } @INPROCEEDINGS{Lin9001:Conservative, AUTHOR="Y. Lin and E. D. Lazowska and J.-L. Baer", TITLE="Conservative Parallel Simulation For Systems With No Lookahead Prediction", BOOKTITLE="SCS Multiconference on Distributed Simulation", PUBLISHER="Society for Computer Simulation", VOLUME=22, PAGES="144-149", MONTH=jan, YEAR=1990, } @INPROCEEDINGS{Lin9001:Optimality, AUTHOR="Y. Lin and E. D. Lazowska", TITLE="Optimality Considerations for ``Time Warp'' Parallel Simulation", BOOKTITLE="SCS Multiconference on Distributed Simulation", PUBLISHER="Society for Computer Simulation", VOLUME=22, PAGES="29-34", MONTH=jan, YEAR=1990, } @INPROCEEDINGS{Madi9001:Synchronization, AUTHOR="V. Madisetti and J. Walrand and D. Messerschmitt", TITLE="Synchronization in Message-Passing Computers: Models, Algorithms and Analysis", BOOKTITLE="SCS Multiconference on Distributed Simulation", PUBLISHER="Society for Computer Simulation", VOLUME=22, PAGES="35-48", MONTH=jan, YEAR=1990, } @INPROCEEDINGS{Bell9001:Global, AUTHOR="S. Bellenot", TITLE="Global Virtual Time Algorithms", BOOKTITLE="SCS Multiconference on Distributed Simulation", PUBLISHER="Society for Computer Simulation", VOLUME=22, PAGES="122-127", MONTH=jan, YEAR=1990, } @BOOK{Nico9001:Proceedings, TITLE="Proceedings of the {SCS} Multiconference on Distributed Simulation", EDITOR="David Nicol", PUBLISHER="Society for Computer Simulation", VOLUME=22, MONTH=jan, YEAR=1990, } @INPROCEEDINGS{Feld9001:Upper, AUTHOR="Robert E. Felderman and L. Kleinrock", TITLE="An Upper Bound on the Improvement of Asynchronous Versus Synchronous Distributed Processing", BOOKTITLE="SCS Multiconference on Distributed Simulation", ORGANIZATION="Society for Computer Simulation", VOLUME=22, PAGES="131-136", MONTH=jan, YEAR=1990, } @INPROCEEDINGS{Bers9001:Methodology, AUTHOR="S. Berson and E. de Souza and R. R. Muntz", TITLE="A Methodology for the Specification and Generation of Markov Models", BOOKTITLE="1st International Conference on the Numerical Solution of Chains", PAGES="2-30", MONTH=jan, YEAR=1990, } @INPROCEEDINGS{Dick9001:SRADS, AUTHOR="P. M Dickens and Jr Paul F. Reynolds", TITLE="{SRADS} with Local Rollback", BOOKTITLE="SCS Multiconference on Distributed Simulation", VOLUME="22:1", PAGES="161-164", MONTH=jan, YEAR=1990, } @ARTICLE{Warr9001:Platform, AUTHOR="U. Warrier and C. A. Sunshine", TITLE="A Platform for Heterogeneous Interconnection Network Management", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="119-126", MONTH=jan, YEAR=1990, REFERENCES=36, KEYWORDS="Network Management", ABSTRACT="A comprehensive network management function built into the interconnection network provides the means of meeting user needs of fault tolerance, performance, accounting, and security. However, meeting these needs on a heterogeneous interconnection network is several levels more complex than on a heterogeneous network because of the existence of multiple protocol stacks for communication. An architecture is proposed in this paper that will solve this problem by analyzing the heterogeneous interconnection network as a single entity. The paper presents the design issues evaluated in making the choice of this approach, and thence establishes the need for the various components in this architecture. An overview is presented of each of the components, and their place in the architecture pointed out. The paper thus establishes a platform for the implementation of sophisticated heterogeneous network management functions.", } @ARTICLE{Warr9001:Instruction, AUTHOR="H. S. Warren", TITLE="Instruction scheduling for the {IBM} {RISC} System/6000 processor", JOURNAL=ibmjrd, VOLUME=34, NUMBER=1, PAGES="85-91", MONTH=jan, YEAR=1990, } @ARTICLE{Horw9001:Interprocedural, AUTHOR="S. Horwitz and T. Reps and D. Binkley", TITLE="Interprocedural Slicing Using Dependence Graphs", JOURNAL=toplas, VOLUME=12, NUMBER=1, PAGES="26-60", MONTH=jan, YEAR=1990, KEYWORDS="parallel; multiprocessor; compiling; compiler", } @TECHREPORT{Bren9001:Fast, AUTHOR="R. P. Brent", TITLE="Fast Training Algorithms for Multi-layer Neural Nets", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-90-01", MONTH=jan, YEAR=1990, } @INPROCEEDINGS{Bark9001:Manufacturing, AUTHOR="V. A. Barker and B. F. Nielsen", TITLE="The Analysis of a Manufacturing Unit by Sparse Matrix Techniques", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", MONTH=jan, YEAR=1990, KEYWORDS="manufacturing system; analysis; sparse matrix; mathematical method", } @INPROCEEDINGS{Ciar9001:Solution, AUTHOR="G. Ciardo and K. S. Trivedi", TITLE="Solution of Large {GSPN} Models", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains, Raleigh", PAGES="603-626", MONTH=jan, YEAR=1990, KEYWORDS="Petri net", ABSTRACT="Generalized Stochastic Petri Nets (GSPNs) can be effectively used to present many systems in a compact way. Efficient algorithms for the translation of a GSPN into the underlying Continuous Time Markov Chain (CTMC) are known to have been implemented in a number of software packages. While GSPNs relieve the modeler from the cumbersome and error-prone task of building and inputting the CTMC by hand, their analytically tract", } @INPROCEEDINGS{Gras9001:Finding, AUTHOR="W. K. Grassman", TITLE="Finding Transient Solutions in Markovian Event Systems Through Randomization", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains, Raleigh", ADDRESS="Raleigh, North Carolina", PAGES="375-395", MONTH=jan, YEAR=1990, KEYWORDS="Random Process; Markov Chain; Markov System; Continuous Time Process; Transient Analysis", ABSTRACT={In 1953, Jensen proposed a very efficient method to find transient solutions of continuous-time Markov chains. This method, known under the names of "randomization" or "uniformization" has become very popular. In this paper, we describe Jensen's method in the setting of Markovian event systems, and we show its potentials and limitations. We also point out the importance of transient solutions in general, and we show that}, } @INPROCEEDINGS{Shra9001:Combinatorial, AUTHOR="E. Shragowitz and R.-B. Lin", TITLE="Combinatorial Optimization, Markov Chains and Stochastic Automata", BOOKTITLE="1st International Conference on the Numerical Solution of Markov Chains", ADDRESS="Raleigh, North Carolina", PAGES="582-602", MONTH=jan, YEAR=1990, KEYWORDS="Markov chain", ABSTRACT="It is already known for some time that Markov chains techniques can be applied to solving combinatorial optimization problems. Under certain conditions a nonstationary Markov chain of states in the solution space of the combinatorial problem asymptotically converges in probability to a global minimum. A similar set of ideas was introduced earlier in the domain of automata theory for adaptive optimization of the unknown fu", } @ARTICLE{Dijk9001:Simple, AUTHOR="N. van Dijk", TITLE="Simple Performance Estimates and Error Bounds for Slotted {ALOHA} Systems", JOURNAL=or, VOLUME=9, PAGES="175-180", MONTH=jan, YEAR=1990, KEYWORDS="aloha; product form; performance evaluation; error bound", ABSTRACT="Simple analytic estimates and corresponding error bounds are provided for communication or broadcast systems with state dependent message loss probabilities, such as slotted Aloha loss systems.", } @ARTICLE{Cahn9001:ASCII, AUTHOR="Robert S. Cahn", TITLE="{ASCII} Protocol Conversion Revisited", JOURNAL=ieeejsac, VOLUME=8, NUMBER=1, PAGES="93-98", MONTH=jan, YEAR=1990, REFERENCES=8, ABSTRACT="One of the first implementations of protocol conversion was the connection of ``dumb'' ASCII, async terminals to IBM 370 hosts. A protocol converter box made the ASCII terminal appear to the host as a 3270 display and made the host appear to understand the Escape sequences necessary to control the ASCII terminal. In this work, we will describe an approach to connecting ``smart'' async ASCII devices to 370 hosts. By having a single screen at the microcomputer instead of two (one at the controller and one at the display) and by utilizing compression and async data links, the performance of remote workstations on slow links can be greatly improved.", } @ARTICLE{Aho9001:Protocol, AUTHOR="A. V. Aho and B. S. Bosik and Stephen J. Griesmer", TITLE="Protocol testing and verification within {AT\&T}", JOURNAL=atttj, VOLUME=69, NUMBER=1, PAGES="4-6", MONTH=jan, YEAR=1990, KEYWORDS="Protocol Testing and Verification", } @INPROCEEDINGS{Kim9001:Isomorphic, AUTHOR="Tae Kim and B. P. Zeigler", TITLE="Isomorphic replication of hierarchical models in {DEVS-Scheme}", BOOKTITLE="SCS Multiconference on object oriented simulation", PAGES="104-108", DAYS=17, MONTH=jan, YEAR=1990, REFERENCES=6, KEYWORDS="Simulation; hierarchical modeling; LISP", ABSTRACT="DEVS-Scheme is a realization of the DEVS formalism in a LISp-based object-oriented framework. It enables a modeler to develop deiscrete-event models in a hierarchical, modular manner.", } @ARTICLE{Hoit9002:Scheduling, AUTHOR="Debra J. Hoitomt and Peter B. Luh and Eric Max and K. R. Pattipati", TITLE="Scheduling Jobs with Simple Precedence Constraints on Parallel Machines", JOURNAL=ieeecsm, VOLUME=10, NUMBER=2, PAGES="34-40", MONTH=feb, YEAR=1990, KEYWORDS="scheduling", ANNOTE="Lagrangian multiplier approach with heuristics to satisfy capacity constraints. Slotted time. All machines are equivalent and have a total combined capacity which may depend on time. Operations may occur in parallel.", } @TECHREPORT{Ande9002:SRP, AUTHOR="D. P. Anderson", TITLE="{SRP:} a resource reservation protocol for guaranteed-performance communication in the {Internet}", TYPE="Report", INSTITUTION="Computer Science Division, University of California at Berkeley", ADDRESS="Berkeley, California", NUMBER="UCB/CSD 90/562", MONTH=feb, YEAR=1990, KEYWORDS="operating systems; resource reservation", ABSTRACT="The report describes the session reservation protocol (SRP). SRP is defined in the DARPA Internet family of protocols. It allows communicating peer entities to reserve the resources, such as CPU and network bandwidth, necessary to achieve given performance objectives (delay and throughput). The immediate goal of SRP is to support ``continuous media'' (digital audio and video) in IP-based distributed systems. However, it is applicable to any application that requires guaranteed-performance network connections. The design goals of SRP include 1) independence from transport protocols (SRP can be used with standard protocols such as TCP or with new real-time protocols); 2) compatibility with IP (data packets are not modified); 3) a host implementing SRP can benefit from its use even when communicating with hosts not supporting SRP. SRP is based on a workload and scheduling model called the DASH resource model. This model defines a parameterization of client workload, an abstract interface for hardware resources, and an end-to-end algorithm for negotiated resource reservation based on cost minimization. SRP implements this end-to-end algorithm, handling those resources related to network communication.", } @ARTICLE{Andr9002:Bridging, AUTHOR="Warren Andrews", TITLE="Bridging today's buses to Futurebus", JOURNAL=comp_design, VOLUME=29, NUMBER=2, PAGES="72-84", MONTH=feb, YEAR=1990, } @TECHREPORT{Cido9002:Fast, AUTHOR="I. Cidon and I. Gopal and A. Segall", TITLE="Fast connection establishment in high speed networks", TYPE="Technical Report", INSTITUTION="IBM T. J. Watson Research Center", ADDRESS="Yorktown Heights, New York", MONTH=feb, YEAR=1990, KEYWORDS="PARIS network; connection setup; network control", ABSTRACT="Protocols for establishing, maintaining and terminating connections in packet switched networks have been studied in the literature and numerous standards have been developed to address this problem. In this paper, we reexamine connection establishment in the context of a fast packet network with an integrated traffic load, explain why previously proposed solutions are inadequate and develop a protocol for connection establishment/takedown that is appropriate for such a network. The underlying model that we use is the recently developed PARIS network, though our ideas are sufficiently general to cover many other fast packet networking architectures.", } @TECHREPORT{SunM9002:Extenisble, AUTHOR="{Sun Microsystems}", TITLE="Network Extensible File System Protocol Specification", INSTITUTION="Sun Microsystems", MONTH=feb, YEAR=1990, } @ARTICLE{Giff9002:Polychannel, AUTHOR="D. K. Gifford", TITLE="Polychannel Systems for Mass Digital Communications", JOURNAL=cacm, VOLUME=33, NUMBER=2, PAGES="141-152", MONTH=feb, YEAR=1990, KEYWORDS="Distributed Systems", ABSTRACT="A new type of distributed computer system looks beyond workstation and local area network assumptions toward the time when computers will be used by everyone everywhere.", } @ARTICLE{Gavi9002:Dynamic, AUTHOR="Bezalel X Gavish and Oliva R. Liu Sheng", TITLE="Dynamic File Migration in Distributed Computer Systems", JOURNAL=cacm, VOLUME=33, NUMBER=2, PAGES="177-190", MONTH=feb, YEAR=1990, KEYWORDS="Distributed File Systems", ABSTRACT="With the cost/capacity revolution in data communication networks, file management operations have become technically viable and deserve more research efforts.", } @ARTICLE{Till9002:SNA, AUTHOR="Matthew A. Tillman and David Chi-Chung) Yen", TITLE="{SNA} and {OSI:} Three Strategies for Interconnection", JOURNAL=cacm, VOLUME=33, NUMBER=2, PAGES="214-254", MONTH=feb, YEAR=1990, KEYWORDS="Multiprotocol Environments", ABSTRACT="IBM's current efforts and future plans in connectivity between SNA and OSI are examined.", } @ARTICLE{Haba9002:Hybrid, AUTHOR="Dieter Haban and Dieter Wybranietz", TITLE="A Hybrid Monitor for Behavior and Performance Analysis of Distributed Systems", JOURNAL=ieeese, VOLUME=16, NUMBER=2, PAGES="197-212", MONTH=feb, YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Kell9002:Achieving, AUTHOR="Jr. Kelly and S. Murphy", TITLE="Achieving Dependability Validation: A Methodology and Some Applications", JOURNAL=ieeese, VOLUME=16, NUMBER=2, PAGES="153-165", MONTH=feb, YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Tayl9002:Logical, AUTHOR="M. C. Taylor", TITLE="Logical Optimization of Distributed Knowledge Base Queries", JOURNAL="The Computer Journal", VOLUME=33, NUMBER=1, PAGES="49-59", MONTH=feb, YEAR=1990, KEYWORDS="Distributed Databases", } @ARTICLE{Mart9002:Site, AUTHOR="T. P. Martin and K. Lam and Jr. Russell", TITLE="An Evaluation of Site Selection Algorithms for Distributed Query Processing", JOURNAL="The Computer Journal", VOLUME=33, NUMBER=1, PAGES="61-69", MONTH=feb, YEAR=1990, KEYWORDS="Distributed Databases", } @ARTICLE{Agra9002:Integrating, AUTHOR="D. P. Agrawal and A El Abbadi", TITLE="Integrating Security with Fault-tolerant Distributed Databases", JOURNAL="The Computer Journal", VOLUME=33, NUMBER=1, PAGES="71-77", MONTH=feb, YEAR=1990, KEYWORDS="Distributed Databases", } @ARTICLE{Mukk9002:Efficient, AUTHOR="R. Mukkamala and S. C. Bruell", TITLE="Efficient Schemes to Evaluate Transaction Performance in Distributed Database Systems", JOURNAL="The Computer Journal", VOLUME=33, NUMBER=1, PAGES="79-88", MONTH=feb, YEAR=1990, KEYWORDS="Distributed Databases", } @ARTICLE{Mats9002:Effects, AUTHOR="Y. Matsumoto and Yutaka Takahashi and Toshiharu Hasegawa", TITLE="The Effects of Packet Size Distributions on Output and Delay Processes of {CSMA/CD}", JOURNAL=ieeecom, VOLUME=38, NUMBER=2, PAGES="199-214", MONTH=feb, YEAR=1990, KEYWORDS="CSMA/CD", } @TECHREPORT{Crow9002:Specification, AUTHOR="Jon Crowcroft and Mark d'Inverno", TITLE="Specification, Design, and Implementation of A Real Time Conferencing System", TYPE="Technical Report", INSTITUTION="University College London", NUMBER="RN/90/9", MONTH=feb, YEAR=1990, KEYWORDS="Conferencing", } @ARTICLE{Schr9002:Firefly, AUTHOR="M. D. Schroeder and Michael Burrows", TITLE="Performance of Firefly {RPC}", JOURNAL=tocs, VOLUME=8, NUMBER=1, PAGES="1-17", MONTH=feb, YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Burr9002:Logic, AUTHOR="Michael Burrows and Martin Abadi and R. M. Needham", TITLE="A Logic of Authentication", JOURNAL=tocs, VOLUME=8, NUMBER=1, PAGES="18-36", MONTH=feb, YEAR=1990, KEYWORDS="Authentication", } @ARTICLE{Bers9002:Lightweight, AUTHOR="B. N. Bershad and Thomas Anderson and E. D. Lazowska and H. M. Levy", TITLE="Lightweight Remote Procedure Call", JOURNAL=tocs, VOLUME=8, NUMBER=1, PAGES="37-55", MONTH=feb, YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Bier9002:Systematic, AUTHOR="Ernst Biersack", TITLE="A systematic approach for constructing gateways", JOURNAL=cnis, VOLUME=18, NUMBER=2, PAGES="79-96", MONTH=feb, YEAR=1990, KEYWORDS="Gateways", } @ARTICLE{Bond9002:MAC, AUTHOR="A. Bondavalli and M. Conti and Enrico Gregori and Luniano Lenzini and L. Strigni", TITLE="{MAC} protocols for high-speed {MANs:} Performance comparisons for a family of Fasnet-based protocols", JOURNAL=cnis, VOLUME=18, NUMBER=2, PAGES="97-114", MONTH=feb, YEAR=1990, KEYWORDS="Protocol Performance", } @ARTICLE{Orda9002:Multihoming, AUTHOR="A. Orda and R. Rom", TITLE="Multihoming in computer networks: A topology-design approach", JOURNAL=cnis, VOLUME=18, NUMBER=2, PAGES="133-142", MONTH=feb, YEAR=1990, KEYWORDS="Multihoming", } @ARTICLE{Adas9002:Methodology, AUTHOR="A. Adas", TITLE="Evaluation methodology for wide area networks", JOURNAL=cnis, VOLUME=18, NUMBER=2, PAGES="115-132", MONTH=feb, YEAR=1990, } @TECHREPORT{Hits9002:Knowledge, AUTHOR="B. L. Hitson", TITLE="Knowledge-based Monitoring and Control of Distributed Systems", TYPE="Technical Report", INSTITUTION="Computer Systems Laboratory, Stanford University", NUMBER="CSL-TR-90-414", MONTH=feb, YEAR=1990, KEYWORDS="Network Management", ABSTRACT={Monitoring and control (M\\&C) refers to the process of collecting information about a system, interpreting it, and finally using it to affect system behavior. We show that a knowledge-based approach is both necessary and appropriate for M\\&C of complex message-based distributed systems, and that a blackboard architecture can be successfully applied to M\\&C problems in the same way that it has been previously applied in other signal processing domains. To achieve good performance, we have augmented the traditional purely declarative rule system approach with cached temporal linkage information and fast procedural analysis routines. Scheduling or search control must be tuned for individual M\\&C applications. We have developed multi-level weighted search control to overcome some of the scheduling problems that are encountered in domains such as M\\&C where shallow heuristic knowledge predominates. Our ideas have been developed and refined in the context of two implementations of monitoring and control "expert systems": an automated TCP/IP network protocol analyst, and a system for both performing Time Warp distributed simulations and analyzing the results. Their common aspects form the basis for KNOBS---a knowledge-based M\\&C shell and environment that is suitable and practical for studying a wide range of distributed systems. [To order, call +1 415-723-}, } @ARTICLE{Rama9002:Key, AUTHOR="Ravi Ramaswamy", TITLE="A Key management Algorithm for Secure Communication in Open Systems Interconnection Architecture", JOURNAL=csec, VOLUME=9, NUMBER=1, PAGES="77-84", MONTH=feb, YEAR=1990, KEYWORDS="Security", ABSTRACT="A key management algorithm is presented in this paper. It is applied to secure transmission of user data between two peer layers of an open systems interconnection reference model architecture located at any source and destination end user host systems. In particular, the algorithm (i) generates and distributes a session key between two peer layers during the connection establishment phase,(ii) encrypts and decrypts the user data, present in the protocol data unit, using the same session key during the data transfer phase and (iii) after transmitting the user data, it destroys the session key during the connection release phase. For the purpose of simulation, the algorithm is shown applied between the transport service user and the provider, present at the source and the destination host systems, for secure transfer of transport service user data to the corresponding remote peer layer using the class 4 transport protocol of the OSI-RM architecture.", } @TECHREPORT{Litt9002:Efficient, AUTHOR="Richard J. Littlefield", TITLE="Efficient Iteration in Data-Parallel Programs with Irregular and Dynamically Distributed Data Structures", INSTITUTION="University of Washington, Seattle", NUMBER="90-02-06", MONTH=feb, YEAR=1990, } @ARTICLE{Liou9002:Visual, AUTHOR="Ming L. Liou", TITLE="Visual Telephony as an {ISDN} Application", JOURNAL=ieeecm, PUBLISHER="IEEE", PAGES="30-38", MONTH=feb, YEAR=1990, KEYWORDS="H.261; video compression; video transport; ISDN", } @TECHREPORT{Jaff9002:Software, AUTHOR="Matthew S. Jaffe and N. Leveson and Mats Heimdahl and Bonnie Melhart", TITLE="Software Requirements Analysis for Real-Time Process-Control Systems", TYPE="Technical Report", INSTITUTION="University of California, Irvine, Department of Information and Computer Science", NUMBER="ICS-TR-90-04", PAGES=40, MONTH=feb, YEAR=1990, ABSTRACT="Abstract unavailable", } @TECHREPORT{Herl9002:Deterministic, AUTHOR="Kieran T. Herley", TITLE="Deterministic Simulations of Shared Memory on Bounded Degree Networks", TYPE="PhD Thesis", INSTITUTION="Cornell University, Computer Science Department", NUMBER="TR90-1090", PAGES=107, MONTH=feb, YEAR=1990, ABSTRACT="The Parallel Random Access Machine (PRAM) is an abstract parallel machine consisting of a synchronous collection of $n$ processors connected to a shared memory of $m$ cells. The essential feature of the PRAM is that the processors can access any $n$-tuple of distinct cells in a single machine cycle. While the PRAM is an attractive and widely used framework for the design and analysis of parallel algorithms, it does not reflect the constraints of realistic multiprocessors. This thesis explores the problem of efficient deterministic simulations of PRAM computations on bounded degree networks of processors, a model of parallel machines closer to what can be built in practice. It is shown that an arbitrary step of a PRAM with $n$ processors and $m \geq n$ cells of shared memory can be simulated in $O$(log($(m/n)$ log $n$/log log $n$ + log $n$ log log $n$ (log log $(m/n)$ - log log log $n$)) time in the worst-case on an $n$-node bounded degree network with a particular expander-based structure. This simulation is more efficient than all deterministic simulations previously known both with respect to time and space. In the case where $m/n$ is polylogarithmic in $n$, the worst-case time to simulate a single PRAM step is at most $O$(log $n$ log log $n$) which is within a factor of $O(log log $n$ the diameter of the network. The space requirements for our algorithm are at most $O$($m$(log $(m/n))^{3})$ overall. The simulation may also be adapted to run on to an $n$-processor augmented mesh-of-trees architecture with a running time of $O$ (log $n$ log log $n$ (log log $(m/n)$ - log log log $n$) + log $(m/n))$ Overall, these results suggest that, in principle at least, it is feasible to provide the abstraction of a shared memory on distributed models of parallel computation with only modest degradation in performance in the worst case.", } @TECHREPORT{Lin9002:Reducing, AUTHOR="Y. Lin and E. D. Lazowska", TITLE="Reducing the State Saving Overhead For Time Warp Parallel Simulation", INSTITUTION="Department of Computer Science and Engineering", ADDRESS="University of Washington", NUMBER="90-02-03", MONTH=feb, YEAR=1990, } @TECHREPORT{Lin9002:Processor, AUTHOR="Y. Lin and E. D. Lazowska", TITLE="Processor Scheduling for Time Warp Parallel Simulation", INSTITUTION="Department of Computer Science and Engineering", ADDRESS="University of Washington", NUMBER="90-03-03", MONTH=feb, YEAR=1990, } @TECHREPORT{Laru9002:Abstract, AUTHOR="J. R. Larus", TITLE="Abstract Execution: A Technique for Efficiently Tracing Programs", INSTITUTION="Univ. of Wisconsin-Madison", NUMBER="CS Tech. Report \#91", MONTH=feb, YEAR=1990, } @ARTICLE{Mays9002:Applications, AUTHOR="Robert G. Mays", TITLE="Applications of Defect Prevention in Software Development", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="164-168", MONTH=feb, YEAR=1990, REFERENCES=4, ABSTRACT="The Defect Prevention Process consists of 1) causal analysis meetings to identify the root causes of erros and suggest preventive actions, 2) an action team that implements the preventive actions, 3) stage kickoff meetings to provide feedback to developers at each stage of the development cycle, and 4) data collection and tracking of associated data. Typical preventive actions include process changes (including common error lists, checklists, and other forms of feedback), new or improved tools, improved education, product changes, and improved communications among developers. The Defect Prevention Process has been applied successfully in a number of software development organizations within IBM, with significant reductions in errors. This paper describes how this process has been applied to different types of organizations involved in software development including: design, development, test, information development, service, planning and requirements, and human factors. For each type of organization, different processes, tools, and methodologies are used. The Defect Prevention Process can be applied to errors arising from each particular process.", } @ARTICLE{Dala9002:Graphical, AUTHOR="Siddhartha R. Dalal and C. L. Mallows", TITLE="Some Graphical Aids for Deciding When to Stop Testing Software", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="169-175", MONTH=feb, YEAR=1990, REFERENCES=6, ABSTRACT="Developers of large software systems must decide how much software should be tested before releasing it. We consider an explicit tradeoff between the costs of testing and releasing. The former may include the opportunity cost of continued testing, and the latter may include the cost of customer dissatisfaction and of fixing faults found in the field. Exact stopping rules were obtained by the authors, in a previous paper [1], under the assumption that the distribution of the fault finding rate is known. Here we consider two important variants where the fault finding distribution is not completely known. They are: i) the distribution is exponential with unknown mean, and ii) the distribution is locally exponential with rate changing smoothly over time. We present new procedures for both cases. In case i) we also show how to incorporate information from related projects and sujective inputs. We propose several new graphical procedures which are easy to implement, and we illustrate these for data from a large telecommunications software system.", } @ARTICLE{Tied9002:Post, AUTHOR="Mark J. Tiedeman", TITLE="Post-Mortems--Methodology and Experiences", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="176-180", MONTH=feb, YEAR=1990, REFERENCES=1, ABSTRACT="This paper presents a methodology for preparing and conducting post-mortems for software development projects. Based on the continuous process improvement concept, post-mortems are systematic reviews of a product's quality and the quality of the associated processes that produce it. Its intent is to learn both what worked well and what could be improved. Three types of post-mortems have evolved, each focusing on particular aspects of the software development process. The Planning Post-Mortem covers requirements specification and work program definition; the Design/Verification Post-Mortem includes design, unit test, system verification, and first office application activities; and the Field Post-Mortem focuses on actual field experience. The post-mortem methodology presented in this paper has been in use for several years, and has been found to be a very effective organizational learning tool and source for many software quality improvement ideas. Specific examples of what has been and can be learned are included. Finally, the evolution of the post-mortem is discussed along with possible metric for evaluating the effectiveness of post-mortems.", } @ARTICLE{Niit9002:Interactive, AUTHOR="Y. Niitsu and Osamu Mizuno", TITLE="Interactive Specification Environment for Communication Service Software", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="181-188", MONTH=feb, YEAR=1990, ABSTRACT="This paper describes an automation environment which produces high-quality high-productivity communication service software (CSS). It is a computer-aided interactive specification environment for CSS (ISE). ISE consists of a CSS specification description system and a prototyping system of a communication node. The specification description system uses a CSS specification description language (newly developed LSDL and CCITT SDL) composed of three steps and a choice of language and graph forms: an intelligent graphic editor which supports LSDL graphic input of CSS specification. The prototyping system controls the switching equipment by a general purpose computer in command form, using a concurrent process environment for control software to switching equipment and a service control process which runs based on one-call-through. The time taken for CSS specification description is reduced 30 to 70 percent of the time taken for C language description. By introducing ISE into CSS development, the reduction in total CSS development time is expected to be about 15 percent.", } @ARTICLE{Ng9002:Supporting, AUTHOR="P. Ng", TITLE="Supporting Service Development for Intelligent Networks", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="189-195", MONTH=feb, YEAR=1990, REFERENCES=31, ABSTRACT="The complexity of service development for Intelligent Networks will remain high despite the introduction of reusable Functional Components for service composition. This is mainly due to the flexibility of service design made possible by such networks. As a result, the Operating Telephone Companies will need an effective service development environment to take full advantage of Intelligent Network service processing. This paper examines the development support required to assure the quality of Intelligent Network service specifications; and assesses the current state of enabling technologies, which include the technologies for formal specification, software reuse, rapid prototyping, performance evaluation, behavioral property verification, as well as feature interaction analysis and arbitration.", } @ARTICLE{Chri9002:Statistical, AUTHOR="D. A. Christenson and Shan-shan Huang and Alfred J. Lamperez", TITLE="Statistical Quality Control Applied to Code Inspections", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="196-200", MONTH=feb, YEAR=1990, REFERENCES=6, ABSTRACT="Code inspections have been used on the 5ESS Switch project since 1983. Beginning with a training program for all the developers involved in the project, code inspections have been improved with each new 5ESS Switch generic. The improvement in code inspections has been the result of hard work and innovation on the part of the 5ESS Switch software developers, and the use of some ``Statistical Quality Control'' (SQC) techniques. Variations on a standard SQC technique, the control chart, have been used to track the metrics indicative of the effectiveness of code inspections. Parameters used in the computation of these metrics include the preparation effort, inspection time, number of inspectors, the size of the inspected unit of code, and the number of errors found at the inspection. The exact form that these ``control charts'' have taken has evolved and improved with experience.", } @ARTICLE{Toya9002:High, AUTHOR="Masahiro Toyama and Mamoru Sugawara and Kohzoh. Nakamura", TITLE="High-Quality Software Development {System--AYUMI}", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="201-209", MONTH=feb, YEAR=1990, REFERENCES=2, ABSTRACT="AYUMI is what we call the mechanism that improves software quality and productivity by which the development process is refined. We have developed a series of methods which cpan activities from data evaluation to the feedback of findings. This methodology has approximately 100 evaluation items, including both quantitative and qualitative types. These items are the result of valuable experience and knowledge acquired over many years by our projects in connection with software development management. And these items are categorized into about 40 groups and scored on a scale from one to five. The evaluation results are compiled into tables and reported to the project team. Work in the field is also monitored, and feedback is made to improve the development process. At present, the AYUMI system is operating successfully throughout communication software development. We will explain how the AYUMI system operates, using our work with software houses as an example of some possible applications.", } @ARTICLE{Hude9002:Measurement, AUTHOR="J. Hudepohl", TITLE="Measurement of Software Service Quality for Large Telecommunications Systems", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="210-218", MONTH=feb, YEAR=1990, REFERENCES=20, ABSTRACT="There is a great and increasing need to understand post-development software quality from the customer perspective. Measurement concepts from the service quality field are integrated into this understanding to arrive at a new measurement perspective--``software service quality.'' Attention is given to software service quality measurement in the telecommunications switching environment. Environment dynamics and the composition of customer satisfaction are explained. Measurements are made at gaps in the software delivery-process and management is responsible fo the success of the measurement process. Software-service quality measurement can be a strategic tool that can help increase a supplier's competitiveness.", } @ARTICLE{Eric9002:View, AUTHOR="R. L. Erickson and Dileep R. Saxena and Gary Brush", TITLE="A View of Reliability and Quality Measurements for Telecommunications Systems", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="219-223", MONTH=feb, YEAR=1990, REFERENCES=6, ABSTRACT="Measurement of system reliability and quality (R\&Q) is of great interest to developers and customers of telecommunications products. The telecommunications industry as a whole is striving toward improved system R\&Q, especially software quality, as the amount of software deployed and the associated system functionality continue to increase rapidly. A company providing telecommunications services needs to know and understand better the R\&Q of products used in the provision of those services. Measurement is necessary to understand not only what the product R\&Q is today and what it has been, but where it is headed. Motivating R\&Q improvement is the ultimate goal. This paper presents a customer (telephone company) oriented view of R\&Q measurements for telecommunications systems based on Bellcore's experience and work in this area.", } @ARTICLE{Stoc9002:Framework, AUTHOR="Sinclair Guillaume Stockman and Alan Richard Todd and Gerald Anthony Robinson", TITLE="A Framework for Software Quality Measurement", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="224-233", MONTH=feb, YEAR=1990, REFERENCES=33, ABSTRACT="This paper presents a framework for the measurement of software quality. It proposes a quality model as a framework which should facilitate the evolution of theoretically based systems of measurement for the processes and products of the software development lifecycle. Historically, the measurement of software has acquired the status of a black art. Many of the metrics in use today are based on ill-conceived ideas and have not been subjected to systematic validation. Consequently, even though they are widely used to predict aspects of quality such as cost, and to analyze projects from a quality perspective, they have added little to our understanding of the development process and have not led to significant quality improvements. This paper will start by defining ``measurement'' and ``quality measurement,'' and will present a model for software quality measurement. This model will be used to explore several fundamental concepts, and used as a framework for the development of a set of software equality metrics. The paper will then move on to propose how the model can be developed through experimental work and by developing current and potential applications of the model in its immature state. These include Process Optimization, Quality Specification, End Prodct Control, Intermediate Producer Quality control, and the Prediction of Software Quality. The paper will conclude with a discussion of current issues and future trends in this area. Topics covered will include education, the evolution of standards for data definition, and tool support.", } @ARTICLE{Gall9002:Measuring, AUTHOR="Gilbert Le Gall and Marie-Françoise Adam and Henri Derriennic and Bernard Moreau and Nicole Valette", TITLE="Studies on Measuring Software", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="234-246", MONTH=feb, YEAR=1990, REFERENCES=22, ABSTRACT="At this time, software quality is evaluated a posteriori during its use and maintenance phases. The CNET has developed a quality control workshop prototype based on a quantitative approach, which is operational from the validation phase. Several telecommunications software systems were analyzed, particularly those areas pertaining to complexity and reliability. This paper describes the workshop: the methods used to collect, handle, and analyze data, as well as the tools employed. The results allow evaluation of tool usefulness, pertinence of metrics, and validation of the reliability model. The research carried out will lead to the application and evaluation of software quality assurance plans, and of opinions concerning validity, efficiency, and costs.", } @ARTICLE{Ever9002:Software, AUTHOR="William W. Everett", TITLE="Software Reliability Measurement", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="247-252", MONTH=feb, YEAR=1990, REFERENCES=5, ABSTRACT="There has been a good deal of interest recently in the emerging discipline of software reliability engineering. This interest can be attributable to the growing amount that software reliability contributes to the overall reliability of products being built. This paper describes the measurement and analysis aspects of software reliability and is intended to provide software engineers and managers a feeling of where and how software reliability measurement can be applied to their projects. It first provides some background for understanding software reliability management, and then discusses activities associated with measuring and analyzing software reliability in the context of the software product life cycle.", } @ARTICLE{Khos9002:Predicting, AUTHOR="T. M. Khoshgoftaar and John C. Munson", TITLE="Predicting Software Development Errors Using Software Complexity Metrics", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="253-261", MONTH=feb, YEAR=1990, REFERENCES=17, ABSTRACT="Various software metrics have been developed for the purpose of evaluating certain characteristics of the computer programming process. Attempts to use these software metric data have met with questionable success in program development scenarios. Similarly, there are many different models of software reliability. Each of these models fundamentally studies the computer program as a black box. The intrinsic assumption underlying each of the models is that the black box has one or more parameters that are uniquely determined for that black box. Complexity metrics do provide substantial information on the distinguishing differences among the software systems whose reliability is being modeled and may be used in the determination of initial parameter estimates. Many of the existing complexity metrics measure common aspects of program complexity and thus have shared variance. In this paper, we develop predictive models that incorporate a functional relationship of program error measures with software complexity metrics and metrics based on factor analysis of empirical data. Specific techniques for assessing regession models are presented for analyzing these models.", } @ARTICLE{Lenn9002:Software, AUTHOR="Bo Lennselius and Lars Rydström", TITLE="Software Fault Content and Reliability Estimations for Telecommunication Systems", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="262-272", MONTH=feb, YEAR=1990, REFERENCES=20, ABSTRACT="One of the major problems of software engineering is the lack of objective measures of software quality. This paper is concerned with the problem of software fault content and reliability estimations. Estimations that can be used to improve the control of a software project are emphasized. A model of how to estimate the number of software faults is presented, which takes into account both the development process and the developed software product. A model of how to predict, before the testing has started, the occurrences of faults during the testing stage is also presented. These models, together with software reliability growth models, have been evaluated on a number of software projects.", } @ARTICLE{Geor9002:Data, AUTHOR="G. Gentzler and Nelson M. Andrews", TITLE="Data Stability in an Application of a Software Reliability Model", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="273-275", MONTH=feb, YEAR=1990, REFERENCES=5, ABSTRACT="The Goel-Okumoto model of reliability growth is applied to the failure data for a large software development project. This is done by fitting the model parameters to the error counts and test times, which are periodically tabulated. In the early phases of system testing, the problem of inaccurate estimation due to insufficient reliability growth occurs. A simple test is devised to measure the stability of the data with respect to this problem. In practice, such a test on the data can be used to determine when system testing has sufficiently progressed to expect reasonable estimates from reliability growth models.", } @ARTICLE{Chi9002:Optimal, AUTHOR="Dong-Hae Chi and Way Kuo", TITLE="Optimal Design for Software Reliability and Development Cost", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="276-282", MONTH=feb, YEAR=1990, REFERENCES=10, ABSTRACT="A process for reliability-related quality programming is developed to fill existing gaps in software design and development so that a quality programming plan can be achieved. This study investigates the tradeoffs among system reliability improvement, resource consumption, and other relevant constraints through the management phase. A software reliability-to-cost relation is developed both from a software reliability-related cost model and from software redundancy models with common-cause failures. A generic N-component redundancy model is also developed. The software reliability optimization problem can be formulated into a mixed-integer programming problem.", } @ARTICLE{Edel9002:Making, AUTHOR="D. Vera Edelstein and Pasquale Sullo and Lawrence A. Boguchwal", TITLE="Making Software Engineering Happen in a Telecommunications {R\&D} Organization", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="283-290", MONTH=feb, YEAR=1990, REFERENCES=20, ABSTRACT="This paper describes the implementation of a product development process in a new R\&D telecommunications organization that supports software quality and productivity. The significance of an unconventional perspective and actions based on this perspective are discussed. The focus will be on concerns, issues, and strategies to establish a sound framework for integrated hardware/software systems of high quality.", } @ARTICLE{Koon9002:Structural, AUTHOR="Z. Koono and M. Soga", TITLE="Structural Way of Thinking as Applied to Quality Assurance Management", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="291-300", MONTH=feb, YEAR=1990, REFERENCES=9, ABSTRACT="This is a paper describing some major structures for improving the quality of software, and is written for managers in the software field. Defects in software are the result of imperfections in the development process. High quality is achieved through aiming for a better process. This paper introduces structures in the product structure, the product architecture, and the work processes. As people constitute an essential part of the process, it introduces the human error problem and work time constancy. Based on these, structures and general principles for improving quality are explained. Progress is attained by education in the broad sense.", } @ARTICLE{Penc9002:Software, AUTHOR="John L. Pence and Samuel E. Hon I. I. I", TITLE="Software {Surveillance--A} Buyer Quality Assurance Program", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="301-308", MONTH=feb, YEAR=1990, REFERENCES=16, ABSTRACT="Since divestiture from the AT\&T Company in 1984, the responsibility for sustaining high-level software quality and services has become a major challenge for the Bellcore Client Companies (BCC's). Together, the BCC's spend over $1 billion on software purchases annually. The increased usage of software to control telecommunications systems has contributed greatly to this level of software procurement. Additionally, since network operation and support are becoming more dependent on software control, poor quality could adversely affect not only telephone company operations, cost, and revenue, but the effectiveness of services provided to the public. Avoiding these ill effects is a major objective of the BCC's. In 1984, Bellcore Software Quality Assurance Engineering (SQAE) was established to assist clients in assuring the quality of software they purchase. This paper presents Bellcore SQAE's software quality assurance approach and discusses the objectives and accomplishments of the software surveillance program. The objective of this paper is to outline a program which focuses on developing a cooperative relationship between the buyer and supplier to successfully meet some of the challenges that face the BCC's in the 1990's and beyond.", } @ARTICLE{Yu9002:Modeling, AUTHOR="Wei Yu", TITLE="A Modeling Approach to Software Cost Estimation", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="309-314", MONTH=feb, YEAR=1990, REFERENCES=7, ABSTRACT="With software development viewed more as an art than a science, it has been difficult to study the productivity factors which affect software projects, and to accurately predict software development costs. The lack of understanding of software productivity and productivity measurement methods has caused confusion in software cost estimation. In order to improve the quality of a software product, and the productivity of the development process, accurate measurements of development costs and productivity factors are required. To achieve accurate estimates, the software development process used on a software product should be well understood, and the software estimation process should be closely linked to the development process. This paper describes a new software cost estimation modeling process as well as the important productivity factors and the productivity measurement metrics used in the 5ESS project, one of the largest telecommunication projects at AT\&T Bell Laboratories. The model estimation approach has greatly improved the quality of estimates. The study of productivity factors has resulted in some significant productivity and quality improvement processes in the 5ESS development community.", } @ARTICLE{Mand9002:Software, AUTHOR="William A. Mandeville", TITLE="Software Costs of Quality", JOURNAL=ieeejsac, VOLUME=8, NUMBER=2, PAGES="315-318", MONTH=feb, YEAR=1990, ABSTRACT="Our hardware manufacturing cousins have taken advantage of the costs of quality for manufacturing by using it as a lever to get needed prevention resources such as new tools, capital, and training to improve their productivity, quality, and to strategically reduce costs. It is time for the software development community to recognize this powerful quality improvement tool and to take full advantage of it.", } @ARTICLE{Leon9002:ISSCC, AUTHOR="M. Leonard", TITLE="{ISSCC:} Signal-Processing Circuits", JOURNAL="Electronic design", PAGES="101-105", DAYS=22, MONTH=feb, YEAR=1990, KEYWORDS="fast packet switching", ANNOTE="Describes new devices for ISDN and BISDN applications, including a 32-by-32 crosspoint operating at 250 Mbit/s and an ATM subscriber line interface.", } @INPROCEEDINGS{Dixi9003:Variable, AUTHOR="Sudhir Dixit and Peter O'Reilly", TITLE="Variable Bit Rate Packet Video Coding and its Impact on Cell Adaptation Header Structure", BOOKTITLE="Visicom: 3rd International Workshop on Packet Video", ORGANIZATION="IEEE", ADDRESS="Morristown, New Jersey", PAGES="D5", MONTH=mar, YEAR=1990, KEYWORDS="packet video", ANNOTE="presents intra-frame lossless DPCM coder followed by Huffmann encoder; also, inter/intraframe layered DCT FBR/VBR coder. The latter tolerates a random block loss of about 5\% for all but the highest layer.", } @INPROCEEDINGS{Elle9003:Impact, AUTHOR="John C Ellershaw and M. J. Biggar", TITLE="Network Impact on Interworking Packet Video Systems", BOOKTITLE="Visicom: 3rd International Workshop on Packet Video", ORGANIZATION="IEEE", ADDRESS="Morristown, New Jersey", MONTH=mar, YEAR=1990, KEYWORDS="packet video", } @INPROCEEDINGS{Garr9003:Joint, AUTHOR="Mark Garrett and M. Vetterli", TITLE="A Joint Source/Channel Model for Real Time Services on {ATM} Networks", BOOKTITLE="Visicom: 3rd International Workshop on Packet Video", ORGANIZATION="IEEE", ADDRESS="Morristown, New Jersey", MONTH=mar, YEAR=1990, KEYWORDS="packet video", } @INPROCEEDINGS{Houd9003:Transfer, AUTHOR="Thierry Houdoin and Jean-Yves Cochennec", TITLE="The Transfer of Variable Bitrates in {ATM} Networks: the Need for a Comprehensive Approach", BOOKTITLE="Visicom: 3rd International Workshop on Packet Video", ORGANIZATION="IEEE", ADDRESS="Morristown, New Jersey", MONTH=mar, YEAR=1990, KEYWORDS="packet video", } @INPROCEEDINGS{Kawa9003:Quality, AUTHOR="S. Kawaguchi and Mitsuo Tsujikado and Yutaka Ueda and K. Hosoda", TITLE="Quality Controlled Variable Rate Coding Based on Constant Error Criterion", BOOKTITLE="Visicom: 3rd International Workshop on Packet Video", ORGANIZATION="IEEE", ADDRESS="Morristown, New Jersey", PAGES="C4", MONTH=mar, YEAR=1990, KEYWORDS="packet video; H.261; ATM; DCT; DPCM; image coding; VBR; cell loss", ABSTRACT="In this paper, we describe the structure of a variable rate coding which maintains a constant reconstruction image quality in motion image transmission in ATM (asynchronous transfer mode) networks, and compensation of cell loss in image signals. This coding scheme is based on motion-compensated interframe/intraframe predictive DPCM and discrete cosine transform (DCT) according to CCITT recommendation H.261, and in order to improve reconstructed image quality, we controlled the quantization noise of the DCT transformation coefficients. We also assumed priority control as measures against cell loss. A lost quantized DCT coefficient block is restored by interpolation using the several adjacent blocks in the DCT coefficient region. As a result of a computer simulation, we found that block distortion of the reconstructed image was reduced, and that there was no appreciable deterioration through loss of image information due to cell loss.", ANNOTE="CCITT H.261 coder (around 40 Mb/s); high priority for quantizer information, motion vector, intraframe prediction values; low priority for quantized DCT coefficients. Cell loss rates of 1\% not easily detectable.", } @INPROCEEDINGS{Lee9003:Cell, AUTHOR="Pil Joong Lee and Shiang-feng Lee and R. Ansari", TITLE="Cell Loss Detection and Recovery in Variable Rate Video", BOOKTITLE="Visicom: 3rd International Workshop on Packet Video", ORGANIZATION="IEEE", ADDRESS="Morristown, New Jersey", PAGES="D3", MONTH=mar, YEAR=1990, KEYWORDS="packet video", ANNOTE="Reed-Salomon error correction coding (compact disc-type) applied to packet video. Investigates cell loss rates of $10^{-10}$ to $10^{-6}$.", } @ARTICLE{Lidi9003:Data, AUTHOR="W. P. Lidinsky", TITLE="Data Communications Needs", JOURNAL=ieeenet, VOLUME=4, NUMBER=2, PAGES="28-33", MONTH=mar, YEAR=1990, REFERENCES=8, KEYWORDS="BISDN", ABSTRACT="The telecommunications community often considers data needs as being satisfied by virtual circuits based upon connections. Circuit-switched 56-kb/s data service is a case in point. This is reasonable from an evolutionary or integrated services perspective. Furthermore, until recently this view has been supported by some data people as well. Terminal-timesharing, transaction- based and mainframe-to-mainframe computing systems can be served by such networks. However, the computing community has recently evolved an additional computer systems paradigm often referred to as the ''client-server'' model. Fueled by the explosive growth of both personal computers and Local Area Networks (LANs), computing systems based on this model are flourishing. The data communications needs of these systems are currently being satisfied by low-delay, connectionless networks with broadcast capabilities. Such networks provide services that are substantially different from virtual circuit networks.", } @ARTICLE{Paru9003:Framework, AUTHOR="G. M. Parulkar", TITLE="Towards a Framework for High-Speed Communication in a Heterogeneous Networking Environment", JOURNAL=ieeenet, VOLUME=4, NUMBER=2, PAGES="19-27", MONTH=mar, YEAR=1990, REFERENCES=20, KEYWORDS="BISDN; high-speed networks", ABSTRACT="In this article we attempt to formulate a framework for high speed communication in an environment comprising a mix of subnetworks with widely varying characteristics. Recent work on high-speed wide area packet switching systems is expected to lead to the development of large public networks capable of supporting applications ranging from low-speed data to voice, high-speed data and video. If such networks are to realize their full potential, they must be designed to operate in an environment that includes networks with widely varying characteristics. Since the early '70s, much of the work on computer communication has been directed toward the development of protocols that allow interworking among computers, operating systems and communication subnetworks of different types. These efforts have culminated in the Advanced Research Projects Agency (ARPA) Internet Protocol Suite, which has introduced a number of ideas of fundamental importance.", } @ARTICLE{Patt9003:Three, AUTHOR="John F. Patterson", TITLE="Three Keys to the Broadband Future: A View of Applications", JOURNAL=ieeenet, VOLUME=4, NUMBER=2, PAGES="41-47", MONTH=mar, YEAR=1990, REFERENCES=17, KEYWORDS="BISDN; applications; high-speed networks", ABSTRACT="At Bellcore and other telecommunications research centers around the world a public switched broadband network is assumed to be an accurate vision of the future. As one engineer put is, ''we know how to do it, so we will do it.'' It is hard to fault engineers for their enthusiasm and optimism. Indeed, in the long run, they are undoubtedly correct; in the year 2050, say, a ubiquitous switched broadband network probably will exist. However, for decision makers who must gamble on broadband today, and who have watched many of the promises offered by Integrated Services Digital Network (ISDN) evaporate, this assurance offers little comfort.", } @INPROCEEDINGS{Thom9003:Influence, AUTHOR="V. T. Thomas and J. de la", TITLE="Influence of Cell losses on the Performance of a {TV} Coding Algorithm", BOOKTITLE="Visicom: 3rd International Workshop on Packet Video", ORGANIZATION="IEEE", ADDRESS="Morristown, New Jersey", PAGES="E3", MONTH=mar, YEAR=1990, KEYWORDS="packet video", ANNOTE="protection mechanism for hybrid DCT coding at 34 Mb/s. Cell losses of $10^{-4}$ are acceptable; also investigates up to $10^{-2}$.", } @ARTICLE{Wrig9003:Telecommunications, AUTHOR="D. Wright", TITLE="Telecommunications Applications of the 1990s and their Transport Requirements", JOURNAL=ieeenet, VOLUME=4, NUMBER=2, PAGES="34-40", MONTH=mar, YEAR=1990, REFERENCES=21, KEYWORDS="BISDN; high-speed network", ABSTRACT="Enormous strides have been made in recent years in the development of transmission and switching technology. Cost reductions and capacity increases have combined to produce fiber optic systems currently capable of 1,000 Gb/s km using 1.5 $\mu$ wave division multiplexing with attenuation approaching its theoretical minimum, delivered to customers at prices of \$240 per km. Exploratory designs for fast packet switches are available with 1000 inputs, each operating at 50 Mb/s, and with 16 inputs, each operating at 1Gb/s.", } @MANUAL{9003:Writing, TITLE="Writing Device Drivers", EDITION="Review A", ORGANIZATION="Sun Microsystems", NUMBER="800-3851-10", MONTH=mar, YEAR=1990, } @INPROCEEDINGS{Casn9003:Conferencing, AUTHOR="Stephen Casner and Karen Seo and Winston Edmond and C. Topolcic", TITLE="N-Way Conferencing with Packet Video", BOOKTITLE="3rd International Workshop on Packet Video", ADDRESS="Morristown, New Jersey", MONTH=mar, YEAR=1990, KEYWORDS="packet video", ABSTRACT="This paper describes a packet video system implementation in which commercial codecs were adapted to exploit the benefit of packet switching while addressing the problems as follows: 1) clock synchronization was obviated by asychronous operation, 2) delay was reduced by bandwidth reservation and fast packet forwarding, 3) packet loss was reduced by bandwidth reservation and forward error correction.", ANNOTE="Describes TWBnet, using BBN dual bus protocol featuring slot reuse, multicasting and bandwidth preallocation.", } @ARTICLE{Naka9003:Variable, AUTHOR="Hiroshi Nakada and K. Sato", TITLE="Variable rate speech coding for asynchronous transfer mode", JOURNAL=ieeecom, VOLUME=38, NUMBER=3, PAGES="277-284", MONTH=mar, YEAR=1990, KEYWORDS="speech coding; VBR; variable-rate codecs; packet voice; ATM; multimedia communication", ABSTRACT="This paper describes a new speech coding and multiplexing scheme matched to the asychronous transfer mode. A block coding technique is employed which is based on a variable rate coding algorithm that makes the most of the burstiness of voice information. The main feature of the scheme is considerable bit rate reduction which is attained by a fairly simple algorithm. It is demonstrated that the proposed algorithm exhibits better quality than that of 32 kb/s ADPCM at a mean bit rate of less than 13 kb/s. The effect of statistical multiplexing is next verified by means of simulation employing long conversational speech samples. Methods for constructing variable and fixed-length frames (units of information multiplexed and transferred in the network) are then proposed. The proposed coding algorithm is shown to be applicable to both variable and fixed length frame strategies.", } @TECHREPORT{ETSI9003:Broadband, AUTHOR="E. T. SI Sub-technical Committee NA5", TITLE="Broadband Networks: Report on {STC} Meeting", INSTITUTION="ETSI", ADDRESS="Rome, Italy", MONTH=mar, YEAR=1990, } @INPROCEEDINGS{Hofm9003:Gesicherte, AUTHOR="R. Hofmann", TITLE="Gesicherte Zeitbezüge beim Monitoring von Multiprozessorsystemen", BOOKTITLE="Architektur von Rechensystemen", ADDRESS="München, Germany", PAGES="389-401", MONTH=mar, YEAR=1990, LANGUAGE="German", REFERENCES=29, KEYWORDS="Multiprocessor system; hardware monitor; hybrid monitor", } @ARTICLE{Cass9003:Distributed, AUTHOR="Christos Cassandras and M. Vasmi Abidi and Donald F. Towsley", TITLE="Distributed Routing with On-Line Marginal Delay Estimation", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=3, PAGES="348-359", MONTH=mar, YEAR=1990, KEYWORDS="packet switching; distributed routing", ABSTRACT="Most optimal routing algorithms for Packet-switched networks require information about the sensitivity of the performance measure with respect to link flows. This iformations is generally difficult to obtain for real-time applications, due to the absence of closed-form expressions for performance as a function of flowsin most interesting cases, standart assumptions do not hold. In this paper, we present a procedure for estmating marginal packet", } @ARTICLE{Glaz9003:New, AUTHOR="D. Glazer and C. Tropper", TITLE="A New Metric for Dynamic Routing Algorithms", JOURNAL=ieeecom, VOLUME="COM-38", NUMBER=3, PAGES="360-367", MONTH=mar, YEAR=1990, KEYWORDS="Routing algorithm; dynamic routing", ANNOTE="We present, in this paper, a dynamic routing algorithm which has as its goal the control of congestion in a packet switching network. The algorithm is based in part on the ARPANET SPF algorithm. However, instead of employing a delay metric, we make use of a combination of link and buffer utilizations. A detailed simulation model of the ARPANET was constructed to compare the performance of the congestion-based algorithm to the traditional SPF.", } @INPROCEEDINGS{Kapp9003:Commercial, AUTHOR="K. G. Kappel", TITLE="Commercial Development of {OSI} Management", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @INPROCEEDINGS{Bosc9003:Management, AUTHOR="M. Bosch and George Rossler and Werner Schollenberger", TITLE="Network Management in heterogeneous Networks for Factory Automation", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @INPROCEEDINGS{Lund9003:Using, AUTHOR="David Lundberg", TITLE="Using Knowledged-based Systems in Telecommunication Management Networks", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @INPROCEEDINGS{Taro9003:Support, AUTHOR="L. Tarouco", TITLE="Support of Network Management", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @INPROCEEDINGS{Poli9003:Knowledge, AUTHOR="Peter Politakis", TITLE="Knowledge-based Applications and Tools in Telecommunications", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @INPROCEEDINGS{Skub9003:Service, AUTHOR="Janez Skubic", TITLE="Service Management Architecture", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @INPROCEEDINGS{Mart9003:High, AUTHOR="P. Martini", TITLE="High Speed {LANs} and {MANs;} Protocols and Problems", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="High-Speed Networking", } @INPROCEEDINGS{Skow9003:ATM, AUTHOR="Rune Skow", TITLE="{ATM} - The target solution", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="High-Speed Networking", } @INPROCEEDINGS{Casa9003:Functionality, AUTHOR="Augusto Casaca", TITLE="The Functionality of the {ATM} Adaptation Layer", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="High-Speed Networking", } @INPROCEEDINGS{Sund9003:Subscriber, AUTHOR="Magnar Sunde", TITLE="Is the Subscriber Part of {BISDN} being standardized for {BISDN?}", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="High-Speed Networking", } @INPROCEEDINGS{Libe9003:Metropolitan, AUTHOR="Oyvind Liberg", TITLE="Metropolitan Area Network - Evolution towards {BISDN}", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="High-Speed Networking", } @INPROCEEDINGS{Aamb9003:HYPATIA, AUTHOR="Kolbjoern H. Aamboe and Terje Bakke", TITLE="{HYPATIA} - A proposed Cure for Information Overflow in Electronic Information Delivery Systems", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Electronic Mail", } @INPROCEEDINGS{Well9003:X, AUTHOR="George W. Wells", TITLE="{X.400} Migration Strategies", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Electronic Mail", } @INPROCEEDINGS{Jone9003:Two, AUTHOR="Christine Jones and T. Anwar", TITLE="Two Routing Strategies for land-based mobile Packet Radio Networks", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Packet-Radio Networks", } @INPROCEEDINGS{Lars9003:MOBITEX, AUTHOR="Michael Larsen", TITLE="{MOBITEX} - A system for mobile data communication", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Mobile Communications", } @INPROCEEDINGS{Kubo9003:ISDN, AUTHOR="Teruhiro Kubota", TITLE="An {ISDN} Application for Personal Computer Communication", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="ISDN", } @INPROCEEDINGS{Schi9003:Distributed, AUTHOR="A. Schill", TITLE="Distributed Application Development: Problems and Solutions", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Distributed Systems", } @INPROCEEDINGS{Mean9003:Meta, AUTHOR="B. Meandzija", TITLE="Meta-Communications Methodology Based on the Constraint Satisfaction Paradigm", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Distributed Systems", } @INPROCEEDINGS{Skov9003:Architectural, AUTHOR="Tom Skovgaard", TITLE="Architectural Elements of a {VAN} Service", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Value-Added Networks", } @INPROCEEDINGS{Jako9003:Directory, AUTHOR="K. Jakobs", TITLE="Directory Services for Mobile Communication", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Mobile Communications", } @INPROCEEDINGS{Jaco9003:Multicopy, AUTHOR="Stephan Jacobs and Ulrich Quernheim", TITLE="Multicopy {ARQ} Error Control Techniques for Multipoint Satellite Links", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Flow Control", } @INPROCEEDINGS{Chun9003:Bandwidth, AUTHOR="P. Chung and A. K. Elhakeem", TITLE="A bandwidth reducing Token Ring", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Token Rings", } @INPROCEEDINGS{Hous9003:Interorganizational, AUTHOR="Thomas Housel and Larry Railing", TITLE="An Interorganizational Network Based System", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Integrated Networks", } @INPROCEEDINGS{Schi9003:Intelligent, AUTHOR="Stefan Schill and Marek Ciganik", TITLE="The Intelligent Communications with Information Systems in Computer Network", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Distributed Systems", } @INPROCEEDINGS{Laza9003:Integrated, AUTHOR="D. Lazak", TITLE="Integrated Networks and Their Impact on Infrastructures", BOOKTITLE="3rd International ConferenceInformation Network and Data Communication; INDC-90", PUBLISHER="IFIP", ADDRESS="Lillehammer, Norway", MONTH=mar, YEAR=1990, KEYWORDS="Integrated Networks", } @INPROCEEDINGS{Benn9003:Munin, AUTHOR="John K. Bennett and John. B. Carter and W. Zwaenepoel", TITLE="Munin: Distributed Shared Memory Based on Type-Specific Memory Coherence", BOOKTITLE="2nd ACM SIGPLAN Symposium Principles and Practices of Parallel Programming", ADDRESS="Seattle", MONTH=mar, YEAR=1990, KEYWORDS="Distributed Memory", ABSTRACT="We are currently developing Munin, a system that allows programs written for shared memory multiprocessors to be executed efficiently on distributed memory machines. Thus, Munin overcomes the architectural limitations of shared memory machines, while maintaining their advantages in terms of ease of programming. One of the unique characteristics of Munin is the mechanism by which the shared memory programming model is translated to the distributed memory hardware. This translation is performed by runtime software, with the aid of semantic hints provided by the user. Each shared data object is supported with a memory coherence mechanism appropriate to the manner in which the object is accessed. This paper focuses on Munin's memory coherence mechanisms, and compares our approach to previous work in this area.", } @INPROCEEDINGS{Koel9003:Supporting, AUTHOR="C. Koelbel and P. Mehrotra", TITLE="Supporting Shared Data Structures on Distributed Memory Architectures", BOOKTITLE="2nd ACM SIGPLAN Symposium Principles and Practices of Parallel Programming", ADDRESS="Seattle", MONTH=mar, YEAR=1990, KEYWORDS="Distributed Memory", ABSTRACT="Programming nonshared memory systems is more difficult than programming shared memory systems, since there is no support for shared data structures. Current programming languages for distributed memory architectures force the user to decompose all data structures into separate pieces, with each piece ``owned'' by one of the processors in the machine, and with all communication explicitly specified by low-level message-passing primitives. This paper presents a new programming environment for distributed memory architectures, providing a global name space and allowing direct access to remote parts of data values. We describe the analysis and program transformations required to implement this environment, and present the efficiency of the resulting code on the NCUBE/7 and IPSC/2 hypercubes.", } @INPROCEEDINGS{Barb9003:Language, AUTHOR="M. R. Barbacci and J. M. Wing", TITLE="A Language for Distributed Applications", BOOKTITLE="International ConferenceComputer Languages", PUBLISHER="IEEE Computer Society", ADDRESS="New Orleans", MONTH=mar, YEAR=1990, KEYWORDS="Distributed Programming", ABSTRACT="Durra is a language designed to support the development of distributed applications consisting of multiple, concurrent, large-grained tasks executing in a heterogeneous network. Users of networks of heterogeneous processors are concerned with allocating specialized resources to tasks of medium to large size. They need to create processes, which are instances of tasks, allocate these processes to processors, and specify the communication patterns between processes. Such activities constitute application-level programming, to distinguish them from the activities leading to the development of the component tasks. An application-level program is written in Durra as a set of task descriptions and type declarations that prescribes a way to manage the resources of a heterogeneous machine network. The application describes the tasks to be instantiated and executed as concurrent processes, the types of data to be exchanged by the processes, and the intermediate queues required to store the data as they move from producer to consumer processes. The application-level programming paradigm fits very naturally a top-down, incremental method of software development. Although we don't claim to have solved all problems or identified all the necessary tools, we would like to suggest that a language like Durra would be of great value in the development of large, distributed systems.", } @INPROCEEDINGS{Jaza9003:FLAME, AUTHOR="M. Jazayeri and F. de Paoli", TITLE="{FLAME:} A Language for Distributed Programming", BOOKTITLE="International ConferenceComputer Languages", PUBLISHER="IEEE Computer Society", ADDRESS="New Orleans", MONTH=mar, YEAR=1990, KEYWORDS="Distributed Programming", } @INPROCEEDINGS{Bal9003:Experience, AUTHOR="Henri E. Bal and M. F. Kasahoek and A. S. Tanenbaum", TITLE="Experience with Distributed Programming in {ORCO}", BOOKTITLE="International ConferenceComputer Languages", PUBLISHER="IEEE Computer Society", ADDRESS="New Orleans", MONTH=mar, YEAR=1990, KEYWORDS="Distributed Programming", } @INPROCEEDINGS{Clam9003:Reliable, AUTHOR="S. M. Clamen and L. D. Leibengood and S. M. Nettles and J. M. Wing", TITLE="Reliable Distributed Computing with Avalon/Common Lisp", BOOKTITLE="International ConferenceComputer Languages", PUBLISHER="IEEE Computer Society", ADDRESS="New Orleans", MONTH=mar, YEAR=1990, KEYWORDS="Distributed Programming", ABSTRACT="Avalon is a set of linguistic constructs designed to give programmers explicit control over transaction-based processing of atomic objects for fault-tolerant applications. These constructs, designed as extensions to familiar programming languages such as C++ and Common Lisp, are tailored for each base language so the syntax and spirit of each language are maintained. We present here an overview of these novel aspects of Avalon/Common Lisp: (1) support for remote evaluation through a new evaluator data type; (2) a generalization of the traditional client/server model of computation, allowing clients to extend server interfaces and server writers to hide aspects of distribution, such as caching, from clients; (3) support for failure atomicity through automatic commit and abort processing of transactions; and (4) support for persistence through automatic crash recovery of atomic data. These capabilities provide programmers with the flexibility to exploit the semantics of an application to enhance its reliability and efficiency. Avalon/Common Lisp runs on IBM RT's on the Mach operating system. Though the design of Avalon/Common Lisp exploits some of the features of Common Lisp, e.g., its packaging mechanism, all of the constructs are applicable to any Lisp-like language.", } @TECHREPORT{Kill9003:Implementing, AUTHOR="S. E. Kille", TITLE="Implementing The Directory", TYPE="Technical Report", INSTITUTION="University College London", NUMBER="RN/90/12", MONTH=mar, YEAR=1990, KEYWORDS="Directory Services", } @TECHREPORT{Refe9003:Message, AUTHOR="A. N. Refenes", TITLE="Message passing via singly-buffered channels: an efficient and flexible communications control mechanism", TYPE="Technical Report", INSTITUTION="University College London", NUMBER="RN/90/19", NOTE="also in EUROMICRO-90, 16th International Symposium on Microprogramming and Microprocessing, 27-30 August 1990, Amsterdam.", MONTH=mar, YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Caru9003:Management, AUTHOR="Richard E. Caruso", TITLE="Network Management: A Tutorial Overview", JOURNAL=ieeecm, VOLUME=28, NUMBER=3, PAGES="20-25", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @ARTICLE{Mali9003:Management, AUTHOR="Ashok K. Malik", TITLE="Network Management and Control Systems and Strategic Issues", JOURNAL=ieeecm, VOLUME=28, NUMBER=3, PAGES="26-29", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @ARTICLE{Fris9003:Logged, AUTHOR="I. T. Frisch", TITLE="Who Logged Out My Terminal", JOURNAL=ieeecm, VOLUME=28, NUMBER=3, PAGES=30, MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @ARTICLE{Bass9003:Customer, AUTHOR="Bruce Bassett and Frederick P. Heinrich and Diana F. Kuhl and Ali Shadman", TITLE="Customer Network Management: A Service Provider's View", JOURNAL=ieeecm, VOLUME=28, NUMBER=3, PAGES="31-30", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @ARTICLE{Yosh9003:Customer, AUTHOR="M. Yoshida and Makoto Kobayashi and Yaruo Yamaguchi", TITLE="Customer Control of Network Management from the Service Provider's Perspective", JOURNAL=ieeecm, VOLUME=28, NUMBER=3, PAGES="35-40", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @ARTICLE{Gilb9003:Managing, AUTHOR="William E. Gilbert", TITLE="Managing Networks in a Multi-Vendor Environment", JOURNAL=ieeecm, VOLUME=28, NUMBER=3, PAGES="41-60", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @ARTICLE{Suga9003:OSI, AUTHOR="Ian Sugarbroad", TITLE="An {OSI-Based} Interoperability Architecture for Managing Hybrid Networks", JOURNAL=ieeecm, VOLUME=28, NUMBER=3, PAGES="61-69", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @ARTICLE{Camp9003:IBM, AUTHOR="R. Campbell and Bob Howard and John Lamb and J. C. Stevenson and Amy Tennant", TITLE="{IBM's} Network Management Approach", JOURNAL=ieeecm, VOLUME=28, NUMBER=3, PAGES="70-75", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @ARTICLE{Doll9003:Future, AUTHOR="D. R. Doll", TITLE="The Future of Customer Control", JOURNAL=ieeecm, VOLUME=28, NUMBER=3, PAGES="76-80", MONTH=mar, YEAR=1990, KEYWORDS="Network Management", } @ARTICLE{Gran9003:Cost, AUTHOR="D. Granot and M. Hojati", TITLE="On Cost Allocation in Computer Networks", JOURNAL="Networks - an international journal", VOLUME=20, NUMBER=2, PAGES="209-230", MONTH=mar, YEAR=1990, KEYWORDS="Cost Allocation", } @ARTICLE{Coch9003:AUTOREC, AUTHOR="Teresa Cochran and J. M. Mellichamp", TITLE="{AUTOREC:} An Automated Error Recovery System for Network Management", JOURNAL=ieeenet, VOLUME=4, NUMBER=2, PAGES="14-18", MONTH=mar, YEAR=1990, REFERENCES=4, KEYWORDS="Network Management", ABSTRACT="Many large organizations are involved with communication networks either as users of public networks or as operators of their own private networks. Thus, the management of communications networks has become an important issue in the communication industry; there is great interest in and considerable pressure for development of techniques and strategies to effectively manage complex networks.", } @ARTICLE{Chan9003:Message, AUTHOR="S. Chandrasekaran and S. Venkatesan", TITLE="A Message-Optimal Algorithm for Distributed Termination Detection", JOURNAL=jpdc, VOLUME=8, NUMBER=3, PAGES="245-252", MONTH=mar, YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Kama9003:Utilizing, AUTHOR="A. E. Kamal and V. C. Hamacher", TITLE="Utilizing Bandwidth Sharing in the Slotted Ring", JOURNAL=ieeetc, VOLUME=39, NUMBER=3, PAGES="298-299", MONTH=mar, YEAR=1990, } @ARTICLE{Yoon9003:Multibuffered, AUTHOR="H. Yoon and K. Y. Lee and Minkui Liu", TITLE="Performance Analysis of Multibuffered Packet-Switching Networks in Multiprocessor Systems", JOURNAL=ieeetc, VOLUME=39, NUMBER=3, PAGES="319-327", MONTH=mar, YEAR=1990, } @ARTICLE{Saty9003:Parallel, AUTHOR="M. Satyanarayanan and E. H. Siegal", TITLE="Parallel Communication in a Large Distributed Environment", JOURNAL=ieeetc, VOLUME=39, NUMBER=3, PAGES="328-348", MONTH=mar, YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Beck9003:Case, AUTHOR="A. Becker", TITLE="Design Case Study: Private Eye", JOURNAL="Information Display", VOLUME=6, NUMBER=3, PAGES=8, MONTH=mar, YEAR=1990, } @TECHREPORT{Pfle9003:Comparison, AUTHOR="C. P. Pfleeger", TITLE="Comparison of Trusted Systems Evaluation Criteria of the {U.S.,} Germany, and Britain", INSTITUTION="Trusted Information Systems, Inc.", NUMBER=309, MONTH=mar, YEAR=1990, } @PHDTHESIS{Bann9003:Wavelength, AUTHOR="J. Bannister", TITLE="The Wavelength-Division Optical Network: Architectures, Topologies, and Protocols", SCHOOL="Computer Science Department, University of California", ADDRESS="Los Angeles, California", MONTH=mar, YEAR=1990, } @TECHREPORT{Nico9003:Bounds, AUTHOR="D. M. Nicol", TITLE="Performance Bounds on Parallel Self-initiating Discrete-Event Simulations", INSTITUTION="Institute for Computer Applications in Science and Engineering(ICASE)", NUMBER="90-21", MONTH=mar, YEAR=1990, } @ARTICLE{Hass9003:Starburst, AUTHOR="L. Hass and C. E. W. and L. F. G. and McPherson J. and Wilms P. and L. F. G. and Lindsay B. and P. R. H.", TITLE="Starburst mid-flight: as the dust clears", JOURNAL=tdke, VOLUME=2, NUMBER=1, MONTH=mar, YEAR=1990, } @ARTICLE{Kim9003:Architecture, AUTHOR="W. Kim and J. Garza and N. Ballou and D. Woelk", TITLE="Architecture of the {ORION} Next-Generation Database System", JOURNAL=ieeekde, VOLUME=2, NUMBER=1, PAGES="109-124", MONTH=mar, YEAR=1990, } @TECHREPORT{McKa9003:Nauty, AUTHOR="Brendan D. McKay", TITLE="nauty User's Guide (version 1.5)", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-90-02", MONTH=mar, YEAR=1990, } @INPROCEEDINGS{Asog9003:Computer, AUTHOR="M. Asogawa and A. Shiramizu and H. Kubo", TITLE="A Computer System Performance Analysis Expert System {(EXPERFORM)}", BOOKTITLE="9th Annual International Phoenix Conference on Computers and Communications", PAGES="758-765", MONTH=mar, YEAR=1990, KEYWORDS="Performance evaluation; expert system", } @INPROCEEDINGS{Bach9003:Network, AUTHOR="D. W. Bachmann and M. Segal and M. M. Srinivasan and T. J. Teorey", TITLE="The Network Modeling Tool: A Design Aid for Large-Scale Campus Networks", BOOKTITLE="9th Annual International Phoenix Conference on Computers and Communications", PAGES="560-567", MONTH=mar, YEAR=1990, KEYWORDS="Network; modeling; tool; large network; network design", } @ARTICLE{Chai9003:Random, AUTHOR="G. J. Chaitin", TITLE="A Random Walk in Arithmetic", JOURNAL="New Scientist", PAGES="44-46", MONTH=mar, YEAR=1990, KEYWORDS="Random Walk; Arithmetic", } @INPROCEEDINGS{Davi9003:DQDB, AUTHOR="P. Davids and P. Martini", TITLE="Performance Analysis of {DQDB}", BOOKTITLE="9th Annual International Phoenix Conference on Computers and Communications", PAGES="548-555", MONTH=mar, YEAR=1990, KEYWORDS="DQDB; man", } @INPROCEEDINGS{Huan9003:Access, AUTHOR="E. Y. Huang and L. Merakos", TITLE="On the Access Fairness of the {DQDB} {MAN} Protocol", BOOKTITLE="9th Annual International Phoenix Conference on Computers and Communications", PAGES="556-559", MONTH=mar, YEAR=1990, KEYWORDS="man; DQDB", } @INPROCEEDINGS{Meng9003:Delay, AUTHOR="X. Meng and R. E. Kinicki and Timothy A. Gonsalves", TITLE="Delay Analysis of a Metropolitan Area Network", BOOKTITLE="9th Annual International Phoenix Conference on Computers and Communications", PAGES="568-574", MONTH=mar, YEAR=1990, KEYWORDS="man", } @INPROCEEDINGS{Perr9003:LAN, AUTHOR="R. Perry", TITLE="{LAN/MAN} Interworking in the {802.6/SMDS} Environment", BOOKTITLE="9th Annual International Phoenix Conference on Computers and Communications", PAGES="639-648", MONTH=mar, YEAR=1990, KEYWORDS="LAN; man", } @INPROCEEDINGS{Wong9003:Random, AUTHOR="P.-C. Wong", TITLE="Random Number Generation Without Multiplication", BOOKTITLE="9th Annual International Phoenix Conference on Computers and Communications", PAGES="217-221", MONTH=mar, YEAR=1990, KEYWORDS="random number", } @INPROCEEDINGS{Lauw9003:Replicated, AUTHOR="J. Chris Lauwers and T. A. Joseph and K. A. Lantz and Allyn Romanow", TITLE="Replicated Architectures for Shared Window Systems: A Critique", BOOKTITLE="Conference on Office Information Systems", PAGES="249-260", MONTH=mar, YEAR=1990, REFERENCES=26, KEYWORDS="collaboration; application sharing", ABSTRACT="Replicating applications in a shared window environment can significantly improve the performance of the resulting system. Compared to a completely centralized approach, a replicated architecture offers superior response time and reduces network load. To date, however, these advantages have been overshadowed by the equally significant synchronization problems associated with replication. In this paper we document these problems and show that the most frequent synchronization problems can be solved without changing existing software. We further indicate how some of the limitations of the resulting system can be removed by making applications or system servers collaboration-aware. Finally, we point out where general system support is needed to address the remaining deficiencies.", } @INPROCEEDINGS{Brad9004:Error, AUTHOR="T. T. Bradley and T. Suda", TITLE="Performance of error recovery schemes in a fast packet switching network: Simulation study", BOOKTITLE=icc, ADDRESS="Atlanta, Georgia", PAGES="483-488 (308.2)", MONTH=apr, YEAR=1990, REFERENCES=9, KEYWORDS="ATM; end-to-end error recovery; simulation; network delay; congestion control", ABSTRACT="The authors present the results of a simulation study exploring the performance of various error-control schemes in a fast packet-switching network. Three of the most popular error-control schemes are examined: end-to-end, link-by-link, and a combined link/edge scheme. The results of the simulation study suggest that the end-to-end error-control scheme provides superior performance for fast packet-switching networks in real-world environments. In fact, when high-speed, low-error-rate transmission media is utilized for network implementation, the end-to-end error-control scheme provides lower network delays for almost all traffic intensities.", } @INPROCEEDINGS{Cido9004:Control, AUTHOR="I. Cidon and I. Gopal", TITLE="Control Mechanisms for High-Speed Networks", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Atlanta, Georgia", PAGES="259-263", MONTH=apr, YEAR=1990, KEYWORDS="congestion control; input throttle; call setup; routing", ANNOTE="PARIS network", } @ARTICLE{Ferr9004:Scheme, AUTHOR="D. Ferrari and Dinesh Verma", TITLE="A Scheme for Real-Time Channel Establishment in Wide-Area Networks", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="368-379", MONTH=apr, YEAR=1990, REFERENCES=15, KEYWORDS="congestion control; high-speed networks", ABSTRACT="Mutimedia communication involving digital audio and/or digital video has rather strict delay requirements. A real-time channel is defined in this paper as a simplex connection between a source and a destination characterized by parameters representing the performance requirements of the client. A real-time service is capable of creating real-time channels on demand and guaranteeing their performance. These guarantees often take the form of lower bounds on the bandwidth allocated to a channel and upper bounds on the delays to be experienced by a packet on the channel. In this paper, we study the feasibility of providing real-time services on a packet-switched store-and-forward wide-area network with general topology. We describe a scheme for the establishement of channels with deterministic or statistical delay bounds, and present the results of the simulation experiments we ran to evaluate it. The results are encouraging: our approach satisfies the guarantees even in worst case situations, uses the network's resources to a fair extent, and efficiently handles channels with a variety of offered load and burstiness characteristics. Also, the packet transmission overhead is quite low, and the channel establishment overhead is small enough to be acceptable in most practical cases.", ANNOTE="VC setup for deterministic (absolute upper delay bound) and statistical (upper bound on probability of late arrival) traffic classes. All channels statistically independent and characterized by $x\_{rm ave}$, the maximum average packet interarrival time over an interval $I$, and $x\_{\rm min}$, the minimum packet interarrival time. Shows simulations for multi-node network and four traffic types. [Sc] The authors describe a system for providing real time channels on a packet switched, store and forward network with an arbitrary topology. The real time is a simplex connection between the source and destination set up using parameters representing the performance demanded by the client programs. The system, once a connection has been set up, guarantees that it will meet the desired performance limits (unlike many LANs where no such guarantees can be given). The scheme involves channels with either deterministic or statistical delay bounds and tries to handle network resources fairly. It efficently handles traffic with a wide variety of offered load and burstiness characteristics. It has a small enough overhead for packet transmission and channel establishment to be acceptable in most practical cases. Results of simulations are presented to backup the claims made. [Kn]", } @INPROCEEDINGS{Gole9004:Congestion, AUTHOR="S. Jamaloddin Golestani", TITLE="Congestion-Free Communication in Broadband Packet Networks", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Atlanta, Georgia", PAGES="489-494", MONTH=apr, YEAR=1990, KEYWORDS="congestion control", } @ARTICLE{Hath9004:Overcoming, AUTHOR="W. Hathaway", TITLE="Overcoming network bottlenecks", JOURNAL=unixr, MONTH=apr, YEAR=1990, KEYWORDS="LAN", ABSTRACT="Description of UltraNet", } @INPROCEEDINGS{Kawa9004:Statistical, AUTHOR="M. Kawarazaki and H. Saito and Hiroshi Yamada", TITLE="An Analysis of Statistical Multiplexing in an {ATM} Transport Network", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Atlanta, Georgia", PAGES="478-482", MONTH=apr, YEAR=1990, KEYWORDS="packet voice", ANNOTE="$MMPP/E\_L/1/K$ model for packet voice and video. Output burstiness is not significantly lower than input burstiness for low utilization.", } @ARTICLE{Kim9004:Self, AUTHOR="H. Kim and A. Leon-Garcia", TITLE="A Self-Routing Multistage Switching Network for Broadband {ISDN0}", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="459-466", MONTH=apr, YEAR=1990, REFERENCES=11, KEYWORDS="fast packet switches", ABSTRACT="Many switching networks have been proposed for broadband ISDN [1]. Switching networks which are capable of achieving maximum throughput of 100\% either have large internal speedup [2], [3] or require large amounts of hardware [4], [5]. For example, the input-output difference self-routing network [3] and ATOM switch [2] require large internal speed-up factors. In order to maintain the non-blocking property, the internal speed of an NxN switching network has to be N times higher than the maximum rate of the incoming packets. The internal speed can be reduced by introducing parallel switching planes thereby increasing the hardware complexity. In this paper, we propose a new switching network that approaches a maximum throughput of 100\% as buffering is increased. This self-routing switching network consists of 2x2 switching elements, distributors, and buffers located between stages and in the output ports. The proposed switching network requires speed-up of two. The structure and the operation of the switching network are described and the performance of the switching network is analyzed.", ANNOTE="2-by-2 switching stages with internal speed-up of two. Similar to Batcher-Banyan, but with buffered distribution stages. Input traffic consists of independent, uniform Bernoulli streams.", } @ARTICLE{Kirr9004:Minitel, AUTHOR="Hubert Kirrmann", TITLE="Minitel: The French love affair with telematics", JOURNAL=ieeemicro, VOLUME=10, NUMBER=2, PAGES="88-90", MONTH=apr, YEAR=1990, KEYWORDS="ISDN; Minitel", ANNOTE="System and service description.", } @ARTICLE{Laza9004:Real, AUTHOR="Aurel A. Lazar and G. Pacifici and John S. White", TITLE="Real-Time Traffic Measurements on {MAGNET} {II}", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="467-483", MONTH=apr, YEAR=1990, KEYWORDS="traffic models; high-speed networks", ABSTRACT="Real-time traffic measurements on MAGNET II, an integrated network testbed based on asynchronous time sharing, are reported. The quality of service is evaluated by monitoring the buffer occupancy distribution, the packet time delay distribution, the packet loss, and the gap distribution of the consecutively lost packets. Our experiments show that both time delay and buffer occupancy distributions of multiplexed video sources display a marked bimodal behavior, which does not seem to depend on the buffer size. The reliance of the network designer on traffic sources that do not exhibit substantial correlations can lead to implementations with serious congestion problems. For ATS-based networks with different traffic classes, the impact of a traffic class on the performance of other classes tends to be diminished when compared to single class-based ATM networks.", ANNOTE="Traffic class I: no contention loss, narrow range of delay distribution; class II: small contention loss, wider delay range; class III: no loss after retransmission, with guaranteed average user throughput and maximum average user time delay. Scheduling and buffer allocation is by maximum length movable boundary method. Uses ten 29 Mbit/s four-subband video coder sources transmitting talking head. Statistical approximation with Poisson source, MMPP, on-off source with constant on-rates, simulated video coder shows that only on-off source and simulated video coder yield approximately the same result. Investigates buffer occupancy, delay distribution and gap (blocking/loss) distribution.", URL="ftp://ftp.ctr.columbia.edu/CTR-Research/comet/public/papers/90/LAZ90c.ps.gz", } @ARTICLE{Leun9004:Software, AUTHOR="W.-H. F. Leung and Thomas Baumgartner and Yeou H. Hwang and M. J. Morgan and Shi-Chuan Tu", TITLE="A Software Architecture for Workstations Supporting Multimedia Conferencing in Packet Switching Networks", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="380-390", MONTH=apr, YEAR=1990, REFERENCES=23, KEYWORDS="multimedia; workstation; conferencing", ABSTRACT="In this paper, we describe the software architecture of a multimedia workstation connected to an experimental packet switching network which is capable of switching voice, data, and video simultaneously. The user of a multimedia workstation may engage in several multimedia calls, and each call can use multiple information streams of voice, data, and images. The network interface software in the workstation maintains the temporal relationship among a given call's information streams. For each call, this network interface provides a multiple information channel interface to upper layer software supporting the notion of a mutlimedia virtual circuit. We provide a connector mechanism to control the information exchange among the network interface, the various voice, data and image peripherals and computer programs used in a multimedia applications. In our system, these information sources and sinks share a common abstraction called active devices. The connector and active devices together support a programming paradigm to construct multimedia applications, and they allow existing UNIX programs to be used in a conference. We implemented a nonprocedural language for the user to specify new multimedia applications. The user may use a window-based user interface to manage and invoke multimedia applications. These software components are embedded into the UNIX environment which runs on the workstations.", ANNOTE="Proposes single VC with different channels for components of multimedia call. VC requires most stringent GOS of participating channels.", } @INPROCEEDINGS{Lief9004:Conditional, AUTHOR="Appie de Liefvoort", TITLE="The Conditional and Residual Waiting Time Distributions of the {M/G/1} Queue", BOOKTITLE="Symposium on Applied Computing", ADDRESS="Fayetteville, Arkansas", PAGES="373-380", MONTH=apr, YEAR=1990, KEYWORDS="queueing theory", ABSTRACT="A single-server queuing system with arrivals according to a Poisson process and general service times is considered. The system is assumed to be in steady state. Using linear algebraic techniques only, alternate derivations are given for the moments of the waiting time distributions and the Pollaczek-Khinchine transform equation for this queue. An explicit form is given for the residual response time and conditional waiting times. The first moment and the squared coefficient of variation of these distributions are derived, and lower bounds are given.", } @ARTICLE{Mura9004:Discrete, AUTHOR="M. Murata and Yuji Oie and T. Suda and H. Miyahara", TITLE="Analysis of a Discrete-Time Single-Server Queue with Bursty Inputs for Traffic Control in {ATM} Networks", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="447-458", MONTH=apr, YEAR=1990, KEYWORDS="discrete time queue; high-speed networks", ABSTRACT="Due to the large number of bursty sources that an ATM network is expected to support, controlling network traffic becomes essential in providing a desirable level of network performance to its users. Admission control and traffic smoothing are among the most promising control techniques for an ATM network. This paper analyzes the performance of an ATM network when it is subject to admission control and traffic smoothing. Basically, an ATM switch is modeled as a discrete-time single server queueing system where a new call joins existing calls. Cell arrivals from a new call are assumed to follow a general distribution. It is also assumed that the aggregated arrivals of cells from the existing calls from batch arrivals with a general distribution for the batch size and a geometric distribution for the interarrival times between batches. Both finite and infinite buffer cases are considered. An exact analysis is developed to obtain the waiting time distribution and cell loss probability for a new call and for existing calls. Numerical examples are also shown to investigate how the network performance depends on the statistics of a new call (burstiness, time that a call stays in active or inactive state, etc.) and to demonstrate the effectiveness of admission control and traffic smoothing.", ANNOTE="Batch arrivals with general batch size distribution and geometric interarrival times for batches, joined by $GI/D/1$ stream.", } @INPROCEEDINGS{Srir9004:Dynamic, AUTHOR="K. Sriram", TITLE="Dynamic Bandwidth Allocation and Congestion Control Schemes for Voice and Data Multiplexing in Wideband Packet Technology", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Atlanta, Georgia", PAGES="1003-1009", MONTH=apr, YEAR=1990, KEYWORDS="packet voice; integrated services", ANNOTE="voice and data queued separately and transmitted alternately, with time limits on each queue.", } @ARTICLE{Wood9004:Multimedia, AUTHOR="G. Woodruff and R. Kositpaiboon", TITLE="Multimedia Traffic Management Principles for Guaranteed {ATM} Network Performance", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="437-446", MONTH=apr, YEAR=1990, KEYWORDS="congestion control; ATM; admission control; multimedia communication", ABSTRACT="A broadband multimedia network, such as broadband ISDN (BISDN), will be required to carry the traffic generated by a wide range of services. These services will have very diverse traffic flow characteristics and performance requirements. The asynchronous transfer mode (ATM) is a fixed-length packet transport scheme which can potentially carry this heterogeneous mix of traffic in an integrated and efficient manner by statistically multiplexing bursty traffic flows at the expense of buffering delay and loss. It is critical for the integrity of many multimedia service types that guaranteed performance levels be provided by the transport network through effective and fair traffic control. This paper presents a framework for the specification of ATM performance requirements, and develops several high-level design principles for performance-driven ATM traffic controls based on resource reservation. Simulation results illustrate that to satisfy these performance guarantees, bursty traffic should be statistically multiplexed only if the connection peak rates are low relative to the network link speed, or burst durations are short. A pragmatic traffic management approach is stressed which favors simplicity and robustness in the traffic control design rather than optimizing bandwidth efficiency.", ANNOTE="Simulation of statistical multiplexing of on-off burst sources.", } @INPROCEEDINGS{Vite9004:Broadband, AUTHOR="Michael E. Vitella and Kun I. Park", TITLE="Broadband performance: A services view", BOOKTITLE=icc, ADDRESS="Atlanta, Georgia", VOLUME=4, PAGES="1300-1306 (334.1)", MONTH=apr, YEAR=1990, REFERENCES=13, KEYWORDS="Broadband; performance parameter; service degradation; BISDN", ABSTRACT="The authors present an analysis of several aspects of the physical-and ATM-(asynchronous-transfer-mode-) layer performance needed to support representative broadband services. The functional network architecture evaluated is based on current standards activity regarding the SONET/ATM-based BISDN (broadband integrated services digital network). The analysis of five example services indicates that the limiting performance of the end-to-end transport network may require cell loss rates, due to congestion, of better than $10^{-7}$ for bursty data services and better than $10^{-9}$ for CBO (continuous bit-stream-oriented) services. The limiting end-to-end error performance may need to have a better than $10^{-9}$ BER (bit error rate) to support all of these services. Performance objectives for individual network elements will necessarily be more stringent than the end-to-end numbers.", } @INPROCEEDINGS{Corl9004:BellSouth, AUTHOR="L. T. Corley", TITLE="BellSouth trial of wideband packet technology", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Atlanta, Georgia", VOLUME=3, PAGES="1000-1002 (324.2)", MONTH=apr, YEAR=1990, KEYWORDS="packet voice; speech transmission", ABSTRACT="BellSouth has conducted a trial of the AT\\&T integrated access and cross-connect system (IACS) on the BellSouth corporate network (BSCN). A compression of 3:1 was achieved.", } @ARTICLE{Jaco9004:Header, AUTHOR="V. Jacobson", TITLE="{4BSD} Header Prediction", JOURNAL=ccr, VOLUME=20, NUMBER=2, PAGES="13-15", MONTH=apr, YEAR=1990, KEYWORDS="transport protocol; TCP; header prediction", ANNOTE="Some overheads that Van Jacobson has presented, but not published. They show C code for TCP header prediction.", } @INPROCEEDINGS{Soar9004:LAN, AUTHOR="L. F. G. Soares and S. L. Martins and T. L. P. Bastos and N. R. Ribeiro and R. C. S. Cordeiro", TITLE="{LAN} based real time audio-data system", BOOKTITLE="Conference on Office Automation Systems", ORGANIZATION="ACM", ADDRESS="Cambridge, Massachusetts", VOLUME=11, PAGES="152-157", MONTH=apr, YEAR=1990, KEYWORDS="packet voice; LAN; teleconferencing; floor control; cooperative work; session control", ABSTRACT="One of the greatest demands for better communication services comes from the office automation area. The functions related to electronic mail, telephony, and teleconferencing are among these services, due to advantages it creates, such as reduction of cost and time. LANBRETAS is a LAN-based real-time audio/data system that is being developed by the Catholic University of Rio de Janeiro and the Rio Scientific Center of IBM-Brasil. Described are the electronic mail system LANBRETA-DMS, the telephony system LANBRETA-DTS and the teleconferencing system LANBRETA-GCS.", } @INPROCEEDINGS{Ahuj9004:Comparison, AUTHOR="S. R. Ahuja and J. R. Ensor and S. E. Lucco", TITLE="A comparison of application sharing mechanisms in real-time desktop conferencing systems", BOOKTITLE="Conference on Office Automation Systems", EDITOR="Frederick H. Lahovsky and Robert B. Allen", ORGANIZATION="ACM", ADDRESS="Cambridge, Massachusetts", PAGES="238-248", MONTH=apr, YEAR=1990, KEYWORDS="multimedia; desktop conferencing; shared applications", ABSTRACT="We compare some methods of sharing application programs during real-time, computer-based conferencing. In particular, we have explored different methods in three versions of Rapport, a multimedia conferencing system. We examine the qualitative and quantitative differences of these implementations using some typical shared applications and find that one method possesses good semantic characteristics as well as good performance in several network environments.", } @INPROCEEDINGS{Lee9004:Xsketch, AUTHOR="John Lee", TITLE="Xsketch: a multi-user sketching tool for {X11}", BOOKTITLE="Conference on Office Automation Systems", EDITOR="Frederick H. Lahovsky and Robert B. Allen", ORGANIZATION="ACM", ADDRESS="Cambridge, Massachusetts", PAGES="169-173", MONTH=apr, YEAR=1990, KEYWORDS="multimedia; desktop conferencing; shared applications; groupware; sketching; drawing tools", ABSTRACT="This is a report of work-in-progress on a multi-user sketching tool. The intent behind the project is to produce a simple tool for use in multi-user design and brainstorming sessions. The tool, xsketch, is intended to function across existing internetwork facilities and run on a variety of platforms. This paper covers the requirements and design goals for the tool. Details of a prototype implementation are given along with a list of known problems, shortcomings, and possible extensions.", } @TECHREPORT{Leib9004:Host, AUTHOR="M. Leib", TITLE="The {ST} Host-Control Protocol", TYPE="Technical Report", INSTITUTION="BBN", ADDRESS="Cambridge, Massachusetts", MONTH=apr, YEAR=1990, KEYWORDS="teleconferencing; connection management; session control", ABSTRACT="The ST host control protocol (HCP) is a means for establishing, ending and maintaining ST conferences between ST hosts. The protocol allows a user at any remote site on the internet to connect, disconnect or maintain a conference. The protocol also allows a user to monitor the ST state and packet counts at an ST host. The protocol is robust, providing checksums, end-to-end acknowledgements and retries. HCP uses a protocol providing addressing and fragmentation to deliver its packets over an interconnected system of networks. Although this implementation of HCP will use UDP, this specification does not rely on any characteristics of the protocol other than packet delivery. Specifically, it does not assume any functions such as reliable communication or checksums, nor does it assume that the protocol will provide any information concerning its connections.", } @ARTICLE{Hopp9004:Pandora, AUTHOR="Andrew Hopper", TITLE="Pandora -- an experimental system for multimedia applications", JOURNAL=acmosrev, VOLUME=24, NUMBER=2, PAGES="19-34", NOTE="also as Olivetti Technical Report", MONTH=apr, YEAR=1990, REFERENCES=8, KEYWORDS="multimedia; packet voice; packet video; workstation architecture", ABSTRACT="Pandora is a joint project between Olivetti Research Cambridge and the University of Cambridge Computer Laboratory. The project is investigating the use of multimedia workstations in a working environment with particular emphasis on digital video. It endeavours to place a camera on the desktop to make generation of multimedia documents as easy as producing text. We are aiming to produce a number of new applications as well as to provide insights into the way computer systems should be designed. The project is in three stages. In the first a peripheral, Pandora's Box, has been designed. This box can be attached to any one of a range of workstations and provides multimedia features. In the second stage a number of such systems are being deployed amongst a community of system developers and application writers. Finally we will use the experimental system in our daily work to evaluate new applications. From the users point of view the normal workstation environment is maintained but additional features are available. This paper describes the design decisions which must be taken when incorporating video in a workstation. A description of the Pandora's Box peripheral which provides multimedia features is given. Finally, the distributed system under construction is discussed.", } @ARTICLE{Rama9004:Hardware, AUTHOR="P. Ramanathan and D. Kandlur and Kang G. Shin", TITLE="Hardware-Assisted Software Clock Synchronization for Homogeneous Distributed Systems", JOURNAL=ieeetc, VOLUME=39, NUMBER=4, PAGES="514-524", MONTH=apr, YEAR=1990, } @ARTICLE{Nico9004:Architecture, AUTHOR="Cosmos Nicolaou", TITLE="An architecture for real-time multimedia communication systems", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="391-400", MONTH=apr, YEAR=1990, REFERENCES=33, KEYWORDS="multimedia; distributed systems; synchronization", ABSTRACT="A multimedia communication system includes both the communication protocols used to transport the real-time data and also the distributed computing system (DCS) within which any applications using these protocols must execute. The architecture presented attempts to integrate these communications protocols with the DCS in a smooth fashion in order to ease the writing of multimedia applications. Two issues are identified as being essential to the success of this integration: namely the synchronization of related real-time data streams, and the management of heterogeneous multimedia hardware. The synchronization problem is tackled by defining explicit synchronization properties at the presentation level and by providing control and synchronization operations within the DCS which operate in terms of these properties. The heterogeneity problems are addressed by separating the data transport semantics (protocols themselves) from the control semantics (protocol interfaces). The control semantics are implemented using a distributed, typed interface scheme within the DCS (i.e., above the presentation layer), whilst the protocols themselves are implemented within the communication subsystem. The interface between the DCS and communication subsystem is referred to as the orchestration interface and can be considered to lie in the presentation and session layers. A prototype implementation conforming to this architecture is currently under construction.", ANNOTE="Describes the architecture of a communication system designed to support real time multimedia data and Distributed Computing Systems (DCS). Eases writing distributed multimedia applications by providing synchronisation of related real time data streams and management functions for heterogeneous multimedia hardware. Synchronisation between related streams is performed at the presentation layer. Explicit synchronisation points are defined upon which control and synchronisation operations are based. Heterogeneity is dealt with by separating the data transport semantics from the control semantics. The data transport semantics are the protocols themselves. The control semantics are the interfaces between protocols. The transport semantics are implemented within the communication system. The control semantics are implemented using a distributed typed interface scheme within the DCS (above the presentation layer). The interface between the transport and control semantics is known as the orchestration interface and lies in the presentation and session layers. The control interfaces are written is a Device Specification Language (DSL). Servers can export DSL programs for the devices it offers. Clients bind to exported DSL program using a run time binding system which can be location transparent. The binder is known as the DSL Trader and is really a name server that manages typed interfaces instead of uninterpreted strings. A DSL stream is built out of a plug and a socket which must be type compatible or else they must use a server supplied interpretter (a plug of one type and socket of another 'back to back'). The DSL also allows QOS parameters to be specified. The DSL has Emerald style conformance rather than SmallTalk inheritance as it exposes relationships between interfaces rather than implementations. The DSL has the ability to build aggregate types from more basic ones. The implementation being worked upon is part of the ANSA testbench and possibly replies upon RPC.", } @INPROCEEDINGS{Mazu9004:Monitoring, AUTHOR="S. Mazumdar and Aurel A. Lazar", TITLE="Monitoring integrated networks for performance management", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Atlanta, Georgia", PAGES="289-294 (302.1)", MONTH=apr, YEAR=1990, KEYWORDS="network monitoring", ABSTRACT="An object oriented model for network independent monitoring and performance evaluation in real-time is presented. The model describes the behavior of network objects by a set of state variables and a set of invariants. The model is used to evaluate quality of service characteristics of different classes of traffic of an integrated network testbed. An objective-driven measurement strategy to establish the dynamic database of the network is discussed. A statistical database derived from the dynamic database is also obtained.", URL="ftp://ftp.ctr.columbia.edu/CTR-Research/comet/public/papers/90/MAZ90a.ps.gz", } @INPROCEEDINGS{Deci9004:Bandwidth, AUTHOR="M. Decina and T. Toniatti", TITLE="On bandwidth allocation to bursty virtual connections in {ATM} networks", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Atlanta, Georgia", PAGES="844-851 (318.6)", MONTH=apr, YEAR=1990, KEYWORDS="admission control; equivalent bandwidth; ATM", ABSTRACT="Congestion control is required in ATM (asynchronous transfer mode) networks to fairly allocate network resources to the various service types and mixes carried by the high speed wide-area networks. Admission control is one of the congestion control mechanisms to be excecuted at the virtual call set up. Access nodes decide to accept or reject a connection request based on a description of the traffic anticipated by the bursty source and of the traffic load encountered by the connection along the network route. To each new connection an equivalent bandwidth is allocated in order to ensure that the cell transport objectives (cell losses and delay) remain at a satisfactory level for all users. This paper investigates the concepts of the equivalent bandwidth of bursty traffic and reports some simulation results of statistical multiplexing of homogeneous and heterogeneous bursty sources. The simulation tests show that in many significant traffic mixes the defined equivalent bandwidth results to be rather constant.", } @INPROCEEDINGS{Shai9004:Control, AUTHOR="Salman Shaikh and M. Schwartz and T. H. Szymanski", TITLE="Analysis, control and design of crossbar and banyan based broadband switches for integrated traffic", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Atlanta, Georgia", PAGES="0761-0765 (316.5)", MONTH=apr, YEAR=1990, KEYWORDS="banyan switch; fast packet switch; crossbar", ABSTRACT="Approximate Markov chain models are developed for crossbar and banyan packet switches built with nodes of arbitrary size, each node having output buffers of arbitrary size, operating in an environment of multiclass traffic with priority. A simple design change is incorporated to obtain a straightforward mechanism to 'control' the throughput of each traffic class. Effects of flexible priority disciplines are presented as a means for 'controlling' the average time delays of each traffic class. Techniques for obtaining the time delay distribution for packets of each traffic class are illustrated.", } @ARTICLE{Saka9004:Development, AUTHOR="S. Sakata", TITLE="Development and evaluation of an in-house multimedia desktop conference system", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="340-347", MONTH=apr, YEAR=1990, KEYWORDS="teleconferencing; conference control; floor control", ABSTRACT="This paper describes an in-house computer-supported desk-to-desk conference system which allows a group of users to conduct a meeting in real time from their telephone-attached personal computers. Participants can jointly view and edit relevant multimedia information, including text, graphics, images, and handwritten information distributed through a local area network. Participants can also simultaneously communicate by voice to discuss the information they are sharing. Following is a discussion of the system's design principle, i.e., the group communication architecture and a protocol overview for conference coordination. The system configuration, service functions, and related control mechanisms are also presented. User experiences and the results of feasibility evaluations are also discussed. This system has proved to be applicable to a wide variety of cooperative work, such as distributed software development, joint authoring, and group decision support.", ANNOTE="Four floor-control modes: chairperson nomination mode, current-holder nomination mode, order-of-request mode, non-control mode. Floor control operations: request, release, transfer.", } @INPROCEEDINGS{Davi9004:High, AUTHOR="G. W. Davidson and Louis Fielder and Mike Antill", TITLE="High-quality audio transform coding at 128 kbits/s", BOOKTITLE="International Conference on Acoustics, Speech, and Signal Processing (ICASSP)", ORGANIZATION="IEEE", ADDRESS="Albuquerque, New Mexico", MONTH=apr, YEAR=1990, KEYWORDS="audio coding", ABSTRACT="A new approach to wideband digital audio compression of CD-quality signals at data rates of 128 kbits/s per channel and below is presented. A form of adaptive transform coding, this technique features a nonuniform frequency division and coding scheme to exploit known characteristics of human perception. The algorithm has low computational complexity and can be adapted for use at other bit rates. A windowed overlap-add process is used with the forward/inverse transforms, which have been efficiently implemented using FFTs. Transform coefficients are converted into a sub-band block-companded format consisting of exponent words and associated mantissas, which are then coded with an adaptive quantizer. A real-time single-chip programmable DSP implementation encodes 48 kHz sampled stereo audio signals at a variety of bit rates. At 128 kbits/s, the coder's subjective performance is appropriate for highest-quality 15 kHz professional audio applications.", } @ARTICLE{Blac9004:Scheduling, AUTHOR="D. L. Black", TITLE="Scheduling support for concurrency and parallelism in the Mach {OS}", JOURNAL=ieeecomp, VOLUME=23, NUMBER=5, PAGES="35-43", MONTH=apr, YEAR=1990, } @ARTICLE{Stei9004:Synchronisation, AUTHOR="R. Steinmetz", TITLE="Synchronisation properties in multimedia systems", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="401-412", MONTH=apr, YEAR=1990, REFERENCES=27, ANNOTE="This paper does not cover communication but instead synchronisation between real time data streams from the view point of an object based multimedia system. Synchronisation can be defined in terms of activities, multimedia objects and interactions. Activities are sequential units of execution. Multimedia Objects are sequential units of execution combined with data specific to a particular media or mediums. Interactions are the relationships between activities and multimedia objects. The activities and multimedia objects are the active objects in the system and the interaction introduce the synchronisation. A classical synchronisation methods can be broken down into eight separate characteristics: 1) There are always two processes involved in a point-to-point communication, 2) The processes know an intermediate object (the channel attached to both) as a means of synchronisation, 3) The first process waiting to communicate/synchronise is blocked, 4) A process waiting for a synchronisation event cannot be preempted, 5) Many synchronising events can be combined using an alternative guarded command, 6) In alternative guarded commands the choice between different possible synchronisation events is predefined as non-deterministic, 7) The relationship between processes is symmetric, 8) No real-time aspects are considered. In mutlimedia systems, we must define what is meant by 'blocking' (ie what do we display on the screen whilst 'blocked'?). 'Restricted Blocking' allows a precise definition of what is going to happen whilst blocked for a synchronisation event. Restricted Blocking requires device and media dependant amounts of buffer storage. Extra semantics can be introduce to extend resttricted blocking into real time synchronisation.", } @INPROCEEDINGS{Nass9004:CRMA, AUTHOR="M. Nassehi", TITLE="{CRMA:} an access scheme for high-speed {LANs} and {MANs}", BOOKTITLE=icc, ADDRESS="Atlanta, Georgia", PAGES=6, MONTH=apr, YEAR=1990, REFERENCES=8, KEYWORDS="LAN; MAN; access protocol; CRMA; Cyclic reservation multiple access", ABSTRACT="Access scheme for high-speed local and metropolitan area networks based on slotted unidirectional bus structure, both folded and dual-bus configurations. CRMA consists of two novel mechanisms: cyclic reservation access and reservation cancelation backpressure.", } @TECHREPORT{Kill9004:Replication, AUTHOR="S. E. Kille", TITLE="Replication in the {OSI} Directory", TYPE="Technical Report", INSTITUTION="University College London", NUMBER="RN/90/18", PAGES=6, MONTH=apr, YEAR=1990, KEYWORDS="Directory Services", } @ARTICLE{Sund9004:Corrections, AUTHOR="M. Sundareshan", TITLE="Corrections to ``Secure Communication in {INTERNET} Environments: A Hierarchical Key Management Scheme for End-to-End Encryption''", JOURNAL=ieeecom, VOLUME=38, NUMBER=4, PAGES=404, MONTH=apr, YEAR=1990, KEYWORDS="Security", } @ARTICLE{Chla9004:Alternative, AUTHOR="I. Chlamtac and A. Ganz", TITLE="Towards Alternative High-Speed Network Concepts: The {SWIFT} Architecture", JOURNAL=ieeecom, VOLUME=38, NUMBER=4, PAGES="431-439", MONTH=apr, YEAR=1990, KEYWORDS="High-Speed Networking", } @ARTICLE{Daig9004:Message, AUTHOR="J. N. Daigle", TITLE="Message Delays at Packet Switching Nodes Serving Multiple Classes", JOURNAL=ieeecom, VOLUME=38, NUMBER=4, PAGES="447-455", MONTH=apr, YEAR=1990, KEYWORDS="Performance", } @ARTICLE{Ephr9004:Scheduling, AUTHOR="Anthony Ephremides and T. Truong", TITLE="Scheduling Broadcasts in Multihop Radio Networks", JOURNAL=ieeecom, VOLUME=38, NUMBER=4, PAGES="456-460", MONTH=apr, YEAR=1990, KEYWORDS="Multicasting", } @ARTICLE{Grov9004:Characterization, AUTHOR="Wayne D. Grover and T. E. Moore", TITLE="Design and Characterization of an Error-Correcting Code for the {SONET} {STS-1} Tributary", JOURNAL=ieeecom, VOLUME=38, NUMBER=4, PAGES="467-476", MONTH=apr, YEAR=1990, KEYWORDS="Checksums and Error Correction", } @ARTICLE{Nels9004:Extended, AUTHOR="Don J. Nelson and K. Saywood and H.-Y. Chang", TITLE="An Extended Least-Hop Distributed Routing Algorithm", JOURNAL=ieeecom, VOLUME=38, NUMBER=4, PAGES="520-528", MONTH=apr, YEAR=1990, KEYWORDS="Routing", } @ARTICLE{Rahn9004:Fast, AUTHOR="M. Rahnema", TITLE="The Fast Packet Ring Switch: A High-Performance Efficient Architecture with Multicast Capabilities", JOURNAL=ieeecom, VOLUME=38, NUMBER=4, PAGES="539-545", MONTH=apr, YEAR=1990, KEYWORDS="High-Speed Networking", } @ARTICLE{Dall9004:Digital, AUTHOR="William J. Dallas", TITLE="A digital prescription for X-ray overload", JOURNAL=ieeespec, VOLUME=27, NUMBER=4, MONTH=apr, YEAR=1990, KEYWORDS="High-Speed Networks", ANNOTE="A description of how hospitals might use high speed computer networks to manage x-ray images.", } @ARTICLE{Koel9004:Workshop, AUTHOR="C. Koelbel and Gene Spafford and George Leach", TITLE="Workshop on Experiences with Building Distributed and Multiprocessor Systems", JOURNAL=acmosrev, VOLUME=24, NUMBER=2, PAGES="2-6", MONTH=apr, YEAR=1990, KEYWORDS="Distributed Systems", ANNOTE="Also published in the April issue of Computer Communication Review.", } @ARTICLE{Ness9004:Critique, AUTHOR="D. M. Nessett", TITLE="A Critique of the Burrows, Abadi and Needham Logic", JOURNAL=acmosrev, VOLUME=24, NUMBER=2, PAGES="35-38", MONTH=apr, YEAR=1990, KEYWORDS="Authentication", } @ARTICLE{Burr9004:Rejoinder, AUTHOR="Michael Burrows and Martin Abadi and R. M. Needham", TITLE="A Rejoinder to Nessett", JOURNAL=acmosrev, VOLUME=24, NUMBER=2, PAGES="39-40", MONTH=apr, YEAR=1990, KEYWORDS="Authentication", } @ARTICLE{Oliv9004:Protection, AUTHOR="R. M. Oliver", TITLE="Protection in a Distributed Document Processing System", JOURNAL=acmosrev, VOLUME=24, NUMBER=2, PAGES="56-65", MONTH=apr, YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Seig9004:Distributed, AUTHOR="Joseph W. Seigh", TITLE="A Distributed Solution to the Reader-Writer Problem", JOURNAL=acmosrev, VOLUME=24, NUMBER=2, MONTH=apr, YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Notk9004:Proxies, AUTHOR="D. Notkin", TITLE="Proxies: A Software Structure for Accommodating Heterogeneity", JOURNAL=spe, PUBLISHER="John Wiley", VOLUME=20, NUMBER=4, PAGES="357-364", MONTH=apr, YEAR=1990, KEYWORDS="Distributed Systems", } @ARTICLE{Bowm9004:Univers, AUTHOR="Mic Bowman and L. L. Peterson and Andrey Yeatts", TITLE="Univers: An Attribute-based Name Server", JOURNAL=spe, PUBLISHER="John Wiley", VOLUME=20, NUMBER=4, PAGES="403-424", MONTH=apr, YEAR=1990, KEYWORDS="Directory Services", } @ARTICLE{Land9004:ISO, AUTHOR="Lawrence H. Landweber and Mitchell Tasman", TITLE="An {ISO} {TP4-TP0} gateway", JOURNAL=ccr, PUBLISHER="sigcomm", VOLUME=20, NUMBER=2, PAGES="16-21", MONTH=apr, YEAR=1990, REFERENCES=2, KEYWORDS="Protocol Performance", ABSTRACT="The ISO TP4 and TP0 transport layer protocols and associated network service paradigms cannot interoperate, yet both are likely to be in common use. To allow users of TP4 to communicate with users of TP0, transport layer gateways will be needed. This paper discusses several design alternatives, and describes a prototype gateway implementation.", } @ARTICLE{Scho9004:Critique, AUTHOR="M. L. Schoffstall and Wengyik Yeong", TITLE="A Critique of {Z39.50} Based On Implementation Experience", JOURNAL=ccr, PUBLISHER="sigcomm", VOLUME=20, NUMBER=2, PAGES="22-29", MONTH=apr, YEAR=1990, REFERENCES=15, KEYWORDS="bibliographic retrieval; Open Systems Interconnection; TCP/IP; Internet; TCP/IP to OSI transition; library systems; protocol performance", ABSTRACT="The Z39.50 Information Retrieval Protocol is a proposed ANSI standard for the retrieval of bibliographic information that originates from the library community in the United States. Unlike previous interlibrary loan protocols designed by the library community, Z39.50 is intended to be the basis of an end-user service. This paper provides a brief introduction to Z39.50, then discusses the shortcomings of the protocol that were discovered as a result of implementation experience.", URL="http://www.acm.org/sigcomm/ccr/archive/1990/apr90/yeong.ms", } @ARTICLE{IAns9004:Security, AUTHOR="Colin I'Anson and C. Mitchell", TITLE="Security Defects in {CCITT} Recommendation {X.509} - The Directory Authentication Framework", JOURNAL=ccr, VOLUME=20, NUMBER=2, PAGES="30-34", MONTH=apr, YEAR=1990, REFERENCES=4, KEYWORDS="Security", ABSTRACT="Security defects to be found in C.C.I.T.T. Recommendation X.509-1988 are described together with possible solutions.", URL="http://www.acm.org/sigcomm/ccr/archive/1990/apr90/ianson.ms.tbl", } @ARTICLE{Bolo9004:Dynamical, AUTHOR="J. C. Bolot and A. U. Shankar", TITLE="Dynamical Behavior of Rate-Based Flow Control Mechanisms", JOURNAL=ccr, VOLUME=20, NUMBER=2, PAGES="35-49", MONTH=apr, YEAR=1990, REFERENCES=15, KEYWORDS="flow control; NETBLT; VMTP", ABSTRACT="Flow control mechanisms are essential for the efficient and stable operation of store-and-forward networks. New transport protocols, such as VMTP and NETBLT, intend to use rate-based flow control. We present a model in which a network with connections subject to rate-based flow control is considered as a dynamical system, i.e., a set of coupled differential equations. We consider two scenarios: (1) a single connection over a long delay path involving a bottleneck; and (2) two connections with different roundtrip delays that share a common bottleneck. For a recently proposed control scheme, we obtain closed-form solutions for the dynamical model in both transient and steady state regimes, and evaluate appropriate performance measures. We compare our results with those obtained using experimental and simulation approaches.", } @ARTICLE{Ster9004:AXON, AUTHOR="J. P. Sterbenz and G. M. Parulkar", TITLE="{AXON:} Virtual Network Storage Design", JOURNAL=ccr, VOLUME=20, NUMBER=2, PAGES="50-65", MONTH=apr, YEAR=1990, REFERENCES=36, KEYWORDS="Distributed Systems", ABSTRACT="This paper describes the design of network virtual storage (NVS) in the Axon host communication architecture for distributed applications. The Axon project is investigating an integrated design of host architecture, operating systems, and communication protocols to allow applications to utilise the high bandwidth provided by the next generation of communication networks. Nvs extends segmented paged virtual storage management and address translation mechanisms to include segments located across an internetwork. This provides the ability to efficiently use the shared memory paradigm in non-local environments, as well as the support for a very high speed end-to-end data path between demanding applications such as scientific visualisation and imaging.", } @ARTICLE{Shir9004:Defense, AUTHOR="Robert W. Shirey", TITLE="Defense Data Network Security Architecture", JOURNAL=ccr, VOLUME=20, NUMBER=2, PAGES="66-71", MONTH=apr, YEAR=1990, REFERENCES=24, KEYWORDS="Security", ABSTRACT="The Department of Defense (DoD) is changing the security structure of the Defense Data Network. Existing classified backbones are merging to form a single segment, DISNET, that uses a new host-to-host encryption system. When completed, DISNET will carry classified data of all security levels, while MILNET continues to carry unclassified traffic. MILNET is being strengthened by link encryption devices on trunk and access lines. Subscriber computers and network elements in both DISNET and MILNET will have to satisfy at least Class C2 (Controlled Access Protection) of the DoD Trusted Computer System Evaluation Criteria. There are no similar plans for the internet.", } @ARTICLE{Geni9004:X, AUTHOR="Guy Genilloud", TITLE="{X.400} {MHS:} First Steps Toward an {EDI} Communication Standard", JOURNAL=ccr, VOLUME=20, NUMBER=2, PAGES="72-86", MONTH=apr, YEAR=1990, REFERENCES=22, KEYWORDS="Data communications; computer Communications; standardization; electronic mail; EDI; X.400 MHS; MOTIS", ABSTRACT="Electronic Data Interchange (EDI) is an increasingly important application of computer communications. Until recently, EDI has developed independently of the communications technology and related standards. EDI users coped with this situation by setting up bilateral communications agreements or by using the services of Value Added Data Services centers, which provided protocol conversion. The introduction of X.400 MHS based systems and services is slowly modifying the general attitude towards EDI communications. For the first time, a CCITT rapporteur group is drafting a recommendation for EDI communications within the context of X.400 MHS. More importantly, there already exist official guidelines, both in the USA and in Europe, which explain how to take advantage of MHS systems today. The purpose of this paper is to comment upon these first approaches to an EDI communication standard. For this reason, and because we expect only a few readers to be familiar with both EDI and X.400 MHS, we begin with introduction to both subjects.", } @ARTICLE{Pisc9004:Management, AUTHOR="D. Piscitello and Patrick Sher", TITLE="Network Management Capabilities for Switched Multi-megabit Data Service", JOURNAL=ccr, VOLUME=20, NUMBER=2, PAGES="87-97", MONTH=apr, YEAR=1990, REFERENCES=17, KEYWORDS="Network Management", ABSTRACT="This paper discusses network management capabilities for a specific BOC data service, SMDS, and the role that BOC network providing this service can play in the overall management strategy of the subscriber owned and operated data network. The paper describes user needs for managing the computing equipment and communications services that comprise a data network, and suggests several ways in which a BOC network could offer network management features that complement and are synergistic with the management practices applied in today's data networks. A set of candidate management information is discussed that could be offered by a BOC network providing SMDS to complement the base of information essential to maintaining the operational data network of the customer.", } @ARTICLE{Chow9004:Achieving, AUTHOR="C. H. Chow and Motomitsu Adachi", TITLE="Achieving Multimedia Communications on a Heterogeneous Network", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="348-359", MONTH=apr, YEAR=1990, REFERENCES=14, KEYWORDS="Multimedia Communication", ABSTRACT="We have designed and implemented a heterogeneous intelligent network to allow multimedia real-time communications and messaging among local area network workstations with logically associated speakerphones and ISDN voice/data terminals with transparent tablets on top of bitmap screens and stylus pens. We describe the architecture, presentation, editing, storage, and retrieval of multimedia documents in these two different kinds of terminals. The messages and protocol conversion facilities used for multimedia communications are presented, as are the lessons learned in internetworking a local area network with ISDN.", } @ARTICLE{Naka9004:Control, AUTHOR="S. Nakano and N. Nagai and R. Sawada and Osamu Miyagishi", TITLE="Network Control Method and Human-Machine Interface Design for {ISDN} Multimedia Terminal", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="360-367", MONTH=apr, YEAR=1990, KEYWORDS="Multimedia Communication", } @ARTICLE{Awer9004:Trade, AUTHOR="B. Awerbuch and O. Goldreich and D. Peleg and R. Vainish", TITLE="A Trade-Off between Information and Communication in Broadcast Protocols", JOURNAL=jacm, VOLUME=37, NUMBER=2, PAGES="238-256", MONTH=apr, YEAR=1990, KEYWORDS="Multicast", } @INPROCEEDINGS{Lauw9004:Collaboration, AUTHOR="J. Chris Lauwers and K. A. Lantz", TITLE="Collaboration awareness in support of collaboration transparency: requirements for the next generation of shared window systems", BOOKTITLE="CHI", ORGANIZATION="ACM", PAGES="303-311", MONTH=apr, YEAR=1990, REFERENCES=30, KEYWORDS="CSCW; collaboration; shared window systems; computer supported cooperative work; desktop teleconferencing", ABSTRACT="Shared window systems enable existing applications to be shared in the context of a real-time teleconference. The development and successful use of several such systems, albeit within limited user communities, testifies to the merits of the basic idea. However, experience to date has suggested a number of areas that have not been adequately addressed, namely: spontaneous interactions, shared workspace management, floor control, and annotation and telepointing. This paper focuses on the ramifications, for the software designer, of various user requirements in these areas. While the recommendations that result are motivated by the desire to enable continued use of collaboration-transparent applications, addressing them involves the development of systems software that is distinctly collaboration-aware.", } @INPROCEEDINGS{Abde9004:Method, AUTHOR="A. H. Abdelmonem and G. J. Van Ryzin", TITLE="A method for evaluating the effects of performance degradations on communications network applications", BOOKTITLE=icc, VOLUME=4, PAGES="334.2.1-7", MONTH=apr, YEAR=1990, REFERENCES=8, KEYWORDS="Reliability; availability; service degradation", } @INPROCEEDINGS{Aica9004:Optimization, AUTHOR="M. Aicardi and R. Bolla and F. Davoli and R. Minciardi", TITLE="Optimization of capacity allocation among users and services in integrated networks", BOOKTITLE=icc, VOLUME=2, PAGES="302.3.1-7", MONTH=apr, YEAR=1990, REFERENCES=11, KEYWORDS="Bandwidth allocation; optimization; integrated service; access control", } @INPROCEEDINGS{Akyi9004:Simulated, AUTHOR="Ian Akyildiz and R. Shonkwiler", TITLE="Simulated annealing for throughput optimization in communication n etworks with window flow control", BOOKTITLE=icc, VOLUME=3, PAGES="330.4.1-8", MONTH=apr, YEAR=1990, REFERENCES=20, KEYWORDS="Window mechanism; flow control; optimization; throughput; queueing network", } @INPROCEEDINGS{Apos9004:Protocol, AUTHOR="K. Apostolidis and X. H. Xing and L. Merakos", TITLE="A protocol for voice and data integration in undirectional bus networks", BOOKTITLE=icc, VOLUME=2, PAGES="301.5.1-4", MONTH=apr, YEAR=1990, REFERENCES=6, KEYWORDS="Service integration; bus; access protocol; simulation; approximation", } @INPROCEEDINGS{Asat9004:Quality, AUTHOR="Koichi Asatani and Masahiro Taka", TITLE="Quality design approaches for present and future telecommunication services", BOOKTITLE=icc, VOLUME=4, PAGES="334.6.1-5", MONTH=apr, YEAR=1990, REFERENCES=6, KEYWORDS="Broadband; performance parameter; reliability", } @INPROCEEDINGS{Bann9004:Wavelength, AUTHOR="J. Bannister and M. Gerla", TITLE="Design of the wavelength-division optical network", BOOKTITLE=icc, VOLUME=3, PAGES="323.2.1-6", MONTH=apr, YEAR=1990, REFERENCES=15, KEYWORDS="Optical LAN; topological design; optimization; propagation delay; throughput; WDM; wavelength division multiplex", } @INPROCEEDINGS{Barb9004:ISDN, AUTHOR="J. L. Barberio and M. A. Iroff and B. A. Postlewait and L. D. Presley", TITLE="{ISDN} direct subscription parameter management", BOOKTITLE=icc, VOLUME=2, PAGES="302.5.1-5", MONTH=apr, YEAR=1990, REFERENCES=2, KEYWORDS="Satellite radio; performance model; link layer; transaction; simulation", } @INPROCEEDINGS{Bern9004:Fully, AUTHOR="F. Bernabei and C. Calabro and M. Listanti", TITLE="A fully distributed routing control scheme in an {ATM} switch", BOOKTITLE=icc, VOLUME=2, PAGES="316.6.1-5", MONTH=apr, YEAR=1990, REFERENCES=9, KEYWORDS="ATM; stream traffic; multistage interconnection network; path control; flooding technique for Constant Bit Stream Oriented (CBO) call setup; switch design; isochronous service handling; Circuit Emulation Mode (CEM) in ATM switches; Generalized Parallel Delta Network (GPDN)", ABSTRACT="Full distributed routing.", } @INPROCEEDINGS{Deli9004:Optimal, AUTHOR="H. Delic and P. Papantoni-Kazakos", TITLE="An optimal policy for competitive processing of high and low pr iority arrivals", BOOKTITLE=icc, VOLUME=2, PAGES="301.6.1-5", MONTH=apr, YEAR=1990, REFERENCES=5, KEYWORDS="Multiple priority; queueing discipline; limited waiting time; analysis", } @INPROCEEDINGS{DeSi9004:Alternative, AUTHOR="A. DeSimone and V. R. Saksena", TITLE="Performance of alternative {MAN} architectures for high-speed data applications", BOOKTITLE=icc, VOLUME=4, PAGES="342.3.1-7", MONTH=apr, YEAR=1990, REFERENCES=9, KEYWORDS="MAN; ATM; datagram; performance evaluation", } @INPROCEEDINGS{Eng9004:Framework, AUTHOR="K. Y. Eng and R. D. Gitlin and Mark Karol", TITLE="A framework for a national broadband {(ATM} / {BISDN)} network", BOOKTITLE=icc, VOLUME=2, PAGES="308.7.1-6", MONTH=apr, YEAR=1990, REFERENCES=17, KEYWORDS="ATM; STM; hybrid switching; network architecture; congestion control; BISDN; networks; hybrid packet/circuit; LAN; network node; DACS; switch; growable packet switch; congestion control; switch; delay; throughput performance; switching; switch architecture", ABSTRACT="Framework", } @INPROCEEDINGS{Glis9004:Effect, AUTHOR="S. G. Glisic and R. R. Rao and L. B. Milstein", TITLE="The effect of imperfect carrier sensing on nonpersistent carrier sense multiple access", BOOKTITLE=icc, VOLUME=3, PAGES="332.4.1-4", MONTH=apr, YEAR=1990, REFERENCES=5, KEYWORDS="CSMA/CD; throughput; analysis", } @INPROCEEDINGS{Gopa9004:Dynamic, AUTHOR="G. Gopal and C. Kim and A. Weinrib", TITLE="Dynamic network configuration management", BOOKTITLE=icc, VOLUME=2, PAGES="302.2.1-7", MONTH=apr, YEAR=1990, REFERENCES=14, KEYWORDS="Network management; configuration analysis; dynamic reconfiguration; dynamic routing; heuristics", } @INPROCEEDINGS{Hoan9004:Service, AUTHOR="B. Hoang", TITLE="Service completion time for advanced intelligent network servic es", BOOKTITLE=icc, VOLUME=2, PAGES="311.2.1-5", MONTH=apr, YEAR=1990, REFERENCES=6, KEYWORDS="Intelligent network; signalling", } @INPROCEEDINGS{Hsie9004:Modeling, AUTHOR="J. Hsieh and D. R. Ucci", TITLE="Modeling and analysis of burst switching for integrated voice/d ata services", BOOKTITLE=icc, VOLUME=3, PAGES="330.1.1-5", MONTH=apr, YEAR=1990, REFERENCES=15, KEYWORDS="Burst switching; Petri net; service integration; bandwidth allocation; congestion control; mean delay; loss probability; simulation", } @INPROCEEDINGS{Ilia9004:Packet, AUTHOR="I. Iliadis and W. Denzel", TITLE="Performance of packet switches with input and output queueing", BOOKTITLE=icc, VOLUME=2, PAGES="316.3.1-7", MONTH=apr, YEAR=1990, REFERENCES=8, KEYWORDS="Packet switching; nonblocking; switching block; mean delay; throughput; analysis", } @INPROCEEDINGS{Ilya9004:Congestion, AUTHOR="M. Ilyas and Hussein Mouftah", TITLE="Performance evaluation of congestion avoidance in broadband {ISDNs}", BOOKTITLE=icc, VOLUME=2, PAGES="315.3.1-5", MONTH=apr, YEAR=1990, REFERENCES=15, KEYWORDS="ATM; congestion control; simulation; blocking", } @MISC{Jacq9004:Lightnet, AUTHOR="P. Jacquet and Paul Mühlethaler", TITLE="Lightnet: A class of efficient high speed access protocols", PUBLISHER="icc", VOLUME=4, PAGES="346.1.1-7", MONTH=apr, YEAR=1990, REFERENCES=7, KEYWORDS="Multiple access; high speed; performance evaluation", } @INPROCEEDINGS{Kim9004:Packet, AUTHOR="Byung G. Kim", TITLE="Packet delay in the {IEEE} 802.6 {DQDB} Protocol", BOOKTITLE=icc, VOLUME=4, PAGES="346.4.1-5", MONTH=apr, YEAR=1990, REFERENCES=15, KEYWORDS="Multiple access; DQDB; packet delay; simulation", } @INPROCEEDINGS{Kim9004:Multistage, AUTHOR="H. Kim and A. Leon-Garcia", TITLE="Design of a multistage switching network for {ATM}", BOOKTITLE=icc, VOLUME=2, PAGES="742-745 (316.2.1-316.2.4)", MONTH=apr, YEAR=1990, REFERENCES=11, KEYWORDS="ATM; multistage interconnection network; analysis", ABSTRACT="In this paper, we propose a new switching network that approaches a maximum throughput of 100\% as buffering is increased. This self routing switching network consists of simple 2x2 switching elements, distributors, and buffers located between stages and in the input ports. The proposed switching network requires speedup of two. The structure and the operation of the switching network are described", } @INPROCEEDINGS{Kris9004:Benefits, AUTHOR="K. R. Krishnan", TITLE="Performance benefits of state-dependent routing of telephone tr affic", BOOKTITLE=icc, VOLUME=4, PAGES="334.3.1-5", MONTH=apr, YEAR=1990, REFERENCES=7, KEYWORDS="State dependent routing; performance evaluation", } @INPROCEEDINGS{Lant9004:Efficient, AUTHOR="Andrea C. Lantz and B. Mukherjee", TITLE="Efficient and modified round-robin protocols for fiber optic ne tworks", BOOKTITLE=icc, VOLUME=4, PAGES="346.3.1-5", MONTH=apr, YEAR=1990, REFERENCES=8, KEYWORDS="Multiple access; round robin; fiber optics; analysis", } @INPROCEEDINGS{Leun9004:FDM, AUTHOR="Victor C. M. Leung and F. Takawira", TITLE="{FDM} packet multiple access network using coherent fibre optic communication", BOOKTITLE=icc, VOLUME=4, PAGES="345.1.1-5", MONTH=apr, YEAR=1990, REFERENCES=5, KEYWORDS="Multiple access; FDMA; frequency division multiple access", } @INPROCEEDINGS{Liew9004:Interconnection, AUTHOR="S. C. Liew and K. W. Lu", TITLE="A 3-stage interconnection structure for very large packet switc hes", BOOKTITLE=icc, VOLUME=2, PAGES="316.7.1-7", MONTH=apr, YEAR=1990, REFERENCES=12, KEYWORDS="ATM; multistage interconnection network; throughput; switch design; very large (> 16;000 ports) switching systems; input-buffered switch module with channel grouping; modular switch design; FIFO design; expansion-concentration network; output queue design; performance analysis", ABSTRACT="This paper proposes a 3-stage broadband packet switch architecture with more than 16000 ports for a future central office. Theswitch is constructed by interconnecting many independent switchmodules of small size which can be implemented using modifications of various well studied switch fabric designs. Multiple paths are provided for each input/output pair, and the techniqueof channel grouping is used to decrease delay and increase", } @INPROCEEDINGS{Liu9004:Capacity, AUTHOR="Xiaofei Liu and J. Igarashi and H. Miyamoto", TITLE="A capacity assignment method with different types of channel ca pacities for packet switched networks", BOOKTITLE=icc, VOLUME=3, PAGES="330.5.1-5", MONTH=apr, YEAR=1990, REFERENCES=8, KEYWORDS="Capacity assignment; packet switching; delay constraint; optimization", } @INPROCEEDINGS{Liu9004:Hybrid, AUTHOR="Xiaofei Liu and Hussein Mouftah", TITLE="Design of a hybrid transfer mode broadband {ISDN}", BOOKTITLE=icc, VOLUME=2, PAGES="315.1.1-5", MONTH=apr, YEAR=1990, REFERENCES=13, KEYWORDS="Hybrid switching; network architecture; ATM; STM", } @INPROCEEDINGS{Liu9004:Development, AUTHOR="Xiaofei Liu and Hussein Mouftah", TITLE="Development of a simulation testbed facility for broadband {ISDN}", BOOKTITLE=icc, VOLUME=2, PAGES="315.4.1-5", MONTH=apr, YEAR=1990, REFERENCES=10, KEYWORDS="ATM; STM; simulation", } @MISC{Mara9004:Performances, AUTHOR="S. Marano", TITLE="Performances study of a high throughput collisionless tree {LAN} with simultaneous transmission", PUBLISHER="icc", VOLUME=4, PAGES="346.2.1-7", MONTH=apr, YEAR=1990, REFERENCES=10, KEYWORDS="Multiple access; collision avoidance; throughput; simulation", ANNOTE="Be careful !!! This article has the wrong pagenumber, 348.2.1. instead of 346.2.1., the number which should logically follow; as a consequence the first number exists twice.", } @INPROCEEDINGS{Mish9004:Intelligent, AUTHOR="A. M. Mishra and M. Sundararaman and A. M. Mazzario", TITLE="Performance analysis of intelligent networks", BOOKTITLE=icc, VOLUME=2, PAGES="311.4.1-4", MONTH=apr, YEAR=1990, REFERENCES=3, KEYWORDS="Intelligent network; queueing system; performance evaluation", } @INPROCEEDINGS{Nils9004:Error, AUTHOR="A. Nilsson and F.-Y. Lai", TITLE="Performance evaluation of error recovery schemes in high speed networks", BOOKTITLE=icc, VOLUME=2, PAGES="315.2.1-5", MONTH=apr, YEAR=1990, REFERENCES=9, KEYWORDS="End-to-end error recovery; blocking; end-to-end delay; approximation; ATM", } @INPROCEEDINGS{Nosu9004:Optical, AUTHOR="Kiyoshi Nosu and Hiromu Toba", TITLE="An optical multiaccess network with optical collision detection and optical frequency addressing", BOOKTITLE=icc, VOLUME=3, PAGES="323.3.1-8", MONTH=apr, YEAR=1990, REFERENCES=10, KEYWORDS="CSMA/CD; optical LAN; mean delay; approximation; WDM; wavelength division multiplex", } @INPROCEEDINGS{Oie9004:Nonblocking, AUTHOR="Yuji Oie and T. Suda and M. Murata and H. Miyahara", TITLE="Survey of the performance of nonblocking switches with {FIFO} inp ut buffers", BOOKTITLE=icc, VOLUME=2, PAGES="316.1.1-5", MONTH=apr, YEAR=1990, REFERENCES=11, KEYWORDS="ATM; nonblocking; switching block; throughput; survey", } @INPROCEEDINGS{Patt9004:Packet, AUTHOR="Achille Pattavina", TITLE="Design of a packet concentrator for broadband networks", BOOKTITLE=icc, VOLUME=3, PAGES="318.1.1-5", MONTH=apr, YEAR=1990, REFERENCES=18, KEYWORDS="ATM; concentrator; priority; throughput; mean delay; simulation", } @INPROCEEDINGS{Pond9004:Setup, AUTHOR="L. C. Pond and V. Li", TITLE="Network setup time analysis of mobile multi-hop packet radio ne tworks under virtual circuit and {TDMA} policies", BOOKTITLE=icc, VOLUME=3, PAGES="331.4.1-5", MONTH=apr, YEAR=1990, REFERENCES=5, KEYWORDS="Packet radio; multihop; setup time; virtual channel; TDMA; time division multiple access; analysis", } @INPROCEEDINGS{Shob9004:Cell, AUTHOR="Y. Shobatake and T. Kodama", TITLE="A cell switching algorithm for the buffered Banyan network", BOOKTITLE=icc, VOLUME=2, PAGES="316.4.1-7", MONTH=apr, YEAR=1990, REFERENCES=8, KEYWORDS="ATM; Buffered Banyan network; mean delay; loss probability; simulation; BISDN; simulation of cell loss rate for a buffered banyan network; ATM; switch design; cell switching; throughput analysis; Contents ASsociated Output buffer (CASO buffer)", ABSTRACT="A cell switching algorithm is proposed for increasing the throughput of the buffered banyan network, and its implementation issues are discussed towards BISDN. When head cells of twobuffers are to be sent to the same output port (say U) in 2x2 element switch in the buffered banyan network, one of the buffers (say A) is selected. Then, the other buffer (say B) is searched for a cell which is to be sent to the other output port", } @INPROCEEDINGS{Sing9004:Protocol, AUTHOR="R. Singh and A. Erramilli", TITLE="Protocol design and modeling issues in broadband networks", BOOKTITLE=icc, VOLUME=4, PAGES="338.4.1-6", MONTH=apr, YEAR=1990, REFERENCES=19, KEYWORDS="Error recovery; protocol; broadband; performance evaluation", } @INPROCEEDINGS{Stav9004:Approach, AUTHOR="I. Stavrakakis", TITLE="An analysis approach to multi level networking", BOOKTITLE=icc, VOLUME=2, PAGES="301.4.1-5", MONTH=apr, YEAR=1990, REFERENCES=5, KEYWORDS="Delay analysis; output process; model; packet switching", } @INPROCEEDINGS{Thoe9004:Use, AUTHOR="W. Thoet and Anthony Ephremides and David Baker", TITLE="The use of multiple protocols in multi-hop radio networks", BOOKTITLE=icc, VOLUME=2, PAGES="301.3.1-6", MONTH=apr, YEAR=1990, REFERENCES=3, KEYWORDS="Routing; multihop; simulation", } @INPROCEEDINGS{Tu9004:Multicast, AUTHOR="Shi-Chuan Tu and W.-H. F. Leung", TITLE="Multicast connection-oriented packet switching networks", BOOKTITLE=icc, VOLUME=2, PAGES="308.4.1-7", MONTH=apr, YEAR=1990, REFERENCES=11, KEYWORDS="Multipoint; packet switching; traffic matrix; traffic flow analysis", ANNOTE="In this paper, four flavours of multicast connections (MC) are defined over a wide-area multicast packet switching network. Thenetwork-layer sending/receiving relationship for a MC is represented by a transmission matrix (TM). By employing a packet flowmodel, we derive some necessary and sufficient conditions for various flavours of MCs to support a given TM. A multicast routing algorithm is also given to illustrate MC setup.", } @INPROCEEDINGS{Wang9004:Fast, AUTHOR="Jin-Tuu Wang and M. Moeneclaey", TITLE="Performance of fast-frequency-hopping spread-spectrum multiple-access for indoor wireless communications", BOOKTITLE=icc, VOLUME=4, PAGES="335.5.1-5", MONTH=apr, YEAR=1990, REFERENCES=8, KEYWORDS="Spread spectrum; multiple access", } @INPROCEEDINGS{Wang9004:Optimal, AUTHOR="Zhen Wang and D. W. Browning", TITLE="An optimal topology design algorithm for multiple traffic using both dialed up and rented capacities", BOOKTITLE=icc, VOLUME=3, PAGES="330.6.1-6", MONTH=apr, YEAR=1990, REFERENCES=4, KEYWORDS="Network planning; topological design", } @INPROCEEDINGS{Wong9004:Access, AUTHOR="L. Wong and M. Schwartz", TITLE="Access control in metropolitan area networks", BOOKTITLE=icc, VOLUME=4, PAGES="342.4.1-5", MONTH=apr, YEAR=1990, REFERENCES=4, KEYWORDS="Access control; MAN; leaky bucket", } @INPROCEEDINGS{Yeh9004:Sensitivity, AUTHOR="W.-P. Yeh and J. L. Hammond and D. Tipper", TITLE="Sensitivity of bandwidth allocation algorithms for unidirection al networks to voice parameters", BOOKTITLE=icc, VOLUME=4, PAGES="333.5.1-5", MONTH=apr, YEAR=1990, REFERENCES=7, KEYWORDS="Bandwidth allocation; service integration; multiple access", } @INPROCEEDINGS{Zhan9004:New, AUTHOR="K. Zhang and K. Pahlavan", TITLE="A new approach for the analysis of the slotted {ALOHA} local pack et radio networks", BOOKTITLE=icc, VOLUME=3, PAGES="331.3.1-5", MONTH=apr, YEAR=1990, REFERENCES=11, KEYWORDS="Slotted ALOHA; packet radio; throughput; analysis; simulation", } @INPROCEEDINGS{Mok9004:Simulating, AUTHOR="D. S. Mok and S. Becker", TITLE="Simulating a complex software system", BOOKTITLE="23rd annual simulation symposium", ADDRESS="Nashville, Tennessee", VOLUME=23, PAGES="33-49", MONTH=apr, YEAR=1990, REFERENCES=4, KEYWORDS="Simulation; software; modeling; hybrid simulation", ABSTRACT="This paper describes the simulation problems and techniques assiociated with modeling a complex computer software system. In this study, modeling techniques such as: hybrid simulation, bit packing, mirroring, post-simulation statistical analysis and other special simulation programming techniques are presented together with the results of their application.", } @ARTICLE{IEEE9004:ISDN, AUTHOR="I. E. EE Communications Society", TITLE="{ISDN}", JOURNAL=ieeecm, VOLUME=28, NUMBER=4, MONTH=apr, YEAR=1990, KEYWORDS="ISDN", } @TECHREPORT{Ande9004:Scheduler, AUTHOR="Thomas Anderson and B. N. Bershad and E. D. Lazowska and H. M. Levy", TITLE="Scheduler Activations: Effective Kernel Suuport for the User-Level Management of Parallelism", TYPE="TR", INSTITUTION="University of Washington, Seattle", NUMBER="90-04-02", MONTH=apr, YEAR=1990, } @TECHREPORT{Bres9004:Inter, AUTHOR="L. Breslau and D. Estrin", TITLE="Design of inter-administrative domain routing protocol", INSTITUTION="University of Southern California, Computer Science Department", NUMBER="90-8", MONTH=apr, YEAR=1990, } @UNPUBLISHED{Casn9004:Connection, AUTHOR="Stephen Casner and others", TITLE="The Connection-oriented Internetworking: Collaboration Plan", NOTE="USC, ISI", MONTH=apr, YEAR=1990, } @ARTICLE{Saty9004:Coda, AUTHOR="M. Satyanarayanan and J. J. Kistler and P. R. Kumar and M. E. Okasaki and E. H. Siegel and D. C. Steere", TITLE="Coda: A Highly Available File System for a Distributed Workstation Environment", JOURNAL=ieeetc, VOLUME=39, NUMBER=4, PAGES="447-459", MONTH=apr, YEAR=1990, } @TECHREPORT{Stee9004:Efficient, AUTHOR="D. C. Steere and J. J. Kistler and M. Satyanarayanan", TITLE="Efficient User-Level File Cache Management on the Sun Vnode Interface", INSTITUTION="Carnegie Mellon University", NUMBER="CMU-CS-90-126", MONTH=apr, YEAR=1990, } @TECHREPORT{Case9004:Interactive, AUTHOR="Tom Casey and Richard Beckwith and Gordon Jameson and Yael Pinto and Bill Tuck", TITLE="Interactive Video using Broadcast Satellite and Terrestrial Return Paths", INSTITUTION="University College London", ADDRESS="London, England", NUMBER="RN/90/21", PAGES=13, MONTH=apr, YEAR=1990, KEYWORDS="Video Broadcast; image server; teletext; Laser Video Recorder", ABSTRACT="The paper describes the design and implementation of a prototype for an interactive video network using broadcast satellite and terrestrial return paths. The prototype is being developed and tested on the interactive network of the University of London. The system will then be scaled up to include video transmission on the Olympus satellite with data links between the receiver and the head-end sites.", URL="~tcasey/doc/eact90", } @TECHREPORT{Case9004:Communications, AUTHOR="Tom Casey and Richard Beckwith and Gordon Jameson and Bill Tuck", TITLE="The Communications Infrastructure for Interactive Video using {DBS} and {ISDN}", INSTITUTION="University College London", NUMBER="RN/90/22", PAGES=11, MONTH=apr, YEAR=1990, KEYWORDS="DBS; ISDN; Image; Server; Access; Protocol", ABSTRACT="This paper describes the design and implementation of a prototype for an Interactive video network using DBS and ISDN return paths. The prototype is being developed and tested on the interactive video network of the University of London, and in the Computer Science Communications Laboratory of University College London using a pair of British Telecom IDA connections. The system is also being scaled up to include video transmission on the Olympus satellite with data links between the receiver and the head-end sites.", URL="~tcasey/doc/delta\_b", } @UNPUBLISHED{Jaco9004:Modified, AUTHOR="V. Jacobson", TITLE="Modified {TCP} Congestion Control Algorithm", INSTITUTION="Lawrence Berkeley Laboratory", ADDRESS="Berkeley, California", NOTE="Note to end2end-interest mailing list.", MONTH=apr, YEAR=1990, KEYWORDS="TCP; fast retransmit; fast recovery; slow start; congestion control; ACK; duplicate ACK", ABSTRACT="Describes the fast retransmit and fast recovery algorithm.", URL="ftp://isi.edu/", } @TECHREPORT{Aray9004:Interactive, AUTHOR="Jose E. Araya", TITLE="Interactive Query Formulation and Feedback Experiments in Information Retrieval", INSTITUTION="Cornell University, Computer Science Department", NUMBER="TR90-1115", PAGES=175, MONTH=apr, YEAR=1990, ABSTRACT="The effective use of information retrieval systems by end-users has been limited by their lack of knowledge on the particular organization of the databases searched and by their limited experience on how to formulate and modify search statements. This thesis explores and evaluate two mechanisms to improve retrieval performance by end-users. The first mechanism complements the formulation of a query by allowing users to interactively add term phrases. These phrases are generated either from the query text of from known relevant documents. This addition of term phrases to a query is suggested by the term discrimination model as a precision enhancement device. An interactive front-end for the SMART information retrieval system was developed to perform the interactive experiments needed to evaluate different phrase addition strategies. The second aspect of retrieval improvement studied is the evaluation of two database organizations that can be used to obtain new relevant documents by looking in the neighborhood of known relevant documents, browsing. Browsing in cluster hierarchies and nearest-neighbor networks is compared to relevance feedback in non-restrictive experiments. The results obtained for the phrase addition methodology showed that simple non-interactive addition of phrases can perform as well as interactive addition. Even an optimal selection of the phrases based on the relevant documents not yet retrieved, did not significantly improve performance over simply adding all the phrases generated. Many useful phrases are not selected by users because they look like random association of terms. The usefulness of these phrases comes from the fact that either they are pieces of larger (semantically meaningful) phrases, or they are made up of local synonyms specific to the document collection used. The browsing experiments in cluster hierarchies and nearest-neighbor networks showed that the second organization consistently performs better than relevance feedback in different collections. Cluster browsing is more dependent on the characteristics of the collections; but when the circumstances are favorable, cluster browsing can produce larger improvements on retrieval that network browsing. Retrieval in both structures is much faster than relevance feedback since only a small portion of the database needs to be inspected.", } @ARTICLE{Nart9004:UNIX, AUTHOR="reviewed by Thomas Narten", TITLE="{UNIX} Network Programming by {W.} Richard Stevens", JOURNAL=ccr, VOLUME=20, NUMBER=2, PAGES="8-9", MONTH=apr, YEAR=1990, } @ARTICLE{Koel9004:WorkshopCCR, AUTHOR="C. Koelbel and Gene Spafford and George Leach", TITLE="Workshop Report: Workshop on Experiences with Building Distributed and Multiprocessor Systems", JOURNAL=ccr, VOLUME=20, NUMBER=2, PAGES="10-12", MONTH=apr, YEAR=1990, } @ARTICLE{Jaco9004:4BSD, AUTHOR="V. Jacobson", TITLE="{4BSD} Header Prediction (slides)", JOURNAL=ccr, VOLUME=20, NUMBER=2, MONTH=apr, YEAR=1990, } @ARTICLE{Smit9004:Task, AUTHOR="A. J. Smith", TITLE="The Task of the Referee", JOURNAL=ieeecomp, PAGES="65-71", MONTH=apr, YEAR=1990, } @INPROCEEDINGS{Alve9004:TERA, AUTHOR="Alverson and others", TITLE="The {TERA} Computer System", BOOKTITLE="ACM International Conference on Supercomputing", PAGES="1-6", MONTH=apr, YEAR=1990, } @INPROCEEDINGS{Pond9004:Adaptive, AUTHOR="L. C. Pond and V. Li", TITLE="Adaptive Signalling in Distributed Self-Organizing Mobile Packet Radio Networks", BOOKTITLE=icc, ADDRESS="Atlanta, Georgia", PAGES="331.1.1-5", MONTH=apr, YEAR=1990, KEYWORDS="packet radio", ABSTRACT="In existing distributed network management algorithms for mobile packet radio networks, a portion of the channel resource is allocated to signalling channel for control and information exchange. A fixed partition of the signalling channel bandwidth is allocated to each user, even if it is not presently participating in the network.", } @ARTICLE{Radc9004:Natural, AUTHOR="N. Radcliffe and G. A. Wilson", TITLE="Natural Solutions Give Their Best", JOURNAL="New Scientist", PAGES="47-50", MONTH=apr, YEAR=1990, KEYWORDS="Routing; optimization", ABSTRACT="Simulated annealing", } @INPROCEEDINGS{Rubi9004:Traffic, AUTHOR="I. Rubin and T. Cheng", TITLE="Performance of Traffic Management Strategies for Interconnected High-Speed Local and Metropolitan Area Networks", BOOKTITLE=icc, ADDRESS="Atlanta, Georgia", PAGES="323.6.1-5", MONTH=apr, YEAR=1990, KEYWORDS="LAN; MAN", ABSTRACT="We consider interconnected high-speed local and metropolitan area networks in which call-oriented resource allocation mechanisms are used for traffic management. Management domains are defined for the network and call requests must be admitted by the appropriate domain manager. Assuming Poisson arrival rates and exponential service times, the state process can be modeled as a Markov process with state defined as the numbe", } @ARTICLE{Pavl9004:Fundamentals, AUTHOR="T. Pavlidis and J. W. Schwartz and Yixin Wang", TITLE="Fundamentals of bar code information theory", JOURNAL=ieeecomp, VOLUME=23, NUMBER=4, PAGES="74-86", MONTH=apr, YEAR=1990, REFERENCES=15, KEYWORDS="bar code; UPC; scanning; error correction", ABSTRACT="To compare encoding and decoding schemes requires us to first look into information and coding theory. This article discusses problems and possible solutions in encoding information.", } @ARTICLE{Karm9004:Multimedia, AUTHOR="Ahmed Karmouch and L. Orozco-Barbosa and Nicolaos D. Georganas and M. Goldberg", TITLE="A Multimedia Medical Communications System", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="325-339", MONTH=apr, YEAR=1990, REFERENCES=27, ABSTRACT="The most critical aspect of a radiologist's work is the communication of his findings to the attending physician responsible for the patient's care. This is also the part of the process that is least well organized and most subject to failure. At the University of Ottawa Medical Communications Research Centre we are investigating technical means for improving communications between radiologists and attending physicians. In this paper, we first introduce the radiology communication service problem and show why it is essentially a multimedia communication problem. We then describe a multimedia communications system designed by our research team focusing on database and medical reports organization and architecture. Finally, we report some of key results of an in-hospital trial linking the Department of Radiological Sciences and the Emergency Department at the Ottawa Civic Hospital, a 950 bed tertiary care teaching hospital.", } @ARTICLE{Stei9004:Synchronization, AUTHOR="R. Steinmetz", TITLE="Synchronization Properties in Multimedia Systems", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="401-412", MONTH=apr, YEAR=1990, REFERENCES=27, ABSTRACT="``Multimedia'' refers to the integrated generation, representation, process, storage, and dissemination of independent machine processable information expressed in multiple time dependent and time independent media such as data, graphics, drawings, voice, audio, and video. The availability of the required technologies now and in the future stimulates research and development of products in this area. ``Synchronization'' assures a temporal order of events. Synchronization mechanisms are a well-studied topic in the area of operating systems, parallel programming languages, and database technology. This paper addresses the characteristics of synchronization mechanisms desirable for central and distributed multimedia systems. The concept of ``multimedia objects'' as components of an object based model for a multimedia system is introduced. The essential new sychronization requirement is restricted blocking together with synchronization features covering real-time aspects. Existing synchronization mechanisms can be altered or new ones defined to meet these requirements.", } @ARTICLE{Litt9004:Synchronization, AUTHOR="T. D.C. Little and A. Ghafoor", TITLE="Synchronization and Storage Models for Multimedia Objects", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="413-427", MONTH=apr, YEAR=1990, REFERENCES=31, KEYWORDS="multimedia", ABSTRACT="Multimedia computer systems are required to store, retrieve, and communicate objects comprised of mixed data types including images, text, and voice. An important aspect of multimedia systems is the integration of elements retrieved from databases distributed across a network. Integration of object components requires consideration of the temporal characteristics of multimedia elements. We propose a technique for the formal specification and modeling of multimedia composition with respect to intermedia timing. The proposed model is based on the logic of temporal intervals, and Timed Petri Nets. A strategy is evinced for constructing a database schema to facilitate data storage and retrieval of media elements based on the temporal relationships established by the proposed modeling tool. We present an alogrithm which allows the retrieval of media elements from the constructed database in a manner which preserves the temporal requirements of the initial specification. Through the proposed model, the synchronization requirements of complex structures of temporally related objects can be easily specified.", } @ARTICLE{Ogue9004:RAVI, AUTHOR="François Oguet and Christiane Schwartz and Francis Kretz and Maryse Quéré", TITLE="{RAVI,} A Proposed Standard for the Interchange of Audio/Visual Interactive Applications", JOURNAL=ieeejsac, VOLUME=8, NUMBER=3, PAGES="428-436", MONTH=apr, YEAR=1990, REFERENCES=30, ABSTRACT="RAVI (representation for audio/visual interactive applications) is a set of specifications proposed as a standard for the interchange of audio/visual interactive applications (AVI's). RAVI was designed by representatives of the French Administration and manufacturers to fulfill the functional requirements of an AVI. RAVI representation consists of an interchange format and a set of functional operators (``formulation''). Protocols for a RAVI system are defined so as to allow communication between distributed subsystems. RAVI profiles allow compatible implementation of restricted sets of functionalities. As far as possible, the RAVI specifications use existing standards and are being submitted to ISO and CCITT for discussion. Products are commercially available and a number of applications has already been developed.", } @INPROCEEDINGS{Lee9004:Channel, AUTHOR="Whay Lee and Pierre A. Humblet", TITLE="Channel Reuse Multiple Access Protocol for Bidirectional Bus Networks", BOOKTITLE=icc, PAGES="1703-1707", MONTH=apr, YEAR=1990, LANGUAGE="English", REFERENCES=9, KEYWORDS="multiple access; channel reuse; bidirectional bus", ABSTRACT="We propose a novel contention-free multiple access protocol for bidirectional passive bus packet networks. One version of the protocol has a simple fixed assignment transmission scheduling similar to that of the Time Division Multiple Access protocol, except that left-going and right-going packets may only be transmitted in alternate rounds. Another version of the protocol employs a simple reservation scheme to provide a demand assignment transmission scheduling. In either case, the protocol may offer a maximum throughput exceeding one packet per packet transmission time under appropriate conditions, where throughput is defined to be the number of distinct packets successfully transmitted per packet transmission time. This is possible through channel reuse as explained in this paper. For this reason, we call this protocol Channel Reuse Multiple Access protocol.", } @INPROCEEDINGS{Lee9004:Space, AUTHOR="M. J. Lee and Song Li", TITLE="Performance of a non-blocking space-division packet switch in a time variant non-uniform traffic environment", BOOKTITLE=icc, VOLUME=2, PAGES="308.5.1-7", DAYS=16, MONTH=apr, YEAR=1990, REFERENCES=9, KEYWORDS="Analysis; nonblocking; packet switching; matrix geometric method",