@ARTICLE{Shin93:Mixed, AUTHOR="Kang G. Shin and Qin Zheng", TITLE="Mixed time-constrained and non-time-constrained communications in local area networks", JOURNAL=ieeecom, YEAR=1993, KEYWORDS="local area networks; medium access protocols; time constrained traffic; real-time traffic; token ring; token bus; FDDI; 802.4", ABSTRACT="It is well known that some timed-token medium access protocols for local area networks (LANs) like the IEEE 802.4 token bus and the FDDI token ring can guarantee the medium access delay for time constrained packets. However, a problem which has been largely overlooked is how these protocols can be made to provide a maximum throughput for non-time-constrained packets while guaranteeing the delay bound of time-constrained packets. We first show how the parameters of the IEEE 802.4 token bus and the FDDI token ring can be set to solve the above problem. Then, we design a new timer mechanism for the timed-token protocols which provides the highest guaranteed throughput of non-time-constrained packets among a set of medium access protocols called the token passing protocol, to which most the existing non-contention LAN protocols belong. We present numerical examples to compare different protocols, all of which have shown the superiority of the proposed protocol to others.", } @INPROCEEDINGS{Yaro9303:Calculating, AUTHOR="O. Yaron and M. Sidi", TITLE="Calculating Performance Bounds in Communication Networks", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", MONTH="March/April", YEAR=1993, KEYWORDS="bounds; quality of service; end-to-end analysis", } @INPROCEEDINGS{Sohr9303:Real, AUTHOR="K. Sohraby and A. E. Eckberg", TITLE="Real-time high percentile tracking of quasi-exponential delays", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", VOLUME=2, PAGES="850-857 (7c.4)", MONTH="March/April", YEAR=1993, KEYWORDS="delay estimation; tail estimation", ABSTRACT="In many applications certain parameters of a system should be set based on some large percentiles of a delay random variable, for which the characteristics may not be known, or may change slowly with time. Assuming that sample value of delays are available sequentially, we obtain a simple algorithm to track two key statistical characteristics of the delay. Any high percentile may then be approximated as a simple linear function of these parameters. The approach is based on a ``quasi-exponential'' assumption concerning the delays.", ANNOTE="might be useful for setting playout delay", } @INPROCEEDINGS{Sohr9303:Theory, AUTHOR="K. Sohraby", TITLE="On the theory of general on-off sources with applications in high-speed networks", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", VOLUME=2, PAGES="401-410 (4a.3)", MONTH="March/April", YEAR=1993, KEYWORDS="on-off sources; call admission; performance evaluation; statistical multiplexer", ABSTRACT="In this paper, we first provide a general theory of on-off sources. Our basic source model is characterized by alternating independent on (burst) and off (silence) periods, where these periods may have general distributions. Other more complex sources are constructed and their basic behavior is characterized in terms of the basic source model. Heterogeneous and homogeneous statistical multiplexers fed by such sources are considered. In the heterogeneous environment, a simple result on the tail behavior of the multiplexer queue length distribution in the heavy traffic is provided which is a simple function of the individual source peak rates, and the first two moments of their on and off periods. In the homogeneous environment, asymptotic results on the tail behavior of the queue length distribution is provided for all level of utilizations. In this case, the behavior strongly depends on the complete distribution of the on and off periods of the traffic source. The simple result in the heterogeneous environment, suggests a new call admission policy for general on-off sources in high speed networks. This policy can be easily implemented in real time, depends only on the first two moments of the on and off periods of individual sources and their respective peak rates.", } @INPROCEEDINGS{Rubi9303:Burst, AUTHOR="I. Rubin and Kuang-Shin Lin", TITLE="A burst-level adaptive input-rate flow control scheme for {ATM} networks", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", VOLUME=2, PAGES="386-394 (4a.1)", MONTH="March/April", YEAR=1993, KEYWORDS="flow control; rate control; multiplexer; ATM", ABSTRACT="We propose a new input rate flow control scheme wherein the credit increment rate is updated periodically as the loading state varies. Based upon the observed status of each station's burst-level activity, the network access node distributes feedback control signaling messages to the stations. These signaling messages allow the stations to adapt their credit increment rates in accordance with system burst-loading conditions. We present queueing models to study the system performance at the access points of such a system. For this purpose, we select a subnetwork topology which involves a network switch (such as a fast packet switch in high-speed metropolitan or wide area networks) and a number of regulated source stations which drive the network switch. To avoid packet retransmission due to cell losses at the access switch, each user station (or CPN) implements a local replica of the input regulation scheme. The output traffic streams from the source stations, as regulated by the local input rate control mechanism (and adapted by the status messages) load a packet switch which is modeled as a multiple-server queueing system. Performance curves are presented to illustrate the statistical queue-size behavior and message delays at both the source stations and the network switch.", } @MISC{ISO93:10646, AUTHOR="{International Standards Organization}", TITLE="{ISO/IEC} {DIS} 10646-1:1993 Information Technology -- Universal Multiple-Octet Coded Character Set {(UCS)} -- Part {I:} Architecture and Basic Multilingual Plane", YEAR=1993, KEYWORDS="character set; 10646", } @INPROCEEDINGS{Pare9303:Generalized, AUTHOR="Abhay Parekh and Robert Gallager", TITLE="A generalized processor sharing approach to flow control in integrated services networks -- the multiple node case", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", VOLUME=2, PAGES="521-530 (5a.1)", MONTH="March/April", YEAR=1993, KEYWORDS="delay bounds; weighted fair queuing; generalized processor sharing", ABSTRACT="Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers. When only a subset of the sessions are leaky-bucket constrained, we give succinct per-session bounds that are independent of the behavior of the other sessions and also of the network topology. However, these bounds are only shown to hold for each session that is guaranteed a backlog clearing rate that exceeds the token arrival rate of its leaky bucket. When all the sessions are leaky bucket constrained, a much larger class of networks called consistent relative session treatment (CRST) networks is analyzed. The session $i$ route is treated as a whole, yielding tighter bounds than those that result from adding the worst-case delays (backlogs) at each of the servers in the route. The bounds on delay and backlog for each session are efficiently computed from a universal service curve, and it is shown that these bounds are achieved by ``staggered'' greedy regimes when an independent session relaxation holds. Propagation delay is also incorporated into the model. Finally, the analysis of arbitrary topology GPS networks is related to packet GPS networks (PGPS).", } @INPROCEEDINGS{Doar9303:Bad, AUTHOR="Matthew Doar and I. Leslie", TITLE="How bad is naïve multicast routing?", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", VOLUME=1, PAGES="82-89 (1c.2)", MONTH="March/April", YEAR=1993, KEYWORDS="multicast; routing; Steiner tree; random network; random graphs", ABSTRACT="When the problem of routing multicast connections in networks has been previously considered, the emphasis has been on the source transmitting to a fixed set of destinations (the multicast group). There are some applications where destinations will join and leave the multicast group. Under these conditions, computing an ``optimal'' spanning tree after each modification may not be the best way to proceed. An alternative is to make modest alterations to an existing spanning tree to derive a new one. An extreme, though non-optimal, variation of this is to use minimal cost source to destination routing for each destination, effectively ignoring the existing multicast tree. We examine just how non-optimal these trees are in random general topology networks and conclude that they are worse by only a small factor. The factor is reduced still further if a hierarchy is imposed upon the random network to give a more realistic model.", } @ARTICLE{Arav9301:Image, AUTHOR="R. Aravind and Glenn L. Cash and D. L. Duttweiler and H.-M. Hang and B. G. Haskell and A. Puri", TITLE="Image and video coding standards", JOURNAL=atttj, VOLUME=71, NUMBER=1, PAGES="67-89", MONTH="January/February", YEAR=1993, KEYWORDS="MPEG; JPEG; JBIG; Px64; image compression; discrete cosine transform; packet video; DCT; video coding", ABSTRACT="This paper describes several standard compression algorithms developed in recent years.", } @BOOK{Come93:Internetworking, AUTHOR="D. Comer and David L. Stevens", TITLE="Internetworking with {TCP/IP} -- Client-Server Programming and Applications", ISBN="0-13-474222-2", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs, New Jersey", VOLUME=3, YEAR=1993, KEYWORDS="TCP; IP; protocol implementation; operating systems", } @BOOK{Pisc93:Open, AUTHOR="D. Piscitello and A. Lyman Chapin", TITLE="Open systems networking: {TCP/IP} and {OSI}", ISBN="0-201-56334-7", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1993, KEYWORDS="OSI; TCP; IP; computer networks; network architecture; network standards", } @BOOK{Part93:Gigabit, AUTHOR="C. Partridge", TITLE="Gigabit networking", ISBN="0-201-56333-9", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1993, KEYWORDS="computer networks; protocol architecture; survey", } @BOOK{Lync93:Internet, AUTHOR="Dan Lynch and Marshall T. Rose", TITLE="{Internet} system handbook", ISBN="0-201-56741-5", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1993, KEYWORDS="Internet; TCP; IP; internetworking; survey; security", } @ARTICLE{Lin9304:HAP, AUTHOR="Y. Lin and Tsong-Ming Tsai and Shan-shan Huang and M. Gerla", TITLE="{HAP:} A New Model for Packet Arrivals", JOURNAL=jhsn, VOLUME=2, NUMBER=4, YEAR=1993, } @ARTICLE{Park9304:Warp, AUTHOR="Kun I. Park", TITLE="Warp control: a dynamically stable congestion protocol and its analysis", JOURNAL=jhsn, VOLUME=2, NUMBER=4, YEAR=1993, } @ARTICLE{Krau93:FCC, AUTHOR="Jeffery A. Krauss", TITLE="{FCC} creates new wireless business opportunities", JOURNAL="Applied Microwave and Wireless", PAGES="13-29", MONTH="Fall", YEAR=1993, KEYWORDS="FCC; spectrum allocation; PCS; wireless; cellular radio; mobile communications", } @INPROCEEDINGS{Hosc9303:Tailoring, AUTHOR="Philipp Hoschka", TITLE="Towards tailoring protocols to application specific requirements", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", PAGES="647-653 (5d.4.1)", MONTH="March/April", YEAR=1993, KEYWORDS="ASN.1; GOSIP; protocol implementation; protocol configuration", ABSTRACT="A distributed application that uses a standard protocol for communication very often applies only a subset of the protocol options provided by the standard. However, it is difficult today for an application developer to tailor standard protocol options to the specific needs of an application, because no appropriate profiling method (formalized profile description and protocol configuration tool) exists. In this paper, we describe a prototype of such a method that is applicable to any protocol specified in ASN.1. We use the profiling of OSI application layer standards as a proof of concept. By applying our method to formalize the U.S. government profiles we were able to reduce the source code size of major parts of common OSI applications by 30 to 50\%.", } @TECHREPORT{Hwan93:MDP, AUTHOR="RenHung Hwang and James F. Kurose and Donald F. Towsley", TITLE="{MDP} routing in {ATM} networks using the virtual path concept", TYPE="Technical Report", INSTITUTION="Department of Computer Science, University of Massachusetts", ADDRESS="Amherst, Massachusetts", YEAR=1993, KEYWORDS="routing; MDP; virtual path; Markov Decision Process; VP", ABSTRACT="The virtual path (VP) concept has been proposed to simplify traffic control and resource management in future BISDN. An advantage of this concept is that call setup processing can be significantly reduced when resources are reserved on VP's. However, this advantage can be offset by the decrease in the statistical multiplexing gains of networks supporting VP's. The focus of this paper is on how to improve bandwidth efficiency through adaptive routing when capacity is reserved on VP's. We first examine two VP capacity reservation strategies. We then design and evaluate computationally feasible Markov decision process-based routing algorithms and show that the network call blocking probability can be significantly reduced by MDP routing.", URL="ftp://gaia.cs.umass.edu/pub/Hwang93:MDP.ps.Z", } @ARTICLE{Whit93:CDMA, AUTHOR="Joseph F. White", TITLE="What is {CDMA?}", JOURNAL="Applied Microwave and Wireless", PUBLISHER="J. F. White Publications", PAGES="5-8", MONTH="Fall", YEAR=1993, KEYWORDS="CDMA; cellular phone; modulation; spread spectrum", } @TECHREPORT{Claf93:Measurement, AUTHOR="Kimberly Claffy and George C. Polyzos and H. Braun", TITLE="Measurement Considerations for Assessing Unidirectional Latencies", INSTITUTION="Computer Systems Laboratory, UCSD", ADDRESS="San Diego, California", NUMBER="UCSD Report CS92-252", NOTE="also Journal of Internetworking, 4(3), September 1993", YEAR=1993, ABSTRACT="This paper presents a study of single direction latencies to selected destinations of the Internet utilizing a variety of paths. The objective is to demonstrate that round-trip latencies are an insufficient and sometimes misleading method to determine unidirectional delays. This claim has significant implications for high-speed, multi-application, wide-area, traffic aggregating networking environments which often require predictability of precise delay.", ANNOTE="Assuming that a round trip path is symetric and dividing a RTT in half to find the latency in either the outgoing or incoming tranmission path is highly inaccurate as there are both static and dynamic reasons for the paths traversed by packets between hosts to be asymetric. The static reason is that the route may be permanently configured to be asymetric because of network harware limitations (for example simplex links). The dynamic reasons for asymetrically datagram paths are resource contentions between other components in the network. Digitial continuous media networked applications require good predicatability of unidirectional network delays, which simply halving the RTT cannot give.", URL="ftp://ftp.sdsc.edu/pub/sdsc/anr/papers/single.ps.Z", } @ARTICLE{Demp93:Research, AUTHOR="Lorcan Dempsey", TITLE="Research networks and academic information services: towards an academic information infrastructure: Part 1", JOURNAL="Journal of Information Networking", VOLUME=1, NUMBER=1, YEAR=1993, ANNOTE="SuperJANET will have backbone rings operating at 622Mbps. with 6 pilot sites operating at 140Mbps and a larger number of smaller sites operating at 10Mbps.", } @INPROCEEDINGS{Labo9303:Logical, AUTHOR="Jean-Francois Labourdette and A. S. Acampora", TITLE="Logical Clustering for the Optimization and Analysis of a Rearrangeable Distributed {ATM} Switch", BOOKTITLE=infocom, ADDRESS="San Francisco, California", MONTH="March/April", YEAR=1993, ABSTRACT="This paper describes a practical approach for the analysis and operation of medium to large size distributed ATM switches based on an original optical reconfigurable architecture. The optical nature of the switch provides enormous bandwidth with input/output port rates of the order of Gbits/sec., and the distributed approach is highly modular, creating an easily growable switch. Furthermore, the interconnection pattern between input and output ports is dynamically reconfigurable; the switch can thus exploit nonuniformities in the offered traffic and optimize its connectivity accordingly. For a $24 \times 24$ switch, this leads to improved performance that match those of a fully connected output buffered ideal centralized switch. In medium to large reconfigurable switches, clustering techniques are required for optimizing the connection diagram among modules and routing traffic through the switch. While clustering will save network resources, it will also result in some performance degradation due to non optimal connectivity and routing. However, simulation results for a switch of size $81 \times 81$ seem to indicate that the traffic-handling capability scales well with the size of the switch when non-uniformity prevails in the offered traffic, a realistic assumption. Furthermore, clustering techniques would permit the optimization and operation of much larger reconfigurable distributed ATM switches.", } @INCOLLECTION{Cerf93:Core, AUTHOR="V. G. Cerf", TITLE="Core Protocols", BOOKTITLE="Internet System Handbook", EDITOR="Daniel C. Lynch and Marshall T. Rose", PUBLISHER="Addison Wesley", ADDRESS="Reading, Massachusetts", YEAR=1993, } @TECHREPORT{Claf93:Application, AUTHOR="Kimberly Claffy and H. Braun and George C. Polyzos", TITLE="Application of Sampling Methodologies to Wide-Area Network Traffic Characterization", INSTITUTION="UCSD", NUMBER="Technical Report CS9", YEAR=1993, } @TECHREPORT{Cox93:Market, AUTHOR="B. J. Cox", TITLE="Market Processes as a New Foundation for Software Engineering", INSTITUTION="George Mason University", YEAR=1993, } @MISC{Curr93:Personal, AUTHOR="John Curran", TITLE="Personal communication", YEAR=1993, } @TECHREPORT{Goff93:Internet, AUTHOR="William Goffe", TITLE="{Internet} Resources for Economists", INSTITUTION="University of Southern Mississippi", YEAR=1993, URL="gopher://niord.shsu.edu/11gopher\_root\%3a\%5b\_DATA.ECONOMICS\%5d", } @INPROCEEDINGS{Jami93:Admission, AUTHOR="S. Jamin and L. Zhang and D. D. Clark and S. Shenker", TITLE="An Admission Control Algorithm for Predictive Real-Time Service", BOOKTITLE="3rd International Workshop on Networking and Operating System Support for Digital Audio and Video", PUBLISHER="Springer-Verlag, New York", YEAR=1993, } @TECHREPORT{MacK93:Local, AUTHOR="Jeffrey MacKie-Mason and Donna Lawson", TITLE="Local Telephone Demand with Optional and Nonlinear Prices", INSTITUTION="University of Michigan", YEAR=1993, } @TECHREPORT{MacK93:Economics, AUTHOR="Jeffrey MacKie-Mason and Hal R. Varian", TITLE="Some Economics of the {Internet}", INSTITUTION="University of Michigan", YEAR=1993, } @TECHREPORT{Kosc93:Efficient, AUTHOR="M. Koschat and P. Srinagesh and L. Uhler", TITLE="Efficient price and capacity choices under uncertain demand --an empirical analysis", INSTITUTION="Yale School of Management and Bellcore", YEAR=1993, } @INCOLLECTION{Lync93:Historical, AUTHOR="Dan Lynch", TITLE="Historical Evolution", BOOKTITLE="Internet System Handbook", EDITOR="Daniel C. Lynch and Marshall T. Rose", PUBLISHER="Addison Wesley", ADDRESS="Reading, Massachusetts", YEAR=1993, } @BOOK{Nagu93:Economics, AUTHOR="Anna Nagurney", TITLE="Network Economics", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston", YEAR=1993, } @INCOLLECTION{Econ93:Compatibility, AUTHOR="Nicholas Economides", TITLE="Compatibility and the Creation of Shared Networks", BOOKTITLE="Electronic Service Networks", EDITOR="Margaret E. Guerin-Calvert and Steven S. Wildman", PUBLISHER="Praeger", ADDRESS="New York", PAGES="39-55", YEAR=1993, } @UNPUBLISHED{Roma93:Dynamics, AUTHOR="Allyn Romanow and S. Floyd", TITLE="Dynamics of {TCP} Traffic over {ATM} Networks", INSTITUTION="Sun Microsystems", ADDRESS="Mountain View, California", NOTE="see also 6th IEEE LAN/MAN Workshop", YEAR=1993, REFERENCES=41, KEYWORDS="TCP; ATM; congestion; packet dropping; congestion avoidance; packet loss; goodput", ABSTRACT="We investigate the performance of TCP connections over ATM networks with no ATM-level congestion control, and compare it to the performance of TCP over packet-based networks. For simulations with congestion, the effective throughput of TCP over ATM can be quite low when cells are dropped at the congested ATM switch. The low throughput is due to wasted bandwidth as the congested link transmits cells from 'corrupted' packets, packets containing cells that have already been dropped at the switch. This effect can be corrected, and high throughput obtained, if the switch monitors the size of the output buffer queue and drops whole packets when the queue reaches a threshold level; we call this strategy early packet discard. We also discuss general issues of congestion avoidance for best-effort ATM traffic.", URL="ftp://playground.sun.com/pub/tcp\_atm/tcpatm\_extended.00.ps.Z", } @ARTICLE{Schi93:Verifying, AUTHOR="I. Schieferdecker", TITLE="Verifying Performance Oriented Properties of {TIS} Specifications", JOURNAL="Journal of Mathematical Modelling and Simulation in Systems Analysis (SAMS)", VOLUME=13, PAGES="139-162", YEAR=1993, KEYWORDS="timed interacting systems; quality of service; real-time verification; send-and-wait protocol", ABSTRACT="With the increasing bandwidth of communication networks and increasing variety of applications the impact of {\em Quality of Service} (QoS) parameters becomes more and more important. In this paper we use a performance--oriented process algebraic calculus called {\em Timed Interacting Systems} (TIS) for the verification of bounded performance properties, a special kind of QoS properties. Requirements on bounded performance properties can equivalently be described as sets of timing deadlines for that system. A timing deadline demands that time distances between certain events are always within a given time interval, i.e. that events do not occur too early and not too late. We decided to express timing deadlines in a discrete--time linear temporal logic. For the verification, whether a given TIS specification satisfies some timing deadlines, we represent its dynamical behaviour by a finite state machine. The TIS specification has to fulfill three conditions to do this: time progress, bounded monotonicity, and lack of recursive process instantiations under parallel union. We annotate already in the system specification actions by monitoring events defining the time points, from which the time distances for the timing deadlines have to be evaluated. Finally we give decision procedures to show, that the underlying finite state machine, i.e. the TIS specification itself, satisfies the required timing deadlines. In order to demonstrate the application of TIS for the verification of bounded performance properties we investigate a classical Send--and--Wait protocol.", URL="ftp://ftp.fokus.gmd.de/pub/step/papers/Schi.XII93.Verifying.ps.gz", } @ARTICLE{Woli93:Unified, AUTHOR="Adam M Wolisz", TITLE="A Unified Approach to Formal Specification of Communication Protocols and Analysis of their Performance", JOURNAL="Journal of Mathematical Modelling and Simulation in Systems Analysis (SAMS)", VOLUME=13, PAGES="59-88", YEAR=1993, KEYWORDS="timed interacting systems; communication protocols; performance analysis; specification of communication protocols", ABSTRACT="Different description techniques have been traditionally used either for the formal description of communication protocols or for the analysis of their performance. Recently, however, the idea to develop an approach which could be used for both these purposes seems to gain acceptance. Timed Interacting Systems (TIS), a proposal for extending the classical framework of process algebras is presented. Means for expressing the duration of events and time-oriented conditions for the occurrence of events are provided. In addition quantifying the nondeterminism in system behavior is achieved through quantifying the internal choice operation and through introducing logical resources with a priority access scheme. Although in general the model of full parallelism is supported, TIS offers also means for controlled reduction of the potential level of parallelism, making it possible to reflect constraints introduced by an execution environment. Finally formulating performance oriented statements and performance studies are enhanced by the concept of a monitoring environment, supporting the observation of events and intervals between events.", } @TECHREPORT{Schi9307:Verification, AUTHOR="I. Schieferdecker", TITLE="On the Verification of deterministic Bounds for Quality-of-Service Characteristics of Communication Protocols", TYPE="Forschungsprojekte des Graduiertenkollegs-Kommunikationbasierte Systeme", INSTITUTION="TU Berlin, Fachbereich Informatik", ADDRESS="Berlin, Germany", NUMBER=19, YEAR=1993, URL="ftp://ftp.fokus.gmd.de/pub/step/papers/Schi.VII93.Verification.ps.gz", } @INPROCEEDINGS{Gute93:Sharing, AUTHOR="Thomas Gutekunst and B. Plattner", TITLE="Sharing Multimedia Applications Among Heterogeneous Platforms", BOOKTITLE="2nd International Conference on Broadband Islands", ADDRESS="Athens, Greece", YEAR=1993, KEYWORDS="JVTOS; multimedia", ABSTRACT="JVTOS (Joint Viewing and Tele-Operation Service), which is being implemented within CEC/RACE II project CIO (R2060), is a new teleservice for high-speed networks allowing physically distributed users to work in a collaborative fashion. Core functionality of JVTOS is provided by a so-called application sharing service which allows multimedia applications to be displayed and interacted with on multiple users' workstations simultaneously. This paper discusses concept and design issues for the JVTOS application sharing service and its implementation on different platforms. The currently supported platforms are Sparc (X Window System), and Macintosh (QuickDraw). The primary aims of the service are to support heterogeneous platforms and to integrate continuous media.", URL="ftp://komsys.ethz.ch/pub/papers/Gutekunst93b.ps", } @INPROCEEDINGS{Cock93:Making, AUTHOR="A. Cockburn and Saul Greenberg", TITLE="Making contact: getting the group communicating with groupware", BOOKTITLE="COSC", ORGANIZATION="ACM", YEAR=1993, REFERENCES=35, KEYWORDS="contact facilitation; casual interaction; coordination; computer supported cooperative work; groupware.", ABSTRACT="While groupware is readily available, people on wide area networks --- such as the Internet --- have considerable trouble contacting each other and setting up groupware connections. To pinpoint why this occurs, this paper identifies human factors critical to getting a group communicating through groupware. It addresses how people find suitable partners, and how people choose appropriate communication mediums. These factors are discussed in detail, and form a design foundation for systems that promote social presence and that integrate communication. Existing systems are critically reviewed and shown to be inadequate for general use over a wide area net, for they either do not meet some basic design criteria, or they require a very high technological entry level that is beyond the reach of most computer users. As an alternative, the paper presents the design considerations behind TELEFREEK , a flexible, extensible, and customizable platform for collaboration. Drawing on resources freely available to the Internet community, TELEFREEK assists people making contact with others, and integrates access to common communication facilities.", URL="ftp://ftp.cpsc.ucalgary.ca/pub/projects/grouplab/papers/making-contact.COCS93.ps.Z", } @INPROCEEDINGS{Rose93:Building, AUTHOR="Mark Roseman and Saul Greenberg", TITLE="Building flexible groupware through open protocols", BOOKTITLE="COSC", ORGANIZATION="ACM", YEAR=1993, REFERENCES=23, KEYWORDS="computer supported cooperative work; CSCW; conference control; personalizable groupware; expandability; open protocols; implementation technique", ABSTRACT="This paper presents a technical approach to building flexible groupware applications. Flexibility provides the promise of personalizable groupware , allowing different groups to work with the system in diverse ways which best suit the group's own needs. An implementation technique called open protocols is described, which is a variation of client/server architectures. Open protocols facilitate the addition of group-specific modules long after the system has been created. Three examples illustrating the use of open protocols are presented: floor control, conference registration, and brainstorming. Finally, a number of issues facing the groupware developer using open protocols are addressed, along with strategies that can help in dealing with these issues.", URL="ftp://ftp.cpsc.ucalgary.ca/pub/projects/grouplab/papers/open-protocols.COCS93.ps.Z", } @BOOK{Stall93:SNMP, AUTHOR="W. Stallings", TITLE="{SNMP,} {SNMPv2,} and {CMIP:} the practical guide to network management", ISBN="0-201-63331-0", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1993, KEYWORDS="network management; SNMP; CMIP", } @BOOK{Kess93:ISDN, AUTHOR="G. Kessler", TITLE="{ISDN:} concepts, facilities, and services", EDITION="2nd", ISBN="0-07-034247-4", PUBLISHER="McGraw-Hill", ADDRESS="New York, NY", YEAR=1993, KEYWORDS="ISDN; BISDN; X.25; ATM; signaling; LAPB; LAPD", } @INPROCEEDINGS{Chri93:Writing, AUTHOR="Wayne Christopher", TITLE="Writing Object-oriented Tcl-based Systems using Objectify", BOOKTITLE="Tcl Workshop Proceedings", INSTITUTION="University of California, Berkeley", ADDRESS="Berkeley, California", YEAR=1993, REFERENCES=4, KEYWORDS="Tcl; Tk; C++; OOP", ABSTRACT="This paper describes Objectify, a tool that facilitates the integration of C++ classes into Tcl-based systems. It uses an object model similar to that of Tk, and makes it possible for the programmer to annotate his classes with information about which member functions should be exported as Tcl ``methods'', and which data members should be accessible from Tcl via ``configure'' commands. Objectify automatically generates glue code to interface between Tcl and C++, and also creates documentation files. This approach is fairly light weight and straightforward, and automates the tedious and error prone task of maintaining Tcl command interfaces to lower-level object implementations.", URL="ftp://harbor.ecn.purdue.edu/pub/tcl/workshop/tcl-proceedings.tar.Z", } @ARTICLE{Pete93:Multiplexers, AUTHOR="J. Petersen and T. Gillen", TITLE="Multiplexers Sum {D/D/1} with service in cyclic order and service in the order of arrival", JOURNAL=ett, VOLUME=4, NUMBER=4, PAGES="67-75", YEAR=1993, REFERENCES=12, KEYWORDS="ATM; multiplexer; DI/D/1; waiting time", ABSTRACT="The waiting times of cells in a mux and the output process is analyzed in closed form.", } @ARTICLE{Hill93:CM, AUTHOR="W. D. Hillis and L. W. Tucker", TITLE="The {CM-5} connection machine: a scalable supercomputer", JOURNAL=cacm, VOLUME=36, NUMBER=11, PAGES="31-40", YEAR=1993, REFERENCES=24, KEYWORDS="Computer architecture; parallel computing; supercomputer; MIMD", ABSTRACT="The architecture of the CM-5 is described. Based on SPARC processors and two high-speed interconnection systems, up to 16384 PEs can be interconnected. This gives up to 2048 GFLOPS peak.", } @ARTICLE{Chan93:Telecommunications, AUTHOR="Shih-Fu Chang and Bezalel X Gavish", TITLE="Telecommunications network topological design and capacity expansion: formulations and algorithms", JOURNAL=ts, PUBLISHER="J. C. Balzer", ADDRESS="Basel", VOLUME=1, PAGES="99-131", YEAR=1993, REFERENCES=15, KEYWORDS="Communication network; network topology; network design; network capacity; heuristics", ABSTRACT="This paper formulates the network topology and capacity expansion problem in a teleco. network and suggests a family of heuristics and a dual-based lower bounding procedure for solving ist.", } @ARTICLE{Diou93:Dimensioning, AUTHOR="O. Dioume and F. Soumis", TITLE="Dimensioning Telecommunications networks with budget constraints", JOURNAL=ts, PUBLISHER="J.C. Balzer", ADDRESS="Basel", VOLUME=1, PAGES="49-177", YEAR=1993, REFERENCES=10, KEYWORDS="Communication network; network budget; network planning", ABSTRACT="We present a theroretical study of a modified version of the dimensioning problem for telephone networks where the network does not contain any existing capacity and where the available capital is severely limited, a situation which can occur in private networks as well as in the public networks of developingcountries.", } @ARTICLE{Fisc93:Methodology, AUTHOR="M. J. Fischer and D. Swinsky and D. Garland and L. Stanfel", TITLE="A Methodology for designing large private line transmission networks with multiple facilities", JOURNAL=ts, PUBLISHER="J.C. Balzer", ADDRESS="Basel", VOLUME=1, PAGES="243-261", YEAR=1993, REFERENCES=18, KEYWORDS="Communication network; network topology; network design; network capacity", ANNOTE="Deregulation and the recent advances in telecomm. technologies have significantly reduced the cost of transmission facilities. This reduction has made it attractive for corporation and government agenties to develop their own private line transmission networks. In this paper we present a methology we have used in designing these private line transmission networks.", } @ARTICLE{Gouv93:Comparison, AUTHOR="L. Gouveia", TITLE="A Comparison of directed formulations for the capacitated minimal spanning tree problem algorithms", JOURNAL=ts, PUBLISHER="J.C. Balzer", ADDRESS="Basel", VOLUME=1, PAGES="51-76", YEAR=1993, REFERENCES=4, KEYWORDS="Communication network; network topology; network design; network capacity", ANNOTE="In this paper, we compare linear integer programming directed formulations for the capacitated minimal spanning tree (CMST) problem. This problem is directly related to network design and consists of finding the cheapest way to link a set of terminals at different locations with a central node.", } @ARTICLE{Hanl93:Information, AUTHOR="S. V. Hanly and P. Whiting", TITLE="Information-theoretic capacity of multi-receiver networks", JOURNAL=ts, PUBLISHER="J.C. Baltzer", ADDRESS="Basel", VOLUME=1, PAGES="1-42", YEAR=1993, REFERENCES=14, KEYWORDS="Information theory; mobile radio; spread spectrum", ABSTRACT="We consider multi-receiver networks with diversity reception from an information-theoretic point of view. In particular, we find their capacity and investigate how the frequency spectrum should be allocated to users.", } @ARTICLE{Hant93:Designing, AUTHOR="S. L. Hantler and D. Milch", TITLE="Designing reliable networks with short paths", JOURNAL=ts, PUBLISHER="J.C. Balzer", ADDRESS="Basel", VOLUME=1, PAGES="43-50", YEAR=1993, REFERENCES=4, KEYWORDS="Communication network; network topology; network design; network capacity; shortest path", ABSTRACT="We present a technique for constructing highly reliable networksin which locations consist of pairs of redundant vertices and inwhich every pair of locations has a pair of short disjoint pathsconnecting them.", } @ARTICLE{Hubn93:Finite, AUTHOR="F. H bner and P. Tran-Gia", TITLE="Performance of a Finite Capacity Asynchronous Multiplexer with modulated input", JOURNAL=ts, PUBLISHER="J.C. Baltzer", ADDRESS="Basel", VOLUME=1, PAGES="263-278", YEAR=1993, REFERENCES=15, KEYWORDS="ATM; multiplexer; performance evaluation", ABSTRACT="In this paper, a finite capacity multiplexer in ATM environmentswith modulated deterministic input sources is investigated. We consider three cases of input traffic. The main performance measures in this study are the cell and call blocking probabilities.", } @ARTICLE{Lee93:Asynchronous, AUTHOR="G. Lee and Chong Kwan Un", TITLE="Design and Performance Analysis of an Asynchronous Non-blocking switch with window policy", JOURNAL=ts, PUBLISHER="J.C. Baltzer AG", ADDRESS="Basel", VOLUME=1, PAGES="77-97", YEAR=1993, REFERENCES=8, KEYWORDS="Performance evaluation; packet switching", ABSTRACT="We propose an architecture of an asynchronous non-blocking switch. The asynchronous switch proposed in this paper with its implementation of a window scheme can increase its maximum throughput up to 1 in the case of a minimum changeover time and large packet size. We also investigate the delay characteristicsof the asynchronous switch.", } @ARTICLE{Park93:Delay, AUTHOR="Jongseung Park and K. Kang", TITLE="Delay Analysis for Multidimensional Queueing Processes in {CSMA/CD} Local Area Networks", JOURNAL=ts, PUBLISHER="J.C. Baltzer AG", ADDRESS="Basel", VOLUME=1, PAGES="217-242", YEAR=1993, REFERENCES=28, KEYWORDS="CSMA/CD; LAN; semi Markov process", ABSTRACT="A CSMA/CD local area network consists of a single server (the channel) and multiple interacting queues of messages. The message queueing process is modeled as a multidimensional semi-Markov chain. An effective approximation method to compute the meanpacket delay in equilibrium is developed. We also develop a simulation model to validate approximation results.", } @ARTICLE{Ryde93:Optimal, AUTHOR="T. Ryden", TITLE="Optimal Load Control of {SPC} Switches: Waiting Time Minimization", JOURNAL=ts, PUBLISHER="J.C. Baltzer AG", ADDRESS="Basel", VOLUME=1, PAGES="179-194", YEAR=1993, REFERENCES=18, KEYWORDS="SPC; semi Markov process; performance evaluation", ABSTRACT="We address the problem of load control of a switching node with a centralized processor architecture. The problem of finding regulators that minimize the mean dialtone delay is formulated and solved using a semi-Markov decision process model. We also study the transient properties of the optimal regulators, their behaviour for an MMPP arrival process, and discuss their robustness with respect to various model assumptions.", } @ARTICLE{Sans93:Centralized, AUTHOR="B. Sanso and F. Soumis and M. Gendreau", TITLE="Centralized and Decentralized Stochastic Routing Models in telecommunication networks", JOURNAL=ts, PUBLISHER="J.C. Baltzer AG", ADDRESS="Basel", VOLUME=1, PAGES="133-148", YEAR=1993, REFERENCES=30, KEYWORDS="Stochastic routing; network planning; decentralization; circuit switching", ABSTRACT="With the advent of non-hierarchical routing in circuit-switched telecommunication networks, on-line policies have been developedwith the objective of optimizing some measure of gain or performance. These policies are decentralized. We present a decentralized routing model to be used in network planning. We compare it theoretically and empirically with a centralized multicommodity flow model previously presented.", } @ARTICLE{Taki93:Batch, AUTHOR="T. Takine and Toshiharu Hasegawa", TITLE="A batch {SPP/G/1} queue with multiple vacations and exhaustive service discipline", JOURNAL=ts, PUBLISHER="J.C. Baltzer AG", ADDRESS="Basel", VOLUME=1, PAGES="195-215", YEAR=1993, REFERENCES=15, KEYWORDS="Batch arrival; single server; Poisson process; server vacation", ABSTRACT="This paper considers a batch-arrival single server queueing system with multiple vacations and exhaustive service discipline. Customers arrive to the system in accordance with a batch switched Poisson process. We analyze the stationary queue length distribution and derive various formulas for queue lengths and waiting times.", } @ARTICLE{Zhan93:Modified, AUTHOR="Z. Zhang and A. S. Acampora", TITLE="Performance of a Modified Polling Strategy for Broadband Wireless {LANs} in a Harsh Fading Environment", JOURNAL=ts, PUBLISHER="J. C. Baltzer AG", ADDRESS="Basel", VOLUME=1, PAGES="279-294", YEAR=1993, REFERENCES=13, KEYWORDS="Communication network; radio channel; polling; LAN", ABSTRACT="In this paper, we consider a radio-based communication network in which a single, high speed radio channel is shared by some plurality of small portable ``notebooks''. In this harsh indoor fading environment, a base-station approach is used. We propose a modified polling scheme for the indoor radio LAN channel. The efficiency of such a scheme is studied and the expected turn-around delay as a function of network load is approximately obtained", } @ARTICLE{Brun93:Buffer, AUTHOR="H. Bruneel and Yongqiang Xiong", TITLE="Buffer contents and delay for statistical multiplexers with fixed-length packet-train arrivals", JOURNAL=pe, ADDRESS="Amsterdam", VOLUME=17, NUMBER=1, PAGES="31-42", YEAR=1993, REFERENCES=8, KEYWORDS="Statistical multiplexer; discrete time queue; generating function; packet delay", ABSTRACT={A slotted statistical multiplexer is considered, to which messages containing a fixed number of fixed-length packets each, arrive at the rate of one packet per slot. The multiplexer buffer cantherefore be studied using a discrete-time queueing model with correlated arrivals, referred to as "train arrivals" in the paper. This train arrival model is completely analyzed by means of agenerating-functions approach}, } @ARTICLE{Cowe93:Concurrence, AUTHOR="L. Cowen and R. Mathar", TITLE="Concurrence probabilities for a locally slotted packet radio network by combinatorial methods", JOURNAL=pe, ADDRESS="Amsterdam", VOLUME=17, NUMBER=1, PAGES="43-51", YEAR=1993, REFERENCES=10, KEYWORDS="Slotted ALOHA; throughput; packet radio", ABSTRACT="Locally time-synchronized slot systems for broadcast communication in packet radio networks are considered. To evaluate the performance of such systems, we investigate in this case the probability of colliding slots. In an appropriate probabilistic model, the throughput of the channel is obtained, and this leads to a complete closed form representation of the system performance.", } @ARTICLE{Lee93:Transient, AUTHOR="D. Lee and Song Li", TITLE="Transient analysis of a switched Poisson arrival queue under overload control", JOURNAL=pe, ADDRESS="Amsterdam", VOLUME=17, NUMBER=1, PAGES="13-29", YEAR=1993, REFERENCES=27, KEYWORDS="Transient analysis; SPP; switched poisson process; integrated service; overload control; packet switching; finite state Markov chain", ABSTRACT="This paper studies the transient behaviour of a switched Poissonarrival queue under overload control. The queue has infinite buffer capacity with an exponential server. Our study provides important information to overload control design on packet switching networks. We also explore the transient queueing behaviour as affected by time stochastic properties of the underlyingtwo-state Markov chain for the arrival process.", } @ARTICLE{Nels93:Approximation, AUTHOR="Randolph D. Nelson and T. K. Philips", TITLE="An approximation for the mean response time for shortest queue routing with general interarrival and service times", JOURNAL=pe, ADDRESS="Amsterdam", VOLUME=17, NUMBER=2, PAGES="123-139", YEAR=1993, REFERENCES=21, KEYWORDS="Load balancing; interarrival time; Poisson process", ABSTRACT="In this paper we derive an approximation for the mean response time of a multiple queue system in which shortest queue routing is used. We assume there are $K$ identical queues with infinite capacity. Interarrival and service times are generally distributed, and an arriving job is routed to a queue of minimal length.", } @ARTICLE{Sztr93:Modelling, AUTHOR="K. Sztrik", TITLE="Modelling of a multiprocessor system in a randomly changing environment", JOURNAL=pe, ADDRESS="Amsterdam", VOLUME=17, NUMBER=1, PAGES="1-11", YEAR=1993, REFERENCES=19, KEYWORDS="Multiprocessor system; performance measure; utilization; exponential distributed transition time", ABSTRACT="A queueing-theoretic approach is developed to analyse the performance of homogeneous multiprocessor computer systems evolving ina random environment. Moreover, exact and approximate validation results are presented to illustrate the credibility of the proposed method.", } @ARTICLE{Yama93:Cell, AUTHOR="Hiroshi Yamada", TITLE="Cell/packet loss behavior in a statistical multiplexer with bursty input", JOURNAL=pe, ADDRESS="Amsterdam", VOLUME=17, NUMBER=2, PAGES="77-99", YEAR=1993, REFERENCES=30, KEYWORDS="Statistical multiplexer; bursty traffic; ATM; loss probability; performance measure; performance evaluation", ABSTRACT="Due to high correlation between consecutive cells or packets in ATM networks or high-speed packet networks, the average cell/packet loss probability does not well characterize the real cell/packet loss behavior. Other performance measures are therefore needed, and this paper considers the lossy period, the non-lossyperiod, the inter-overflow times, and the moment of the number of lost or arriving cells or packets during the lossy period.", } @ARTICLE{Lore93:Vergleich, AUTHOR="R. W. Lorenz", TITLE="Vergleich der digitalen Mobilfunksysteme in Europa {(GSM)} und Japan {(JDC)} unter besonderer Berücksichtigung der Wirtschaftlichkeitsaspekte", JOURNAL=fernmelde, PUBLISHER="Verlag für Wissenschaft und Leben, Heidecker", ADDRESS="Erlangen", VOLUME=17, NUMBER="1-2", PAGES="1-72", YEAR=1993, LANGUAGE="German", REFERENCES=104, KEYWORDS="Mobile radio; comparison; digital communication", ABSTRACT="Die technischen Unterschiede der Funkschnittstellen des GSM- und des JDC-Systems ergeben für letzteres eien größere Teilnehmerkapazität. Allerdings macht das JDC-System teilweise die Anwendung von Komponenten notwendig, die ein höheres Entwicklungsniveau haben müssen als die im GSM-System. Es werden die Vor- und Nachteile der technischen Lösungen unter Berücksichtigung der Wirtschaftlichkeit verglichen.", } @ARTICLE{Pere93:Distribution, AUTHOR="R. Perera and F. Schreiber", TITLE="Distribution function and local correlation of the delay time in queueing system {M/G/1-SRPT}", JOURNAL=aeu, PUBLISHER="Hirzel-Verlag", VOLUME=47, NUMBER=2, PAGES="108-110", YEAR=1993, REFERENCES=10, KEYWORDS="Queueing system; M/G/1; simulation; SRPT; shortest remaining processing time", ABSTRACT="The statationary distribution function of delay time has been obtained by simulation. Shows the superiority of SRPT in comparison to classical strategies FIFO and LIFO. A further essential advantage: the practically zero local correlation coefficient of delay time.", } @ARTICLE{Uhl93:Warteschlangenanalyse, AUTHOR="T. Uhl", TITLE="Warteschlangenanalyse von Datennetzen mit begrenzten Ressourcen: Ein Weg zur Leistungsanalyse der Routingtechniken", JOURNAL=aeu, PUBLISHER="Hirzel-Verlag", VOLUME=47, NUMBER=2, PAGES="91-97", YEAR=1993, LANGUAGE="German", REFERENCES=13, KEYWORDS="Queueing network; routing; packet switching; performance evaluation", ABSTRACT="This study provides the development of an analytical method for a performance analysis of loop free routing techniques in data networks with limited resources.", } @ARTICLE{Sczi93:Aggregation, AUTHOR="M. Sczittnick and T. Uhl", TITLE="Aggregation of systems with {HDLC} protocol", JOURNAL=ett, ADDRESS="Milan", VOLUME=4, NUMBER=1, PAGES="107-112", YEAR=1993, REFERENCES=16, KEYWORDS="Queueing network; protocol performance; HDLC; aggregation", ABSTRACT="In this paper an aggregated mathematical model for the performance analysis of a node with HDLC protocol will be presented that is still accurate concerning mean delay and losses.", } @ARTICLE{Lee93:Virtual, AUTHOR="K.-H. Lee", TITLE="A virtual bus architecture for dynamic parallel processing", JOURNAL=ieeepds, VOLUME=4, NUMBER=2, PAGES="121-130", YEAR=1993, REFERENCES=40, KEYWORDS="Parallel computing; interconnection network; bus; arbitration; performance evaluation", ABSTRACT="We propose a large scale interconnection network architecture called a virtual bus. The virtual bus can scale to terabits per second end-to-end communication bandwidth with low queueing delay for nonuniform traffic.", } @ARTICLE{Chla93:HIPPI, AUTHOR="I. Chlamtac and A. Ganz and M. G. Kienzle", TITLE="An {HIPPI} interconnection system", JOURNAL=ieeetc, VOLUME="C-42", NUMBER=2, PAGES="138-150", YEAR=1993, REFERENCES=14, KEYWORDS="Parallel computing; interconnection network; performance evaluation", ANNOTE="This paper deals with the proposed HIPPI standard, a connection-oriented standard for very high-speed systems.", } @MISC{Addi93:Queues, AUTHOR="R. G. Addie and Moshe Zukerman", TITLE="Queues with Total Recall", PAGES=15, YEAR=1993, REFERENCES=13, KEYWORDS="Semi Markov Process; Autoregressive Process; G/G/1; Queueing System; Single Server; Statistical Multiplexing; Performance Evaluation; Approximation; Loss Probability; Connection Admission Control", ABSTRACT="Queues in which the past of the input process remains relevant to its future evolution for a long time (queueing systems with 'total recall') can be analysed by means of the Wiener-Hopf factorization technique. Under suitable conditions, the stationary distribution of queued work has a tail of exponentialform and in many cases this tail is a good approximation to the entire distribution. Explicit results are given for the case", } @INPROCEEDINGS{Addi9303:Approximation, AUTHOR="R. G. Addie and Moshe Zukerman", TITLE="An Approximation for Performance Evaluation of Stationary Single server Queues", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="835-842", MONTH="March/April", YEAR=1993, REFERENCES=25, KEYWORDS="Semi Markov Process; Autoregressive Process; G/G/1; Queueing System; Single Server; Statistical Multiplexing; Performance Evaluation; Approximation; Loss Probability", ABSTRACT="This paper provides a method for approximating the probability distributions of stationary statistics in FIFO single server queues. The method is based on the Wiener-Hopf factorization technique, and is applied to semi-Markov queues where the underlying state space is of unlimited size. A particularly important case is a model for a statistical multiplexer where the net input process forms a stationary ergodic Gaussian", } @ARTICLE{Wach93:Breitband, AUTHOR="G. Wachholz and W. Falkenburg and J. Fingerholz and others", TITLE="Das Breitband-ISDN-Pilotprojekt der Telekom", JOURNAL=fernmelde, VOLUME=47, NUMBER="10/11", PAGES="32+15", YEAR=1993, LANGUAGE="German", REFERENCES=8, KEYWORDS="ATM; BISDN; test", } @INPROCEEDINGS{Agra9303:Local, AUTHOR="Gopal Agrawal and Baio Chen and W. Zhao", TITLE="Local Synchronous Capacity Allocation Schemes for Guaranteeing Message Deadlines with the Timed Token Protocol", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="186-193", MONTH="March/April", YEAR=1993, REFERENCES=43, KEYWORDS="FDDI; MAN; allocation; synchronous transmission", ABSTRACT="In this paper, we develop and analyze a class of local synchronous capacity allocation schemes. A local scheme allocates the synchronous capacity to a node without using information about messages on the other nodes while a global allocation scheme uses network wide information in the allocation process. Use of local schemes benefits the run-time management of network in the sense that the entire network can continue its normal operation.", } @INPROCEEDINGS{Anas9303:Service, AUTHOR="G. Anastasi and M. Conti and Enrico Gregori and Luniano Lenzini", TITLE="Service Integration in {CRMA:} A Simulative Analysis", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="715-721", MONTH="March/April", YEAR=1993, REFERENCES=13, KEYWORDS="MAN; CRMA; cyclic reservation multiple access; simulation; VBR; variable bitrate coding; service integration", ABSTRACT="This paper reports on a simulative analysis of the integration of VBR video and voice traffics in a CRMA network. The most original aspect of the paper is the characterization of the video sources via a trace of the output of a real codec. In this paper we show that by managing internet voice as VBR video the delay problem of voice traffic is overcome. Furthermore, we analyze the dependency of the QoS parameter values on the video source chara.", } @INPROCEEDINGS{Deng93:Optimal, AUTHOR="S. Deng and U. M. Maydell", TITLE="Optimal control of flexible bandwidth calls in {BISDN}", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=3, PAGES="1315-1319", YEAR=1993, REFERENCES=16, KEYWORDS="BISDN; bandwidth allocation; network management", ABSTRACT="Optimal admission control is an important network management andcontrol problem. Finding an optimal solution, however, is computation prohibitive in broadband networks. Optimal admission control becomes feasible in practical applications only if optimal admission policies exhibit certain policy structures so that thesearch for optimality is constrained. The paper proves the existnce of a threshold structure for networks serving traffic mix", } @INPROCEEDINGS{Bann9303:Multifiber, AUTHOR="J. Bannister and M. Gerla and Milan Kovacevic", TITLE="An All-Optical Multifiber Tree Network", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="282-292", MONTH="March/April", YEAR=1993, REFERENCES=21, KEYWORDS="Optical LAN; tree network; MAN; hslan", ABSTRACT="We present a network architecture that uses the multifiber tree topology to provide high-speed datagram and circuit-switching communication services to a large population of stations. Using a combination of space-, wavelength-, and time-division multiplexing, this network architecture provides all-optical transmission media to its stations and can interconnect several thousand stations in a metropolitan region.", } @ARTICLE{Blou93:Search, AUTHOR="P. L'Ecuyer and F. Blouin and R. W. Couture", TITLE="A search for good multiple recursive random number generators", JOURNAL=tomacs, ADDRESS="New York", VOLUME=3, NUMBER=2, PAGES="87-98", YEAR=1993, REFERENCES=24, KEYWORDS="RNG; linear congruential generator; pseudo-random generator; ecursive random generator; spectral test", ABSTRACT="We report the results of an extensive computer search for good multiple recursive generators, in terms of their lattice structure and implementation speed. Thode generators are a little slower than the ususal linear congruential generators, but have much longer periods and much better statistical properties. We provide specific parameter sets for 32-bit, 48-bit, and 64-bit computers.", } @ARTICLE{Brem93:Derivatives, AUTHOR="P. Bremaud and Wei-Bo Gong", TITLE="Derivatives of likelihood ratios and smoothed pertubation analysis for the routing problem", JOURNAL=tomacs, ADDRESS="New York", VOLUME=3, NUMBER=2, PAGES="134-161", YEAR=1993, REFERENCES=22, KEYWORDS="Discrete event simulation; estimation; sensitivity analysis; rgodicity", ABSTRACT="In this article we present estimates for the gradients of the cycle variables with respect to a thinning parameter in the arrival process of G/G/1 queueing systems. Our estimates belong to the category of the likelihood ratio method, smoothed-pertubation analysis, and rare-pertubation analysis. In particular, we obtain unbiased estimates of derivatives of any order in the random-horizon case and the stationary and ergodic estimates.", } @ARTICLE{Raat93:Sequential, AUTHOR="K. Raatikainen", TITLE="A sequential procedure for simultaneous estimation of several means", JOURNAL=tomacs, ADDRESS="New York", VOLUME=3, NUMBER=2, PAGES="108-133", YEAR=1993, REFERENCES=34, KEYWORDS="Estimation; simulation; confidence interval", ABSTRACT="Sequential procedures for controlling the length of a simulationrun are widely used when a single mean is estimated. In many practical situations, however, the analyst is simultaneously interested in several means. We propose a sequential procedure for controlling the length of a simulation run when several means are simultaneously estimated.", } @ARTICLE{Walk93:Mobile, AUTHOR="B. Walke and P. Decker", TITLE="Mobile Datenkommunikation - Eine Übersicht", JOURNAL=itti, PUBLISHER="R. Oldenburg Verlag", VOLUME=35, NUMBER=5, PAGES="12-25", YEAR=1993, LANGUAGE="German", REFERENCES=21, KEYWORDS="Mobile radio; data communication; survey", ABSTRACT="Systems technical parameters, modes of operation and state of introduction of mobile radio networks are described.", } @INPROCEEDINGS{Bern9303:Source, AUTHOR="F. Bernabei and Laura Gratta and M. Listanti and A. Sarghini", TITLE="Analysis of {ON-OFF} Source Shaping for {ATM} Multiplexing", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1330-1336", MONTH="March/April", YEAR=1993, REFERENCES=8, KEYWORDS="ATM; Traffic Control; Bursty Traffic; statistical multiplexer; controlled input", ABSTRACT="This paper deals with the multiplexing of shaped ON-OFF sources on an ATM link. In particular, a (N)-Level Shaper is analysed. It modulates the source output bit rate on the basis of the buffer occupancy level. A very accurate analytical model describing its behaviour is provided. Numerical results show theeffectiveness of the proposed shaping mechanism.", } @ARTICLE{Kuma93:Scheduling, AUTHOR="Anurag Shorey and R. Krishna Kumar", TITLE="Performance analysis and scheduling of stochastic fork-join jobs in a multicomputer system", JOURNAL=ieeepds, VOLUME=4, NUMBER=10, PAGES="1147-1164", YEAR=1993, KEYWORDS="Performance evaluation; queueing system; fork-join queue; parallel computing; queueing discipline", } @ARTICLE{Bogi93:Low, AUTHOR="K. Bogineni and Krishna M. Sivalingam and P. W. Dowd", TITLE="Low-Complexity Multiple Access Protocols for Wavelength-Division Multiplexed Photonic Networks", JOURNAL=ieeejsac, VOLUME="SAC-11", NUMBER=4, PAGES="590-604", YEAR=1993, REFERENCES=42, KEYWORDS="Star network; protocol; HSLAN; WDM; wavelength division multiplex", ABSTRACT="Media access control protocols for an optically interconnected star-coupled system with preallocated wavelength-division multiple-access channels are introduces and compared. (I-SA, I-TDMA)", } @INPROCEEDINGS{Bohm93:Prioritized, AUTHOR="Stephen Bohm and A. K. Elhakeem and V. K. Murthy", TITLE="Performance of a prioritized nonblocking Switch under Hotspot traffic Conditions with Head of Line Resolution", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="686-690", YEAR=1993, REFERENCES=7, KEYWORDS="Performance evaluation; HOL priority; nonblocking; priority; ot spot", ABSTRACT="In this paper, we pursue a performance analysis under hotspot traffic conditions on a four level prioritized nonblocking baseband switch for use on-board a switching multibeam satelliteBoth finite input and output buffering as well as speedup are employed to reduce the loss which is critical in a satellite application.", } @ARTICLE{Boli93:SBP, AUTHOR="S. Bolis and E. G. Economou and D. Mouzakis and G. Philokyprou", TITLE="{SBP-Net:} an integrated voice/data token ring {LAN}", JOURNAL=ccr, VOLUME=16, NUMBER=8, PAGES="494-500", YEAR=1993, REFERENCES=14, KEYWORDS="Token ring; LAN; voice communication; voice/data integration", ABSTRACT="This paper presents a modified token ring LAN, called the Scheduling Bypass Periods Network (SBP-Net). SBP-Net uses the ring to implement the IEEE 802.5 standard token ring functions and an auxiliary bus for control purposes. In our proposal idle stations are bypassed, therefore the relevant delay produced in the standard token ring is minimized. This improvement is paricularly significant at light and medium loads.", } @INPROCEEDINGS{Bono9303:One, AUTHOR="A. Bononi and F. Forghieri and P. R. Prucnal", TITLE="Analysis of One-Buffer Deflection Routing in Ultra-Fast Optical Mesh Networks", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="303-311", MONTH="March/April", YEAR=1993, REFERENCES=12, KEYWORDS="MAN; shufflenet; routing; analysis", ABSTRACT="The steady state behaviour of regular two-connected multihop networks in homogeneous load under hot-potato and single-buffer deflection routing is analyzed for ultra-fast optical applications. Manhatten Street Network and ShuffleNet are compared in terms of throughput, delay and deflection probability both analytically and by simulation.", } @ARTICLE{Bore93:Enhancements, AUTHOR="A. Borella and D. Broglio and G. Cancellieri and F. Chiaraluce", TITLE="Enhancements of {DQDB} protocol with {ECBWB} mechanism for fair access and multi-priority traffic management", JOURNAL=ccr, VOLUME=16, NUMBER=8, PAGES="511-517", YEAR=1993, REFERENCES=7, KEYWORDS="Man; DQDB; bandwidth allocation; fairness; multiple priority", ABSTRACT="The Distributed Queue Dual Bus (DQDB) protocol with BandWidth Balancing (BWB) mechanism is unable to effectively support multiple priority levels that may be necessary for providing new services to network users. Thus, fair allocation of bandwidth among users is assured only in the case of one level of traffic priority. To overcome this limitation, this paper introduces a novel mechanism called Extended Counting BandWidth Balancing (ECBWB).", } @INPROCEEDINGS{Box9303:Architecture, AUTHOR="Donald F. Box and D. Hong and T. Suda", TITLE="Architecture and Design of Connectionless Data Service for a public {ATM} Network", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="722-731", MONTH="March/April", YEAR=1993, REFERENCES=17, KEYWORDS="ATM; Connectionless Service; Datagram; Architecture", ABSTRACT="The deployment of a high speed, wide area ATM network introducesa 'backwards compatibility' dilemma. While emerging ATM networksmust be capable of transporting traffic sources such as digitized voice and video, many of the design choices that optimize ATM for these sources make the transport of traditionalconnectionless data traffic difficult. This paper proposes the overlay of a virtual datagram network of connectionless servers", } @ARTICLE{Buss93:Zwei, AUTHOR="H. Busse", TITLE="M-/S-Bus, zwei flotte Geschwister", JOURNAL="Elektronik", VOLUME=5, PAGES="84-87", YEAR=1993, LANGUAGE="German", REFERENCES=1, KEYWORDS="Bus; throughput", ABSTRACT="Prozessoren, die mit großen Bandbreiten und hohen taktraten arbeiten, werden gern als Leistungsmerkmal für Rechner angeführt. Der Rechnerarchitektur, und speziell den internen oder externen Kommunikationskanälen zwischen CPU und Peripherie, sollte jedoch mehr Aufmerksamkeit gewidmet werden.", } @INPROCEEDINGS{Chan93:ATM, AUTHOR="C. J. Chang and Jinghu Chen and Philip Lin", TITLE="Analysis of an {ATM} multiplexer with correlated periodic real-time and independent batch Poisson non-real time traffic", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="1032-1036", YEAR=1993, REFERENCES=18, KEYWORDS="ATM; multiplexer; batch arrival; Poisson process; periodic input traffic", ABSTRACT="This paper presents an alternate traffic model for an ATM multiplexer providing video, voice, and data services. The traffic model categorizes input traffic to the ATM multiplexer into two types: real-time and nonreal-time, where the real-time traffic is periodic and correlated, while the nonreal-time traffic is batchPoisson and independent. This multiplexer is assumed to be a queueing system with synchronous servers", } @INPROCEEDINGS{Chen93:Finite, AUTHOR="Chi-Ming Chen and Shuo-Hsien Hsiao and D. Meliksetian and K. C. Nwosu", TITLE="Performance Analysis of finite-buffered multistage interconnection networks", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=1, PAGES="53-57", YEAR=1993, REFERENCES=9, KEYWORDS="ATM; Performance evaluation; finite buffer; multistage interconnection network", ABSTRACT="A new model for the performance evaluation of finite buffered multistage interconnection networks (MINs) is proposed. In contrast to previous models, which are either rather inaccurate when input load is high or only applicable to some special cases (...), the proposed model is very accurate for all ranges of input load and allows switching elements and buffer modules to be of any arbitrary size.", } @ARTICLE{Chen93:Distributed, AUTHOR="Wei-Peng Chen and Jiunn-Hwa. Yu", TITLE="Distributed protocol for integrated voice/data token passing ring networks", JOURNAL=comcom, ISBN="0140-3664", VOLUME=16, NUMBER=6, PAGES="338-349", YEAR=1993, REFERENCES=23, KEYWORDS="Distributed processing; performance improvement; synchronous transmission; token ring", } @INPROCEEDINGS{Chen93:Modeling, AUTHOR="Xiaopeng Chen", TITLE="Modeling Connection Admission Control", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=1, PAGES="274-281", MONTH="March/April", YEAR=1993, REFERENCES=9, KEYWORDS="Statistical Multiplexer; Bursty Traffic; MMPP/G/1; Queueing System; Finite Queue; Analysis; Approximation; Loss Probability; IPP; interrupted Poisson Process", ABSTRACT="This paper presents the performance analysis of connection admission control based on the single-class single-queue scheme whose input consists of statistical identical ON-OFF traffic sources, each modeled by an IPP process. The first part of this paper is concerned with the exact analysis of the scheme, known as the MMPP/G/1/K queue in the literature. The computational complexity associated with the exact analysis becomes", } @INPROCEEDINGS{Chen93:Irregular, AUTHOR="Yunfei Chen and Galen Sasaki", TITLE="Irregular Torus Networks: Deadlock Avoidance and Througput Analysis", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="312-321", MONTH="March/April", YEAR=1993, REFERENCES=14, KEYWORDS="Man; deadlock; network; throughput analysis", ABSTRACT="In this paper a buffer management is proposed to prevent store-and-forward deadlock for routing in the irregular torus, and the throughput of a typical irregular torus network is analyzed. Store-and-forward deadlock is avoided by a buffer management whose storage requirement and control complexity at a node are both constant with the size of a network.", } @ARTICLE{Chip93:Protocols, AUTHOR="Renu Chipalkatti and Z. Zhang and A. S. Acampora", TITLE="Protocols for Optical Star-Coupler Network Using {WDM:} Performance and Complexity Study", JOURNAL=ieeejsac, VOLUME="SAC-11", NUMBER=4, PAGES="579-589", YEAR=1993, REFERENCES=21, KEYWORDS="Star network; protocol; WDM; wavelength division multiplex", ABSTRACT="In this paper, the performance and complexity issues involved in designing protocols for passive star networks are explored. (DAS, TDM and HTDM)", } @INPROCEEDINGS{Cido93:Protective, AUTHOR="I. Cidon and R. Guérin and Asad Khamisy", TITLE="On Protective Buffer Policies", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1051-1058", MONTH="March/April", YEAR=1993, REFERENCES=14, KEYWORDS="ATM; Buffer Management; Packet Discarding; Priority; Performance Evaluation; Simulation; Loss Probability", ABSTRACT="We study buffering policies which provide different loss priorities to cells with no change in cell ordering (space priority disciplines). The main issue being investigated is the identification and the evaluation of buffering policies that canguarantee performance, i.e., loss probability, to high priority cells irrespective of the traffic intensity and arrival patternsof low priority packets. Such policies are termed protective", } @INPROCEEDINGS{Cohe93:Simulation, AUTHOR="Danny Cohen and D. P. Heyman", TITLE="A Simulation Study of Video Teleconferencing Traffic in {ATM} networks", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="894-901", MONTH="March/April", YEAR=1993, REFERENCES=4, KEYWORDS="Packet Video; Videoconference; ATM; Traffic Source Model; Markov Chain; Simulation; Loss Probability; Statistical Multiplexing", ABSTRACT="This note presents results of a simulation study of the potential multiplexing gains from using Variable Bit Rate encoding to multiplex video teleconferencing traffic over an ATM network. Simulated traffic from several video teleconferences was fed into a buffer and multiplexed onto a higher speed outputline. The study observed the cell loss resulting from buffer overflow.", } @INPROCEEDINGS{Cohe93:Multiple, AUTHOR="Richard M. Cohen and A. Segall", TITLE="Multiple Logical Token-Rings in a Single High-Speed Ring", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="699-706", MONTH="March/April", YEAR=1993, REFERENCES=7, KEYWORDS="Ring network; token ring; token system; MAN; hsLAN; protocol", ABSTRACT="The paper describes a new media access control protocol, called the multiple token protocol, for high-speed ring networks. The purpose of this protocol is to decrease the access delay under a light load of the token ring protocol. The protocol maintains several logical token-rings in the single physical ring. The number of logical rings can be changed dynamically by the ring stations according to the actual ring load.", } @INPROCEEDINGS{Coll93:Path, AUTHOR="M. Collier and T. Curran", TITLE="Path Allocation in a Three-Stage Broadband Switch with intermediate Channel Grouping", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="927-934", MONTH="March/April", YEAR=1993, REFERENCES=12, KEYWORDS="ATM; Switching; Clos; Path Control; Parallel Algorithm; Implementation; VLSI", ABSTRACT="A method for path allocation is described for use with 3-stage ATM switches which feature multiple channels between the switch modules in adjacent stages. The method is suited to hardware implementation using parallelism to achieve a very short execution time. This allows path allocation to be performed anewin each slot.", } @INPROCEEDINGS{Cros93:Renegotiation, AUTHOR="S. Crosby", TITLE="In-Call Renegotiation of Traffic Parameters", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="638-646", MONTH="March/April", YEAR=1993, REFERENCES=17, KEYWORDS="ATM; Connection Admission Control; Bandwidth Allocation; Dynamic Resource Allocation; Bursty Traffic; Performance Evaluation", ABSTRACT="Static allocation parameterises a source at connection setup only, whereas dynamic allocation requires a source to inform themultiplexer whenever its bandwidth requirements change. We analyse a simple dynamic 'renegotiation' protocol and derive bounds on the performance of an optimal dynamic protocol. Markovian source models parameterised from working applications are used to contrast the behaviour of the three control schemes.", } @ARTICLE{Davi93:Self, AUTHOR="A. C. Davidson and S. K. Chaudhuri", TITLE="A Self-Routing Packet Network Via Optical Processing of the Header", JOURNAL=ett, ADDRESS="Milano", VOLUME=4, NUMBER=2, PAGES="201-211", YEAR=1993, REFERENCES=16, KEYWORDS="HsLAN; optical LAN; optical switching; slotted ring; token ring", ABSTRACT="To allow multiple users access to a high speed optical channel, a new scheme, given the name code-division header recognition (CDHR), is devised that uses both frequency and time-domain bandwidth expansion as well as optical signal processing. An encoded destination address for a data packet is transmitted on a low speed subchannel at a different wavelength from a high speed main channel and optical delay-line correlators are used for routing.", } @INPROCEEDINGS{Deci93:Connectionless, AUTHOR="M. Decina and P. Giacomazzi and Achille Pattavina", TITLE="Connectionless Switching by the Asynchronous Shuffleout Network", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="701-707", YEAR=1993, REFERENCES=6, KEYWORDS="ATM; connectionless service; self routing", ABSTRACT="A new architecture is proposed in this paper to perform a switching function in a connectionless network environment. The structure is a multistage arrangement of unbuffered switching elements that exploits the packet self-routing technique by attaching a self-routing tag to each packet.", } @INPROCEEDINGS{Deci93:Approximate, AUTHOR="M. Decina and V. Trecordi and G. Zanolini and D. Zucca", TITLE="An Approximate Analysis of Broadcasting in Multichannel Metropolitan Area Networks", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="293-302", MONTH="March/April", YEAR=1993, REFERENCES=13, KEYWORDS="Man; broadcast; analysis; multichannel", ABSTRACT="This paper focusses on an open issue in Multyichannel MANs, namely broadcast service. Two different strategies are proposed to deliver of broadcast traffic in Bidirectional Manhattan Street Network (BMSN) and Shuffle Net (SN). The comparions is based on throughput and delivery delay results, as obtained by developing an analytic model. Lights and shadows of the different approaches to the problem of broadcasting, are pointed out.", } @ARTICLE{Deng93:Token, AUTHOR="R. H. Deng and Xianan Zhang and K.-T. Huang", TITLE="Performance of a token-passing system with batch arrivals and its application to file transfers", JOURNAL=ccr, VOLUME=16, NUMBER=7, PAGES="422-431", YEAR=1993, REFERENCES=20, KEYWORDS="Token passing; token system; file transfer; batch arrival; performance analysis", ABSTRACT="This paper investigates the performance of token-passing systems with limited service and Poisson arrivals. For pure Poisson arrivals, the Laplace-SDtieltjes Transform (LST) of an approximate customer/packet waiting time distribution is derived and expressed as a functional equation, from which the approximate mean and variance of waiting time are obtained; for batch Poisson arrivals, an approximate mean of waiting time is derived.", } @INPROCEEDINGS{Ding93:Nonuniform, AUTHOR="J. Ding", TITLE="Nonuniform traffic analysis of multistage interconnection networks with split buffers", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=1, PAGES="58-62", YEAR=1993, REFERENCES=12, KEYWORDS="Multistage interconnection network; traffic analysis; Omega network", ABSTRACT="This paper concerns the analysis of the Split-buffered multistage interconnection networks (SMINs) under the favorite input loadThe favorite load is a typical nonuniform pattern which includesthe uniform load as its special case. A new analytical model of SMINs under the favorite load is developed.", } @ARTICLE{Drak93:Traffic, AUTHOR="E. Drakopolis", TITLE="Performance and Traffic Analysis of a Network-Based Distributed system", JOURNAL=comcom, VOLUME=16, NUMBER=3, PAGES="155-167", YEAR=1993, REFERENCES=11, KEYWORDS="LAN; Traffic Measurement; Performance Evaluation; Queueing Network", ABSTRACT="In this paper we study the performance of a distributed computing system that consists of a number of clients and a server, interconnected by a CSMA/CD LAN. Each client represents a single-user diskless workstation. To characterize the application workload we perform a series of measurement experiments in a controlled environment. The measurements obtained from the experiments are used to parametrize a queueing", } @INPROCEEDINGS{Dzio93:Fair, AUTHOR="L. G. Mason and Z. Dziong and Nicole Tetreault", TITLE="Fair-efficient call admission control policies for broadband networks", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="976-982", YEAR=1993, REFERENCES=17, KEYWORDS="ATM; connection admission control; broadband; resource utilization", ABSTRACT="A fundamental problem in connection oriented multi-service networks (ATM and STM), is finding the optimal policy for call acceptance. The measure of performance for call class $j$ is $Bj$, the call loss probability. One seeks an admission control policy which efficiently utilizes network resources while at the same time being fair to the various call classes being supported. The theory of co-operative games provides a natural framework.", } @ARTICLE{Eage93:Chores, AUTHOR="D. L. Eager and J. L. Zahorjan", TITLE="Chores: Enhanced Run-Time Support for Shared-Memory Parallel Computing", JOURNAL=tocs, VOLUME="TOCS11", NUMBER=1, PAGES="1-32", YEAR=1993, REFERENCES=30, KEYWORDS="Design; measurement; performance improvement", ABSTRACT="In this paper we propose a new paradigm, chores, for the run-time support of parallel computing on shared-memory multiprocessors. We consider specifically uniform memory access shared-memory environments, although the chore paradigm should also be appropriate for use within the cluster of a large-scale nonuniform memory access machine.", } @INPROCEEDINGS{Eng93:Memory, AUTHOR="K. Y. Eng and Mark Karol and R. D. Gitlin", TITLE="Memory and Channel-Sharing Techniques for Congestion Control in {ATM} Networks", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=1, PAGES="266-273", MONTH="March/April", YEAR=1993, REFERENCES=7, KEYWORDS="ATM; BISDN; Switching; Cross Connect; Central Buffer; Resource Sharing; Channel Assignment", ABSTRACT="We study the use of two resource sharing techniques for congestion control in a backbone ATM network consisting of cross-connects interconnected by high-speed optical links. Memory sharing allows an optimal shared use of buffer space in an ATM switch fabric. Channel sharing, on the other hand, takes advantage of spare line capacity in the system to permit temporary increases in the output rates of the congested output", } @INPROCEEDINGS{Evan93:Priority, AUTHOR="Joseph B. Evans and E. Duron and Yixin Wang", TITLE="Analysis and Implementation of a Priority Knockout Switch", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1099-1106", MONTH="March/April", YEAR=1993, REFERENCES=14, KEYWORDS="ATM; Switching; Knockout Switch; Priority; Packet Discarding; Loss Probability; Performance Evaluation; nalysis; Simulation", ABSTRACT="A Priority Knockout Switch (PKS) architecture employing prioritybased congestion control mechanisms is presented in this paper. This architecture allows the capability to assign qualities of service to connections through per cell or virtual circuit priority mechanisms. Performance studies which use an analyticalmodel for uniform traffic and simulation models for uniform and bursty traffic are presented.", } @INPROCEEDINGS{Fabi93:Polling, AUTHOR="O. Fabian and H. M. Levy", TITLE="Polling System Optimization Through Dynamic Routing Policies", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="194-200", MONTH="March/April", YEAR=1993, REFERENCES=12, KEYWORDS="Polling system; optimization; dynamic routing", ABSTRACT="Polling systems have been used as a central model for modeling various communications networks, like the token ring network, somd high speed local-area networks and others. In this paper we focus on pseudo cyclic algorithms which can prioritize the various stations by dynamically changing their service order but maintain fairness by visiting each station exactly once in a cycle.", } @INPROCEEDINGS{Flik93:Traffic, AUTHOR="Z. Flikop", TITLE="Traffic Management in Packet Switching Networks", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=1, PAGES="25-29", YEAR=1993, REFERENCES=4, KEYWORDS="Routing; decision theory; expert system; optimization; packet switching", ABSTRACT="This article discusses some problems in the development of routing management systems for packet switching networks. To decreasereaction time in routing management, we suggest the development of expert systems with control rules that do not require feedback. Considering the complexity of the development of the control rules, the use of self-learing together with a two-step optimization is suggested.", } @INPROCEEDINGS{Fons93:Estimating, AUTHOR="NELSON {L. S. DA FONSECA} and J. A. Silvester", TITLE="Estimating the loss probability in a multiplexer loaded with multi-priority {MMPP} streams", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="1037-1041", YEAR=1993, REFERENCES=15, KEYWORDS="ATM; multiplexer; MMPP; loss probability; multiple priority", ABSTRACT="Future BISDN will carry a wide spectrum of applications with different loss requirements. By adopting a multi-priority schemeat the cell level, we gain flexibility in coping with these diverse requirements in an efficient way. In this paper, we address the issue of furnishing a multiclass selective discard mechanism. We compute the loss probability per class where each class is modelled as a two-state MMPP.", } @INPROCEEDINGS{Frie93:Effect, AUTHOR="V. J. Friesen and J. W. Wong", TITLE="The Effect of Multiplexing, Switching and Other Factors on the performance of Broadband Networks", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1194-1203", MONTH="March/April", YEAR=1993, REFERENCES=28, KEYWORDS="ATM; statistical multiplexing; source policing; leaky bucket; bursty traffic; IPP; interrupted poisson process; MMPP; simulation; delay", ABSTRACT="A network model is developed to study the effect of multiplexingand switching on broadband network performance. Emphasis is placed on the queueing behaviour of the network, and the impact of multiplexing and switching on the burstiness of the various traffic streams. The three parameters commonly used to characterize traffic (namely peak bit rate, mean bit rate, and mean burst length) are also considered, and the dependence of", } @ARTICLE{Ghei93:CHAOS, AUTHOR="Ahmed Gheith and Karsten Schwan", TITLE="{CHAOS:} Kernel Support for Multiweight Objects, Invocations, and Atomicity in Real-Time Multiprocessor Applications", JOURNAL=tocs, VOLUME="TOCS11", NUMBER=1, PAGES="33-72", YEAR=1993, REFERENCES=62, KEYWORDS="Operating system; parallel software; measurement; design", ABSTRACT="CHAOS is an object-based multiprocessor operating system kernel that provides primitives with which programmers may easily construct objects of differing types and object invocations of differing semantics, targeting multiprocessor systems, and real-time applications. This paper reviews the primitives offered by CHAOS and demonstrates how the required elements of the CHAOS real-time kernel are constructed with those primitives.", } @INPROCEEDINGS{Gian93:Shared, AUTHOR="S. Gianatti and Achille Pattavina", TITLE="Performance Analysis of Shared-Buffered Banyan Networks under arbitrary Traffic Patterns", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="943-952", MONTH="March/April", YEAR=1993, REFERENCES=15, KEYWORDS="ATM; Switching; Banyan Network; Central Buffer; Bursty Traffic; Unbalanced Traffic; Performance Evaluation; Analysis", ABSTRACT="This paper addresses the performance study of multistage Banyan networks with a shared buffer in each switching element. Two different internal protocols are considered for the transfer of packets from stage to stage based on the presence or absence of interstage backpressure signals to signal the occurrence of buffer saturation conditions. Two kinds of traffic patterns havebeen studied, a bursty and an unbalanced traffic pattern.", } @INPROCEEDINGS{Hart93:User, AUTHOR="V. F. Hartanto and Harsha Sirisena", TITLE="User-Network Policer: A New Approach for {ATM} Congestion Control", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=1, PAGES="376-383", MONTH="March/April", YEAR=1993, REFERENCES=13, KEYWORDS="ATM; Policing Function", ABSTRACT="In this paper, we propose a new approach to the policing function called User-Network Policer. The scheme consists of a service-dependent User Policer and a service-independent NetworkPolicer. Users are responsible to mark and to police their traffic appropriately before sending them into the network, On the other hand, the network is only responsible to verify the correctness of user policing and to transport cells", } @INPROCEEDINGS{Heid93:Parallel, AUTHOR="P. Heidelberger and D. M. Nicol", TITLE="Parallel Algorithms for Simulating Continuous Time Markov Chains", BOOKTITLE="7th Workshop on PADS ACM - SIGSIM", ADDRESS="San Diego", VOLUME=23, PAGES="11-18", YEAR=1993, REFERENCES=15, KEYWORDS="Parallel algorithm; simulation; continuous time process; Markov process", ABSTRACT="We have previously shown that the mathematical technique of uniformization can serve as a basis of synchronization for the parallel simulation of continuous time Markov chains. This paperreviews the basic method and compares four different methods based on uniformaization, evaluating their strengths and weaknesses as a function of problem characteristics.", } @INPROCEEDINGS{Herr93:Correlation, AUTHOR="C. Herrmann", TITLE="Correlation effect on per-stream {QOS} parameters of {ATM} traffic superpositions relevant to connection admission control", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="1027-1031", YEAR=1993, REFERENCES=14, KEYWORDS="ATM; connection admission control; QOS; DMAP; finite buffer", ABSTRACT="Connection Admission Control (CAC) is usually modelled by superimposing the existing traffic and the new connection on each ATM link. Correlation in the single streams can affect the loss probabilities and waiting times of both streams. In order to investigate this influence, this paper presents an exact solution of the DMAP1+DMAP2/D/1/s finite buffer queue. The analysis is done by means of the SMP[2]/D/1/s finite buffer queue.", } @INPROCEEDINGS{Herr93:Discrete, AUTHOR="C. Herrmann", TITLE="Analysis of the Discrete-Time {SMP/D/1/s} Finite Buffer Queue with Applications in {ATM}", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=1, PAGES="160-167", MONTH="March/April", YEAR=1993, REFERENCES=16, KEYWORDS="Semi Markov Process; Queueing System; Finite Capacity; Analysis; Loss Probability", ABSTRACT="This paper presents an exact analysis of the discrete-time single server SMP/D/1/s queue with an arbitrary Semi-Markov input process and a buffer size s. The SSMP/D/1/s queue as well as the DMAP/D/1/s queue are covered by this model. The analysis yields easy expressions for the queue length density at arrivals(loss probability) and the waiting time density. This queueing system is suitable for modelling correlated input streams of ATM", } @INPROCEEDINGS{Hluc93:Queueing, AUTHOR="M. G. Hluchyi and Nanying Yin", TITLE="On the Queueing Behaviour of Multiplexed Leaky Bucket Regulated Sources", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="672-679", MONTH="March/April", YEAR=1993, REFERENCES=13, KEYWORDS="ATM; Source Policing; Policing Function; Leaky Bucket; Performance Evaluation", ABSTRACT="In this paper, we investigate the effectiveness of the unbuffered leaky bucket algorithm in protecting the quality of service experienced by connections passing through a common internodal link queue. We show that excess traffic generated by asource can pass through the Leaky Bucket without being marked ordiscarded, and cause unacceptable packet delay/loss to other connections. We suggest allocating network bandwidth above the", } @INPROCEEDINGS{Hsin93:Study, AUTHOR="D. K. Hsing", TITLE="Performance study on the ``Leaky Bucket'' Usage Parameter Control mechanism with {CLP} tagging", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=1, PAGES="359-364", YEAR=1993, REFERENCES=12, KEYWORDS="ATM; performance evaluation; leaky bucket", ABSTRACT="In this paper, it is attempted to quantify the value of using the option of setting an ATM cell header at the Usage Parameter Control (UPC) mechanism. We assume that the UPC mechanism uses a ``leaky bucket'' algorithm. The statistical gain realized in the ATM network with a UPC mechanism using CLP tagging is compared to that with a UPC mechanism not using CLP tagging.", } @INPROCEEDINGS{Jeon93:Achievability, AUTHOR="Y. H. Jeon and I. Viniotis", TITLE="Achievability of combined {GOS} Requirements in Broadband Networks", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=1, PAGES="192-196", YEAR=1993, REFERENCES=6, KEYWORDS="Queueing discipline; broadband; communication network; delay; loss probability", ABSTRACT="In the queueing literature, achievable performances for average delay and probability of loss have been traditionally referred to as conservation laws. The conservation laws presented so far, deal with single performance measures such as delay only orloss only, under a single arrival or service control. Our emphasis in this paper is on laws for combined arrival and service controls. We also present a dynamic queueing discipline.", } @INPROCEEDINGS{Jeon93:Achievable, AUTHOR="Y. H. Jeon and I. Viniotis", TITLE="Achievable Loss Probabilities and Buffer Allocation Policies in {ATM} Nodes with correlated arrivals", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=1, PAGES="365-369", YEAR=1993, REFERENCES=14, KEYWORDS="ATM; loss probability; buffer management; traffic control; MMPP", ABSTRACT="We consider the synthesis problem of a traffic control scheme based on conservation laws. Conservation laws, that characterizeachievable performance regions, have been very useful for analysis of delay and loss measures in systems, with iid arrivals. In this study, we derive a conservation law for cell loss probabilities, for an ATM node with a finite buffer size and correlated arrival processes.", } @INPROCEEDINGS{Jone93:Generic, AUTHOR="S. K. Jones and C. Smythe", TITLE="A Generic Framework for the Simulation Analysis of Protocol Layered Communication Systems", BOOKTITLE=mascots, ISBN="1-56555-018-8", ADDRESS="San Diego", PAGES="183-186", YEAR=1993, REFERENCES=11, KEYWORDS="Simulation; object-oriented programming; ISO reference model", ABSTRACT="A communications network performance modelling methodology based on the specification of a generic network architecture is proposed. This methodology provides a framework upon which the analytic, simulation and formal analysis of protocol layered communications systems can be performed. This paper concentrates on the application of ths framework to simulation modelling.", } @INPROCEEDINGS{Jou93:Tractable, AUTHOR="Y. F. Jou and F.-Y. Lai and A. Nilsson", TITLE="Tractable Analysis of a finite capacity polling system under bursty and correlated {ATM} arrivals", BOOKTITLE=icc, ADDRESS="Geneva, Switzerland", VOLUME=1, PAGES="340-344", YEAR=1993, REFERENCES=6, KEYWORDS="ATM; MMBP; mean delay; loss probability; finite capacity; polling system; bursty traffic", ABSTRACT="This paper is concerned with the mean delay and the cell loss probability that bursty and correlated arrivals incur in an ATM switching module which can be modelled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is modelled by a Markov Modulated Bernoulli Process (MMBP) which is a able to describe the bursty and correlated nature of the ATM traffic.", } @INPROCEEDINGS{Jung93:Translation, AUTHOR="J. Jung and D. Seret", TITLE="Translation of {QoS} Parameters into {ATM} Performance Parameters in {BISDN}", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="748-755", MONTH="March/April", YEAR=1993, REFERENCES=25, KEYWORDS="ATM; QOS; Layered Protocol", ABSTRACT="The main goal of this paper is to present the translation of QoSparameters between layers. We concentrate on the translation from the AAL to the ATM layer because the AAL must be designed to be service dependent and specific. The QoS parameters at the ATM layer resulting from the translation will be the performancerequirements on a connection basis for the ATM network. Finally, we discuss the impacts of QoS parameter translation on", } @INPROCEEDINGS{Kala93:Fast, AUTHOR="N. Kalantery and S. C. Winter and D. R. Wilson and A. P. Redfern", TITLE="Fast Parallel Simulation of {SS7} Telecommunication Networks", BOOKTITLE=mascots, ISBN="1-56555-018-8", ADDRESS="San Diego, California", PAGES="171-175", NOTE="SCS Simulation Series", YEAR=1993, REFERENCES=9, KEYWORDS="Distributed simulation; parallel simulation; SS7; signaling", ABSTRACT="This paper describes a basic parallel simulation model for SS7 telecommunication networks. Experimental results on the performance of the parallel simulator are discussed. Based on the current results and by pointing out the special lookahead characteristics of the SS7 networks, a technique for achieving improved speedup of execution is proposed.", } @INPROCEEDINGS{Kang93:Queueing, AUTHOR="Cheoul-Shin Kang and H. H. Tan", TITLE="Queueing Analysis of Explicit Priority Assignment Partial Buffer Sharing Schemes for {ATM} Networks", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="810-819", MONTH="March/April", YEAR=1993, REFERENCES=11, KEYWORDS="ATM; Multiple Priority; Buffer Management; Performance Evaluation; Analysis; Bursty Traffic; Loss Probability", ABSTRACT="This paper considers the explicit assignment space priority control policy employing the partial buffer sharing scheme. Cellloss probabilities are derived for a traffic model consisting oftwo service classes. Each service class consists of bursty traffic generated by a multiple number of three-state discrete-time Markov sources. The effect of cell loss probabilities on traffic load and burstiness characteristics, as", } @INPROCEEDINGS{Kani93:Copy, AUTHOR="Jaidev Kaniyil and Y. Onozato and W. D. Zhong", TITLE="A Copy Network with Shared Buffers for Large Multicast {ATM} switches", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="722-726", YEAR=1993, REFERENCES=16, KEYWORDS="ATM; buffer management; multicast; Banyan network; nonblocking; performance analysis; architecture", ABSTRACT="This paper proposes a new architecture for the copy network which is an integral part of multicast ATM switches. The new architecture makes use of the property that the Broadcast BanyanNetwork (BBN) is non-blocking if the active inputs are cyclically concentrated and the outputs are monotone. In the new architecture, by employing a token ring reservation scheme, the outputs of the copy net. are reserved before multic. cell is replicated.", } @INPROCEEDINGS{Kim93:Multinet, AUTHOR="H. Kim", TITLE="Multinet Switch: Multistage {ATM} Switch Architecture with PartiallyShared Buffers", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="473-480", MONTH="March/April", YEAR=1993, REFERENCES=16, KEYWORDS="ATM; Switching Network; Architecture; Self Routing; Multistage Interconnection Network; Multicast", ABSTRACT="The proposed switch, Multinet switch, is a self-routing multistage switch with internal buffers capable of achieving 100\% throughput. Although it provides incoming ATM cells with multiple paths, the cell sequence is maintained throughout the switch fabric thus eliminating the out-of-order cell sequencing problem. Cells contending for the same output addresses are buffered internally according to a partial buffer sharing", } @INPROCEEDINGS{Kim93:Policing, AUTHOR="Jaehyung Kim and D. Y. Kwak and H. S. Park and W. S. Rhee", TITLE="The policing mechanism with state-dependent control", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="1042-1046", YEAR=1993, REFERENCES=11, KEYWORDS="ATM; policing function; traffic shaping", ABSTRACT="In this paper, we propose the policing mechanism which can control the buffer read rate properly according to the buffer state. As this mechanism has the buffer with threshold, it has intrinsically traffic shaping function nd can control the bursty trafficflow to a some extent. Simulation results show that our model can easily manage the cell loss probability for a given buffer size by controlling the read rate according to the buffer state.", } @ARTICLE{Ko93:Two, AUTHOR="C. C. Ko and Wai-Choong Wong and Jianxuan Du and R. H. Deng and K. M. Lye", TITLE="Performance analysis of two bridged {CSMA/CD} networks", JOURNAL=ccr, VOLUME=16, NUMBER=8, PAGES="501-510", YEAR=1993, REFERENCES=22, KEYWORDS="Csma/cd; bridge; performance analysis", ABSTRACT="This paper analyses the performance of two non-persistent CSMA/CD LANs linked by a bridge. The main function of the bridge is to buffer all internetwork packets and forward them across networks to their destinations. From establishing and solving the main equations governing the behaviour of the bridge networks, the effects of design parameters such as the bridge buffer size and re-transmission backoff delay on the performance are studied.", } @INPROCEEDINGS{Koba93:Diffusion, AUTHOR="H. Kobayashi and Q. Ren", TITLE="A diffusion approximation analysis of an {ATM} statistical multiplexer with multiple types of traffic part {I:} equilibrium state solutions", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="1047-1053", YEAR=1993, REFERENCES=23, KEYWORDS="ATM; multiplexer; diffusion approximation; statistical multiplexer", ABSTRACT="We introduce a multi-dimensional diffusion model to characterizethe ``on-off'' source behaviour in an ATM statistical multiplexer, where multiple types of traffic are concentrated. Under a reasonable set of assumptions, this diffusion process can then be approximated by a multi-dimensional Ornstein-Uhlenbeck process, which is a Gaussian Markov process. The packet arrival process is shown to be a Gaussian (but not Markov) process.", } @INPROCEEDINGS{Kokk93:Optimal, AUTHOR="M. Logothetis and Shigeo Shioda and G. Kokkinakis", TITLE="Optimal Virtual Path Bandwidth Management assuring Network reliability", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=1, PAGES="30-36", YEAR=1993, REFERENCES=17, KEYWORDS="ATM; bandwidth allocation; virtual path; BISDN; reliability", ABSTRACT="The impact of virtual path bandwidth (VPB) management on the network performance in the expected environment of BISDN has been recognized and several VPB control schemes have been proposed. We present the optimal VPB management which minimizes the worst call blocking probability of all VPs in the network. We solve a large network optimization problem by a rigorous analytical procedure; bandwidth distribution; assuring reliability", } @INPROCEEDINGS{Kris93:There, AUTHOR="Ram Krishnan and N. F. Maxemchuk", TITLE="Is There Life Beyond Linear Topologies? A Comparison of {DQDB} and Manhattan Street Network", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=1, PAGES="690-698", MONTH="March/April", YEAR=1993, REFERENCES=12, KEYWORDS="Man; DQDB; comparison", ABSTRACT="In this paper, we make a performance and reliability comparison of two networks that have been proposed for use as high speed Metropolitan Area Networks (MAN's) - the Manhattan Street network and the DQDB network. We show that the MSN provides a much higher network throughput for a variety of traffic patterns - uniform and non-uniform. We also look at the reliabilitz of both networks and show that MSN can survive more failures than DQDB.", } @INPROCEEDINGS{Kwon93:Simple, AUTHOR="Hyuck Kwon and A. Tubtiang and", TITLE="A Simple Flow Control Mechanism in {ATM} Network with End to End transport", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="654-661", MONTH="March/April", YEAR=1993, REFERENCES=21, KEYWORDS="ATM; congestion Control; end-to-end flow control; window mechanism", ABSTRACT="In traditional data networks, the window flow control combined with error control was used prevalently. But, the window flow control mechanism might be useless in ATM networks because the propagation delay is too large compared with the transmission rate. In this paper, we propose a simple flow control mechanism, called RCT (Rate Control for end-to-end Transport), for end-to-end data transport. The RCT shows acceptable performance", } @INPROCEEDINGS{LaPo93:MSP, AUTHOR="Thomas La Porta and M. Schwartz", TITLE="Performance Analysis of {MSP:} A Feature-Rich High-Speed Transport Protocol", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=1, PAGES="513-520", MONTH="March/April", YEAR=1993, REFERENCES=9, KEYWORDS="Transport protocol; performance analysis; multiprocessor", ABSTRACT="This paper presents a performance analysis of the MultiStream Protocol (MSP), a feature-rich flexible transport protocol designed to meet the needs of high-performance applications. The analysis is based on the processing complexity associated with performing certain protocol functions, and highlights the advantages and disadvantages of the implementation of several different protocol mechanisms, such as packet or block mode data transfer.", } @INPROCEEDINGS{Lau93:Traffic, AUTHOR="Wing Cheong Lau and Sanqi Li", TITLE="Traffic Analysis in Large-Scale High-Speed Integrated Networks: Validation of Nodal Decomposition Approach", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="1320-1329", YEAR=1993, LANGUAGE="English", REFERENCES=9, KEYWORDS="ATM; statistical multiplexer; output process; simulation; bursty traffic; MMBP", ABSTRACT="In this paper we study the changes in individual source characteristics as traffic flows through a network. The effects of inter-source dependence caused by multiplexing at various network nodes are also investigated. Each traffic source is modeled as a 2-state or multiple-state Markov modulated process. Extensive simulations have been performed for homogeneous and heterogeneous traffic environments. Various network configurations have also been considered. We have identified the factors and parameters which have dominant effects on source distortions and inter-source cross-correlations. We also discuss the implications of our findings on the feasibility of decomposing the analysis of an ATM network into a set of separate nodal analyses.", ANNOTE="In this paper we determine the conditions under which nodal decompositions can be applied for network-wide, multimedia traffic analysis. Through extensive simulation studies on individual departure source characteristics and inter-source cross-correlation at the output side of a network node, the nodal decomposition approach has been validated for large-scale, high-speed integrated networks.", URL="http://www.ece.utexas.edu/~sanqi/papers.html", } @INPROCEEDINGS{Lee93:ATM, AUTHOR="Hwang-Soo Lee and J. W. Mark", TITLE="{ATM} Network Traffic Characterization Using Two Types of On-Off Sources", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=1, PAGES="152-159", MONTH="March/April", YEAR=1993, REFERENCES=12, KEYWORDS="Statistical Multiplexer; Bursty Traffic; MMPP; Correlated Variate; Approximation; Performance Evaluation; Finite Queue; Loss Probability", ABSTRACT="An approximate model is considered for characterizing aggregatedcell arrivals from heterogeneous sources which may generate cells in a highly time correlated manner. The model consists of two types of on-off sources and provides enough degrees of freedom to match a number of moments of cell arrival rates as well as the time correlation of the aggregated cell arrivals. Numerical examples are presented to illustrate the accuracy", } @INPROCEEDINGS{Leon93:StarBurst, AUTHOR="A. Leon-Garcia and I. Widjaja", TITLE="The StarBurst Switch with dedicated Output Buffering and Shared input Buffering", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="691-695", YEAR=1993, REFERENCES=7, KEYWORDS="ATM; performance evaluation; input buffer; output buffer; bursty traffic", ABSTRACT="The performance of an ATM switch can be seriously degraded undersome traffic types. The StarBurst architecture is a class of ATM switches which can employ both dedicated buffering and shared buffering. We show that the switch capacity can achieve that of output queueing switches.", } @INPROCEEDINGS{Li93:Fundamental, AUTHOR="Song Chong and Song Li", TITLE="Fundamental Limits of Input Rate Control in High Speed Network", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="662-671", MONTH="March/April", YEAR=1993, REFERENCES=15, KEYWORDS="ATM; source policing; leaky bucket; analysis; fluid flow model; spectral analysis", ABSTRACT="In this paper we study the performance trade-off of access rate control in high speed networks by spectral analysis. The emphasis is placed on the interrelationship between access control queueing and network queueing, as affected by degrees of control in response to differing input power spectrum. Both deterministic and stochastic analyses are developed. While the simple deterministic analysis helps us to gain a good engineering insight into access rate control in high speed networks, the stochastic analysis provides us quantitative measures of the access rate control in random traffic environment. Interesting observations are made between control performance and low-frequency input statistics. In the stochastic analysis we are able to derive the exact solutions of a network queue fed by a correlated source under the leaky-bucket access control.", ANNOTE="In this paper we explore the fundamental limits of input rate control by spectral analysis in frequency domain. Both deterministic and stochastic analyses are developed. Especially, the simple deterministic analysis helps us to gain a great knowledge of performance trade-off for input rate control in high speed network.", URL="http://www.ece.utexas.edu/~sanqi/papers.html", } @INPROCEEDINGS{Liew93:Fundamental, AUTHOR="S. C. Liew and T. T. Lee", TITLE="A Fundamental Property for Traffic Management in {ATM} Networks", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1240-1249", MONTH="March/April", YEAR=1993, REFERENCES=14, KEYWORDS="ATM; Switching; Traffic Control", ABSTRACT="It is desirable that the traffic-control policy at a network node depends only on the external traffic loads on the input and output links, but not on the detailed addressing or distributionof packets from inputs to outputs. It should be possible to guarantee the grade-of-service of an input-output connection by controlling the aggregate loads on the input and output. Switch nodes in which such a traffic-control policy is possible are", } @INPROCEEDINGS{Lin93:Minimax, AUTHOR="F. Lin and Jin-Tuu Wang", TITLE="Minimax Open Shortest Path First Routing Algorithms in Networks supporting the {SMDS} Service", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="666-670", YEAR=1993, REFERENCES=15, KEYWORDS="Shortest path; routing algorithm; SMDS", ABSTRACT="In this paper, we present and compare two quasi-static minimax Open Shortest Path First (OSPF) routing algorithms in networks supporting the SMDS service. The emphasis of this paper is (i)to consider a quasi-static ISSI routing scheme and present a formal problem formulation and (ii) to develop an efficient and effective algorithm to solve the problem.", } @INPROCEEDINGS{Logo93:Reliability, AUTHOR="D. Logothetis and K. S. Trivedi", TITLE="Reliability Analysis of Various Station Attachment Schemes in a {FDDI} Token Ring", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="201-208", MONTH="March/April", YEAR=1993, REFERENCES=7, KEYWORDS="FDDI; reliability; MAN; hslan", ABSTRACT="Five different attachment schemes proposed for the FDDI token ring are compared in terms of reliability. For this purpose, the topologies are first studied in isolation (reliability of the path to the backbone) and subsequently end-to-end user relibailities are compared by combining backbone relibaility wiht the relibaility of the path to the backbone.", } @INPROCEEDINGS{Mark93:Computational, AUTHOR="J. W. Mark and G. Wu", TITLE="Computational methods for performance evaluation of an {ATM} multiplexer supporting bursty traffic", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="1022-1026", YEAR=1993, REFERENCES=12, KEYWORDS="ATM; performance evaluation; bursty traffic; multiplexer", ABSTRACT="An ATM multiplexer supporting a number of bursty sources is modeled as a discrete time, single server queueing system with an infinite buffer. The probability generating function (PGF) method is used to analyze the queueing behavior. The PGF method requires a large number of boundary values, and hence the roots of the characteristic equation. An iterative algorithm for evaluating the roots is proposed.", } @INPROCEEDINGS{Mase93:Fiber, AUTHOR="F. Masetti and P. Gavignet-Morin and D. Chiaroni and G. Da Loura", TITLE="Fiber Delay Lines Optical Buffer for {ATM} Photonic Switching Applications", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="935-942", MONTH="March/April", YEAR=1993, REFERENCES=46, KEYWORDS="ATM; optical switching; buffer; implementation; WDM; wavelength division multiplex", ABSTRACT="This paper presents an optical buffer shift register based on a set of fiber delay lines, with the goal of providing cell storage and queueing in ATM photonic switches. The concept of multi-wavelength cell buffering is adopted, to realise a shared buffer with a storage capacity equivalent to a set of shift registers. Since one wavelength-encoded cell only must enter onedelay line at each time slot, contention resolution is necessary", } @ARTICLE{Mate93:Proposal, AUTHOR="F. Matera and E. Ripani and M. Romagnoli and M. Settembre", TITLE="Proposal of an all Optical Shuffle Multihop Network", JOURNAL=ett, ADDRESS="Milano", VOLUME=4, NUMBER=2, PAGES="213-219", YEAR=1993, REFERENCES=13, KEYWORDS="Optical LAN; optical switching; hsLAN; MAN; shufflenet", ABSTRACT="In this paper a shuffle multihop network, with a routing and a processing completely obtained at optical level, is proposed for the first time. Such a network can be performed by means of optical AND gates based on second harmonic generation and optical XOR gates based on soliton dragging process. Soliton pulses are used to avoid the distortion caused by chromatic despersion. The main characteristics of the network: 64 nodes, 50 Gbit/s", } @INPROCEEDINGS{McAu93:Fast, AUTHOR="Anthony McAuley and P. Francis", TITLE="Fast Routing Table Lookup Using {CAMs}", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1382-1391", MONTH="March/April", YEAR=1993, REFERENCES=9, KEYWORDS="Hierarchical Network; Routing Table; Hierarchical Routing; Implementation", ABSTRACT="This paper investigates fast routing table lookup techniques, where the table is composed of hierarchical addresses such as those found in a national telephone network. The hierarchical addresses provide important benefits in large networks; but existing fast routing table lookup techniques, based on hardwaresuch as Content Addressable Memory (CAM), work only with flat addresses. We present several fast routing table lookup", } @INPROCEEDINGS{Meem93:New, AUTHOR="G. Meempat and G. Ramamurthy and B. Sengupta", TITLE="A New Performance Measure for Statistical Multiplexing: Perspective of the Individual Source", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="531-538", MONTH="March/April", YEAR=1993, REFERENCES=12, KEYWORDS="ATM; Fast Packet Switching; Service Degradation; Performance Measure; Loss Calculation; Analysis; Fluid Flow Model", ABSTRACT="In this paper, we introduce the notion of perceptible degradation of quality of the received signal seen by an individual user. We propose that the design of high-speed networks that support real-time traffic be carried out on the basis of a new performance measure, which is defined as the expected number of perceptible degradations that a customer is likely to encounter per unit of time. By using fluid-flow", } @INPROCEEDINGS{Mera93:Priority, AUTHOR="L. Merakos and L. K. Reiss", TITLE="Priority Shaping of Source Traffic for {ATM} networks", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="671-675", YEAR=1993, REFERENCES=4, KEYWORDS="ATM; traffic shaping; priority", ABSTRACT="Priority shaping of aggregate source traffic is proposed for usewith policed virtual paths in ATM networks. The shaping functionlocated between the traffic sources sharing the path and the network edge, acts as a self-policing mechanism augmented by a form of priority service. We propose two versions of the shaperand discuss their interaction with a virtual path policed by a leaky bucket mechanism optimization is considered.", } @INPROCEEDINGS{Merc93:Characterization, AUTHOR="G. Mercankosk and Antonio Cantoni", TITLE="Characterization of a {CBR} Connection over a Channel with Known Bounded Delay Variation", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1170-1177", MONTH="March/April", YEAR=1993, REFERENCES=7, KEYWORDS="Buffer Dimensioning; Delay Constraint; Reassembly Delay; Periodic Input Traffic", ABSTRACT="In this paper, we examine how to provide constant bit rate service over a channel that can be characterised by a constant transmission delay plus a variable cell access delay. To compensate for the variability in the access delay, buffers are used at the source and at the destination ends of the connection. In the paper, we determine the minimum size of buffers required at the transmitter and the receiver to provide", } @INPROCEEDINGS{Mill9303:Dynamic, AUTHOR="G. J. Miller and M. Paterakis", TITLE="Performance Evaluation of a Dynamic Priority mechanism for the pi-Persistent Protocol for Metropolitan Area Networks", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="707-714", MONTH="March/April", YEAR=1993, REFERENCES=15, KEYWORDS="Persistent; MAN; performance evaluation; dynamic priority", ABSTRACT="In this paper, we present a dynamic control algorithm for the multi-priority pi-persistent protocol that allows the protocol to adapt to changing network conditions in a fully distributed manner. Through a simulation model, we study the performance of the dynamic algorithm under various changing network scenarios, and we demonstrate the ability of the protocol to provide the desired quality of service to each priority class of traffic.", } @INPROCEEDINGS{Mouf93:Bridged, AUTHOR="Hussein Mouftah and R. Zarour", TITLE="Bridged Shuffle-Exchange Network: a high-perormance self-routing {ATM} switch", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="696-700", YEAR=1993, REFERENCES=7, KEYWORDS="ATM; self routing; multistage interconnection network", ABSTRACT="A high-performance self-routing switch architecture, based on multistage interconnection network is proposed for ATM switchingsystems. It makes use of the principle of error-prevention routing. The switch performance is studied under uniform trafficand full load conditions.", } @INPROCEEDINGS{Ayan93:Fast, AUTHOR="Ender Ayanoglu", TITLE="A fast topology update algorithm for restoration under multiple failures in broadband networks", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=3, PAGES="1295-1299", YEAR=1993, REFERENCES=2, KEYWORDS="ATM; broadband; failure; topology", ABSTRACT="In this paper, we propose a topology update algorithm, a particular flooding algorithm, against multiple link, path, or nodefailures. The algorithm accomplishes restoration faster than a similar algorithm proposed by up to three times for the first failure, up to five times for the secobd failure, up to 2n+1 timesfor the nth failure. The algorithm simplifies the protocol used in restoration, and reduces the number of messages passed in net", } @ARTICLE{Nico93:Cost, AUTHOR="D. M. Nicol", TITLE="The Cost of Conservative Synchronization in Parallel Discrete Event Simulations", JOURNAL=jacm, VOLUME=40, NUMBER=2, PAGES="304-333", YEAR=1993, REFERENCES=32, KEYWORDS="Distributed simulation; performance analysis; algorithm", ABSTRACT="This paper analytically studies the performance of a synchronous conservative parallel discrete-event simulation protocol. The class of models considered simulates activity in a physical domain, and possesses a limited ability to predict future behaviour.", } @INPROCEEDINGS{Nico93:Global, AUTHOR="D. M. Nicol", TITLE="Global synchronization for optimistic parallel discrete event simulation", BOOKTITLE="7th Workshop on PADS ACM - SIGSIM", ADDRESS="San Diego", VOLUME=23, PAGES="27-34", YEAR=1993, REFERENCES=10, KEYWORDS="Discrete event simulation; parallel algorithm; simulation; synchronization", ABSTRACT="In this paper we describe an efficient parallel algorithm derived from a common barrier synchronization algorithm used in parallel processing. The algorithm's principle attraction is speed, and generality - it is designed to be used in contexts more general than parallel discrete-event simulation. To establish our claim to speed, we compare our algorithm's performance with the standard barrier algorithm", } @INPROCEEDINGS{Ogie93:Efficient, AUTHOR="R. G. Ogier and Vlad Rutenburg", TITLE="Efficient Algorithms for optimal alternate Routing in communication networks", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="676-680", YEAR=1993, REFERENCES=9, KEYWORDS="Alternate routing; communication network; shortest path", ABSTRACT="Three new efficient distributed and centralized algorithms are presented for precomputing shortest alternate paths in a communication network. Such alternate paths can be used in case one or more links or nodes fail on the primary path between any two nodes.", } @INPROCEEDINGS{Ohta9303:Peak, AUTHOR="C. Ohta and H. Tode and Makoto Yamamoto and H. Okada and Y. Tezuka", TITLE="Peak Rate Regulation Scheme for {ATM} Networks and its Performance", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="680-689", MONTH="March/April", YEAR=1993, REFERENCES=12, KEYWORDS="ATM; Source Policing; Policing Function; Analysis; Matrix Analytic Method", ABSTRACT="In this paper, we address the rate control to restrict the peak cell rate of traffic. We study a rate control which can restrictthe number of cells during any fixed length time interval in a discrete-time environment. The scheme is realized by means of simple counter accumulation per slot, and it is easy to be synchronized with slots. We analyze this rate control scheme by using Matrix Analytic Techniques in order to investigate the", } @INPROCEEDINGS{Oie9303:Internally, AUTHOR="Yuji Oie and K. Kawahara and M. Murata and H. Miyahara", TITLE="Performance Analysis of Internally Unbuffered Large Scale {ATM} Switch with Bursty Traffic", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1270-1279", MONTH="March/April", YEAR=1993, REFERENCES=9, KEYWORDS="ATM; switching; analysis; loss probability", ABSTRACT="In this paper, we treat a 3-stage switching configuration with no internal buffers; i.e., bufferless switches are employed at the first and second stages, and output-buffered switches at thethird stage. A short-term cell loss probability is analyzed in order to examine the influence of bursty traffic on performance of the bufferless switch used at the first two stages. Furthermore, we propose a 4-stage switching configuration with", } @INPROCEEDINGS{Panc9303:Bandwidth, AUTHOR="P. Pancha and Magda El Zarki", TITLE="Bandwidth Requirements of Variable Bit Rate {MPEG} Sources in {ATM} Networks", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="902-909", MONTH="March/April", YEAR=1993, REFERENCES=7, KEYWORDS="Packet Video; ATM; Bandwidth Allocation; Dynamic Resource Allocation; Traffic Prediction; Simulation; oss Probability", ABSTRACT="The complex traffic characteristics of VBR video sources makes them difficult to accommodate in ATM networks. To efficiently transport these services will require both an understanding of the source traffic and novel network control schemes. We study the performance of variable bandwidth allocation schemes which estimate the required bandwidth for a VBR MPEG source using a simple prediction algorithm.", } @INPROCEEDINGS{Petr93:End, AUTHOR="David Petr and J. S. Wineinger", TITLE="End-to-End Priority Cell Discarding Analysis for {ATM} Networks", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1178-1185", MONTH="March/April", YEAR=1993, REFERENCES=10, KEYWORDS="ATM; Buffer Management; Packet Discarding; Priority; Performance Evaluation; Analysis; Loss Probability", ABSTRACT="We present extensions to a previous single-queue analysis that allow the calculation of end-to-end discarding probabilities foreach priority. We describe a computer tool based on this analysis that facilitates the calculation of end-to-end discarding probabilities for very general network topologies. Wecompare the computational efficiency of the computer-aided analytical tool with simulation techniques.", } @INPROCEEDINGS{Plot93:Parallel, AUTHOR="N. T. Plotkin and P. Varaiya", TITLE="Performance Analysis of Parallel {ATM} Connections for Gigabit SpeedApplications", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1186-1193", MONTH="March/April", YEAR=1993, REFERENCES=8, KEYWORDS="Host; Interconnection; ATM; Virtual Channel; Traffic Distribution; Resequencing; Analysis; Bursty Traffic", ABSTRACT="We study a system which uses multiple ATM virtual circuits operating in parallel in order to connect two hosts at gigabit speeds. Packets in parallel channels can bypass each other, so reordering of packets before delivery to the host is required. This paper analyses performance parameters of this system including ATM channel delay, packet loss, and resequencing delay.", } @INPROCEEDINGS{Pope93:Modeling, AUTHOR="A. Popescu and Y. Ismailov and H. Rajaei and R. Ayani", TITLE="Modeling and Performance evaluation of Multiaccess Mechanisms at {SUPERLAN}", BOOKTITLE=mascots, ISBN="1-56555-018-8", ADDRESS="San Diego", PAGES="176-182", NOTE="SCS Simulation Series", YEAR=1993, REFERENCES=16, KEYWORDS="HSLAN; LAN; MAN; media access control", ABSTRACT="An issue of highest interest in the field of optical networks is to develop viable network architectures targeted to deal with the electrooptic bottleneck problem. A new multi-wavelength-dedicated-to-application concept, called SUPERLAN, has been proposed to solve this problem. This is an architecture where time-synchronous channels placed in different wavelengths are dedicated to different applications and control mechanisms.", } @INPROCEEDINGS{Pott93:Shared, AUTHOR="P. G. Potter and L. Wedding and Li-jun Yao and Moshe Zukerman", TITLE="A shared medium multi-service protocol", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="1000-1004", YEAR=1993, REFERENCES=7, KEYWORDS="ATM; traffic shaping; protocol; priority", ABSTRACT="This paper describes a new ATM shared medium protocol which guarantees capacity for CBR and VBR services. The protocol includes a traffic shaping function, multiple prioritized access, a buffer insertion mechanism, destination release and distributed queueing for lower priority traffic. The protocol also allows for mixed priority mode for a connection to provide efficient and fair access for VBR connec. requiring a guaran. rate lower than peak.", } @INPROCEEDINGS{Rama93:Predictive, AUTHOR="G. Ramamurthy and B. Sengupta", TITLE="A Predictive Hop-by-Hop Congestion Control Policy for High-Speed Networks", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1033-1041", MONTH="March/April", YEAR=1993, REFERENCES=15, KEYWORDS="ATM; Congestion Control; Traffic Prediction; Autoregressive Process; Performance Evaluation; Simulation", ABSTRACT="In this paper, we present a predictive congestion control policyfor carrying data traffic in the presence of real time traffic which have stringent delay requirements such as voice and video traffic. The policy is based on information exchange between adjacent nodes of the network. We characterise the cross trafficby its mean, its variance and the correlation, and we study the performance of our scheme over a wide range of cross traffic", } @ARTICLE{Rama93:Commercial, AUTHOR="G. Ramanathan and J. Oren", TITLE="Survey of Commercial Parallel Machines", JOURNAL=acmcan, VOLUME=21, NUMBER=3, PAGES="13-33", YEAR=1993, REFERENCES=16, KEYWORDS="Parallel computing; distributed computing system; survey", ABSTRACT="We have presented in this paper the survey of the parallel machines that are marketed today. The survey includes the latest machines available from Kendell Square Research, Thinking Machines Corporation, MasPar computer Corporation, NCUBE Corporation, Sequent Computer Systems and Parsytec. We have provided the topology, architecture, cache coherence, synchronization and performance in MFLOPs for each of the machines.", } @INPROCEEDINGS{Rein93:Statistical, AUTHOR="D. Reininger and others", TITLE="Statistical Multiplexing of {VBR} {MPEG} Compressed Video on {ATM} Networks", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="919-926", MONTH="March/April", YEAR=1993, REFERENCES=16, KEYWORDS="Packet Video; ATM; Traffic Source Model; Simulation; Loss Probability; Statistical Multiplexing", ANNOTE="This paper introduces a VBR MPEG video compression encoder , andevaluates the performance of a statistically multiplexed ATM network supporting a number of such VBR video sources. The results confirm that good ATM channel efficiencies (approximately 80-90\%) canbe obtained at reasonable cell loss rate and delay levels in thestatistical multiplexing scenario under consideration.", } @INPROCEEDINGS{Reis93:Shaping, AUTHOR="L. K. Reiss and L. Merakos", TITLE="Shaping of Virtual Path Traffic for {ATM} {BISDN}", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=1, PAGES="168-175", MONTH="March/April", YEAR=1993, REFERENCES=14, KEYWORDS="ATM; Virtual Path; Policing Function; Leaky Bucket; Analysis; Fluid Flow Model", ABSTRACT="Two mechanisms for shaping private network traffic in ATM BISDNare proposed and analyzed. The shapers utilize the information about the network policer and implement a form of priority service to assure satisfactory levels of cell loss and delay fortraffic streams with different service requirements multiplexed into a policed ATM virtual path. The performance of the shapers is analyzed using stochastic-fluid methods and Markov-modulated", } @INPROCEEDINGS{Rubi93:Burst, AUTHOR="I. Rubin and Kuang-Shin Lin", TITLE="A Burst-Level Adaptive Input-Rate Flow Control Scheme", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="386-394", MONTH="March/April", YEAR=1993, REFERENCES=16, KEYWORDS="ATM; Congestion Control; Flow Control; Access Control; Performance Evaluation; Analysis", ABSTRACT="We propose a new input rate flow control scheme wherein the credit increment rate is updated periodically as the loading status varies. Based upon the observed status of each station's burst-level activity, the network access node distributes feedback control messages to the stations. These signalling messages allow the stations to adapt their credit increment rates in accordance with system burst-loading conditions. We", } @ARTICLE{Schm93:Transport, AUTHOR="Douglas Schmidt and T. Suda", TITLE="Transport System Architecture Services for High-Performance Communications Systems", JOURNAL=ieeejsac, VOLUME="SAC-11", NUMBER=4, PAGES="489-506", YEAR=1993, REFERENCES=46, KEYWORDS="Transport protocol; unix", ABSTRACT="This paper describes and classifies transport system services that integrate operating system resources such as CPU's, virtual memory, and I/O devices together with network protocols to support distributed multimedia applications running on local and wide area networks. A taxonomy is presented that compares and evaluates for commercial and experimental transport systems in terms of their protocol processing support.", } @INPROCEEDINGS{Shar93:Approximate, AUTHOR="Sanjay Kumar Sharma and D. Tipper", TITLE="Approximate Models for the Study of nonstationary Queues and their Applications to Communication Networks", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=1, PAGES="352-358", YEAR=1993, REFERENCES=13, KEYWORDS="ATM; Markovian queueing system; priority; M/D/1; fluid flow model; nonpreemptive priority", ABSTRACT="The modelling of ATM networks, and the effect of nonstationary traffic patterns, is of considerable interest to research community. In this paper, we present numerical methods based techniques to model multi-class Markovian traffic, with and without priority, in ATM networks. The use of these models is validated, under stationary and nonstationary traffic patterns, with simulation.", } @INPROCEEDINGS{Shen93:Second, AUTHOR="Hong-Dah Sheng and Song Li", TITLE="Second Order Effect of Binary Sources on Characteristics of Queue and Loss Rate", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=1, PAGES="18-27", MONTH="March/April", YEAR=1993, REFERENCES=20, KEYWORDS="Statistical Multiplexer; MMPP/G/1; Bursty Traffic; Correlated Variate; Spectral Analysis; Performance Evaluation; Finite Queue; Loss Probability", ABSTRACT="In this paper we characterize the second-order properties of a binary source by multi-state MMPP. A comprehensive numerical study is carried out to identify the individual effect of sourcesecond-order dynamics on queue length and loss rate. The conceptof input power spectrum is then developed as a unified source measurement for multimedia traffic analyses. This study well explores the inter-relationship between the source second-order", } @INPROCEEDINGS{Siba93:Class, AUTHOR="S. Sibal and Ji Zhang", TITLE="On a Class of Banyan Networks and Tandem Banyan Switching Fabrics", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="481-488", MONTH="March/April", YEAR=1993, REFERENCES=9, KEYWORDS="ATM; Switching Network; Banyan Network; Multistage Interconnection Network; Output Buffer; Performance Evaluation; Simulation", ABSTRACT="This paper examines the operating characteristics of a class of Tandem Banyan Switching Fabrics (TBSF) built using Bi-Delta Networks. Functional equivalence between Bi-Delta Networks induces an equivalence between TBSFs as well. A weaker form of equivalence guaranteeing identical performance under conditions of symmetric traffic is studied, and a sufficient condition for weak equivalence between functionally distinct TBSFs is", } @INPROCEEDINGS{Stey93:General, AUTHOR="B. Steyart and H. Bruneel and Yongqiang Xiong", TITLE="A General Relationship between Buffer Occupancy and Delay in discrete-Time Multiserver Queueing Models, Applicable in {ATM} networks", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1250-1258", MONTH="March/April", YEAR=1993, REFERENCES=20, KEYWORDS="ATM; queueing system; multiserver", ABSTRACT="In this paper, we investigate a multiserver discrete-time buffersystem. Packets arrive in the system according to a general correlated process, which is not further specified. The service times of the packets are of constant length. Explicit expressions are derived for the distribution, probability generating function, mean and variance of the packet delay, interms of the", } @INPROCEEDINGS{Taki93:Cell, AUTHOR="T. Takine and T. Suda and Toshiharu Hasegawa", TITLE="Cell Loss and Output Process Analyses of a Finite-Buffer discrete-Time {ATM} Queueing System with Correlated Arrivals", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1259-1269", MONTH="March/April", YEAR=1993, REFERENCES=20, KEYWORDS="ATM; statistical multiplexing; performance evaluation; analysis; DMAP; batch arrival; matrix analytic method; loss probability; Interdeparture Time; Busy Period; Output Process", ABSTRACT="This paper analyzes the performance of an ATM switching node considering cell arrival correlation. An ATM switching node is modeled as a discrete-time finite-buffer queue. Cell arrivals are assumed to follow a semi-Markovian process, where the numberof cell arrivals in a slot depends on the states of the underlying MC in the current and the previous slots. Obtained results include the cell loss probability, the consecutive loss", } @INPROCEEDINGS{Tedi93:Effectiveness, AUTHOR="T. E. Tedijanto and L. GŸn", TITLE="Effectiveness of Dynamic Bandwidth Management Mechanisms in {ATM} networks", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=1, PAGES="358-367", MONTH="March/April", YEAR=1993, REFERENCES=7, KEYWORDS="ATM; Congestion Control; Flow Control; Access Control; Policing Function; Traffic Measurement", ABSTRACT="One of the major challenges of controlling the congestion in high-speed networks is to provide the necessary integration between different control actions operating at different time scales. In this paper, we argue that providing such an interplayonly at connection setup is necessary but not sufficient for successful bandwidth management. Rather, the cell-level access control functions should continuously monitor the traffic", } @MISC{Thei93:New, AUTHOR="T. H. Theimer", TITLE="A New Model for the Analysis of Multistage {ATM} Switch Fabrics", PAGES=15, YEAR=1993, REFERENCES=16, KEYWORDS="ATM; Switching; Multistage Interconnection Network; Output Buffer; Asymptotic Analysis; Approximation; Matrix Analytic Method", ABSTRACT="Dimensioning the internal buffers of a multistage ATM switch fabric has to be based on the traffic characteristics observed inside the switch. This paper presents an approximate model for the departure process of an output buffer which is based on a 3-state Markov Chain. We also derive an explicit expression for the correlation behaviour of the internal traffic, which provides a basis for obtaining the Markov Chain parameters. It", } @ARTICLE{Thek93:Limits, AUTHOR="Chandramohan A. Thekkath and H. M. Levy", TITLE="Limits to Low-Latency Communication on High-Speed Networks", JOURNAL=tocs, VOLUME=11, NUMBER=2, PAGES="179-203", YEAR=1993, REFERENCES=34, KEYWORDS="HsLAN; design; measurement; performance analysis; ATM; transport protocol", ABSTRACT="This paper examines the system-level effects of newer high-speed network technologies on low-latency, cross-machine communications. To evaluate a number of influences, both hardware and software, we designed and implemnted a new remote procedure call system targeted at providing low latency.", } @INPROCEEDINGS{Toyo93:Simple, AUTHOR="H. Toyoizumi", TITLE="A Simple Method of Estimating Mean Delay by Counting Arrivals and Departures", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=2, PAGES="829-834", MONTH="March/April", YEAR=1993, REFERENCES=14, KEYWORDS="M/G/1; Delay Analysis; Mean Delay; Approximation; Event Counting", ABSTRACT="We present a simple method of estimating mean delay (sojourn time in queueing terminology) of a call-processing processor in communication switching systems by observing actual behaviour ofthe systems. We show Little's formula leads to the estimation ofthe mean delay from the number of arrivals and departures. Hence, counters for the number of arrivals and departures are required for our method. This is easy to apply to real systems", } @INPROCEEDINGS{Tung93:Large, AUTHOR="E. H. Tung and P. C. Wong", TITLE="A large scale Packet Switch Inteconnection Architecture using overflow Switches", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=2, PAGES="708-714", YEAR=1993, REFERENCES=9, KEYWORDS="Packet switching; architecture; overflow; loss probability", ABSTRACT="In this paper, several large scale switch interconnection architectures are reviewed and compared. A three-stage interconnectionarchitecture is proposed in which the second and the third-stageswitches are grouped into partitions. The cell loss probability can be greatly reduced.", } @INPROCEEDINGS{Verb93:Automated, AUTHOR="F. Verboven and F. Tallieu", TITLE="Automated Generation of Discrete Event-Driven Simulation Code from Computer Network specifications", BOOKTITLE=mascots, SERIES="SCS Simulation Series", ISBN="1-56555-018-8", ADDRESS="San Diego", VOLUME=25, PAGES="191-194", YEAR=1993, REFERENCES=10, KEYWORDS="Discrete event simulation; distributed simulation; media access control; LOTOS", ABSTRACT="In this paper, a tool called ADDES is presented, which makes it possible to automatically create discrete event-driven simulation code from a given network description. The code is created according to the microscopic simulation approach. The basic idea is to use white box models for the protocol layers in the network. ADDES has two main input descriptions namely a network layout description and a protocol behaviour description in LOTOS.", } @INPROCEEDINGS{Wang93:Interdeparture, AUTHOR="Jin-Tuu Wang and J. P. Zhou and Chia-Jiu Wang and Y. H. Fan", TITLE="Interdeparture Processes of Traffic from {ATM} Networks", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1337-1341", MONTH="March/April", YEAR=1993, REFERENCES=12, KEYWORDS="ATM; Statistical Multiplexer; HOL Priority; Output Process; Interdeparture Time; Bursty Traffic; Analysis", ABSTRACT="In this paper, we study the interdeparture processes in ATM networks for both real-time traffic and non-real-time traffic. The cell arrival process is assumed to consist of several switched deterministic Processes and a batch Bernoulli process. Two queues, ordinary queue and priority queue, are set for real-time traffic and non-real-time traffic, respectively.", } @ARTICLE{Wats93:, AUTHOR="G. N. Watson and S. Tohm", TITLE="{S++} - A New {MAC} Protocol for Gb/s Local Area Networks", JOURNAL=ieeejsac, VOLUME="SAC-11", NUMBER=4, PAGES="531-539", YEAR=1993, REFERENCES=19, KEYWORDS="Media access control; hsLAN; MAN; protocol", ABSTRACT="We propose a new MAC layer protocol, called S++, which offers several features that are desirable for Gb/s local area networks. We explain how the S++ protocol overcomes the limitations of an earlier protocol while, at the same time, it is very simple and thus attractive for use in a high-speed network. The performance of the protocol has been investigated by detailed simulations wich have been confirmed by the use of an analytical model.", } @BOOK{Wies93:Pentium, AUTHOR="J. Wiesböck and B. Wopper and G. Wurthmann", TITLE="Pentium Prozessor: Die nächste Generation der Intel-Architektur", ISBN="3-87791-484-5", PUBLISHER="Markt \\& Technik", ADDRESS="München", YEAR=1993, LANGUAGE="German", KEYWORDS="Microprocessor", } @ARTICLE{Will93:Media, AUTHOR="K. C. Williams and T. Q. Dam and Dong-Hui Du", TITLE="A Media-Access Protocol for Time- and Wavelength-Division Multiplexed Passive Star Networks", JOURNAL=ieeejsac, VOLUME="SAC-11", NUMBER=4, PAGES="560-567", YEAR=1993, REFERENCES=21, KEYWORDS="Media access control; TDMA; time division multiple access; wdm=wavelength division multiplex; tdm=time division multiplex; star network", ABSTRACT="A new media access protocol is presented for time- and wavelength-division multiplexed optical passive star networks. The protocol is based on a new ``Bus-Mesh'' virtual topology. The network provides minimum lateny and high throughput, while requiring only a single fixed wavelenth transmitter and receiver at each station.", } @INPROCEEDINGS{Witt93:Evaluating, AUTHOR="E. Witte Zegura", TITLE="Evaluating Blocking Probability in Distributors", BOOKTITLE=infocom, ADDRESS="San Francisco", VOLUME=3, PAGES="1107-1116", MONTH="March/April", YEAR=1993, REFERENCES=9, KEYWORDS="Switching Network; Circuit Switching; Traffic Distribution; Delta Network; Blocking; Performance Evaluation; Analysis", ABSTRACT="We present a model for evaluating blocking probability in distribution networks. Based on the assumption of the model, we derive equations for computing the blocking probability for the class of series-parallel networks. The equations are exact for pure series networks and approximate for parallel networks. We investigate the accuracy of the approximation by comparing the blocking probability to simulation data.", } @ARTICLE{Yau93:Object, AUTHOR="S. S. Yau and D.-H. Bae and M. Chidambaram", TITLE="Object-oriented development of architecture transparent software for distributed parallel systems", JOURNAL=comcom, VOLUME=16, NUMBER=5, PAGES="317-327", YEAR=1993, REFERENCES=12, KEYWORDS="Distributed processing; architecture; object-oriented programming", ABSTRACT="In this paper, an approach to software development for distributed parallel processing systems which is architecture transparent is presented. This approach is based on the object-oriented concept, and facilitates the design and coding of software by separating the architecture-dependent issues from the semantics of the software. This makes the software system independent of the target machine or the network configuration, and easy portable.", } @INPROCEEDINGS{Yih93:Access, AUTHOR="J.-S. Yih and Chuxiang Li and D. Kandlur and M. S. Yang", TITLE="Network Access Fairness Control for Concurrent Traffic in Gigabit {LANs}", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="497-504", MONTH="March/April", YEAR=1993, REFERENCES=8, KEYWORDS="Fairness; MAN; hsLAN; ring network; network protocol", ABSTRACT="This paper describes a new buffer insertion ring with network access fairness control for gigabit LANs. The basic buffer insertion ring has the maximum spatial reuse on the multiple ring segments bz allowing concurrent traffic. But, it is well known that the buffer insertion technique suffers from the possibility of station starvation. To solve this problem, a new notion of fairness based on mutual interference between pairs of stations.", } @ARTICLE{Zitt93:Model, AUTHOR="M. Zitterbart and B. Stiller and A. Tantawy", TITLE="A Model for Flexible High-Performance Communication Subsystems", JOURNAL=ieeejsac, VOLUME="SAC-11", NUMBER=4, PAGES="507-518", YEAR=1993, REFERENCES=32, KEYWORDS="Communication system; protocol", ABSTRACT="Many emerging applications require very diverse services from the underlying communication subsystem. Future communication nodes will have to offer a high degree of flexibility in selecting service characteristics and considerable efficiency in implementing them. In this paper, we present a function-based communication model that allows applications to request individually tailored services from the communication subsystem.", } @ARTICLE{Abat93:Calculation, AUTHOR="J. Abate and G. L. Choudhury and W. Whitt", TITLE="Calculation of the {GI/G/1} waiting-time distribution and its cumulants from Pollaczek's formulas", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="311-321", YEAR=1993, REFERENCES=50, KEYWORDS="Queueing theory; GI/G/1; waiting time; Laplace transform", ABSTRACT="In 1952 F. Pollaczek derived contour-integral expressions for the Laplace transform and the cumulants of the GI/G/1 steady-state waiting-time distribution. We show that it is easy to computethe GI/G/1 waiting-time distribution and its cumulants (and thus its moments) from Pollaczek's formulas.", } @ARTICLE{Bafu93:Modelling, AUTHOR="M. Bafutto and P. J. Kühn and G. Willmann", TITLE="Modelling and performance analysis of common channel signalling networks", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="411-419", YEAR=1993, REFERENCES=34, KEYWORDS="Performance evaluation; signalling; common channel", ABSTRACT="In this paper, a generic modelling approach for the signalling network is developed which yields loading of all network resources and the network performance. The models are obtained considering the signalling system protocol functions specified by theCCITT, as well as the information flows through these functions. The approachh allows the derivation of virtual processor models, which in a further step are mapped onto the implementation.", } @INPROCEEDINGS{Bern93:Two, AUTHOR="F. Bernabei and Laura Gratta and M. Listanti and M. Testa", TITLE="Analysis of two level shaping for multiplexing of on-off {ATM} sources", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=3, PAGES="1380-1385", YEAR=1993, REFERENCES=10, KEYWORDS="ATM; traffic shaping; fluid flow model", ABSTRACT="This paper deals with the analysis of the multiplexing of shapedon-off sources in an ATM environment. In particular, a two levelshaper, modulating the source output bit rate on the basis of the buffer occupancy level, is studied. A very accurate analyticalmodel describing its behaivour is provided too. Such a model allows an accurate description of the shaper output flow; accuracy of analytical model is investigated by simulation.", } @ARTICLE{Bor93:Uniqueness, AUTHOR="S. S. Bor and A. G. Konheim", TITLE="A uniqueness theorem for buffer allocation", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="390-396", YEAR=1993, REFERENCES=7, KEYWORDS="Buffer; allocation; queueing system; packet switching; flow control", ABSTRACT="The exact or numerical analysis of many queueing systems is often intractable due to the complexity and size of the state space and the lack of decomposability. Often the parameters (for the effects of subsystem interaction) are a fixed point of some mapping. This paper examines flow control in a packet switching network by input buffer limits. It proves the paradigm determines a unique set of parameters.", } @ARTICLE{Boxm93:Correlated, AUTHOR="O. J. Boxma and M. B. Combe", TITLE="The correlated {M/G/1} Queue", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="330-335", YEAR=1993, REFERENCES=16, KEYWORDS="Queueing theory; M/G/1; waiting time; service time", ABSTRACT="This paper considers a single server queue in which the service time of each customer depends on the length of the preceeding interarrival interval. The dependence structure corresponds to the situation where work arrives at a gate according to a process with independent increments, while at exponential intervals the gate is openede and - after the addition of an independent component - the work is delivereed to the server as a single custo.", } @INPROCEEDINGS{Chak93:Networking, AUTHOR="S. Chaki and S. Nakajima and M. Omotani and T. Takahashi", TITLE="{BISDN} networking using group virtual paths", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=3, PAGES="1343-1347", YEAR=1993, REFERENCES=6, KEYWORDS="BISDN; network; virtual path; statistical multiplexing; ATM", ABSTRACT="A bandwidth sharing scheme called the Group Virtual Path (GVP) is presented. The effects of statistical multiplexing with this scheme are evaluated and the cell transfer level and at the callhandling level by employing such parameters as burstiness of traffic source and number of multiplexed VPs. The GVP is then applied to BISDN networking. It greatly reduces the required transmission capacity and the cell handling capacity of the switching", } @INPROCEEDINGS{Chla93:Establish, AUTHOR="I. Chlamtac and A. Farago and Tao Zhang", TITLE="How to establish and utilize virtual paths in {ATM} networks", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=3, PAGES="1368-1372", YEAR=1993, REFERENCES=13, KEYWORDS="ATM; virtual path", ABSTRACT="In this paper we show how to establish and use virtual pathsin ATM networks. We show that optimizing the use of virtual paths involves computationally hard (NP-complete) problems. We therefore develop approximate solutions and show that they have feasible computationally complexity for even very large networks and can account for network topology, the available bandwidth, as well as traffic requirements.", } @ARTICLE{Cohe93:Complex, AUTHOR="J. W. Cohen", TITLE="Complex functions in Queueing Theory", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="300-310", YEAR=1993, REFERENCES=21, KEYWORDS="Queueing theory; GI/G/1", ABSTRACT="His (Pollaczek's) analysis of the GI/G/1 queueing model was and still is significant. The present study exposes the analysis out from these (Probability theory, analytic functions) backgrounds. For the time dependent as well as the stationary case this leads to the formulation of Riemann Boundary Value ProblemsThe analysis of it for the stationary case is exposed and its solution is derived under slightly weaker conditions than Pollacz.", } @ARTICLE{Coop93:Teletraffic, AUTHOR="R. B. Cooper and M. Solomon", TITLE="Teletraffic Theory applied to the analysis of hash-structured files", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="336-341", YEAR=1993, REFERENCES=10, KEYWORDS="Performance evaluation; Poisson process", ABSTRACT="Certain hash-structured files consist of sequences (chains) of computer memory locations (slots) into which records are inserted, and from which they are later retrieved or deleted. If we assume that the records arrive to a file according to a Poisson process for insertion into a chain, and reside in memory for a random length of time before deleted, then we can associate this with a teletraffic model.", } @ARTICLE{Dadu93:Delay, AUTHOR="H. Daduna and R. A. Schassberger", TITLE="Delay time distributions and adjusted transfer rates for Jackson networks", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="342-348", YEAR=1993, REFERENCES=19, KEYWORDS="Queueing network; Jackson net; delay time; transfer rate", ABSTRACT="For the classical queueing networks named after Jackson closed-form expressions for the steady-state travel time distribution along a given path can be obtained, in general, only for so-called overtake-free paths. The paper summarizes the corresponding results and then proceeds to show how they are affected by a method for representing background traffic, called the method of adjusted transfer rates. Examples from the telecommunication world are given", } @ARTICLE{Desc93:Waiting, AUTHOR="A. Descloux", TITLE="Waiting-Line distribution in {$M^[B]/D/1$} Queues with geometric batch input", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="349-352", YEAR=1993, REFERENCES=8, KEYWORDS="MB/D/1; batch arrival; waiting time", ABSTRACT="The present work was motivated by the need to have computationally sound formulas for the waiting-line distribution in $M^[B]/D/1$ queues. We prove here by elementary means that these formulas can be transformed into fast converging series of positive terms by means of an identity obtained by allowing the summationindices of these finite sums to run infinitely.", } @ARTICLE{Dosh93:Social, AUTHOR="B. T. Doshi", TITLE="Social, individual, and greedy optimization in queueing systems with multiple sources and additional delay: application to high speed packet networks", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="397-410", YEAR=1993, REFERENCES=29, KEYWORDS="Queueing system; Greedy algorithm; high speed", ABSTRACT="Rate and window controls are used by the users of packet networks to adapt to the congestion level in the network and to maintain a high performance level (...) in the face of changing network conditions. When multiple users share such networks, natural questions arise as to the relative merits of socially optimal controls and individually optimal controls. In addition, the performance impact of one or more users deviating from the prescribed", } @INPROCEEDINGS{Elwa93:Effective, AUTHOR="A. I. Elwalid and D. Mitra", TITLE="Effective bandwidth of bursty, variable rate sources for admission control to {BISDN}", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=3, PAGES="1325-1330", YEAR=1993, REFERENCES=16, KEYWORDS="ATM; BISDN; connection admission control; statistical multiplexing", ABSTRACT="The emerging high speed networks, notably the ATM-based Broadband-ISDN, are expected to integrate through statistical multiplexing large numbers of traffic sources. We show that for the admission control of general Markovian traffic sources it is possible to assign a notional effective bandwidth to each source which is an explicitly identified, simply computed quantity with provably correct properties in asymptotic; small loss probabilities", } @INPROCEEDINGS{Evan93:Access, AUTHOR="David Petr and Joseph B. Evans and Lyn A. Neir and J. Singh and Victor S. Frost", TITLE="Access traffic control implementations for frame relay", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=3, PAGES="1348-1352", YEAR=1993, REFERENCES=6, KEYWORDS="Traffic shaping; leaky bucket; access control; frame relay", ABSTRACT="This paper considers various aspects of the implementation of access traffic control mechanisms for frame relay networks. We highlight the distinction between two related rate control mechanisms: access policing by the network and traffic shaping by the user. We also discuss design requirements of a leaky bucket shaper that will achieve zero policing loss and minimum delay when operating in conjunction with a leaky bucket policer.", } @ARTICLE{Feld93:Two, AUTHOR="Robert E. Felderman and L. Kleinrock", TITLE="Two processor time warp analysis: Capturing the Effects of message queueing and rollback/state saving costs", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="353-367", YEAR=1993, REFERENCES=21, KEYWORDS="Time warp; rollback; distributed simulation", ABSTRACT="We present two new models and their exact analysis for the problem of two processors running the time warp distributed simulation protocol. Our first model addresses the queueing of messages at each processor while the second model adds costs for rollbackand state saving. Both models provide insight into the operationof freerunning systems synchronized by rollback.", } @ARTICLE{Gani93:Dam, AUTHOR="J. Gani", TITLE="Dam theory and related queueing models", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="368-371", YEAR=1993, REFERENCES=23, KEYWORDS="Queueing theory; discrete time; continuous time process; correlation", ABSTRACT="This paper provides a brief review of developments in the theoryof dams, and their relation to queueing models. Dams in discreteand continuous time are considered, as are also dams with correlated inputs. The paper ends with an account of dams subject to sedimentation, and offers some remarks on the value of dam theory.", } @ARTICLE{Gold93:Batch, AUTHOR="H. Gold and H. Grob and P. Tran-Gia", TITLE="A batch service system operating in a pull production line", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="379-385", YEAR=1993, REFERENCES=14, KEYWORDS="Queueing system; batch processing; imbedded Markov chain; waiting time; blocking", ABSTRACT="In this paper, we present an analysis of a queueing system with batch service working in ``pull`` operation mode. The model, whicharise out of manufacturing systems, consists of a batch server with an arbitrary service time. We consider the ``pull'' operationmode, i.e., the demands ae indicated at the rear end of the system and trigger the server operation. A service period is activated when a service starting threshold of waiting demands . reached", } @ARTICLE{Hart93:Enhanced, AUTHOR="H. L. Hartmann and Z. Zhang", TITLE="Enhanced engineering of packet switching networks subject to capacity and reliability constraints", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="459-465", YEAR=1993, REFERENCES=7, KEYWORDS="Packet switching; reliability; capacity assignment", ABSTRACT="In this paper, the joint optimization of capacity and flow assignment (CFA) in packet switching virtual circuit networks is considered. Besides the network topology and traffic characteristics, capacity and reliability constraints of the links/nodes, modelled as upper and lower bounds for the dimensioning, are given. The goal of the optimal upper and lower bounded CFA is to obtain the least costly feasible design satisfying the constraints.", } @INPROCEEDINGS{Herz93:Hierachical, AUTHOR="M. Herzberg and Andreas Pitsillides", TITLE="A hierachical approach for the bandwidth allocation, management and control in {BISDN}", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=3, PAGES="1320-1324", YEAR=1993, REFERENCES=21, KEYWORDS="BISDN; bandwidth allocation; resource management; connection admission control; ATM", ABSTRACT="This paper adopts a hierarchical multilayer/multilevel approach for the allocation, management and control of BISDN resources. This approach seems appropriate to present a vertical decomposition of control layers, having different time-scales in addition to horizontal decomposition, derived from the geographical distribution of control units.", } @INPROCEEDINGS{Kris93:Approach, AUTHOR="Ram Krishnan and J. A. Silvester", TITLE="An approach to path-splitting in multipath networks", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=3, PAGES="1353-1357", YEAR=1993, REFERENCES=9, KEYWORDS="Multipath; load balancing", ABSTRACT="In this paper, we propose that a single connection at the transport layer be implemented as multiple source routes in the network layer resulting in a balanced loading of network resources. The paths are not necessarily of equal length. The problem of traffic bifurcation at the source, that achieves path splitting, is solved by computing the flows on all links in the networkto minimize the given objective function, as average delay or loss", } @ARTICLE{LeGa93:Application, AUTHOR="P. Le Gall", TITLE="The application of Pollaczek's Method to single server queueing networks", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="326-329", YEAR=1993, REFERENCES=16, KEYWORDS="Queueing network; single server; GI/G/1; tandem queue", ABSTRACT="The author gives a short review of some of his investigations on queueing systems, which are based on Pollaczek's analytical methods and have not all been published in English. After introducing a queue GI/G/1 with a ``permanent server'' and a two-inputqueueing model of the type (G+M)/G/1, the ideas are outlined howto analyse networks consisting of tandem connected and meshed single server queues.", } @ARTICLE{Lehn93:Distributed, AUTHOR="R. Lehnert", TITLE="Distributed simulation for performance evaluation of broadband communication networks", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="420-425", YEAR=1993, REFERENCES=16, KEYWORDS="Distributed simulation; performance evaluation; ATM; broadband", ABSTRACT="This contribution begins with an overview of the evolution of distributed simulation techniques for discrete event systems. It discusses at which modelling level a parallelization of simulation tasks is possible. Then the typical behaviour of broadbandsubscribers with variable bitrate is presented. Finally we discuss the feasibility of the presente simulation techniques to study the hard requirements for the quality of service in ATM network", } @INPROCEEDINGS{Li93:Individual, AUTHOR="T. Yang and Hungwen Li", TITLE="Individual cell loss probabilities and background effects in {ATM} networks", BOOKTITLE=icc, ADDRESS="Geneva, Switzerland", VOLUME=3, PAGES="1373-1379", YEAR=1993, REFERENCES=24, KEYWORDS="ATM; MMDP; loss probability; connection admission control; bandwidth allocation", ABSTRACT="In this paper, we consider an ATM multiplexer loaded with two classes of on-off sources. Applying the method of Markov modulateddeterministic processes (MMDP), we develop a simple algorithm for computing the individual cell loss probability for each class. With the help of this algorithm, we investigate how different traffic streams interact with each other with respect to individual cell loss probabilities.", } @INPROCEEDINGS{Matr93:Combined, AUTHOR="W. Matragi and K. Sohraby", TITLE="Combined reactive/preventive approach for congestion control in {ATM} networks", BOOKTITLE=icc, ADDRESS="Geneva", VOLUME=3, PAGES="1336-1342", YEAR=1993, REFERENCES=17, KEYWORDS="ATM; congestion control; leaky bucket", ABSTRACT="In this paper we propose an adaptive rate based congestion control mechanism based on the leaky bucket scheme. The parameters ofthe mechanism are controlled using (delayed) feedback information sent by the network. The network is modelled as a multiplexer fed by a number of sources each of which is controlled by a leaky bucket. We examine a simple threshold policy at the multiplexer queue to detect congestion.", } @ARTICLE{Nies93:Impact, AUTHOR="G. Niestegge", TITLE="The impact of traffic shaping on broadband network performance", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="426-434", YEAR=1993, REFERENCES=11, KEYWORDS="Broadband; ATM; traffic shaping; performance evaluation; congestion control; statistical multiplexing", ABSTRACT="The congestion control issue in ATM-based broadband networks is addressed. The paper suggests a traffic shaping function that limits the peak bit rate of an ATM connection to an appropriate value which may be much lower than the transmission bit rate of a broadband interface. Simulation results indicate that traffic shaping can significantly improve network performance.", } @ARTICLE{Pete93:Output, AUTHOR="J. Petersen", TITLE="The output process of a System {ND/D/1} with time-slotted service in steady state", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="386-389", YEAR=1993, REFERENCES=5, KEYWORDS="ATM; ND/D/1; steady state; busy period; idle period", ABSTRACT="In telecommunication networks with ATM, the multiplexing of streams of regularly arriving data units is of high importance, including the properties of the output process. The paper contains analytical results on the joint distribution of the lengths of busy and idle periods and of interdeparture times assuming time-slotted operation of the multiplexer.", } @ARTICLE{Robe93:Queueing, AUTHOR="J. W. Roberts", TITLE="Queueing models for variable bit rate traffic streams", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="435-439", YEAR=1993, REFERENCES=13, KEYWORDS="ATM; VBR; variable bitrate coding; queueing system", ABSTRACT="The evaluation of queueing arising in ATM multiplexers handling variable bit rate traffic has required the development of new modelling tools. Of particular importance are the so-called fluid queueing models. This paper gives a rapid outline of two methods for analysing fluid queues and discusses the results they provide on the way performance depends on traffic characteristics.", } @ARTICLE{Schr93:Properties, AUTHOR="F. Schreiber", TITLE="Properties and applications of the optimal queueing strategy {SPRT} - a survey", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="372-378", YEAR=1993, REFERENCES=38, KEYWORDS="Queueing discipline; FIFO; LIFO; SRPT; shortest remaining processing time; M/G/1; delay time; priority", ABSTRACT="This survey summarizes the results of recent investigations concerning queues operated by the preemptive strategy SRPT. In comparison to the strategies FIFO, LIFO and PS (processor sharing) itis shown for typical traffic conditions that the delay time of queueing system M/G/1-SRPT is distinguished not only by a low mean value but also by a comparably small standard deviation, and a negligible correlation.", } @ARTICLE{Sysk93:Pollaczeks, AUTHOR="R. Syski", TITLE="Pollaczeks's Method in Queueing Theory", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="282-299", YEAR=1993, REFERENCES=19, KEYWORDS="Queueing theory; GI/G/N", ABSTRACT="The exposition of F. Pollaczek's theory for the waiting system GI/G/s, with s>=1, is presented with emphasis on its implications for stochastic processes (especially random walks and fluctuation theory), integral equations and analytic functions. The case of single server is discussed in detail, and the relationship between some of Pollaczek's results and their recently discovered counterparts is examined in detail.", } @ARTICLE{Taka93:Pollaczek, AUTHOR="L. Takacs", TITLE="Pollaczek's results in fluctuation theory", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="322-325", YEAR=1993, REFERENCES=39, KEYWORDS="Queueing theory; waiting time; semi Markov process; busy period", ABSTRACT="In 1952 Pollaczek achieved remarkable results in fluctuation theory. Pollaczek's results made it possible to determine the stochastic laws of the waiting-time and the busy periods for single-server queues with recurrent input and general service times. This paper is concerned with the aforementioned results of Pollaczek and their extensions to random variables forming a semi-Markov sequence.", } @ARTICLE{Walk93:Traffic, AUTHOR="B. Walke", TITLE="Traffic problems in mobile radio networks", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="445-455", YEAR=1993, REFERENCES=23, KEYWORDS="Mobile radio; network; performance evaluation; blocking", ABSTRACT="Recent results of performance analysis studies of existent and future mobile radio networks are presented. The problems considered cover blocking during handover in cellular radio networks, mean progress per successful packet in multi-hop packet radio with transmit power control and directional antennas and modellingand analysis of mobility and impact of synchronization errors onshort-range radio networks for inter-vehicle communication.", } @ARTICLE{Wies93:Strategic, AUTHOR="W. Wieser", TITLE="A strategic network planning instrument for cost and volume estimation of {BISDN} introduction scenarios", JOURNAL=aeu, PUBLISHER="Hirzel Verlag", ADDRESS="Stuttgart", VOLUME=47, NUMBER="5/6", PAGES="456-458", YEAR=1993, REFERENCES=3, KEYWORDS="BISDN; network planning", ABSTRACT="The paper describes the strategic network planning tool KOMAN-BB, which enables a quantitative comparison of different possible BISDN introduction scenarios. The tool is based on the network synthesis approach which, using a detailed representation of thepresent network structure, maps parameter-defined BISDN scenarios into close-to-real network configurations and therefore givesinformation about the economic feasibility of scenarios.", } @ARTICLE{Boxm93:Efficient, AUTHOR="O. J. Boxma and H. M. Levy and J. A. Weststrate", TITLE="Efficient visit orders for polling systems", JOURNAL=pe, VOLUME=18, NUMBER=2, PAGES="103-123", YEAR=1993, REFERENCES=24, KEYWORDS="Polling system; changeover time; random polling", ABSTRACT="This paper deals with the issue od deriving efficient operational rules for polling systems with switchover times. Two heuristic approaches to the polling table problem are presented, both using the exact solution of a related problem.", } @ARTICLE{Baio93:Accurate, AUTHOR="A. Baiocchi", TITLE="Accurate formulae for the loss probability evaluation in a large class of queueing systems", JOURNAL=pe, VOLUME=18, NUMBER=2, PAGES="125-132", YEAR=1993, REFERENCES=4, KEYWORDS="ATM; m/g/1/s; geo/d/1/s", ABSTRACT="A very accurate approximation method is developed, that leads to explicit expressions for the loss probability of the M/G/1/K and GI/M/1/K queues. The results can be generalized to the corresponding discrete-time queueing models, i.e., the GEO/G/1/K and GI/Geo/1/K queues.", } @ARTICLE{Gail93:Buffer, AUTHOR="H. R. Gail and G. A. Grover and R. Guérin and S. L. Hantler and others", TITLE="Buffer size requirements under longest queue first", JOURNAL=pe, VOLUME=18, NUMBER=2, PAGES="133-140", YEAR=1993, REFERENCES=11, KEYWORDS="Queueing system; service discipline; priority", ANNOTE="Service discipline ``shortest queue first''", } @ARTICLE{Fali93:Characteristics, AUTHOR="G. I. Falin", TITLE="On the performance characteristics of a {TASI} system", JOURNAL=pe, VOLUME=18, NUMBER=2, PAGES="141-148", YEAR=1993, REFERENCES=3, KEYWORDS="TASI; talkspurt; performance evaluation", } @ARTICLE{Fisc93:Markov, AUTHOR="W. Fischer and K. S. Meier-Hellstern", TITLE="The Markov-modulated Poisson process {(MMPP)} cookbook", JOURNAL=pe, VOLUME=18, NUMBER=2, PAGES="149-171", YEAR=1993, REFERENCES=58, KEYWORDS="MMPP; survey; reference", ABSTRACT="Reference to the current state of the art in MMPP systems solutions.", } @ARTICLE{Kush93:Methodology, AUTHOR="R. Kushwaha", TITLE="Methodology for predicting performance of distributed and parallel systems", JOURNAL=pe, VOLUME=18, NUMBER=2, PAGES="189-204", YEAR=1993, REFERENCES=16, KEYWORDS="Queueing network; distributed system; approximation; simulation; response time", ABSTRACT="This paper describes an accurate and efficient method to model and predict the performance of distributed / parallel systems. various performance parameters, such as the expected user response time, the system throughput and the average server utilization, can be easily estimated.", } @BOOK{Effe93:Verteilte, TITLE="Verteilte Multimedia-Systeme: \rm Tagungsband; {GI/ITG-Arbeitstreffen,} Stuttgart, 18./19. Februar 1993\/", EDITOR="Wolfgang Effelsberg and Kurt Rothermel", ISBN="3-598-22407-9", PUBLISHER="Saur-Verlag, München", YEAR=1993, } @TECHREPORT{Fisc93:Estelle, AUTHOR="Stefan Fischer", TITLE="Implementation of Estelle Specifications on the {KSR1}", BOOKTITLE="One Year KSR1 at the University of Mannheim --- Results and Experiences", TYPE="Technical Report", INSTITUTION="Computing Center, University of Mannheim", NUMBER="35/93", YEAR=1993, } @INPROCEEDINGS{Hofm93:Integration, AUTHOR="Bernd Hofmann", TITLE="Integration von Darstellungs- und Kommunikationssteuerungsschicht in Estelle", BOOKTITLE="ITG/GI-Fachtagung Kommunikation in Verteilten Systemen", EDITOR="N. Gerner and H.-G. Hegering and J. Swoboda", SERIES="Informatik aktuell", ISBN="3-540-56482-9", PUBLISHER="Springer-Verlag", ADDRESS="München", PAGES="560-573", YEAR=1993, ABSTRACT="Herkömmliche Implementierungen von OSI-Protokollen orientieren sich an der Schichteneinteilung des OSI-Referenzmodells. Dadurch wird die Leistung vor allem in den anwendungsorientierten Schichten durch die Kommunikation zwischen den Schichten beeinträchtigt. Der vorliegende Artikel beschreibt, wie durch eine Integration benachbarter Protokollschichten sowohl Nachrichtenaustausch als auch Zustandswechsel eingespart werden können. Erste Erfahrungen mit einer integrierten Implementierung der Darstellungs- und Kommunikationssteuerungsschicht liegen bereits vor und ergeben signifikante Geschwindigkeitssteigerungen.", } @TECHREPORT{Hofm93:Efficient, AUTHOR="Bernd Hofmann and W. Effelsberg", TITLE="Efficient Implementation of Estelle Specifications", INSTITUTION="Praktische Informatik IV, Universität Mannheim", NUMBER="TR-93-003", YEAR=1993, ABSTRACT="Efficient implementation of communication software is of critical importance for high-speed networks. We analyze performance bottlenecks in existing implementations and propose two techniques for improvements: The first exploits parallelism not only in the actions of the FSMs, but also in the runtime system of the protocol stack. The second integrates adjacent layers leading to considerable savings in inter-layer interface handling and in the number of transitions occurring in the FSMs. Both techniques are discussed in the context of OSI upper layers, and are based on protocol specification in Estelle.", URL="ftp://pi4.informatik.uni-mannheim.de/pub/techreports/tr-93-003.ps.gz", } @TECHREPORT{Lamp93:Adaptable, AUTHOR="B. Lamparter and Otto Böhrer and W. Effelsberg and Volker Turau", TITLE="Adaptable Forward Error Correction for Multimedia Data Streams", INSTITUTION="Praktische Informatik IV, Universität Mannheim", NUMBER="TR-93-009", YEAR=1993, ABSTRACT="The error handling method in traditional communication protocols is error detection and retransmission. This method is inappropriate for distributed multimedia systems for two reasons: It introduces variable delay unacceptable for isochronous streams, and it is very inefficient and difficult to use in the multicast environment typical for many multimedia applications. We propose AdFEC, an adaptable Forward Error Correction scheme based on binary polynomial algebra. It produces an adaptable amount of redundancy allowing different packet types to be protected according to their importance. The scheme was implemented in the framework of the XMovie project and proved to be very efficient.", URL="ftp://pi4.informatik.uni-mannheim.de/pub/techreports/tr-93-009.ps.gz", } @ARTICLE{Amen9301:Proactive, AUTHOR="John-Thones Amenyo and Aurel A. Lazar and G. Pacifici", TITLE="Proactive Cooperative Scheduling and Buffer Management for Multimedia Networks", JOURNAL="Jornal on Multimedia Systems", VOLUME=1, NUMBER=1, NOTE="to appear", YEAR=1993, } @INPROCEEDINGS{Katz93:RAID, AUTHOR="Randy H. Katz and Pi-Chun Chen and A. L. Drapeau and E. Lee and K. A. Lutz and Ethan L. Miller and S. Seshan and D. A. Patterson", TITLE="{RAID-II:} Design and Implementation of a Large Scale Disk Array Controller", BOOKTITLE=vlsisys, YEAR=1993, URL="ftp://ftp.cs.berkeley.edu/ucb/raid/papers/vlsisys93.ps.Z", } @INPROCEEDINGS{Chen93:Performance, AUTHOR="Pi-Chun Chen and E. Lee and A. L. Drapeau and K. A. Lutz and Ethan L. Miller and S. Seshan and Ken W. Shirriff and D. A. Patterson", TITLE="Performance and Design Evaluation of the {RAID-II} Storage Server", BOOKTITLE="International Parallel Processing Symposium Workshop on I/O in Parallel Computer Systems", NOTE="invited for submission to the Journal of Distributed and Parallel Databases", YEAR=1993, URL="ftp://ftp.cs.berkeley.edu/ucb/raid/papers/ipps93.ps.Z", } @TECHREPORT{Chen93:Striping, AUTHOR="Pi-Chun Chen and E. Lee", TITLE="Striping in a {RAID} Level 5 Disk Array", INSTITUTION="University of Michigan", NUMBER="CSE-TR-181-93", YEAR=1993, URL="ftp://ftp.cs.berkeley.edu/ucb/raid/papers/raid5stripe.ps.Z", } @TECHREPORT{Chen93:RAID, AUTHOR="Pi-Chun Chen and E. Lee and G. A. Gibson and Randy H. Katz and D. A. Patterson", TITLE="{RAID:} High-Performance, Reliable Secondary Storage", INSTITUTION="University of California at Berkeley", NUMBER="UCB/CSD-93-778", NOTE="Invited for submission to ACM Computing Surveys", YEAR=1993, URL="ftp://ftp.cs.berkeley.edu/ucb/raid/papers/tech93\_778.ps.Z", } @ARTICLE{Siba93:Comparison, AUTHOR="F. N. Sibai and N. K. Sharma and A. A. Abonamah", TITLE="Comparison of Reconfiguration Schemes for the {C2SC} {MIN} Operating in the Broadcast Mode", JOURNAL=ieeetc, VOLUME=42, NUMBER=1993, YEAR=1993, ABSTRACT="The complementary two-stage cube (C2SC) provides four paths between every source and destination pair so that all single faults and many multiple faults can be tolerated. One of the key issues in multiple-path multistage interconnection networks (MIN's) is the manner in which rerouting is achieved when the network has faults. In this correspondence, we present four reconfiguration schemes for broadcast connections of the C2SC in the presence of one or multiple faults, and these are: destination discriminator, divide and broadcast, decoded routing tag, and conservative schemes. A hardware implementation and a cost/performance analysis of the four schemes were carried out. The analysis includes comparison of hardware cost, reconfiguration time, cost-reconfiguration time product, and regularity and modularity. The cost/performance analysis and simulation results indicate that the destination discriminator scheme has the lowest cost-reconfiguration time product and has relatively high regularity and modularity.", } @ARTICLE{Olso93:Probabilistic, AUTHOR="Alan Olson and Kang G. Shin", TITLE="Probabilistic Clock Synchronization in Large Distributed Systems", JOURNAL=ieeetc, VOLUME=42, NUMBER=1993, YEAR=1993, ABSTRACT="Clock synchronization within a distributed system is a problem that has been studied extensively in recent years. Of the many solutions proposed thus far, probabilistic synchronization algorithms provide arguably the best compromise between tightness of synchronization and overhead imposed on the system. The main drawbacks of probabilistic algorithms are the requirement of a master/slave organization of clocks, and the relatively high number of synchronization messages that must be sent. These two drawbacks can make them unsuitable for use in large distributed systems. In this paper we propose a synchronization algorithm that does not use master/slave clocks and reduces the number of synchronization messages needed. The nodes of the system are divided into a number of overlapping groups. Within a group, each node uses one of two probabilistic techniques to estimate the values of other clocks in the group, and uses an interactive convergence algorithm on the resulting estimates to adjust its local clock. Groups are selected so that the maximum skew between any two group members is bounded.", } @ARTICLE{Vin9301:Collaboration, AUTHOR="Harrick Vin and M.-S. Chen and T. P. Barzilai", TITLE="Collaboration Management in {DiCE}", JOURNAL="Computer Journal", VOLUME=36, PAGES="87-96", YEAR=1993, KEYWORDS="computer-supported cooperative work; teleconferencing; conference control", ABSTRACT="Effectiveness of managing collaborations directly impacts the productivy of a group, and can be significantly improved through computer supported tools made available by the advent of high speed networks and multimedia computer systems. In this paper, we propose a framework for characterizing the requirements of person-to-person (e.g. telephony), person-to-service (e.g. collaboration with software agents), and service-to-service collabatrations (e.g. business workflow applications). The framework defines a hierarchy of three application, at the lowest level of which are conferecnces which characterize the accessrights of participants involved in a collaborative endeavor. The higher two level are activities, which represents a collection of semantically related conferences, and collaborations, which represents a temporally orders sequences of activities. We describes the machnisms for establishing and controling the progrss of a wide variety of multimedia collaborations. The framework for modeling collaborations and mechanisms for their instanciation decribed in this paper form the basis of DiCE - a distributed collaborative environment being developed at the IBM T. J. Watson Research Center.", } @ARTICLE{Tang93:Why, AUTHOR="John C. Tang and Ellen A. Isaacs", TITLE="Why do users like video? Studies of multimedia-supported collaboration", JOURNAL="Computer Supported Cooperative Work (CSCW)", PUBLISHER="Kluwer Academic Publishers", VOLUME=1, PAGES="163-196", NOTE="Sun TR-92-5", YEAR=1993, REFERENCES=32, KEYWORDS="desktop conferencing; remote collaboration; use studies; video conferencing; computer supported cooperative work; multimedia", ABSTRACT="Three studies of collaborative activity were conducted as part of research in developing multimedia technology to support collaboration. One study surveyed users' opinions of their use of video conference rooms. Users indicated that the availability of the video conference rooms was too limited, audio quality needed improvement, and a shared drawing space was needed. A second study analyzed videotapes of a work group when meeting face-to-face, video conferencing, and phone conferencing. The analyses found that the noticeable audio delay in video conferencing made it difficult for the participants to manage turn-taking and coordinate eye glances. In the third study, a distributed team was observed under three conditions: using their existing collaboration tools, adding a desktop conferencing prototype (audio, video, and shared drawing tool), and subtracting the video capability from the prototype. Qualitative and quantitative data were collected by videotaping the face-to-face meetings, and desktop conferencing. The team's use of the desktop conferencing prototype dropped significantly when the video capability was removed. Analysis of the videotape data showed how the video channel was used to help mediate their interaction and convey visual information. Desktop conferencing apparently reduced email usage and was perceived to reduce the number of shorter, two-person, face-to-face meetings.", URL="http://www.sun.com/cgi-bin/show?tech/projects/coco/papers/dvc-CSCWJ.html", } @INPROCEEDINGS{Low9303:Burstiness, AUTHOR="Stephen H. Low and P. Varaiya", TITLE="Burstiness bounds for some burst reducing servers", BOOKTITLE=infocom, ADDRESS="San Francisco, California", PAGES="2-9", MONTH="March/April", YEAR=1993, KEYWORDS="traffic characterization", ABSTRACT="We proposed earlier a framework to study a stream of traffic or message as it is transferred over an ATM connection. A message is modeled as a deterministic fluid flow, and an ATM node is modeled as a server which allocates bandwidth among concurrent messages. The key concept is that of the burstiness curve $b(\mu)$ of an incoming message which gives the buffer size needed if the message is served at rate $\mu$. It is shown there that the fixed rate, the leaky bucket, and the affine server are burst reducing. This paper presents the burstiness bound for each of these servers. We also relate a sequence of identical affine servers to a fixed rate server, and suggest how `quality of service' parameters may usefully be based on the burstiness curve.", } @INPROCEEDINGS{Low9303:Dynamic, AUTHOR="Stephen H. Low and P. Varaiya", TITLE="Dynamic Behavior of a class of adaptive routing protocols {(IGRP)}", BOOKTITLE=infocom, PAGES="610-616", MONTH="March/April", YEAR=1993, KEYWORDS="routing; IGRP; ring network", ABSTRACT="We perform an exact analysis of the dynamic behavior of IGRP, an adaptive shortest-path routing algorithm widely used in the industry, on a simple ring network. The distance metric is a weighted sum of traffic-sensitive and traffic-insensitive delay components. We relate the optimality and stability of the protocol to the ratio of the weights. In particular, we show that if the traffic-insensitive component is not given enough weight, then starting from any initial routing, the subsequent routings after finitely many update periods will oscillate between two worst cases. Otherwise, the successive routings will converge to the unique equilibrium routing. We also show that load sharing among routes whose distances are within a threshold of the minimum distance help stabilize the dynamic behavior.", } @ARTICLE{Scho93:Impact, AUTHOR="Eve Schooler", TITLE="The impact of scaling on a multimedia connection architecture", JOURNAL=mms, VOLUME=1, NUMBER=1, PAGES="2-9", NOTE="Also ISI reprint ISI/RS-93-360", YEAR=1993, URL="ftp://ftp.isi.edu/pub/hpcc-papers/mmc/jms.ps", } @BOOK{Veld93:Introduction, AUTHOR="Raymond Veldhuis and Marcel Breeuwer", TITLE="An introduction to source coding", ISBN="0-13-489089-2", PUBLISHER="Prentice Hall International", ADDRESS="Hertfordshire, England", YEAR=1993, KEYWORDS="signal processing; coding theory; speech coding; video coding; DPCM; subband coding; source coding; pyramidal coding", } @INPROCEEDINGS{Clark9304:Multiprotocol, AUTHOR="Russell J. Clark and Mahmoud Ammar and Ken Calvert", TITLE="Multi-Protocol Architectures as a Paradigm for Achieving Inter-Operability", BOOKTITLE=infocom, ORGANIZATION="IEEE", PAGES="136-143", MONTH="March/April", YEAR=1993, KEYWORDS="interoperability; multiprotocol architectures; protocols; standards", ABSTRACT="A significant obstacle to achieving heterogeneous system interconnection is the need to maintain compatible network protocols on all communicating systems. Protocol standardization and profiling has long been viewed as a way to overcome this obstacle. The exclusive nature of this approach, however, presents limitations such as the exclusion of sometimes superior technology and the necessity for strict agreement among systems. In this paper we consider an inclusive approach to achieving inter-operability based on the use of multi-protocol architectures. We begin with a detailed description of a framework and model for describing and constructing multi-protocol architectures. We then describe a case study based on architectures that mix protocols from the OSI and Internet suites. We identify and propose solutions to the problem of determining which set of protocols to use for a particular communication task.", URL="file://ftp.cc.gatech.edu//pub/coc/tech\_reports/1992/GIT-CC-92-36.ps.Z", } @MANUAL{Micr93:DVI, AUTHOR="Microsoft", TITLE="{DVI} {ADPCM} wave type", ORGANIZATION="Microsoft", NOTE="Microsoft Development Library -- SDKs: Multimedia Standards Update", YEAR=1993, } @BOOK{Mull93:Distributed, TITLE="Distributed Systems", EDITOR="Sape Mullender", ISBN="0-201-62437-3", PUBLISHER="Addison-Wesley", ADDRESS="Wokingham, England", YEAR=1993, KEYWORDS="distributed systems; operating systems; RPC", } @INPROCEEDINGS{Claf9303:Traffic, AUTHOR="Kimberly Claffy and Hans-Werner Brauh and George C. Polyzos", TITLE="Traffic Characteristics of the {T1} {NSFNET} Backbone", BOOKTITLE=infocom, ADDRESS="San Francisco, California", NOTE="UCSD Report CS92-237 and SDSC Report GA-A21019", MONTH="March/April", YEAR=1993, KEYWORDS="Internet; traffic characterization", URL="ftp://ftp.sdsc.edu/pub/sdsc/anr/papers/nsfnet-t1-stats.ps.Z", } @INPROCEEDINGS{Glic9308:SHAREd, AUTHOR="J. Glicksman and V. Kumar", TITLE="A {SHAREd} Collaborative Environment for Mechanical Engineers", BOOKTITLE="Groupware", PAGES="335-447", YEAR=1993, REFERENCES=15, KEYWORDS="CSCW; WWW; teleteaching; mechanical engineering; collaboration; electronic mail; MIME; shared X", ABSTRACT="Much of the engineering task involves capturing and manipulating information. Today this is done in a variety of ways: paper reports, computer programs, letters, telephone conversations, email, face-to-face meetings, etc. Much of the information generated that should be captured and preserved is not. The SHARE project is building tools to provide computer-based collaboration to assist in the engineering process and specifically to capture and manipulate the information that is generated during that process. What distinguishes SHARE from other groupware projects is the emphasis on the mechanical engineering domain. Although the tools we are developing are generic, the specific requirements of our domain strongly influence many aspects of the design. Since mechanical engineers already do much of their work on computers it is essential that our tools are well integrated with their existing computational environment.", URL="http://www.eit.com/projects/share/share/paper.ps", } @ARTICLE{Ditt93:DQDB, AUTHOR="R. Dittman and T. Stock and P. Tran-Gia", TITLE="Das {DQDB-Zugriffsprotokoll} in Hochgeschwindigkeitsnetzen und der {IEEE-Standard} 802.6: Ein Überblick", JOURNAL=infspec, VOLUME=16, PAGES="143-158", YEAR=1993, REFERENCES=58, KEYWORDS="High-speed LAN and MAN access schemes; LAN; MAN; Protocols; DQDB; Modeling; Performance analysis", ABSTRACT="High-speed local and metropolitan area networks (HSLAN, HSMAN) based on optical fibers and the corresponding access protocols are under intensive discussion in the field of telecommunication technology. Among the proposed protocols, the DQDB system (Distributed Queue Dual Bus) has a good chance of gaining wide acceptance in the near future. The objective of this paper is to provide an overview of this protocol. A short outline of the architectural system requirements is followed by a description of the underlying principles on which the DQDB access mechanism is based. Various phases in the evolution of the IEEE standard 802.6 are discussed and some analytical approaches to the study of system performance are adressed. Several performance measures are then presented. Finally, some modifications and extensions to the standerd and their potential use in other system architectures are described.", } @ARTICLE{Rzeh9302:Zur, AUTHOR="H. Rzehak", TITLE="Zur Diskussion gestellt: Der Beitrag von Frau Zitterbart auf der {KiVS} 93: ``Application-Driven Flexible Protocol Configuration''", JOURNAL=pik, VOLUME=16, NUMBER=2, PAGES="106-107", YEAR=1993, REFERENCES=12, KEYWORDS="KiVS; Protocols; Distributed Systems", } @ARTICLE{Abec9303:SNMPv2, AUTHOR="Sebastian Abeck", TITLE="{SNMPv2}", JOURNAL=pik, VOLUME=16, NUMBER=3, PAGES="172-173", YEAR=1993, REFERENCES=3, KEYWORDS="Protocols; Management; SNMP; SNMPv2", ABSTRACT="Das Protokoll SNMP (Simple Network Management Protocol) und das darauf basierende SNMP-Management haben sich in den letzten Jahren zu einem De-facto-Standard für Management in lokalen Netzen entwickelt. Die vor allem bei den Entwicklern von Managementsoftware geschätzten Vorzüge des SNMP-Managements sind seine Einfachheit und Implementierungsfreundlichkeit. Im praktischen Einsatz zeigte sich allerdings, daß das SNMP-Management neben seinen Vorteilen an verschiedenen Stellen extreme Lücken aufweist; Beispiele sind die mangelnden Sicherheitsma{ß}nahmen oder die negative Eigenschaft des Management-Protokolls, gro{ß}e Datenmengen nicht effizient übertragen zu können. Um diese Schwächen zu beseitigen, wurde das bestehende SNMP-Framework durch eine ``zweite Version'', das Simple Network Management Protocol version 2, kurz SNMPv2, ersetzt. Das SNMPv2-Framework liegt seit April dieses Jahres in insgesamt 11 ``Requests for Comments'' vor und umfa{ß}t mehrere hundert Seiten (RFC 1441 bis RFC 1452). Abb. 1 stellt die Verbesserungen von SNMPv2 gegenüber dem alten, jetzt SNMPv1 genannten, Framework im Überblick dar. Wir gehen in den folgenden Abschnitten auf jeden dieser Punkte kurz ein. Abschlie{ß}end werden die ersten Erfahrungen, die mit den neuen Konzepten gesammelt wurden, beschrieben.", } @ARTICLE{Fan9304:Leistungsvergleich, AUTHOR="Changxin Fan and T. Luckenbach", TITLE="Leistungsvergleich von {TCP/IP} und {XTP} im {BERKOM} {Breitband-ISDN} Testnetz", JOURNAL=pik, VOLUME=16, NUMBER=4, PAGES="209-213", YEAR=1993, REFERENCES=9, KEYWORDS="XTP; TCP/IP; High-speed Networks; lightweight protocols; Transport protocols; Broadband-ISDN; BISDN", ABSTRACT="Die Entwicklung neuer Protokolle mit Mechanismen und Funktionalitäten, die expliziet für Hochgeschwindigkeitsnetze und multimediale Anwendungen entworfen werden, ist inzwischen ein wichtiges Thema im Bereich der verteilten, offenen Kommunikationssysteme. Das Xpress Transfer Protocol (XTP) ist ein typisches Beispiel eines solchen, sogenannten ``leichtgewichtigen'' Protokolls (engl.: lightweight protocol), das in den letzten Jahren entwickelt wurde. Eine vorhandene Softwareimplementierung des XTP-Protokolls wurde bei FOKUS untersucht und für den Einsatz im BERKOM-Testnetz (BERliner KOMmunikationssystem) angepa{ß}t und getestet. Eine Leistungsanalyse der XTP-Implementierung im BERKOM-Testnetz wurde durchgeführt und mit entsprechenden Werten einer Standard-TCP/IP-Implementierung (TCP = Transmission Control Protocol, IP = Internet Protocol) verglichen. Dabei wurde festgestellt, da{ß} die derzeitige Leistungsfähigkeit von XTP der von TCP/IP entspricht und diese unter Umständen übersteigen kann.", } @ARTICLE{Hein9301:Kommunikationsdienste, AUTHOR="Bernd Heinrichs and K. Jakobs and K. Lenßen and W. Reinhardt and A. Spinner and F. Williams", TITLE="Kommunikationsdienste für Multimedia-Anwendungen (Das {RACE} {II} Projekt EuroBridge)", JOURNAL=pik, VOLUME=16, NUMBER=1, PAGES="44-45", YEAR=1993, REFERENCES=2, KEYWORDS="Kommunikationsdienste; Multimedia; EuroBridge", } @INPROCEEDINGS{Sang9303:Experimental, AUTHOR="D. Sanghi and A. K. Agrawala and O. Gudmundson and B. N. Jain", TITLE="Experimental Assessment of End-to-End Behavior on {Internet}", BOOKTITLE=infocom, ADDRESS="San Francisco, California", PAGES="867-874 (7d.2)", MONTH="March/April", YEAR=1993, KEYWORDS="Internet; traffic measurements; delay; jitter", ABSTRACT="Over the last decade Internet has grown by orders of magnitude in size. Many of the protocols that were designed several years ago are still in use. It is not clear if the assumptions made in the design of control schemes still hold, particularly when we consider end-to-end behavior of paths in the network, today. This paper describes a simple experiment designed to capture end-to-end behavior of the Internet. The measurements indicate that the IP level service provided in the ntwork yields high losses, duplicates and reorderings of packets. In addition, the round-trip transit delay varies significantly. These measurements indicate that the network may have several problems which still need to be analyzed in order to improve the efficiency of protocols and control mechanisms that is uses.", } @INPROCEEDINGS{Sait93:CDV, AUTHOR="H. Saito", TITLE="{CDV} and bandwidth management in {ATM} networks", BOOKTITLE="MICC", ORGANIZATION="IEEE Malaysia", ADDRESS="Kuala Lumpur, Malaysia", YEAR=1993, KEYWORDS="Traffic control; ATM; BISDN; queueing theory; cell delay variation; CDV; resource management; CAC", } @INPROCEEDINGS{Chak93:ATM, AUTHOR="S. Chaki and H. Saito and K. Miyake and Hiroyuki Ohnishi", TITLE="{ATM} network for high-speed data communication", BOOKTITLE="SICON/ICIE", ADDRESS="Singapore", YEAR=1993, KEYWORDS="Traffic control; ATM; BISDN; queueing theory; congestion control; BECN; EFCI; congestion notification; high-speed data communication", } @INPROCEEDINGS{Aida93:Traffic, AUTHOR="M. Aida and H. Saito", TITLE="Traffic contract parameters and {CAC} guaranteeing cell loss ratio in {ATM} networks", BOOKTITLE="Asia-Pacific symposium in information and telecommunication technologies (APSITT)", ADDRESS="Bangkok", YEAR=1993, KEYWORDS="Traffic control; ATM; BISDN; queueing theory; source traffic descriptor; connection admission control; CAC", } @INPROCEEDINGS{Sait93:Future, AUTHOR="H. Saito", TITLE="Toward a future dimensioning method: Non-parametric approach", BOOKTITLE="IEICE Transactions B-I", ORGANIZATION="IEICE", PAGES="0197-0208", YEAR=1993, KEYWORDS="Traffic control; ATM; BISDN; queueing theory; CAC; non-parametric approach", } @INPROCEEDINGS{Rous9303:Optimization, AUTHOR="George Rouskas and Mahmoud Ammar", TITLE="Analysis and Optimization of Transmission Schedules for Single-Hop {WDM} Networks", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", PAGES="1342-1349", MONTH="March/April", YEAR=1993, ABSTRACT="We consider single-hop lightwave networks with stations interconnected using Wavelength Division Multiplexing. The stations are equipped with tunable transmitters and/or receivers. Coordination between the transmitting and receiving stations is achieved by assuming synchronous control and a predefined, frequency-time oriented schedule which specifies the slots and the wavelengths on which communication between any two pairs of stations is allowed to take place. We define and analyze, in terms of throughput, all possible types of schedules in the situation where the number of available wavelengths is equal to the number of stations. Our results are valid for the general case, i.e., non-uniform traffic. We then consider the optimization of schedules given the traffic requirements and present optimization heuristics that give near-optimal results.", URL="http://www.csc.ncsu.edu/departmental/faculty/G\_Rouskas/WWW/Ar0ra/Conferences/INFOCOM93.ps.Z", } @ARTICLE{Bolo9303:Characterizing, AUTHOR="J. C. Bolot", TITLE="Characterizing End-to-end packet delay and loss in the {Internet}", JOURNAL=jhsn, VOLUME=2, NUMBER=3, PAGES="305-323", YEAR=1993, REFERENCES=29, KEYWORDS="measurements; internet traffic characterization; packet Delay and Loss", ABSTRACT="We use the measured round trip delays of small UDP probe packets sent at regular time intervals to characterize the end-to-end packet delay and loss behaviour in the Internet. By varying the interval between probe packets, it is possible to study the structure of the Internet load over different time scales. In this paper, the time scales of interest range from a few milliseconds to a few minutes. Our observation agree with results obtained by others using simulation and experimental approaches. For example, our estimates of Internet work load are consistent with the hypothesis of a mix of bulk traffic with larger packet size, and interactive traffic with sampler packet size. The interarrival time distribution for Internet packets is consistent with an exponential distribution. We also observe a phenomenon of compression -or clustering- of the probe packets similar to the acknowledgement compression phenomenon recently observed in TCP. Our results also show interesting and less expected behaviour. For example, we find that losses of probe packets are essentially random when the probe traffic uses a small fraction of the available bandwidth.", } @ARTICLE{Asth9304:Gigabit, AUTHOR="Abhaya Asthana and Catherine Delph and H. V. Jagadish and Paul Krzyzanowski", TITLE="Towards a gigabit {IP} router", JOURNAL=jhsn, VOLUME=1, NUMBER=4, PAGES="281-288", YEAR=1993, REFERENCES=9, KEYWORDS="multiprocessor; network protocol; internet routing; intelligent memory; high performance communication", ABSTRACT="In this paper we illustrate the application of SWIM's Active Storage Element -ASE- module in constructing high performance IP routers. The logic associated with each ASE is a wide-instruction-word micro-programmable engine, that has been specially designed to efficiently perform operations such as pointer dereferencing, memory indirection, bounds checking, and so forth. This makes it well suited to performing operations such as parsing of the IP header, routing table lookup, checksum computation and exception processing. Our results show that a single ASE running at 20 MHz can process 400,000 packets per second: well over that required to sustain a gigabit router. Multiple ASEs can be used in parallel to achieve even higher processing rates.", } @INPROCEEDINGS{Giro93:Spatial, AUTHOR="B. Girod and Uwe Horn and Yuan Xiancheng", TITLE="Spatial shaping: A Fully compatible improvement of {DCT} Coding", BOOKTITLE="Picture Coding Symposium", ADDRESS="Lausanne, Switzerland", YEAR=1993, KEYWORDS="DCT; spatial coding", } @ARTICLE{Ayan9303:Improvements, AUTHOR="Ender Ayanoglu and R. D. Gitlin and Nihat C. Oguz", TITLE="Performance improvements in broadband networks using forward error correction for load packet recovery", JOURNAL=jhsn, VOLUME=2, NUMBER=3, PAGES="287-303", YEAR=1993, REFERENCES=10, KEYWORDS="ARQ; FEC; B-ISDN; ATM; packet loss; erasure; protocols", ABSTRACT="In this paper we analyze and provide simulation results for the use of forward error control -FEC- to improve the delay-throughput performance of packetized highspeed networks. The major source of errors in high-speed networks is expected to be buffer overflow during congested conditions, resulting in lost packets. A single lost or errored packet will have to be retransmitted, or may even cause the window it belongs to to be retransmitted, causing a large delay. In high-speed networks, as in satellite and deep-space systems, the effect of retransmission delays is greatly amplified by the small ratio of packet duration to propagation delay Consequently, the performance of delay sensitive applications, such as distributed processing, will be degraded by the retransmissions associated with the conventional error detection and retransmission -ARQ- protocols. FEC can be used to make the performance of the end-to-end system much less sensitive to packet loss. The result is a significant increase in network throughput and an associated decrease in delay, since retransmissions are avoided. Also, reliable transmission might permit simpler higher-layer processing. Because of the performance gains described above, the use of FEC is a strong candidate for inclusion in high-speed network protocols for delay and loss sensitive applications.", } @TECHREPORT{Lao93:Heterogeneous, AUTHOR="Allen Y. Lao", TITLE="Heterogeneous Cell-Relay Network Simulation and Performance Analysis with {PTOLEMY}", INSTITUTION="Electronics Research Laboratory, UC Berkeley", NUMBER="UCB/ERL M94/8", YEAR=1993, KEYWORDS="Ptolemy; discrete event schedulers; synchronous event schedulers; heterogeneous environments", ABSTRACT="Ptolemy is a platform which allows the modelling and simulation of communication networks, signal processing, and various other applications. Its unique set of internal object oriented interfaces allows it to merge heterogeneous descriptions of distinct system components into a unified simulation. This report concerns itself with asynchronous transfer mode, cell relay network simulation and shows how the combination of three different domains -modes of system description- lends itself very well to this type of experiment: a synchronous dataflow -SDF- domain, a discrete-event -DE- domain, and a message queue domain -MQ-. The work presented follows on the the details of a backbone network simulation described in [4]. It is not the goal of this report to focus on network layer management and related issues: instead, it focuses on modelling techniques and performance evaluation of various popular, practical queueing disciplines for space devision packet switches. Ptolemy's naturalness for the simulation of such a heterogeneous environment will be demonstrated as well as its usefulness for analyzing network behaviour and performance.", } @BOOK{Juli93:ToolTalk, AUTHOR="Astrid M. Julienne and Brian Holtz", TITLE="ToolTalk and Open Protocols", ISBN="0-13-031055-7", PUBLISHER="SunSoft Press/Prentice Hall", ADDRESS="Mountain View", YEAR=1993, KEYWORDS="ToolTalk; messaging; API", } @BOOK{Moul93:GSM, AUTHOR="M. Mouly and M.-B. Pautet", TITLE="The {GSM} system for mobile communications", ISBN="2-9507190-0-7", PUBLISHER="Europe Media Duplication", ADDRESS="Lassay-les-Chateaux, France", PAGES=701, YEAR=1993, KEYWORDS="GSM; mobile communication; audio coding", } @MASTERSTHESIS{Hoff93:Xy, AUTHOR="Gero Hoffmann", TITLE="Xy: Unterstützung von Telekooperation und Mobilität im X Window System", EDITOR="Sigram Schindler", TYPE="Studienarbeit", SCHOOL="Technische Universität Berlin", ADDRESS="Berlin, Germany", YEAR=1993, LANGUAGE="German", KEYWORDS="Xy; X application sharing tools", URL="http://www.prz.tu-berlin.de/docs/Publications/TUB-PRZ-W-1093.ps", } @BOOK{Mill93:Managing, AUTHOR="Mickey Miller", TITLE="Managing Internetowrks with {SNMP}", PUBLISHER="M\\&T Books", YEAR=1993, } @BOOK{Sari93:Principles, AUTHOR="B. Sarikaya", TITLE="Principles of Protocol Engineering and conformance testing", PUBLISHER="Ellis Horwood Limited", ADDRESS="London, England", YEAR=1993, } @BOOK{Reed93:Programming, TITLE="Specification and Programming Environment for Communication Software {(SPECS)}", EDITOR="R. Reed and W. Bouma and McPherson J.", PUBLISHER="North-Holland", NOTE="p.~141--175", YEAR=1993, } @INPROCEEDINGS{Vuon93:TESTGEN, AUTHOR="Son Vuong and others", TITLE="{TESTGEN+} An Integrated Environment for Protocol Test Suite Generation, Selection and Validation", BOOKTITLE="FORTE VI", PAGES="319-334", YEAR=1993, } @PROCEEDINGS{93:Protocol, TITLE="Protocol Test Systems, V", BOOKTITLE="{Protocol Test Systems, V}", EDITOR="Gregor V. Bochmann and R. Dssouli and A. Das", PUBLISHER="IFIP North-Holland", YEAR=1993, } @PROCEEDINGS{Rafi93:6th, TITLE="6th {IFIP} {WG6.1} Intern. Workshop on Protocol Test Systems, Pau, France", BOOKTITLE="6th IFIP WG6.1 Intern. Workshop on Protocol Test Systems, Pau, France", EDITOR="O. Rafiq", YEAR=1993, } @MANUAL{93:Recommendation, TITLE="Recommendation {Z.120:} Message Sequence Charts {(MSC)}", ORGANIZATION="International Telecommunication Union ITU-T", ADDRESS="Geneva, Switzerland", YEAR=1993, } @BOOK{Kane93:Testing, AUTHOR="C. Kaner and J. Falk and H. Q. Nguyen", TITLE="Testing Computer Software, Second Edition", SERIES="VNR Computer Library", PUBLISHER="Van Nostrand Reinhold, New York", YEAR=1993, } @PROCEEDINGS{Dant93:13th, TITLE="13th Intern. Symposium on Protocol Specification, Testing and Verification, Li\`ege, Belgium", BOOKTITLE="13th Intern. Symposium on Protocol Specification, Testing and Verification, Li{\`e}ge, Belgium", EDITOR="A. Danthine and G. Leduc and P. Wolper", SERIES="IFIP Transactions", PUBLISHER="North-Holland", YEAR=1993, } @MISC{SDT93:Manuals, AUTHOR="S. D. T", TITLE="Manuals Version 1.15", HOWPUBLISHED="TeleLOGIC Malmoe AB", YEAR=1993, } @INPROCEEDINGS{Robl93:Derivation, AUTHOR="T. Robles and others", TITLE="Specification and Derivation of {OSI} Conformance Test Suites", BOOKTITLE="Protocol Test Systems, V", PUBLISHER="North Holland", YEAR=1993, } @INPROCEEDINGS{Cava93:Formal, AUTHOR="A. R. Cavalli", TITLE="Formal Methods for Conformance Testing: Results and Perspectives", BOOKTITLE="6th IFIP WG6.1 Intern. Workshop on Protocol Test Systems, Pau, France", EDITOR="O. Rafiq and O. Rafiq", PAGES="3-20", YEAR=1993, } @INPROCEEDINGS{Luo93:Generating, AUTHOR="G. Luo and R. Dssouli and G. v.Bochmann", TITLE="Generating Synchronizable Test Sequences Based on Finite State Machines with Distributed Ports", BOOKTITLE="6th IFIP WG6.1 Intern. Workshop on Protocol Test Systems, Pau, France", EDITOR="O. Rafiq", PAGES="143-158", YEAR=1993, } @INPROCEEDINGS{Cast93:Deriving, AUTHOR="R. Castanet and O. Kon'e", TITLE="Deriving Coordinated Testers for Interoperability", BOOKTITLE="6th IFIP WG6.1 Intern. Workshop on Protocol Test Systems, Pau, France", EDITOR="O. Rafiq", PAGES="335-348", YEAR=1993, } @INPROCEEDINGS{Phal93:Executable, AUTHOR="M. Phalippou", TITLE="Executable Testers", BOOKTITLE="6th IFIP WG6.1 Intern. Workshop on Protocol Test Systems, Pau, France", EDITOR="O. Rafiq", PAGES="37-52", YEAR=1993, } @INPROCEEDINGS{Vuo93:Framework, AUTHOR="S. T. Vuo and a.A. F. Loureira and S. T. Chanson", TITLE="Toward a Framework for the Design for Testabiliy of Communication Protocols", BOOKTITLE="6th IFIP WG6.1 Intern. Workshop on Protocol Test Systems, Pau, France", EDITOR="O. Rafiq", PAGES="91-112", YEAR=1993, } @INPROCEEDINGS{Bark93:Automated, AUTHOR="Roger Barker and F. Brady", TITLE="Automated Generation of Test Purposes for the {OSI} Distributed Transaction Processing Control", BOOKTITLE="13th Intern. Symposium on Protocol Specification, Testing and Verification, Li{\`e}ge, Belgium", EDITOR="A. Danthine and G. Leduc and P. Wolper", SERIES="IFIP Transactions", PUBLISHER="North-Holland", PAGES="273-288", YEAR=1993, } @INPROCEEDINGS{Alil93:Metric, AUTHOR="J. Alilovic-Curgus and Son Vuong", TITLE="A Metric Based Theory of Test Selection and Coverage", BOOKTITLE="13th Intern. Symposium on Protocol Specification, Testing and Verification, Li{\`e}ge, Belgium", EDITOR="A. Danthine and G. Leduc and P. Wolper", SERIES="IFIP Transactions", PUBLISHER="North-Holland", PAGES="289-304", YEAR=1993, } @ARTICLE{Alex9305:Precompetitive, AUTHOR="S. Alexander and others", TITLE="A Precompetitive Consortium on Wide-Band All-Optical Networks", JOURNAL=ieeejlt, PAGES="714-735", MONTH="May/June", YEAR=1993, ABSTRACT="This paper represents the technical core of a pre-competitive consortium formed by AT\&T, DEC and MIT to study the technology, architecture and applications of wide-band all-optical networks of local to national (or international) extent. This effort is currently partially sponsored by the Defence Advanced Research Projects Agency (DARPA). Sections I and II of this paper provide a general introduction to all-optical networks and discuss some proposed applications. Sections III, IV and V cover the architecture, technology and test-bed portions of our effort.", URL="http://www.cis.ohio-state.edu/~jain/papers/aon.zip", } @INPROCEEDINGS{Grun93:Study, AUTHOR="Reto Grünenfelder and S. Robert and J.-P. Hubaux and F. Braun", TITLE="A Performance Study of the {Ethernet/DQDB} Interconnection", BOOKTITLE="Interworking in Broadband Networks", EDITOR="S. V. Rao", PUBLISHER="IOS Press", PAGES="378-387", YEAR=1993, KEYWORDS="Ethernet-DQDB interconnection; quality of service", ABSTRACT="In this paper, we present a framework for engineering Ethernet-DQDB interconnections for messaging mode. Very simple relations are developed for evaluating bus access delay and jitter in terms of the DQDB traffic behavior and an upper bound of the probability of loss due to access queue overflow. The performance evaluation shows that DQDB offers the possibility of interconnecting Ethernets with a good quality of service, that means small delay jitter and very rare overflow of the access queue.", } @TECHREPORT{Grea93:ATM, AUTHOR="David Greaves and D. R. McAuley", TITLE="{ATM} Network Services for Workstations", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 93-6", NOTE="Document identification OSI95/B3/Book/v1", YEAR=1993, ABSTRACT="Workpackage 3 of OSI 95 was titled `New Communications Techniques' and was an evaluation of how to make use of the new communications techniques which offer services with a guaranteed quality of service, including ATM and B-ISDN. This document discusses the provision of the ATM networking services to application programs running on general purpose computing equipment which is connected to an ATM network.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.93.6.ps.Z", } @TECHREPORT{Benn93:Low, AUTHOR="Frazer Bennett and Andy Harter", TITLE="Low Bandwidth Infra-Red Networks and Protocols for Mobile Communicating Devices", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 93-5", YEAR=1993, ABSTRACT="This paper is a source of technical reference for the IR network developed at Olivetti Research and in use within Olivetti, Digital, Xerox, Bellcore and elsewhere. The scope is restricted to details of the physical communication medium and formatting of simple data packets over the medium.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.93.5.ps.Z", } @TECHREPORT{Jone93:Handling, AUTHOR="A. E. Jones and Andrew Hopper", TITLE="Handling Audio and Video Streams in a Distributed Environment", TYPE="Technical Report", INSTITUTION="Olivetti Reseach Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 93-4", NOTE="Proceedings of 14th ACM Symposium on Operating System Principles, OSR, Vol 27, No 5, December 1993", YEAR=1993, ABSTRACT="Handling audio and video in a digital environment requires timely delivery of data. This paper describes the principles adopted in the design of the Pandora networked multi-media system. They attempt to give the user the best possible service while dealing with error and overload conditions. Pandora uses a sub-system to handle the multi-media peripherals. It uses transputers and associated Occam code to implement the time critical functions. Stream implementation is based on self-contained segments of data containing information for delivery, synchronisation and error recovery. Decoupling buffers are used to allow concurrent operation of multiple processing elements. Clawback buffers are used to resynchronise streams at their destinations with minimum latency. The system has proved robust in normal use, under overload, and in the presence of errors. It has been in use for a number of years. The principles involved in this design are now being used in the development of two complementary systems. One approach explodes Pandora by having the camera, microphone, speaker and display as independent units linked only by the LAN. The other approach integrates these devices as peripheral cards in a powerful workstation.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.93.4.ps.Z", } @TECHREPORT{Sama93:Face, AUTHOR="Ferdinando Samaria", TITLE="Face Segmentation For Identification Using Hidden Markov Models", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 93-3", NOTE="Proceedings of 4th British Machine Vision Conference, Springer-Verlag, Guilford", YEAR=1993, ABSTRACT="This paper details work done on face processing using a novel approach involving Hidden Markov Models. Experimental results from earlier work indicated that left-to-right models with use of structural information yield better feature extraction than ergodic models. This paper illustrates how these hybrid models can be used to extract facial bands and automatically segment a face image into meaningful regions, showing the benefits of simultaneous use of statistical and structural information. It is shown how the segmented data can be used to identify different subjects. Successful segmentation and identification of face images was obtained, even when facial details (with/without glasses, smiling/non-smiling, open/closed eyes) were varied. Some experiments with a simple left-to-right model are presented to support the plausibility of this approach. Finally, present and future directions of research work using these models are indicated.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.93.3.ps.Z", } @TECHREPORT{Sama93:Automated, AUTHOR="Ferdinando Samaria and Andrew Hopper", TITLE="Automated Face Identification Using Hidden Markov Models", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 93-2", NOTE="Appeared in the Proceedings of the International Conference on Advanced Mechatronics, The Japan Society of Mechanical Engineers, Japan 1993.", YEAR=1993, ABSTRACT="This paper details work done on automatic face identification. A new approach to the problem was proposed involving the use of Hidden Markov Models. Initial experimental results indicated that left-to-right models with use of structural information yielded better feature extraction than ergodic models. In this paper we illustrate how these hybrid models can be used to extract facial bands and classify face images, showing the benefits of simultaneous use of statistical and structural information. Some experimental results obtained with a simple left-to-right model are presented to support the plausibility of this approach. Successful results were obtained using images with homogeneous background. We conclude indicating present and future directions of research work using these models.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.93.2.ps.Z", } @BOOK{Akim93:Teletraffic, AUTHOR="H. Akimaru and K. Kawashima", TITLE="Teletraffic - Theory and Applications", ISBN="3-540-19805-9", PUBLISHER="Springer-Verlag", ADDRESS="London", YEAR=1993, KEYWORDS="queueing theory", } @TECHREPORT{Ande93:SICStus, AUTHOR="J. Andersson and S.-E. Andersson and Kent Boortz and Mats Carlsson and Hans Nilsson and Thomas Sjöland and Johan Widen", TITLE="{SICStus} Prolog User's Manual", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="T93-01", YEAR=1993, ABSTRACT="This manual describes a Prolog system developed at the Swedish Institute of Computer Science. Parts of the system were developed by the project ``Industrialization of {SICStus} Prolog'' in collaboration with Ericsson Telecom AB, NobelTech Systems AB, Infologics AB and Televerket. The system consists of a WAM emulator written in C, a library and runtime system written in C and Prolog and an interpreter and a compiler written in Prolog.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--93-01--SE.ps.Z", } @TECHREPORT{Almg93:SISCtus, AUTHOR="Jonas Almgren and S.-E. Andersson and Mats Carlsson and Lena Flood and S. Haridi and Claes Frisk and Hans Nilsson and Jan Sundberg", TITLE="{SISCtus} Prolog Library Manual", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="T93-02", YEAR=1993, ABSTRACT="Documentation of the {SICStus} Prolog Library", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--93-02--SE.ps.Z", } @TECHREPORT{Palm93:Ett, AUTHOR="Roger Palmersjö", TITLE="Ett grafiskt gränssnitt mot verifikationsverktyg", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="T93-03", YEAR=1993, LANGUAGE="Swedish", ABSTRACT="A prototype uniform graphical interface to verification tools is presented. Tools and data objects are displayed as icons in a working area. Tools can be connected with pipes to provide automatic data flow. The implementation runs in Unix and X-windows. The report describing the implementation is in Swedish, but appendixes concerning use and configuration are in English.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--93-03--SE.ps.Z", } @TECHREPORT{Magn93:Tool, AUTHOR="Nordstroem. Magnus and Paul Pettersson", TITLE="A tool for rapid manual translation", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="T93-04", YEAR=1993, ABSTRACT="There have been several attempts to realize the idea of a fully automatic translation system for text translation to replace human translators. By contrast, little work has been put into building tools to aid human translators. This report describes the ideas behind such a tool. The tool is intended to aid human translators in achieving higher productivity and better quality, by presenting terminological information extracted from previous translations. The report documents the implementation and evaluation of a prototype. The prototype has been demonstrated to and used by professional translators with promising results.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--93-04--SE.ps.Z", } @TECHREPORT{Magn93:Partial, AUTHOR="Peter S. Magnusson", TITLE="Partial Translation", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="T93-05", YEAR=1993, ABSTRACT="Traditional simulation of a target architecture by interpreting object code can be improved by translating the object code to an intermediate format. This approach is called interpretive translation. Despite a substantial performance improvement over traditional interpretation, a large part of the overhead is unnecessary. An alternative approach is block translation, where one or more simulated instructions are translated to directly executable code. This approach has several drawbacks. We discuss the problems with block translation, analyse the overhead of interpretive translation, and describe a hybrid approach-partial translation-that combines the benefits of both approaches. Partial translation implements an intermediate format that supports the addition of run-time generated code whenever appropriate. The perfor- mance limit (slowdown) of interpetive translation is around 15, and real implementations have achieved 20-30. Partial translation will perform considerably better. Finally, we present results from an aggressive implementation of interpretive translation, and results from a proof-of-concept implementation of partial translation.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--93-05--SE.ps.Z", } @TECHREPORT{Falk93:Technical, AUTHOR="Göran Falkman and Jonas Warny", TITLE="Technical Diagnosis of Telecommunication Equipment - An Implementation of a Task specific Problems solving method {(TDFL)} using {GCLA} {II}", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R93-01", YEAR=1993, ABSTRACT="This paper describes an implementation of a small knowledge-based system in GCLA II. GCLA II is perhaps best described as a logical programming language, with some properties usually found among functional languages, and it includes hypothetical and non-monotonic reasoning as integral parts, which makes it easy to handle hypothetical queries, negation and AI-techniques like simulation and planning in a natural way. It also makes implementation of reasoning in knowledge-based systems (KBS) more direct than in Prolog. The application is an already existing KBS that guides a service technician in the task of diagnosing a specific device which is a measuring instrument for testing telecommunications equipment. The method used in the application is a problem solving method called TDFL. The TDFL method is a task specific problem solving method for technical diagnosis that gives strong support for knowledge acquisition. The method is adapted to cope with some features of the application. For example, it gives support for reducing the time required for observations and it handles parts that are not directly testable. This paper describes how to adjust the TDFL method to remedy some errors present in the original version; avoiding unnecessary search of the device and eliminating unnecessary confirmations. Some future extensions to both the TDFL method and the implementation are also presented; allowing the search for more than one fault and the possibility of turning the diagnosis backwards.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--93-01--SE.ps.Z", } @TECHREPORT{Aron93:Implementational, AUTHOR="Martin Aronsson", TITLE="Implementational Issues in {GCLA:} A-Sufficiency and the Definiens Operation", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R93-02", YEAR=1993, ABSTRACT="We present algorithms for computing A-sufficient substitutions and constraint sets together with the definiens operation. These operations are primitive operations in the language GCLA. The paper first defines those primitives, which together form a dual rule to SLD resolution, and then describes the different algorithms and some of their properties together with examples. One of the algorithms shows how a definition can be compiled into a representation holding all possible A-sufficient substitutions/constraint sets together with their corresponding definiens. This representation makes the computation at runtime of a definiens and an A-sufficient substitution/constraint set have the same complexity as the table lookup operation clause/2 in Prolog. The paper also describes the generalisation from unification (sets of equalities) to constraint sets and satisfiability of systems of equalities and inequalities.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--93-02--SE.ps.Z", } @TECHREPORT{Aron93:ImplementationalControl, AUTHOR="Martin Aronsson", TITLE="Implementational Issues in {GCLA:} Compiling Control", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R93-05", YEAR=1993, ABSTRACT="The paper describes the basic implementation of GCLA II's control level. The basis of the implementation is a compiling scheme for transforming inference rules and strategies operating on the object level to an interpreter in Prolog, where the inference rules of the control level are coded inline. This is possible since the operational semantics of the control level is deterministic, i.e. the choice of inference rule to apply on a control level goal is determined solely by the parts of the goal. To handle dynamic clauses, a context list, accessible through some new C-functions linked together with the Prolog system. GCLA I and GCLA II are described shortly, followed by a discussion of a Horn clause representation of inference rules versus functions coding inference rules. Then the transformation of inference rules and strategies is described followed by some examples.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--93-05--SE.ps.Z", } @TECHREPORT{Aron93:Planning, AUTHOR="Martin Aronsson", TITLE="Planning the Construction of a Building", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R93-03", YEAR=1993, ABSTRACT="The paper describes a tool for generating plans for the construction of a building. The application is implemented in GCLA, together with a simple constraint solving system. The main idea is that experiences from other plans are stored in methods; which are a systematic way of grouping activities together as higher level activities that can solve more complex tasks. Activities are entities that perform some action on a model of the real world, called the global state. Activities have preconditions, i.e. starting conditions, some representation of time and resource consumption, and postconditions, i.e. how and what to change in the global state. Scheduling activities amounts to allocating resources and placing the activities in time. The goal of the planning process, i.e what we want the planning process to achieve, is represented by a geometric model of the changed global state, i.e. a design of the specified building that one wants to build. To create plans, the system is divided into two main phases; the choice-of-method phase and the scheduling phase. In the choice-of-method phase suitable methods are chosen based on experience from the past. Such methods already exists in the building industry, although not in an explicit formal representation. Then the scheduling phase allocates resources and places the activities in time by reasoning about the activities' change of the global state. The goal of the planning process is that the objects of the specified design should be produced and represented in the global state. The user can change most of the behaviour of the system by indicating what he wants it to do. He can change activities, their preconditions, calculations and postconditions, he can change methods, or add or remove activities to them, he can change resources etc. By this flexibility, the user can form his system to reflect his own preferences about how to plan and what to plan.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--93-03--SE.ps.Z", } @TECHREPORT{Parr93:Interaction, AUTHOR="Joachim Parrow", TITLE="Interaction Diagrams", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R93-06", YEAR=1993, ABSTRACT="Interaction diagrams are graphic representations of concurrent processes with evolving access capabilities; in particular they illustrate the points of access and relations between them. The basic step of computation is the migration of an access point between processes. This paper explains interaction diagrams through a sequence of examples. Diagrams can be regarded as graphic counterparts of terms in the pi-calculus and illuminate some interesting points on its construction.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--93-06--SE.ps.Z", } @INCOLLECTION{Ioan93:User, AUTHOR="Mohamed Abdelaziz Ioannis Stavrakakis and Dave Hoag", TITLE="A user relief approach to congestion control in {ATM} networks", BOOKTITLE="Asynchronous Transfer Mode Networks", EDITOR="I. Vinitos and R. Ornuval", PUBLISHER="Plenum Press", PAGES="135-155", YEAR=1993, KEYWORDS="Shaping; policing; traffic regulation; ATM", ABSTRACT="In this paper a new, insightful description of the object functions of a Traffic Regulator (TR) - implementing a model traffic behavior (delivered to the network) and a (user) relief function - is introduced. By identifying the relief function associated with the Leaky Bucket (LB), an explanation for the inefficiency of this widely studied TR is presented. The new class of $\rho-relief ~ LB$ TRs is then developed by focusing on the implementation of more flexible and efficient relief mechanisms. The improved effectiveness of the proposed class is established through a comprehensive comparison with the standard LB. The results from this study, as well as the slotted nature of the ATM environment, have motivated the introduction and study of the $\sigma-relief ~ TR$ implementing a near-periodic spacer. The induced cell loss probabilities have been derived through the analysis of a finite capacity queueing system with service opportunities determined in terms of a periodic pattern consisted of $C+1$ subframes.", } @ARTICLE{Giro93:Scalable, AUTHOR="B. Girod", TITLE="Scalable video for multimedia systems", JOURNAL="Computers and Graphics", VOLUME=17, NUMBER=3, PAGES="269-276", YEAR=1993, KEYWORDS="scalable video coding", } @INPROCEEDINGS{Leue93:Optimization, AUTHOR="S. Leue and Ph. Oechslin", TITLE="Optimization Techniques for Parallel Protocol Implementation", BOOKTITLE="Fourth IEEE Workshop on Future Trends in Distributed Computing Systems", PUBLISHER="{IEEE} Computer Society Press", PAGES="387-393", YEAR=1993, KEYWORDS="SDL; parallel; optimize; TCP; IP; FTP", } @INPROCEEDINGS{Feng93:New, AUTHOR="T. Feng and S. Seo", TITLE="A New Fault-Tolerant Network Architecture: A Composite Banyan Network", BOOKTITLE="Future Trends of Distributed Computing Systems", PAGES="181-187", YEAR=1993, } @INPROCEEDINGS{Ural93:Test, AUTHOR="H. Ural and A. C. Williams", TITLE="Test Generation by Exposing Control and Data Dependencies within System Specifications in {SDL}", BOOKTITLE="Formal Description Techniques, {VI}", EDITOR="R. L. Tenney and P. D. Amer and M. Ü. Uyar", SERIES="{IFIP} Transactions C-22", PUBLISHER="North-Holland", PAGES="335-350", YEAR=1993, KEYWORDS="dependence analysis; SDL", } @INPROCEEDINGS{Nort93:Dictionary, AUTHOR="Stephen C. North and Kiem-Phon Vo", TITLE="Dictionary and Graph Libraries", BOOKTITLE=usenixw, PUBLISHER="USENIX", PAGES="1-11", YEAR=1993, } @BOOK{Smit93:Frame, AUTHOR="P. W. Smith", TITLE="Frame Relay", PUBLISHER="Addison-Wesley", ADDRESS="Wokingham, England", YEAR=1993, KEYWORDS="Fr", } @INPROCEEDINGS{Kay93:Measurement, AUTHOR="Jonathan S. Kay and J. Pasquale", TITLE="Measurement, Analysis, and Improvement of {UDP/IP} Throughput for the {DECstation} 5000", BOOKTITLE="USENIX a voir dans ethics....", YEAR=1993, KEYWORDS="tcp; udp; optimization; checksum; dec", } @BOOK{Lawl93:Logistics, AUTHOR="E. L. Lawler and J. K. Lenstra and A. H. G. and David B. Shmoys", TITLE="Logistics of Production and Inventory", SERIES="Handbooks in Operations Research and Management Science", PUBLISHER="North-Holland", VOLUME=4, YEAR=1993, KEYWORDS="sequencing; scheduling; optimization", } @INPROCEEDINGS{Thia93:High, AUTHOR="Y. H Thia and C. M. Woodside", TITLE="High-Speed {OSI} Protocol Bypass Algorithm with Window Flow Control", BOOKTITLE="Protocols For High-Speed Networks III C", EDITOR="B. Pehrson and P. Gunningberg and S. Pink", ORGANIZATION="IFIP", PUBLISHER="NORTH-HOLLAND", VOLUME="C-9", PAGES="53-68", YEAR=1993, } @INPROCEEDINGS{Tant93:Multiprocessing, AUTHOR="A. Tantawy and M. Zitterbart", TITLE="Multiprocessing in High Performance {IP} Routers", BOOKTITLE="Protocols for High-Speed Networks, III", EDITOR="B. Pehrson and P. Gunningberg and S. Pink", PUBLISHER="North-Holland", VOLUME="C-9", PAGES="235-254", YEAR=1993, } @INPROCEEDINGS{McKe93:BayBridge, AUTHOR="N. McKeown and R. Edell and M. Le", TITLE="The BayBridge: A High Speed Bridge/Router", BOOKTITLE="Protocols for high-Speed Networks, III (C-9)", EDITOR="and S. Pink", ORGANIZATION="IFIP", PUBLISHER="Esevier Science Publishers", PAGES="203-218", YEAR=1993, KEYWORDS="bridge; router; implementation; high-speed", } @INPROCEEDINGS{Feld93:Reducing, AUTHOR="David C. Feldmeier and Anthony McAuley", TITLE="Reducing Protocol Ordering Constraints to Improve Performance", BOOKTITLE="Protocols for high-Speed Networks, III (C-9)", EDITOR="and S. Pink", ORGANIZATION="IFIP", PUBLISHER="Esevier Science Publishers", PAGES="203-218", YEAR=1993, KEYWORDS="resequencing; ordering; protocols; optimization", } @ARTICLE{Schm9304:Transport, AUTHOR="Douglas Schmidt and T. Suda", TITLE="Transport System Architecture Services for High-Performance Communications System", JOURNAL=ieeejsac, VOLUME=11, NUMBER=4, PAGES="489-506", YEAR=1993, KEYWORDS="architecture; parallel; structure", } @ARTICLE{Gupt9303:Hardware, AUTHOR="R. C. Gupta and G. Micheli", TITLE="Hardware-Software Cosynthesis for Digital Systems", JOURNAL="{IEEE} Design and Test of Computers", VOLUME=10, NUMBER=3, PAGES=46, YEAR=1993, KEYWORDS="codesign; dependence graph", } @ARTICLE{Wenb9312:Codesign, AUTHOR="A. Wenban and J. O'Leary and Geoffrey Brown", TITLE="Codesign of Communication Protocols", JOURNAL="{IEEE} Computer", VOLUME=26, NUMBER=12, YEAR=1993, KEYWORDS="promela; hardware", } @ARTICLE{Kuma9312:Framework, AUTHOR="Surinder Kumar and J. Aylor", TITLE="A Framework for Hardware/Software Condesign", JOURNAL="{IEEE} Computer", VOLUME=26, NUMBER=12, PAGES="39-45", YEAR=1993, } @ARTICLE{Feld9304:Framework, AUTHOR="David C. Feldmeier", TITLE="A Framework of Architecutral Concepts for High-Speed Communication Systems", JOURNAL=ieeejsac, VOLUME=11, NUMBER=4, PAGES="480-488", YEAR=1993, KEYWORDS="optimize; review; parallel; multiplex", } @ARTICLE{Kais9306:Parallel, AUTHOR="Matthias Kaiserswerth", TITLE="The Parallel Protocol Engine", JOURNAL=ieanep, VOLUME=1, NUMBER=6, PAGES="650-662", YEAR=1993, KEYWORDS="tcp; optimize transputer; wicki", } @ARTICLE{Gun93:Bandwidth, AUTHOR="Levent Gün and R. Guérin", TITLE="Bandwidth mangement and congestion control framework of the bradband network architecture", JOURNAL="Computer Networks and {ISDN} Systems", VOLUME=1993, NUMBER=26, PAGES="61-78", YEAR=1993, KEYWORDS="equivalent capacity", } @ARTICLE{Bals9303:Cycle, AUTHOR="Simonetta Balsamo and M. C. Clo and L. Donatiello", TITLE="Cycle time distribution of cyclic networks with blocking", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=17, NUMBER=3, PAGES="159-168", YEAR=1993, REFERENCES=13, KEYWORDS="Cycle time; blocking; steady state; cyclic exponential queue; finite capacity", ABSTRACT="An algorithm is provided to compute the cyclic time distributionfor cyclic closed exponential queueing networks with N finite capacity nodes and blocking. The blocking phenomenon is due to nodes with finite capacity queues which can be used to representsystems with limited resources. Moreover, a recursive algorithm is provided to evaluate the cyclic time moments, and a closed form solution, both in terms of distr. and mom. of the cyc. time", } @ARTICLE{Chen9303:Tandem, AUTHOR="D. W. Cheng", TITLE="Analysis of a tandem queue with state-dependent general blocking: a {GSMP} perspective", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=17, NUMBER=3, PAGES="169-176", YEAR=1993, REFERENCES=20, KEYWORDS="Tandem queue; blocking; semi Markov process; state dependent queueing", ABSTRACT="In this paper, we study a tandem queue where there is a finite number of buffer positions at each stage. The blocking scheme isgeneral in the sense that it can model a number of classical blocking schemes, including communication, manufacturing and kanban blocking as special cases. The system considered here differs from the conventional system in two aspects: (1) departure deter. by another queue (2) blocking state-dependent", } @ARTICLE{Decr9303:Error, AUTHOR="L. Decreusefond and N. van Dijk and H. Korezlioglu", TITLE="An error bound for infinite approximations of queueing networks with large finite stations under {RSRD} protocol", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=17, NUMBER=3, PAGES="177-187", YEAR=1993, REFERENCES=9, KEYWORDS="Approximation; finite buffer; protocol; error bound", ABSTRACT="Queueing networks with stations having finite but relatively large buffers are studied. The protocol is the repetitive service random destination (RSRD) protocol. A simple infinite product approximation is suggested to evluate the system. An analytic error bound is established for the accuracy of this approximation. This error bound is shown to be of the order of the steady state probability to exceed the buffer limits ..", } @ARTICLE{Kouv9303:Entropy, AUTHOR="D. D. Kouvatsos and G. D. Spiros", TITLE="Entropy maximised queueing networks with blocking and multiple job classes", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=17, NUMBER=3, PAGES="189-205", YEAR=1993, REFERENCES=22, KEYWORDS="Queueing system; M/M/1/S; job class; blocking; entropy", ABSTRACT="The method of entropy maximisation is applied in a state space partitioning mode for the approximation of the joint stationary queue length distribution of an M/M/1/N queue with finite capacity, N(>1), multiple and distinct classes of jobs, R(>1), under a complete buffer sharing scheme and mixed service disciplines drawn from the first-come-first-served, last-come-first-served with or without preemption and processor sharing rules.", } @ARTICLE{Morr9303:Approximate, AUTHOR="T. D. Morris and Harry Perros", TITLE="Approximate analysis of a discrete-time tandem network of cut-through queues with blocking and bursty traffic", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=17, NUMBER=3, PAGES="207-223", YEAR=1993, REFERENCES=12, KEYWORDS="Discrete time; tandem queue; finite capacity; cut-through switching; ATM; bursty traffic", ABSTRACT="A discrete-time tandem queue of cut-through queues is presented.The model allows finite capacity queues, blocking, and bursty traffic. A new bursty arrival process for cut-through traffic isintroduced. The tandem network is analyzed using single-node decomposition.", } @ARTICLE{Shiu9303:Two, AUTHOR="G. A. Shiue and T. Altiok", TITLE="Two-stage, multi-product production/inventory systems", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=17, NUMBER=3, PAGES="225-232", YEAR=1993, REFERENCES=22, KEYWORDS="Multiclass queue; finite capacity; Poisson process", ABSTRACT="A production/inventory system consisting of two single-stage facilities with a finite capacity buffer in between and a warehouse at the downstream end, producing multiple product types is considered. The demand process for each product is assumed to follow a Poisson distribution and the excess demand is backordered. Products having a priority structure and the processor is shared according to switching rule.", } @ARTICLE{Glaz9303:Process, AUTHOR="D. Glazer and C. Tropper", TITLE="On process migration and load balancing in Time Warp", JOURNAL=ieeepds, VOLUME=4, NUMBER=3, PAGES="318-327", YEAR=1993, REFERENCES=19, KEYWORDS="Distributed simulation; time warp; speedup; load balancing", ABSTRACT="This paper presents a load balancing algorithm for a discrete event simulation executed under time warp. ... A simulated multiprocessor environment (PARALLEX) was developed in order to evaluate the algorithm:", } @ARTICLE{Schm9307:CRMA, AUTHOR="H. Schmid", TITLE="{CRMA} - ein Zugriffsprotokoll für {Gbit/s-LAN}", JOURNAL=ntz, ADDRESS="Germany", VOLUME=46, NUMBER=7, PAGES="514-516", YEAR=1993, LANGUAGE="German", REFERENCES=7, KEYWORDS="LAN; MAN; CRMA; survey", ABSTRACT="Introduction to CRMA", } @ARTICLE{Mill9304:AI, AUTHOR="D. Miller and R. J. Firby and Paul A. Fishwick and D. W. Franke and others", TITLE="{AI:} what simulationists really need to know", JOURNAL=tomacs, VOLUME=2, NUMBER=4, PAGES="269-284", YEAR=1993, REFERENCES=27, KEYWORDS="Artificial intelligence; simulation", ABSTRACT="This paper presents five short essays by researchers in simulation, AI, and a couple who who have feet in both camps.", } @ARTICLE{Nels9303:Several, AUTHOR="R. T. Nelson and Donald F. Towsley", TITLE="A performance evaluation of several priority policies for parallel processing systems", JOURNAL="J. of the ACM", VOLUME=40, NUMBER=3, PAGES="714-740", YEAR=1993, REFERENCES=34, KEYWORDS="Queueing theory; HOL priority; preemptive priority", ABSTRACT="In this paper, analytic models for a multiprocessor executing a stream consisting of K classes of fork-join jobs are developed. .. Several priority policies are analyzed.", } @ARTICLE{Xion9304:Study, AUTHOR="Yongqiang Xiong and G. H. Petit and H. Bruneel", TITLE="Performance study of an {ATM} self-routing multistage switch with bursty traffic: simulation and analytic approximation", JOURNAL="ETT (publish by AEI)", ADDRESS="Italy", VOLUME=4, NUMBER=4, PAGES="55-65", YEAR=1993, REFERENCES=17, KEYWORDS="ATM; switching block; performance evaluation; simulation; approximation", ABSTRACT="Study of the Roxanne architecture using on-off sources.", } @ARTICLE{Fisc9305:Datenkommunikation, AUTHOR="W. Fischer", TITLE="Datenkommunikation mittels {ATM} - Architekturen, Protokolle, Betriebsmittelverwaltung", JOURNAL="Informationstechnik und Technische Informatik (it+ti)R. Oldenburg Verlag", ADDRESS="Germany", VOLUME=35, NUMBER=5, PAGES="3-11", YEAR=1993, LANGUAGE="German", REFERENCES=19, KEYWORDS="ATM; survey; switching block", ABSTRACT="This paper is an attempt to give an overview of network architectures which make use of the special features of ATM.", } @INPROCEEDINGS{Abra9301:Determining, AUTHOR="M. D. Abrams and Jin-Tuu Wang", TITLE="Determining initial states for time-parallel simulation", BOOKTITLE="7th Workshop on PADS ACM SIGSIM", ADDRESS="San Diego, California", PAGES="19-26", NOTE="SIGSIM 23(1)", YEAR=1993, REFERENCES=15, KEYWORDS="Simulation; parallel algorithm; queueing network", ABSTRACT="Time-parallel simulations exploit parallelism by partitioning the time domain of a simulation model. In this paper, we propose a time-parallel simulation method which uses a pre-simulation to identify recurrent states. Several queueing network models are investigated with the proposed time-parallel simulation.", } @ARTICLE{Humb9304:Efficient, AUTHOR="Pierre A. Humblet and R. Ramaswami and Kumar N. Sivarajan", TITLE="An Efficient Communication Protocol for High-Speed Packet-Switched Multichannel Networks", JOURNAL=ieeejsac, VOLUME="SAC-11", NUMBER=4, PAGES="568-578", YEAR=1993, REFERENCES=28, KEYWORDS="Media access control; transport protocol; transport layer; wdm; star network", ABSTRACT="This paper proposes a new media-access protocol for high-speed packet-switched multichannel networks based on a broadcast topology - for example, optical passive star networks using wavelength-division multiple access. The protocol supports connection-oriented traffic, with or without bandwidth reservation, as well as datagram traffic in an attempt to integrate transport-layer functions with the media-access layer.", } @BOOK{Onvu93:Asynchronous, AUTHOR="R. O. Onvural", TITLE="Asynchronous transfer mode networks: Performance issues", PUBLISHER="Artech House", ADDRESS="Norwood, MA, USA", PAGES=260, YEAR=1993, REFERENCES=78, KEYWORDS="ATM; performance evaluation; traffic source model; survey", } @ARTICLE{Andr9303:Variance, AUTHOR="S. Andradóttir and D. P. Heyman and Teunis Ott", TITLE="Variance Reduction Through Smoothing and Control Variates for Markov Chain Simulations", JOURNAL=tomacs, VOLUME=3, NUMBER=3, PAGES="167-189", YEAR=1993, REFERENCES=18, KEYWORDS="Simulation; Monte Carlo Simulation; Algorithm; variance reduction; Markov Chain", ABSTRACT="The authors consider the simulation of a discrete Markov chain that is so large that numerical solution of the steady-state balance equations cannot be done with available computers. The authors propose smoothing methods to obtain variance reduction when simulation is used to estimate a function of a subset of the steady-state probabilities. An algorithm that converges to the optimal smoothing operator is given and guidelines for the parameters", } @ARTICLE{Cao9302:Common, AUTHOR="Xi-Ren Cao", TITLE="Some Common Misconception About Performance Modeling and Validation", JOURNAL=per, VOLUME=21, NUMBER=2, PAGES="11-15", YEAR=1993, REFERENCES=1, KEYWORDS="Performance Model; Validation; Queueing System; parameter Estimation; Parameter Validation; Markov system", ABSTRACT="The paper was a letter to the Perf. Eval. Review addressing the problem of validating queueing network models. Trough 3 examples some common misconception in performance modeling and validation were discussed.", } @ARTICLE{Cao9302:Communication, AUTHOR="Y. Cao and James Graham and A. S. Elmaghraby", TITLE="Communication Approaches for {Simulation-AI} Interactions", JOURNAL="Simulation Digest, ACM \& IEEE", VOLUME=23, NUMBER=2, PAGES="3-16", YEAR=1993, REFERENCES=28, KEYWORDS="Simulation; Artificial Intelligence; Interaction Model", ABSTRACT="The paper considers the various classes of interactions between AI and simulation systems, and how they may be nmutually beneficial. This is shown with examples from the literature. Varios strategies for the communication are considered and a UNIX-based implementation of interprocess communication is presented. Finally a case study is given using MODSIM as the language for the simulation and CLIPS for implementing the intelligent agent.", } @ARTICLE{Davi9304:Simplifying, AUTHOR="R. H. Davies and R. O'Keefe and H. T. O. Davies", TITLE="Simplifying the Modeling of Multiple Activities, Multiple Queuing, and Interruptions: A New Low-Level Data Structure", JOURNAL=tomacs, VOLUME=3, NUMBER=4, PAGES="332-346", YEAR=1993, REFERENCES=10, KEYWORDS="Simulation; Discrete Event Simulation; Data Structure; concurrency; Interrupted Service; Pascal", ABSTRACT="Most conventional discrete-event simulation software assumes a simple progression of entities through queues and activities. Such software cannot cope easily with modeling systems where entities can be present in more than one queue, can be involved in more than one activity, or can be interrupted while queueing. Low-level data structures to address these problems have been implemented in Pascal by extending the packet Pascal\_SIM.", } @ARTICLE{Dono9303:Sequential, AUTHOR="J. M. Donohue and E. C. Houck and R. H. Myers", TITLE="A Sequential Experimental Design Procedure for the Estimation of First- and Second-Order Simulation Metamodels", JOURNAL=tomacs, VOLUME=3, NUMBER=3, PAGES="190-224", YEAR=1993, REFERENCES=30, KEYWORDS="Performance evaluation; Variance Reduction; Simulation", ABSTRACT="Simulation metamodels find application ind the study of complex systems that cannot be solved analytically. These metamodels represent efficient tools for studyimg the characteristics of the more complicated simulation model. This article presents a procedure for the construction of sequential simulation designs for estimation of response surface metamodels. Additionally, 3 methods of assigning random number streams are considered.", } @ARTICLE{Eick9304:Synchronous, AUTHOR="S. G. Eick and A. G. Greenberg and B. D. Lubachevsky and A. Weiss", TITLE="Synchronous Relaxation for Parallel Simulations with Applications to Circuit-Switched Networks", JOURNAL=tomacs, VOLUME=3, NUMBER=4, PAGES="287-314", YEAR=1993, REFERENCES=13, KEYWORDS="Simulation Method; Discrete Event Simulation; parallel algorithm; Performance Evaluation", ABSTRACT="Synchronous relaxation, a new, general-purpose, efficient method for parallel simulation, is proposed. The method is applied to obtain a new parallel algorithm for simulating large circuit-switched communication networks. The article presents the results of circuit-switched network simulation experiments, and analytic approximations derived from a mathematical model of the simulation method.", } @ARTICLE{Kesi9303:Quick, AUTHOR="G. Kesidis and J. Walrand", TITLE="Quick Simulation of {ATM} Buffers with On-Off Multiclass Markov Fluid Sources", JOURNAL=tomacs, VOLUME=3, NUMBER=3, PAGES="269-276", YEAR=1993, REFERENCES=16, KEYWORDS="Simulation; Performance evaluation; Variance Reduction; fluid Flow Model", ABSTRACT="The problem addressed in the article is how to quickly estimate by simulation the loss in a buffer with multiclass on-off Markov fluid sources. The Markov fluids are generated with the altered rate matrices given in Kesidis and Walrand [1992], instead of the originals, to speed up the simulation. Liklikood ratios are used to recover an estimate of the loss for the original traffic parameters.", } @ARTICLE{Nels9303:Robust, AUTHOR="Bruce Nelson", TITLE="Robust Multiple Comparisons Under Common Random Numbers", JOURNAL=tomacs, VOLUME=3, NUMBER=3, PAGES="225-243", YEAR=1993, REFERENCES=16, KEYWORDS="Simulation; Statistics; RNG; Variance Reduction", ABSTRACT="In this article the author shows how a result used in the analysis of repeated-measures experiments can aid in the analysis of simulation experiments that employ common random numbers. The author specifically considers the statistical procedure known as multiple comparisons with the best. It is established when the proposed procedure provides exakt inference, and then is is shown that it is typically robust when it is not exact.", } @ARTICLE{Nels9303:Mathematics, AUTHOR="Randolph D. Nelson", TITLE="The Mathematics of Product Form Queuing Networks", JOURNAL="ACM Comput. Surveys", VOLUME=25, NUMBER=3, PAGES="339-369", YEAR=1993, REFERENCES=95, KEYWORDS="Queueing Network; Markov Process; Product Form", ABSTRACT="Markov Processes that have a product form solution have become an important computer performance modeling tool. The fact that such a simple solution exists for seemingly complex Markov processes is surprising at first encounter and can be established by showing that balance equations are satisfied. The article provides insight as to why such a solution form exists and demonstrates that product form is a consequence of partial balance.", } @ARTICLE{Ross9303:Asymptotically, AUTHOR="Keith W. Ross and Jin-Tuu Wang", TITLE="Asymptotically Optimal Importance Sampling for Product-Form Queueing Networks", JOURNAL=tomacs, VOLUME=3, NUMBER=3, PAGES="244-268", YEAR=1993, REFERENCES=20, KEYWORDS="Queueing Network; Algorithm; Product Form; Monte Carlo simulation; Importance Sampling", ABSTRACT="Monte Carlo integration is applied to the integral representation of the normalization constant for a family of product-form multiclass queueing networks. These networks are closed with single-server, fixed-rate stations and at least one infinite-server. Letting the population for each class go to infinity, the asymptotically optimal importance-sampling distributions are derived for estimates of the normalization constant and the utilization.", } @ARTICLE{Tezu9304:Lattice, AUTHOR="S. Tezuka and P. L'Ecuyer and R. W. Couture", TITLE="On the Lattice Structure of the Add-With-Carry and Subtract-With-Borrow Random Number Generators", JOURNAL=tomacs, VOLUME=3, NUMBER=4, PAGES="315-331", YEAR=1993, REFERENCES=13, KEYWORDS="Algorithm; RNG", ABSTRACT="Marsaglia and Zaman recently proposed new classes of random number generators, called add-with-carry (AWC) and subtract-with-borrow (SWB), which are capable of quickly generating very long-period (pseudo)-random number sequences using very little memory. The authors show, that these sequences are essentially equivalent to linear congruential sequences with very large prime moduli.", } @ARTICLE{Schl9306:Bandwidth, AUTHOR="R. Schlott", TITLE="Bandwidth allocation in an {IBCN} queueing system with quasirandom input", JOURNAL="ETT AEI", ADDRESS="Milan, Italy", VOLUME=4, NUMBER=6, PAGES="705-722", YEAR=1993, REFERENCES=21, KEYWORDS="ATM; connection admission control; finite source", ABSTRACT="We present a call admission strategy for an IBCN serving two types of customers - narrowband and broadband. Either one or both customer groups are assumed to have a finite number of sources. the model involves a multidimensional state space, for which balance equations are derived. ...", } @ARTICLE{Baur9302:How, AUTHOR="H. Baur", TITLE="How Technology is Driving Progress in Telecommunications", JOURNAL="Components, Siemens", ADDRESS="Munich, Germany", VOLUME=27, NUMBER=2, PAGES="6-10", YEAR=1993, KEYWORDS="technology; communication; development", } @ARTICLE{Bouc93:Generalization, AUTHOR="R. J. Boucherie", TITLE="A Generalization of Norton's Theorem for Queueing Networks", JOURNAL=qs, VOLUME=13, NUMBER="1-3", PAGES="251-289", YEAR=1993, KEYWORDS="aggregation; blocking; decomposition; Norton's theorem; product form; queueing network; global traffic equations; local traffic equations", ABSTRACT="A general framework for aggregation and decomposition of product form queueing networks with state dependent routing and servicing is presented. By analogy with electrical circuit theory, the stations are grouped into clusters of subnetworks such that the process decomposes into a global process and a local process. Moreover, the local process factorizes into the subnetwork", } @ARTICLE{Char93:Private, AUTHOR="K. Chari and A. Dutta", TITLE="Design of Private Backbone Networks - {I:} Time Varying Traffic", JOURNAL=ejor, VOLUME=67, PAGES="428-442", YEAR=1993, KEYWORDS="communication network; capacity assignment; routing; time varying traffic; Bender's decomposition", ABSTRACT="Technological advances, special communication needs and potential cost advantages are prompting an increasing number of business to configure private communication networks, bypassing the public networks to varying degree. In view of the high proces of leasing capacity, this paper develops a model for determining transmission line capacity in private backbone networks, such t", } @ARTICLE{Chau93:Computing, AUTHOR="M. L. Chaudhry and M. Agarwal and J. G. C. Templeton", TITLE="Computing Steady-State Queueing-Time Distributions of single-Server Queues {GIx/M/1}", JOURNAL="ZOR - Methods and Models of Operations Research", VOLUME=37, PAGES="13-29", YEAR=1993, KEYWORDS="waiting time; distribution; computational algorithm", ABSTRACT="Roots", } @ARTICLE{Chen93:Remarks, AUTHOR="Chi-Ming Chen and T. H. Savits", TITLE="Some Remarks on Compound Nonhomogeneous Poisson Processes", JOURNAL=spl, VOLUME=17, NUMBER=3, PAGES="179-187", YEAR=1993, KEYWORDS="Poisson distribution; compound distribution; superposition; event counting; nonhomogeneous Poisson; thinning; discounting", ABSTRACT="The notion of a compound nonhomogeneous Poisson process is introduced and its properties investigated. Various closure properties are then considered including superposition, thinning and discounting.", } @ARTICLE{Chou93:Transient, AUTHOR="T. Choukri", TITLE="The Transient Blocking Probabilities in {M/M/N} Loss Systems via Large Deviations", JOURNAL=aap, VOLUME=25, NUMBER=2, PAGES="483-486", YEAR=1993, KEYWORDS="standard deviation; loss system; large deviations", ABSTRACT="By using large deviations theory, we give asymptotic formulas for the transient blocking probabilities of M/M/N/N and M (with finite Poisson sources) M/N/N queues.", } @ARTICLE{Cido93:Correlated, AUTHOR="I. Cidon and R. Guerin and Asad Khamisy and M. Sidi", TITLE="Analysis of a Correlated Queue in a Communication System", JOURNAL=ieeeit, VOLUME=39, NUMBER=2, PAGES="456-465", YEAR=1993, KEYWORDS="correlation; dependency; dependent queues; Proportional dependency; on-off process", ABSTRACT="A family of queues where the service time B(n) of customer n depends on the interarrival time I(n) between customers n-1 and n is studied. In particular, the focus is on dependencies that arise naturally in the context of communication systems, where the finite speed of the communication links constrains the amount of data that can be received in a given time in", } @ARTICLE{Das93:Asymmetric, AUTHOR="T. K. Das and M. A. Wortman", TITLE="Analysis of Asymmetric Patrolling Repairman Systems", JOURNAL=ejor, VOLUME=64, PAGES="45-60", YEAR=1993, KEYWORDS="performance evaluation; manufacturing system; stochastic process; machine-repair-man model", ABSTRACT="Patrolling repairman; Palm machine-repair", } @ARTICLE{Fox93:Shortening, AUTHOR="B. L. Fox", TITLE="Shortening Future Event Lists", JOURNAL="ORSA Journal on Computing", VOLUME=5, NUMBER=2, PAGES="147-150", YEAR=1993, KEYWORDS="Markov process; exponential distribution; exponential time intervals", ABSTRACT="For discrete event simulations with many exponential variates but not necessarily continuous time Markov chains, we shorten the future event list. No matter how many underlying exponential variates are present in principle, at any time, at most one exponential variate is on the future event list. We point out how to find quickly the corresponding event so that overall computational complexity", } @ARTICLE{Hamm9301:Computer, AUTHOR="M. Hammer and H. J chter", TITLE="Computer-Aided Network Planning for {PDH} and {SDH} Networks", JOURNAL="Philips Telecommunication Review", ADDRESS="Netherlands", VOLUME=51, NUMBER=1, PAGES="43-50", YEAR=1993, KEYWORDS="Planning; Network Planning; Computer Tool", } @ARTICLE{Hsu93:Network, AUTHOR="L.-F. Hsu and C. S. Tapiero and Ching-Yung Lin", TITLE="Network of Queues Modeling in Flexible Manufacturing Systems: A Survey", JOURNAL="Recherche Operationelle / Operations Research", VOLUME=27, NUMBER=2, PAGES="201-248", YEAR=1993, KEYWORDS="queueing system; network; flexible manufacturing system", ABSTRACT="Queueing theory in the past and still to-day, has been used intensively for the design and analysis of Flexible Manufacturing Systems (FMS's). The queueing approach, combines on the one hand important theoretical developments in queueing theory and networks of queues and extensive applications to the performance analysis of information systems. The purpose of this paper is to survey the application of queues to the", } @ARTICLE{Kimu93:Duality, AUTHOR="Takumi Kimura", TITLE="Duality Between the {Erlang} Loss System and a Finite Source Queue", JOURNAL="Operations -research Letters", VOLUME=13, NUMBER=3, PAGES="169-173", YEAR=1993, KEYWORDS="machine-repair-man model; Erlang B formula; finite source; finite queue; Palm's machine interference model; duality", ABSTRACT="We provide a duality relation between an M/G/s/s queue and a GI/M/1/s/s queue. The M/G/s/s queue, so called the Erlang loss system, has been extensively studied as a model of telephone exchanges. Using the duality relation and the previous results for the M/G/s/s queue, we can derive some well-known and some new results for the GI/M/1/s/s queue that is useful", } @ARTICLE{Kubo93:Proposal, AUTHOR="Koji Kubota and Hideo Yokota and Toshiaki Tanaka", TITLE="Proposal of New Ring Access Control and Connection Admission Control Method", JOURNAL="Electronics Letter", VOLUME=29, NUMBER=8, PAGES="680-688", YEAR=1993, KEYWORDS="communication protocol; asynchronous method; ATM; digital communication; asynchronous transfer mode", ABSTRACT="A new ring access control method is proposed for an ATM ring network. In this method, higher priority traffic which requires strict quality of service can be transmitted with no cell loss, by executing connection admission control. Lower priority traffic is transmitted using that part of the bandwidth not used for higher priority traffic. In this way, ring use is improved. A simulation is used", } @ARTICLE{Lagu93:Bandwidth, AUTHOR="M. Laguna and F. Glover", TITLE="Bandwidth Packing: A Tabu Search Approach", JOURNAL=ms, VOLUME=39, NUMBER=4, PAGES="492-500", YEAR=1993, KEYWORDS="shortest path; routing; tabu-search; k-shortest paths", ABSTRACT="The bandwidth packing (BWP) problem is a combinatorically difficult problem arising in the area of telecommunications. The problem consists of assigning calls to paths in a capacitated graph, such that capacities are not violated and the total profit is maximized. In this paper we discuss the development of a tabu search (TS) method for the BWP problem. The method makes use of an efficient", } @ARTICLE{Lee93:Algorithm, AUTHOR="C. Lee", TITLE="An Algorithm for the Design of Multitype Concentrator Networks", JOURNAL=jors, VOLUME=44, NUMBER=5, PAGES="471-482", YEAR=1993, KEYWORDS="concentrator", ABSTRACT="Cross decomposition", } @ARTICLE{Marb93:Loss, AUTHOR="V. Marbukh", TITLE="Loss Circuit Switched Communication Network - Performance Analysis and Dynamic Routing", JOURNAL=qs, VOLUME=13, NUMBER="1-3", PAGES="111-141", YEAR=1993, KEYWORDS="Loss system; circuit switching; communication network; blocking; state dependent routing; reservation;performance evaluation; trunk reservation; fixed point model (FPM); metastability; catastrophic phenomena; bifurcation diagram of the network", ABSTRACT="We investigate a loss circuit switched communication network with state-dependent dynamic routing strategy, wherein the state of the network at the time of call arrival determines whether or not the call is accepted, and if accepted, its route. We develop an approximate approach to the network performance", } @ARTICLE{Meyn9301:Recurrence, AUTHOR="Sean Meyn and M. R. Frater", TITLE="Recurrence Times of Buffer Overflows in Jackson Networks", JOURNAL=ieeeit, VOLUME="IT-39", NUMBER=1, PAGES="92-97", YEAR=1993, KEYWORDS="Jackson net; buffer length; overflow; Markov process", ABSTRACT="The estimation of the statistics of buffer overflows in networks of queues by means of simulation is inherently costly, simply because of the rarity of these events. An alternative analytic approach is presented, with very low computational cost, for calculating the recurrence time of buffer overflows Jackson networks in which the recurrence times of buffer overflows in a network is expressed in terms of the recurrence ti", } @ARTICLE{Murt93:File, AUTHOR="I. Murthy and D. Ghosh", TITLE="File Allocation Involving Worst Case Repsonse Times and Link Capacities: Model and Solution Procedure", JOURNAL=ejor, VOLUME=67, NUMBER=3, PAGES="418-427", YEAR=1993, KEYWORDS="distributed system; optimization; integer programming", ABSTRACT="A major design issue facing the designer of a distributed computing system involves the determination of the number of file copies and their locations in the distributed environment. This problem is commonly referred to as the file allocation problem (FAP). In this paper, a FAP model is formulated that seeks to obtain the lowest cost file allocation strategy, thet ensures the attainment of acceptable", } @ARTICLE{Ochi93:Markov, AUTHOR="F. Ochin and E. Pradel", TITLE="A Markov Modulated Representation of Heterogeneous Overflow Traffic", JOURNAL=ieice_communications, VOLUME="E76-B 2", PAGES="169-177", YEAR=1993, KEYWORDS="Mmpp", ABSTRACT="In the paper, we introduce the MMPP(1...n) process, a model that may be used in Integrated Services Digital Networks to represent the superposition of several overflow streams belonging to different classes of traffic. Given an overflow system in a multiclass environment, we show that this Markov Modulated model may be used to match simultaneously the first two moments of each individual overflow process. In addition, it", } @TECHREPORT{Peuh93:Kauko, AUTHOR="M. Peuhkuri", TITLE="Kauko Rahko's Publications on Traffic Theory from 1984 to 1993", INSTITUTION="Helsinki University of Technology, Faculty of Electrical Engineering, Laboratory of Telecommunications", ADDRESS="Helsinki, Finland", PAGES=488, YEAR=1993, KEYWORDS="Survey; bibliography", } @ARTICLE{Stid93:Markov, AUTHOR="S. Stidham", TITLE="A Survey of Markov Decision Models for Control of Networks of Queues", JOURNAL=qs, VOLUME=13, NUMBER="1-3", PAGES="291-313", YEAR=1993, KEYWORDS="network; optimal control; Markov process; decision theory", ABSTRACT="We review models for the optimal control of networks of queues. Our main emphasis is on models based on Markov decision theory and the characterization of the structure of optimal control policies.", } @ARTICLE{Tass93:Dynamic, AUTHOR="L. Tassiulas and Anthony Ephremides", TITLE="Dynamic Server Allocation to Parallel Queues with Randomly Varying Connectivity", JOURNAL=ieeeit, VOLUME=39, NUMBER=2, PAGES="466-478", YEAR=1993, KEYWORDS="random; stability; throughput; delay; mobile radio; channel; time varying topology; Random connectivity; maximum throughput; minimum delay; meteor-burst channels", ABSTRACT="Consider $N$ parallel queues competing for the attention of a single server. At each time slot each queue may be connected to the server or not depending on the value of a binary random variable, the connectivity variable. The server is allocated to one of the connected queues at each slot; the allocation decision is based", } @ARTICLE{Xie93:Transient, AUTHOR="S. Xie and Ch. Knessl", TITLE="On the Transient Behavior of the {Erlang} Loss Model: Heavy Usage Asymptotics", JOURNAL=siapp, VOLUME=53, NUMBER=2, PAGES="555-599", YEAR=1993, KEYWORDS="Erlang B formula; asymptotic analysis; transient behaviour", ABSTRACT="Ray method", } @ARTICLE{Zhua93:Approximate, AUTHOR="L. Zhuang and K. S. Hindi", TITLE="Approximate Decomposition for Closed Queueing Network Models of {FMSs} with a Block-and-Wait and State-Dependent Routing Mechanism", JOURNAL=ejor, VOLUME=67, NUMBER=3, PAGES="373-386", YEAR=1993, KEYWORDS="flexible manufacturing system; closed queueing network; performance evaluation; decomposition", ABSTRACT="Closed queueing networks with a central server configuration are used to analyse the performance of Flexible Manifacturing Systems. The blocking phenomenon of cart-type Material Handling Systems (MHS) due to finite capacity of local buffers is addressed and a state-dependent routing scheme is introduced to assure that the MHS does not send parts to workstations where blocking events have already ossurred. Under the assumption", } @BOOK{Brun93:Discrete, AUTHOR="H. Bruneel and Byung G. Kim", TITLE="Discrete-Time Models for Communication Systems Including {ATM}", ISBN="0-7923-9292-2", PUBLISHER="Kluwer Academic Publishers, Boston/Dordrecht/London, 1993", PAGES=200, YEAR=1993, REFERENCES=150, KEYWORDS="ATM; discrete time analysis; multiplexer; survey; priority; queueing system; performance evaluation; switching network; scheduling; service interruption; delay analysis", ABSTRACT="Contents: 1) Independent Arrivals 1.1) Discrete-time Models and Applications 1.2) Analysis of the GI-G-1 Model 2) Scheduling Disciplines 2.1) Single Class Systems 2.2) Multi-Class Systems 2.3)Priority Disciplines 2.4) Cyclic Services 3) More Complicated M odels 3.1) Nonindependent Arrivals 3.2) Server Interruptions 4) Applications to ATM 4.1) ATM Switching Elements and Networks 4.2) ATM Multiplexer Models; plenty of references for each chapter", } @PHDTHESIS{Pitt93:Cell, AUTHOR="Jonathan Pitts", TITLE="Cell-Rate Simulation Modelling of Asynchronous Transfer Mode Telecommunication Networks", SCHOOL="Department of Electrical Engeneering, Queen Mary \\& Westfield College, University of London", ADDRESS="London, Great Britain", PAGES=170, YEAR=1993, REFERENCES=115, KEYWORDS="ATM; source model; traffic model; fluid flow model; simulation method; performance evaluation; traffic control", ABSTRACT="ATM and teletraffic; simulation; cell-rate simulation modelling; verification of cell-rate simulation", } @INPROCEEDINGS{Kay93:Measurement, AUTHOR="Jonathan S. Kay and J. Pasquale", TITLE="Measurement, Analysis, and Improvement of {UDP/IP} Throughput for the {DECstation} 5000", BOOKTITLE="USENIX a voir dans ethics....", YEAR=1993, KEYWORDS="tcp; udp; optimization; checksum; dec", } @BOOK{Lawl93:Logistics, AUTHOR="E. L. Lawler and J. K. Lenstra and A. H. G. and David B. Shmoys", TITLE="Logistics of Production and Inventory", SERIES="Handbooks in Operations Research and Management Science", PUBLISHER="North-Holland", VOLUME=4, YEAR=1993, KEYWORDS="sequencing; scheduling; optimization", } @MASTERSTHESIS{Pete93:Leistungsfähigkeit, AUTHOR="B. Petermann", TITLE="Leistungsfähigkeit der Analyse des Bediensystems {G/D/1} nach Benes", EDITOR="M. Baumann", TYPE="Studienarbeit", SCHOOL="TU Dresden, IfN-TK", ADDRESS="Dresden, Germany", PAGES=22, YEAR=1993, LANGUAGE="German", REFERENCES=9, KEYWORDS="performance evaluation; G/D/1; analytical model; ATM", ABSTRACT="Der Grundansatz zur Analyse des G/D/1 - Systems nach Benes (approach of unfinished work) wird hinsichtlich der Approximationsmoeglichkeiten bei verschiedenartigen, ATM-typischen Eingangsströmen untersucht.", } @MASTERSTHESIS{Raus93:Begrenzungseigenschaften, AUTHOR="H. Rausch", TITLE="Begrenzungseigenschaften von {ATM-Quellflußkontrollmechanismen}", EDITOR="M. Baumann", TYPE="Studienarbeit", SCHOOL="TU Dresden, IfN-TK", ADDRESS="Dresden, Germany", PAGES=30, YEAR=1993, LANGUAGE="German", REFERENCES=2, KEYWORDS="ATM; policing function; traffic pattern", ABSTRACT="Die von verschiedenen Policing-Algorithmen akzepierten Verkehrsmuster werden hinsichtlich ihres Einflusses auf folgende Multiplexer-Stufen untersucht.", } @MASTERSTHESIS{Tisc93:Approximationsansatz, AUTHOR="T. Tischer", TITLE="Approximationsansatz zur Analyse des statistischen Multiplexens in {ATM-Netzen}", EDITOR="M. Baumann", TYPE="Studienarbeit", SCHOOL="TU Dresden, IfN-TK", ADDRESS="Dresden, Germany", PAGES=22, YEAR=1993, LANGUAGE="German", REFERENCES=3, KEYWORDS="ATM; statistical multiplexing; approximation; fluid flow model", ABSTRACT="Für das pufferlose Fluid-Flow-Modell eines Multiplexers wird die Large-Deviation-Approximation der Sättigungswkt. untersucht.", } @ARTICLE{As93:Evolution, AUTHOR="H. R. As", TITLE="The Evolution Towards High-Performance {LANs} and {MANs}", JOURNAL="Informationstechnik und Technische Informatik (it+ti)", ADDRESS="Germany", VOLUME=35, NUMBER=4, PAGES="9-19", YEAR=1993, REFERENCES=41, KEYWORDS="High speed; lan; man; network evolution; technology; wdm", ABSTRACT="This paper tracks the evolution of standardized, experimental and proposed networks through three technology generations. Full exploitation of the technological advances has been an ongoing challenge. The first generation predominantly covers medium bit rates of around 10 Mbit/s. The second generation comprises a large variety of network configurations and access mechanisms in the speed range from 100Mbit/s up to multi Gbit/s. At the third tech", } @ARTICLE{Bach93:Optische, AUTHOR="E. J. Bachus and G. Großkopf and H. Heidrich and C. Helmolt and others", TITLE="Optische Frequenzmultiplextechnik", JOURNAL="NTZ, VDE-Verlag", ISBN="0948-728X", ADDRESS="Germany", VOLUME=46, NUMBER=1, PAGES="16-21", YEAR=1993, LANGUAGE="German", KEYWORDS="Tutorial; wdm", ABSTRACT="Übersicht über OFDM Arbeiten am HHI (Berlin)", } @ARTICLE{Benn9303:Switching, AUTHOR="R. L. Bennett and G. E. Policello I. I.", TITLE="Switching Systems in the 21st Century", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=31, NUMBER=3, PAGES="24-28", YEAR=1993, KEYWORDS="Architecture; IN; intelligent network; network architecture; overview; switching; switching network", ABSTRACT="As we enter the era of IN, the role and architecture of traditional switching systems will change forever.", } @BOOK{Berg93:VHDL, AUTHOR="J.-M. Bergé and A. Fonkoua and S. Maginot and J. Rouillard", TITLE="{VHDL} '92 - The New Features of the {VHDL} Hardware Description Language", PUBLISHER="Kluwer", ADDRESS="Netherlands", YEAR=1993, KEYWORDS="Hardware design language", } @ARTICLE{Boum9308:Specifying, AUTHOR="R. Boumezbeur and L. Logrippo", TITLE="Specifying Telephone Systems in {LOTOS}", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=31, NUMBER=8, PAGES="38-45", YEAR=1993, REFERENCES=12, KEYWORDS="IN; intelligent network; specification; specification language", ABSTRACT="Telephone systems can be specified in the LOTOS language; LOTOS tools can help detect unwanted feature interactions in the system.", } @ARTICLE{Brac93:Scalable, AUTHOR="C. A. Brackett and A. S. Acampora and J. Sweitzer and others", TITLE="A Scalable Multiwavelength Multihop Optical Network: A Proposal for Research on All-Optical Networks", JOURNAL=ieeejlt, VOLUME=11, NUMBER=5, PAGES="736-752", YEAR=1993, REFERENCES=14, KEYWORDS="Multihop; network architecture; optical switching; research problem; technology; wdm", ABSTRACT="An architectural approach for ver-high-capacity wide-area optical networks is presented, and a proposed program of research to address key system and device issues is described. This paper is a summary of a proposal submitted to DARPA for research on all-optical networks. The proposed network is based upon dense multiwavelength technology and is scalable in terms of the number of networked users, the geographical range of coverage and the aggre", } @ARTICLE{Bukh9308:InterBase, AUTHOR="O. A. Bukhres and Jinghu Chen and W. Du and A. Elmagarmid and R. Pezzoli", TITLE="InterBase: An Execution Environment for Heterogeneous Software Systems", JOURNAL=ieeecomp, VOLUME=26, NUMBER=8, PAGES="57-69", YEAR=1993, REFERENCES=12, KEYWORDS="Software engineering", ABSTRACT="InterBase integrates preexisting systems over a distributed, autonomous, and heterogeneous environment via a tool-based interface. It supports heterogeneous applications without violating the local autonomy of component systems.", } @INPROCEEDINGS{Carl93:Erweiterung, AUTHOR="D. Carl", TITLE="Erweiterung existierender Fernsprechnetze zu Intelligente Netzen", BOOKTITLE="Tutorium zur KiVS: Kommunikation in Verteilten Systemen", ADDRESS="München, Germany", PAGES="91-106", YEAR=1993, LANGUAGE="German", KEYWORDS="In; intelligent network; isdn; overview; telephony", ABSTRACT="Gegenwärtig werden in vielen Ländern die existierenden Fernsprechnetze zu Intelligenten Netzen (IN) erweitert. Abhängig von denkonkreten Bedingungen werden dabei verschiedene Szenarien angewandt.", } @ARTICLE{Chen9303:Intelligent, AUTHOR="S. Chen and M. Fujioka and G. O'Reilly", TITLE="Intelligent Networking for the Global Marketplace", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=31, NUMBER=3, PAGES="86-92", YEAR=1993, KEYWORDS="IN; intelligent network; internetworking; overview", ABSTRACT="For global intelligent networks, traditional definitions of IN that focus on the service level should be expanded to include the necessary infrastructure changes.", } @ARTICLE{Chla93:OPTICAL, AUTHOR="I. Chlamtac and A. Fumagalli", TITLE="An optical data double ring network", JOURNAL=jhsn, VOLUME=2, PAGES="355-371", YEAR=1993, REFERENCES=23, KEYWORDS="Hslan; lan; man; optical lan; ring network", ABSTRACT="This paper proposes an optical ring network that can tap the optical bandwidth by eliminating performance bottlenecks associated with the electronic processing of transmitted data. The proposed network and node architecture address the issues of packet transmission control and resources contentions, such as link, transmitter, and receiver contentions, in networks which maintain the data in the optical format.", } @ARTICLE{Chri93:Intelligenz, AUTHOR="B. E. Christensen", TITLE="Intelligenz im Netz bereichert Kommunikationstechnik {IN-Konzepte} für bestehende Netze", JOURNAL="Telekom Praxis", ADDRESS="Germany", VOLUME=70, PAGES="24-29", YEAR=1993, LANGUAGE="German", REFERENCES=15, KEYWORDS="In; intelligent network; overview", } @BOOK{Cost93:Sendmail, AUTHOR="B. Costales and E. Allman and N. Rickert", TITLE="sendmail", ISBN="1-56592-056-2", PUBLISHER="O'Reilly \& Associates", ADDRESS="Sebastopol, USA", YEAR=1993, KEYWORDS="Unix", ABSTRACT={This book provides a complete sendmail tutorial, plus extensive reference material on every aspect of the program. What's more, it's authoritative, having been co-authored by Eric Allman, the developer of "sendmail", and Neil Rickert, one of the leading "Sendmail" gurus on the Net.}, } @ARTICLE{Coyl93:Reduced, AUTHOR="A. Coyle and W. Henderson and P. Taylor", TITLE="Reduced load approximations for loss networks", JOURNAL="Telecommunication Systems, Baltzer Science Publishers", VOLUME=2, PAGES="21-50", YEAR=1993, REFERENCES=26, KEYWORDS="Approximation; circuit switching; loss system; network; spn", ABSTRACT="... we present a general scheme with which to view reduced loadapproximations in loss networks. We use notation motivated by stochastic Petri net representation of such models and a technique similar to that described by Ciardo and Trivedi for general SPNs. Previous reduced load approximations have involved link independence assumptions. In our method, we assume independence betweeen sets of links rather than between themselves. ...", } @ARTICLE{Demu93:Altbausanierung, AUTHOR="B. Demuth and F. Demuth", TITLE="Altbausanierung", JOURNAL=ix, ADDRESS="Germany", PAGES="136-142", YEAR=1993, LANGUAGE="German", REFERENCES=2, KEYWORDS="Database; sql", ABSTRACT="new features in SQL-92", } @INPROCEEDINGS{Drig93:Intelligente, AUTHOR="R. Drignath", TITLE="Intelligente Netze - Grundlagen, Dienste und Standardisierung", BOOKTITLE="Tutorium zur KiVS: Kommunikation in Verteilten Systemen", ADDRESS="München, Germany", PAGES="74-90", YEAR=1993, LANGUAGE="German", KEYWORDS="Architecture; in; intelligent network; isdn; overview; standardization; telephony", ABSTRACT="In dem Tutoriumsbeitrag werden, ausgehend von den Anforderungender Anwender und Betreiber, die Grundlagen der Architektur Intelligenter Netze dargestellt, wobei die bisherigen nordamerikanischen Entwicklungsaktivitäten über cksichtigt werden.", } @ARTICLE{Ebbe93:Coherent, AUTHOR="A. Ebberg and R. Noe and L. Stoll and R. Schimpe", TITLE="A Coherent {OFDM} Switching System for Flexible Optical Network Configuration", JOURNAL=ieeejlt, VOLUME=11, NUMBER=5, PAGES="847-852", YEAR=1993, REFERENCES=29, KEYWORDS="Optical switching; technology; wdm", ABSTRACT="A coherent optical switching node based on the combination of a frequency conversion stage with a space switching matrix is proposed for flexible interconnection of future integrated broadband communication networks. The basic system concept is presented together with the architecture of a demonstrator, which allows to study the functionality available in future networks.", } @INPROCEEDINGS{Elby9303:Wavelength, AUTHOR="S. D. Elby and A. S. Acampora", TITLE="Wavelength-based Cell Switching in {ATM} Multihop Optical Networks", BOOKTITLE=infocom, PAGES="953-963", MONTH="March/April", YEAR=1993, REFERENCES=12, KEYWORDS="Atm; multihop; network architecture; optical switching; shortest path", ABSTRACT="A novel optical multihop network architecture that uses wavelength-based cell-switching and that consists of optically separated passive star couplers interconnected by 2*2 electronic ATM switches (NIUs) is presented. A fixed assignment TDMA-WDMA scheme provides a means for sharing the passive star couplers bandwidth without cell collisions.Adaptive Shortest-Path cell routing exploits the multiplicity of paths in the multihop environment to red", } @ARTICLE{Feke9308:Formal, AUTHOR="A. Fekete", TITLE="Formal Models of Communication Services: A Case Study", JOURNAL=ieeecomp, VOLUME=26, NUMBER=8, PAGES="37-47", YEAR=1993, REFERENCES=10, KEYWORDS="In; intelligent network; specification", } @ARTICLE{Feld93:Shuffle, AUTHOR="R. Feldmann and P. Mysliwietz", TITLE="The shuffle exchange network has a Hamiltonian path", JOURNAL="Fachbereich Mathematik-Informatik Gesamthochschule Paderborn, Bericht 116", ADDRESS="Paderborn, Germany", PAGES=18, YEAR=1993, REFERENCES=13, KEYWORDS="Routing; shufflenet", ABSTRACT="We prove the existence of a Hamiltonian path in the Shuffle Exchange network SX(n). This problem has been posed as an open problem by Leighton, Samatham and Pradhan. Its positive solution hasseveral consequences showing the computational abilities of theSX(n).", } @ARTICLE{Frie93:Chancen, AUTHOR="J. Friese", TITLE="Chancen für {FDDIFDDI} in heterogenen Netzen", JOURNAL="Siemens KMT 13", ADDRESS="Germany", VOLUME=13, PAGES="8-10", YEAR=1993, LANGUAGE="German", KEYWORDS="Fddi; hslan; man; testing", ABSTRACT="The paper presents FDDI and the protocol tester K 1100 from Siemens.", } @ARTICLE{Fros93:Traffic, AUTHOR="Victor S. Frost and B. Melamed", TITLE="Traffic Modeling For Telecommunications Networks", JOURNAL=ieeecm, ISBN="0163-6804", ADDRESS="New York", PAGES="70-81", YEAR=1993, REFERENCES=50, KEYWORDS="Importance sampling; simulation; traffic generator; traffic model", ABSTRACT="A survey over different traffic models is given. Discrete-event simulation: description, advantages, usage Overview of traffic modeling basic definitions (interarrival time, compound traffic, traffic-generation, ...) traffic burstiness: (=clustering of arrival points); measures: (1) peak to mean rate; (2) coefficient of variation; (3) peakedness; (4) index-of-dispersion; Hurst parameter renewal traffic models: definition; Poisson processes; Ber", } @INPROCEEDINGS{Fuhr93:Digitale, AUTHOR="W. Fuhrmann and V. Brass and U. Janßen and F. K hl and W. Roth", TITLE="Digitale Mobilkommunikationsnetze", BOOKTITLE="Tutorium zur KiVS'93: Kommunikation in Verteilten Systemen", ADDRESS="München, Germany", PAGES="124-181", YEAR=1993, LANGUAGE="German", KEYWORDS="ISDN; mobile radio; network architecture; network management; overview; signalling; signalling protocol; tutorial", ABSTRACT="In diesem Beitrag wird das Dienstkonzept der neuen diensteintegrierenden digitalen GSM-Systeme vorgestellt und die Anforderungen an die Netzstruktur und die Netzfunktionen aufgezeigt Signalisierung Daten bermittlung Managementnetz zukünftige Entwicklungen.", } @INPROCEEDINGS{Ganz9303:Wavelength, AUTHOR="A. Ganz and Wei-Bo Gong and Xin Wang", TITLE="Wavelength Assignment in Multihop Lightwave Networks", BOOKTITLE=infocom, PAGES="1367-1374", MONTH="March/April", YEAR=1993, REFERENCES=12, KEYWORDS="Algorithm; channel assignment; multihop; wdm", ABSTRACT="In this paper we present a new approach to the design of multihop lightwave networks with connectivity patterns that can be dynamically reconfigured. We introduce a practical algorithm that efficiently reconfigures the connectivity diagram by reassigning wavelengths to best fit the current traffic pattern. A newly developed stochastic optimization algorithm is used to obtain the mapping of a regular structure into a WDM star, while optimizing t", } @ARTICLE{Glad9302:Novel, AUTHOR="M. Glade and H. J. Keller", TITLE="Novel Algorithm for Time Division Multiple Access in Broadband {ISDN} Passive Optical Networks", JOURNAL=dacs, VOLUME=6, NUMBER=2, PAGES="55-62", YEAR=1993, LANGUAGE="english", REFERENCES=10, KEYWORDS="Atm; b-isdn; media access control; tdma; access network", ABSTRACT="For shared access to a broadband communication network using the asynchronous transfer mode (ATM) a passive optical network (PON) has previously been proposed. A novel algorithm to evaluate the time division multiple access (TDMA) protocol which controls the traffic from the various subscribers towards the shared access equipment (upstream direction) is proposed. It uses counters to estimate the moment of a data packet arrival at the subscriber", } @ARTICLE{Gott93:Zeichengabetechnische, AUTHOR="H. Gottschalk", TITLE="Zeichengabetechnische Anbindung digitaler Mobilfunknetze an das Festnetz der Telekom", JOURNAL="ITG Fachbericht 124: Vorträge der ITG-Fachtagung Mobile Kommunikation", ADDRESS="Germany", PAGES="249-261", YEAR=1993, LANGUAGE="German", KEYWORDS="Ccs; cellular system; mobile radio; overview; signalling; telephony", ABSTRACT="Telekom stellt verschieden Zeichengabeschnittstellen für die Anbindung der Funknetze zur Verf gung, so den ZGS Nr.7 ISDN user Part und den ZGS Nr.7 Signalling Connection Control Part. ...", } @BOOK{Gree93:Fiber, AUTHOR="P. E. Green", TITLE="Fiber Optic Networks", ISBN="0-13-319492-2", PUBLISHER="Prentice-Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1993, KEYWORDS="Cdma; fdma; fiber optics; filter; multiple access; network; optical lan; optical switching; overview; tdma; wdm", ABSTRACT={In "Fiber Optic Networks", Paul Green updates the conventional material, focusing on the dynamic developments in fiber optic networks and treating point-to-point links and one-to-many distribution systems as special cases.}, } @ARTICLE{Gree9305:Packet, AUTHOR="P. E. Green and L. A. Coldren and Kenneth Johnson and John Lewis and others", TITLE="All-Optical Packet-Switched Metropolitan-Area Network Proposal", JOURNAL=ieeejlt, VOLUME=11, NUMBER=5, PAGES="754-762", YEAR=1993, REFERENCES=30, KEYWORDS="Man; network architecture; packet switching", ABSTRACT="This paper describes a proposal submitted to DARPA in late 1991 by a consortium consisting of IBM, Los Alamos National Laboratory, .. to develop a precompetitive, commercially viable all-optical network architecture using dense optical wavelength division. The objective was to demonstrate a packet-switched, high-capacity all-optical LAN/MAN network based on WDM capable of supporting several hundred to a thousand nodes, each requiring gigabit-p", } @ARTICLE{Grif9308:Extending, AUTHOR="N. Griffeth and Y. Lin", TITLE="Extending Telecommunications Systems: The Feature-Interaction Problem", JOURNAL=ieeecomp, VOLUME=26, NUMBER=8, PAGES="14-18", YEAR=1993, REFERENCES=7, KEYWORDS="In; intelligent network", } @ARTICLE{Gril93:Traffic, AUTHOR="D. Grillo", TITLE="Traffic Engineering for Mobile Radio Networks", JOURNAL="ITG Fachbericht 124: Vorträge der ITG-Fachtagung Mobile Kommunikation", ADDRESS="Germany", PAGES="477-485", YEAR=1993, REFERENCES=6, KEYWORDS="In; intelligent network; mobile radio; standardization; survey; traffic engineering", ABSTRACT="This paper describes the teletraffic standardizatin activities within ITU TSS (formerly CCITT) on the subject of mobile services. It also anticipates the planned traffic engineering activity on UPT (Universal Personal Telecommunication) services.", } @BOOK{Harr93:Modelling, AUTHOR="P. G. Harrison and N. M. Patel", TITLE="Performance Modelling of Communication Networks and Computer Architectures", PUBLISHER="Addison-Wesley", YEAR=1993, KEYWORDS="Analysis; approximation; bcmp; blocking; closed queueing network; communication network; computer architecture; decomposition; diffusion approximation; multiclass queueing network;open queueing network; performance model; priority", } @ARTICLE{Hill9305:Transport, AUTHOR="G R Hill and P. J. Chidgey and F. Kaufhold and T. Lynch and others", TITLE="A Transport Network Layer Based on Optical Network Elements", JOURNAL=ieeejlt, VOLUME=11, NUMBER=5, PAGES="667-676", YEAR=1993, REFERENCES=28, KEYWORDS="Field trial; network layer; switching system; technology; transport layer; wan; wdm", ABSTRACT="This paper presents an approach to the realization of a future broad-band flexible transport network employing an optical network layer. The design methodology for a network demonstrator is presented and a description of the subsystem and component technology developments described. The work presented is the subject of the RACE R2028 MWTN project.", } @BOOK{Hint93:Photonic, AUTHOR="H. S. Hinton", TITLE="An Introduction to Photonic Switching Fabrics", PUBLISHER="Application of Communications Theory, Plenum", YEAR=1993, KEYWORDS="Architecture; interconnection network; optical switching; shufflenet; switching", ABSTRACT="... the book examines:Proposed systems based on optically transparent devices, Optical logic devices and their applications, Optical hardware for switching fabrics based on logic devices and free-space optical interconnection, systems that can be implemented using logic devices.", } @ARTICLE{Huan93:Refined, AUTHOR="Yao-yu Huang and S. U. Guan", TITLE="A Refined Cut-Through Buffer Management Scheme for Layered Protocol Stacks", JOURNAL=ieeecm, ISBN="0163-6804", ADDRESS="New York", PAGES="82-85", YEAR=1993, REFERENCES=3, KEYWORDS="Buffer management; protocol layer; protocol performance", ABSTRACT="A simple pointer-variable updating technique in the sending phase of a refined buffer cut-through scheme is presented. One disadvantage of OSI and layered communication models is their effect on performance. This paper addresses one of the performance issues: buffer allocation and management. Their exist two buffer cut-through strategies, in which buffers passed through a layer remain unaltered and data copying is not required. (1) Chaining h", } @ARTICLE{Jian93:Distributed, AUTHOR="X. Jiang", TITLE="Distributed path finding algorithm for stream multicast", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", VOLUME=26, PAGES="767-775", YEAR=1993, REFERENCES=12, KEYWORDS="Multicast; routing", ABSTRACT="Stream multicast has been proposed to address the special requirements of a range of new communications services such as desktop video conferencing. Although there have been discussions on its centralized path finding algorithms, no schemes have yet been designed on a fully distributed basis. This paper presents a distributed algorithm for stram multicast path finding based on very limited local information.", } @ARTICLE{Joha9305:Optical, AUTHOR="S. Johansson and M. Lindblom and P. Granestrand and others", TITLE="Optical Cross-Connect System in Broad-Band Networks: System Concept and Demonstrators Description", JOURNAL=ieeejlt, VOLUME=11, NUMBER=5, PAGES="688-694", YEAR=1993, REFERENCES=18, KEYWORDS="Cross connect; field trial; optical switching; technology; wdm", ABSTRACT="This paper describes two optical CC demonstrators. The first one demonstrates routing of subscriber signals to different service switches in a local exchange. Space switches, tunable lasers and filters are key technologies used to obtain enhanced flexibility in a transparent wavelength-routed network. Optical amplifiers are needed in order to maintain the signal level through an optical node. With new technology, larger monolithit matrices can", } @BOOK{Kash93:Optical, AUTHOR="N. Kashima", TITLE="Optical Transmission for the Subscriber Loop", ISBN="0-89006-679-5", PUBLISHER="The Artech House Optoelectronics Library, Artech House", ADDRESS="Boston, Massachusetts", YEAR=1993, REFERENCES=267, KEYWORDS="Fiber optics; hardware; optical switching; subscriber premises network; transmission; access network", } @ARTICLE{Kell9304:Optical, AUTHOR="H. J. Keller and M. Glade and B. Hartl and C. Horbach", TITLE="Optical Broadband Access Using {ATM} on a Passive Optical Network", JOURNAL=dacs, VOLUME=6, NUMBER=4, PAGES="143-149", YEAR=1993, LANGUAGE="english", REFERENCES=13, KEYWORDS="Atm; b-isdn; tdma; access network", ABSTRACT="Within the framework of the FITL (fibre in the loop) evolution, Siemens is developing a prototype based on a passive optical network (PON) for the economic provision of BISDN in the subscriber access area. It provides 32 subscribers with BISDN access up to a maximum user data rate of 45 Mbit/s per subscriber. The information is transferred via ATM cells and PON-specific overhead in both directions on the PON at a data rate of 155.52 Mbit/s. For", } @ARTICLE{Kett9304:Optische, AUTHOR="H. G. Kettler", TITLE="Optische Vermittlung und Netze", JOURNAL="Informationstechnik und Technische Informatik (it+ti)", ADDRESS="Germany", VOLUME=35, NUMBER=4, PAGES="39-46", YEAR=1993, REFERENCES=23, KEYWORDS="Network architecture; optical switching; technology; tutorial", ABSTRACT="Dieser Beitrag betrachtet die Möglichkeiten der optischen Vermittlung, aber auch die durch technologische Barrieren bestehenden Grenzen.", } @BOOK{Klei93:Practioner, AUTHOR="M. Klein and T. Ralya and B. Pollak and R. Obenza and M. G. Harbour", TITLE="A Practioner's Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems", ISBN="0-7923-9361-9", PUBLISHER="The Kluwer Internat. Series in Engineering and Computer Science, Kluwer Academic Publishers", ADDRESS="Dordrecht, Netherlands", YEAR=1993, REFERENCES=62, KEYWORDS="Real time; software engineering; system evaluation; timing problem", ABSTRACT="A Practioner's Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems contains a collection of quantitative methods that enable realtime system developers to understand, analyze, and predict the timing behaviour of many real-time sytems. The methods are practical and theoretically sound, and can be used to assess design tradeoffs and to troubleshoot sytem timing behaviour. This collection of methods is called ra", } @ARTICLE{Kobb93:Personal, AUTHOR="B. Z. Kobb", TITLE="Personal Wireless", JOURNAL=ieeespec, PAGES="20-25", YEAR=1993, KEYWORDS="Mobile radio; packet radio", } @BOOK{Krus93:Neue, AUTHOR="W. Krusch", TITLE="Neue Dienste im intelligenten Telefonnetz", SERIES="Taschenbuch Telekommuniaktion", PUBLISHER="R.v.Decker", ADDRESS="Germany", VOLUME=13, YEAR=1993, LANGUAGE="German", KEYWORDS="Implementation; in; intelligent network; overview; standardization; telephony", ABSTRACT="Mit den neuen Diensten im intellienten Telefonnetz stellt DBP Telekom differenziert und bedarfsorientiert Kommunikationslösungen f r ihre Kunden bereit. Im vorliegenden Buch werden die bisherigen und neuen Angebote - Sprach-Mehrwertdienste - im Detail beschrieben.", } @INPROCEEDINGS{Krus93:Intelligentes, AUTHOR="W. Krusch", TITLE="Intelligentes Netz: Entwicklung, Einsatz und Pläne aus der Sicht der Deutschen Bundespost Telekom", BOOKTITLE="Tutorium zur KiVS'93: Kommunikation in Verteilten Systemen", ADDRESS="München, Germany", PAGES="63-73", YEAR=1993, LANGUAGE="German", KEYWORDS="In; intelligent network; isdn; overview; telephony", ABSTRACT={Mit dem Konzept "Intelligentes Netz (IN) will die Telekom ..neue Dienste im Telefondienstbereich systematisch, marktgerechtund wirtschaftlich im Telefonnetz/ISDN realisieren.}, } @ARTICLE{Kuhn9308:Improving, AUTHOR="R. Kuhn and P. Edfors and V. Howard and C. Caputo and T. S. Phillips", TITLE="Improving Public Switched Network Security in an Open Environment", JOURNAL=ieeecomp, VOLUME=26, NUMBER=8, PAGES="32-35", YEAR=1993, REFERENCES=8, KEYWORDS="Open network; public network; security; standardization", ABSTRACT="Recognizing that the public switched network is increasingly vulnerable to hostile users, the federal government has stepped up efforts to maintain the integrity of telecommunications services.", } @ARTICLE{Kuis9308:Practical, AUTHOR="E. Kuisch and R. Janmaat and H. Mulder and I. Keesmaat", TITLE="A Practical Approach to Service Interactions", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=31, NUMBER=8, PAGES="24-31", YEAR=1993, REFERENCES=5, KEYWORDS="IN; intelligent network", ABSTRACT="A study of some of the Dutch PTT's test services has produced a first attempt at resolving unwanted interactions between IN services at the specification level.", } @ARTICLE{Kunt93:CAN, AUTHOR="W. Kuntz and R. Mores", TITLE="{CAN} Operated on an Optical Double Ring at Improved Fault-Tolerance", JOURNAL=ett, ADDRESS="Italy", VOLUME=4, NUMBER=4, PAGES="465-470", YEAR=1993, REFERENCES=6, KEYWORDS="Fault tolerance; lan; ring network", ABSTRACT="The use of a fibre optic ring with a multiple access protocol designed to work on an electrical bus is investigated in this study. An algorithm is presented for interfacing the existing network controller with an optical double ring in such a way that thering appears to be the equivalent of an electrical bus. The trade-off between cost and performance for a double ring in this application is acceptable and the inherent redundancy in the topol", } @ARTICLE{Kusc93:Temposteigerung, AUTHOR="M. Kuschke", TITLE="Temposteigerung", JOURNAL=ix, ADDRESS="Germany", PAGES="144-147", YEAR=1993, LANGUAGE="German", REFERENCES=3, KEYWORDS="Ethernet; hslan; lan", ABSTRACT="Survey on the 100 MBit/s Ethernet spezifications 100Base-VG and100Base-X", } @BOOK{Lee93:Broadband, AUTHOR="B.-J. Lee and M. Kang and John Lee", TITLE="Broadband Telecommunications Technology", PUBLISHER="Artech House", ADDRESS="Great Britain", YEAR=1993, KEYWORDS="Atm; broadband; high speed; overview; sdh; video telephony", } @INPROCEEDINGS{Lee9303:Routing, AUTHOR="K. Y. Lee and V. Li", TITLE="Routing and Switching in a Wavelength Convertible Optical Network", BOOKTITLE=infocom, PAGES="578-585", MONTH="March/April", YEAR=1993, REFERENCES=16, KEYWORDS="Cross connect; routing; routing algorithm; wdm", ABSTRACT="A wavelength convertible switch architecture and routing algorithm for circuit-switched WDM optical networks is studied in this paper. Wavelength converters are used to resolve wavelength conflicts and to reuse wavelengths. These converters are not dedicated to individual channels, but are shared by the channels of a node or those of an outbound link in the share-per-node or the share-per-link wavelength convertible switch, respectively. A rout", } @ARTICLE{Lo93:Tone, AUTHOR="M. K. Lo and Takshing P. Yum", TITLE="The Tone Sense Multiaccess Protocol with Partial Collision Detection {(TSMA/PCD)} for Packet Satellite Communications)", JOURNAL=ieeecom, VOLUME=41, NUMBER=6, PAGES="820-824", YEAR=1993, REFERENCES=7, KEYWORDS="Collision detection; multiple access", ABSTRACT="The Tone Sense Multiaccess with Partial Collision Detection (TSMA/PCD) protocol is particularly suitable for a packet satellitesystem serving an area with a dense population of earth stations. By incorporating a narrow-band ground radio channel for broadcasting busy tones, the earth stations are able to avoid packet collisions by sensing for the absence of busy tones before transmitting packets.", } @BOOK{Mach93:Lexikon, AUTHOR="W. Mache", TITLE="Lexikon der Text- und Datenkommunikation", PUBLISHER="Oldenbourg-Verlag", ADDRESS="München, Germany", YEAR=1993, LANGUAGE="German", KEYWORDS="Data communication; overview", } @ARTICLE{Matt93:Efficient, AUTHOR="F. Mattern", TITLE="Efficient Algorithms for Distributed Snapshots and Global VirtualTime Approximation", JOURNAL=jpdc, VOLUME=18, PAGES="423-434", YEAR=1993, REFERENCES=27, KEYWORDS="Distributed simulation; virtual time", ABSTRACT="This paper presents snapshot algorithms for determining a consistent global state of a distributed system without significantlyaffecting the underlying computation. These algorithms do not require channels to be FIFO or messages to be acknowledged. Only a small amount of storage is needed. An important application ofa snapshot algorithm is Global Virtual Time determination for distributed simulation.", } @ARTICLE{Mayl93:Network, AUTHOR="A. D. Malyan and L. J. Ng and Victor C. M. Leung and R. W. Donaldson", TITLE="Network Architecture and Signaling for Wireless Personal Communications", JOURNAL=ieeejsac, VOLUME=11, NUMBER=2, PAGES="830-841", YEAR=1993, LANGUAGE="English", REFERENCES=19, KEYWORDS="Database; ieee 802.6; in; intelligent network; man; mobile radio; network architecture; signalling", ABSTRACT="The personal communications concept includes a ubiquitous telecommunications network to service both fixed and mobile wireless terminals. ... A distributed microcellular architecture based onthe IEEE 802.6 Metropolitan Area Network is proposed ... A method is presented to calculate MAN coverage in urban areas ... A distributed subscriber database architecture is proposed to facilitate call setup, tracking of roamers ... To fully utilize MAN ba", } @ARTICLE{Mier9308:Service, AUTHOR="J. Mierop and S. Tax and R. Janmaat", TITLE="Service Interaction in an Object-Oriented Environment", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=31, NUMBER=8, PAGES="46-51", MONTH="Aug", YEAR=1993, REFERENCES=5, KEYWORDS="IN; intelligent network", ABSTRACT="An object-oriented environment makes it easier for a service designer to model and analyze the effects of introducing a new service -- and to resolve any service interference.", } @INPROCEEDINGS{Nyen93:Approaches, AUTHOR="A. Nyeng and B. Møller-Pedersen", TITLE="Approaches to the specification of Intelligent Network Services in {SDL-92}", BOOKTITLE="6th SDL Forum", PAGES="427-440", YEAR=1993, REFERENCES=5, KEYWORDS="In; intelligent network; sdl", ABSTRACT="This paper describes how SDL-92 and the object oriented concepts in the language can be used to specify Intelligent Network Services. The focus is on how to compose IN services using types, context parameters and gates. Different alternatives are investigated depending on the underlying assumptions for the IN model.", } @ARTICLE{Reyn93:Hardware, AUTHOR="P. F. Reynolds and C. M. Pancerella and Sengamedu Hanumantharao Srinivasan", TITLE="Design and Performance Analysis of Hardware Support for Parallel Simulations", JOURNAL=jpdc, VOLUME=18, PAGES="435-453", YEAR=1993, REFERENCES=38, KEYWORDS="Distributed simulation; hardware; performance evaluation", ABSTRACT={It has been established elsewhere that hardware to support parallel discrete event simulations (PDES) is desirable. We describe the steps leading to the implementation of a hardware-based framework to support PDES. We begin with an exploration of the criteria that must be met to make such a framework both practical and useful, concluding that maintenance of sequential consistency is sufficient, while "observable" sequential consistency is more}, } @PHDTHESIS{Ries93:Model, AUTHOR="M. Riese", TITLE="Model-Based Diagnosis of Communication Protocols", SCHOOL="Ecole Polytechnique Federale de Lausanne, Departement d' Informatique", ADDRESS="Lausanne, Switzerland", VOLUME=1173, YEAR=1993, REFERENCES=139, KEYWORDS="Heuristics; model; network management; protocol", } @ARTICLE{Rssi93:Übersicht, AUTHOR="K. Rössig", TITLE="Eine Übersicht über aktuelle Ansätze zur verteilten optimistischen Simulation", JOURNAL="Arbeitsgruppe Informatik-Systeme, FB Informatik - Universität Oldenburg", ADDRESS="Oldenburg, Germany", VOLUME=11, PAGES=41, YEAR=1993, LANGUAGE="German", REFERENCES=40, KEYWORDS="Distributed simulation; overview; simulation; survey; time warp", ABSTRACT="Dieser Bericht gibt einen Überblick über die in der aktuellen Literatur vorgestellten Ansätze zur Verbesserung des Time-Warp-Verfahrens. Als vielversprechend erweist sich dabei zum einen die Einführung von Simulationszeit-Fenstern und zum anderen eine dynamische Lastverteilung", } @INPROCEEDINGS{Rubi9303:FECCA, AUTHOR="I. Rubin and Ho-Ting Wu", TITLE="{FECCA} - A New Access Algorithm for an {ATM} Ring Network with Destination Removal", BOOKTITLE=infocom, PAGES="368-375", MONTH="March/April", YEAR=1993, REFERENCES=6, KEYWORDS="Access protocol; ATM; slotted ring", } @ARTICLE{Russ9303:IN, AUTHOR="P. A. Russo and K. Bechard and E. D. Brooks and R. L. Corn and R. D. Gove", TITLE="{IN} Rollout in the United States", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=31, NUMBER=3, PAGES="56-69", YEAR=1993, KEYWORDS="Implementation; IN; intelligent network; overview", ABSTRACT="The advanced intelligent network is a flexible architecture that is allowing regional companies to custom-design services and quickly bring them to market.", } @ARTICLE{Sasa93:Photonic, AUTHOR="K. Sasayama and M. Okuno and K. Habara", TITLE="Photonic {FDM} Highway Switch Using Coherent Optical Transversal Filter", JOURNAL=ieeejlt, VOLUME=11, NUMBER=5, PAGES="347-351", YEAR=1993, REFERENCES=6, KEYWORDS="Optical switching; technology; wdm", ABSTRACT="This paper proposes a photonic FDM highway switch which consists of multi-frequency chanel selectors using coherent optical transversal filters. The selector can select several arbitrary channels out of multiple multiplexec frequency channels. The selector function utilizes that the filter can express arbitrary frequency characteristics.", } @INPROCEEDINGS{Seib93:HOPS, AUTHOR="W. Seibold and M. Götzer", TITLE="{HOPS:} Ein Hardware-optimierter Protokollsimulator f r Hochgeschwindigkeits-LANs", BOOKTITLE="ITG-Diskussionssitzung Anwendung moderner Simulationswerkzeuge in der Nachrichten", ADDRESS="Kaiserslautern, Germany", PAGES="9-9", YEAR=1993, LANGUAGE="German", KEYWORDS="Discrete event simulation; distributed simulation; hardware; simulation", } @INPROCEEDINGS{Spel93:Betriebsversuch, AUTHOR="E. Speller", TITLE="{IN} Betriebsversuch, Lösungen und Implementierung", BOOKTITLE="Tutorium zur KiVS: Kommunikation in Verteilten Systemen", ADDRESS="München, Germany", PAGES="107-123", YEAR=1993, LANGUAGE="German", KEYWORDS="Implementation; in; intelligent network; isdn; overview; telephony", ABSTRACT="Die Netzstruktur des IN Betriebsversuchs wird vorgestellt. ..Am Beispiel der gemeinsam von den Firmen Alcatel SEL und Digital bereitgestellten Realisierung wird beschrieben, wie das IN Konzept in die Praxis umgesetzt wurde.", } @ARTICLE{Stam93:Approximate, AUTHOR="G. D. Stamoulis and E. Sykas and E. Protonotarios", TITLE="Approximate Analysis of Buffered Multiple-Access Protocols", JOURNAL=ett, ADDRESS="Italy", VOLUME=4, NUMBER=3, PAGES="365-382", YEAR=1993, REFERENCES=17, KEYWORDS="Analysis; approximation; buffer; multiple access; protocol", ABSTRACT="A method for the approximate performance analysis of random multiple-access protocols, such as, ALOHA, URN, random TDMA, is presented. This method is an extension of a previously proposed 2-Markov chain method. It is applicable to systems consisting of a finite number of identical users, each having a buffer capacity of L packets, where L>2. The numerical results derived are in very good agreement with simulation.", } @ARTICLE{Tema93:UPT, AUTHOR="G. Teßmar", TITLE="{UPT} im Intelligenten Netz", JOURNAL="ITG Fachbericht 124: Vorträge der ITG-Fachtagung Mobile Kommunikation", PAGES="187-198", YEAR=1993, KEYWORDS="In; intelligent network; mobile radio", ABSTRACT="In diesem Beitrag werden die Merkmale von universeller persönlicher Telekommunikation (Universal Personal Telekommunication UPT) aus Netz und Anwendersicht dargestellt sowie mögliche Netzkopplungen für eine Diensteinführung im intelligenten Netz mit Zugang zu Endgeräten des Festnetzes (PSTN, ISDN) beschrieben. Insbesondere wird auf die Beziehung zum Mobilfunk eingegangen. Daraus werden Forderungen für die Standardisierung abgeleitet.", } @INPROCEEDINGS{VanE93:Tool, AUTHOR="P. Van Esbroek and K. Put", TITLE="A tool to evaluate response time distributions in an intelligent network environment", BOOKTITLE="St. Petersburg Regional ITC Seminar (Digital Communication Network Management)", YEAR=1993, REFERENCES=9, KEYWORDS="In; intelligent network; performance evaluation; tool", ABSTRACT="... To evaluate the time-critical response times related to theexchange of messages between different network elements an IN response time distribution evaluator has been built. In this paper the basic assumptions leading to the development of the evaluator and the different features of the tool are highlighted.", } @ARTICLE{Veni93:ATM, AUTHOR="I. S. Venieris and J. D. Angelopoulos and G. I. Strassinopoulos", TITLE="{ATM} traffic transfer via queued-arbitrated {DQDB}", JOURNAL=comcom, PUBLISHER="Butterworth-Heinemann Ltd.", VOLUME=16, PAGES="746-758", YEAR=1993, REFERENCES=32, KEYWORDS="Atm; dqdb", ABSTRACT="In this paper, we study several practically useful scenarios for the interworking of ATM Customer Premises Networks through a transit DQDB network. Sutiable Interworking Unit protocols are presented and compared. It is shown that the most advantageous solution in terms of service quality and IWU simplicity and robustness is the use of a Connection Oreinted DQDB service exploiting the Queued-Arbitrated mode of access", } @BOOK{Reno93:Neue, AUTHOR="H. von Renouard", TITLE="Neue Informations- und Kommunikationsdienste -- Information Services (Fachwörterbuch/Dictionary)", PUBLISHER="Hüthig-Verlag", ADDRESS="Germany", YEAR=1993, LANGUAGE="German", KEYWORDS="Information system; overview; dictionary; reference", } @ARTICLE{Wang93:Fully, AUTHOR="Jin-Tuu Wang", TITLE="A Fully Distributed Location Registration Strategy for Universal Personal Communication Systems", JOURNAL=ieeejsac, VOLUME=11, NUMBER=6, PAGES="850-860", YEAR=1993, REFERENCES=5, KEYWORDS="Database; distributed database; intelligent network; mobile radio", ABSTRACT="The Universal Personal Communication System (UPCS) is a system that enables anyone to communicate instantly with anyone else anywhere in the world. One of the crucial problems of such a system is locating hundreds og millions of moving portables in an effcient manner. The location registration stragedy described in this paper is able to locate active portables automatically in the system with a small overhead in a distributed fashion. ...", } @ARTICLE{Wats93:MAC, AUTHOR="G. N. Watson and S. Tohmé", TITLE="A Performance Analysis of {S++:} A {MAC} Protocol for High Speed Networks", JOURNAL="Protocols for High-Speed Networks, Elsevier Science Publishers, B.V. (North-Holland), IFIP 1993", ISBN="0 444 89925 1", ADDRESS="Amsterdam, Netherlands", PAGES="87-102", YEAR=1993, REFERENCES=8, KEYWORDS="Hslan; lan; protocol; protocol performance", } @ARTICLE{Zave93:Feature, AUTHOR="Pamela Zave", TITLE="Feature Interactions and Formal Specifications in Telecommunications", JOURNAL=ieeecomp, VOLUME=26, NUMBER=8, PAGES="20-29", YEAR=1993, REFERENCES=11, KEYWORDS="IN; intelligent network; specification", ABSTRACT="Rapid evolution of telecommunications technology has resulted in feature interactions, cases in which system behavior as a whole does not satisfy the separate feature specifications.", } @ARTICLE{Yemi9305:OSI, AUTHOR="Y. Yemini", TITLE="The {OSI} Network Management Model", JOURNAL=ieeecm, VOLUME=31, NUMBER=5, PAGES="20-29", MONTH="May", YEAR=1993, KEYWORDS="OSI; Network Management Model", ABSTRACT="Balancing the responsibilities of OSI's agents and platforms -- and their interaction protocols -- is complex, but OSI helps by offering functions lacking in Internet's SNMP.", } @ARTICLE{Bean9305:Specifying, AUTHOR="A. Bean and D. C. Wood and W. Fairclough", TITLE="Specifying Goal-Oriented Network Management Systems", JOURNAL=ieeecm, VOLUME=31, NUMBER=5, PAGES="30-37", MONTH="May", YEAR=1993, KEYWORDS="Goal-Oriented; Network Management Systems", ABSTRACT="The design of network management systems and their interfaces can be turned into an engineering discipline.", } @ARTICLE{Kler9305:System, AUTHOR="S. M. Klerer", TITLE="System Management Information Modeling", JOURNAL=ieeecm, VOLUME=31, NUMBER=5, PAGES="38-45", MONTH="May", YEAR=1993, KEYWORDS="System Management; Information Modeling", ABSTRACT="OSI techniques and tools successfully model telecommunications equipment, networks, and services -- and enhanced capabilities are on the way.", } @ARTICLE{Rama9305:CMISE, AUTHOR="Lakshmi G. Raman", TITLE="{CMISE} Functions and Services", JOURNAL=ieeecm, VOLUME=31, NUMBER=5, PAGES="46-51", MONTH="May", YEAR=1993, KEYWORDS="CMISE; Functions; Services", ABSTRACT="Service Element was developed to monitor the health of OSI communications entities.", } @ARTICLE{Haye9305:Analyzing, AUTHOR="Stephen Hayes", TITLE="Analyzing Network Performance Management", JOURNAL=ieeecm, VOLUME=31, NUMBER=5, PAGES="52-59", MONTH="May", YEAR=1993, KEYWORDS="Network Performance Management", ABSTRACT="OSI management principles and tools make it possible to develop a performance management model powerful enough for the 21st century.", } @ARTICLE{Fern9305:Using, AUTHOR="J. I. Fernandez and Kathrin Winkler", TITLE="Using {SMI} to Model {SNA} Networks", JOURNAL=ieeecm, VOLUME=31, NUMBER=5, PAGES="60-67", MONTH="May", YEAR=1993, KEYWORDS="SMI; SNA Networks", ABSTRACT="Two new approaches help manage SNA networks from non-SNA systems.", } @ARTICLE{Marc9305:Modeling, AUTHOR="Lucia Marchisio and Enrico Ronco and Roberto Saracco", TITLE="Modeling the User Interface", JOURNAL=ieeecm, VOLUME=31, NUMBER=5, PAGES="68-75", MONTH="May", YEAR=1993, KEYWORDS="User Interface; object-oriented modeling; human; machine", ABSTRACT="Object-oriented modeling of human-machine interfaces is appealing, but the generic network model may contain thousands of objects.", } @ARTICLE{Serr9305:Implementing, AUTHOR="J. M. Serre and Pierre Lewis and Ken Rosenfeld", TITLE="Implementing {OSI-Based} Interfaces for Network Management", JOURNAL=ieeecm, VOLUME=31, NUMBER=5, PAGES="76-81", MONTH="May", YEAR=1993, KEYWORDS="OSI-Based Interfaces; Network Management", ABSTRACT="A partially standardized network-management interface requires less effort to evolve than a completely proprietary solution.", } @ARTICLE{Fark9305:Managing, AUTHOR="Stephen C. Farkouh", TITLE="Managing {ATM-based} Broadband Networks", JOURNAL=ieeecm, VOLUME=31, NUMBER=5, PAGES="82-87", MONTH="May", YEAR=1993, KEYWORDS="ATM-based; Broadband Networks", ABSTRACT="Industry is reaching agreements on standard ATM-layer operations early in the BISDN development process.", } @ARTICLE{Stok9305:ISDN, AUTHOR="D. Stokesberry and S. Wakid", TITLE="{ISDN} in North America", JOURNAL=ieeecm, VOLUME=31, NUMBER=5, PAGES="88-94", MONTH="May", YEAR=1993, KEYWORDS="ISDN; North America", ABSTRACT="The North American ISDN Users' Forum is expediting the development of a national market-driven ISDN.", } @ARTICLE{Glos9306:Availability, AUTHOR="Kenneth C. Glossbrenner", TITLE="Availability and Reliability of Switched Services", JOURNAL=ieeecm, VOLUME=31, NUMBER=6, PAGES="28-33", MONTH="Jun", YEAR=1993, KEYWORDS="Availability; Reliability; Switched Services", ABSTRACT="Ever-increasing customer expectations are driving the emergence of standards for switched-service availability.", } @ARTICLE{Dane9306:Measuring, AUTHOR="Mahmoud Daneshmand and Catherine Savolaine", TITLE="Measuring Outages in Telecommunications Switched Networks", JOURNAL=ieeecm, VOLUME=31, NUMBER=6, PAGES="34-39", MONTH="Jun", YEAR=1993, KEYWORDS="Telecommunications Switched Networks", ABSTRACT="An appropriate framework allows us to measure the reliability of switched telecommunications services from the customer point of view and define a quantitative scale for measuring network outages.", } @ARTICLE{Nojo9306:Incorporating, AUTHOR="S. Nojo and Hitoshi Watanabe", TITLE="Incorporating Reliability Specifications in the Design of Telecommunication Networks", JOURNAL=ieeecm, VOLUME=31, NUMBER=6, PAGES="40-43", MONTH="Jun", YEAR=1993, KEYWORDS="Reliability Specifications; Telecommunication Networks", ABSTRACT="In order to keep the telecommunications network highly reliable, the reliability of the target network should be properly specified and evaluated, and the evaluation fed back to the network design.", } @ARTICLE{Fage9306:Reliability, AUTHOR="Richard Fagerstrom and J. D. Healy", TITLE="The Reliability of {LEC} Telephone Networks", JOURNAL=ieeecm, VOLUME=31, NUMBER=6, PAGES="44-49", MONTH="Jun", YEAR=1993, KEYWORDS="Reliability; LEC Telephone Networks", ABSTRACT="Local exchange carrier networks are very reliable, but we need a common outage information collection system all companies", } @ARTICLE{Manf9306:Congestion, AUTHOR="David R. Manfield and Greg Millsteed and Moshe Zukerman", TITLE="Congestion Controls in {SS7} Signaling Networks", JOURNAL=ieeecm, VOLUME=31, NUMBER=6, PAGES="50-59", MONTH="Jun", YEAR=1993, KEYWORDS="Congestion Controls; SS7 Signaling Networks", ABSTRACT="We draw together the descriptions of the various congestion-control functions for the common channel signaling system No, 7 (SS7), which are spread widely and piecemeal across the CCITT recommendations.", } @ARTICLE{Verb9306:FITL, AUTHOR="Willem Verbiest and Gert Van der Plas and Denis J. G. Mestdagh", TITLE="{FITL} and {B-ISDN:} A Marriage with a Future", JOURNAL=ieeecm, VOLUME=31, NUMBER=6, PAGES="60-67", MONTH="Jun", YEAR=1993, KEYWORDS="FITL; B-ISDN; Fiber optics", ABSTRACT="Fiber in the loop will be successful only if it allows a graceful evolution to B-IDSN.", } @ARTICLE{Wint9306:Reducing, AUTHOR="Jack H. Winters and R. D. Gitlin and S. Kasturia", TITLE="Reducing the Effects of Transmission Impairments in Digital Fiber Optic Systems", JOURNAL=ieeecm, VOLUME=31, NUMBER=6, PAGES="68-76", MONTH="Jun", YEAR=1993, KEYWORDS="Transmission Impairments; Digital Fiber Optic", ABSTRACT="Selecting appropriate signal processing techniques can reduce the effects of the major transmission impairments and provide higher data rates, improved error rates, or longer repeaterless spans.", } @ARTICLE{Wan9307:Overview, AUTHOR="S. J. Wan", TITLE="An Overview of Telecommunications Planning in China", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="18-19", MONTH="Jul", YEAR=1993, KEYWORDS="Telecommunications Planning; China", ABSTRACT="Fundamental and developmental plans.", } @ARTICLE{Chen9307:Driving, AUTHOR="Yunfei Chen", TITLE="Driving Forces Behind China's Explosive Telecommunications Growth", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="20-23", MONTH="Jul", YEAR=1993, KEYWORDS="China; Telecommunications Growth", ABSTRACT="Change in policies fuels growth.", } @ARTICLE{Qian9307:New, AUTHOR="ZongJue Qian", TITLE="New Concept and Hierarchy for Telecommunications Standards", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="24-29", MONTH="Jul", YEAR=1993, KEYWORDS="Telecommunications Standards", ABSTRACT="Expansion spurs new approach to standards.", } @ARTICLE{She9307:Telecommunications, AUTHOR="Qijiong She and Renlin Yu", TITLE="Telecommunications Services in China", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="30-33", MONTH="Jul", YEAR=1993, KEYWORDS="Telecommunications Services; China", ABSTRACT="Rapid progress in the public network.", } @ARTICLE{Lian9307:Network, AUTHOR="X. J. Liang", TITLE="Network Planning Methodology and Practice in China", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="34-37", MONTH="Jul", YEAR=1993, KEYWORDS="Network Planning; China; Network modeling; computer simulation", ABSTRACT="Network modeling, computer simulation, and planning software are the key tools.", } @ARTICLE{Liu9307:Satellite, AUTHOR="S. Liu", TITLE="Satellite and Terrestrial Microwave Communications in China", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="38-41", MONTH="Jul", YEAR=1993, KEYWORDS="Satellite; Terrestrial Microwave Communications; China", ABSTRACT="China's two major transmission infrastructures.", } @ARTICLE{Yao9307:R, AUTHOR="Richard Yao and Zhiruo Cao and Jin-Tuu Wang", TITLE="R \& D Activities on Wireless Systems in China", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="42-45", MONTH="Jul", YEAR=1993, KEYWORDS="Wireless Systems; China", ABSTRACT="An economical alternative to line transmission systems in sparsely populated areas.", } @ARTICLE{Qiu9307:Present, AUTHOR="Shouhuang Qiu", TITLE="Present Status and Outlook of Line Transmission Systems in China", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="46-47", MONTH="Jul", YEAR=1993, KEYWORDS="Line Transmission Systems; China; digital fiber transmission", ABSTRACT="A greater percentage of digital fiber transmission systems will be deployed.", } @ARTICLE{Ye9307:Status, AUTHOR="Peida Ye and Xiaomin Ren", TITLE="Status of R \& D for Optical Fiber Communications Systems in China", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="48-51", MONTH="Jul", YEAR=1993, KEYWORDS="Optical Fiber Communications; China", ABSTRACT="Years of extensive research have yielded significant achievements.", } @ARTICLE{Hao9307:Public, AUTHOR="Weimin Hao", TITLE="Public Switching Deployment in China", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="52-55", MONTH="Jul", YEAR=1993, KEYWORDS="Public Switching; China", ABSTRACT="Network converting from analog to digital, from manual to automatic control.", } @ARTICLE{Chen9307:Switching, AUTHOR="Jinghu Chen and Liemin Yan and Yuheng Li", TITLE="Switching Systems and Switching Software Development in China", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="56-61", MONTH="Jul", YEAR=1993, KEYWORDS="Switching Systems; Switching Software; China", ABSTRACT="A 100,000-subscriber line digital switching system to be completed this decade.", } @ARTICLE{Zhou9307:Overview, AUTHOR="B. Zhou", TITLE="An Overview of Optical Device Research in China", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="62-65", MONTH="Jul", YEAR=1993, KEYWORDS="Optical Device; China", ABSTRACT="Widespread telecommunications will become Commonplace.", } @ARTICLE{Feng9307:VLSI, AUTHOR="Chongxi Feng and Yixin Wang", TITLE="{VLSI} Technology in China", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="66-69", MONTH="Jul", YEAR=1993, KEYWORDS="VLSI Technology; China", ABSTRACT="Market will exceed one billion chips per year.", } @ARTICLE{Zhon9307:Advances, AUTHOR="Yi X. Zhong", TITLE="Advances in Coding and Compression", JOURNAL=ieeecm, VOLUME=31, NUMBER=7, PAGES="70-72", MONTH="Jul", YEAR=1993, KEYWORDS="Coding; Compression", ABSTRACT="Benefits will be realized in this decade.", } @ARTICLE{Moss9308:Path, AUTHOR="C. Mossotto", TITLE="Path ways for Telecommunications: A European Outlook", JOURNAL=ieeecm, VOLUME=31, NUMBER=8, PAGES="52-59", MONTH="Aug", YEAR=1993, KEYWORDS="Telecommunications; European", ABSTRACT="Telecommunications in the 90s depend on markets, new technologies, and the dynamics of regulatory processes.", } @ARTICLE{Suth9308:Internetworking, AUTHOR="S. L. Sutherland and J. L. Burgin", TITLE="{B-ISDN} Internetworking", JOURNAL=ieeecm, VOLUME=31, NUMBER=8, PAGES="60-63", MONTH="Aug", YEAR=1993, KEYWORDS="B-ISDN; Internetworking", ABSTRACT="B-ISDN can be used to establish communications between networks based on different technologies.", } @ARTICLE{Saka9308:Multimedia, AUTHOR="S. Sakata", TITLE="{B-ISDN} Multimedia Workstation Architecture", JOURNAL=ieeecm, VOLUME=31, NUMBER=8, PAGES="64-67", MONTH="Aug", YEAR=1993, KEYWORDS="B-ISDN; Multimedia Workstation Architecture", ABSTRACT="A consistent architecture from high-speed protocol processing to multimedia information handling is the design key to achieving efficient applications.", } @ARTICLE{Kuju9310:Systems, AUTHOR="Akihiko Kujuro and Hiroshi Yasuda", TITLE="Systems Evolution in intelligent Buildings", JOURNAL=ieeecm, VOLUME=31, NUMBER=10, PAGES="22-27", MONTH="Oct", YEAR=1993, KEYWORDS="intelligent Buildings; automation services", ABSTRACT="Upgraded information processing and communications functions of building automation services have enhanced the quality of building services.", } @ARTICLE{Moti9310:Building, AUTHOR="Juzar Motiwalla and Ma-Tit Yap and L. H. Ngoh", TITLE="Building the Intelligent Island", JOURNAL=ieeecm, VOLUME=31, NUMBER=10, PAGES="28-35", MONTH="Oct", YEAR=1993, KEYWORDS="Intelligent Island; Singaprot", ABSTRACT="Singapore plans to provide its people with easy access to national on-line information by the year 2000.", } @ARTICLE{Kish9310:Virtual, AUTHOR="Tomio Kishimoto and Gen Suzuki", TITLE="Virtual Offices", JOURNAL=ieeecm, VOLUME=31, NUMBER=10, PAGES="36-39", MONTH="Oct", YEAR=1993, KEYWORDS="Virtual Offices; remote communication", ABSTRACT="The advent of virtual electronic spaces will provide a flexible environment for remote communication.", } @ARTICLE{Hust9310:Intelligent, AUTHOR="Dryver R. Huston and Peter L. Fuhr", TITLE="Intelligent Materials for Intelligent Structures", JOURNAL=ieeecm, VOLUME=31, NUMBER=10, PAGES="40-45", MONTH="Oct", YEAR=1993, KEYWORDS="Intelligent Materials; Intelligent Structures; information networks", ABSTRACT="Information networks in buildings can carry data on wind loading and structural damage, as well as telecommunications, security, and HVAC data.", } @ARTICLE{Azeg9310:Systematic, AUTHOR="Moriaki Azegami and Hideaki Fujiyoshi", TITLE="A Systematic Approach to Intelligent Building Design", JOURNAL=ieeecm, VOLUME=31, NUMBER=10, PAGES="46-49", MONTH="Oct", YEAR=1993, KEYWORDS="Intelligent Building; IB; FINEBIL", ABSTRACT="Fujitsu's FINEBIL concept integrates IB marketing engineering and construction", } @ARTICLE{Ishi9310:Internetworked, AUTHOR="Mamoru Ishibashi and Kazuo Ishidawa and Tomonori Hira and M. R. Ito", TITLE="Internetworked {PBX-Computer} Systems for Intelligent Building Applications", JOURNAL=ieeecm, VOLUME=31, NUMBER=10, PAGES="50-51", MONTH="Oct", YEAR=1993, KEYWORDS="PBX-Computer Systems; Intelligent Building Applications; Japan", ABSTRACT="Computer information networks in Japanese office buildings accommodate the needs of businesses and individual workers.", } @ARTICLE{Doul9310:Intelligent, AUTHOR="C. Douligeris", TITLE="Intelligent Home Systems", JOURNAL=ieeecm, VOLUME=31, NUMBER=10, PAGES="52-61", MONTH="Oct", YEAR=1993, KEYWORDS="Intelligent Home Systems", ABSTRACT="Low-cost computers and fiber optics make it possible to implement systems that can integrate data, voice, and visual communications inside the home.", } @ARTICLE{Zovk9310:War, AUTHOR="Branka Zovko-Cihlar", TITLE="War Damage to the Telecommunications Infrastructure in Croatia", JOURNAL=ieeecm, VOLUME=31, NUMBER=10, PAGES="62-67", MONTH="Oct", YEAR=1993, KEYWORDS="War; Telecommunications Infrastructure; Croatia", ABSTRACT="An estimated 25 percent of the telecommunications infrastructure in Croatia has been destroyed, while projected rebuilding costs are at least $500 million.", } @ARTICLE{Jajs9310:Telecommunication, AUTHOR="A. Jajszczyk and Jerzy Kubasik", TITLE="Telecommunication Tariffs in Central Europe", JOURNAL=ieeecm, VOLUME=31, NUMBER=10, PAGES="68-73", MONTH="Oct", YEAR=1993, KEYWORDS="Telecommunication Tariffs; Central Europe", ABSTRACT="The formerly communist countries of Central Europe urgently need management accounting data to set rational tariffs.", } @ARTICLE{Dimo9311:Standardizing, AUTHOR="Spiros Dimolitsas", TITLE="Standardizing Speech-Coding Technology for Network Applications", JOURNAL=ieeecm, VOLUME=31, NUMBER=11, PAGES="26-33", MONTH="Nov", YEAR=1993, KEYWORDS="Speech-Coding", ABSTRACT="Some uniformity in coding techniques is needed if low-rate speech-coding systems are to offer optimum quality with economic viability.", } @ARTICLE{Noll9311:Wideband, AUTHOR="Peter Noll", TITLE="Wideband Speech and Audio Coding", JOURNAL=ieeecm, VOLUME=31, NUMBER=11, PAGES="34-45", MONTH="Nov", YEAR=1993, KEYWORDS="Wideband Speech; Audio Coding", ABSTRACT="Powerful algorithms and standards are now available to enhance services in communication- based and storage-based audio-only and audio- visual applications.", } @ARTICLE{Levi9311:Speech, AUTHOR="Stephen E. Levinson and Joseph P. Olive and Judith S. Tschirgi", TITLE="Speech Synthesis in Telecommunications", JOURNAL=ieeecm, VOLUME=31, NUMBER=11, PAGES="46-53", MONTH="Nov", YEAR=1993, KEYWORDS="Speech Synthesis; Telecommunications", ABSTRACT="Synthesis of speech from unrestricted text is now commercially viable for telecommunications applications.", } @ARTICLE{Roe9311:Whither, AUTHOR="David B. Roe and J. G. Wilpon", TITLE="Whither Speech Recognition: The Next 25 Years", JOURNAL=ieeecm, VOLUME=31, NUMBER=11, PAGES="54-63", MONTH="Nov", YEAR=1993, KEYWORDS="Speech Recognition", ABSTRACT="In 25 years, speech recognition has evolved from a ``futile'' endeavor to commercial reality.", } @ARTICLE{Snyd9311:Tools, AUTHOR="J. H. Snyder and Schuyler R. Quackenbush and Melvin J. Melchner and David A. Kapilow", TITLE="Tools for Real-Time Signal-Processing Research", JOURNAL=ieeecm, VOLUME=31, NUMBER=11, PAGES="64-75", MONTH="Nov", YEAR=1993, KEYWORDS="Real-Time Signal-Processing; speech-processing", ABSTRACT="Tools that facilitate the transfer of speech- processing algorithms from mainframes or workstations to DSP hardware.", } @ARTICLE{Stee9311:Speech, AUTHOR="Raymond Steele", TITLE="Speech Codecs for Personal Communications", JOURNAL=ieeecm, VOLUME=31, NUMBER=11, PAGES="76-83", MONTH="Nov", YEAR=1993, KEYWORDS="Speech Codecs; Personal Communications", ABSTRACT="For a standard to be accepted, it must meet the needs of its users, and these needs should be reflected in the requirements promulgated by the standards body.", } @ARTICLE{Kuni9311:Synchronous, AUTHOR="Toshinari Kunieda and Satoru Sugimoto and Noriyuki Sasaki", TITLE="A Synchronous Digital Hierarchy Network Management system", JOURNAL=ieeecm, VOLUME=31, NUMBER=11, PAGES="84-91", MONTH="Nov", YEAR=1993, KEYWORDS="Synchronous Digital Hierarchy; Network Management system; TMN", ABSTRACT="An equipment-independent TMN architecture can avoid backlogs and the problems of multi-vendor environments.", } @ARTICLE{Skla9311:Defining, AUTHOR="B. Sklar", TITLE="Defining, Designing, and Evaluating Digital Communication Systems", JOURNAL=ieeecm, VOLUME=31, NUMBER=11, PAGES="92-101", MONTH="Nov", YEAR=1993, KEYWORDS="Digital Communication Systems", ABSTRACT="A tutorial that emphasizes the subtle but straightforward relationships we encounter when transforming from data-bits to channel-bits to symbols to chips.", } @ARTICLE{Alle9312:View, AUTHOR="R. Allen", TITLE="A View of Divestiture, Ten Years Later", JOURNAL=ieeecm, VOLUME=31, NUMBER=12, PAGES="18-19", MONTH="Dec", YEAR=1993, ABSTRACT="There's a promising new world ahead for us, especially if we make sure it's the customer who finally determines its shape, not the government, not the scientists, not the CEOs.", } @ARTICLE{Vall9312:Customers, AUTHOR="Lain Vallance", TITLE="Customers Must Be the Industry's Driving Force", JOURNAL=ieeecm, VOLUME=31, NUMBER=12, PAGES="20-23", MONTH="Dec", YEAR=1993, KEYWORDS="MFJ; telecom policy; deregulation", ABSTRACT="The MFJ was far more than a watershed U.S. domestic policy shift; it heralded a worldwide change. Moving the customer to the forefront, the MFJ set into motion trends gaining momentum even now.", } @ARTICLE{McCo9312:Re, AUTHOR="Richard McCormick", TITLE="Re-Inventing the Telephone Industry", JOURNAL=ieeecm, VOLUME=31, NUMBER=12, PAGES="24-26", MONTH="Dec", YEAR=1993, KEYWORDS="Telephone", ABSTRACT="The challenge for engineers today is to adapt to this new world order, and to help their companies and society adapt, as well.", } @ARTICLE{Clen9312:Chasm, AUTHOR="John L. Clendenin", TITLE="The Chasm Between Competition and Regulation and the {MFJ}", JOURNAL=ieeecm, VOLUME=31, NUMBER=12, PAGES="27-29", MONTH="Dec", YEAR=1993, KEYWORDS="MFJ", ABSTRACT="What has not occurred in this ten years...is serious movement toward resolving the regulatory, pricing, and subsidy questions that must inevitably accompany the steady journey toward more competition.", } @ARTICLE{Heil9312:Strategic, AUTHOR="George H. Heilmeier", TITLE="Strategic Technology for the Next Ten and Beyond", JOURNAL=ieeecm, VOLUME=31, NUMBER=12, PAGES="30-35", MONTH="Dec", YEAR=1993, KEYWORDS="Bellcore", ABSTRACT="One of the greatest contributions technological development can make is in systematically, carefully, intentionally building a national infrastructure for information exchange.", } @ARTICLE{Wile9312:Can, AUTHOR="Richard E. Wiley and Robert J. Butler", TITLE="Can Information Markets Survive the Transition to Local Exchange Competition?", JOURNAL=ieeecm, VOLUME=31, NUMBER=12, PAGES="57-59", MONTH="Dec", YEAR=1993, KEYWORDS="Mfj", ABSTRACT="Despite what MFJ supporters view as an economic and public policy success story, the competitive structure created by the decree has now been unraveled.", } @ARTICLE{Bern9312:Copyrights, AUTHOR="R. Bernstein", TITLE="Copyrights in the New Age of Interactive Multimedia", JOURNAL=ieeecm, VOLUME=31, NUMBER=12, PAGES="60-62", MONTH="Dec", YEAR=1993, KEYWORDS="copyright; intellectual property; electronic publishing; fair use", ABSTRACT="Whether as owner of programming or as a partner in its distribution, telephone companies will find themselves increasingly involved in copyright issues that traditionally have been the province of entertainment and media companies.", } @ARTICLE{Whee9312:CTIA, AUTHOR="Thomas E. Wheeler", TITLE="{CTIA:} An Expanding Role in the Post-Divestiture Wireless Communications Marketplace", JOURNAL=ieeecm, VOLUME=31, NUMBER=12, PAGES="63-64", MONTH="Dec", YEAR=1993, KEYWORDS="CITA; wireless communications; broadband; fiber optic networks", ABSTRACT="The next generation of wireless networks will have the spectrum to deliver the equivalent of the broadband and high-speed services of terrestrial fiber optic networks.", } @ARTICLE{Sodo9312:Public, AUTHOR="John Sodolski", TITLE="Public Policy Must Maintain Fair Competition as its Goal", JOURNAL=ieeecm, VOLUME=31, NUMBER=12, PAGES="65-67", MONTH="Dec", YEAR=1993, KEYWORDS="telco", ABSTRACT="If policy makers want true competition, telcos, like anybody else, ought to be allowed to bring their best to market. For it to be otherwise is to have paid little more than lip service to what this entire upheaval was supposed to be about.", } @INPROCEEDINGS{Holl93:Fast, AUTHOR="M. Holland and G. A. Gibson and D. P. Siewiorek", TITLE="Fast, On-Line Failure Recovery in Redundant Disk Arrays", BOOKTITLE="23rd Annual International Symposium on Fault-Tolerant Computing", YEAR=1993, } @ARTICLE{Chen93:RAID5, AUTHOR="S. Chen and Donald F. Towsley", TITLE="The Design and Evaluation of {RAID5} and Parity Striping Disk Array Architecture", JOURNAL=jpdc, PAGES="58-74", YEAR=1993, } @ARTICLE{Clai9304:Domestic, AUTHOR="Gerard Claisse and Frantz Rowe", TITLE="Domestic telephone habits and daily mobility", JOURNAL="Transportation Research A", VOLUME="27A", NUMBER=4, PAGES="277-290", YEAR=1993, REFERENCES=32, KEYWORDS="mobility; telephone; transportation", ABSTRACT="Based on an analysis of the present French telephone habits, this paper puts forward an original approach for the evaluation of telephone and mobility interactions. A survey carried out on a sample of 663 French people, which recorded the characteristics of 7252 domestic telephone calls, has enabled us to identify, evaluate and characterize these impacts by distinguishing four types of telephone traffic: specific traffic, management traffic, substitution traffic and induction traffic. The main finding is that nearly two thirds of domestic telephone activity is linked to daily mobility, whether it replaces, generates or manages trips or activities.", } @INPROCEEDINGS{Lunt93:Detecting, AUTHOR="T. Lunt", TITLE="Detecting Intruders in Computer Systems", BOOKTITLE="Conference on Auditing and Computer Technology", YEAR=1993, } @BOOK{Penn93:JPEG, AUTHOR="William B. Pennebaker and J. Mitchell", TITLE="{JPEG} Still Image Data Compression Standard", ISBN="0-442-01272-1", PUBLISHER="Van Nostrand Reinhold", YEAR=1993, KEYWORDS="JPEG; image compression; packet video", } @ARTICLE{Li9303:Generating, AUTHOR="Song Li", TITLE="Generating Function Approach for Discrete Queueing Analysis with Decomposable Arrival and Service Markov chains", JOURNAL="Stochastic Models", VOLUME=9, NUMBER=3, YEAR=1993, ABSTRACT="This paper uses generating function approach with spectral decomposition to analyze discrete queues with arrival and service processes characterized by Markov chain (MC). Both generating function and distribution function of the queue are constructed from vanishing and non-vanishing roots. The vanishing roots are used to obtain linear solutions for the boundary probabilities; each non-vanishing root constructs a geometric term in the queue distribution function. The queue asymptotic behavior is expressed in a simple geometric form, which is determined by the minimum non-vanishing root. A key condition for the success of this approach is that all the eigenvalues of both arrival and service MC generating function matrices are distinct and given in explicit analytic form. In order to express eigenvalues in explicit analytic form, both arrival and service MCs must be a special class of MCs which are decomposable into a set of independent MC elements, and each element has no more than four states. Finding roots then becomes no longer difficult in large systems, since the evaluation of each individual root is well decomposed in a simple convergent form. One can use simple Kronecker product properties to obtain queueing solutions.In this paper we will present steady state queueing solutions for both arrival and service MCs decomposed in units of heterogeneous two-state MCs.", URL="http://www.ece.utexas.edu/~sanqi/papers.html", } @ARTICLE{Ofek9304:Hybrid, AUTHOR="Y. Ofek and M. Sidi", TITLE="Design and Analysis of a Hybrid Access Control to an Optical Star using {WDM}", JOURNAL=jpdc, VOLUME=17, PAGES="259-265", MONTH="Apr", YEAR=1993, ABSTRACT="A passive optical star is an ideal shared medium, from both fault tolerant and access synchronization point of views. The communication over an optical star merges to a single point in space and then broadcast back to all the nodes. This circular symmetry facilitates the solution for two basic distributed synchronization problems, which are presented in this work: (i) generating global event clock for synchronizing the nodes' operation, and (ii) distributed scheduling for accessing the shared passive medium, which is a hybrid (deterministic and random) technique. We present, prove and analyze this hybrid scheduling algorithm which is equivalent to a distributed queue, and therefore, is also algorithmically fair. Furthermore, our solution has two additional properties: destination overflow prevention and destination fairness. The effective solution of these problems can be used for efficiently implementing a local area network based on a passive optical star.", } @INPROCEEDINGS{Ofek93:Configuration, AUTHOR="Y. Ofek and M. Yung and B. Yener", TITLE="Configuration and Performance Issues in the MetaNet Design", BOOKTITLE="18th Conference on Local Computer Networks", PAGES="291-299", YEAR=1993, ABSTRACT="This paper examines various virtual embedding configurations for the MetaNet architecture. It compares and contrast the suggested embedding structures, and identifies design parameters and their trade-off. This study is based on the combination of convergence routing with the fairness mechanism, which controls the internal traffic load. More specifically, the fairness is used as a mechanism to ensure that the network internally will not be over-loaded. Therefore, packets can be sent from source to destination on a route which is close to the shortest path. The routing on the MetaNet is a variant of deflection routing. It makes on-line routing decisions based on the local flow of traffic (load conditions). Unlike other deflection techniques the MetaNet routing is along a global sense of direction, which guarantees that packets will reach their destinations. Therefore, we call this method convergence routing (previous deflection algorithms did not guarantee deterministic routing convergence, i.e., a cell/packet can be deflected indefinitely inside the network). The MetaNet is a LAN/MAN architecture with an 'arbitrary topology' (i.e., a switch-based LAN). Its design provides on one hand a service in which every node can try to transmit asynchronously, in a bursty manner without reservation, as much as it can, as in shared-media LANs. On the other hand, the network access and flow control ensure the following properties: (1) no cell/packet loss due to congestion, (2) fair access to the network and (3) broadcast-with-feedback. The switching over this network requires only a single buffer per link - as in buffer insertion rings.", } @BOOK{Vari93:Microeconomic, AUTHOR="Hal R. Varian", TITLE="Microeconomic Analysis", ISBN=0393957357, PUBLISHER="W.W. Norton \& Co", YEAR=1993, KEYWORDS="Microeconomics; Microeconomic", } @ARTICLE{Ster9301:Gigabit, AUTHOR="J. P. Sterbenz and G. M. Parulkar", TITLE="Design of a Gigabit Host-Network Interface", JOURNAL=jhsn, VOLUME=2, NUMBER=1, YEAR=1993, } @ARTICLE{Olsh9301:Multigigabit, AUTHOR="Robert Olshansky and A. R. Bugos and R. T. Hofmeister", TITLE="Multigigabit, Multichannel Lightwave Networks Using Subcarrier Multiplexing", JOURNAL=jhsn, VOLUME=2, NUMBER=1, YEAR=1993, } @ARTICLE{Yin9301:Leaky, AUTHOR="Nanying Yin and M. G. Hluchyj", TITLE="Analysis of the Leaky Bucket Algorithm for {ON-OFF} Data sources", JOURNAL=jhsn, VOLUME=2, NUMBER=1, YEAR=1993, } @ARTICLE{Aly9302:Architecture, AUTHOR="K. A. Aly and P. W. Dowd", TITLE="Architecture and Analysis of Fast Packet Switches Based on Time Multiplexed Photonic Fabrics", JOURNAL=jhsn, VOLUME=2, NUMBER=2, YEAR=1993, } @ARTICLE{Gbur9302:Deflection, AUTHOR="P. Gburzynski and J. Maitan", TITLE="Deflection Routing in Regular {MNA} topologies", JOURNAL=jhsn, VOLUME=2, NUMBER=2, YEAR=1993, } @ARTICLE{Kost9302:Security, AUTHOR="D. Kostick and K. Tesink", TITLE="Security for {SMDS} {CNM}", JOURNAL=jhsn, VOLUME=2, NUMBER=2, YEAR=1993, } @ARTICLE{Cido9303:PlaNET, AUTHOR="I. Cidon and I. Gopal and P. M. Gopal and R. Guerin and J. Janiello and Michael Kaplan", TITLE="The {plaNET/ORBIT} High Speed Network", JOURNAL=jhsn, VOLUME=2, NUMBER=3, YEAR=1993, } @ARTICLE{Port9303:Broadband, AUTHOR="T. La Porta and M. Veeraraghavan", TITLE="Evaluation of Broadband {UNI} Signaling Protocols", JOURNAL=jhsn, VOLUME=2, NUMBER=3, YEAR=1993, } @ARTICLE{Huan9303:General, AUTHOR="Nian-Chyi Huang and S. T. Sheu", TITLE="A General Bandwidth Allocation Scheme for Multi-Priority Traffic", JOURNAL=jhsn, VOLUME=2, NUMBER=3, YEAR=1993, } @ARTICLE{Huan9303:Efficient, AUTHOR="Nian-Chyi Huang and Chung-Ching Chiou", TITLE="An Efficient Slot-Reuse Scheme for {CRMA} High-Speed Networks", JOURNAL=jhsn, VOLUME=2, NUMBER=3, YEAR=1993, } @ARTICLE{Ayan9303:Improvement, AUTHOR="Ender Ayanoglu and R. D. Gitlin and Nihat C. Oguz", TITLE="Performance Improvement in Broadband Networks Using Forward Error Correction for Lost Packet Recovery", JOURNAL=jhsn, VOLUME=2, NUMBER=3, YEAR=1993, } @ARTICLE{Chla9304:Double, AUTHOR="I. Chlamtac and A. Fumagalli", TITLE="All-Optical Double Ring Networks", JOURNAL=jhsn, VOLUME=2, NUMBER=4, YEAR=1993, } @ARTICLE{Lloy9304:Efficient, AUTHOR="Errol L. Lloyd and R. Ramanathan", TITLE="Efficient Distributed Algorithms for Channel Assignment in Multihop Radio Networks", JOURNAL=jhsn, VOLUME=2, NUMBER=4, YEAR=1993, } @INPROCEEDINGS{Cruz93:Surround, AUTHOR="C. Cruz-Neira and D. Sandin and T. A. DeFanti", TITLE="Surround-Screen Projection-Based Virtual Reality: The Design and Implementation of the {CAVE}", BOOKTITLE=siggraph, PAGES="135-142", YEAR=1993, } @TECHREPORT{Stein93:Human, AUTHOR="R. Steinmetz and Clemens Engler", TITLE="Human perception of Media Synchronization", TYPE="Technical Report", INSTITUTION="IBM European Networking Center", ADDRESS="Heidelberg, Germany", NUMBER="43.9310", YEAR=1993, } @INPROCEEDINGS{Kay93:Measurement, AUTHOR="Jonathan S. Kay and J. Pasquale", TITLE="Measurement, Analysis, and Improvement of {UDP/IP} Throughput for the {DECstation} 5000", BOOKTITLE="USENIX a voir dans ethics....", YEAR=1993, KEYWORDS="tcp; udp; optimization; checksum; dec", } @BOOK{Lawl93:Logistics, AUTHOR="E. L. Lawler and J. K. Lenstra and A. H. G. Rinnooy Kan and David B. Shmoys", TITLE="Logistics of Production and Inventory", SERIES="Handbooks in Operations Research and Management Science", PUBLISHER="North-Holland", VOLUME=4, YEAR=1993, KEYWORDS="sequencing; scheduling; optimization", } @ARTICLE{Ben-93:Architecture, AUTHOR="Israel Z. Ben-Shaul and Gail Kaiser and George T. Heineman", TITLE="An Architecture for Multi-User Software Development Environments", JOURNAL="Computing Systems, The Journal of the USENIX Association", VOLUME=6, NUMBER=2, PAGES="65-103", YEAR=1993, LANGUAGE="English", } @INPROCEEDINGS{Magn93:Design, AUTHOR="Peter S. Magnusson", TITLE="A Design for Efficient Simulation of a Multiprocessor", BOOKTITLE="{Proceedings of MASCOTS}", PAGES="69-78", MONTH="JAN", YEAR=1993, ABSTRACT="Instruction-level simulators, also called register-transfer level simulators, are a crucial component in developing and analyzing computer architectures and system software. Simulating a multiprocessor presents some special problems, notably code expansion and efficient time slicing of processors. Also, modern processors have aggravated the memory bottleneck, and the internal formats used by a simulator must be compact. This paper presents a design for a unit-delay simulator for a shared-memory multiprocessor that comes far in meeting these requirements. The simulator interprets at system level, i.e., it faithfully reproduces the interfaces of the principal devices. Previous work in the area is discussed.", URL="http://www.sics.se/simics/publications/Mascots93.ps", } @INPROCEEDINGS{Hag:sim, AUTHOR="Erik Hagersten and Mats Grindal and Anders Landin", TITLE="Simulating the Data Diffusion Machine", BOOKTITLE="PARLE", YEAR=1993, } @INPROCEEDINGS{Murr:des, AUTHOR="K. Murray and Tim Wilkinson and P. Osmon and Ashley Saulsbury and P. T. Kelly", TITLE="Design and Implementation of an Object-Orientated 64-bit Single Address Space Microkernel", BOOKTITLE="2nd USENIX Symposium on Microkernels and other Kernel Architectures", ADDRESS="San Diego, USA", MONTH="AUG", YEAR=1993, } @INPROCEEDINGS{Mag:SimPa, AUTHOR="Peter S. Magnusson", TITLE="Simulation of Parallel Hardware", BOOKTITLE="International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)", ADDRESS="San Diego", MONTH="JAN", YEAR=1993, ABSTRACT="Instruction-level simulators, also called register-transfer level simulators, are a crucial component in developing and analyzing computer architectures and system software. Simulating a multiprocessor presents some special problems, notably code expansion and efficient time slicing of processors. Also, modern processors have aggravated the memory bottleneck, and the internal formats used by a simulator must be compact. This paper presents a design for a unit-delay simulator for a shared-memory multiprocessor that comes far in meeting these requirements. The simulator interprets at system level, i.e., it faithfully reproduces the interfaces of the principal devices. Previous work in the area is discussed.", } @MISC{Mag:parla, AUTHOR="Peter S. Magnusson", TITLE="Partial Translation", HOWPUBLISHED="SICS Technical Report T93:05.", YEAR=1993, ABSTRACT="Traditional simulation of a target architecture by interpreting object code can be improved by translating the object code to an intermediate format. This approach is called interpretive translation. Despite a substantial performance improvement over traditional interpretation, a large part of the overhead is unnecessary. An alternative approach is block translation, where one or more simulated instructions are translated to directly executable code. This approach has several drawbacks. We discuss the problems with block translation, analyse the overhead of interpretive translation, and describe a hybrid approach---partial translation---that combines the benefits of both approaches. Partial translation implements an intermediate format that supports the addition of run-time generated code whenever appropriate. The performance limit (slowdown) of interpretive translation is around 15, and real implementations have achieved 20-30. Partial translation will perform considerably better. Finally, we present results from an aggressive implementation of interpretive translation, and results from a proof-of-concept implementation of partial translation.", } @INPROCEEDINGS{Bohm:rres, AUTHOR={Christer Bohm and Per Lindgren and Lars Ramfelt and P. Sj{\"o}di}, TITLE="Resource reservation in {DTM}", BOOKTITLE="In Proceedings of the First IEEE Symposium on Global Data Networking", MONTH="DEC", YEAR=1993, URL="http://www.sics.se/~peter/papers/DTM-RR.ps", } @INPROCEEDINGS{Pink:dtm, AUTHOR={Stephen Pink and P. Sj{\"o}di}, TITLE="The {DTM} multicast channel protocol", BOOKTITLE="In Proceedings of the 6th MultiG Workshop", ADDRESS="Stockholm, Sweden", MONTH="MAY", YEAR=1993, } @INBOOK{Pink93:High, AUTHOR="Stephen Pink", TITLE="High Performance Networks", EDITOR="Ahmed Tantawy", CHAPTER="7. {TCP}/{IP} on Gigabit Networks", PUBLISHER="Kluwer Academic Publishers", VOLUME="II: Frontiers and Ex", MONTH="OCT", YEAR=1993, URL="http://www.sics.se/cna/publications/KluwerTCP.ps", } @INPROCEEDINGS{Karl93:Stockholm, AUTHOR="Gunnar Karlsson", TITLE="Stockholm Gigabit Network", BOOKTITLE="In Proceedings of the First IEEE Symposium on Global Data Networking", MONTH="DEC", YEAR=1993, } @INPROCEEDINGS{Badr93:Handling, AUTHOR="Badri Nath and Ajay Bakre and T. Imielinski and R. Marantz", TITLE="Handling Mobile Clients: A Case for Indirect Interaction", BOOKTITLE="of Fourth Workshop on Workstation Operating Systems", PAGES="91-97", YEAR=1993, } @INPROCEEDINGS{Acha93:Delivering, AUTHOR="Arup Acharya and Badri Nath", TITLE="Delivering Multicast Messages in Networks with Mobile Hosts", BOOKTITLE="13th International Conference on Distributed Computing Systems", PAGES="292-299", YEAR=1993, } @PHDTHESIS{Ioan93:Protocols, AUTHOR="John Ioannidis", TITLE="Protocols for Mobile Internetworking", TYPE="PhD Thesis", SCHOOL="Columbia University", YEAR=1993, } @ARTICLE{Myle93:Comparing, AUTHOR="A. Myles and D. Skellern", TITLE="Comparing Four {IP} Based Mobile Host Protocols", JOURNAL=cnis, VOLUME=26, PAGES="349-355", YEAR=1993, } @ARTICLE{Perk93:Providing, AUTHOR="Charles E. Perkins", TITLE="Providing Continuous Network Access to Mobile Hosts Using {TCP/IP}", JOURNAL=cnis, VOLUME=26, PAGES="357-369", YEAR=1993, } @ARTICLE{Rekh93:Architecture, AUTHOR="Y. Rekhter", TITLE="An Architecture for Transport Layer Transparent Support for Mobility", JOURNAL=internet, VOLUME=4, PAGES="223-246", YEAR=1993, } @TECHREPORT{Perk93:Support, AUTHOR="Charles E. Perkins and Y. Rekhter", TITLE="Support for Mobility with Connectionless Network Layer Protocols", TYPE="Technical Report", INSTITUTION="Watson Research Center, IBM Corporation", YEAR=1993, } @TECHREPORT{Turl9301:Software, AUTHOR="T. Turletti", TITLE="{H.261} software codec for videoconferencing over the {Internet}", TYPE="Rapports de Recherche", INSTITUTION="Institut National de Recherche en Informatique et en Automatique (INRIA)", ADDRESS="Sophia-Antipolis, France", NUMBER=1834, MONTH=jan, YEAR=1993, KEYWORDS="H.261; data compression; Internet; video conferencing; UDP; IP multicast; codec; implementation", ABSTRACT="This report describes a low-bandwidth videoconferencing application on the Internet using tbe IP multicast extensions and the User Datagram Protocol (UDP) transport protocol. The video coder-decoder is a software implementation of tbe CCITT recommendation H.261 originally developped for the Integrated Services Digital Network (ISDN). Until now, H.261 codecs have been implemented in hardware. We find that the mean output rate of the coder is less than 30 kb/s, thus making videoconferencing applications possible over low-speed networks such as the Internet. After a brief overview of the different data compression techniques and a description of the recommendation H.261, we describe in more details IVS, our videoconferencing application which is freely available in the public domain.", } @ARTICLE{Kuro9301:Open, AUTHOR="James F. Kurose", TITLE="Open issues and challenges in providing quality of service guarantees in high speed networks", JOURNAL=ccr, VOLUME=23, NUMBER=1, PAGES="6-15", MONTH=jan, YEAR=1993, REFERENCES=29, KEYWORDS="QOS; quality of service; survey", ABSTRACT="In this paper we identify the challenges and open issues involved in providing quality-of-service (QOS) guarantees to sessions in a high-speed wide area network and briefly survey research in this area. Four approaches towards providing QOS guarantees are described and discussed: the tightly controlled approach, the approximate approach, the bounding approach, and the observation-based approach.", URL="ftp://gaia.cs.umass.edu/pub/Kuro93:Issues.ps.Z", } @INPROCEEDINGS{Naga9301:Local, AUTHOR="R. Nagarajan and James F. Kurose and Donald F. Towsley", TITLE="Local allocation of end-to-end quality-of-service measures in high-speed networks", BOOKTITLE="IFIP International Workshop on Modeling of ATM Networks", INSTITUTION="IFIP", PUBLISHER="North Holland", ADDRESS="Le Martinique, French Carribean", PAGES="2.2.1-2.2.29", MONTH=jan, YEAR=1993, KEYWORDS="QOS", } @ARTICLE{Fras9301:Early, AUTHOR="A. G. Fraser", TITLE="Early experiments with asynchronous time division networks", JOURNAL=ieeenet, VOLUME=7, NUMBER=1, PAGES="12-26", MONTH=jan, YEAR=1993, REFERENCES=26, KEYWORDS="ATM; ATDM; historical survey", ABSTRACT="A retrospective account of three experimental ATDM networks conceived between 1969 and 1984.", } @ARTICLE{Tolm9301:HIPPI, AUTHOR="Don E. Tolmie and John Renwick", TITLE="{HIPPI:} simplicity yields success", JOURNAL=ieeenet, VOLUME=7, NUMBER=1, PAGES="28-32", MONTH=jan, YEAR=1993, REFERENCES=6, KEYWORDS="HIPPI; host interconnect; standards; interface", ABSTRACT="HIPPI hit the market at the right time with a simple high-speed interface that used very few options.", } @ARTICLE{Irvi9301:Making, AUTHOR="D. R. Irvin", TITLE="Making broadband {ISDN} successful", JOURNAL=ieeenet, VOLUME=7, NUMBER=1, PAGES="40-45", MONTH=jan, YEAR=1993, REFERENCES=11, KEYWORDS="ATM; BISDN; economics; pricing; POTS", ABSTRACT="Universal service is essential to BISDN success now as it was to POTS in 1900, but service will not be universal unless we develop imaginative new applications to stimulate the market.", } @ARTICLE{Sira9301:Flexible, AUTHOR="R. Siracusa and K. Joseph and J. Zdepski and D. Raychaudhuri", TITLE="Flexible and Robust Packet Transport for Digital {HDTV}", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="88-98", MONTH=jan, YEAR=1993, REFERENCES=15, KEYWORDS="HDTV; transport protocols; multimedia", ABSTRACT="This paper describes a packet-oriented transport approach used in the recently proposed Advanced Digital Television (ADTV) system for terrestrial HDTV broadcast. ADTV achieves the primary design goal of provided robust HDTV delivery on terrestrial simulcast channels via MPEG video compression, prioritization of MPEG data and ``cell-relay'' type packet transport in conjunction with a two-tier physical transmission scheme. General design issues relevant to the development of the proposed transport protocol are discussed. To provide context for the two-tier transport approach described, ADTV's prioritization algorithm for partitioning MPEG encoded video into high-priority (HP) and standard-priority (SP) bit streams is first outlined. The data transport format which supports these prioritized compressed video bit-streams over the terrestrial channel and other applicable media (e.g., cable, satellite, ATM) is then described. The three principal sublayers of the ADTV transport protocol include a generic data-link/network level for addressing, priority support and error control, an adaptation layer for service-specific error recovery, and a video service level for high level resynchronization of the video decoder. Each of these layers is discussed in terms of specific functions, impact on system performance and hardware implementation factors. A ``proof-of-concept'' simulation model which incorporates transport encoding and decoding functionality is outlined, and performance evaluation results are given for illustrative transmission scenarios.", } @ARTICLE{Rekh9301:Forwarding, AUTHOR="Y. Rekhter", TITLE="Forwarding database overhead for inter-domain routing", JOURNAL=ccr, VOLUME=23, NUMBER=1, PAGES="66-81", MONTH=jan, YEAR=1993, REFERENCES=11, KEYWORDS="routing; Internet; packet forwarding; complexity; scaling", ABSTRACT="The network layer of the current Internet is built around the packet switched architecture. As the Internet grows both in size and diversity of services, providing mechanisms to contain the growth of information that is necessary to correctly perform packet switching becomes one of the crucial issues in the overall Internet architecture. The dominant factor of this issue is the routing data stored in Forwarding Information Bases. The paper analyzes storage overhead associated with the inter-domain component of Forwarding Information Bases and evaluates possible techniques for containing the growth of this overhead.", } @ARTICLE{Tsuc9301:Extending, AUTHOR="Paul F. Tsuchiya and Tony Eng", TITLE="Extending the {IP} {Internet} through address reuse", JOURNAL=ccr, VOLUME=23, NUMBER=1, PAGES="16-33", MONTH=jan, YEAR=1993, REFERENCES=7, KEYWORDS="network address translation; routing; IP; Internet; scaling; uniqueness; FTP", ABSTRACT="The two most compelling problems facing the IP Internet are IP address depletion and scaling in routing. This paper discusses the characteristics of one of the proposed solutions --- address reuse. The solution is to place Network Address Translators (Nat) at the borders of stub domains. Each Nat box has a small pool of globally unique IP addresses that are dynamically assigned to IP flows going through the Nat. The dynamic assignment is coordinated with Domain Name Server operation. The IP addresses inside the stub domain are not globally unique -- they are reused in other domains, thus solving the address depletion problem. The pool of IP addresses in the Nat is from a subnet administered by the regional backbone, thus solving the scaling problem. The main advantage of Nat is that it can be installed without changes to any existing systems, although FTP will fail in some but not all cases. This paper presents a preliminary design for Nat, and discusses its pros and cons.", } @ARTICLE{Tera9301:Host, AUTHOR="F. Teraoka and M. Tokoro", TITLE="Host migration transparency in {IP} networks: the {VIP} approach", JOURNAL=ccr, VOLUME=23, NUMBER=1, PAGES="45-65", MONTH=jan, YEAR=1993, REFERENCES=14, KEYWORDS="IP; mobile IP; VIP", ABSTRACT="Increasing portability of computers will require users in the future to access the network regardless of location. Host migration transparency will be an essential feature of wide area network environments. We proposed the concept of virtual network and the propagating cache method to achieve host migration transparency. We also established the feasibility of Virtual Internet Protocol (VIP), derived from Internet Protocol (IP), as an example of a virtual network protocol. In this paper, we define VIP in detail and describe how VIP achieves host migration transparency in IP networks. We also show two VIP implementation approaches: 1) VIP as a sublayer; and 2) VIP as an IP option. By modifying an operating systems kernel in each case, we implement VIP using both approaches. We then compare both implementations in terms of overhead, backward compatibility, and other metrics. The measured performance indicates that VIP can provide host migration transparency in IP networks with negligible overhead.", } @UNPUBLISHED{Curt9301:MUDs, AUTHOR="Pavel Curtis and D. A. Nichols", TITLE="{MUDs} grow up: social virtual reality in the real world", INSTITUTION="Xerox PARC", ADDRESS="Palo Alto, California", NOTE="unpublished memorandum", MONTH=jan, YEAR=1993, KEYWORDS="MUD; virtual reality; packet audio", ABSTRACT="MUDs, or ``multi-user dungeons'' are programs that accept network connections from multiple simultaneous users and provide access to a shared database of ``rooms'', ``exits'' and other objects. Users browse and manipulate the database from ``inside'' the rooms, seeing only those objects that are in the same room and moving between rooms mostly via the exits that connect them. MUDs are thus a kind of virtual reality, an electronically-represented ``place'' that users can visit. -- A recent list of Internet-accessible MUDs showed well over 200 advertised, running at sites all over the world. The busiest of these frequently host 50 to 100 simultaneous users. Clearly, these recreational MUDs are very popular systems. It seems clear to us that the simple technology of MUDs should also be useful in other, non-recreational applications. This paper presents our plans for exploring the implementation, applications, and implications of MUDs in work-oriented contexts. In the remainder of this introduction, we describe the capabilities of our own MUD server. We then describe the two major systems we are building as foci for our research. [The first system, Astro-VR, is a virtual meeting place for astronomers, with links to images and conference rooms for text and image presentations, recorded with questions for later replay. The second, Jupiter, includes multicast audio, with a separate audio channel for each room. The MUD is displayed as a graphical map. Video provides a sense of the activities of other users and for attending lectures. Real casual meeting areas will be integrated into the system. Jupiter can provide presence to telecommuters.", URL="ftp://parcftp.xerox.com/pub/MOO/papers/MUDsGrowUp.ps.Z", } @ARTICLE{Clar9301:AURORA, AUTHOR="D. D. Clark and B. S. Davie and D. Farber and I. Gopal and Bharath K. Kadaba and Jonathan Smith and David W. Sincoskie and David Tennenhouse", TITLE="The {AURORA} gigabit testbed", JOURNAL=cnis, PUBLISHER="North-Holland", ADDRESS="Amsterdam, Netherlands", VOLUME=25, NUMBER=6, PAGES="599-621", MONTH=jan, YEAR=1993, REFERENCES=34, ABSTRACT="AURORA is one of five U.S. networking testbeds charged with exploring applications of, and technologies necessary for, networks operating at gigabit per second or higher bandwidths. The emphasis of the AURORA testbed, distinct forom the other four testbeds, BLANCA, CASA. NECTAR and VISTANET, is research into the supporting technologies for gigabit networking. Like the other testbeds, AURORA itself is an experiment in collaboration, where government initiative (in the form of the Corporation for National Research Initiatives, which is funded by DARPA and the National Science Foundation) has spurred interaction among pre-existing centres of excellence in industry, academia and government. AURORA has been charged with research into networking technologies that will underpin future high-speed networks. This paper provides an overview of the goals and methodologies employed in AURORA, and points to some preliminary results from our first year of research, ranging from analytic results to experimental prototype hardware. This paper enunicates out targets, which include new software architectures, network abstractions, and hardware technologies, as well as applications for our work.", ANNOTE="AURORA makes use of both ATM (Asynchronous Transfer Mode) and PTM (Packet Transfer Mode) technologies, and will eventually be researching methods to interwork between the two different systems. ''The most popular abstractions for today's networks are the reliable byte stream and the remote procedure call (RPC).'' ''Remote procedure calls, because they represent serialized rather than parallel communications across a network, degrade directly with increasing network latency.'' It is possible to model network communications in terms of access to shared memory resources. Although this can suffer from the same basic latency problems as reliable byte streams and tradtional RPC, virtual memory management techniques may be used to reduce the effects significantly. AURORA is exploring the use of the testbed network for video conferencing and multimedia commnunications systems. They feel that still and moving video data will constitute the largest part of the loading upon future networks. The AURORA project partners are developing host interfaces for TURBOchannel based DEC workstations, RS/6000's and PS/2's which will span the range from pure hardware inplementations to programmable hardware and software combinations. IBM are developing the Rapid Transport Protocol for AURORA which is a transport protocol specifically designed for use at gigabit/sec speeds. Data can be sent in the first packet, thus facilitating fast connection setup times and both Go-Back-N and selective repeat error recovery mechanisms are provided. ''The performance [of DSM] results from the similarity between the network abstraction and the abstraction of addressable memory used by processing units''", } @INPROCEEDINGS{Uhle9301:PhoneStation, AUTHOR="Stephen A. Uhler", TITLE="PhoneStation, Moving the Telephone into the Virtual Desktop", BOOKTITLE=usenixw, ADDRESS="San Diego, California", PAGES="131-140", MONTH=jan, YEAR=1993, KEYWORDS="telephone; signaling; multimedia; Tcl; script language; session control; user interface; workstation", ABSTRACT="PhoneStation is a system that provides a Sun Microsystems SPARCstation with complete control over an ordinary telephone line. It consists of a telephone line interface unit with loop control and touch tone detection, a suite of supporting software libraries that include digital signal processing for call progress monitoring, text-to-speech conversion, telephone line control, and PhoneScript, a high-level procedural language that uses Tcl for building interactive telephone based applications.", URL="http://www.greatcircle.com/lists/phonestation/", } @TECHREPORT{Schi9301:Verifying, AUTHOR="I. Schieferdecker and Adam M Wolisz", TITLE="Verifying Performance Bounds of Communication Protocols", TYPE="Forschungsbericht des Fachbereiches Informatik", INSTITUTION="TU Berlin, Fachbereich Informatik", ADDRESS="Berlin, Germany", NUMBER="93/11", MONTH=jan, YEAR=1993, } @INPROCEEDINGS{Crow9301:Options, AUTHOR="Jon Crowcroft", TITLE="Options for Video Coder Decoders and {SuperJANET}", BOOKTITLE="Joint UK Unix User Group and Sun UK User Group Conference", ISBN=1, ADDRESS="Oxford", MONTH=jan, YEAR=1993, } @INPROCEEDINGS{Crow9301:IP, AUTHOR="Jon Crowcroft", TITLE="The {IPv7} Solutions compared According to the Partridge Criteria", BOOKTITLE="Joint UK Unix User Group and Sun UK User Group Conference, Oxford", ISBN=1, MONTH=jan, YEAR=1993, } @INPROCEEDINGS{Crow9301:Bandwidth, AUTHOR="Jon Crowcroft", TITLE="Bandwidth Requirements for Multimedia", BOOKTITLE="2nd European Network Users Forum", ADDRESS="Windsor", MONTH=jan, YEAR=1993, } @INPROCEEDINGS{Mill9301:File, AUTHOR="Ethan L. Miller and Randy H. Katz", TITLE="An Analysis of File Migration in a Unix Supercomputing Environment", BOOKTITLE=usenixw, MONTH=jan, YEAR=1993, URL="ftp://ftp.cs.berkeley.edu/ucb/raid/papers/winter93usenix.ps.Z", } @INPROCEEDINGS{Pike9301:Hello, AUTHOR="Rob Pike and Ken Thompson", TITLE="Hello World or \ldots", BOOKTITLE=usenixw, ORGANIZATION="Usenix", ADDRESS="San Diego, California", PAGES="43-50", MONTH=jan, YEAR=1993, KEYWORDS="Unicode; internationialization; Unix; Plan 9; operating systems", ABSTRACT="Plan 9 from Bell Labs has recently been converted from ASCII to an ASCII-compatible variant of Unicode, a 16-bit character set. In this paper we explain the reasons for the change, describe the character set and representation we choose, and present the programming models and software changes that support the new text format. Although we stopped short of full internationalization - for example, system error messages are in Unixese, not Japanese - we believe Plan 9 is the first system to treat the representation of all major languages on a uniform equal footing throughout all its software.", } @INPROCEEDINGS{Plan9301:Jgraph, AUTHOR="James Plank", TITLE="Jgraph - A Filter for Plotting Graphs in PostScript", BOOKTITLE=usenixw, ORGANIZATION="Usenix", ADDRESS="San Diego, California", PAGES="61-66", MONTH=jan, YEAR=1993, KEYWORDS="graph; plotting; Postscript", ABSTRACT="Jgraph is a non-interactive filter for plotting two-dimensional scatter, line, and bar graphs in PostScript. It has also been used as a general-purpose drawing utility. Jgraph's strength lies in its portability, flexibility, and integration into the UNIX environment. Jgraph is free software available on netlib or by anonymous ftp.", URL="http://www.cs.utk.edu/~plank/plank/papers/USENIX-93W.html", } @INPROCEEDINGS{Paxs9301:Glish, AUTHOR="V. Paxson and Chris Saltmarsh", TITLE="Glish: A User-Level Software Bus for Loosly-Coupled Distributed Systems", BOOKTITLE=usenixw, ORGANIZATION="Usenix", ADDRESS="San Diego, California", PAGES="141-155", MONTH=jan, YEAR=1993, KEYWORDS="scripting language; distributed systems", ABSTRACT="We describe Glish, an interpreted language for building distributed systems from modular, event-oriented programs. These programs are written in conventional languages such as C, C++ or FORTRAN. Glish scripts can create local and remote processes and control their communication. Glish also provides a full, array-oriented programming language for manipulating binary data sent between the processes. In general Glish uses a centralized communication model where interprocess communication passes through the Glish interpreter, allowing dynamic modification and rerouting of data values, but Glish also supports point-to-point links between processes when necessary for high performance. Glish is available via anonymous ftp.", } @INPROCEEDINGS{McCa9301:BSD, AUTHOR="Steve McCanne and V. Jacobson", TITLE="A {BSD} Packet Filter: A New Architecture for User-level Packet Capture", BOOKTITLE=usenixw, ORGANIZATION="Usenix", ADDRESS="San Diego, California", PAGES="259-269", MONTH=jan, YEAR=1993, REFERENCES=10, KEYWORDS="packet filter; protocol implementation; Unix", ABSTRACT="Many versions of Unix provide facilities for user-level packet capture, making possible the use of general purpose workstations for network monitoring. Because network monitors run as user-level processes, packets must be copied across the kernel/user-space protection boundary. This copying can be ninimized by deploying a kernel agent called a packet filter, which discards unwanted packets as early as possible. The original Unix packet filter was designed arround a stack-based filter evaluator that perfomrs sub-optimally on current RISC CPUs. The BSD Packet Filter (BPF) uses a new, register-based filter evaluator that is up to 20 times faster than the original design. BPF also uses a straightforward buffering strategy that makes its overall performance up to 100 times faster than Sun's NIT running on the same hardware.", } @INPROCEEDINGS{Pres9301:Organisation, AUTHOR="David Leo Presotto and Phil Winterbottom", TITLE="The Organisation of Networks in Plan 9", BOOKTITLE=usenixw, ORGANIZATION="Usenix", ADDRESS="San Diego, California", PAGES="271-281", MONTH=jan, YEAR=1993, KEYWORDS="Plan 9; operating systems; protocol implementation", ABSTRACT="In a distributed system networks are of paramount importance. This paper descibes the implementation, design philosophy and organization of network support in Plan 9. Topics include network requirements for distributed systems, our kernel implementation, network naming, user interfaces and performance. We also observe that much of this organization is relevent to current systems.", } @INPROCEEDINGS{Bowm9301:Enterprise, AUTHOR="C. Mic Bowman and Chanda Dharap", TITLE="The Enterprise Distributed White-page Service", BOOKTITLE=usenixw, ORGANIZATION="Usenix", ADDRESS="San Diego, California", PAGES="349-359", MONTH=jan, YEAR=1993, KEYWORDS="name server; directory; X.500", ABSTRACT="This paper describes the Enterprise user directory system. Enterprise is unique among directory services in three ways. First, clients identify people using an unordered set of attributes called a descriptive name. Descriptive names are easier ti use and remember than, for example, X.500 distinguished names. Second, Enterprise supports an efficient disributed search facility. Rather than query every server in the system, Enterprise maintains several distributed indices that trim the set of potential servers to a fraction of the total. Finally, Enterprise provide a facility for automatically maintaining its database of information using existing repositories of information such as the ruserd daemon and the Sun NIS database. This removes the burden placed on users and system administrators to maintain the information. Enterprise is implemented as a collection of translators, resolution functions, and generators whithin a Univers descriptive name server.", } @INPROCEEDINGS{Ioan9301:Mobile, AUTHOR="J. Ioannidis and Gerald (Chip) Maguire", TITLE="The Design and Implementation of a Mobile Internetworking Architecture", BOOKTITLE=usenixw, ORGANIZATION="Usenix", ADDRESS="San Diego, California", PAGES="491-502", MONTH=jan, YEAR=1993, KEYWORDS="mobile IP; mobility; internetworking", ABSTRACT="We present the design, implementation and evaluation of MobileIP, a set of IP-based protocols and mechanisms to support host mobility throughout the Internet. The design requires changes only in the mobile hosts and their special routers; leaves transport and higher protocols unaffected, and requieres no changes in the device drivers for individual interfaces. No modifications whatsoever are needed in non-mobile hosts and routers, the system scales well, and has no single point of failure. We have implemented MobileIP under Mach 2.6, and the code is readily portable to any version of Unix that uses Berkeley networking code.", } @INPROCEEDINGS{Wada9301:Mobile, AUTHOR="Hiromi Wada and Takashi Yozawa and Tatsuya Ohnishi and Yuzo Tanaka", TITLE="Mobile Computing Environment Based on {Internet} Oacket Forwarding", BOOKTITLE=usenixw, ORGANIZATION="Usenix", ADDRESS="San Diego, California", PAGES="503-517", MONTH=jan, YEAR=1993, KEYWORDS="internetworking; mobile IP; mobility", ABSTRACT="We have explored a mobile computing environment which provides migration transparency of portable hosts. In this paper, we propose a means of continous communication with mobile hosts called the Packet Forwarding Method (PFM). In the environment, each mobile host has a home address, and when migrates to another network, it is also assigned a temporary address. An application on the mobile host always uses the home address for communication. PFM is based on packet forwarding. A Packet destined for a home address of a mobile host is forwarded to its current temporary address. This forwarding is performed by a Packet Forwarding Server (PFS) or by the sender host itself internally. This method has adaptability for existing multi-vendor environments since enhancement of stationary hosts is optimal and modifications of routers is not required. Stationary hosts which have been enhanced to have forwarding functionality can communicate with mobile hosts more efficiently than those without the enhancement. The implemented prototype code size is relatively small, and experiments indicate that communication overhead is trivial, especialy in the case of stationary hosts with the enhancement.", } @ARTICLE{Leu9301:Cycle, AUTHOR="Yean-Shiang Leu and Dong-Hui Du", TITLE="Cycle Compensation Protocol: A Fair Protocol for the Uni-directional Twin-Bus Architecture", JOURNAL=ieeetc, VOLUME=43, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="The IEEE 802.6 Standard-Distributed Queue Dual Bus for metropolitan area networks (MAN) has been proposed. It is based on a unidirectional twin bus architecture. The DQDB protocol lays more emphasis on the overall channel utilization than the fair sharing of channel bandwidth by all the stations. In this paper, we first describe the unfairness problem in which the upstream stations occupy most of the channel bandwidth while the downstream stations get fewer chances to transmit their packets. Many proposed possible fixes are also discussed. We propose a protocol called Cycle Compensation Protocol (CCP), which ensures fairness regardless of the ratio of end-to-end propagation delay to the slot size and also achieves almost the same throughput and delay as those of DQDB. CCP also guarantees that the channel bandwidth acquired by a station is inversely proportional to the number of busy stations and will reach this state within a limited time delay. [ A new version of DQDB has been adopted by the IEEE 802.6 Standard Committee. In this paper the original version of DQDB is considered. ]", } @ARTICLE{Parh9301:Sequential, AUTHOR="Keshab K. Parhi and Frank H. Wu and Kalyan Genesan", TITLE="Sequential and Parallel Neural Network Vector Quantizers", JOURNAL=ieeetc, VOLUME=43, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="This paper presents novel sequential and parallel learning techniques for codebook design in vector quantizers using neural network approaches. These techniques are used in the training phase of the vector quantizer design. Our learning techniques combine the split-and-cluster methodology of the traditional vector quantizer design with neural learning, and lead to better quantizer design (with fewer distortions). Our sequential learning approach overcomes the code word underutilization problem of the competitive learning network. As a result, this network only requires partial or zero updating, as opposed to full neighbor updating as needed in the selforganizing feature map. The parallel learning network, while satisfying the above characteristics, also leads to parallel learning of the codewords. The parallel learning technique can be used for faster codebook design in a multiprocessor environment. It is shown that this sequential learning scheme can sometimes outperform the traditional LBG algorithm, while the parallel learning scheme performs very close to the LGB and the sequential learning algorithms.", } @ARTICLE{Holl9301:Hierarchical, AUTHOR="M. A. Holliday and Michael Stumm", TITLE="Performance Evaluation of Hierarchical Ring-Based Shared Memory Multiprocessors", JOURNAL=ieeetc, VOLUME=43, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="This paper investigates the performance of word-packet, slotted unindirectional ring-based hierarchical direct networks in the context of large-scale shared memory multiprocessors. Slotted unindirectional rings are attractive because their electrical characteristics and simple interfaces allow for fast cycle times and large bandwidths. For large-scale systems, it is necessary to use multiple rings for increased aggregate bandwidth. Hierarchies are attractive because the topology ensures unique paths between nodes, simple node interfaces and simple inter-ring connections. To ensure that a realistic region of the design space is examined, the architecture of the network used in the Hector prototype is adopted as the initial design point. A simulator of that architecture has been developed and validated with measurements from the prototype. The system and workload parameterization reflects conditions expected in the near future. The results of our study show the importance of system balance on performance. Large-scale systems inherently have large communication delays for distant accesses, so processor efficiency will be low, unless the processors can operate with multiple outstanding transactions using techniques such as prefetching, asynchronous writes and multiple hardware contexts. However with multiple outstanding transactions and only one memory bank per processing module, memory quickly saturates. Memory saturation can be alleviated by having multiple memory banks per processing module, but this shifts the bottleneck to the ring subsystem. While the topology of the ring hierarchy affects performance, the ring subsystem will inherently limit the throughput of the system. Hence increasing the number of outstanding transactions per processor beyond a certain point only has a limiting effect on performance, since it causes some of the rings to become congested. An adaptive maximum number of outstanding transactions appears necessary to adjust for the appropriate tradeoff between concurrency and contention as the communication locality changes. We show the relationships between processor, ring and memory speeds, and their effects on performance. Using block transfers for prefetching seems unlikely to be advantageous in that the improvement in the cache hit ratio needed to compensate for the increased network utilization is substantial.", } @ARTICLE{Pies9301:Residue, AUTHOR="Stanislaw J. Piestrak", TITLE="Design of Residue Generators and Multioperand Modular Adders Using Carry-Save Adders", JOURNAL=ieeetc, VOLUME=43, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="Residue generator is an essential building block of encoding/decoding circuitry for arithmetic error detecting codes and binary-to-residue number system (RNS) converter. In either case, a residue generator is an overhead for a system and as such it should be built with minimum amount of hardware and should not compromise the speed of a system. Multi-operand modular adder (MOMA) is a computational element used to implement various operations in digital signal processing systems using RNS. In this paper, a comprehensive study of new residue generators and MOMAs is presented. The design methods given here take advantage of the periodicity of the series of powers of 2 taken modulo A (A is a module). Four design schemes of the $n$-input residue generators mod A, which are best suited for various pairs of $n$ and A, are proposed. Their pipelined versions can be clocked with the cycle determined by the delay of a full-adder and a latch. A family of design methods for parallel and word-serial MOMAs, using similar concepts, is also given. Both classes of circuits employ new highly-parallel schemes using carry-save adders with end-around carry and a minimal amount of ROM and are well-suited for VLSI implementation. They are faster and use less hardware than similar circuits known to date. One of the MOMAs is a high-speed residue-to-binary converter based on the Chinese remainder theorem.", } @ARTICLE{Moha9301:Cluster, AUTHOR="P. Mohapatra and Ch. Das and T. Feng", TITLE="Performance Analysis of Cluster-Based Multiprocessors", JOURNAL=ieeetc, VOLUME=43, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="A queueing model for performance evaluation of cluster-based multiprocessors is proposed in this correspondence. Most system components are modeled as M/D/1/L queues to capture deterministic service time and finite buffer behavior. Various subsystems are analyzed independently and then integrated for the system level analysis. Average delay, throughput, and processor utilization are the performance parameters studied in this analysis. The analytical results are first validated via simulation. Next, several design alternatives are discussed using the model. These include the effect of buffer length and identification of bottleneck centers for various design configurations.", } @ARTICLE{Kark9301:Use, AUTHOR="Younes Karkouri and El Mostapha Aboulhamid and E. Cerny and Alain Verreault", TITLE="Use of Fault Dropping for Multiple Fault Analysis", JOURNAL=ieeetc, VOLUME=43, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="A new approach to fault analysis is presented. We consider multiple stuck-at-0/1 faults at the gate level. First, a fault collapsing phase is applied to the network, so that equivalent faults are eliminated. During the analysis we consider frontier faults where there is at least a normal path from each faulty line to a primary output. It is shown that the set of frontier faults is equivalent to the set of multiple faults. Given an input vector, we evaluate the fault-free circuit and then propagate fault effects. Assuming that fault-free response is observed, a fault-dropping procedure is then applied to eliminate faulty conditions on lines, that are either absent or may be hidden by other faulty conditions. This method is applied to some benchmark circuits and achieves a high degree of efficiency.", } @ARTICLE{Mahm9301:Comments, AUTHOR="Syed M. Mahmud", TITLE="Comments on ``Synthetic Traces for Trace-Driven Simulation of Cache Memories''", JOURNAL=ieeetc, VOLUME=43, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="A number of errors have been discovered in the above paper: IEEE Transactions Computers, 41:4, 388-410, Apr. 1992. The authors of paper 1 have corrected some of these errors and presented in correspondence: D. Thiebant, J. L. Wolf, and H. Stone, ``Correction to `Synthetic trace for trace-driven simulation of cache memories,''' IEEE Transactions Computers, 42:5, 635-636, May 1993. The remaining errors are corrected and presented in this correspondence.", } @ARTICLE{Vinn9301:Generation, AUTHOR="Bapiraju Vinnakota and V. Nageshwara Rao", TITLE="Generation of All Reed-Muller Expansions of a Switching Function", JOURNAL=ieeetc, VOLUME=43, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="A simple method to determine the Reed-Muller canonical expansion is described. This method is based on array processing techniques similar to those used for the FFT. A specific advantage of the technique is that it can be used with minor modification to determine the expansion when some or all of the input variables are negated.", } @ARTICLE{Davi9301:Object, AUTHOR="J. Richard Davis and Tom Morgan", TITLE="Object-Oriented Development at Brooklyn Union Gas - A Case Study", JOURNAL=ieeesoft, VOLUME=10, NUMBER=1, PAGES="8 pages", MONTH=jan, YEAR=1993, ABSTRACT="Object-oriented principles can resolve long standing problems of software construction and evolution. The Brooklyn Union Gas Company found this to be true when it replaced its outdated customer information system with a new Customer-Related Information System (CRIS-II) developed using object-oriented techniques.", } @ARTICLE{Honi9301:Formalizing, AUTHOR="Shinichi Honiden and Nobuto Kotaka and Yoshinori Kishimoto", TITLE="Formalizing Specification Modeling in {OOA}", JOURNAL=ieeesoft, VOLUME=10, NUMBER=1, PAGES="13 pages", MONTH=jan, YEAR=1993, ABSTRACT="Our research is in formalizing a specification process for Object-Oriented Analysis (OOA). To do this, we built a basic specification process model according to case study result. The prototype we propose in this paper was made considering the OOA methodology -- proposed by Peter Coad and Edward Yourdon -- with the addition of our own application-specific activities. By dividing the model into two parts, data flows and control flows, we could analyze the chains of dependence between data and activities in a complex, round-trip process. As a result of this study, we specified three kinds of backward control flows among activities and some practical tips to execute the activities effectively. An intelligent software development environment (intelligent CASE) is defined as an environment that can provide appropriate guidance for novice users who are not familiar enough with the methodology employed by the environment. Our research can be applied to the implementation of such an environment from the specification process viewpoint.", } @ARTICLE{Jaco9301:Object, AUTHOR="Ivar Jacobson", TITLE="Object Orientation - The Model of the 21st Century", JOURNAL=ieeesoft, VOLUME=10, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="The whole software industry is now maturing. We are on our way to build industrial strength software systems. How far have we come? Let me try to make a comparison at the risk of oversimplifying. In the 1930's the car industry had started to agree on how a car should look. Every car manufacturer was in principle building cars with the same appearance. This was not so 50 years earlier when no one knew that a car industry of the 1880's. But, of course already in 1880, there were cars with a steering wheel, with the driver's seat in the front, etc. I am convinced that object-orientation is just such a technology which will hold far into the future. It will be further developed, refined, made more efficient but most important it will hold. Everyone who invest in this technology early on, builds up an infra-structure base. The company will not need to experience an expensive restructuring when changing technology.", } @ARTICLE{Pitt9301:Lessons, AUTHOR="Mattew Pittman", TITLE="Lessons Learned in Managing Object-Oriented Development", JOURNAL=ieeesoft, VOLUME=10, NUMBER=1, PAGES="11 pages", MONTH=jan, YEAR=1993, ABSTRACT={When asked to manage an object-oriented development for the first time, most managers immediately want to know what is different about the management process. Early work on object-oriented developments suggested that systems developed with object-oriented languages simply "grew," and design and implementation were simply different levels of abstraction. Management was of secondary importance, if not irrelevant. Of course, from the project manager's point of view this is very unsatisfactory. How can such a process be estimated, planned, tracked, and controlled? It turns out that serious object-oriented systems are not grown. They are managed, using techniques and skills based on existing project-management experience. The management of such systems, however, must take into account the nature of object-oriented development. In this article, I relate the experience I and my clients have gained in developing tightly constrained, custom systems, in which success depends on delivering a functional system on time and on budget, often for a fixed price. Many of the systems we developed had the additional constraint of real-time requirements, and most had some kind of reuse goals.}, } @ARTICLE{Poor9301:Planning, AUTHOR="J. H. Poore and Harlan D. Mills and David Mutchler", TITLE="Planning and Certifying Software System Reliability", JOURNAL=ieeesoft, VOLUME=10, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="Hardware reliability engineers have long been able to design a hardware system to a target reliability based upon the known reliability of components or by allocating reliability budgets to software, although reliability planning is seldom done. Ironically, hardware developers typically assign a reliability of 1.0 to a software component because they assume that software can be perfect, whereas hardware is denied perfection because it is physical. The key concept in any reliability analysis is the mode of failure. Hardware may have several modes of failure, including wear, design flaws, and unintended environmental phenomena among others. Software, too, has a mode of failure and it is very different from the hardware modes of failure. The software mode of failure stems from the assumption that the design and development process was not perfect, that mistakes were made and are reflected in faults in the code. As inputs are processed, faults in the code may be encountered. Failure occurs when the software deos not perform according to specifications for an input history. Thus, the measure of software reliability is based on the use of the software and its intended performance.", } @ARTICLE{Snyd9301:Essence, AUTHOR="A. Snyder", TITLE="The Essence of Objects: Common Concepts and Terminology", JOURNAL=ieeesoft, VOLUME=10, NUMBER=1, MONTH=jan, YEAR=1993, KEYWORDS="object; object-oriented programming; object-oriented databases; object-oriented user interfaces; distributed systems; terminology", ABSTRACT="Concepts originally developed in object-oriented programming languages are appearing in many other domains. There are object-oriented databases, object-oriented application frameworks and integration platforms, even object-oriented user interfaces. Object concepts are widely used in distributed systems and are prominent in the draft ISO standards for the management of open systems. In reviewing the object concept in several systems, we believe we have identified the essential concepts that appear in most of all of these systems. Identifying the common concepts is made more difficult by a lack of common terminology. The lack of common terminology hinders communication among researchers, developers, and users. In this article, we propose a common terminology for object concepts, chosed to be broadly applicable to many domains, not just programming languages. We describe the essential concepts, give examples, and provide a glossary defining the key terms.", } @ARTICLE{Wild9301:Maintaining, AUTHOR="Norman Wilde and Paul Matthews and Ross Huitt", TITLE="Maintaining Object-Oriented Software", JOURNAL=ieeesoft, VOLUME=10, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="Improvements to the software maintenance phase require software that is both easier to understand and easier to change. While object-orientation offers many features to facilitate change, it is not clear that object-oriented software will be easier to understand. This paper discusses the maintenance implications, both positive and negative, of object-oriented methodology and presents some proposed directions for design practices and for maintenance tool support.", } @ARTICLE{Yama9301:Object, AUTHOR="Shuntaro Yamazaki and Kiyohiko Kajihara and M. R. Ito and Ryuichi Yasuhara", TITLE="Object-Oriented Design of Telecommunication Software", JOURNAL=ieeesoft, VOLUME=10, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="As telecommunication systems become more advanced, there has been an increase in the variety telecommunication services requested. These requirements have led to larger and more complex software in telecommunication systems. New service must be developed to meet new demands as quickly as possible. This means that software for telecommunication systems will have to have structures that are easy to understand and that can easily be extended to new service facilities. Object-oriented design (OOD) is one solution to increase the maintainability and reliability of software. The central idea of OOD is to construct software according to the structure of the problems (i.e. target systems) to be solved by computers. OOD was first proposed by G. Booch, and many studies have been reported since then. However, the modeling of large-scale real-time systems such as telecommunication systems is very difficult because of the various aspects involved. This study aims to establish an OOD method which can be used in the development of large-scale telecommunication systems. This paper explains an object-oriented design method for telecommunication software called ROOD and presents an example of its application. First, we present the main characteristics of ROOD. Then, we explain an object model of ROOD. Finally, we discuss the evaluation result of ROOD and applied to a telecommunication system in terms of extendibility, reliability, and performance.", } @ARTICLE{Dutt9301:Cyclides, AUTHOR="Debasish Dutta and Richard K. Martin and Michael J. Pratt", TITLE="Cyclides in Surface and Solid Modeling", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=13, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="This paper reviews the current status of Dupin cyclides as surfaces for CAGD. These surfaces have low algebraic degree, can be rationally parametrized, and have a simple geometric representation in terms of three shape parameters. Cyclides provide a natural generalization of the surfaces traditionally used in solid modelling. We provide a brief history of cyclides, review their geometry and important properties, and discuss their applications in CAGD, as surface patches and blending surfaces.", } @ARTICLE{Hoff9301:Implicit, AUTHOR="Christoph M. Hoffman", TITLE="Implicit Curves and Surfaces in {CAGD}", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=13, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT={The role of implicit algebraic curves and surfaces in computer-aided geometric design is reviewed and its possible evolution discussed. Implicit curves and surfaces offer certain strengths that complement the strengths of parametric curves and surfaces. After reviewing basic facts from algebraic geometry, the problems of converting between implicit and parametric forms are explored. While conversion from parametric to implicit form is always possible in principle, a number of practical problems have forced the field to explore alternatives. We review some of these alternatives, based on two fundamental ideas. First, the symbolic computation necessary for the conversion cnan be deferred, and all geometry algorithms mapped to an "unevaluated" implicit form that is a vceratin determinant. This approach negotiates between symbolic and numerical computation, placing greater stress on the numerical side. Second, all symbolic computations can be side-stepped by not even formulating an implicit form, but rather using a more general system of nonlinear equations. Doing so simplifies a number of otherwise difficult geometric operations, but requires developing a separate algorithmic infrastructure. This second approach generalizes both implicit and parametric forms.}, } @ARTICLE{Mill9301:Incremental, AUTHOR="John M. Miller", TITLE="Incremental Boundary Evaluation Using Inference of Edge Classifications", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=13, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="The two most widely used representations in solid modeling are Constructive Solid Geometry (CSG) and Boundary Representation (BRep). Most modeling systems support model definition based on regularized Boolean set operations, regardless of whether the internal data representation is pure BRep or some CSG-BRep combination. The traditional approach to computing the boundary of the solid determined be such an operation is based in part on generating and partitioning a set of edges known to include all those on the result, and then classification is expensive, however, and it is advantageous to avoid it whenever possible. In this paper we describe an incremental algorithm which exploits in a variety of ways the availability of dual CSG and BRep representations of solids. For example, we are able to avoid the vast majority of explicit edge classifications with appropriate combinations of queries put to the two representations.", } @ARTICLE{Niel9301:Scattered, AUTHOR="Gregory M. Nielson", TITLE="Scattered Data Modeling", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=13, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="By comparing a variety of methods, this article provides the basis for selecting or customizing a method for modeling scattered 3D data.", } @ARTICLE{Patr9301:Surface, AUTHOR="Nicholas M. Patrikalakis", TITLE="Surface-to-Surface Intersections", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=13, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="Intersection is a fundamental process in computational geometry, needed to build interrogate models of complex shapes in the computer. We need intersection computation primarily to evaluate set operations on primitive columns in creating boundary representations of complex artifacts. Such capability helps in the design representation of complex objects, in finite-element discretizations, in computer animation, in feature recognition, and in simulation and control of manufacturing processes. Similarly, intersection is useful in scientific visualization to provide methods for visualizing implicitly defined objects and to contour multivariate functions representing some property of a system. In this article I survey recently introduce methods for surface-intersection computations. I start by classifying the techniques into four categories and discussing their principal features. Next I outline techniques for computing intersections of algebraic (implicit polynomial) surfaces with piecewise rational polynomial parametric surface patches (such as rational B-splines). Following this, I summarize methods for computing intersections of two piecewise rational polynomial parametric surface patches, such as two rational B-splines. Some of these methods also apply to the general parametric surface-intersection problem. I conclude with some outstanding problems in the area of surface intersections.", } @ARTICLE{Schu9301:Triangulation, AUTHOR="Larry L. Schumaker", TITLE="Triangulation in {CAGD}", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=13, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="Triangulations play an important role in approximation their, finite element methods, numerical analysis, computer aided geometric design, and elsewhere. They are often used to define a partitioned domain on which to build various spaces of functions which might be used to approximate or model surfaces. In this tutorial we discuss triangulations in the plane, in space, and on the surface of a sphere, and outline some of their applications.", } @ARTICLE{Side9301:Polar, AUTHOR="Prof. Dr. Hans-Peter Sidel", TITLE="Polar Forms and Computer Aided Geometric Design - An Introduction", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=13, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="Polar forms simplify the construction of polynomial and piecewise polynomial curves and surfaces and lead to new surface representations and algorithms. This paper provides an introduction to polar forms and shows how polar forms yield closed form solutions to various recursive algorithms that are used in Computer Aided Geometric Design. As a consequence, we obtain a sample new labeling scheme for Bezier and B-spline curves and surfaces that allows us to label control points in a consistent and meaningful way. The presentation concludes with a survey of some recent new results that were obtained using polar forms.", } @ARTICLE{Spet9301:Versatile, AUTHOR="Phoebe G. Spetsieris and Vijay Dhawan and Shugo Takikawa and Donalde Margouleff and David Eidelberg", TITLE="A Versatile Graphics-Image Processing Package for Imaging Cerebral Function", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=13, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT={Positron Emission Tomography (PET) enables the non-invasion study of metabolic function in organs such as the brain and heart. Because of the complex nature of the physiological information inherent in unprocessed PET data, the application of innovation as well as standard graphical techniques necessary for optimum visual representation and quantitative evaluation. We have developed a simple yet versatile graphics and image processing package that addresses many of the special visualization and analysis problems particular to PET as well as other functional modalities. The salient features of "ScAn/VP" (Scan Analysis and Visualization Processor) and its application to the perception and evaluation of disease patterns and normal brain function are described.}, } @ARTICLE{Butl9301:Infeasibility, AUTHOR="Ricky W. Butler and George B. Finelli", TITLE="The Infeasibility of Quantifying the Reliability of Life-Critical Real-Time Software", JOURNAL=ieeese, VOLUME=19, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="This paper affirms that the quantification of life-critical software reliability is infeasible using statistical methods whether applied to standard software or fault-tolerant software. The classical methods of estimating reliability are shown to lead to exhorbitant amounts of testing when applied to life-critical software. Reliability growth models are examined and also shown to be incapable of overcoming the need for excessive amounts of testing. The key assumption of software fault tolerance--separately programmed versions fail independently--is shown to be problematic. This assumption cannot be justified by experimentation in the ultrareliability region and subjective arguments in its favor are not sufficiently strong to justify it as an axiom. Also, the implications of the recent multiversion software experiments support this affirmation.", } @ARTICLE{Sohi9301:High, AUTHOR="Gurindar S. Sohi", TITLE="High-Bandwidth Interleaved Memories for Vector Processors - A Simulation Study", JOURNAL=ieeetc, VOLUME=42, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="Sustained memory bandwidth for a range of access patterns is a key to high-performance vector processing. Interleaving is a popular way of constructing a high-bandwidth memory system. However, for some access patterns conflicts reduce the bandwidth of a standard, low-order interleaved memory. To improve memory bandwidth for a wide range of access patterns, alternate interleaving schemes must be considered. This paper studies a family of alternate interleaving schemes called permutation-based interleaving schemes. Permutation-based interleaving schemes can be implemented with a small amount of additional hardware and with a minimal time overhead. A detailed simulation analysis been carried out in this paper. The simulation analysis suggests that, with adequate buffering, permutation-based interleaving schemes similar to those studied in this paper can be used to implement a high-bandwidth memory system for vector processors. The resulting memory system sustains its bandwidth for a wide variety of access patterns and for large bank busy times far better than a memory system with standard interleaving.", } @ARTICLE{Ravn9301:Specifying, AUTHOR="Anders P. Ravn and Hans Rischel and Kirsten M. Hansen", TITLE="Specifying and Verifying Requirements of Real-Time Systems", JOURNAL=ieeese, VOLUME=19, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="An approach to specification of requirements and verification of design for real-time systems is presented. A system is defined by a conventional mathematical model for a dynamic system where application specific states denote functions of real time. Specifications are formulas in the Duration Calculus, a real-time interval logic, where predicates define durations of states. Requirements define safety and functionality constraints on the system or a component. A top level design is given by a control law: a predicate that defines an automaton controlling the transition between phases of operation. Each phase maintains certain relations among the system states; this is analogous to the control functions known from conventional control theory. The top level design is decomposed into an architecture for a distributed system with specifications for sensor, actuator and program components. Programs control the distributed computation through synchronous events. Sensors and actuators relate events with system states. Verification is a deduction showing that a design implies requirements.", } @ARTICLE{Mend9301:Modeling, AUTHOR="Abraham Mendelson and Dominique Thi baut and Dhiraj K. Pradhan", TITLE="Modeling Live and Dead Lines in Cache Memory Systems", JOURNAL=ieeetc, VOLUME=42, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="This paper presents a new analytical model which predicts the fraction of live and dead lines present in a cache memory, in a multitasking environment. The model is two-fold; The first portion evaluates the number of live lines created in a fully associative cache during the execution of a process. The second portion models the interaction of two processes which share a cache and run in an interleaved fashion. The model admits direct-mapped, set-associative, and fully associative cache architectures. The complete model assumes a hyperbolic (or fractal) model of program behavior. Also it predicts the variations of the total number of lines (footprint) as well as the number of live lines held by a process in the various caches as a function of the number of cache accesses. The accuracy of the model is validated through trace driven simulations.", } @ARTICLE{Papa9301:Vertical, AUTHOR="C. A. Papachristou and Venkata R. Immaneni", TITLE="Vertical Migration of Software Functions and Algorithms Using Enhanced Microsequencing", JOURNAL=ieeetc, VOLUME=42, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="The aim of this work is to develop a scheme for vertical migration of algorithms and functions with complex sequencing structure from software through firmware into microcoded VLSI structures. The expected benefits of migration are gains in speed, reliability, and stability. The scheme employs a new migration model, based on microcode modularity, and is supported by a hardware microcontroller with enhanced sequencing capability. The basic idea is to capture, via effective compilation techniques, the explicit or implicit sequencing structure of a function. Migration is then effected by sequencing calls into a library of microcode modules of a target machine architecture. The modularity of the migration system is, by design, well suited for generating VLSI microcode, thus facilitating the migration of sofware functions into microcoded VLSI structures (PLA's, SLA's). The migration scheme has been evaluated in a simulated environment consisting of several firmware development tools. The experimental results show substantial time performance improvements in comparison to software implementations. Comparisons to traditional migration approaches indicate that the proposed scheme is faster and requires less memory space for the migration of software algorithms into firmware.", } @ARTICLE{Kurk9301:Stepwise, AUTHOR="Reino Kurki-Suonio", TITLE="Stepwise Design of Real-Time Systems Reino Kurki-Suonio", JOURNAL=ieeese, VOLUME=19, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="The joint action approach to modeling of reactive systems is presented and augmented with real time. This leads to a stepwise design method where temporal logic of actions can be used for formal reasoning, superposition is the key mechanism for transformations, the advantages of closed-system modularity are utilized, logical properties are addressed before real-time properties, and real-time properties are enforced without any specific assumptions on scheduling. As a result, real-time modeling is made possible already at early stages of specification, and increased insensitivity is achieved with respect to properties imposed by implementation environments.", } @ARTICLE{Heeg9301:Practical, AUTHOR="Chris Heegard and Scott Lery and Woo H. Paik", TITLE="Practical Coding for {QAM} Transmission of {HDTV}", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="111-118", MONTH=jan, YEAR=1993, REFERENCES=12, ABSTRACT={This paper describes a practical approach to digital transmission of compressed HDTV. We demonstrate how modulation schemes based on QPSK modulation can be directly incorporated into QAM-based modulation systems. We shall argue that this leads directly to an easily implementable structure that is both efficient in bandwidth and data reliability. The use of a concatenated code is known to provide an effective and practical approach to achieving low BER, high data rate, and modest implementation complexity. It is our contention that the correct solution to the concatenated coding problem for HDTV transmission is to simply extend the modulation codes developed for QPSK-to-QAM modulation. In nonconcatenated situations, a trellis code based on a binary code at rate 2/3 is usually best; this fact follows from the study of the asymptotic coding gain of a trellis code. However, this is not the case for higher error rates at the output of the trellis decoder (e.g., when a symbol error correcting decoder follows as in a concatenated code). The reason for this follows from an analysis of the effect of the number of "nearest neighbors" on the error rate. A four-way partition of QAM is a natural extension of QPSK modulation; it is a simple matter to incorporate any good QPSK code into a trellis coding scheme for QAM modulation. We propose a concatenated coding scheme based on QPSK trellis codes and symbol error correcting coding. A specific example is presented which shows the advantages of this approach.}, } @ARTICLE{Smit9301:Threshold, AUTHOR="Stephen Leslie Smith", TITLE="Threshold Validity for Mutual Neighborhood Clustering", JOURNAL=ieeepami, VOLUME=15, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="Clustering algorithms have the annoying habit of finding clusters in random data. This note presents a theoretical analysis of the threshold of the Mutual Neighborhood clustering algorithm [1] under the hypothesis of random data. This yields a theoretical minimum value of this threshold below which even unclustered data is broken into separate clusters. To derive the threshold, a theorem about mutual near neighbors in a Poisson process is stated and proved. Simple experiments demonstrate the usefulness of the theoretical thresholds.", } @ARTICLE{Berg9301:Generic, AUTHOR="Robert Bergevin and M. D. Levine", TITLE="Generic Object Recognition: Building and Matching Coarse Descriptions from Line Drawings", JOURNAL=ieeepami, VOLUME=15, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="This paper introduces primal access recognition of visual objects (PARVO), which is a computer vision system that addresses the problem of fast and generic recognition of unexpected 3-D objects from single 2-D views. After more than 20 yr, the field of computer vision has still not produced any clear understanding of how this complex high-level visual ability is even possible. On the other hand, the human visual system is an existence proof that such a competence is attainable. This is demonstrated informally by everyone's daily experience and more formally by the results of various psychological studies. Recently, RBC, which is a new human image understanding theory, has been proposed on the basis of some of these psychological results. However, no systematic computational evaluation of its many aspects has yet been reported. Such an evaluation is essential if the theory is ever to play a role in the progress of the computer vision field. The PARVO system discussed in this paper is a first step towards this goal since its design respects and makes explicit the main assumptions of the proposed theory. It analyses single-view 2-D line drawings of 3-D objects typical of the ones used in human image understanding studies. It is designed to handle partially occluded objects of different shape and dimension in various spatial orientations and locations in the image plane. The system is shown to successfully compute generic descriptions and then recognize many common man-made objects.", } @ARTICLE{Lati9301:Combinatorial, AUTHOR="Shahram Latifi", TITLE="Combinatorial Analysis of the Fault-diameter of the $n$-cube", JOURNAL=ieeetc, VOLUME=42, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="We present a simple method to show that the diameter of an n-dimensional hypercube can only increase by an additive constant of 1 when (n-1) faulty processors are present. Based on the concept of Forbidden Faulty Sets [1], which guarantees the connectivity of the cube in the presence of up to $(2n-3)$ faulty processors, we show that the diameter of the $n$-cube increases to $(n+2)$ as a result of $(2n-3)$ processor failures. More interestingly, we show that only those nodes whose Hamming distance is $(n-2)$ have the potential to be located at two ends of the diameter of the damaged cube. It is further proven that all the $n$-cubes with $(2n-3)$ faulty processors and a fault-diameter of $(n+2)$ are isomorphic. Finally, a generalization to the subject study is presented.", } @ARTICLE{Tang9301:Dependability, AUTHOR="D. T. Tang and Ravishankar Iyer", TITLE="Dependability Measurement and Modeling of a Multicomputer System", JOURNAL=ieeetc, VOLUME=42, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="This paper presents a measurement-based analysis of error data collected from a DEC VAXcluster multicomputer system. Basic system dependability characteristics such as error/failure distributions and hazard rates are obtained for both the individual machine and the entire VAXcluster. Markov reward models are developed to analyze error/failure behavior and to evaluate performance loss due to errors/failures. Correlation analysis is then performed to quantify relationships of errors/failures across machines and across time. It is found that shared resources constitute a major reliability bottleneck; nearly 43\% of all machine failures are due to errors in shared resources. Approximately 58\% of all errors and 27\% of all failures occur in bursts and involve multiple machines. This suggests that correlated errors and failures are significant. Reward analysis shows that on the average, the system performance degrades to 61\% of its full capacity during the disk error recovery, while software errors almost always result in system failures. The VAXcluster availability is estimated to be 0.995 for 250 days of operation by the steady-state reward calculation. It is shown that for the measured system, the homogeneous Markov model which assumes constant failure rates, overestimates the transient reward rate for the short-term operation, and underestimates it for the long-term operation. Correlation analysis shows that errors are highly correlated (average correlation coefficient 0.6) across machines and across time. The failure correlation coefficient is low ($<0.1$). However, its effect on system unavailability is significant.", } @ARTICLE{Ulup9301:Perception, AUTHOR="Fatih Ulupinar and Ramakant Nevatia", TITLE="Perception of {3-D} Surfaces from {2-D} Contours", JOURNAL=ieeepami, VOLUME=15, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="Inference of 3-D shape from 2-D contours in a single image is an important problem in machine vision. We survey classes of techniques proposed in the past and provide a critical analysis. We propose that two kinds of symmetries in figures, called parallel and skew symmetries, give significant information about surface shape for a variety of objects. We derive the constraints imposed by these symmetries and show how to use them to infer 3-D shape. We discuss the Zero Gaussian Curvature (ZGC) Surfaces in depth, and show results on recovery of surface orientation for various ZGC surfaces.", } @ARTICLE{Tami9301:Symmetric, AUTHOR="Yuval Tamir and H.-M. Chi", TITLE="Symmetric Crossbar Arbiters for {VLSI} Communication Switches", JOURNAL=ieeepds, VOLUME=4, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT={Small crossbars are key components of communication switches used in multicomputer interconnection networks. The traffic through the switches is often delayed due to conflicting demands for resources, such as buffer space or output ports. Hence, switches must include arbiters that resolve conflicting resource demands. Efficient design and implementation of these arbiters is critical for maximizing network performance. In order to maximize performance, recent communication switch designs allow packets at an input port, destined to different output ports, to be transmitted through the switch in any order. Each input port contends for multiple output ports but needs only one for full utilization. Similarly, each output port contends for multiple input ports and needs one for full utilization. The arbitration task is thus symmetrical with respect to inputs and outputs. This paper focuses on the design and implementation of symmetric crossbar arbiters. Several arbiter designs are compared based on simulations of a multistage interconnection network. These simulations demonstrate the influence of the switch arbitration policy on network throughput, average latency, and worst-case latency. It is shown that some "natural" designs result in poor system performance and/or slow implementations. Two efficient arbiter implementations are proposed. Based on network simulations, VLSI implementation, and circuit simulation, it is shown that these arbiters achieve nearly optimal system performance without becoming the critical path that limits the system clock.}, } @ARTICLE{Burn9301:View, AUTHOR="James Burns and Richard Weiss and E. M. Riseman", TITLE="View Variation of Point-Set and Line-segment Features", JOURNAL=ieeepami, VOLUME=15, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="The recognition of 3-D objects becomes much more difficult as the position of the viewer relative to the object becomes less constrained. Part of this difficulty comes from the fact that many important features of an object's image vary with view. This paper is a study of the variation, with respect to view, of 2-D features defined for projections of 3-D point sets and line segments. It is first established that general-case view-invariants do not exist for any number of points, given true perspective, weak perspective or orthographic projection models. The remainder of the paper focuses on feature variation under the weak perspective approximation. Though there are no general-case weak-perspective invariants, there are special-case invariants of practical importance. The special-case weak-perspective invariants cited in the literature are derived from linear dependence relations and the invariance of this type of relation to linear transformation. The variation with respect to view is then studied for an important set of 2-D line segment features: the relative orientation, size, and position of one line segment with respect to another. The analysis includes an important evaluation criterion for feature utility in terms of view-variation: the relationship between the fraction of views (over a view sphere) and the range of values assumed by a feature over these views. This relationship is a function of both the feature and the particular configuration of 3-D line segments; an analysis and series of graphs are presented for each of the features and for different configurations of 3-D line segments. Finally, the use of this information in objection recognition is demonstrated in difficult discrimination tasks.", } @ARTICLE{Lin9301:Improved, AUTHOR="H.-A. Lin and Chao-Li Tarng", TITLE="An Improved Method For Constructing Multi-Phase Communications Protocols", JOURNAL=ieeetc, VOLUME=42, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="Research has shown that many communications protocols exhibit multiple phases of behavior, performing a distinct function in each phase. A systematic method has been proposed by Chow, Gouda and Lam for building multi-phase protocols. By connecting several simpler protocols modeling the specific phases in a disciplined way, the newly constructed multi-phase protocol enjoys the same correctness properties as the individual phases. The inherent modularity of the resultant protocol makes it easier to understand and analyze. However, the applicability of the existing method is subject to two rather stringent restrictions: the inability to handle message corruption or loss during phase transitions, and a rigid requirement on the selection of the points that connect different phases. This paper describes an improved method that either relaxes or eliminates the above restrictions. The construction of the Normal Response Mode of HDLC (High-level Data-Link Control) is presented to illustrate the use of this new method.", } @ARTICLE{Kana9301:Unbiased, AUTHOR="Kenichi Kanatani", TITLE="Unbiased Estimation And Statistical Analysis Of {3-D} Rigid Motion From Two Views", JOURNAL=ieeepami, VOLUME=15, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT={The problem of estimating 3-D rigid motion from point correspondences over two views is formulated as nonlinear least-squares optimization, and the statistical behaviors of the errors in the solution are analyzed by introducing a realistic model of noise described in terms of the covariance matrices of "N-vectors". It is shown that that the least-squares solution based on the epipolar constraint is statistically biased. The geometry of this bias is described in both quantitative and qualitative terms. Finally, an unbiased estimation scheme is presented, and random number simulations are conducted to observe its effectiveness.}, } @ARTICLE{Yama9301:Direct, AUTHOR="Makoto Yamamoto and Pierre Boulanger and J.-Angelo Beraldin and Marc Rioux", TITLE="Direct Estimation of Range Flow on Deformable Shape from A Video Rate Range Camera", JOURNAL=ieeepami, VOLUME=15, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="This correspondence describes a method capable of estimating range flow (space displacement vector field) on nonrigid objects as well as rigid objects from a sequence of range images. This method can directly estimate the deformable motion parameters by solving a system of linear equations which are obtained from substituting a linear transformation of nonrigid objects expressed by the Jacobian matrix into motion constraints based on an extension of the conventional scheme used in intensity image sequence. The range flow is directly computed by substituting these estimated motion parameters into the linear transformation. The algorithm is supported by experimental estimations of range flow on a sheet of paper, a piece of cloth, human skin, and a rubber balloon being inflated, using real range image sequences acquired by a video rate range camera.", } @ARTICLE{Chen9301:Efficient, AUTHOR="L. Chen and L. Davis and C. Kruskal", TITLE="Efficient Parallel Processing of Image Contours", JOURNAL=ieeepami, VOLUME=15, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="This paper describes two parallel algorithms for ranking the pixels on a curve in $O(\log N)$ time using either a EREW or CREW PRAM model. The algorithms accomplish this with $N$ processors for a $\sqrt(N)\times \sqrt(N)$ image. After applying such an algorithm to an image, we are able to move the pixels from a curve into processors having consecutive addresses. This is important because we can subsequently apply many algorithms to the curve (such as piecewise linear approximation algorithms or point in polygon tests) using segmented scan operations (i.e. parallel prefix operations). Scan operations can be executed in logarithmic time on many interconnection networks, such as hypercube, tree, butterfly, and shuffle exchange machines, as well as on the EREW PRAM. The algorithms were implemented on the hypercube structured Connection Machine, and various performance tests were conducted.", } @ARTICLE{Hu9301:Angle, AUTHOR="Yu Hen Hu and S. Naganathan", TITLE="An Angle Recoding Method for {CORDIC} Algorithm Implementation", JOURNAL=ieeetc, VOLUME=42, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="CORDIC (COordinate Rotation DIgital Computer) is an iterative arithmetic algorithm for computing generalized vector rotations without performing multiplications. For applications where the angle of rotation is known in advance, we shall present in this paper a method to speedup the execution of the CORDIC algorithm by reducing the total number of iterations. This is accomplished by using a technique called Angle Recoding, which encodes the desired rotation angle as a linear combination of very few elementary rotation angles. Each of these elementary rotation angles takes one CORDIC iteration to compute. The fewer the number of elementary rotation angles, the fewer the number of iterations are required. A Greedy algorithm which takes only $O(n^2)$ operations is developed in this paper to perform CORDIC angle recoding. It is proved that this algorithm is able to reduce the total number of required elementary rotation angles by at least 50\% without affecting the computational accuracy. Simulation results will also be presented.", } @ARTICLE{Thom9301:Determining, AUTHOR="A. Thomasian", TITLE="Determining the Number of Remote Sites Accessed in Distributed Transaction Processing", JOURNAL=ieeepds, VOLUME=4, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="We characterize the number of remote accesses and the number of distinct remote sites accessed by global transactions in a distributed database environment. Both measures are important in determining the overhead of distributed transaction processing and are affected by the distribution of transaction size (number of distinct objects accessed by a transaction) and the distribution of remote accesses made by a transaction. Keeping the mean transaction size fixed, we show that in the case of some commonly used distributions for the number of remote accesses (e.g., the binomial and uniform distribution) variable size transactions access a fewer number of distinct remote sites on the average than fixed size transactions. Also for these and some other distributions (for the number of remote accesses) the mean number of remote accesses is independent of the distribution of transaction size, but this is not generally true. In cases when variable size transactions have a higher mean number of remote accesses than fixed size transactions, fixed size transactions still tend to access a larger number of remote sites than variable size transactions, but this is not always true when variable size transactions have a higher mean for the number of remote accesses than fixed size transactions.", } @ARTICLE{Kim9301:Distributed, AUTHOR="Kyu-han Kim and A. Kavianpour", TITLE="A Distributed Recovery Block Approach to Fault-Tolerant Execution of Application Tasks in Hypercubes", JOURNAL=ieeepds, VOLUME=4, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="An approach to fault-tolerant execution of real-time application tasks in hypercubes is proposed. The proposed approach is based on the distributed recovery block (DRB) scheme that was developed earlier and experimentally demonstrated. The approach does not require special hardware mechanisms in support of fault tolerance. In this approach, each task is assigned to a pair of processors forming a DRB computing station for execution in a dual-redundant and self-checking mode. Assignment of all tasks in an application in such a form is called the full DRB mapping. The DRB scheme was developed as an approach to uniform treatment of hardware and software faults with the effect of fast forward recovery. However, if the system developer is concerned with hardware fault possibilities only, but not with possible inadequacies of the application task software, then forming DRB stations becomes a mechanical process not burdening the application software designer in any way. A procedure for converting an efficient nonredundant task-to-processor mapping into an efficient full DRB mapping is presented and its optimality is proven. As an illustration of this procedure called the symmetric duplexing, optimal strategies for full DRB mapping of complete binary tree task structures to hypercubes are obtained.", } @ARTICLE{Oduo9301:Generalized, AUTHOR="V. Oduol and Sal Morgera", TITLE="Performance Evaluation of the Generalized {Type-II} Hybrid {ARQ} Scheme with Noisy Feedback on Markov Channels", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="By taking a particular look at the Generalized Type-II Hybrid ARQ scheme on Markov channels, this work investigates the effect of feedback channel errors on the performance of ARQ systems. In the analysis of ARQ methods, it is quite often assumed that the feedback channel is error-free. However, taking into account the feedback channel errors provide a more realistic evaluation of the performance. The main contribution of this work is that it demonstrates that it is indeed possible to derive expressions for certain critical performance parameters, such as the throughput efficiency, the probabilities of packet loss, undetected error, and correct delivery. To provide a means of comparison, the paper provides, in the Appendix, a parallel set of expressions under the usual assumption of an error-free feedback channel. By use of simulations, ARQ system performance is examined under the two cases--noiseless feedback and noisy feedback. It is found that feedback channel noise can result in the loss of packets, an increase in the number of undetected errors, and the occurrence of unnecessary transmissions. To enhance the performance of the GH-II ARQ scheme, a predictor is used and found to provide remarkable performance improvement--lowering the probability of undetected error, reducing the number of unnecessary transmissions, and increasing the throughput efficiency. The results presented are felt to be important for system design employing ARQ error control methods.", } @ARTICLE{Simo9301:Maximum, AUTHOR="Marvin K. Simon and D. Divsalar", TITLE="Maximum-Likelihood Block Detection of Noncoherent Continuous Phase Modulation", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="This paper examines maximum-likelihood block detection of uncoded full response CPM over an additive white Gaussian noise (AWGN) channel. Both the maximum-likelihood metrics and the bit error probability performances of the associated detection algorithms are considered. The special and popular case of minimum-shift-keying (MSK) corresponding to h=0.5 and constant amplitude frequency pulse is treated separately. The many new receiver structures that result from this investigation can be compared with the traditional ones that have been used in the past both from the standpoint of simplicity of implementation and optimality of performance.", } @ARTICLE{Kim9301:Adaptive, AUTHOR="Young Han Kim and James W. Modestino", TITLE="Adaptive Entropy-Coded Pruned Tree-Structured Predictive Vector Quantization of Images", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="In recent work, we described an adaptive entropy-coded predictive vector quantization (PVQ) scheme for images which was shown to be capable of excellent rate-distortion performance and to be surprisingly robust when applied to images outside the training set used in its design. This scheme made use of several entropy-constrained vector quantizers (ECVQ's), each with a corresponding Huffman encoder/decoder pair, embedded in a vector predictive feedback loop. The particular entropy-coded ECVQ in effect for any input image block depended upon the instantaneous occupancy state of a buffer used to interface the resulting variable-length codewords to a fixed-rate transmission or storage channel. The entroy-coded PVQ scheme is a vector extension of previous work on adaptive entropy-coded predictive scalar quantization (PSQ); in particular, 2-D DPCM. The embedded ECVQ in this adaptive entropy-coded PVQ scheme made use of a modification of a recnetly introduced design algorithm, based upon clustering, which resulted in unstructured codebooks. Unfortunately, the computational complexity associated with this unstructured embedded ECVQ can be substantial. In this paper we describe much simpler versions of this adaptive entropy-coded PVQ scheme where the embedded ECVQ is replaced by a pruned tree-structured VQ (PTSVQ). The resulting encoding scheme is shown to result in drastically reduced complexity at only a small cost in performance. We demonstrate coding results on selected real-world images.", } @ARTICLE{Chun9301:Multimode, AUTHOR="Habong Chung and Stephen Wilson", TITLE="Multimode Modulation and Coding of {QAM}", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="4 pages", MONTH=jan, YEAR=1993, ABSTRACT={A general-purpose modulation and coding implementation is described based on the QAM of modulation. The technique utilizes the "superposed" property of certain rectangular QAM constellations, along with the fact that optimal four-state trellis codes for such constellations are essentially identical, to provide a single modem architecture capable of performing over a wide range of power and bandwidth efficient transmission using either uncoded or coded modulation scheme. While the specific modulation and coding techniques are not new, we believe that their intrinsic compatibility is not well-known and provides attractive system flexibility.}, } @ARTICLE{Scho9301:Traffic, AUTHOR="Julie Schor and T. G. Robertazzi", TITLE="Traffic Sensitive Algorithms and Performance Measures for the Generation of Self-Organizing Radio Network Schedules", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="4 pages", MONTH=jan, YEAR=1993, ABSTRACT={The generation of transmission schedules for self-organizing radio networks by traffic sensitive algorithms is described. A centralized "Traffic" algorithm that can be used as a performance benchmark is presented. Also described is a distributed "Degree" algorithm that is a traffic sensitized vision of an algorithm developed by Ephremides and Truong. Two performance measures for comparing schedules and simulation results are also presented.}, } @ARTICLE{Ragh9301:Optimum, AUTHOR="Sreenivasa A. Raghavan and Gideon Kaplan", TITLE="Optimum Soft Decision Demodulaton for {ISI} Channels", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="Two different methods of soft decision demodulation for channels with finite intersymbol interference (ISI) in the presence of AWGN are analyzed. In both schemes, the cut-off rate Ro of the discrete channel created by the demodulator output quantization is chosen as the design criterion. Expressions for the optimal thresholds of the quantizer associated with the demodulation of binary signals are derived. Results for the channel with memory equal to one symbol duration are presented. As a special case, the (1-D) channel with soft decision demodulation is analyzed. Closed form solutions show that a 4-bit quantizer improves performance substantially in this case.", } @ARTICLE{Chan9301:TDMA, AUTHOR="L. F. Chang and Nelson Sollenberger and Sirikat Ariyavisitakul", TITLE="Performance of a {TDMA} Portable Radio System Using A Cyclic Block Code for Burst Synchronization and Error Detection", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="In this paper, a combined burst synchronization and error detection scheme is studied for a TDBMA portable radio system. Analysis, computer simulation and experimental results of the false acceptance rate of the system using the combined scheme are presented. It is found that for a (161,147) code used in this study, which is capable of correcting +6 bits sync slippage, the error detection capability of the code is degraded by 3 bits on a slow Rayleigh fading channel using coherent QPSK demodulation with differential decoding. However, lower implementation complexity and high efficiency are obtained than with separate burst synchronization and error detection processes.", } @ARTICLE{Shap9301:Nested, AUTHOR="G. Shapiro and Harry Perros", TITLE="Nested Sliding Window Protocols with Packet Fragmentation", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="A single-hop OSI structured network with multiple layers of sliding window flow control and packet fragmentation between layers is analyzed. An approximation algorithm is presented to hierarchically reduce the network to a single queue whose performance characteristics represent the original network. Network transmission characteristics are restricted to Erlang distributions. Validation against exact and simulation results showed that the approximation algorithm has a satisfactory error level.", } @ARTICLE{Gree9301:Sharp, AUTHOR="A. G. Greenberg and J. Goodman", TITLE="Sharp Approximate Models of Deflection Routing in Mesh Networks", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="Deflection routing is a simple, decentralized, and adaptive method for routing data packets in communication networks. In this paper we focus on deflection routing in the Manhattan street network (a two dimensional directed mesh), though our analytic approach should apply to any regular network. We present two approximate performance models that give sharp estimates of the steady state throughput and the average packet delay for packets admitted to the network. The results of extensive simulation experiments are reproduced, which corroborate the model's predictions. The results show that deflection routing is very effective. Two measures of the merit of a network for deflection routing are its diameter and its deflection index. Networks are presented whose diameter and deflection index are near the optimal values.", } @ARTICLE{Serf9301:Combined, AUTHOR="Salomon Serfaty", TITLE="Performance of Combined Trellis Coded Modulation and Nonlinear Cancellation", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="4 pages", MONTH=jan, YEAR=1993, ABSTRACT="The performance of nonlinear cancellation schemes is limited by the accuracy of tentative decisions. This correspondence analyzes the performance of combined trellis coded modulation and nonlinear cancellation. A scheme is proposed to make use of the redundancy of the code. It is shown that performance close to optimum can be achieved with this scheme.", } @ARTICLE{Hine9301:NASA, AUTHOR="Sami Hinedi", TITLE="{NASA's} Next Generation All-Digital Deep Space Network Breadboard Receiver", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="This paper describes the breadboard Advanced Receiver (ARX) that is currently being built for future use in NASA's Deep Space Network (DSN). This receiver has unique requirements in having to operate with very weak signals from deep space probes and provide high quality telemetry and tracking data. The hybrid analog/digital receiver performs multiple functions including carrier, subcarrier and symbol synchronization. Tracking can be achieved for either residual, suppressed or hybrid carriers and for both sinusoidal and square wave subcarriers. System requirements are specified and a functional description of the ARX is presented. The various digital signal processing algorithms used are also discussed and illustrated with block diagrams. Other functions such as time tagged doppler extraction and monitor/control are also discussed including acquisition algorithms and lock detection schemes.", } @ARTICLE{Cho9301:Queue, AUTHOR="Yong Soo Cho and Chong Kwan Un", TITLE="Analysis of the {M/G/1} Queue Under a Combined Preemptive/Nonpreemptive Priority Discipline", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="In this paper, we propose a combined preemptive/nonpreemptive priority discipline. When a high-priority job arrives at the system while a low-priority job is being in service, the high-priority job will be served immediately and the low-priority job will go back to the head of the queue of its class, if a discretion rule for preemption is satisfied. Otherwise, the high-priority job waits in queue until the completion of the low-priority job service. As the discretion rule for preemption, we consider three schemes, each based on the parameter of the low-priority; the elapsed service time, the ratio of elapsed to total service time, and the remaining service time. Using the busy-period analysis technique, we analyze an M/G/1 queueing system with multiple priority classes of jobs. Considered preemptive rules are the preemptive-resume and preemptive-repeat-identical policies. As results, we present the Laplace transforms associated with waiting time and response time, the $z$-transform for the number of jobs in the system as well as their expectations. We also show some numerical examples, and consider practical applications of the model.", } @ARTICLE{Kwon9301:Interference, AUTHOR="Hyuck Kwon and Y. C. Loh and Kwei Tu", TITLE="Interference Effects on Space Station Freedom and Space Shuttle Ku-Band Downlinks", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="The Space Shuttle Orbiter (SSO) Ku-band and Single Access Return (KSAR) link and the Space Station Freedom (SSF) KSAR link via the Tracking and Data Relay Satellite System (TDRSS) use the same carrier frequency. The interference between spacecraft is minimized by opposite antenna polarizations and by TDRSS antenna beam pointing, but if the SSF and SSO are in close proximity, it is expected that mutual interference will be significant. Recently, Tsang and Su [1,2] simulated the mutual interference effects, using a practical nonlinear bandlimited channel. The purpose of this paper is to demonstrate that a simplified (i.e., linear band-limited channel) analytical approach will yield adequate accuracy for the expected range of operating conditions. Relative degradation in bit energy-to-thermal noise power spectral density ratio to achieve a 10E-5 coded bit-error-probability is determined to be 4 dB for the Ku-band SSO- to-TDRS I-channel return link with a 4.5 dB effective signal-to-interference total power ratio (S/I) when the Ku-band SSF-to-TDRS return link interferes, whereas Su's simulation yields approximately 5 dB degradation. For the Ku-band SSF-to-TDRS return link, both analysis and simulation results yield signal degradation of 0.4 dB at the effective S/I=21.6 dB. In conclusion, interference on the Ku-band SSO-to-TDRS I-channel return link is significant, but on the Ku-band SSF-to-TDRS return link it is negligible.", } @ARTICLE{Vigi9301:Application, AUTHOR="A. J. Vigil and M. A. Belkerdid and D. C. Malocha", TITLE="Application of Classical Cosine Series Window Functions Full Response Signaling Offset Quadrature Binary Modulation Systems", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="4 pages", MONTH=jan, YEAR=1993, ABSTRACT="Classical cosine series window functions have been applied to the synthesis of finite impulse response filters because of their closed analytic form and low sidelobe levels. It is proposed that classical cosine series window functions be applied to finite symbol duration quadrature binary modulation systems as pulse shapes in the interest of increasing the spectral confinement of the resulting modulated signals. The respective modulation systems are analyzed in terms of modulated signal envelope uniformity, spectral confinement and bit error rate in the response of white gaussian noise with varying degrees of modulated signal amplitude compression. It is observed that even in the presence of moderate modulated signal compression, classical cosine series window function pulse shapes offer equal or better spectral confinement for quadrature binary modulation systems than the conventional pulse shapes corresponding to QPSK, MSK, SFSK and DSFSK. It is also shown that moderate levels of modulated signal compression have negligible effects on the system bit error rate. A system implementation using the sum of FSK modulated signal components to achieve spectral confinement based on the classical cosine series window functions is presented.", } @ARTICLE{Herz9301:Concatenated, AUTHOR="Hanan Herzberg and Yair Beery and Jakov Snyders", TITLE="Concatenated Multilevel Block Coded Modulation", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="Encoding and decoding schemes for concatenated multilevel block codes are presented. By one of these structures, a real coding gain of 5.6 to 7.4 dB for the bit error rate range of 10E-6 to 10E-9 is achieved for transmission through the additive white Gaussian noise channel. Also, a rather large asymptotic coding gain is obtained. The new coding schemes have very low decoding complexity and increased coding gain in comparison with the conventional block and trellis coded modulation structures. A few design rules for concatenated (single and) multilevel block codes with large coding gain are also provided.", } @ARTICLE{Tzen9301:Trapezoid, AUTHOR="Ten H. Tzen and L. M. Ni", TITLE="Trapezoid Self-Scheduling: A Practical Scheduling Scheme for Parallel Compilers", JOURNAL=ieeepds, VOLUME=4, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="In this paper, we present a new practical processor self-scheduling scheme, Trapezoid Self-Scheduling, for arbitrary parallel nested loops in shared-memory multiprocessors. Generally, loops are the richest source of parallelism in parallel programs. To dynamically allocate loop iterations to processors, one may achieve load balancing among processors at the expense of run-time scheduling overhead. By linearly decreasing the chunk size at run time, the best tradeoff between the scheduling overhead and balanced workload can be obtained in the proposed trapezoid self-scheduling approach. Due to its simplicity and flexibility, this approach can be efficiently implemented in any parallel compilers. The small and predictable number of chores also allow efficient management of memory in a static fashion. Our experiments conducted in a 96-node Butterfly GP-1000 clearly show the advantage of the trapezoid self-scheduling over other well-known self-scheduling approaches.", } @ARTICLE{Prit9301:Cube, AUTHOR="David J. Pritchard and Denis A. Nicole", TITLE="Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network", JOURNAL=ieeepds, VOLUME=4, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="This paper presents a new multiprocessor interconnection network, known as cube connected mobius ladders, which has an inherently deadlock-free routing strategy and hence has none of the buffering and computational overheads required by deadlock-avoidance message passing algorithms. The basic network has a diameter, $\phi$ of $4n-1$ for $n2^{n+2}$ nodes and has a fixed node degree of 4. The network can be interval routed in two stages and can be represented as a Cayley graph. This is the only practical fixed degree topology of size $O(2^{\phi})$ which has an inherently deadlock-free routing strategy; making it ideally suited for medium and large sized transputer networks.", } @ARTICLE{Gold9301:Mtool, AUTHOR="A. Goldberg and John L. Hennessy", TITLE="Mtool: An Integrated System for Performance Debugging Shared Memory Multiprocessor Applications", JOURNAL=ieeepds, VOLUME=4, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="This paper describes Mtool, a software tool for analyzing performance losses in shared memory parallel programs. Mtool augments a program with low overhead instrumentation which perturbs the program's execution as little as possible while generating enough information to isolate memory and synchronization bottlenecks. After running the instrumented version of the parallel program, the programmer can use Mtool's window-based user interface to view compute time, memory, and synchronization bottlenecks at increasing levels of detail from a whole program level down to the level of individual procedures, loops, and synchronization objects. The paper describes Mtool's low overhead instrumentation methods, memory bottleneck detection technique, and attention focusing mechanisms, contrasts Mtool with other approaches, and offers a case study to demonstrate the effectiveness of Mtool.", } @ARTICLE{Kim9301:Subband, AUTHOR="Jaehyung Kim and Hwang-Soo Lee and J.-K. Choi", TITLE="Subband Coding Using the Human Visual Characteristics for Image Signals", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="59-64", MONTH=jan, YEAR=1993, REFERENCES=14, ABSTRACT="In this paper, a subband coder which can be applied to various kinds of images such as HDTV, digital TV, and videophone is proposed using human visual characteristics, where motion vectors in lower band are utilized to process components in higher band according to the degree of movement. Since the compression of the signal in higher band is accomplished by the motion information, the proposed method shows good performance regardless of the degree of movement. Compared with the existing methods which uniformly process all the subblocks in the same subband, quality of the image reconstructed by the proposed method is shown to be superior.", } @ARTICLE{Delo9301:Compatible, AUTHOR="P. Delogne and O. Poncin and B. Van Caillie and L. Vandendorpe", TITLE="Compatible Coding of Digital Interlaced {HDTV}", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="146-152", MONTH=jan, YEAR=1993, REFERENCES=17, ABSTRACT="This paper proposes a compatible coding scheme for interlaced HDTV. This scheme provides a standard definition signal and a second channel containing the additional information required to reach the HD resolution. The global scheme is of the pyramidal type: the standard TV is obtained by downsampling the HDTV signal by means of a field-based operation. The standard TV signal is coded, decoded and unsampled. It is used as a prediction of the HD signal and the prediction error is coded in a second channel. In both branches, motion compensated hybrid DCT coding is used. In addition, the DCT is taken within the frame.", } @ARTICLE{Ragh9301:Application, AUTHOR="S. Raghaven and Y. Hebron and I. Gurantz", TITLE="On the Application of Approximate {APP} Decoding to Digital Video Transmission", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="136-145", MONTH=jan, YEAR=1993, REFERENCES=13, ABSTRACT="For transmitting compressed digital video, we propose using threshold decodable block codes with large block length, and a posteriori probability (APP) soft decision decoding. A new approximation to the weight function associated with APP soft decision decoding of threshold decodable codes is presented. When the number of components in the parity equations is large, it is demonstrated that the new method gives excellent error performance, whereas there is a substantial degradation in the performance of the least reliable symbol approximation presented by Tanaka et al and others [3], [4], [5]. The effect of feedback on the performance of the APP decoder is also analyzed. It is shown that if the performance criterion is word error rate rather than bit error rate, feedback of previously decoded bits is essential to obtain all the possible coding gain from the soft decision decoder. Finally, the performance of the proposed coding scheme is compared to the performance of a concatenated coding system with the same rate.", } @ARTICLE{Wei9301:Precoding, AUTHOR="Li Wei", TITLE="Precoding Technique for Partial-Response Channels with applications to {HDTV} Transmission", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="127-135", MONTH=jan, YEAR=1993, REFERENCES=19, ABSTRACT="An equivalent partial-response (PR) channel 1-Z-k arises in the envisioned terrestrial over-the-air broadcasting of digital high-definition television (HDTV) signals when a comb filter is used by an HDTV receiver to reduce the NTSC co-channel interference. In this paper, we consider the design of signal constellations and their associated precoders for this PR channel. Besides PAM and square QAM, we show that generalized square and hexagonal constellations can also be used here. Coded modulation and graceful degradation in the received signal quality are discussed.", } @ARTICLE{Huly9301:Advanced, AUTHOR="S. N. Hulyalkar and Yu-Chi Ho and K. S. Challapali and D. G. Bryan and C. Basile and H. White and N. Wilson and B. Bhatt", TITLE="Advanced Digital {HDTV} Transmission System for Terrestrial Video Simulcasting", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="119-126", MONTH=jan, YEAR=1993, REFERENCES=9, ABSTRACT="Transmission aspects of the Advanced Digital High Definition Television (AD-HDTV) system, proposed by the Advanced Television Research Consortium (ATRC) for terrestrial simulcast delivery of HDTV, are described. The terrestrial simulcast HDTV channel can be viewed as an interference-limited channel due to the presence of co-channel NTSC signal, which limits the total transmitted power of an HDTV signal. In AD-HDTV, two quadrature-amplitude modulated (QAM) carriers, with different power spectral densities, are employed in a frequency division multiplex (FDM) mode within the standard 6 MHz channel. The resulting spectral shaping allows a larger power to be transmitted, compared to that for a single QAM carrier, for the same level of perceptual interference into co-channel NTSC. In addition the coded video data is split into high-priority (HP) data and standard-priority (SP) data and the vital information is sent on the appropriate QAM carrier. This prioritization results in a robust audio and video transmission system. Besides, the availability is higher in scenarios where the received signal level is such that the carrier-to-noise ratio (CNR) is above the threshold for HP reception but below the threshold for SP reception. This is important in fringe areas where an abrupt drop in reception quality, typical of a digital transmission, is to be avoided. The NTSC planning factors, suitably modified for HDTV delivery, are used to estimate the coverage area for AD-HDTV. The calculated AD-HDTV coverage area of 54.5 miles is comparable to that for NTSC transmission.", } @ARTICLE{DeGa9301:Satellite, AUTHOR="Riccardo De Gaudenzi and Carlo Elia and Roberto Viola", TITLE="Analysis of Satellite Broadcasting Systems for Digital Television", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="99-110", MONTH=jan, YEAR=1993, REFERENCES=16, ABSTRACT="This paper introduces the new concept of digital direct satellite broadcasting (D-DBS), which allows unprecedented flexibility by providing a large number of audio-visual services. The concept elaborated on in this paper assumes an information rate of about 40 Mb/s, which is compatible with practically all present-day transponders. After discussion of the general system concept, the optimization procedure is introduced and results of the transmission system optimization are presented. Channel distortion and uplink downlink interference effects are taken into account by means of a time domain system computer simulation approach. It is shown, by means of link budget analysis, how a medium power direct-to-home TV satellite can provide multimedia services to users equipped with small (60 cm) dish antennas.", } @ARTICLE{Copp9301:Low, AUTHOR="N. Coppisetti and S. C. Kwatra and A. Al-Asmari", TITLE="Low-Complexity Subband Encoding for {HDTV} Images", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="77-87", MONTH=jan, YEAR=1993, REFERENCES=17, ABSTRACT="The transmission of high-definition television (HDTV) signals on available digital networks and satellites requires the adoption of sophisticated compression techniques to limit the bit rate requirements and to provide high-quality and reliable service to customers. For processing and transmission of image signals, a low-complexity codec without visible degradation is desired. In this paper, a low-complexity intraframe subband image coding algorithm is developed. The low band is DPCM encoded and the high bands are PCM encoded. An efficient entropy coder is designed which reduces the overall bit rate significantly. It is shown that high-quality HDTV images can be obtained at as low a bit rate as 45 Mb/s or less with a very low-complexity encoder. For dividing the image into subbands, a new class of quadrature mirror filters (QMF's) called generalized quadrature mirror filters (GQMF's) are used for filtering. Performance is also evaluated by using short kernel filters (SKF's) which are easy to implement and require very few computations.", } @ARTICLE{Lei9301:Subband, AUTHOR="S. Lei and Tai-Ann Chen and Kou-Hu Tzou", TITLE="Subband {HDTV} Coding Using High-order Conditional Statistics", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="65-76", MONTH=jan, YEAR=1993, REFERENCES=13, ABSTRACT="This paper presents an HDTV coding scheme which is capable of achieving high quality below 20 Mbps. The system employs motion estimation/compensation followed by four-band subband splitting. The band signals are then subject to quantization and coded by an innovative high-order entropy coder. It is shown that this high-order entropy coder generates a bit rate nearly 30\% lower than the popular run-length/Huffman coding for motion-compensated frame differences. Also, about 15\% improvement is observed for the intrafield coded data. In order to reduce the complexity of the high-order entropy coder for high-speed implementation, two techniques, codebook reduction and nonlinear quantization of conditioning samples, are developed. Furthermore, a method of selecting conditioning samples and their order, based on mutual information between samples, is proposed. This method is shown to outperform several other systematic and intuitive approaches. Based on our simulations, the new system at about 20 Mbps is shown to achieve picture quality comparable to the 120 Mbps six-band intrafield coding system which we investigated before.", } @ARTICLE{Arge9301:Source, AUTHOR="F. Argenti and G. Genelli and A. Mecocci", TITLE="Source Coding and Transmission of {HDTV} Images Compressed with the Wavelet Transform", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="46-58", MONTH=jan, YEAR=1993, REFERENCES=28, ABSTRACT="Digital high-definition TV (HDTV) signals are generally compressed to reduce transmission bandwidth requirements. This paper presents a compression algorithm for the bit-rate reduction of an HDTV image using the wavelet transform. The major problems related to the transmission of a compressed HDTV signal are analyzed. Transmission is examined both on a noisy channel and on an asynchronous transfer mode (ATM) network. The effects of channel noise on the reconstructed image are determined and a solution to mitigate the degradation of the image quality is presented. Lastly, a model for the output bit rate of the HDTV coder is derived and used to simulate the transmission of an ATM multiplexer so that the network's main performance parameters can be determined.", } @ARTICLE{Sing9301:Multidimensional, AUTHOR="A. Singh and Jr. Bove", TITLE="Multidimensional Quantizers for Scalable Video Compression", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="36-45", MONTH=jan, YEAR=1993, REFERENCES=28, ABSTRACT="Scalable video compression requires the creation of an encoded bit stream that may be decoded in part if channel bandwidth drops, decoder resources are limited, or a smaller image than the source is desired. A separable spatiotemporal subband decomposition is combined with vector and lattice quantizers modified so that the individual subbands may be decoded scalably. This results in finer bandwidth control and more flexibility than simply discarding entire subbands.", } @ARTICLE{Zafa9301:Multiscale, AUTHOR="Sohail Zafar and Y.-Q. Zhang and B. Jabbari", TITLE="Multiscale Video Representation Using Multiresolution Motion Compensation and Wavelet Decomposition", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="24-35", MONTH=jan, YEAR=1993, REFERENCES=36, ABSTRACT="A multiscale video representation using wavelet decomposition and variable block-size multiresolution motion estimation (MRME) is presented in this paper. The multiresolution/multifrequency nature of the discrete wavelet transform lends itself as an ideal tool for representing video sources with different resolutions and scan formats including video telephone, NTSC/PAL/SECAM, and upcoming HDTV standards. The proposed variable block-size MRME scheme utilizes the motion correlation among different scaled subbands and adapts to their importance at different layers. This algorithm is well suited for interframe HDTV coding applications and facilitates the conversion and interactions between different video coding standards. Four scenarios of the proposed motion-compensated coding schemes are implemented and compared with 1-pixel, 1/2-pixel, and 1/4-pixel accuracies based on entropy, energy distribution, computational complexity, and associated overheads on the displaced residual subbands. A pel-recursive motion estimation scheme is also implemented in a multiresolution form. It is believed that the scalable architecture and adaptive processing of different video formats make the proposed scheme suitable for the broadcast environment where various standards may coexist simultaneously.", } @ARTICLE{Ramc9301:Multiresolution, AUTHOR="K. Ramchandran and A. Ortega and Kamil M. Uz and M. Vetterli", TITLE="Multiresolution Broadcast for Digital {HDTV} Using Joint Source-Channel Coding", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="6-23", MONTH=jan, YEAR=1993, REFERENCES=33, ABSTRACT="The use of multiresolution (MR) joint source-channel coding in the context of digital terrestrial broadcasting of High Definition Televiaion (HDTV) is shown to be an efficient alternative to traditional single resolution techniques. While the single resolution schemes suffer from a sharp threshold effect in the fringes of the broadcast area, we show how a matched multiresolution approach to both source and channel coding can provide a stepwise graceful degradation. Furthermore, this multiresolution approach improves the behavior, in terms of coverage and robustness of the transmission scheme, over systems that are not specifically designed for broadcast situations. This paper examines the alternatives available for multiresolution transmission, through embedded modulation and error correction codes. We also show how multiresolution trellis-coded-modulation (TCM) can be used to increase coverage range. We present coding results and simulations of noisy transmission. From a systems point of view, we also discuss the tradeoffs involved in the choice of the low and high resolution coverage areas, as well as the comparative costs and complexities of the different multiresolution transmission alternatives.", } @ARTICLE{Leno9301:DASH, AUTHOR="Daniel Lenoski and James Laudon and Truman Joe and David Nakahira and Luis Stevens and A. Gupta and John L. Hennessy", TITLE="The {DASH} Prototype: Logic Overhead and Performance", JOURNAL=ieeepds, VOLUME=4, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="The fundamental premise behind the DASH project is that it is feasible to build large-scale shared-memory multiprocessors with hardware cache coherence. While paper studies and software simulators are useful for understanding many high-level design trade-offs, prototypes are essential to ensure that no critical details are overlooked. A prototype provides convincing evidence of the feasibility of the design, allows one to accurately estimate both the hardware and the complexity cost of various features, and provides a platform for studying real workloads. A 48-processor prototype of the DASH multiprocessor is now operational. In this paper, we first examine the hardware overhead of directory-based cache coherence in the prototype. The data show that the overhead is only about 10 to 15\%, which appears to be a small cost for the ease of programming offered by coherent caches and the potential for higher performance. We then discuss the performance of the system and show the speedups obtained by a variety of parallel applications running on the prototype. Using a sophisticated hardware performance monitor, we also characterize the effectiveness of coherent caches and the relationship between an application's reference behavior and its speedups. Finally, we present an evaluation of the optimizations incorporated in the DASH protocol in terms of their effectiveness on parallel applications and on atomic tests that stress the memory system.", } @ARTICLE{Wolf9301:Parallel, AUTHOR="J. Wolf and Daniel M. Dias and P. S. Yu", TITLE="A Parallel Sort Merge Join Algorithm for Managing Data Skew", JOURNAL=ieeepds, VOLUME=4, NUMBER=1, MONTH=jan, YEAR=1993, ABSTRACT="Parallel processing of relational queries has received considerable attention of late. However, in the presence of data skew, the speedup from conventional parallel join algorithms can be very limited, due to load imbalances among the various processors. Even a single large skew element can cause a processor to become overloaded. In this paper, we propose a parallel sort merge join algorithm which uses a divide-and-conquer approach to address the data skew problem. The proposed algorithm adds an extra, low cost scheduling phase to the usual sort, transfer, and join phases. During the scheduling phase, a parallelizable optimization algorithm, using the output of the sort phase, attempts to balance the load across the multiple processors in the subsequent join phase. The algorithm naturally identifies the largest skew elements, and assigns each of them to an optimal number of processors. Assuming a Zipf-like distribution for data skew, the algorithm is demonstrated to achieve very good load balancing for the join phase, and is shown to be very robust relative, among other things, to the degree of data skew and the total number of processors. Algorithms, databases, data skew, joins, optimization, parallel processing, scheduling.", } @ARTICLE{Lin9301:Parallel, AUTHOR="H.-A. Lin and D. Messerschmitt", TITLE="Parallel Viterbi Decoding Methods for Uncontrollable and Controllable Sources", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="The fastest conventional Viterbi decoding method processes all states in parallel, but still decodes symbols sequentially. In order to decode faster than this rate, parallel methods must be developed to break the processing into independent state-parallel decoding tasks. This paper discusses parallel Viterbi decoding for two different cases, uncontrollable sources and controllable sources. For general, uncontrollable Markov processes, we extend a previously known parallel method to a hierarchical parallel decoding approach, which achieves a lower latency. For controllable Markov sources in telecommunications applications, we propose new parallel decoding methods by controlling the source processes in appropriate ways. This paper focuses on the parallel decoding methods for controllable sources because these methods have zero processing overhead. Because the methods modify the coding process, they bring positive changes to framing and negative changes to latency and code performance. However, we can adjust the parameters of the methods to make the degradation negligible. Because of their low overhead, the methods are most attractive for high-speed decoders for convolutional and trellis codes, and also applicable to other sequential algorithms for suboptimal decoding and estimation of complex Markov sources.", } @ARTICLE{Vuce9301:Bandwidth, AUTHOR="Branka Vucetic", TITLE="Bandwidth Efficient Concatenated Coding Schemes for Fading Channels", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="Concatenated codes consisting of trellis inner codes and Reed-Solomon outer codes are considered to achieve large coding gains with small bandwidth expansion in the presence of frequency-nonselective slow Rician fading. Both errors-only and errors-erasures decoding algorithms for outer codes are applied. New upper bounds on bit error probability performance in the presence of fading are obtained and compared with simulation results for zero channel memory. The effect of interleaving in eliminating channel memory is investigated. The performance gains that are achieved by the coding scheme relative to the reference uncoded systems are illustrated via some examples.", } @ARTICLE{Look9301:Variable, AUTHOR="Tom Lookabaugh and Eve Riskin and Philip A. Chou and R. M. Gray", TITLE="Variable Rate Vector Quantization for Speech, Image, and Video Compression", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="The performance of a vector quantizer can be improved by using a variable rate code. We apply three recently proposed variable rate vector quantization systems to speech, image, and video sources and compare them to standard vector quantization and noiseless variable rate coding approaches. The systems range from a simple and flexible tree-based vector quantizer to a high performance, but complex, jointly optimized vector quantizer and noiseless code. The systems provide significant performance improvements for subband speech coding, predictive image coding, and motion compensated video, but provide only marginal improvements for vector quantization of linear predictive coefficients in speech and direct vector quantization of images. We suggest criteria for determining when variable rate vector quantization may provide significant performance improvement over standard approaches.", } @ARTICLE{Gard9301:Cyclic, AUTHOR="William Gardner", TITLE="Cyclic Wiener Filtering: Theory and Method", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="Conventional time and space filtering of stationary random signals, which amounts to forming linear combinations of time translates and space translates, exploits the temporal and spatial coherence of the signals. By including frequency translates as well, the spectral coherence that is characteristic of cyclostationary signals can also be exploited. This paper develops some of the theoretical concepts underlaying this generalized type of filtering called FREquency-SHift (FRESH) filtering, summarizes the theory of optimum FRESH filtering, which is a generalization of Wiener filtering called cyclic Wiener filtering, and illustrates the theory with specific examples of separating temporally and spectrally overlapping communications signals, including AM, BPSK, and QPSK. The structures and performances of optimum FRESH filters are presented, and adaptive adjustment of the weights in these structures is discussed. Also, specific results on the number of digital QAM signals that can be separated, as a function of excess bandwidth, are obtained.", } @ARTICLE{Pahl9301:Decision, AUTHOR="K. Pahlavan and Steven Howard and Thomas A. Sexton", TITLE="Decision Feedback Equalization of the Indoor Radio Channel", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="The measured multipath profiles from five different indoor areas are used for the performance analysis of a Binary Phase Shift Keying (BPSK) modem with a Decision Feedback Equalizer (DFE). The performance from the measured multipath profiles is compared with the performance predictions based on a computer simulated channel model. Both average probability of error and probability of outage are calculated for a DFE with three fractionally spaced forward and three feedback taps. An equivalent delay power spectrum function, determined from the ensemble of the measured channel impulse responses, is defined. Using this function, analytical lower bounds on the average probability of error and the probability of outage of the BPSK/DFE modem with an infinite number of feedback taps and three forward taps are determined and compared with the results based on measured data and the computer generated channel impulse responses.", } @ARTICLE{Doug9301:Self, AUTHOR="Barry G. Douglass and A. Yavuz Oruc", TITLE="On Self-Routing in Clos Connection Networks", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="A self-routing connection network is a switching device where the routing of each switch can be determined in terms of the destination addresses of its inputs along, i.e., independent of the routing information regarding the other switches in the network. One family of connection networks that were considered in the literature for self-routing are Clos networks. Earlier studies indicate that some Clos networks can be self-routed for certain permutations. This paper proves that the only category of Clos networks that can be self-routed for all permutations are those with at most two switches in their outer stages.", } @ARTICLE{Fosc9301:Spectral, AUTHOR="G. J. Foschini and L. J. Greenstein", TITLE="Spectral Efficiency of Optical {FDM} Systems Impaired by Phase Noise", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="We consider the required frequency spacings between channels in an optical frequency-division-multiplexed (FDM) network. With an eye on the promise of spectrally efficient fiber distribution networks, we derive the minimum permissible spacings consistent with meeting bit-error-rate (BER) objectives. The limiting factor is adjacent channel interference (ACI), the harmful effects of which are compounded if the optical sources have non-negligible linewidths. The assumed transmission uses on-off keying (OOK), at a data rate 1/T (in bps), via external modulation of a laser source having linewidth (in Hz). The assumed receiver consists of an optical channel selection filter followed by a PIN photodiode and a post-detection integrate-and-dump circuit. Our analysis estimates the ACI-induced floor on BER for the middle of three FDM channels, as a function of frequency spacing and linewidth-to-bit rate ratio. For BER=$10^{-9}$ and ranging from 0.32 to 5.12, the required channel spacing ranges from 5.2 bit rates to 27.5 bit rates. The multiplying factor associated with using (wide-deviation) frequency shift keying (FSK), coherent (heterodyne) detection, and infinitely many FDM channels, respectively, are estimated to be 2.0, at most 3.0, and at most 1.37.", } @ARTICLE{Cheu9301:Robust, AUTHOR="Kyungwhoon Cheun and Wayne Stark", TITLE="Performance of Robust Metrics with Convolutional Coding and Diversity in {FHSS} Systems under Partial-Band Noise Jamming", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="Performance of robust metrics (metrics that can be computed from the outputs of the matched filters only) with convolutional coding and diversity under worst case partial-codes employing these metrics with diversity are compared via Union-Chernoff bounds. The performances of metrics considered in the literature that assume perfect side-information are given for comparison purposes. We find that there exist very good robust metrics that provide performance comparable to metrics using perfect side-information. Among the robust metrics considered in this paper, the self-normalized metric offers the best performance and achieves performance practically identical to that of the square-law-combining metric with perfect side-information for M=8.", } @ARTICLE{Endo9301:Shared, AUTHOR="Noboru Endo and Takahiko Kozaki and T. Ohuchi and S. Gohara", TITLE="A Shared Buffer Memory Switch for an {ATM} Exchange", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="This paper proposes an Asynchronous Transfer Mode (ATM) switch architecture called a shared buffer memory switch, whose output cell buffers are shared among all the output ports of the switch. Buffer sharing can reduce the amount of hardware compared with that of a separated buffer memory switch. Moreover, modifying the memory control circuits of the switch makes the memory switch flexible enough to perform functions such as priority control and multicast. Experimental measurements and a discussion about the traffic characteristics of switch architecture are carried out to determine how much buffer memory will be reduced through buffer sharing under various traffic conditions and to roughly estimate how many buffers are needed for the switch to meet certain requirements. The resultant estimate shows that buffer sharing reduces the necessary buffer memory to less than 1/5 of what would otherwise be required, and the required buffer size is about 128 cells/output for a $32\times32$ switch when considering bursty traffic conditions. LSI implementation is also discussed to show that a $32\times32$ switch can be composed of about 12 chips mounted on one printed board.", } @ARTICLE{Perr9301:High, AUTHOR="P. A. Perrier and P. R. Prucnal", TITLE="High-Dimensionality Shared-Medium Photonic Switch", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="A space-division photonic switch which has the potential to achieve high dimensionality is presented. The proposed switch, which resembles a collapsed network, does not use optical crosspoints; rather a dedicated path is provided for all input/output port connections on a common high-bandwidth transmission medium. This eliminates the restrictions imposed by 2x2 switching elements in classical space-division switching fabrics. The demonstration of a fully connected 120x120 space-division time-multiplexed photonic switch is reported. The dimensionality and blocking performance of a shred-medium photonic switch that uses time multiplexing is analyzed.", } @ARTICLE{Gelf9301:Tree, AUTHOR="Saul B. Gelfand and C. S. Ravishankar and Edward J. Delp", TITLE="Tree-Structured Piecewise Linear Adaptive Equalization", JOURNAL=ieeecom, VOLUME=41, NUMBER=1, PAGES="10 pages", MONTH=jan, YEAR=1993, ABSTRACT="We propose using a tree-structured piecewise linear filter as an adaptive equalizer. The tree equalizer is constructed as follows. Each node in a tree is associated with a linear filter restricted to a polygonal domain, and this is done in such a way that each subtree is associated with a piecewise linear filter. A training sequence is used to adaptively update the filter coefficients and domains at each node, and to select the best subtree and the corresponding piecewise linear filter. The tree-structured approach offers several advantages. First, it makes use of standard linear adaptive filtering techniques at each node to find the corresponding conditional linear filter. Second, it allows for efficient selection of the subtree and the corresponding piecewise linear filter of appropriate complexity. Overall, the approach is computationally efficient and conceptually simple. Numerical experiments are performed to show the advantages of tree-structured piecewise linear and piecewise decision feedback equalizers over linear, polynomial and decision feedback equalizers for the equalization of channels with severe intersymbol interference.", } @INPROCEEDINGS{Hill9301:Rendezvous, AUTHOR="R. Hill and Tom Brinck and Tom Patterson", TITLE="The Rendezvous Language and Architecture", BOOKTITLE=cacm, ORGANIZATION="ACM", PAGES="63-67", MONTH=jan, YEAR=1993, KEYWORDS="rendezvous system", ABSTRACT="The rendezvous system is a software toolkit and architecture for building multiuser applications for use in conversational settings. We view multiuser applications as providing distributed conversational props. A conversational prop is an artifact used by the participants in the conversation to facilitate or augment the conversation. Examples of common physical conversational props include whiteboards, physical models, and mockups. In education, for example, photographs, maps, and phsical models (say, of atoms and moleculs) are used as conversational props. A teacher uses these props to fucos the conversation and illustrate important points. In teleconferencing situations, shared computer applications can play the same role as physical props in face-to-face conversations. A shared computer presents information for multiple user simultaneously, letting remote users point to interesting aspects of the information and even modify it so that all users immedeately see the updated information. One could think of a shared computer application as a multipersonal virtual meeting space accessed from computer terminals. Instead of meeting in a physical conference room with physical charts, models, and whiteboards conference participants meet in a virtual space, communicating via videophone and shared electronic charts, models, and whiteboard.", } @INPROCEEDINGS{Bly9301:Media, AUTHOR="Sara A. Bly and Steve R. Harrison and Susan Irwin", TITLE="Media Spaces: Video, Audio and Computing", BOOKTITLE=cacm, ORGANIZATION="ACM", VOLUME=36, PAGES="29-47", MONTH=jan, YEAR=1993, KEYWORDS="cooperative work; CSCW; awareness", ABSTRACT="Coworker sitting together over lunch discussing everything from the latest summer bowl game to the knotty problems they encountered that day in their work is not particulary unusual - unless the workers are seperated by 800 miles. The smooth integration of casual task-specific interactions, combined with the ability to meet informally as well as formally, is a critical aspect of productive group work. Most tools in computer-supported cooperative work (CSCW) are devoted in the computational support of task-specific activities, but support for cooperative work is not complete whithout considering all aspects of the work group process. When groups are geographically distributed, it is particulary important not to neglect the need for informal interactions, spontaneous conversations, and even general awareness of people and events at other sites.", ANNOTE="Ongoing experiences in an informal experiment in using video technology to extend the workspace (in terms of opportunity for informal communicaations and promoting a common community) are described. The key feature is the creation of a virtual common area (or {\em media space}) in an office environment by linking remote common meeting areas using a video connection (in this case, two branch offices 800 miles apart). Participants are given complete control over the configuration, evolution and use of the video system. The general goal is to see how the system evolves, in which ways it is most commonly used, how well it creates the illusion of a common workspace, and what technical problems stand in the way of it meeting its full potential.", } @INPROCEEDINGS{Fish9301:Video, AUTHOR="R. Fish and Robert Krant and Robert Root and Ronald E. Rice", TITLE="Video Informal Communication", BOOKTITLE=cacm, ORGANIZATION="ACM", VOLUME=36, PAGES="48-61", MONTH=jan, YEAR=1993, KEYWORDS="cooperative work", ABSTRACT="We have prototyped several video telephony systems over the past there years, one of which is now serving about 125 users on a daily basis. Our goal has been to devise new telecommunication applications to support collaboration among members of geographically distributed work groups and to use the insights derived from building this applications to identify communication capabilities that these applications require from a network infrastructure. The design process we use at bellcore combines prototyping communication applications with behavioral and social sience data collection and analysis. Our designes have often been motivated by theories of social interaction, and our evaluation techniques include both quantitative and qualitative methods to understand use of the systems and directions for change. To access users' needs for telecommunications applications, we have conducted national surveys telephone interviews, and field observations in diagnostic work settings. We prototyped, deployed, and evaluated three interactions of video telecommunication systems, trying to improve support collaboration and the balanceïbetween privacy and accessibility.", } @INPROCEEDINGS{McCa9301:CPU, AUTHOR="Steve McCanne and Chris Torek", TITLE="A randomized sampling clock for {CPU} utilization estimation and code profiling", BOOKTITLE=usenixw, ADDRESS="San Diego, California", PAGES="387-394", MONTH=jan, YEAR=1993, REFERENCES=6, KEYWORDS="operating system; CPU; sampling; load estimation; performance evaluation; profiling; randomization; periodic process; Unix; BSD", ABSTRACT="The Unix rusage statistics are well known to be highly inaccurate measurements of CPU utilization. We have observed errors in real applications as large as 80\%, and we show how to construct an adversary process that can use an arbitrary amount of CPU without being charged. We demonstrate that these inaccuracies result from aliasing effects between the periodic system clock and periodic system behavior. Process behavior cannot be changed but periodic sampling can. To eliminate aliasing, we have introduced a randomized, aperiodic sampling clock into the 4.4BSD kernel. Our measurments show that this randomization has completely removed the systematic errors.", URL="ftp://ee.lbl.gov/papers/statclk-usenix93.ps.Z, http://www.usenix.org/publications/library/proceedings/sd93/", } @ARTICLE{Aike9301:NSF, AUTHOR="Bob Aiken and H. Braun and Peter S. Ford", TITLE="{NSF} Implementation Plan for Interim {NREN}", EDITOR="K. Claffy", JOURNAL=jhsn, VOLUME=2, NUMBER=1, NOTE="SDSC Report GA-A21174", MONTH=jan, YEAR=1993, KEYWORDS="NREN; Internet", URL="ftp://ftp.sdsc.edu/pub/sdsc/anr/papers/iinren.ps.Z", } @ARTICLE{Vin9301:Designing, AUTHOR="Harrick Vin and P. V. Rangan", TITLE="Designing a Multi-User {HDTV} Storage Server", JOURNAL=ieeejsac, VOLUME=11, NUMBER=1, PAGES="153-164", MONTH=jan, YEAR=1993, REFERENCES=11, KEYWORDS="multimedia file server", ABSTRACT="This paper seeks to establish the economic viability of an HDTV storage server, providing services similar to a neighbourhood video store. This is based on an example storage architecture with an array of 120 100 Gbyte disks (capable of storing 1000 movies). A storage strategy is presented to provide efficient storage of data while ensuring playback guarantees can be met. This involves the merging of strands of video data, each strand consisting of data blocks whose separation is constrained by a {\em scattering parameter}. As well, a strategy for servicing a maximum number of subscribers simultaneously called QPMS (Quality Proportional Multi-Subscriber Servicing) is developed. It is based on retrieving video frames at a rate proportional on an average to the HDTV playback rates of the requests. A quantitative analysis of the techniques presented is given, including examples.", URL="ftp://cs.ucsd.edu/pub/multimedia/JSAC.ps.Z", } @INPROCEEDINGS{Hard9301:Essence, AUTHOR="Darren R. Hardy and M. Schwartz", TITLE="Essence: A Resource Discovery System Based on Semantic File Indexing", BOOKTITLE=usenixw, PAGES="361-374", MONTH=jan, YEAR=1993, ABSTRACT="Discovering different types of file resources (such as documentation, programs, and images) in the vast amount of data contained within network file systems is useful for both users and system administrators. In this paper we discuss the Essence resource discovery system, which exploits file semantics to index both textual and binary files. By exploiting semantics, Essence extracts keywords that summarize a file, and generates a compact yet representative index. Essence understands nested file structures (such as uuencoded, compressed, 'tar' files), and recursively unravels such files to generate summaries for them. These features allow Essence to be used in a number of useful settings, such as anonymous FTP archives. We present measurements of our prototype and compare them to related projects, such as the Wide Area Information Service (WAIS) system and the MIT Semantic File System (SFS). We demonstrate that Essence can index more data types, generate smaller indexes, and in some cases index data faster than these systems. Our prototype generates WAIS-compatible indexes, allowing WAIS users to take advantage of the Essence indexing methods.", } @INPROCEEDINGS{Wu9301:Agrep, AUTHOR="Shiquan Wu and Udi Manbar", TITLE="Agrep: A Fast Approximate Pattern Matching Tool", BOOKTITLE=usenixw, ADDRESS="San Diego, California", MONTH=jan, YEAR=1993, } @INPROCEEDINGS{Wood9301:Fremont, AUTHOR="D. C. Wood and Sean S. Coleman and M. Schwartz", TITLE="Fremont: A System for Discovering Network Characteristics and Problems", BOOKTITLE=usenixw, ADDRESS="San Diego, California", PAGES="335-348", MONTH=jan, YEAR=1993, ABSTRACT="In this paper we present an architecture and prototype implementation for discovering key network characteristics, such as hosts, gateways, and topology. The Fremont system uses an extensible set of modules to discover information, based on a variety of different protocols and information sources, rather than a single network management protocol. This approach allows more complete and timely information to be discovered than, for example, using only one protocol, even one as capable as the Simple Network Management Protocol. The discovered information is time-stamped and recorded in a database. The contents of this database are cross-correlated to form an increasingly complete network picture, to direct further discovery, and to highlight inconsistent information.", } @TECHREPORT{Sama9301:Face, AUTHOR="Ferdinando Samaria and Frank Fallside", TITLE="Face Identification and Feature Extraction Using Hidden Markov Models", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 93-1", NOTE="Image Processing: Theory and Applications, edited by G. Vernazza, San Remo, Elsevier 1993", MONTH=jan, YEAR=1993, ABSTRACT="This paper details work done on automatic face identification. A new approach to the problem is proposed involving the use of Hidden Markov Models. We illustrate how these models allow the automatic extraction of facial features and the classification of face images. Some experiments are presented to support the plausibility of this approach. Successful results were obtained under the constraints of homogeneous lighting and constant background.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.93.1.ps.Z", } @INPROCEEDINGS{Stol9301:Faster, AUTHOR="Michael T. Stolarchuck", TITLE="Faster {AFS}", BOOKTITLE=usenixw, ADDRESS="San Diego, California", MONTH=jan, YEAR=1993, REFERENCES=8, ABSTRACT="The AFS Cache Manager fetches files from the AFS file server, and caches them into a local file system. Given this model, users expect reads of locally cached files to perform at local file system rates. However, read performance of the AFS cached files is half the read performance of the local file system. This paper discusses the reasons for the large performance difference, and the modification made to AFS so that reads of locally cached files perform within 10\% of the performance of the local file system.", } @INPROCEEDINGS{Minn9301:AutoCacher, AUTHOR="Ronald G. Minnich", TITLE="The AutoCacher: A File Cache Which Operates at the {NFS} Level", BOOKTITLE=usenixw, ADDRESS="San Diego, California", PAGES="77-83", MONTH=jan, YEAR=1993, REFERENCES=8, ABSTRACT="The AutoCacher is a caching file system. Its most common use is to cache read-only files from remote NFS file systems to a local disk, although it can, in general, cache from any file system to any other. It is intended to provide the same type of file caching provided by, e.g., the Andrew File System. The autocacher operates as a NFS server, not as might be expected as a Virtual File System, as do other caching file systems such as TFS or the system described in [7]. In so doing it demonstrates that activities such as file caching, which one might expect to be required to operate at that level of a Virtual File System, can operate quite effectively at the level of NFS, despite its stateless nature. The autocaher has been in operation at SCR since December, 1989.", } @INPROCEEDINGS{Egge9301:File, AUTHOR="Paul R. Eggert and D. S. Parker", TITLE="File Systems in User Space", BOOKTITLE=usenixw, ADDRESS="San Diego, California", MONTH=jan, YEAR=1993, REFERENCES=15, ABSTRACT="Current methods for interfacing file systems to user programs suffer two major drawbacks:they require kernel modifications or root privileges, and they are too complicated to be given to ordinary users. In this papers we show alternative methods are possible. The recent rise of dynamic linking provides a new way for users to develop their own file systems: by interposing a layer by user code between a program and the system call interface, a user can alter or extend a file system's behavior.", } @INPROCEEDINGS{Kay9301:Measurement, AUTHOR="Jonathan S. Kay and J. Pasquale", TITLE="Measurement, Analysis, and Improvement of {UDP/IP} Throughput for the {DECstation} 5000", BOOKTITLE=usenixw, ADDRESS="San Diego, California", MONTH=jan, YEAR=1993, REFERENCES=11, ABSTRACT="Networking software is a growing bottleneck in modern workstations, particularly for high throughput applications such as networked digital video. We measure various components of the UDP/IP protocol stack in a DECstation 5000/200 running Ultrix 4.2a, and find that checksumming and copying dominate the processing time for high throughput applications. This paper describes network software measurements and performance improvements which derive from a faster cecksum implementation.", } @INPROCEEDINGS{Ruem9301:UNIX, AUTHOR="Chris Ruemmler and John Wilkes", TITLE="{UNIX} disk access patterns", BOOKTITLE=usenixw, ADDRESS="San Diego, California", MONTH=jan, YEAR=1993, REFERENCES=25, ABSTRACT="Disk access patterns are becoming ever more important to understand as the gap between processor and disk performance increases. The study presented here is a detailed characterization of every low-level disk access generated by three quite different systems over a two month period. The contributions of this paper are the detaild information we provide about the disk accesses on these systems (many of our results are significantly from those reported in the literature, which provide summary data only for file-level access on small-memory systems); and the analysis of a set of optimizations that could be applied at the disk level to improve performance.", } @INPROCEEDINGS{Chri9301:Nachos, AUTHOR="Wayne Christopher and Steven J. Procter and Thomas Anderson", TITLE="The Nachos Instructional Operation System", BOOKTITLE=usenixw, ADDRESS="San Diego, California", MONTH=jan, YEAR=1993, REFERENCES=37, ABSTRACT="In teaching operating systems at an undergraduate level, we believe that it is important to provide a project that is realistic enough to show how real operating systems work, yet it is simple enough that the students can understand and modify it in significant ways. A number of these instructional systems have been created over the last two decades, but recent advances in hardware and software design, along with the increasing power of available computational resources, have changed the basis for many of the tradeoffs made by these systems. We have implemented an instructional operating system, called Nachos, and designed a series of assignments to go with it. Our system includes CPU and device simulators, and it runs as a regular UNIX process. Nachos illustrades and takes advantage of modern operating systems technology, such as threads and remote procedure calls, recent hardware advences, such as RISC's and the prevalence of memory hierachies, and modern software design techniques, such as protocol layering and object-oriented programming. Nachos has been used to teach undergraduate operating systems classes at serveral universities with positive results.", } @ARTICLE{Aran9301:Touring, AUTHOR="Mauricio Arango and others", TITLE="Touring Machine System", JOURNAL=cacm, VOLUME=36, NUMBER=1, PAGES="68-77", MONTH=jan, YEAR=1993, KEYWORDS="multimedia; Touring machine; conference control; CSCW; API", ABSTRACT="The Touring Machine$^{TM}$ was implemented to provide a common platform (system infrastructure) on which to build distributed multimedia applications. A principal goal is to separate policy from mechanism, both to hide session management details from the application programmer, and to provide flexibility in policy to accomodate a wide range of applications. The user (application programmer) is provided an API based on a client/server model. The system structure is an object model with both persistent objects (e.g., station objects) and transient objects (e.g., session objects). Multiport connections (called {\em connectors}) are enabled by mapping logical {\em endpoints} to physical {\em ports} (this can be done by clients via the API). A name server acts as a central repository for static and dynamic information about the system (e.g., for locating station objects). Cruiser$^{TM}$ and Rendezvous$^{TM}$ are two examples of applications built on top of The Touring Machine System. In fact, Cruiser sessions can be synchronized with Rendezvous applications using the common underlying system infrastructure.", } @TECHREPORT{Zhou9301:Parallel, AUTHOR="B. Zhou and R. P. Brent", TITLE="Parallel Computation of the Singular Value Decomposition of Tree Architectures", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-93-05", NOTE="Revised May 1993. (rpb138)", MONTH=jan, YEAR=1993, } @PHDTHESIS{Blaz9301:Caching, AUTHOR="Matt Blaze", TITLE="Caching in Large Scale Distributed File Systems", SCHOOL="Princeton University", MONTH=jan, YEAR=1993, } @INPROCEEDINGS{Grav9301:Cell, AUTHOR="A. Gravey and P. Boyer", TITLE="Cell delay variation specification in {ATM} networks", BOOKTITLE="IFIP TC6 workshop Modeling and Performance Evaluation of ATM Technology", ADDRESS="Martinique, Caribe, France", PAGES="7.2.1-7.2.14", MONTH=jan, YEAR=1993, REFERENCES=2, KEYWORDS="ATM; delay distribution; burstiness; traffic control", } @INPROCEEDINGS{Robe9301:Traffic, AUTHOR="J. W. Roberts and B. Bensaou and Y. Canetti", TITLE="A traffic control framework for high speed data transmission", BOOKTITLE="IFIP TC6 workshop Modeling and Performance Evaluation of ATM Technology", ADDRESS="Martinique, Caribe, France", PAGES="6.1.1-6.1.22", MONTH=jan, YEAR=1993, REFERENCES=18, KEYWORDS="ATM; connectionless service; traffic control; data traffic; fluid flow model", } @ARTICLE{Raja9301:Simple, AUTHOR="P. Raja and G. Ulloa", TITLE="A Simple Encoder for Fieldbus Applications", JOURNAL=ccr, VOLUME=23, NUMBER=1, PAGES="34-44", MONTH=jan, YEAR=1993, REFERENCES=14, ABSTRACT="In this paper we present a Simple Encoder for Fieldbus applications. The Simple Encoder is tailored to support the special kind of data transfer in a Fieldbus. The encoding rules have been simplified to such an extent that only required information between peers are exchanged, so that the coding/decoding process does not cause any significant delay during real time operation of the network. The PDUs obtained are up to 55\% shorter than PDUs of Basic Encoding Rules, BER, and the Simple Encoder is up to four times faster than BER encoder.", } @ARTICLE{Hude9301:Blocking, AUTHOR="Gail C. Hudek", TITLE="Blocking in Digital Cross-Connect Systems", JOURNAL=ieeenet, VOLUME=7, NUMBER=1, PAGES="34-39", MONTH=jan, YEAR=1993, REFERENCES=8, ABSTRACT="DCSs designed with nonblocking space switch theory can actually have a significant probability of blocking during broadcasting, but the probability can be reduced to near negligible levels.", } @TECHREPORT{Bell9301:TR57, AUTHOR="Bellcore", TITLE="Functional Criteria for Digital Loop Carrier Systems", TYPE="Technical Requirement", INSTITUTION="Telcordia (formerly Bellcore)", ADDRESS="Morristown, New Jersey", NUMBER="TR-NWT-000057", MONTH=jan, YEAR=1993, KEYWORDS="telephony; signaling", URL="http://www.telcordia.com", } @ARTICLE{Cido9301:MetaRing, AUTHOR="I. Cidon and Y. Ofek", TITLE="MetaRing - A Full-Duplex Ring with Fairness and Spatial Reuse", JOURNAL=ieanep, VOLUME="COM-41", NUMBER=1, PAGES="110-120", MONTH=jan, YEAR=1993, ABSTRACT="We describe the design principles of a ring network with spatial bandwidth reuse. Our goal is to provide the same functions in existing LAN/MAN designs that do not permit spatial reuse and concurrent transmission. A distributed fairness mechanism for this architecture, which uses low latency hardware control signals, 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 or cells. 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 bi-directional 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 advent in fiber-optic technology are the basis for the MetaRing network architecture. This network has been prototyped at the IBM T. J. Watson Research Center, and will also be deployed within the AURORA Testbed that is part of the NSF/DARPA Gigabit Networking program.", } @INPROCEEDINGS{Wada9301:Mobile, AUTHOR="Hiromi Wada and Takashi Yozawa and Tatsuya Ohnishi and Yatsunori Tanaka", TITLE="Mobile Computing Environment Based on {Internet} Packet Forwarding", BOOKTITLE="USENIX Winter Technical Conference", ADDRESS="San Diego, CA", PAGES="503-17", MONTH=jan, YEAR=1993, } @INPROCEEDINGS{Ioan9301:Design, AUTHOR="John Ioannidis and Maguire, Jr., Gerald Q.", TITLE="The Design and Implementation of a Mobile Internetworking Architecture", BOOKTITLE="1992 Winter USENIX", MONTH=jan, YEAR=1993, } @ARTICLE{Tera9301:Host, AUTHOR="Fumio Teraoka and Mario Tokor", TITLE="Host Migration Transparency in {IP} Networks: The {VIP} Approach", JOURNAL="ACM Computer Communications Review", PAGES="45-65", MONTH=jan, YEAR=1993, } @PHDTHESIS{Tera9301:Study, AUTHOR="Fumio Teraoka", TITLE="A Study on Host Mobility in Wide Area Networks", TYPE="PhD dissertation", SCHOOL="Keio University", ADDRESS="Japan", MONTH=jan, YEAR=1993, } @TECHREPORT{Harp9301:Why, AUTHOR="Richard Harper", TITLE="Why do People Wear Active Badges?", INSTITUTION="Rank Xerox Research Centre", ADDRESS="Cambridge, England", MONTH=jan, YEAR=1993, LANGUAGE="English", KEYWORDS="active badge; human factors; location-based services", ABSTRACT="This paper reports findings of an analysis into active badges as sociological phenomena. It examines the symbolic meaning given to active badges, the normative constraints underpinning attitudes to active badges; and the relationship between normative constraints, meaning, use, and the moral order of a workplace. It will be suggested that active badges can usefully be viewed as totems. The materials discussed derive from ethnographically informed interviews of 44 members of a corporate research institution. Similarities between this setting and other workplaces will be remarked. The role of sociological reasoning in design will conclude the paper.", URL="http://www1.cs.columbia.edu/graphics/courses/mobwear/resources/harper-xerox93.pdf, http://www.xrce.xerox.com/publis/cam-trs/html/epc-1993-120.htm", } @ARTICLE{Mark9301:Building, AUTHOR="John Markoff", TITLE="Building the Electronic Superhighway", JOURNAL=nyt, VOLUME="Sunday", PAGES="3.1-3.6", DAYS=24, MONTH=jan, YEAR=1993, } @MANUAL{Menz9302:X, AUTHOR="E. Menze and H. Orman", TITLE="$x$-Kernel Programmer's Manual (Version 3.2)", TYPE="Programmer's Manual", ORGANIZATION="Department of Computer Science, University of Arizona", ADDRESS="Tucson, Arizona", MONTH=feb, YEAR=1993, KEYWORDS="x-kernel; network programming; protocol implementation; operating system; user manual; programming manual", ABSTRACT="This report describes how to implement protocols in the $x$-kernel. It gives the $x$-kernel's programming interface, describes how to configure an $x$-kernel that contains a certain collection of protocols, and demonstrates how to run and debug an $x$-kernel. The $x$-kernel can be run in one of two environments: as a user program on a Sun SparcStation running SunOS4.1, or as a task on a Mach3.0 system (some platforms). Protocols can be moved between the two environments without modification. This document assumes that the reader is already familiar with the $x$-kernel's object-oriented infrastructure for implementing protocols.", URL="ftp://cs.arizona.edu/xkernel/manual.ps", } @UNPUBLISHED{Crow9302:Remote, AUTHOR="Jon Crowcroft", TITLE="Remote procedure call: not a panacea for distributed computing problems", NOTE="University College London", MONTH=feb, YEAR=1993, KEYWORDS="conferencing; distributed programming; RPC; systolic; synchronous", ABSTRACT="The CAR conferencing system is a distributed application that permits diverse programs transmitting diverse media from diverse sites to be connected and controlled. It was built using the ANSA remote procedure call (RPC), and has been ported to use Sun RPC. This paper is about the lessons learned during the port, concerning the differences between RPC systems, and the inadequacies of RPC to express certain distributed algorithms. We assume that the reader is familiar with the concept of RPC.", } @ARTICLE{Abbo9302:Language, AUTHOR="Mark Abbott and L. L. Peterson", TITLE="A Language-Based Approach to Protocol Implementation", JOURNAL=ieanep, VOLUME=1, NUMBER=1, PAGES="4-19", MONTH=feb, YEAR=1993, KEYWORDS="protocol design; protocol languages", ABSTRACT="Morpheus is a special-purpose programming language that facilitates the efficient implementation of communication protocols. Protocols are divided into three categories, called shapes, so that they can inherit code and data structures based on their category; the programmer implements a particular protocol by refining the inherited structure. Morpheus optimization techniques reduce per-layer overhead on time-critical operations to a few assembler instructions even though the protocol stack is not determined until runtime. This supports divide-and-conquer simplification of the programming task by minimizing the penalty for decomposing complex protocols into combinations of simpler protocols.", URL="ftp://cs.arizona.edu/xkernel/language.ps, http://www.acm.org/pubs/articles/journals/ton/1993-1-1/p4-abbott/p4-abbott.pdf", } @ARTICLE{Rang9302:Communication, AUTHOR="P. V. Rangan and Harrick Vin and Srinivas Ramanathan", TITLE="Communication Architectures and Algorithms for Media Mixing in Multimedia Conferences", JOURNAL=ieanep, VOLUME=1, NUMBER=1, PAGES="20-30", MONTH=feb, YEAR=1993, KEYWORDS="mixing; multimedia; packet audio; media processing", ABSTRACT="Advances in computer and communication technologies have stimulated the integration of digital video and audio with computing, leading to the development of computer-assisted multimedia conferencing. We address the problem of media mixing which arises in tele-conferencing applications such as tele-orchestra. We present a mixing algorithm which minimizes the difference between generation times of the media packets that are being mixed together in the absence of globally synchronized clocks, but in the presence of jitter in communication delays on packet switched networks. The algorithm is shown to be complete: given that there are no other message exchanges except media data between mixers and media sources, there cannot be any other algorithm that succeeds when our algorithm fails. Mixing can be accomplished by several different communication architectures. In order to support applications such as tele-orchestra, which involve a large number of participants, we propose hierarchical mixing architectures, and show that they are an order of magnitude more scalable compared to purely centralized or distributed architectures. Furthermore, we present mechanisms for minimizing the delays incurred by mixing in various communication architectures. We have implemented the mixing algorithms on a network of workstations connected by Ethernets, and have experimentally evaluated the performance of various mixing architectures. These experiments revealed interesting results such as the maximum number of participants that can be supported in a conference.", URL="ftp://cs.ucsd.edu/pub/multimedia/ToN1.ps.Z, http://www.acm.org/pubs/articles/journals/ton/1993-1-1/p20-rangan/p20-rangan.pdf", } @ARTICLE{Estr9302:Protocol, AUTHOR="D. Estrin and M. Steenstrup and G. Tsudik", TITLE="A Protocol for Route Establishment and Packet Forwarding Across Multidomain Internets", JOURNAL=ieanep, VOLUME=1, NUMBER=1, PAGES="56-70", MONTH=feb, YEAR=1993, KEYWORDS="routing; internet; policy routing; IDPR", ABSTRACT="Internetworks that are global in scale, contain multiple administrative domains, and support a range of services, present special requirements for routing. Multiple administrative domains introduce the need for policy-sensitive routing. Service heterogeneity intensifies the requirement for type of service (ToS) routing, as well as other protocol support for handling a range of services, from datagrams to multimedia streams. This paper summarizes the key concepts and protocols developed as part of the Inter-Domain Policy Routing (IDPR) architecture. We place particular emphasis on the route installation and packet forwarding mechanisms because they are critical to protocol performance and differ significantly from current practice in datagram wide area networks.", URL="http://www.acm.org/pubs/articles/journals/ton/1993-1-1/p56-estrin/p56-estrin.pdf", } @ARTICLE{Garr9302:Joint, AUTHOR="Mark Garrett and M. Vetterli", TITLE="Joint Source/Channel Coding of Statistically Multiplexed Real-Time Services on Packet Networks", JOURNAL=ieanep, VOLUME=1, NUMBER=1, MONTH=feb, YEAR=1993, KEYWORDS="queueing theory; multiplexer; loss priority; video coding; priority queue", ABSTRACT="We investigate the interaction of congestion control with the partitioning of source information into components of varying importance for variable bit rate packet voice and packet video. High priority transport for the more important signal components results in substantially increased objective service quality. Using a Markov chain voice source model with simple PCM speech encoding and a priority queue, simulation results show a signal-to-noise ratio improvement of 45 dB with two priorities over an unprioritized system. Performance is sensitive to the fraction of traffic placed in each priority, and the optimal partition depends on network loss conditions. When this partition is optimized dynamically, quality degrades gracefully over a wide range of load values. Results with DCT encoded speech and video samples show similar behavior. Variations are investigated such as further partition of low priority information into multiple priorities. A simulation with delay added to represent other network nodes shows general insensitivity to delay of network feedback information. A comparison is made between dropping packets on buffer overflow and timeout based on service requirements.", URL="http://www.acm.org/pubs/articles/journals/ton/1993-1-1/p71-garrett/p71-garrett.pdf", } @ARTICLE{Mill9302:Generation, AUTHOR="Russ Miller and Sunil Paul", TITLE="On the Generation of Minimal-Length Conformance Tests for Communication Protocols", JOURNAL=ieanep, VOLUME=1, NUMBER=1, MONTH=feb, YEAR=1993, KEYWORDS="protocol verification", ABSTRACT="A new technique of generating a test sequence for conformance testing of communication protocols is presented. This approach shows that it is possible to generate optimal-length test sequences which include multiple unique input/output (UIO) sequences and overlapping under certain conditions. In the absence of the above-mentioned conditions, a heuristic technique is used to obtain suboptimal solutions which show significant improvement over optimal solutions without overlapping. We illustrate our technique on a practical example: the NBS Class 4 Transport Protocol (TP4). We also compare the computational complexity of our algorithm with that of existing techniques. Finally, a brief discussion of bounds on test sequence length is presented, and our results are compared against these bounds.", } @ARTICLE{Humb9302:Ballot, AUTHOR="Pierre A. Humblet and Amit Bhargaua and M. G. Hluchyj", TITLE="Ballot Theorems Applied to the Transient Analysis of {ND/D/1} Queues", JOURNAL=ieanep, VOLUME=1, NUMBER=1, PAGES="81-95", MONTH=feb, YEAR=1993, KEYWORDS="queueing theory; ballot theorem", ABSTRACT="The problem of transporting constant bit rate (CBR) traffic through a packet network is analyzed. In the system considered, CBR traffic is packetized and packets from several similar sources are multiplexed on a transmission link. The bit streams are recreated at the receiving end by demultiplexing the packets and then playing out the packets of each CBR stream. Traffic fluctuations may cause gaps to appear in the playout process. Their frequency can be reduced by adding a smoothing delay to each stream. The queueing system analyzed is one that has periodic arrivals and deterministic service times. We present a method of analysis, based on the Ballot Theorems, to provide steady-state delay distributions as well as a transient analysis of the system to predict the statistics of the time for a gap to develop in the CBR stream as a function of the smoothing delay.", URL="http://www.acm.org/pubs/articles/journals/ton/1993-1-1/p81-humblet/p81-humblet.pdf", } @ARTICLE{Garc9302:Loop, AUTHOR="J. J. Garcia-Lunes-Aceves", TITLE="Loop-Free Routing Using Diffusing Computations", JOURNAL=ieanep, VOLUME=1, NUMBER=1, MONTH=feb, YEAR=1993, KEYWORDS="routing", ABSTRACT="A family of distributed algorithms for the dynamic computation of the shortest paths in a computer network or internet is presented, validated, and analyzed. According to these algorithms, each node maintains a vector with its distance to every other node. Update messages from a node are sent only to its neighbors; each such message contains a distance vector of one or more entries, and each entry specifies the length of the selected path to a network destination, as well as an indication of whether the entry constitutes an update, a query, or a reply to a previous query. The new algorithms treat the problem of distributed shortest-path routing as one of diffusing computations, which was first proposed by Dijkstra and Scholten. They improve on algorithms introduced previously by Chandy and Misra, Jaffe and Moss, Merlin and Segall, and the author. The new algorithms are shown to converge in finite time after an arbitrary sequence of link cost or topological changes, to be loop-free at every instant, and to outperform all other loop-free routing algorithms previously proposed from the standpoint of the combined temporal, message, and storage complexities.", } @ARTICLE{Chen9302:SCOQ, AUTHOR="D. X. Chen and J. W. Mark", TITLE="{SCOQ:} A Fast Packet Switch with Shared Concentration and Output Queueing", JOURNAL=ieanep, VOLUME=1, NUMBER=1, MONTH=feb, YEAR=1993, KEYWORDS="fast packet switches", ABSTRACT="A space-division, nonblocking packet switch with data concentration and output buffering is proposed. The performance of the switch is evaluated with respect to packet loss probability, the first and second moments of the equilibrium queue length and waiting time, throughput and buffer overflow probability. Numerical results indicate that the proposed switch exhibits very good delay-throughput performance over a wide range of input traffic. The proposed switch compares favorably with the Knockout switch the Sunshine switch, and the modular architecture proposed in earlier work in terms of fewer basic building elements used to attain the same degree of output buffering.", URL="http://www.acm.org/pubs/articles/journals/ton/1993-1-1/p142-chen/p142-chen.pdf", } @ARTICLE{Blai9302:Interface, AUTHOR="G. S. Blair and Andrew T Campbell and G. Coulson and Francisco Garcia and D. Hutchison and A. W. Scott and D. Shepherd", TITLE="A network interface unit to support continuous media", JOURNAL=ieeejsac, VOLUME=11, NUMBER=2, PAGES="264-275", MONTH=feb, YEAR=1993, KEYWORDS="multimedia; network interface; system architecture; continuous media; transputer", ABSTRACT="The combination of high-speed multiservice networks and multimedia workstations offers considerable potential for the development of distributed multimedia applications. However, many challenges remain before this potential can be realized. One key challenge is how to integrate continuous-media types such as audio and video into a distributed workstation environment. This paper describes an experimental system architecture based on a specialized multimedia network interface that attempts to provide this integration. The design and implementation of this system is discussed in depth in terms of workstation enhancement and distributed system support. A new approach to the problem of media synchronization is introduced, and the importance of quality of service in the architecture is highlighted. The paper also relates our experiences from this work, compares it with other approaches, and outlines our views on likely future developments in multimedia network interfacing.", } @ARTICLE{Metc9302:Computer, AUTHOR="Robert M. Metcalfe", TITLE="Computer/Network Interface Design: Lessons from Arpanet and Ethernet", JOURNAL=ieeejsac, VOLUME=11, NUMBER=2, MONTH=feb, YEAR=1993, KEYWORDS="network interface; Ethernet", ABSTRACT="My first high-speed computer/network interface was for the Arpanet in 1969. Twenty years later, in 1989, my last was for Ethernet, of which my former company 3Com now ships more than 125,000 per month. So, having been involved with one of the earliest and with the largest selling of high-speed computer/network interfaces, I am full of advice. Arpanet and Ethernet were considered very high speed when they first appeared, and some of their more general lessons are likely to be applicable to computer/network interfaces operating on up to a terabit, petabit, or perhaps even an exabit per second.", } @ARTICLE{Kaas9302:FLIP, AUTHOR="M. Frans Kaashoek and R. van Renesse and H. van Staveren and A. S. Tanenbaum", TITLE="{FLIP:} an internetwork protocol for supporting distributed systems", JOURNAL=tocs, VOLUME=11, NUMBER=1, PAGES="73-106", MONTH=feb, YEAR=1993, KEYWORDS="network protocols; FLIP; IP; RPC; protocol implementation; multicast; local area networks", ABSTRACT="Most modern network protocols give adequate support for traditional applications such as file transfer and remote login. Distributed applications, however, have different requirements (e.g., efficient at-most-once remote procedure call even in the face of processor failures). Instead of using ad hoc protocols to meet each of the new requirements, we have designed a new protocol, call the Fast Local Internet Protocol (FLIP), that provides a clean and simple integrated approach to these new requirements. FLIP is an unreliable message protocol that provides both point-to-point communication and multicast communication, and requires almost no network management. Furthermore, by using FLIP we have simplified higher-level protocols such as remote procedure call and group communication, and enhanced support for process migration and security. A prototype implementation of FLIP has been built as part of the new kernel for the Amoeba distributed operating system, and is in daily use. Measurements of its performance are presented.", ANNOTE="64-bit addresses, randomly allocated with ARP-like address resolution; security through do-not-travel bits", } @ARTICLE{Davi9302:Architecture, AUTHOR="B. S. Davie", TITLE="The Architecture and Implementation of a High-Speed Host Interface", JOURNAL=ieeejsac, VOLUME=11, NUMBER=2, PAGES="228-239", MONTH=feb, YEAR=1993, REFERENCES=13, KEYWORDS="host interface; network interface; ATM; Turbochannel; DMA", ABSTRACT="In the design of a high speed network, the host network interface is a critical component in achieving high end-to-end throughput. In this paper, some of the architectural issues involved in host interfacing are discussed. These include the appropriate partitioning of functionality between host and interface and the choice of mechanism for data movement into, out of, and within the host. The general issues are considered in a specific example: the realization of a highly flexible host interface for a 622 Mb/s asynchronous transfer mode network. The architecture of such an interface is described and the experimental results obtained from its prototype implementation are presented. The prototype will allow experimentation with a variety of scheduling and segmentation/reassembly algorithms, and with new transport protocols, while also delivering high bandwidth to the host.", } @ARTICLE{Rich9302:Washington, AUTHOR="William D. Richard and Pierre Costa and K. Sato", TITLE="The Washington University Broadband Terminal", JOURNAL=ieeejsac, VOLUME=11, NUMBER=2, PAGES="276-282", MONTH=feb, YEAR=1993, REFERENCES=6, KEYWORDS="network interface; host interface; ATM; NTSC; packet video; clock synchronization; automatic gain control", ABSTRACT="This paper discusses the requirements of broadband ATM audio/video transmission systems and the approach used to implement the Washington University broadband terminal (BBT). The BBT was developed to serve as a peripheral for the Washington University ATM network. The goal of the project was the development of a system with real-time audio and video capability that fully utilized the capability of the local ATM network. The BBT transmits standard NTSC color video and audio over the local ATM network. The BBT uses a novel approach to implement the ATM audio/video transmission system. This approach digitizes a composite analog audio/video signal at three times the video color burst frequency at the transmitter. At the receiver, a unique frame buffer scheme is used to regenerate the transmitted audio and video signals.", } @ARTICLE{Moor9302:ATM, AUTHOR="T. Moors and Antonio Cantoni", TITLE="{ATM} Receiver Implementation Issues", JOURNAL=ieeejsac, VOLUME=11, NUMBER=2, PAGES="254-263", MONTH=feb, YEAR=1993, REFERENCES=19, KEYWORDS="ATM; host interface; 802.6; cell identification; reassembly", ABSTRACT="Issues arising in the implementation of receivers for asynchronous transfer mode (ATM) networks, e.g., IEEE 802.6 MAN's and BISDN, are examined. These include buffering strategies to account for the burstiness and spatial randomness of buffering demands, preventing reassembly deadlock, and enforcing packet reception precedences. Transnode delays critically affect protocol performance and the complexity of implementing spatial reuse.", } @ARTICLE{Bren9302:Hardware, AUTHOR="C. Brendan S. Traw and Jonathan Smith", TITLE="Hardware/Software Organization of a High-Performance {ATM} Host Interface", JOURNAL=ieeejsac, VOLUME=11, NUMBER=2, PAGES="240-253", MONTH=feb, YEAR=1993, KEYWORDS="ATM; host interface; network interface", ABSTRACT="Concurrent increases in network bandwidths and processor speeds have created a performance bottleneck at the workstation-to-network host interface. This is especially true for BISDN networks where the fixed-length ATM cell is mismatched with application requirements for data transfer. A successful hardware/software architecture will resolve such differences and offer high end-to-end performance. The solution we report carefully splits protocol processing functions into hardware and software implementations. The interface hardware is highly parallel and performs all per-cell functions with dedicated logic to maximize performance. Software provides support for the transfer of data between the interface and application memory, as well as the state management necessary for virtual circuit setup and maintenance. In addition, all higher-level protocol processing is implemented with host software. The prototype connects an RISC System/6000 [RISC System/6000 is a trademark of IBM] to a SONET-based ATM network carrying data at the OC-3c rate of 155 Mb/s. An experimental evaluation of the interface hardware and software has been performed. Several conclusions about this host interface architecture and the workstations it is connected to are made.", } @ARTICLE{Rama9302:Designing, AUTHOR="Kadangode K. Ramakrishnan", TITLE="Performance issues in designing network interfaces: a case study", JOURNAL=ieeejsac, VOLUME=11, NUMBER=2, PAGES="203-219", MONTH=feb, YEAR=1993, KEYWORDS="host interface; network interface; FDDI; operating systems; DECstation", ABSTRACT="Network speeds are increasing rapidly. The higher bandwidth communication links available now, ranging from 100 Mb/s. to Gb/s, present considerable potential for distributed applications. Host processing speeds, when instructions or data are in cache, has also been increasing rapidly. However, the ultimate throughput delivered to the user application has not increased as rapidly. Network I/O is becoming a bottleneck. Better designs for the network interfaces, the system architecture and the host interface structure are essential to take full advantage of the higher speed communication links. At the same time, there is tremendous pressure to maintain the cost of network interconnections low, so that these new higher bandwidth links proliferate rapidly, especially for workstations. We address design i