@BOOK{Cens93:Statistical, AUTHOR="U. S. Bureau of the Census", TITLE="Statistical Abstract of the United States", PUBLISHER="Government Printing Office", ADDRESS="Washington, D.C.", YEAR=1994, KEYWORDS="census; statistics", ANNOTE="Contains information about the number of personal computers in households. In November 1990, 15.7\% (14.8 million) of households had computers, with percentages of 18.7, 43, 85.6, 87.3 \% for households with family incomes of below 15k, 15 to 25, 25 to 35, above 35k. [The latter set of numbers can't be right.] Sales (number in use/work/education/home) of PCs were 1981: 1.11 (2.12/1.24/0.13/0.75), 1982: 3.53 (5.53/2.26/0.27/3.00), 1983: 6.90 (12.17/4.00/0.54/7.64), 1984: 7.61 (19.18/6.44/0.78/11.95), 1985: 6.75 (25.27/9.26/1.15/14.86), 1986: 7.04 (31.15/12.22/1.55/17.38), 1987: 8.34 (37.84/15.91/1.96/19.97), 1988: 9.50 (45.08/20.33/3.36/22.38) (in millions). Note that the total home use here (22.38) exceeds the 11/90 estimate of the earlier statistic.", URL="http://www.census.gov/", } @ARTICLE{Abra94:Multiple, AUTHOR="N. Abramson", TITLE="Multiple Access in Wireless Digital Networks", JOURNAL=ieeeproc, VOLUME=82, NUMBER=9, PAGES="1360-1369", YEAR=1994, REFERENCES=30, KEYWORDS="LAN; mobile radio; multiple access", ABSTRACT="General principles for the design of a multiple-access system for large numbers of terminals transmitting to a single hub station are discussed. The importance of understanding the nature of the traffic to be carried by the network is emphasized. After some discussion of multiple access options for steady traffic and for slowly varying traffic is explained. Two general random-access protocols have been used in an variety of data networks, ALOHA", } @ARTICLE{Abu94:Election, AUTHOR="H. Abu-Amara and Jahnavi Lokre", TITLE="Election in Asynchronous Complete Networks With Intermittent Link Failures", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="We consider the problem of fault-tolerant leader election in asynchronous complete (fully-connected) distributed networks. The processors are reliable, but some of the communication channels may fail intermittently before or during the execution of the algorithm. Channel failures are undetectable due to the asynchronous nature of the network. Let $n$ be the number of processors in the network and $f$ be the maximum number of faulty channels incident on each processor, where $f <= \left\lfloor {n-1 \over 2}\right\rfloor$. Our algorithm uses at most $O(n^2+nf^2)$ messages to elect a unique leader of the network. Each message consists of at most $O(\log |T|)$ bits, where $|T|$ is the cardinality of the set of processor identifiers. All previous algorithms either tolerated only benign failures such as fail-stop failures, assumed that the network is synchronous, tolerated only a small number of failures, or assumed that the faults are detectable. Our algorithm is the first election algorithm that is designed specifically for asynchronous intermittently faulty complete networks in which up to ${n \over 2} \left\lfloor{n-1 \over 2}\right\rfloor$ channels may be faulty, where each processor is adjacent to no more than $\left\lfloor{n-1\over 2}\right\rfloor$ faulty channels, and where the faults are undetectable.", } @ARTICLE{Adam9408:Media, AUTHOR="Joel F. Adam and Henry H. Houh and Michael Ismert and David Tennenhouse", TITLE="Media-Intensive Data Communications in a Desk-Area Network", JOURNAL=ieeecm, VOLUME=32, NUMBER=8, PAGES="60-67", MONTH="Aug", YEAR=1994, REFERENCES=11, KEYWORDS="desk-area network; vunet; multimedia; distributed switching", ABSTRACT="The VuNet is a desk-Area network where small switches are distributed throughout the work area, and multimedia devices usually found in the workstation are put on the network. This architesture has several advantages including distributed switching and the ability to share multimedia devices across a workgroup.", } @ARTICLE{Adam94:Seeded, AUTHOR="Rick Adams and Leanne Bischof", TITLE="Seeded Region Growing", JOURNAL=ieeepami, VOLUME=16, YEAR=1994, ABSTRACT="We present here a new algorithm for segmentation of intensity images which is robust, rapid, and free of tuning parameters. The method, however, requires the input of a number of seeds, either individual pixels or regions, which will control the formation of regions into which the image will be segmented. In this correspondence, we present the algorithm, discuss briefly its properties, and suggest two ways in which it can be employed, namely, by using manual seed selection or by automated procedures.", } @TECHREPORT{Addl94:Displaying, AUTHOR="Mike Addlesee and Colin Turner and Andrew Hopper", TITLE="Displaying the Future", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambrifge, England", NUMBER="TR 94-13", NOTE="4th International Scientific Conference on Work with Display Units, Milan, October 1994", YEAR=1994, URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.94.13.ps.Z", } @ARTICLE{Adve94:Relationship, AUTHOR="V. S. Adve and R. T. Nelson", TITLE="The relationship between Bernoulli and fixed feedback policies for the {M/G/1} Queue", JOURNAL=or, VOLUME=42, NUMBER=2, PAGES="380-385", YEAR=1994, REFERENCES=9, KEYWORDS="feedback; m/g/1; m/gi/1; response time", ABSTRACT="We consider an M/G/1 queue with feedback, in which customers, after receiving service, either return to the tail of the queue or depart the system, according to some feedback policy. We derive simple expressions for the expected response time for feedbackpolicies that include Bernoulli feedback and feeding back a fixed number of times. ..", } @TECHREPORT{Agna94:Spoken, AUTHOR="M-S. Agnäs and Björn Gambäck", TITLE="Spoken Language Translator: First-Year Report", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-03", YEAR=1994, ABSTRACT="This document is the first-year report for a project whose long-term goal is the construction of a practically useful system capable of translating continuous spoken language within a restricted domain. The main deliverable resulting from the first year is a prototype, the Spoken Language Translator (SLT), which can translate queries from spoken English to spoken Swedish in the domain of air travel planning. The system was developed by SRI International, the Swedish Institute of Computer Science, and Telia Research AB. Most of it is constructed from previously existing pieces of software, which have been adapted for use in the speech translation task with as few changes as possible. The main components are connected together in a pipelined sequence as follows. The input signal is processed by SRI's DECIPHER(TM), a speaker-independent continuous speech recognition system. It produces a set of speech hypotheses which is passed to the English-language processor, the SRI Core Language Engine (CLE), a general natural- language processing system. The CLE grammar associates each speech hypothesis with a set of possible logical-form-like representations, typically producing 5 to 50 logical forms per hypothesis. A preference component is then used to give each of them a numerical score reflecting its linguistic plausibility. When the preference component has made its choice, the highest-scoring logical form is passed to the transfer component, which uses a set of simple non-deterministic recursive pattern-matching rules to rewrite it into a set of possible corresponding Swedish representations. The preference component is now invoked again, to select the most plausible transferred logical form. The result is fed to a second copy of the CLE, which uses a Swedish- language grammar and lexicon developed at SICS to convert the form into a Swedish string and an associated syntax tree. Finally, the string and tree are passed to the Telia Prophon speech synthesizer, which utilizes polyphone synthesis to produce the spoken Swedish utterance. The system's current performance figures, measured on previously unseen test data, are as follows. For sentences of length 12 words and under, 65\% of all utterances are such that the top-scoring speech hypothesis is an acceptable one. If the speech hypothesis is correct, then a translation is produced in 80\% of the cases; and 90\% of all translations produced are acceptable. Nearly all incorrect translations are incorrect due to their containing errors in grammar or naturalness of expression, with errors due to divergence in meaning between the source and target sentences accounting for less than 1\% of all translations. Making fairly conservative extrapolations from the current SLT prototype, we believe that simply continuing the basic development strategy could within three to five years produce an enhanced version, which recognized about 90\% of the short sentences (12 words or less) in a specific domain, and produced acceptable translations for about 95-97\% of the sentences correctly recognized. Since the greater part of the system's knowledge would reside in domain-independent grammars and lexicons, it would be possible to port it to new domains with a fairly modest expenditure of effort.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-04--SE.ps.Z", } @BOOK{Aida94:Telecommunications, AUTHOR="Salah E. Aidarous and T. J. Plevyak", TITLE="Telecommunications Network Management into the 21st Century- Techniques, Standards, Technologies, and Applications", PUBLISHER="IEEE Press and IEE", YEAR=1994, KEYWORDS="computer network; distributed system; fault tolerance; modeling; network management; open system; protection; simulation", ABSTRACT="This book presents an orchestrated collection of original chapters written expressly for the book by leading authors in the critically important field of network management and its related disciplines.", } @ARTICLE{Albu9402:Field, AUTHOR="A. de Albuquerque and Andrew Houghton and Steffen Malmros", TITLE="Field Trials for Fiber Access in the {EC}", JOURNAL=ieeecm, VOLUME=32, NUMBER=2, PAGES="40-49", MONTH="Feb", YEAR=1994, KEYWORDS="fiber access; EC; european community; RACE", ABSTRACT="The European Community's RACE projects demonstrate fiber-based broadband infrastructures for local access.", } @INPROCEEDINGS{Aldi94:Multicarrier, AUTHOR="M. Aldinger", TITLE="Multicarrier {COFDM} scheme in high bitrate radio local area networks", BOOKTITLE=pmrc, ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", PAGES="969-973", YEAR=1994, REFERENCES=8, KEYWORDS="radio channel", ABSTRACT="Afer a short description of the principles of a multicarrier COFDM (Coded Orthogonal Frequency Division Multiplex) scheme some simulation results concerning bit/packet errror rates gained with three different characteristic multipath channels are presented and discussed. Aspects of COFDM design principles and complexity of the modulation and demodulation part of the system, as well as effects of the non-linearitay of ampligiers will be consider", } @ARTICLE{Alga94:Les, AUTHOR="D. Algalarrondo and G. Brégant and J. Muller and C. Voge", TITLE="Les services sur le réseau intelligent", JOURNAL="L'écho des Recherches", ADDRESS="Issy-les-Moulineaux, France", VOLUME=157, PAGES="15-26", YEAR=1994, LANGUAGE="French", KEYWORDS="IN; intelligent network; overview", ABSTRACT={An intelligent network (IN) is designed to simplify the implementation of telecommunication services. This article briefly reviews the types of service the IN will allow FRANCE TELECOM to introduce in the near future. The authors look first at the "capability sets" specified by the ITU-T, ...}, } @ARTICLE{Alqa9402:Simulation, AUTHOR="A. M. Alqaed and Chi-ching Chang", TITLE="Simulation Driven Resource Allocation in {ATM} Networks", JOURNAL=sigsim, VOLUME=24, NUMBER=2, PAGES="2-19", YEAR=1994, REFERENCES=11, KEYWORDS="ATM; resource allocation; traffic source", ABSTRACT="This article describes a frequency-domain probality density function convolution method for predicting the resource requirements of a source based on its input characteristics. A taxonomy andclassification of source based on measurable characteristics isalso described.", } @ARTICLE{Alte94:3D, AUTHOR="T. D. Alter", TITLE="{3D} Pose from 3 Points Using Weak-Perspective", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="This correspondence discusses computing the pose of a model from three matching point pairs under weak-perspective projection. A new approach to the problem that is motivated geometrically is described. Like previous methods, the method here involves solving a biquadratic equation, but here the biquadratic's solutions, comprised of an actual and a false solution, are interpreted graphically. The final equations take a new form, which leads to a simple expression for the image position of any unmatched model point.", } @MASTERSTHESIS{Altm94:Heterogene, AUTHOR="S. Altmann", TITLE="Heterogene Lastverhältnisse in {DQDB-Netzen}", SCHOOL="TU Dresden, Institut für Nachrichtentechnik, Professur Telekommunikation", ADDRESS="Dresden, Germany", PAGES=75, YEAR=1994, LANGUAGE="german", REFERENCES=16, KEYWORDS="DQDB; traffic control; petri net; simulation", ABSTRACT="In der Arbeit wird ein komplexes Modell für den Zugriff auf den DQDB-Bus für gefaltete Petrinetze entwickelt. Die damit durchgef hrten Simulationen dienten der Untersuchung der differenziertenBehandlung der Anforderungen unterschiedlicher Dienste durch di e unterschiedliche Einstellung der Parameter für den Netzzugriff. Die Simulationen haben gezeigt, daß es nicht nur durch Prioritäten und isochronen Zugriff möglich ist, verschiedene Teilnehmer", } @TECHREPORT{Amad94:Reasoning, AUTHOR="Roberto M. Amadio and Mads Dam", TITLE="Reasoning about Higher-Order Processes", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-18", YEAR=1994, ABSTRACT="We address the specification and verification problem for process calculi such as Chocs, CML and Facile where processes or functions are transmissible values. Our work takes place in the context of a static treatment of restriction and of a bisimulation-based semantics. As a paradigmatic and simple case we concentrate on (Plain) Chocs. We show that Chocs bisimulation can be characterized by an extension of Hennessy-Milner logic including a constructive implication, or function space constructor. This result is a non-trivial extension of the classical characterization result for labelled transition systems. In the second part of the paper we address the problem of developing a proof system for the verification of process specifications. Building on previous work for CCS we present an infinitary sound and complete proof system for the fragment of the calculus not handling restriction.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-18--SE.ps.Z", } @ARTICLE{Amy9401:Standards, AUTHOR="R. M. Amy", TITLE="Standards by Consensus", JOURNAL=ieeecm, VOLUME=32, NUMBER=1, PAGES="4 pages", MONTH="Jan", YEAR=1994, KEYWORDS="standards; consensus", ABSTRACT="The technologies for communication of voice, data, image, and broadcast media are rapidly converging towards a common set of requirements. The global voluntary standards development process is one of the key non-technology-based elements in enabling that convergence. This standards process has and continues to evolve to keep pace with the technology and market requirements. Significant additional evolution is still required to bring this process for developing voluntary standards by consensus in alignment with the technology and marketplace requirements.", } @ARTICLE{Anag9402:Buffered, AUTHOR="Miltos Anagnostou and E. Protonotarios", TITLE="Analysis of a Buffered {TDM} System with a General Arrival Process", JOURNAL=ieeecom, ISBN="0090-6778", VOLUME="COM-42", NUMBER=2, PAGES="1752-1757", YEAR=1994, REFERENCES=14, KEYWORDS="TDM; multiplexing; queueing system; feedback; GI/D/1", ABSTRACT="A queued TDM system with a general arrival process is analyzed. Each call consists of a geometrically distributed number of cells. The interarrival times between successive calls are generallydistributed independent random variables. Call applications, which cannot be immediately satisfied, are queued in a finite capacity buffer, and are forwarded according to a FIFO discipline. Waiting times, queue lengths, and throughput are the performance", } @ARTICLE{Anan94:Optimization, AUTHOR="V. Anantharam and M. L. Honig and Upamanyu Madhow and Victor K. Wei", TITLE="Optimization of a database hierarchy for mobility tracking in a personal communications network", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=20, PAGES="287-300", YEAR=1994, REFERENCES=10, KEYWORDS="communication network; distributed database; hierarchical; mobile radio; optimization", ABSTRACT="... Keeping track of a mobile user requires updates at databases within the network, and call routing requires access at these databases. In order to reduce the update and access load on eachdatabase, a message routing scheme based on a hierarchy of databases is proposed. We consider the problem of how to assign databases in this hierarchy so as to minimize the total rate at whichaccesses and updates occur, given estimates of mobility and call", } @TECHREPORT{Aner94:Implementing, AUTHOR="Nikos G. Aneroussis and Charles R. Kalmaneck and Van E. Kelly", TITLE="Implementing {OSI} Network Management Facilities on the Xunet {ATM} Platform", INSTITUTION="Columbia University", YEAR=1994, REFERENCES=13, KEYWORDS="network management; osi management; xunet atm platform", ABSTRACT="We present the design of an OSI based network management system for the Xunet ATM platform. We define a set of inheritance and containment trees and elaborate on the problem of linking logical objects in the Managemnt Information Base with corresponding network objects. Furthermore, we address several issues that are left open by the OSI management standards ane require further considerations by the software developer, such as maintaining the consistancy of logical objects, increasing the performance of the management agent, and recovering from failures. Finally the need for a more formal and precise model for network management that can take advantage of the many communalities in the functionality of ATM networks to ensure portability between different platforms.", } @TECHREPORT{Aner94:Managing, AUTHOR="Nikos G. Aneroussis and Aurel A. Lazar", TITLE="Managing {VPs} on Xunet {III:} Architecture, Experimental Platform and Performance", TYPE="CTR Technical Report", INSTITUTION="Center for Telecommunications Research, Columbia University", ADDRESS="New York, New York", NUMBER="CU/CTR/TR 369-94-16", YEAR=1994, URL="ftp://ftp.ctr.columbia.edu/CTR-Research/comet/public/papers/94/ANE94.ps.gz", } @PROCEEDINGS{Anon94:14th, TITLE="14th Intern. Symposium on Protocol Specification, Testing and Verification", BOOKTITLE="14th International Symposium on Protocol Specification, Testing and Verification", EDITOR="Anonymous", SERIES="IFIP Transactions", PUBLISHER="North-Holland", YEAR=1994, } @PROCEEDINGS{Anon94:Client, TITLE="Client-Server : Client/Server Architekturen Werkzeuge und Lösungen; Experten kompetenter Institute und Unternehmen informieren mit sechs Vortragsreihen", EDITOR="Anonymous", PUBLISHER="Client Server, Online", ADDRESS="Velbert, Germany", YEAR=1994, LANGUAGE="German", KEYWORDS="distributed system", } @PROCEEDINGS{Anon94:TEL, TITLE="{TEL} \& {COM} : Telefon-basierte Informations- und Kommunikationstechniken; Experten kompetenter Institute und Unternehmen informieren mit sechs Vortragsreihen", EDITOR="Anonymous", PUBLISHER="TEL \& COM, Online", ADDRESS="Velbert, Germany", YEAR=1994, LANGUAGE="German", KEYWORDS="communication; ISDN; mobile radio; telephony", } @INPROCEEDINGS{Appe94:MAC, AUTHOR="T. Appel and C. Blondia and O. Casals and J. L. Garcia and K. Uhde", TITLE="Implementation and Performance Analysis of a {MAC} Protocol for an {ATM} Network", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="31-50", YEAR=1994, } @INPROCEEDINGS{Arms94:Protocols, AUTHOR="G. Armstrong and G. Fleming and J. Nelson", TITLE="An analysis of Protocols for the {UMTS} Distributed Database", BOOKTITLE="RACE Mobile Telecommunications Workshop, Amsterdam, 1994", ADDRESS="Amsterdam, Netherlands", PAGES="455-458", YEAR=1994, REFERENCES=6, KEYWORDS="application layer; distributed database; IN; mobile radio; overview; protocol; security; signalling", ABSTRACT="... The distributed database (DDB) architecture results in a number of requirements on the signalling Application Layer Protocols to support information querying, information consistency (copying and movement) and information integrity (security). This paper presents an analysis of the relevance of standardised database protocols for the UMTS Database. The protocols are considered from two viewports: to provide access to the DDB and to support", } @ARTICLE{Aror94:Distributed, AUTHOR="Anubhav Arora and M. G. Gouda", TITLE="Distributed Reset", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="We design a reset subsystem that can be embedded in an arbitrary distributed system in order to allow the system processes to reset the system when necessary. Our design is layered, and comprises three main components: a leader election, a spanning tree construction, and a diffusing computation. Each of these components is self-stabilizing in the following sense. If the coordination between the up processes in the system is ever lost (due to failures or repairs of processes and channels) then each component eventually reaches a state where coordination is regained. This capability makes our reset subsystem very robust: it can tolerate fail-stop failures and repairs of processes and channels even when a reset is in progress.", } @ARTICLE{Asar94:Optimization, AUTHOR="K. Vijayan Asari and C. Eswaran", TITLE="An Optimization Technique for the Design of Multiple Valued {PLA's}", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="An optimization technique for the design of two types of multiple-valued PLA's is described in this correspondence. In type-I PLA, the multiple-valued function is realized directly, whereas in type-II PLA, output encoding is used to encode the binary output of the PLA. In both types, multiple function literal circuits are used for the purpose of minimization. It is shown that the proposed technique leads to a considerably reduced size of PLA when compared to the earlier techniques.", } @ARTICLE{Asat9407:Standardization, AUTHOR="Koichi Asatani", TITLE="Standardization of Network Technologies and Services", JOURNAL=ieeecm, VOLUME=32, NUMBER=7, PAGES="86-91", MONTH="Jul", YEAR=1994, KEYWORDS="standardization; network technologies; services", ABSTRACT="The relationships between standards organizations is expected to change as service boundaries become vague and media become unified.", } @ARTICLE{Atiq9411:Computation, AUTHOR="M. Atiquzzaman and M. A. Sayeed", TITLE="Computation availability of crossbar systems in non-uniform traffic environment", JOURNAL="Microelectronics and Reliability", VOLUME=34, NUMBER=11, PAGES="1931-1937", YEAR=1994, } @ARTICLE{Awde9401:Contention, AUTHOR="Ra'ed Awdeh and Hussein Mouftah", TITLE="A contention resolution algorithm for input-buffered batcher-banyan networks", JOURNAL="International Journal of Communication Systems", VOLUME=7, NUMBER=1, PAGES="33-38", MONTH="January--March", YEAR=1994, } @INPROCEEDINGS{Azev94:Experimental, AUTHOR="J. Azevedo and J. Martins and P. de Oliveira", TITLE="An Experimental Study on Voice/Data Integration over an Ethernet {LAN}", BOOKTITLE="International Conference on Information Networks And Data Communications (INDC)", PAGES=19, YEAR=1994, REFERENCES=20, KEYWORDS="csma/cd; ethernet; LAN; voice/data integration", ABSTRACT="This work presents an experimental study on a personal computerbased implementation of a 64 kbit/s voice communication system over the Ethernet local network. Vice/data integration is achieved without resorting to any new packet switching protocol and without any changes to the CSMA/CD protocol specifications. Systemperformance is evaluated according to its average transmission delay and percentage of packet loss as a function of network load", } @ARTICLE{Aziz94:Privacy, AUTHOR="A. Aziz and W. Diffie", TITLE="Privacy and authentication for wireless local area networks", JOURNAL=ieeepcm, VOLUME=1, NUMBER=1, PAGES="25-31", MONTH="First Quarter", YEAR=1994, REFERENCES=9, KEYWORDS="PCS; mobility; security; encryption; authentication", } @BOOK{Bada94:High, AUTHOR="A. Badach and E. Hoffmann and O. Knauer", TITLE="High Speed Internetworking", PUBLISHER="Addison-Wesley", ADDRESS="Germany", YEAR=1994, LANGUAGE="German", KEYWORDS="ATM; FDDI; FDDI-II; high speed; internetworking; LAN; MAN; network management; network planning; overview", } @ARTICLE{Bafu94:Capacity, AUTHOR="M. Bafutto and P. J. Kühn and G. Willman", TITLE="Capacity and Performance Analysis of Signaling networks in Multivendor Environments", JOURNAL=ieeejsac, VOLUME=12, NUMBER=3, PAGES="490-500", YEAR=1994, REFERENCES=52, KEYWORDS="analysis; analytical model; IN; intelligent network; method; modeling; network; planning; protocol; signalling; signalling protocol", ABSTRACT="... In this paper, a generic modeling methodology for the signaling load and the signaling network performance as a result of the various services is extended in order to include certain implementation-dependent particularities. ...", } @ARTICLE{Bagc94:Information, AUTHOR="A. Bagchi and S. L. Hakimi", TITLE="Information Dissemination in Distributed Systems With Faulty Units", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="Consider a network consisting of units connected by links in which some units could be faulty. Suppose each unit has a message which must be transmitted to all other (fault-free) units. We present an algorithm for doing this in a network operating in a fully distributed manner that requires at most $3n\log n+O(n)$ message transmissions by fault-free units. Among other things, our result can be used to devise an algorithm for distributed system level diagnosis which is more efficient than the best currently known algorithm for this purpose.", } @ARTICLE{Bail94:Empirical, AUTHOR="M. L. Bailey and Michael Pagels", TITLE="Empirical Measurements of Overheads in Conservative Asynchronous Simulations", JOURNAL=tomacs, VOLUME=4, NUMBER=4, PAGES="350-367", YEAR=1994, REFERENCES=29, KEYWORDS="distributed simulation; discrete event simulation; parallel computing; communication; overhead time; deadlock prevention", ABSTRACT="We consider the feasibility of characterizing the overheads in conservative asynchronous simulations, and we focus on a single communication structure (i.e.; meshes) and use both multicomputerprograms and a queueing network as example applications. We find that the two most imortant issues for modeling are to understand how to estimate the time spent in sending null messages.", } @INPROCEEDINGS{Bail94:PATHFINDER, AUTHOR="M. L. Bailey and Burra Gopal and Michael Pagels and L. L. Peterson and Prasenjit Sarkar", TITLE="{PATHFINDER:} A Pattern-Based Packet Classifier", BOOKTITLE=osdi, PAGES="115-123", YEAR=1994, ABSTRACT="This paper describes a pattern-based approach to building packet classifiers. One novelty of the approach is that it can be implemented efficiently in both software and hardware. A performance study shows that the software implementation is about twice as fast as existing mechanisms, and that the hardware implementation is currently able to keep up with OC- 12 (622Mbps) network links and is likely to operate at gigabit speeds in the near future.", } @ARTICLE{Bala94:Reliability, AUTHOR="Meera Balakrishnan and Andrew Reibman", TITLE="Reliability Models for Fault-Tolerant Private Network Applications", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="A private or corporate network connects the offices of a single large organization, such as an airline or a bank using leased private lines. To improve reliability of network applications, fault-tolerance can be incorporated directly into the private network. In this paper, we use a state-space model to capture the effect of dynamic re-routing and repair and investigate the effect on reliability of different repair and re-routing strategies at the application or call level. To reduce the potentially large state space that results, we construct an approximate Markov model with a smaller state space by lumping together similar states. The lumped model includes coverage parameters that can be estimated without considering the original model in its entirety. This allows the state-space model to be solved accurately and efficiently. We compare results of the approximation technique with results obtained by a complete simulation of the original network. We expect similar approximation techniques to be effective on models with large state spaces which contain processes with many time-scales.", } @INPROCEEDINGS{Bala94:Software, AUTHOR="Krishna Bala and M. Frans Kaashoek and William Edward Weihl", TITLE="Software Prefetching and Caching for Translation Lookaside Buffers", BOOKTITLE=osdi, PAGES="243-253", YEAR=1994, ABSTRACT="A number of interacting trends in operating system structure, processor architecture, and memory systems are increasing both the rate of translation lookaside buffer (TLB) misses and the cost of servicing a miss. This paper presents two novel soflware schemes, implemented under Mach 3.0, to decrease both the number and the cost of kernel TLB misses (i.e., misses on kernel data structures, including user page tables). The first scheme is a new use of prefetching for TLB entries on the IPC path, and the second scheme is a new use of software caching of TLB entries for hierarchical page table organizations. \par For a range of applications, prefetching decreases the number of kernel TLB misses by 40\% to 50\%, and caching decreases TLB penalties by providing a fast path for over 90\% of the misses. Our caching scheme also decreases the number of nested TLB traps due to the page table hierarchy, reducing the number of kernel TLB miss traps for applications by 20\% to 40\%. Prefetching and caching, when used alone, each improve application performance by up to 3.5\%; when used together, they improve application performance by up to 3\%. On synthetic benchmarks that involve frequent communication among several different address spaces (and thus put more pressure on the TLB), prefetching improves overall performance by about 6\%, caching improves overall performance by about 10\%, and the two used together improve overall perfor nance by about 12\%. \par Our techniques are very effective in reducing kernel TLB penalties, which currently range from 1\% to 5\% of application runtime for the benchmarks studied. Since processor speeds continue to increase relative to memory speeds, our schemes should be even more effective in improving application performance in future architectures.", } @ARTICLE{Balb9402:Computation, AUTHOR="G. Balbo and others", TITLE="On the computation of performance characteristics of concurrent programs using {GSPNs}", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=19, NUMBER="2-3", PAGES="195-222", YEAR=1994, REFERENCES=18, KEYWORDS="GSPN; concurrency; process management", ABSTRACT="Petri net based models are proposed in this paper as the vehicles for the characterization of the processing and communication parameters of concurrent programs. A technique for the construction of a GSPN model as a direct translation of a concurrent program is used and a method is presented that allows to build, from a GSPN model, graph representations that are useful for preliminary assessment of the performance of the programs.", } @ARTICLE{Ball9411:Analyse, AUTHOR="Ralph Ballentin and Andreas Buchelt and Wolfgang Frohberg", TITLE="Analyse, Modellierung und Simulation von Verkehr in {ATM-Systemen,} Teil 1", JOURNAL=nte, VOLUME=44, NUMBER=6, PAGES="77-79", MONTH="November/December", YEAR=1994, KEYWORDS="ATM; source modeling", ABSTRACT="Im Beitrag werden Ansätze zur Modellierung des Verkehres in ATM-Systemen beschrieben mit dem Ziel, Netze dimensionieren zu können. Zunächst werden verkehrsbeschreibende Parameter untersucht. Dabei wird auch auf Besonderheiten des Verkehres in Breibandsystemen eingegangen. Um Aussagen zum Systemverhalten von ATM-Netzen zu erhalten, werden Untersuchungen mit der Methode der transaktionsorientierten Systemsimulation durchgeführt, wobei besonderes Augenmark auf die Modellierung des Quellenverkehrs gelegt wird. Die Vorgehensweise bei der Modellierung mit dem genutzten Werkzeug wird an Beispielen erläutert. Der Beitrag erscheint in zwei Teilen. Im ersten Teil sind die Abschnitte 1 und 2 enthalten, im Teil 2 folgen die Abschnitte 3 bis 5 einschließlich der Literaturabgaben.", } @ARTICLE{Bane94:Hardware, AUTHOR="P. Banerjee and Michael Peercy", TITLE="Design And Evaluation Of Hardware Strategies For Reconfiguring Hypercubes And Meshes Under Faults", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="This paper discusses the design of two reconfiguration strategies for distributed memory multicomputer architectures under failures. The specific architectures to which we apply the techniques are hypercubes and meshes. The first scheme uses spare processors attached to certain processors in the hypercube or mesh using a novel embedding technique. The second approach places spare processors along specific links in the hypercube or mesh. Both schemes involve the mapping of logical links of a virtual machine onto a set of physical links in the final reconfigured machine and hence suffer some performance degradation. We characterize that performance degradation through trace-driven simulation of real applications running on the faulty and reconfigured system. We find that the schemes have high reliability, suffer little degradation in performance, and are very low in cost.", } @ARTICLE{Bant9403:Wireless, AUTHOR="D. F. Bantz and F. J. Bauchot", TITLE="Wireless {LAN} Design Alternatives", JOURNAL=ieeenet, VOLUME=8, NUMBER=2, PAGES="43-53", MONTH="March/April", YEAR=1994, REFERENCES=18, KEYWORDS="cdma; multiple access; tdma", ABSTRACT="The choices are many, but slow frequency-hopping at 2.4 GHz and TDMA-based medium access control procide the best mix of cost, range, interference, and performance.", } @BOOK{Bapa94:Object, AUTHOR="Subodh Bapat", TITLE="Object Oriented Networks - Models for architecture, operations, and management", PUBLISHER="Prentice Hall", YEAR=1994, KEYWORDS="modeling; network; network architecture; network management; object-oriented programming", } @ARTICLE{Barc94:Polynomial, AUTHOR="P. Barcaccia and M. A. Bonuccelli", TITLE="Polynomial Time Optimal Algorithms For Time Slot Assignment of Variable Bandwidth Systems", JOURNAL=ieanep, YEAR=1994, ABSTRACT="In this paper, we consider the optimal (i.e. minimum length) time slot assignment problem for variable bandwidth switching systems. Existing algorithms for this problem are known to be pseudo-polynomial. The practical question of finding a fast optimal algorithm, as well as the theoretical question of whether the above problem is NP-complete were left open. We present here a technique to show polynomial time complexity of some time slot assignment algorithms. Such a technique applies to an algorithm proposed by Chalasani and Varma in 1991 (called CV algorithm), as well as to a network flow based optimal algorithm, proposed here for the first time. CV algorithm and the one proposed here are slightly different. Thus, we give an answer to both the above questions, by establishing that the problem is in $P$, and by showing effective algorithms for it.", } @ARTICLE{Bass9410:Multistage, AUTHOR="S. Bassi and others", TITLE="Multistage Shuffle Network with Shortest Path and Deflection Routing for High Performance {ATM} Switching: The Open-Loop Shuffleoutffleout", JOURNAL=ieeecom, ISBN="0090-6778", VOLUME="COM-42", NUMBER=10, PAGES="2881-2889", YEAR=1994, REFERENCES=18, KEYWORDS="ATM; shortest path; routing; switching", ABSTRACT="A new class of switching architectures for broadband packet networks, called Shuffleout, is described and analyzed in this paper. Shuffleout is basically an output-queued architecture with a multistage interconnection network built out of un buffered b x 2b switching elements. This paper presents the basic Shuffleout architecture, called Open-loop Shuffleout, in which the cells that cross the whole interconnection network without entering the a", } @BOOK{Baue94:Verteilte, AUTHOR="H. Bauer", TITLE="Verteilte diskrete Simulation komplexer Systeme", ISBN="3-8265-0131-4", PUBLISHER="Berichte aus der Informatik, Verlag Shaker", ADDRESS="Germany", YEAR=1994, LANGUAGE="German", KEYWORDS="discrete event simulation; distributed simulation; simulation", ABSTRACT="Die Arbeit beschreibt Methoden zur Effizienzsteigerung der ereignisgesteuerten Simulation. für das optimistische Time-Warp Verfahren zur verteilten Simulation werden neue Verfahren für die Ermittlung des globalen Simulationsfortschritts, die Zustandssicherung und die Optimierung einer wiederholten Simulation vorgestellt. Die Verfahren werden auf einer universellen, nachrichtengekoppelten Parallelrechnerarchitektur am Beispiel der Logiksimulatio", } @BOOK{Baum94:OSI, AUTHOR="B. Baumgarten and A. Giessler", TITLE="{OSI} Conformance Testing Methodology and {TTCN}", PUBLISHER="Elsevier", ADDRESS="Amsterdam, Netherlands", YEAR=1994, } @INPROCEEDINGS{Baum94:Open, AUTHOR="B. Baumgarten", TITLE="Open Issues in Conformance Test Specifications", BOOKTITLE="7th IFIP WG6.1 International Workshop on Protocol Test Systems", EDITOR="T. Mizuno and T. Higashino and N. Shiratori", ADDRESS="Tokyo, Japan", PAGES="5-20", YEAR=1994, } @ARTICLE{Bave94:Objects, AUTHOR="J. M. Baveco and Arnold WM Smeulders", TITLE="Objects for Simulation: Smalltalk and Ecology", JOURNAL="Simulation", VOLUME=62, NUMBER=1, PAGES="42-57", YEAR=1994, REFERENCES=24, KEYWORDS="object-oriented programming; simulation; simulation language; simulation method", ABSTRACT="The object-orinted programming environment Smalltalk is used toimplement a tool for modeling and simulation of ecological systems. This PC-based tool makes it possible and easy, to representindividuals explicitly in the simulation, and to integrate the individual-based approach with a tradditional population/concentration-based approach.", } @INPROCEEDINGS{Beau94:Reconfigurable, AUTHOR="C. Beaumont and P. Boronat and J. Champeau and J.-M. Filloque and others", TITLE="Reconfigurable technology: an innovative solution for parallel discrete event simulation support", BOOKTITLE="PADS", PAGES="160-163", YEAR=1994, REFERENCES=9, KEYWORDS="distributed simulation; hardware", ABSTRACT="This paper presents an innovative solution using a recent hardware technology called FPGA, that enables dynamic synthesis of application specific hardware. Each node of an MIMD parallel machine is tightly coupled to an FPGA ring. This ring allows us to ssynthesize application specific global operators and control or communication circuits and complements the possibilities of the original machine on a wide application spectrum. We present the first", } @ARTICLE{Beel9410:Internetworking, AUTHOR="Peter Beeler", TITLE="Internetworking with {BISDN} Data Services and Signaling", JOURNAL="Connexions", VOLUME=8, NUMBER=10, PAGES="12-19", MONTH="Oct", YEAR=1994, REFERENCES=15, KEYWORDS="broadband isdn; connectionless data services; connection-oriented data services; signalling; automatic signalling activation; internetworking", ABSTRACT="In Broadband ISDN a connectionless mode is provided to support data services. In contrast to this widely accepted approach, this article proposes to support data services in a connection-oriented mode. It does not try to propose revolutionary solutions. The intention of this article is rather to revisit the current proposals having in mind possible future directions, and to put the current solutions into this new contex. An investigation of connection-oriented support od data services shows that it can be implemented with minimal additional software, as soon as signalling is introduced in BISDN. Two current solutions are briefly presented for connectionless support of data services in BISDN. Because both of them are based on the use of semipermanent connections, they reserve the maximum required bandwidth in the network, even during low usage periods. this is reasonable for early cross-connect networks, but wasteful in networks supporting signalling. It is shown that practical user-friendly implementations of signalling should feature an automatic signalling activation to hide the technical details to the user. By introducing the automatic signalling activation, there are nearly all the necessary elements for connection-oriented support of data services. On top of the signaling activation layer any network layer may be used, and any network can be internetworked with ATM via its network layer and the corresponding signalling activation layer. As an example of this concept, it is shown how a signalling activation layer for IP based data services can be implemented. A final comparison with the connectionless mode of BISDN reveals that this is persumably to be replaced by solutions with automatic signalling activation, as soon as signalling is introduced in BISDN.", } @ARTICLE{Bell9409:Network, AUTHOR="S. M. Bellovin and William R. Cheswick", TITLE="Network Firewalls", JOURNAL=ieeecm, VOLUME=32, NUMBER=9, PAGES="50-57", MONTH="Sep", YEAR=1994, KEYWORDS="network firewalls; computer security", ABSTRACT="Computer security is a hard problem. Security on networked computers is much harder. Firewalls (barriers between two networks), when used properly, can provide a significant increase in computer security.", } @TECHREPORT{Benn94:Making, AUTHOR="Frazer Bennett and Tristan Richardson and Andy Harter", TITLE="Teleporting - Making Applications Mobile", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, United Kingdom", NUMBER="TR 94-11", NOTE="Proceedings of 1994 Workshop on Mobile Computing Systems and Applications, Santa Cruz, December 1994", YEAR=1994, KEYWORDS="X; application sharing; teleporting", ABSTRACT="The rapid emergence of mobile computers as a popular, and increasingly powerful, computing tool is presenting new challenges. This subject is already being widely addressed within the computing literature. A complementary and relatively unexplored notion of mobility is one in which application interfaces, rather than the computer on which the applications run, are able to move. The Teleporting System developed at the Olivetti Research Laboratory (ORL) is a tool for experiencing such `mobile applications'. It operates within the X Window System, and allows users to interact with their existing X applications at any X display within a building. The process of controlling the interface to the teleporting system is very simple. This simplicity comes from the use of an automatically maintained database of the location of equipment and people within the building. This paper describes the teleporting system, what it does, and how it is used. We outline some of the issues of making applications mobile that have arisen during its implementation.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.94.11.html/paper.html", } @ARTICLE{Berg9402:Pros, AUTHOR="Arthur W. Berger and W. Whitt", TITLE="The Pros and Cons of a Job Buffer in a Token-Bank Rate-Control Throttle", JOURNAL=ieeecom, VOLUME="COM-42", NUMBER="2-", PAGES="857-861", YEAR=1994, LANGUAGE="english", REFERENCES=22, KEYWORDS="ATM; traffic control; policing function; traffic shaping; overload control; leaky bucket; index of dispersion; buffer", ABSTRACT="Rate-control throttles with token banks or leaky buckets have been used for overload control in telecommunication systems and have been recommended for traffic policing in BISDN's. Enhancing the token-bank throttle with a buffer to shape the admitted traffic has been suggested. Researchers have shown that the presence of the buffer can dramatically reduce the squared coefficient ofvariation of the interadmission time. However, we show that the", } @ARTICLE{Bern94:Bounds, AUTHOR="P. J. Bernhard", TITLE="Bounds on the Performance of Message Routing Heuristics", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="Let $S$ be a set of messages to be routed on an $NxN$ omega network. In addition, suppose that $S$ contains communication conflicts. One strategy to deal with such conflicts is to partition $S$ into some number of subsets, called rounds, such that each subset is conflict-free. The messages are then routed through the network by successively routing the messages in each subset. The minimum round partitioning problem, is the problem of partitioning a given message set into a minimum number of rounds. In this paper we establish upper and lower bounds on the performance ratio for two heuristics for partitioning message patterns into rounds. For both of these heuristics we give upper and lower bounds of $O\log N$ and $\Omega(\log N)$, respectively.", } @ARTICLE{Bern94:PCI, AUTHOR="H. Bernstein", TITLE="{PCI} bringt {PC-Peripherie} auf Trab", JOURNAL="Elektronik", ADDRESS="Germany", VOLUME=18, PAGES="98-109", YEAR=1994, REFERENCES=2, KEYWORDS="bus; hardware; pc", ABSTRACT="Overview about PCI-Bus.", } @INPROCEEDINGS{Bern94:Service, AUTHOR="H. Berndt and P. Graubmann and M. Wakano", TITLE="Service Specification Concepts in {TINA-C}", BOOKTITLE="Towards a Pan-European Telecommunication Service Infrastructure - IS\&N Second International Conference", PAGES="355-366", YEAR=1994, REFERENCES=10, KEYWORDS="intelligent network", ABSTRACT="This paper presents the approach taken in the Telecommunications Information Networking Architecture Consortium (TINA-C) towards telecommunications service architecture and service specification concepts that meet future market needs. Since software portability, interoperability and reuse will be of prime importance in reducing costs associated with constructing, deploying and operating new services this paper shows the adaptation of fundamenta", } @ARTICLE{Bert94:Sprache, AUTHOR="U. Bertram", TITLE="Sprache und Daten schnurlos bertragen", JOURNAL="Funkschau", ADDRESS="Germany", VOLUME=23, PAGES="74-77", YEAR=1994, LANGUAGE="German", KEYWORDS="mobile radio", ABSTRACT="Schnurlose Kommunikation boomt - nicht nur bei Telefonen. Vor allem im B ro kommen schnurlose Telefonsysteme und Funk-LANs zum Einsatz.", } @MANUAL{Bhat94:Almagest, AUTHOR="Shuvra Bhattacharyya and Joseph T. Buck and others", TITLE="The Almagest: A manual for Ptolemy", INSTITUTION="College of Engineering, University of California at Berkeley", ADDRESS="Berkeley, California", YEAR=1994, KEYWORDS="ptolemy; simulation", URL="http://ptolemy.eecs.berkeley.edu/Almagest.html", } @ARTICLE{Bhid94:Boolean, AUTHOR="Shirish Bhide and Nigel John and M. R. Kabuka", TITLE="A Boolean Neural Network approach for the Traveling Salesman Problem", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="In this paper, we show that the Boolean Neural Network [17] can be used to solve NP-complete problems. The problem under consideration is the traveling salesman problem. The Boolean Neural Network has been modified to include the iterative procedure for solving combinatorial optimization problems. An architecture that utilizes this modified Boolean Neural Network is proposed for solving this problem. The simulation results have been found to be comparable to the simulated annealing algorithm, which is used as a test base. The modified Boolean Neural Network implementation involves low hardware complexity, good noise immunity and fast circuitry. This is very important in real-time systems and commercial job scheduling applications.", } @ARTICLE{Bier9404:Foreward, AUTHOR="Ernst Biersack", TITLE="Performance Evaluation of Foreward Error Correction in an {ATM} Environment", JOURNAL=ieeejsac, VOLUME="SAC-11", NUMBER=4, YEAR=1994, KEYWORDS="error control; error-correcting code", ABSTRACT="The article contains an interesting simulativ evaluation of foreward error correction in low loss networks, and an comparision between this principle and repeat mechanisms.", } @ARTICLE{Bilg94:Approximate, AUTHOR="S. Bilgen and O. Altintas", TITLE="An Approximate Solution for the Resequencing Problem in Packet-Switching Networks", JOURNAL=ieeetc, VOLUME="C-42", PAGES=3, YEAR=1994, KEYWORDS="packet switching; resequencing", } @ARTICLE{Bisd94:Mechanism, AUTHOR="C. Bisdikian and A. Tantawy", TITLE="A Mechanism for Implementing Preemptive Priorities in {DQDB} Subnetworks", JOURNAL=ieeecom, VOLUME=42, PAGES="834-839", YEAR=1994, REFERENCES=16, KEYWORDS="dqdb; HSLAN; MAN; priority", ABSTRACT="We propose a mechanism for implementing priorities in an IEEE 802.6 subnetwork of a metropolitan area network. The mechanism allows the priorities to be preemptively multiplexed among each other, thus, always guaranteeing maximum bandwidth to the highest priority traffic whenever it is requested. The proposed mechanism responds fast in the presence of high priority traffic and it takes full effect within at most on round trip propagation delay.", } @INPROCEEDINGS{Bjor94:Parallel, AUTHOR="M. Bjorkmann and P. Gunningberg", TITLE="Parallel Processing of Protocols", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="133-140", YEAR=1994, } @INPROCEEDINGS{Blom94:Using, AUTHOR="J. Blom and Bengt Jonsson and L. Kempe", TITLE="Using Temporal Logic for Modular Specification of Telephone Services", BOOKTITLE="Feature Interactions in Telecommunications Systems", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="197-216", YEAR=1994, REFERENCES=10, KEYWORDS="IN; intelligent network; specification", ABSTRACT="We outline a methodology for the modular specification of telephone services within first-order linear-time temporal logic. Typically, the services offered by a telephone system consist of a basic service and several optional additional services, such as automatic callback, redirection, etc. We argue informally that temporal logic provides a flexible formalism for the specification of individual services, and for the composition of different se", } @ARTICLE{Blum94:Photonic, AUTHOR="D. J. Blumenthal and P. R. Prucnal and Joe Sauer", TITLE="Photonic Packet Switches: Architectures and Experimental Implementations", JOURNAL=ieeeproc, VOLUME=82, NUMBER=11, PAGES="1650-1667", YEAR=1994, REFERENCES=56, KEYWORDS="optical switching; packet switching; routing; self routing", ABSTRACT="In this paper, we review experimental progress in state-of-the-art photonic packet switches with an emphasis on all-optical guided-wave systems. The term all-optical implies that the data portion of a packet remains in optical format from the source to the destination. While the data remain all-optical, both optical and optoelectronic techniques have been used to process packet routing functions based on extremely simple routing protocols. An o", } @ARTICLE{Bobi9401:European, AUTHOR="G. Robin", TITLE="The European Perspective for Telecommunication Standards", JOURNAL=ieeecm, VOLUME=32, NUMBER=1, PAGES="40-45", MONTH="Jan", YEAR=1994, KEYWORDS="european; telecommunication standards", ABSTRACT="The European Telecommunications Standards Institute is guiding the continent-wide progress toward a unified telecommunications market.", } @ARTICLE{Boet94:Schritte, AUTHOR="D. Boettle and G. Eilenberger and A. Fioretti and F. Masetti and others", TITLE="Schritte in Richtung vollständig optischer Netze", JOURNAL="Elektrisches Nachrichtenwesen, ALCATEL", ADDRESS="Stuttgart, Germany", VOLUME=3, PAGES="251-259", YEAR=1994, LANGUAGE="German", REFERENCES=11, KEYWORDS="network architecture; optical switching", } @ARTICLE{Bohm9402:DTM, AUTHOR="Christer Bohm and Per Lindgren and Lars Ramfelt and P.Sjödin", TITLE="The {DTM} Gigabit Network", JOURNAL=jhsn, VOLUME=3, NUMBER=2, PAGES="109-126", YEAR=1994, ABSTRACT="DTM is a set of protocols for high-speed networks, based on bandwidth reservation and with support for dynamic reallocation of bandwidth. It is designed for real-time multimedia applications and for high-speed computer communication. DTM uses a novel medium-access technique and provides a multicast, fast circuit-switched service. Several DTM networks can be connected into one large network. A prototype implementation and testbed is being constructed.", URL="ftp://gaia.electrum.kth.se/Reports/Telecommunication-Systems/MultiG/93.Maryland+JHSN.DTM.ps", } @ARTICLE{Boll9406:Hierarchical, AUTHOR="R. Bolla and F. Davoli and A. Lombardo and S. Palazzo and D. Panno", TITLE="Hierarchical Dynamic Control of Multiple Traffic Classes in {ATM} Networks", JOURNAL=ett, ADDRESS="Italy", VOLUME=5, NUMBER=6, PAGES="747-756", YEAR=1994, REFERENCES=32, KEYWORDS="ATM; traffic control; traffic mix; performance evaluation; connection admission control; hierarchical; load balancing; optimization", ABSTRACT="A hierarchical control structure is proposed to ensure performance requirements and to maintain load balancing among different traffic classes in an ATM node. A two-level control hierarchy isdefined, where one level performs fixed class-selective call admission control strategies that are peridically dynamically coordinated by a higher level bandwith allocation controller.", } @ARTICLE{Bond94:CCS, AUTHOR="M. Bondonno and M. De Paola and L. Gabrielli and E. Paglieri and Pinnola", TITLE="{CCS#7} {MTP} congestion and overload handling in different {STP} architectures", JOURNAL="CSELT Technical reports", ADDRESS="Italy", PAGES="347-359", YEAR=1994, REFERENCES=5, KEYWORDS="architecture; congestion control; distributed system; overload control; signalling; signalling protocol", ABSTRACT="This paper describes CCS#7 MTP congestion and overload handlingmechanisms for different STP architectures. An analysis of MTP Level 2 and Level 3 congestion mechanisms is performed, investigating in particular, the congestion handling mechanism based onthe measurements of congestion thresholds at Level 2 buffers.", } @INCOLLECTION{Bore94:Economics, AUTHOR="Severin Borenstein and Jeffrey MacKie-Mason and Janet Netz", TITLE="The Economics of Customer Lock-in and Market Power in Services", BOOKTITLE="Service Productivity and Quality Challenge", EDITOR="Patrick Harker", PUBLISHER="Kluwer Academic Press", YEAR=1994, } @INPROCEEDINGS{Borg94:Capture, AUTHOR="F. Borgonovo and L. Fratta and Michele Zorzi", TITLE="Capture-Division Packetized Access {(CDPA)} for cellular systems", BOOKTITLE=pmrc, ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", PAGES="810-815", YEAR=1994, REFERENCES=12, KEYWORDS="multiple access; network architecture; prma", ABSTRACT={The paper presents a new cellular architecture for radio access, CDPA, that can be applied to present and future cellular systems, independently of the cell size. It poses as an appealing alternative to systems based on classical bandwidth-subdivision methods, namely TDMA, FDMA or CDMA. In these systems, parallelism of communications is achieved by subdividing the bandwidth "a priori" among cells. In CDPA no bandwidth subdivision is operated. A}, } @TECHREPORT{Borm94:Xmc, AUTHOR="Carsten Bormann and Gero Hoffmann", TITLE="Xmc and {Xy} -- Scalable Window Sharing and Mobility or From X Protocol Multiplexing to X Protocol Multicasting", TYPE="Technical Report", INSTITUTION="Technische Universität Berlin", YEAR=1994, LANGUAGE="English", KEYWORDS="xy; application sharing; x protocol multicasting", ABSTRACT="To transform readily available applications into synchronous groupware (for ``joint editing'' etc.), window sharing tools such as shX and XTV have become popular. The well-known implementations of this concept have two major problems in a scalable telecooperation environment, however: They require sending information to each of the target displays (X servers) separately, wasting enor mous amounts of bandwidth. They also cannot cope with the rapidly changing constituencies of real world conferences (in particular, with constituencies drop ping to zero momentarily, or with large sets of read-only participants). Xy is a new window sharing tool that addresses these problems, in particular by introducing Xmc, a variation of the X11 protocol that can be multicast to all participants in a window sharing scenario. As a side effect, Xy's support for clients running with zero target X servers provides for mobility of X users.", } @ARTICLE{Bort94:RTMK, AUTHOR="J. F. Bortolotti and P. Bernard and E. Bouchet", TITLE="{RTMK:} A Real-Time Microkernel", JOURNAL=drdobbs, ADDRESS="San Mateio, Canada", VOLUME=19, NUMBER=5, PAGES="70-76", YEAR=1994, KEYWORDS="operating system; real time", } @ARTICLE{Boul9407:Multi, AUTHOR="Jean-Claude Bouley and Giovanni Destefanis", TITLE="Multi-Quantum Well Lasers for Telecommunications", JOURNAL=ieeecm, VOLUME=32, NUMBER=7, PAGES="54-61", MONTH="Jul", YEAR=1994, KEYWORDS="multi-quantum; lasers; telecommunications; optic fiber", ABSTRACT="Multi-Quantum wells show unique properties that ample exploitation of the optical fiber potential for telecommunications.", } @INPROCEEDINGS{Boul94:Test, AUTHOR="L. Boullier and others", TITLE="Evaluation of some test generation tools on a real protocol example", BOOKTITLE="International Workshop of Protocol Test Systems, VII", ADDRESS="Tokyo, Japan", YEAR=1994, } @BOOK{Boum94:Feature, AUTHOR="L. G. Bouma and Hugo Velthuijsen", TITLE="Feature Interactions in Telecommunications Systems", ISBN="90-5199-165-7", PUBLISHER="IOS Press", ADDRESS="Amsterdam, Netherlands", YEAR=1994, KEYWORDS="IN; ISDN; telephony", ABSTRACT="The papers in this book, with one exception, were presented at the Second International Workshop on Feature Interactions in Telecommunications Systems (FIW) held in Amsterdam, 8-10 May 1994.", } @INPROCEEDINGS{Boum94:Formalisation, AUTHOR="W. Bouma and W. Levelt and A. Melisse and K. Middelburg and L. Verhaard", TITLE="Formalisation of Properties for Feature Interaction Detection: Experiece in a Real-Life Situation", BOOKTITLE="Towards a Pan-European Telecommunication Service Infrastructure - IS\&N Second International Conference", PAGES="393-405", YEAR=1994, REFERENCES=9, KEYWORDS="formal technique; IN; intelligent network", ABSTRACT={This paper reports on ongoing work on a formal approach to the detection of feature interactions between IN-type features. These features have been implemented on top of an IN architecture which is close to the "real" world. The approach contains several threads: a description of an ideal interaction tool, a specific SDL model for the architecture, a proposal for a formal language to describe properties of features, and observations on how to p}, } @INPROCEEDINGS{Bour94:HIPERLAN, AUTHOR="B. Bourin", TITLE="{HIPERLAN} - Markets and Applications Standardisation issues", BOOKTITLE=pmrc, ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", PAGES="863-868", YEAR=1994, REFERENCES=2, KEYWORDS="application; standardization", ABSTRACT="ETSI STC RES10 has started its work 2.5 year ago. with the opjective of approving a standard by the end of 1994, and this is about to be achieved. HIPERLAN will then provide the sufficient and necessary means for ensuring high speed radio data tranmission for local area networks. The available bit rate wille 30 MBit/s in the air from point to point. HIPERLAN will provide the necessary facilities for interactive multimedia applications to be sup", } @INPROCEEDINGS{Bowm94:Consistency, AUTHOR="H. Bowman and J. Derrick", TITLE="Consistency and Conformance in {ODP} Systems", BOOKTITLE="ACM 13th Annual Symposium on Principles of Distributed Computing", YEAR=1994, } @INPROCEEDINGS{Boye94:Fast, AUTHOR="P. Boyer", TITLE="Fast Resource Management in {ATM} networks", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers, Boston/London/Dordrecht", PAGES="51-68", YEAR=1994, } @INPROCEEDINGS{Brai94:Automated, AUTHOR="K. H. Braithwaite and J. M. Atlee", TITLE="Towards Automated Detection of Feature Interactions", BOOKTITLE="Feature Interactions in Telecommunications Systems", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="36-59", YEAR=1994, REFERENCES=15, KEYWORDS="IN; intelligent network", ABSTRACT="The feature interaction problem occurs when the addition of a new feature to a system disrupts the existing services and features. This paper describes a tabular notation for specifying the functional behaviour of telephony features. It also describes how four classes of feature interactions can be detected when features are secified in this new notation. The goal of this research is to develop a tool to automatically analyze feature specificat", } @TECHREPORT{Bret94:Synergy, AUTHOR="Ivan Bretan and Jussi Karlgren", TITLE="Synergy Effects in Natural Language-Based Multimodal Interaction", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-04", YEAR=1994, ABSTRACT="We discuss the synergetic effects that can be obtained in an integrated multimodal interface framework comprising on one hand a visual language-based modality and on the other natural language analysis and generation components. Besides a visual language with high expressive power, the framework includes a cross-modal translation mechanism which enables mutual illumination of interface language syntax and semantics. Special attention has been payed to how to address problems with robustness and pragmatics through unconventional methods which aim to enable user control of the discourse management process.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-04--SE.ps.Z", } @INPROCEEDINGS{Breu94:High, AUTHOR="Simone Breuer and Th. Meuser and O. Spaniol", TITLE="High Performance Access Mechanisms for Slotted Rings", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="11-30", YEAR=1994, } @ARTICLE{Brey94:Gepr, AUTHOR="U. Breymann", TITLE="Geprüfte Dimensionen", JOURNAL=ix, ADDRESS="Germany", VOLUME=11, PAGES="174-180", YEAR=1994, LANGUAGE="German", REFERENCES=9, KEYWORDS="C++; software", ABSTRACT="Zu den am besten unverstandenen Aspekten objektorientierter Programmierung d rften Vererbung und - bei C++ - Templates gehören.Ein Tip zu mehrdimensionalen Array schafft Klarheit, was wann verwendbar ist und wie beide koexistieren können.", } @INPROCEEDINGS{Brie94:Comparison, AUTHOR="U. Briem", TITLE="Performance comparison of resource sharing schemes in a connectionless server on top of {ATM}", BOOKTITLE=itc14, ADDRESS="Stuttgart", PAGES=12, YEAR=1994, REFERENCES=20, KEYWORDS="ATM; connectionless service; resource sharing; traffic shaping; performance evaluation", ANNOTE="This paper focusses on a performance comparison of different resource sharing schemes for an ``on the fly'' packet processing in a connectionless server.", } @ARTICLE{Brow9409:Digital, AUTHOR="P. Brown", TITLE="Digital Signatures. Are They Legal for Eletronic Commerce?", JOURNAL=ieeecm, VOLUME=32, NUMBER=9, PAGES="76-81", MONTH="Sep", YEAR=1994, KEYWORDS="digital signatures; electronic commerce", ABSTRACT="Digital signature technology promises assurance at least equal to written signatures. From a legal standpoint, this assurance remains to be tested in the evidentiary process.", } @TECHREPORT{Brow94:Action, AUTHOR="Charls Grant Brown and Annika Waern", TITLE="Action-Tracking in {DIVE}", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-12", YEAR=1994, ABSTRACT="Several approaches to intelligent tutoring monitor the learners actions in order to understand his/her abilities. This requires that the learner's actions can be monitored. In traditional single-user command interfaces this is straightforward. As a result action tracking has not been subject to much study. However, in more advanced interfaces and applications, it is no longer self-evident how action tracking should be done, or even what should be considered an action. This paper addresses two particular aspects of systems of today that make action tracking hard: The increasing naturalness of interfaces, and the introduction of environments for human collaboration. The DIVE environment is extremely advanced in both these aspects, being a virtual reality environment for unconstrained human collaboration. We characterize the possibilities and limitations for action tracking in DIVE, and suggest an architecture for the task.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-12--SE.ps.Z", } @TECHREPORT{Brow94:Video, AUTHOR="M. R. Brown and Foote Jonathan and Gareth Jones and Karen Sparck-Jones and Steve Young", TITLE="Video Mail Retrieval by Voice: An Overview of the Cambridge/Olivetti Retrieval System", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 94-8", NOTE="ACM Multimedia Conference Workshop on Multimedia Database Management Systems, San Francisco, 21 Oct 1994", YEAR=1994, ABSTRACT="This paper describes current work on a video and audio document retrieval project at Cambridge University and Olivetti Research Limited (ORL). The project seeks to integrate state-of-the-art text retrieval methos with high-performance word spotting to yield a robust and efficient video mail retrieval system. A specific goal is the development of a practical retrieval system to work with Medusa, a high-bandwidth multimedia environment in daily use. This paper describes the project background, message corpus and experiment design, and presents experimental results showing audio retrieval performance very close to that of text.", URL="ftp://ftp.cam-orl.co.uk:/pub/docs/ORL/tr.94.8.ps.Z", } @ARTICLE{Brun94:Randbemerkungen, AUTHOR="T. Bräunl", TITLE="Randbemerkungen zur Parallelverarbeitung", JOURNAL=itti, ADDRESS="Germany", VOLUME=36, NUMBER=3, PAGES="13-19", YEAR=1994, LANGUAGE="German", REFERENCES=33, KEYWORDS="distributed processing; distributed system; parallel computing", ABSTRACT="A number of basic topics in parallel processing are discussed in this paper. Among others, these are the profit and useful employment of parallel computer systems, the selection of a suitableparallel system for a given problem, and the validity of parallel performance measurements. Only qualitative aspects are considered, therefore, terms like speedup, scaleup or efficiency are not discussed here.", } @UNPUBLISHED{Buch94:Analyse, AUTHOR="Andreas Buchelt and Wolfgang Frohberg and Ralph Ballentin", TITLE="Analyse, Modellierung und Simulation von Verkehr in {ATM-Systemen}", INSTITUTION="Alcatel", ADDRESS="Berlin, Germany", NOTE="unpublished report", YEAR=1994, LANGUAGE="German", REFERENCES=12, KEYWORDS="ATM; network dimensioning; traffic descriptors; traffic models; MMPP; GMDP", ABSTRACT="Im vorliegenden Beitrag werden Ansätze zur Modellierung des Verkehrs in ATM-Systemen beschrieben mit dem Ziel, Netze dimensionieren zu können. Zunächst werden verkehrsbeschreibende Parameter untersucht. Dabei wird auch auf Besonderheiten des Verkehrs in Breitbandsystemen eingegangen. Der Beitrag gibt eine Übersicht über die Modellierung von ATM-Verkehr relevant Modellansätze. Um zu Aussagen zum Systemverhalten von ATM-Netzen zu kommen werden deshalb Untersuchungen mit der Methode der transaktionsorientierten Systemsimulation durchgeführt, wobei besonderes Augenmerk auf die Modellierung des Quellenverkehrs gelegt wird. Die Vorgehensweise bei der Modellierung mit dem genutzten Werkzeug wird an Beispielen erläutert.", } @INPROCEEDINGS{Budr94:Size, AUTHOR="Zigmantas L. Budrikis and C. T. A. and J. Hullet", TITLE="Size and Speed Insensitive Distributed Queue Network", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="1-10", YEAR=1994, } @INPROCEEDINGS{Buit94:Considerations, AUTHOR="E. Buitenwerf", TITLE="Considerations on network interfaces for third generation mobile telecommunication systems", BOOKTITLE="WCN", PAGES="857-862 WA 3.3", YEAR=1994, KEYWORDS="IN; intelligent network; interface; mobile radio; network; network management; standardization", ABSTRACT="This paper gives a number of considerations on UMTS interfaces to be standardised. The target scenario as adopted by the RACE 2066 MONET Project is to model the UMTS network as integratedpart of networks for fixed telecommunication services.", } @ARTICLE{Burr94:Comparison, AUTHOR="W. R. Burr and S. Wakid and X. Qian and Dhadesugoor R. Vaman", TITLE="A Comparison of {FDDI} Asynchronous Mode and {DQDB} Queue Arbitrated Mode Data Transmission for Metropolitan Area Network Applications", JOURNAL=ieeecom, VOLUME="COM-42", PAGES="1758-1767", YEAR=1994, REFERENCES=24, KEYWORDS="FDDI; DQDB; MAN; arbitration; protocol", ABSTRACT="The performance of the FDDI token ring and IEEE 802.6 DQDB protocols are compared using dicrete event simulation models. A MAN of 100 km and with 50 stations was modeled. As 100 Mbps channel is used for both networks, with a traffic model with large (1 kbyte) low priority packets and smaller (100 byte) high priority packets. The delay and fairness characteristics of both networks are analyzed. The simulation shows that FDDI has advantages in fa", } @ARTICLE{Cagl94:Uncertainty, AUTHOR="Vincenzo Caglioti", TITLE="Uncertainty Minimization in the Localization of Polyhedral Objects", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="A straightforward method is presented for the determination of the optimal sensor exploration in the localization of a polyhedral object, whose geometry is known. Optimality is intended in the sense of the a posteriori covariance matrix of the object position and orientation parameters. The method consists in decomposing the problem into simpler subproblems, eachone relative to a single planar face of the object. It requires reasonable processing time, i.e., comparable with the sensor activation time.", } @INPROCEEDINGS{Came94:Feature, AUTHOR="E. J. Cameron and N. Griffeth and Y. Lin and Margaret E. Nilson and William K. Schure and Hugo Velthuijsen", TITLE="A Feature Interaction Benchmark for {IN} and Beyond", BOOKTITLE="Feature Interactions in Telecommunications Systems", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="1-23", YEAR=1994, REFERENCES=12, KEYWORDS="IN; intelligent network; feature interaction", ABSTRACT="Rapid creation of new services for telecommunications systems is hindered by the feature interaction problem. This is an important issue for development of IN services, not only because of interactions among IN services themselves but because of interactions of IN services with switch-based services and potential interactions with services not yet developed. Furthermore, the problem is fundamental to services creation; it is not restricted to IN services. Any platform for telecommunication services requires a method for dealing with the feature interaction problem. A number of approaches for managing feature interactions have been proposed. However, lack of structured ways to categorize feature interactions makes it difficult to determine if a particular approach has addressed some, if not all, classes of interactions. We describe and analyze a number of feature interactions by using two independent classification schemes. This paper is a step to achieving the goal of a coherent industry-wide collection of illustrative features and their interactions. The collection will help convey the scope of the feature interaction problem. It will also serve as a benchmark for determining the coverage of various approaches, and as a guideline for identifying potential interactions in software architectures and platforms.", } @ARTICLE{Camp94:Approximate, AUTHOR="Javier Campos and Jose Manuel Colom and Hauke Jungnitz and M. Silva", TITLE="Approximate Throughput Computation of Stochastic Marked Graphs", JOURNAL=ieeese, YEAR=1994, ABSTRACT="A general iterative technique for approximate throughput computation of stochastic strongly connected marked graphs is presented. It generalizes a previous technique based on net decomposition through a single input-single output cut, allowing the split of the model through any cut. The approach has two basic foundations. First, a deep understanding of the qualitative behavior of marked graphs leads to a general decomposition technique. Second, after the decomposition phase, an iterative response time approximation method is applied for the computation of the throughput. Experimental results on several examples generally have an error of less than 3\%. The state space is usually reduced by more than one order of magnitude; therefore the analysis of otherwise intractable systems is possible.", } @INPROCEEDINGS{Cao94:Application, AUTHOR="P. Cao and Edward W. Felten and Kin Li", TITLE="Implementation and Performance of Application-Controlled File Caching", BOOKTITLE=osdi, PAGES="165-177", YEAR=1994, ABSTRACT="Traditional file system implementations do not allow applications to control file caching replacement decisions. We have implemented two-level replacement, a scheme that allows applications to control their own cache replacement, while letting the kernel control the allocation of cache space among processes. We designed an interface to let applications exert control on replacement via a set of directives to the kernel. This is effective and requires low overhead. \par We demonstrate that for applications that do not perform well under traditional caching policies, the combination of good application-chosen replacement strategies and our kernel allocation policy LRU-SP, can reduce the number of block I/Os by up to 80\%, and can reduce the elapsed time by up to 45\%. We also show that LRU-SP is crucial to the performance improvement for multiple concurrent applications: LRU-SP fairly distributes cache blocks and offers protection against foolish applications.", } @TECHREPORT{Card94:Obliq, AUTHOR="L. Cardelli", TITLE="Obliq: A language with distributed scope", TYPE="Technical Report", INSTITUTION="Digital Equipment Corporation, Systems Research Center", YEAR=1994, KEYWORDS="programming language; distributed computing", ABSTRACT="Obliq is a lexically-scoped untyped interpreted language that supports distributed object-oriented computation. An Obliq computation may involve multiple threads of control within an address space, multiple address spaces on a machine, heterogeneous machines over a local network, and multiple networks over the Internet. Obliq objects have state and are local to a site. Obliq computations can roam over the network, while maintaining network connections.", URL="http://www.research.digital.com/SRC/Obliq/ObliqPaper.ps.Z", } @TECHREPORT{Carl94:Prolog, AUTHOR="Mats Carlsson", TITLE="A Prolog compiler and its extension for {OR-parallelism}", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R90-06", YEAR=1994, ABSTRACT="This report describes algorithms for the compiler component of the Aurora Or-Parallel Prolog system. The compiler translates one Prolog clause at a time into a sequence of abstract instructions. The instruction set is based on the sequential Warren Ab- stract Machine (WAM) with extensions for full Prolog, shallow backtracking, memory management and garbage collection, and for the SRI model of or-parallel execution of Prolog. Most of the described algorithms apply to compilation of sequential Prolog programs. The extensions introduced to support or-parallelism are minor, and concern pruning operators (cut and commit) and compile-time allocation of binding array offsets for permanent variables (generalised environment trimming). Code generation proper is kept separate from register allocation, and uses heuristics for finding a compilation order which minimises the number of register-register copies. After such copies have been coalesced where possible, register allocation is performed in a single pass over the intermediate code. The various compilation phases are described in detail, and the implementation is compared with some other compilers.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--90-06--SE.ps.Z", } @ARTICLE{Casa94:Service, AUTHOR="S. Casale and V. Catania and A. La Corte", TITLE="Service integration issues on an {ATM} {DQDB} {MAN}", JOURNAL=comcom, VOLUME=17, NUMBER=6, PAGES="407-418", YEAR=1994, REFERENCES=22, KEYWORDS="ATM; DQDB; MAN; service integration", ABSTRACT="In the context of ATM, this paper investigates the main problems associated with the use of a Distributed Queue Dual Bus (DQDB)MAN for the integrated transport of voice, video and data services, using only the asynchronous access mode. A network architecture containing functional blocks which perform adaptation functions for connection-oriented services is proposed, and results obtained by simulation of the Queued Arbitrated access protocol...", } @INPROCEEDINGS{Casn94:MBone, AUTHOR="Stephen Casner", TITLE="Are you on the {MBone?}", BOOKTITLE=ieeemm, PAGES="76-79", YEAR=1994, ABSTRACT="The Multicast Backbone, called {MBone}, is becoming a popular place in cyberspace. In the same way people asked, ``Are you on the MBone ?''. Through the cooperation of network service providers and campus network managers who volunteered workstations as nodes, the {MBone} was built as an experimental multicast Internet Protocol ({IP}) testbed for live audio and video transmission. Although it is still experimental, people have found {MBone} service useful and even begun to depend on it. How did {MBone} become so important ? It meets a need -- the growing need for natural, realtime, human communication through computer networks.", } @ARTICLE{Cast9403:Frame, AUTHOR="P. Castelli", TITLE="Frame Relay over {ATM:} traffic control aspects", JOURNAL="CSELT Technical reports", ADDRESS="Italy", VOLUME=22, NUMBER=3, PAGES="307-326", YEAR=1994, REFERENCES=15, KEYWORDS="ATM; frame relay; connection admission control; overload control; internetworking", ABSTRACT="This paper aims at examining some traffic control issus related to the support of Frame Relay over ATM networks. Two different scenarios will be taken into account: the interconnection of Frame Relay nodes by means of an ATM network and the interworking between Frame Relay and ATM networks. The first scenario con efficiently be supported over a Virtual Path Cross Connected ATM network by using a simple peak allocation policy for resource manage", } @ARTICLE{Cata94:Simulation, AUTHOR="V. Catania and A. La Corte and Antonio Puliafito and L. Vita", TITLE="A Simulation Study of {DQDB} Metropolitan Area Network", JOURNAL="Simulation", VOLUME=62, NUMBER=1, PAGES="158-171", YEAR=1994, REFERENCES=11, KEYWORDS="dqdb; LAN; MAN; simulation", ABSTRACT="In this paper we focus on a simulation analysis of the performance of the DQDB access protocol with both multiple priority levels and Bandwidth Balancing Mechanism (BBM) active. The analysis presented is oriented towards the evolution of the effect the BBM has on access delay and bandwidth sharing assuming different types of workload.", } @ARTICLE{Chan9405:Open, AUTHOR="Y.-C. Chang and David Coggins and D. Pitt and D. Skellern and Manu Thapar and Chandra Venkatraman", TITLE="An open-systems approach to video on demand", JOURNAL=ieeecm, VOLUME=32, NUMBER=5, PAGES="68-81", MONTH="May", YEAR=1994, REFERENCES=17, KEYWORDS="open-systems; video on demand; standards; open systems; video server; video dial tone", ABSTRACT="Open systems will enable servers and set-tops to provide different services in a variety of environments.", } @ARTICLE{Chan94:Comments, AUTHOR="P. Sarat Chandran", TITLE={Comments on "Comparative Analysis of Backpropagation and the Extended Kalman Filter for Training Multilayer Perceptrons"}, JOURNAL=ieeepami, YEAR=1994, ABSTRACT="In this note, the connection between the backpropagation algorithm and the extended Kalman filter is analyzed using an alternate form of representation for the Kalman gain term and shown to be much simpler than that reported by Ruck et al in [1].", } @ARTICLE{Chan94:Huffman, AUTHOR="C. J. Chang and J-P. Thomas", TITLE="Huffman Algebras for Independent Random Variables", JOURNAL="Discrete Event Dynamic Systems: Theory and Applications", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston, Massachusetts", VOLUME=4, PAGES="23-40", YEAR=1994, REFERENCES=25, KEYWORDS="entropy; independent random variable; random", ABSTRACT="Based on a rearrangement inequality by Hardy, Littlewood, and Polya, we define two-operator algebras for independent random variables. These algebras are called Huffman algebras since the Huffman algorithm on these algebras prduces an optimal binary tree that minimizes the weighted lengths of leaves.", } @ARTICLE{Chao9408:IP, AUTHOR="Hung-Po Chao and D. Ghosal and Debabrata Saha and Satish K. Tripathi", TITLE="{IP} on {ATM} Local Area Networks", JOURNAL=ieeecm, VOLUME=32, NUMBER=8, PAGES="52-59", MONTH="Aug", YEAR=1994, REFERENCES=13, KEYWORDS="IP; ATM; local area networks; LAN", ABSTRACT="ATM offers increased bandwidth and greater flexibility and manageability, However, ATM's success as a LAN technology depends on its ability to provide LAN-like services compatible with existing protocols and applications.", } @ARTICLE{Chat94:Le, AUTHOR="B. Chatras and C. Vernhes", TITLE="Le réseaux intelligent et la mobilité", JOURNAL="L'écho des Recherches", ADDRESS="Issy-les-Moulineaux, France", VOLUME=157, PAGES="35-44", YEAR=1994, LANGUAGE="French", KEYWORDS="architecture; IN; intelligent network; mobile radio; network architecture; overview; telephony", ABSTRACT="This article describes the different types of mobility services(terminal mobility and private user mobility) and their impact on the architecture and functions of telecommunication networks.... the article attempts to show how the intelligent network simplifies the implementation of mobility services. ... discusses the principles of ... UPT. ... highlights the key differences between personal telecommunications and third-generation mobile sys", } @ARTICLE{Chen9404:New, AUTHOR="Pi-Chun Chen and D. A. Patterson", TITLE="A New Approach to {I/O} Performance Evaluation - Self-Scaling {I/O} Benchmarks, Predicted {I/O} Performance", JOURNAL=tocs, VOLUME=12, NUMBER=4, PAGES="309-339", YEAR=1994, REFERENCES=24, KEYWORDS="design; measurement; benchmark", ABSTRACT="The article proposes a new approach to I/O performance analysis.First, it is proposed a self-scaling benchmark that dynamicallyadjusts aspects of its workload according to the performance characteristics of the system being measured. Second, it is proposed predicted performance, a technique for using the results fromthe self-scaling evaluation to estimate quickly the performancefor workloads that have not been measured.", } @ARTICLE{Chen9405:Applicability, AUTHOR="Wei-Peng Chen and David L. Waring", TITLE="Applicability of {ADSL} to Support Video Dial Tone in the Copper Loop", JOURNAL=ieeecm, VOLUME=32, NUMBER=5, PAGES="102-109", MONTH="May", YEAR=1994, REFERENCES=8, KEYWORDS="ADSL; video dial tone; copper loop; video dial tone; video on demand; channel coding; interference; NEXT", ABSTRACT="Asymmetric digital subscriber line technology is intended to deliver high bit rate digital information to average households through existing copper loop plant.", } @ARTICLE{Chen9407:Management, AUTHOR="Tai-Ann Chen and S. Liu", TITLE="Management and control functions in {ATM} switching systems", JOURNAL=ieeenet, VOLUME=8, NUMBER=4, PAGES="27-40", MONTH="July/August", YEAR=1994, REFERENCES=49, KEYWORDS="ATM; signaling", ABSTRACT="As research has progressed, it has become clear that the main difficulties in ATM pertain to its operational details rather than the concept. And it seems likely that these control issues will be much more complicated and costly for ATM switches when compared with current telephone switches.", } @ARTICLE{Chen94:Constant, AUTHOR="Yunfei Chen and Wei-Peng Chen", TITLE="Constant Time Sorting on Reconfigurable Meshes", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="In this paper, we will present a constant time sorting algorithm by adopting a 3-D reconfigurable mesh with only $O(n^3/2)$ processors. Our algorithm is developed on an $n^1/2xn^1/2xn^1/2 3-D$ reconfigurable mesh. Moreover, we further extend the result to k-dimensional reconfigurable meshes for $k>=3$. Consequently, an $O(4^k +1)$ time sorting algorithm is obtained by adopting an $n^1/(k - 1)x n^1/(k - 1)x\ldots xn^1/(k-1) k$-dimensional reconfigurable mesh of size $O(n^1 + 1/(k - 1))$. Hence, constant time sorting using $O(n^1+\epsilon)$ processors, where $O<\epsilon \ll 1$, can be realized by adopting reconfigurable meshes of high dimensions.", } @ARTICLE{Chen94:Distributed, AUTHOR="D. X. Chen and Min Lin", TITLE="On Distributed Computing Systems Reliability Analysis Under Program Execution Constraints", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="This paper presents an algorithm for computing the reliability of distributed computing systems (DCS). The algorithm, called the Fast Reliability Evaluation Algorithm, is based on the factoring theorem employing several reliability preserving reduction techniques. The effect of file distributions, program distributions, and various topologies on reliability of the DCS is studied in detail using the proposed algorithm. Compared with existing algorithms on various network topologies, file distributions, and program distributions, the proposed algorithm is much more economical in both time and space. To compute the distributed program reliability, the ARPA network is studied to illustrate the feasibility of the proposed algorithm.", } @ARTICLE{Chen94:Formal, AUTHOR="K. E. Cheng", TITLE="Towards a Formal Model for Incremental Service Specification and Interaction Management Support", JOURNAL="Feature Interactions in Telecommunications Systems, IOS Press", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="152-166", YEAR=1994, REFERENCES=5, KEYWORDS="IN; intelligent network; lotos; specification", ABSTRACT="This paper presents a technique for incremental service specification and interaction management. It introduces a mechanism for linking services, known as behaviour chaining to support independent service specification and service composition. The constraint oriented style of specification is used to manage interaction. The overall architecture is formally specified using LOTOS.", } @INPROCEEDINGS{Cher94:Caching, AUTHOR="D. R. Cheriton and Kenneth J. Duda", TITLE="A Caching Model of Operating System Kernel Functionality", BOOKTITLE=osdi, PAGES="179-193", YEAR=1994, ABSTRACT="Operating system research has endeavored to develop micro-kernels that provide modularity, reliability and security improvements over conventional monolithic kernels. However, the resulting kernels have been slower, larger and more error-prone than desired. These efforts have also failed to provide sufficient application control of resource management required by sophisticated applications. \par This paper describes a caching model of operating system functionality as implemented in the {\em Cache Kernel,} the supervisor-mode component of the V++ operating system. The Cache Kernel caches operating system objects such as threads and address spaces just as conventional hardware caches memory data. User-mode application kernels handle the loading and writehack of these objects, implementing application-specific management policies and mechanisms. Experience with implementing the Cache Kernel and measurements of its performance on a multiprocessor suggest that the caching model can provide competitive performance with conventional monolithic operating systems, yet provides application-level control of system resources, better modularity, better scalability, smaller size and a basis for fault containment.", } @BOOK{Ches94:Firewalls, AUTHOR="William R. Cheswick and S. M. Bellovin", TITLE="Firewalls and {Internet} Security: repelling the wily hacker", ISBN="0-201-633570-4", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1994, KEYWORDS="security; firewall; internet; cryptography", } @ARTICLE{Cheu9411:Network, AUTHOR="Joseph C. S. Cheung and Mark Beach and John McGeehan", TITLE="Network Planning for Third-Generation Mobile Radio Systems", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="54-59", MONTH="Nov", YEAR=1994, REFERENCES=10, KEYWORDS="network planning; r third-generation; mobile radio systems; mobile telephony; ISDN", ABSTRACT="The success of UMTS relies not only on the development of a flexible air interface, efficient coding techniques, and handset technology; it is equally important to design a system that can support the underlying technology and to interface with other networks.", } @ARTICLE{Chia9405:Hierarchical, AUTHOR="T. C. Chiang and Dimitris Anastassiou", TITLE="Hierarchical Coding of Digital Television", JOURNAL=ieeecm, VOLUME=32, NUMBER=5, PAGES="38-45", MONTH="May", YEAR=1994, REFERENCES=6, KEYWORDS="hierarchical coding; digital television; MPEG; hierarchical coding; scaling; packet video", ABSTRACT="If the same digital television signal is used for multiple resolutions, bit rates, or transmission and storage mechanisms, then hierarchical coding offers several advantages.", } @ARTICLE{Chia94:Queueing, AUTHOR="J. Chiarawongse and M. M. Srinivasan and T. J. Teorey", TITLE="The {M/G/1} Queueing System with Vacations and Timer-Controlled Service", JOURNAL=ieeecom, ISBN="0090-6778", VOLUME="COM-42", PAGES="1846-1855", YEAR=1994, REFERENCES=22, KEYWORDS="M/G/1; queueing system; time control; vacation time", ABSTRACT="This paper studies a M/G/1 queueing system with vacations, in which the sojourn time of the server at the queue is controlled bya timer. The article considers three policies for setting the timer value: time-limited (TL), cycle-time-limited (CL) and cycle-time-limited with accumulated lateness (CLL).", } @ARTICLE{Chia94:Queuing, AUTHOR="J. Chiarawongse and M. M. Srinivasan and T. J. Teorey", TITLE="The {M/G/1} Queuing System with Vacations and Timer-Controlled Service", JOURNAL="IEEE trans. on comp. systems", VOLUME="C-42", PAGES=10, YEAR=1994, KEYWORDS="queueing system; M/G/1; performance evaluation; time control; FDDI; protocol performance", } @ARTICLE{Chla9406:Optimizing, AUTHOR="I. Chlamtac and A. Farag¢ and Tao Zhang", TITLE="Optimizing the System of Virtual Paths", JOURNAL=ieanep, ISBN="1063-6692", VOLUME=2, NUMBER=6, PAGES="581-587", YEAR=1994, REFERENCES=22, KEYWORDS="optimization; virtual path; ATM", ABSTRACT="The virtual path (VP) concept is known to be a powerful transport mechanism for ATM networks. This paper deals with the optimization of the virtual paths system from a bandwidth utilization perspective.", } @ARTICLE{Choc94:Throughput, AUTHOR="A. Chockalingam and P. Venkataram and A. Prabhakar", TITLE="Throughput-delay characteristics of {OCUM} protocol for media access in multihop wireless networks with buffers", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", VOLUME=17, NUMBER=6, PAGES="419-427", YEAR=1994, REFERENCES=17, KEYWORDS="LAN; network protocol; throughput analysis", ABSTRACT="In this paper, we present the throughput and delay performance of a busy tone-based media access protocol in wireless networks with buffers at each node for the queueing of messages.", } @ARTICLE{Chok9409:National, AUTHOR="Santosh Chokhani", TITLE="Toward a National Public Key Infrastructure", JOURNAL=ieeecm, VOLUME=32, NUMBER=9, PAGES="70-75", MONTH="Sep", YEAR=1994, KEYWORDS="public key; electronic communications; cryptography", ABSTRACT="Reliance on electronic communications makes information more vulnerable. Public key cryptography will play an important role in providing confidentiality, message integrity, sender authentication, and sender non-repudiation.", } @ARTICLE{Chua94:Simulation, AUTHOR="K. C. Chua and S. Guo", TITLE="Simulation of a {TDM-like} protocol for Gbit/s {MANs}", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", VOLUME=17, NUMBER=2, PAGES="133-139", YEAR=1994, REFERENCES=6, KEYWORDS="HSLAN; LAN; MAN; media access control; simulation; tdm", ABSTRACT="This research note presents the results of a simulation study on the performance of a new protocol suitable for use in a Gbit/sMAN. Performance is simulated under a range of traffic types, access allocation algorithms, number of stations, and an overloadcondition. The results show that the protocol is very efficient, capable of achieving utilization close to 100\% without stationincurring excessive mean message delays.", } @ARTICLE{Chun94:Delay, AUTHOR="W. K. Chung and Chong Kwan Un and B. C. Shin", TITLE="Analysis of delay bonds of a tree protocol with collision detection", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", VOLUME=17, NUMBER=4, PAGES="288-296", YEAR=1994, REFERENCES=10, KEYWORDS="collision detection; collision resolution; LAN; tree network", ABSTRACT="A collision resolution problem in a discrete time multiaccess channel is considered, where the stations are independent and thechannel feedback is ternary (i.e. idle, success or collision). The tree protocol with collision detection is a collision resolution protocol that performs better than Ethernet. In this paper,we evaluate precisely the upper and lower bounds of the Tree/CDdelay using a recursive method.", } @TECHREPORT{Clar94:Network, AUTHOR="David Clarke and Gavin Stark", TITLE="Network Cards for the Pandora Multimedia System", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 94-5", YEAR=1994, ABSTRACT="A Network Interface Card is described which is used in the Olivetti Research Ltd Pandora box. The Pandora project involved the installation of a network of multimedia-equipped workstations connected to an early ATM-style network, the Cambridge Fast Ring. The architecture and function of the Pandora Box is described briefly and then the development of the Network Card is followed in more detail. This multiprocessor card uses a pair of Inmos Transputers and two custom LSI chips.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.94.5.ps.Z", } @TECHREPORT{Clar94:Video, AUTHOR="David Clarke", TITLE="Video Compression for the Pandora Multimedia System", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 94-6", YEAR=1994, ABSTRACT="This document describes the video compression system used in the Olivetti Research Ltd Pandora box which was used in the Pandora distributed multimedia project. The Pandora project is described briefly, followed by a discussion of the options then available for video compression. The chosen system and its implementation is presented.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.94.6.ps.Z", } @ARTICLE{Coch9409:Hidden, AUTHOR="P. Cochrane and Roger Heckingbottom and David JT Heatley", TITLE="The Hidden Benefits Of Optical Transparency", JOURNAL=ieeecm, VOLUME=32, NUMBER=9, PAGES="90-97", MONTH="Sep", YEAR=1994, REFERENCES=7, KEYWORDS="optical transparency; optic fiber; optical network; PDH; WDM; switching; reliability; fiber; repeater; network architecture", ABSTRACT="The optical fiber amplifier will bring about network transparency and reductions in manning levels, interface problems, software and operating costs, while improving reliability and performance.", } @INPROCEEDINGS{Colo94:Network, AUTHOR="G. Colombo and H. Hegeman", TITLE="Network architecture and functionalities in {UMTS}", BOOKTITLE="WCN (IEEE/ICCC)", PAGES="844-851 WA 3.1", YEAR=1994, KEYWORDS="B-ISDN; cellular system; IN; intelligent network; mobile radio; network architecture; overview", ABSTRACT="The paper analyses major network topics arising in the UMTS design process. this is done by invoking functional and architectural issues with relation to both the B-ISDN/IN context and the radio access features. ... This paper is based on the work performed within the RACE project 2066, named MONET.", } @ARTICLE{Comb94:Formalisation, AUTHOR="P. Combes and S. Pickin", TITLE="Formalisation of a User View of Network and Services for Feature Interaction Detection", JOURNAL="Feature Interactions in Telecommunications Systems, IOS Press", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="120-135", YEAR=1994, REFERENCES=25, KEYWORDS="IN; intelligent network", ABSTRACT="This paper proposes a method for detecting feature interactions by verifying that service feature requirements, specified in a formal property language (temporal logic), are satisfied on a formal specification language model (in SDL) of the network and the service features concerned. We develop an abstract model, representing a user (external) view, of the network and the service features, we give examples of IN feature requirements together wi", } @ARTICLE{Conn9410:Partnering, AUTHOR="Keith Connolly and Bruce E. Hess and William A. Hoberg and Thomas C. Pingel and R. Russell", TITLE="Partnering for Success: An Overview of Customer/Supplier Partnering", JOURNAL=ieeecm, VOLUME=32, NUMBER=10, PAGES="46-51", MONTH="Oct", YEAR=1994, KEYWORDS="customer; supplier; partnering; telecommunications", ABSTRACT="As customer satisfaction continues to drive businesses, telecommunications companies are forging partnerships that are aimed at the common goals of improved quality, reduced costs, and business success.", } @ARTICLE{Conw94:ATM, AUTHOR="A. E. Conway and Julian Keilson", TITLE="{ATM} Cell Multiplexer Analysis by a Compensation Method", JOURNAL="IEEE trans. on comp. systems", VOLUME="C-42", PAGES=11, YEAR=1994, KEYWORDS="ATM; analysis; multiplexer; multiplexing", } @ARTICLE{Cook9402:Optical, AUTHOR="Andy Cook and Jeff Stern", TITLE="Optical Fiber Access - Perspectives Toward the 21st Century", JOURNAL=ieeecm, VOLUME=32, NUMBER=2, PAGES="78-87", MONTH="Feb", YEAR=1994, KEYWORDS="optical fiber access", ABSTRACT="New fiber systems now emerging are expected to provide the basis for large scale deployment of fiber to business and residential customers during the '90s and beyond.", } @ARTICLE{Cook94:SDH, AUTHOR="T. Cook", TITLE="{SDH:} Pointer Problems", JOURNAL="Telecommunications", PAGES=4, YEAR=1994, KEYWORDS="transmission system; SDH", } @ARTICLE{Cool94:Survivable, AUTHOR="J. E. Cooling", TITLE="Survivable {LANs} for distributed control systems", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", VOLUME=17, NUMBER=5, PAGES="317-331", YEAR=1994, REFERENCES=34, KEYWORDS="distributed control; fault tolerance; HSLAN; LAN; MAN", ABSTRACT="This paper discusses the need for, and methods of achieving, survivability in distributed control system networks. It is applicable to areas such as avionics, marine systems and industrial plants. Basic survival strategies are discussed in the context of specific network topologies, with emphasis on system design aspects.", } @TECHREPORT{Cosm9402:Stochastic, AUTHOR="J. P. Cosmas", TITLE="Stochastic Source Models and Applications to {ATM}", INSTITUTION="Queen Mary and Westfield College", ADDRESS="London, Great Britain", VOLUME=8, NUMBER=2, PAGES="1-45", YEAR=1994, KEYWORDS="ATM; stochastic analysis; control; source model", ABSTRACT="The subject of this paper is the theory of the relationships between the main statistical parameters of voice, data and video sources, their source model parameters and how these source models relate to Useage Parameters Control mechanisms in ATM. Examples are given throughout to illustrate how the source models can be parameterisised and used. The mathematics is kept as simple and self explanatory as possible.", } @ARTICLE{Cott94:New, AUTHOR="D. Cotter and I. Hawker and A. Hill and V. Tandon", TITLE="New Network Infrastructures for the 21st Century - Part 2", JOURNAL="British Telecommunications Engineering", ADDRESS="Great Britain", VOLUME=13, PAGES="206-212", YEAR=1994, REFERENCES=7, KEYWORDS="network architecture; self routing", ABSTRACT="Subtitle: Ultra-fast self-routing networks New services and applications with totally different characteristics then today Network outline: more but simpler nodes then today, collective network intelligence Central management for rare, big events Key elements: transmission, lasers, 2x2 switches, delay-lines, fast optical AND gates Binary steering: route selection/merging Self-routing by optical header information Proposal for national se", } @INPROCEEDINGS{Coul94:Supporting, AUTHOR="G. Coulson and G. S. Blair and Philippe Robin and D. Shepherd", TITLE="Supporting Continuous Media Applications in a Micro-kernel Environment", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="215-234", YEAR=1994, } @ARTICLE{Cox9410:IEEE, AUTHOR="John Charles Cox and Jr Wyndrum", TITLE="{IEEE} Total Quality Management", JOURNAL=ieeecm, VOLUME=32, NUMBER=10, PAGES="42-45", MONTH="Oct", YEAR=1994, KEYWORDS="IEEE; quality management", ABSTRACT="The IEEE staff organization has undertaken a major quality initiative that has required a major staff learning and training program followed by pilot Quality Initiatives.", } @ARTICLE{Cros94:Restructuring, AUTHOR="M. Cross and F. O'Brien", TITLE="Restructuring the Problem of Feature Interaction: Has the Approach been Validated? Experience with an Advanced Telecommunications Application for Personal Mobility", JOURNAL="Feature Interactions in Telecommunications Systems, IOS Press", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="249-257", YEAR=1994, REFERENCES=12, KEYWORDS="IN; intelligent network", ABSTRACT="In an earlier paper the position was taken that one solution to feature interaction was to restructure the problem, so that the entities being added were not features, but non-interacting applications. The problem of feature interaction was recast as a realisation of the more abstract patterning of communication from the perspecive of social interaction. . . .", } @INPROCEEDINGS{Dahl94:Cooperative, AUTHOR="Michael D. Dahlin and Thomas Anderson and D. A. Patterson and Rwo-Hsi Wang", TITLE="Cooperative Caching: Using Remote Client Memory to Improve File System Performance", BOOKTITLE=osdi, PAGES="267-280", YEAR=1994, ABSTRACT="Emerging high-speed networks will allow machines to access remote data nearly as quickly as they can access local data. This trend motivates the use of cooperative caching: coordinating the file caches of many machines distributed on a LAN to form a more effective overall file cache. In this paper we examine four cooperative caching algorithms using a trace-driven simulation study. These simulations indicate that for the systems studied cooperative caching can halve the number of disk accesses, improving file system read response time by as much as 73\%. Based on these simulations we conclude that cooperative caching can significantly improve file system read response time and that relatively simple cooperative caching algorithms are sufficient to realize most of the potential performance gain.", } @INPROCEEDINGS{Dahl94:Directory, AUTHOR="J. Dahlström and J. Ericsson and D. Lawniczak", TITLE="Evaluation of Directory Node Architectures for the {DDB} Network in {UMTS}", BOOKTITLE="RACE Mobile Telecommunications Workshop, Amsterdam, 1994", PAGES="459-461", YEAR=1994, REFERENCES=4, KEYWORDS="database; distributed database; distributed system; mobile radio; performance evaluation; simulation", ABSTRACT="... It is expected that one of the major bottlenecks in the system will be the database, which stores and maintains the subscriber and terminal data. Since the penetration is expected to be high and the subscriber and terminal profiles large, an enormous amount of data has to be processed under real time conditions. In this paper it is investigated, using the simulation platform developed by the workpackage NESSY2, how the (distributed) databas", } @ARTICLE{Daig94:Discrete, AUTHOR="J. N. Daigle and Yeonwoo Lee and M. N. Magalhaes", TITLE="Discrete Time Queues with Phase Dependent Arrivals", JOURNAL="IEEE trans. on comp. systems", VOLUME="C-42", PAGES=9, YEAR=1994, KEYWORDS="queueing system; queueing theory; discrete time queue", } @TECHREPORT{Dam94:Adaptable, AUTHOR="Mads Dam", TITLE="On Adaptable Support for Cooperative Work", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-19", YEAR=1994, ABSTRACT="A critical dimension in the handling of change in computer-based systems for cooperative work is whether mechanisms for change should be explicitly embedded into systems, or whether change should be handled in a global and uniform manner, for instance by a process of editing and recompiling programs or scripts on the fly. We argue that to reflect the structure of organisations, powers of change must be local, structured, and dynamic. Thus a global and uniform handling of change is in general insufficient. We propose a formal basis for the description of dynamically modifiable objects, and explore its applicability in the field of CSCW by exposing it to three examples of increasing complexity: A system for dynamic communication channel creation; an adaptable conversation manager; and a rudimentary, yet quite general, awareness model.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-19--SE.ps.Z", } @TECHREPORT{Dam94:Decidability, AUTHOR="Mads Dam", TITLE="On the Decidability of Process Equivalences for the pi-calculus", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-20", YEAR=1994, ABSTRACT="We present general results for showing process equivalences applied to the finite control fragment of the pi-calculus decidable. Firstly a Finite Reachability Theorem states that up to finite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is finite. Secondly a Boundedness Lemma shows that no potential computations are missed when name spaces are chosen large enough, but finite. We show how these results lead to decidability for a number of pi-calculus equivalences such as strong or weak, late or early bismulation equivalence. Furthermore, for strong late equivalence we show how our techniques can be used to adapt the well-known Paige-Tarjan algorithm. Strikingly this results in a single exponential running time not much worse than the running time for the case of for instance CCS. Our results considerably strengthens previous results on decidable equivalences for parameter-passing process calculi.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-20--SE.ps.Z", } @TECHREPORT{Dam94:Model, AUTHOR="Mads Dam", TITLE="Model Checking Mobile Processes (Full version)", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-01", YEAR=1994, ABSTRACT="We introduce a temporal logic for the polyadic pi-calculus based on fixed point extensions of Hennessy-Milner logic. Features are added to account for parametrisation, generation, and passing of names, including the use, following Milner, of dependent sum and product to account for (unlocalised) input and output, and explicit parametrisation on names using lambda-abstraction and application. The latter provides a single name binding mechanism supporting all parametrisation needed. A proof system and decision procedure is developed based on Stirling and Walker's approach to model checking the modal mu-calculus using constants. One difficulty, for both conceptual and efficiency-based reasons, is to avoid the explicit use of the omega-rule for parametrised processes. A key idea, following Hennessy and Lin's approach to deciding bisimulation for certain types of value-passing processes, is the relativisation of correctness assertions to conditions on names. Based on this idea a proof system and decision procedure is obtained for arbitrary pi-calculus processes with finite control, pi-calculus correlates of CCS finite-state processes, avoiding the use of parallel composition in recursively defined processes.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-01--SE.ps.Z", } @TECHREPORT{Dan94:Channel, AUTHOR="Asit Dan and P. Shahabuddin and Dinkar Sitaram and Donald F. Towsley", TITLE="Channel Allocation under Batching and {VCR} Control in Movie-On-Demand Servers", TYPE="IBM Research Report", INSTITUTION="IBM Research", ADDRESS="Yorktown Heights, New York", NUMBER="RC19588", YEAR=1994, KEYWORDS="video-on-demand", } @ARTICLE{Dank94:Architecture, AUTHOR="D. D. Dankel and M. Schmalz and W. Walker and K. E. Nielsen and others", TITLE="An Architecture for Defining Features and Exploring Interactions", JOURNAL="Feature Interactions in Telecommunications Systems, IOS Press", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="258-271", YEAR=1994, REFERENCES=14, KEYWORDS="IN; intelligent network", ABSTRACT="The last decade has seen an explosive growth in the development of telephony features. The description and design of new features are fraught with errors due to this growth's impact on our ability to recognize interactions and the current practice of describing a feature's requirements using natural language. While the use of natural language eases the communication of requirements between the designer, customer, and developer, it introduces th", } @INPROCEEDINGS{Dant94:Best, AUTHOR="A. Danthine and O. Bonaventure", TITLE="From Best Effort to Enhanced {QOS}", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="179-202", YEAR=1994, } @ARTICLE{Dava9404:Earth, AUTHOR="F. Davarian", TITLE="Earth-Satellite Propagation Research", JOURNAL=ieeecm, VOLUME=32, NUMBER=4, PAGES="74-79", MONTH="Apr", YEAR=1994, KEYWORDS="earth-satellite propagation; slant-path; satellite communications; propagation; satellite communication", ABSTRACT="Slant-path propagation research is contributing to technical developments and business growth in new satellite-communications applications.", } @BOOK{Davi94:Security, AUTHOR="Donald W. Davies and W. L. Price", TITLE="Security for Computer Networks", PUBLISHER="John Wiley", YEAR=1994, KEYWORDS="computer network; computer security; cryptology; open system; security", } @ARTICLE{Deci9411:Multistage, AUTHOR="M. Decina and P. Giacomazzi and Achille Pattavina", TITLE="Multistage Shuffle Networks with Shortest Path and Deflection Routing for High-Performance {ATM} Switching: The Closed-Loop ShuffleoutShuffleout", JOURNAL=ieeecom, ISBN="0090-6778", VOLUME="COM-42", NUMBER=11, PAGES="3034-3044", YEAR=1994, REFERENCES=7, KEYWORDS="ATM; shortest path; routing; switching", ABSTRACT="A new class of switching architectures for broadband packet networks, called Shuffleout, is describes and analyzed in this paper. Shuffleout is basically an output-queued architecture with a multistage interconnection network built out of unbuffered b x 2bswitching elements. This paper presents the Closed-Loop Shuffleout architecture with 2 x 4 switching elements in which cells that have crossed the whole interconnection network re-enter the", } @ARTICLE{DeMe94:Open, AUTHOR="J. de Meer and B. Mahr and S. Storp", TITLE="Open Distributed Processing", JOURNAL="IFIP Transactions", PUBLISHER="North Holland", ADDRESS="Netherlands", VOLUME="C-20", YEAR=1994, KEYWORDS="distributed processing; distributed system; modeling; multimedia; open system; QOS", } @TECHREPORT{DeSi94:Desktop, AUTHOR="A. DeSimone and R. Nagarajan and Yixin Wang", TITLE="Desktop Multimedia Conferencing and Collaboration over the Ethernet", INSTITUTION="AT\\&T Bell Laboratories", ADDRESS="Holmdel, New Jersey", YEAR=1994, REFERENCES=11, KEYWORDS="multimedia; ethernet; H.261; synchronization", ABSTRACT="This paper explores in detail the feasibility of multimedia conferencing and collaboration in a Ethernet LAN environment. We consider two generic multimedia workstations conversing over the Ethernet via H.261 encoded video, PCM encoded voice and bandwidth limited data streams. t is clear that to facilitate a continuous play out voice and video streams a timely transport of voice and video streams across the workstation and the Ethernet is necessary. A cursory look at the problem might suggest that the Ethernet is a bottleneck since there is no inherent mechanism to provide timely delivery while the workstation environment can be engineered to have the desired properties. We show that this is not true and in fact the CPU in the workstation is a potential bottleneck. In particular the expected large network processing time on the CPU results in a large packetization delay for the real time streams for transport on the LAN. Further, the magnitude of the Ethernet delay is small with respect to the large delay in the workstation and hence its availability has little impact on the distribution of end-to-end delay and is easily controlled. The variability in the workstation is also easily controlled by minimal packet buffering. However, the large packet delay -due to the large fixed delay in the workstation- implies that the end-to-end delay -from generation to presentation to the user- can be large which may be unacceptable from a user perception point of view. It is hence necessary to either speed-up the CPU to reduce the protocol processing time and hence the packet delay or consider alternate strategies and schemes for the transport and play-out of multimedia streams. In this context, we propose aggregation of the streams at the application layer for transport and use of differential play-out offsets for the play-out respectively to ensure that both the the end-to-end delay and breaks in the play-out are small even when the protocol processing time is large.", URL="ftp://gaia.cs.umass.edu/pub/Naga94:MM\_Conf.ps.Z", } @ARTICLE{Deci9410:ATM, AUTHOR="M. Decina and C. Mossotto and A. Roveri", TITLE="The {ATM} Test-Bed: An Experimental Platform for Broadband Communications", JOURNAL=ieeecm, VOLUME=32, NUMBER=10, PAGES="78-83", MONTH="Oct", YEAR=1994, KEYWORDS="ATM; broadband communications; italy", ABSTRACT="An experimental plant has been implemented in Italy to investigate the critical issues related to the introduction of ATM techniques in a broadband communication environment.", } @INPROCEEDINGS{Dell94:Handling, AUTHOR="F. D. Priscoli and F. Sestini", TITLE="Handling of user mobility in a {CDMA} cellular network", BOOKTITLE=pmrc, PAGES="635-639", YEAR=1994, KEYWORDS="blocking; bursty traffic; CDMA; cellular system; MMPP; mobile radio; optimization", ABSTRACT="In this paper an expression of the link availability in CDMA cellular networks which takes into account user mobility is determined. The performed simulations base on this expression and on asimple but meaningful mobility which also considers hot cells where mobile users tend to accumulate. ...", } @ARTICLE{Delo9405:Interactive, AUTHOR="D. Deloddere and Willem Verbiest and H. Verhille", TITLE="Interactive Video On Demand", JOURNAL=ieeecm, VOLUME=32, NUMBER=5, PAGES="82-89", MONTH="May", YEAR=1994, REFERENCES=4, KEYWORDS="video on demand; video on demand; ATM", ABSTRACT="Video on demand -- likely to become one of the most successful services in the emerging broadband network -- must minimize bandwidth requirements to serve large numbers of users.", } @TECHREPORT{Dene94:Adaptive, AUTHOR="S. Denecke and T. Wahlbuhl", TITLE="Eine adaptive Komponente für Objektmigrationssysteme unter Benutzung Neuronaler Netze", ISBN="0941-3014", INSTITUTION="Hildesheimer Informatik-Berichte, Institut für Betriebssysteme \& Rechnerverbund", ADDRESS="Hildesheim, Germany", YEAR=1994, LANGUAGE="German", REFERENCES=24, KEYWORDS="distributed system; load balancing; neural network", ABSTRACT="Da es kein Objektmigrationsverfahren gibt, das unter allen Lastbedingungen optimale Ergebnisse liefert, ist es vorteilhaft, das jeweilige Verfahren-bzw. dessen Parameter-an die jeweilige Lastsituation anzupassen. In diesem Bericht werden Entwurf und Implementierung einer adaptiven Komponente vorgestellt, welche die Parameter von ausgewählten Lastverteilverfahren in Abhängigkeit der Lastsituation der nahen Vergangenheit einstellt. Kern dieser ad", } @ARTICLE{Denn9409:Key, AUTHOR="D. E. Denning and M. E. Smid", TITLE="Key Escrowing Today", JOURNAL=ieeecm, VOLUME=32, NUMBER=9, PAGES="58-69", MONTH="Sep", YEAR=1994, KEYWORDS="key escrowing; encryption; computer security", ABSTRACT="The objective of the U.S. Government's Escrowed Encryption Standard and associated Key Escrow System is to provide strong security for communications while simultaneously allowing authorized government access to particular communications for law enforcement and national security purposes.", } @UNPUBLISHED{Derm94:Constructing, AUTHOR="Gabriel Dermler and Thomas Gutekunst and B. Plattner and Edgar Ostrowski and Frank Ruge and Weber Michael", TITLE="Constructing a Distributed Multimedia Joint Viewing and Tele-Operation Service for Heterogeneous Workstation Enviroments", INSTITUTION="University of Stuttgart, Swiss Federal Institute of Technology, TUB-PRZ (Technische Universität Berlin), German Research Center for Artificial Intelligence", NOTE="internal memorandum", YEAR=1994, KEYWORDS="JVTOS; computer supported cooperative work (cscw); telepointing; session management; multimedia sharing in a heterogeneous setup", ABSTRACT="JVTOS (Joint Viewing and Tele-Operation Service) is an advanced teleservice to support cooperative work over distance which allows distributed users to work in a collaborative fashion with multimedia. JVTOS comprises facilities for session management, floor control, multimedia application sharing, Telepointing and audio/video communication. It provides generic support for cooperationaware multimedia applications. JVTOS offers services for multimedia collaboration across high-speed networks and is primarly aimed at running in heterogeneous workstations enviroments comprising different hardware platforms and also different operating and window systems.", } @INPROCEEDINGS{Derm94:Sharing, AUTHOR="Gabriel Dermler and Thomas Gutekunst and Edgar Ostrowski and Frank Ruge", TITLE="Sharing Audio/Video Applications Among Heterogeneous Platforms", BOOKTITLE="Fifth IEEE COMSOC International Workshop on Multimedia Communications", ADDRESS="Kyoto, Japan", YEAR=1994, KEYWORDS="JVTOS; multimedia; teleservice", 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 enabling distributed users to work in a collaborative fashion with multimedia. Core functionality of JVTOS is provided by an application sharing service that allows multimedia applications to be displayed and interacted with on multiple users' workstations simultaneously. The focus of this paper is on the audio/video elements of shared applications. We discuss the problems of sharing multimedia applications and describe our conception that supports interoperability between heterogeneous platforms.", URL="ftp://komsys.ethz.ch/pub/papers/Dermler94.ps", } @INPROCEEDINGS{Dey94:Providing, AUTHOR="Jayanta Dey-Sircar and Jawad A. Salehi and James F. Kurose and Donald F. Towsley", TITLE="Providing {VCR} capabilities in Large-Scale Video Servers", BOOKTITLE="ACM Multimedia", INSTITUTION="University of Massachusetts at Amherst", YEAR=1994, URL="ftp://gaia.cs.umass.edu/", } @ARTICLE{Dime9411:Role, AUTHOR="Francis Zammit Dimech", TITLE="The Role of Telecommunications as a Catalyst for Qualitative Change", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="32-33", MONTH="Nov", YEAR=1994, KEYWORDS="telecommunications; qualitative change", ABSTRACT="Malta's telecommunications infrastructure is catalyst for a qualitative change in the services sector of the economy.", } @INPROCEEDINGS{Dosh94:Deterministic, AUTHOR="B. T. Doshi", TITLE="Deterministic Rule Based Traffic Descriptors For Broadband {ISDN:} Worst Case Behavior And Connection Acceptance Control", BOOKTITLE=itc14, EDITOR="J. Labetoulle and J. W. Roberts", PUBLISHER="Elsevier Science B. V.", PAGES="591-600", YEAR=1994, KEYWORDS="worst case; stochastic; deterministic; tri-state; leaky bucket", } @INPROCEEDINGS{Doug94:Storage, AUTHOR="F. Douglis and R. Caceres and Frans Kaashoek and Kin Li and Brian D. Marsh and Joshua A. Tauber", TITLE="Storage Alternatives for Mobile Computers", BOOKTITLE=osdi, PAGES="25-37", YEAR=1994, ABSTRACT="Mobile computers such as notebooks, subnotebooks, and palmtops require low weight, low power consumption, and good interactive performance. These requirements impose many challenges on architectures and operating systems. This paper investigates three alternative storage devices for mobile computers: magnetic hard disks, flash memory disk emulators, and flash memory cards. \par We have used hardware measurements and trace-driven simulation to evaluate each of the alternative storage devices and their related design strategies. Hardware measurements on an HP OmniBook 300 highlight differences in the performance of the three devices as used on the Omnibook, especially the poor performance of version 2.00 of the Microsoft Flash File System [11] when accessing large files. The traces used in our study came from different environments, including mobile computers (Macintosh PowerBooks) and desktop computers (running Windows or HPUX), as well as synthetic workloads. Our simulation study shows that flash memory can reduce energy consumption by an order of magnitude, compared to magnetic disk, while providing good read performance and acceptable write performance. These energy savings can translate into a 22\% extension of battery life. We also find that the amount of unused memory in a flash memory card has a substantial impact on energy consumption, performance, and endurance: compared to low storage utilizations (40\% full), running flash memory near its capacity (95\% full) can increase energy consumption by 70-190\%, degrade write response time by 30\%, and decrease the lifetime of the memory card by up to a third. For flash disks, asynchronous erasure can improve write response time by a factor of 2.5.", } @ARTICLE{Dove94:Network, AUTHOR="R. D. Doverspike and Jonathan A. Morgan and Will Leland", TITLE="Network Design Sensitiviy Studies for Use of Digital Cross-Connect Systems in Survivable Network Architectures", JOURNAL=ieeejsac, VOLUME=12, NUMBER=1, PAGES="69-78", YEAR=1994, REFERENCES=15, KEYWORDS="cross connect; distributed control; fault tolerance; network; network architecture; network design; reconfigurable network; self healing network", ABSTRACT="This paper provides the results of an economic study on the use of SONET Digital Cross-Connect Systems (DCSs) to provide survivable transmission network architectures in local exchange networks. Three fundamental survivable transmission technologies are considered: 1) SONET self-healing ring, 2) SONET point-to-point fiber system with 1:1 automatic protection switching and diverse routing of protection facilities and 3) a DCS me", } @ARTICLE{Dunc9404:Inverse, AUTHOR="Jay Duncanson", TITLE="inverse Multiplexing", JOURNAL=ieeecm, VOLUME=32, NUMBER=4, PAGES="34-41", MONTH="Apr", YEAR=1994, KEYWORDS="inverse multiplexing; high-speed networking; multiplexing; CPE", ABSTRACT="This novel approach to high-speed data networking uses a new type of customer premises-based equipment that exploits existing network services to provide enhanced functionality.", } @ARTICLE{Dutt94:Capacity, AUTHOR="A. Dutta", TITLE="Capacity Planning of Private Networks Using {DCS} Under Multibusy-Hour Traffic", JOURNAL=ieeecom, YEAR=1994, ABSTRACT="An integer programming model and Lagrangian relaxation-based heuristic solution method is developed, to determine transmission capacity in private backbone networks using DCS's, such that multibusy-hour point-to-point circuit requirements can be met at low cost. It simultaneously determines capacity, routing and topology. Numerical results for T1 networks are shown.", } @ARTICLE{Dzio9402:Call, AUTHOR="Z. Dziong and L. G. Mason", TITLE="Call Admission and Routing in Multi-Service Loss Networks", JOURNAL=ieeecom, ISBN="0090-6778", VOLUME="COM-42", NUMBER=2, PAGES="2011-2022", YEAR=1994, REFERENCES=31, KEYWORDS="state dependent routing; heterogeneous traffic; markov process; decomposition; sensitivity analysis; optimization", ABSTRACT="A state-dependent policy for call admission and routing in a multi-service circuit-switched network is synthesized. To meet different requirements the objective function is defined as the meanvalue of reward from the network. Policy iteration is applied to find the optimal control. Assuming link independence the network reward process is decomposed into the set of link reward processes thereby significantly reducing complexity. The approach is", } @ARTICLE{Eber94:Gestaltung, AUTHOR="D. Eberling and Werner Henkel and M. K„lling and G. Sch”nemann and N. Vogt", TITLE="Gestaltung und Planung von Glasfaseranschluáleitungsnetzen", JOURNAL="Taschenbuch der Telekompraxis", ADDRESS="Darmstadt, Germany", PAGES="18-39", YEAR=1994, LANGUAGE="German", KEYWORDS="network architecture; network topology; network planning; network design; network evolution; cost function; broadband; access network", ABSTRACT="The article compares the costs of different access networks. It is shown that OPAL-networks (Optical Passiv Access Line) will be in the cost-range of traditional access networks if the number of local switching centers is reduced. In the last part of the article planning rules for OPAL-networks are given.", } @UNPUBLISHED{Ecka94:Personal, AUTHOR="Tim Eckardt and Thomas Magedanz", TITLE="On the Personal Communications Impacts on Multimedia Teleservices", INSTITUTION="GMD Fokus, Berlin", NOTE="unpublished memorandum", YEAR=1994, KEYWORDS="PCSS; broadband networks; multimedia applications; mobile communication", ABSTRACT="The developement of broadband networks and especially the design of emerging multimedia applications on top of these networks have to recognize a major trend in telecommunications: the evolution towards personal mobility and personalized communication. This paper gives an overview of the required capabilities for supporting user mobility and enhanced call management in future multimedia broadband environments. It introduces a generic Personal Communication Support System -PCSS- based on state-of-the-art management system technology, which integrates X.500 directory and X.700 management standards. The description of the PCSS includes a preliminary generic service user profile, which contains besides general user data user-specific location information and sophisticated communication control attributes for any communication service. Access to the profile data for both, user profile management and control of any multimedia communication applications will be realized via uniform management application programing interfaces.", } @INPROCEEDINGS{Effe94:Application, AUTHOR="W. Effelsbersg and B. Lamparter and Ralf Keller", TITLE="Application Layer Issues for Digital Movies in High-Speed Networks", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="273-290", YEAR=1994, URL="http://www.informatik.uni-mannheim.de/informatik/publications/index.publications.html", } @TECHREPORT{Eine94:Neural, AUTHOR={Martin Eineborg and Bj"o Gamb"ack}, TITLE="Neural Networks for Wordform Recognition", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-05", YEAR=1994, ABSTRACT="The paper outlines a method for automatic lexical acquisition using three-layered back-propagation networks. Several experiments have been carried out where the performance of different network architectures have been compared to each other on two tasks: overall part-of-speech (noun, adjective or verb) classification and classification by a set of 13 possible output categories. The best results for the simple task were obtained by networks consisting of 204-212 input neurons and 40 hidden-layer neurons, reaching a classification rate of 93.6\%. The best result for the more complex task was 96.4\%, which was achieved by a net with 423 input neurons and 80 hidden-layer neurons. These results are rather promising and the paper compares them to the performance reported by rule-based and purely statistical methods; a comparison that shows the neural network completely compatible with the statistical approach. The rule-based method is, however, still better, even though it should noted that the task that the rule-based system performs is somewhat different from that of the neural net.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-05--SE.ps.Z", } @ARTICLE{Elef94:Architecture, AUTHOR="Alexandros Eleftheriadis and Sassan Pejhan and Dimitris Anastassiou", TITLE="Architecture and algorithms of the Xphone multimedia communication system", JOURNAL="Multimedia Systems Journal", PUBLISHER="ACM/Springer Verlag", YEAR=1994, REFERENCES=21, KEYWORDS="multimedia communications systems; media synchronization; source rate control; application development systems; JPEG", ABSTRACT="We describe the architecture and the algorithms used in Columbia University's ``Xphone'' multimedia communication system. The system assumes a ``best-effort'' operating system and network and provides facilities for call management, intra-application scheduling for support of continuous data flow and integration with the windowing system, and synchronized video/audio acquisition/playback (locally or across a network) with minimized and bounded end-to-end delay. Synchronization is achieved using an algorithm based on timestamps and device state information. The effects of jitter (delay variation) are mitigated using silence detection; the end-to-end delay is kept bounded using a restart mechanism. Finally, for live video sources, we describe a source bit-rate adaptation algorithm that maximizes the video image quality to the available network bandwidth and video display window size.", ANNOTE="Fifth-order polynomial approximation of bandwidth as function of (log of) JPEG $Q$ factor and image area. Adapts based on measured TCP throughput. Audio transported via TCP; receiver and sender synchronize clocks by having the sender stop based on XON/XOFF-type signal if delay is excessive. Audio delays measured at 300 ms.", } @ARTICLE{Elli94:Sticky, AUTHOR="Chip Elliott", TITLE="A 'Sticky' conference control protocol", JOURNAL=internet, VOLUME=5, PAGES="97-119", YEAR=1994, KEYWORDS="conference control; internet; video conference; session control; signaling; multimedia negotiation", ABSTRACT="Wide-area interactive conferencing has become a lively issue to the Internet community and to many other network research groups as well. In this paper, we describe a Sticky conference control protocol that has been deployed for $n$-way videoconferencing on the worldwide Defense Simulation Internet. It differs from other well-known conference protocols in its lack of shared state and explicit modeling of a conference membership as a (possibly) incomplete directed graph, rather than assuming full connectivity. It also takes an unusual 'late-binding' approach to resource and bandwidth negotiation. We describe the architecture and mechanism of the Sticky protocol, then contrast it with the CCP and Light-Weight Session conference control protocols.", } @ARTICLE{Elwa9411:Statistical, AUTHOR="A. I. Elwalid and D. Mitra", TITLE="Statistical Multiplexing with Loss Priorities in Rate-Based Congestion Control of High Speed Networks", JOURNAL=ieeecom, ISBN="0090-6778", VOLUME="COM-42", NUMBER=11, PAGES="2989-3001", YEAR=1994, REFERENCES=27, KEYWORDS="statistical multiplexing; congestion control; ISDN; ATM", ABSTRACT="The paper presents a stochastic fluid model of statistical multiplexing with loss priorities. In this model each Markov-modulated fluid source generates streams of different priorities. The burstiness of each stream and the correlation between the prioritystreams are captured in the model.", } @ARTICLE{Eng94:Comparison, AUTHOR="Tony Eng and L. B. Milstein", TITLE="Comparison of Hybrid {FDMA/CDMA} Systems in Frequency Selective Rayleigh Fading", JOURNAL=ieeejsac, YEAR=1994, ABSTRACT="A hybrid FDMA/CDMA scheme operating over a frequency selective Rayleigh fading channel is described and analyzed. The performance of the hybrid system is then compared with that of a wideband CDMA system occupying the same total bandwidth. Both coherent and noncoherent modulation formats are investigated; it is found that, for coherent modulation with a RAKE receiver, wideband CDMA has greater capacity than does the hybrid. However, for the noncoherent modulation formats (either DPSK or square-law detected orthogonal signaling), a hybrid system can have a greater capacity if a high channel error rate can be tolerated. Otherwise, a wideband noncoherent system remains optimal.", } @INPROCEEDINGS{Enss94:Modelling, AUTHOR="J. Enssle", TITLE="Modelling and Statistical Multiplexing of {VBR} {MPEG} Compressed Video in {ATM} Networks", BOOKTITLE="4th Open Workshop on High Speed Networks", ADDRESS="Brest, France", PAGES=10, YEAR=1994, REFERENCES=17, KEYWORDS="ATM; VBR; video coding", ABSTRACT="The future Broadband Integrated Services Digital Network will be based on the ATM that allows statistical multiplexing of variable bitrate sources. Video data will have a major share in future broadband traffic. In this paper we investigate in detail the statistical properties of a very long video sequence encoded according to the MPEG-I video standard. Simulation models were developed that can be mathed to the properties of any MPEG encoded vi", } @ARTICLE{Ever94:Traffic, AUTHOR="David Everitt", TITLE="Traffic Engineering of the Radio interface for Cellular Mobile Networks", JOURNAL=ieeeproc, VOLUME=82, NUMBER=9, PAGES="1371-1382", YEAR=1994, REFERENCES=56, KEYWORDS="cellular system; traffic engineering", ABSTRACT="This paper reviews traffic-related issues in the operation of the radio interface in cellular mobile networks operation with FDMA, TDMA, or CDMA technology. The emphasis is on issues which affect the traffic performance of the network, rather than on transmission technology, or transmission quality measures such as bit error rate. We review the important traffic performance measures for cellular systems and the issues of channel assignment, han", } @ARTICLE{Faci94:Specifying, AUTHOR="M. Faci and L. Logrippo", TITLE="Specifying Features and Analysing Their Interactions in a {LOTOS} Environment", JOURNAL="Feature Interactions in Telecommunications Systems, IOS Press", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="136-151", YEAR=1994, REFERENCES=26, KEYWORDS="IN; intelligent network; lotos; specification", ABSTRACT="This paper presents an approach for specifying telephone features and analysing their interactions in a LOTOS environment. The approach is characterized by a flexible specification structure and an analysis method based on knowledge goals. Structurally, the specifications allow the integration of new features into existing ones by specifying each feature independently and composing its behaviour with the existing system. Analytically, the reaso", } @PROCEEDINGS{Fdid9406:High, TITLE="High Performance Networking -- 5th {IFIP} conference", EDITOR="S. Fdida", ISBN="0-444-82023-x", PUBLISHER="North Holland", ADDRESS="Grenoble, France", NOTE="IFIP Transcations (C-26)", MONTH="June/July", YEAR=1994, KEYWORDS="architecture; high speed; high-performance switching network; internetworking; LAN; MAN; multimedia; multiple access; performance evaluation; QOS; tool; traffic analysis", ABSTRACT="HPN' 94 aims at being an international forum where researchers coming from both industry and universities present and discuss evolution in the framework of high-speed networking and computing. The conference targeted new mechanisms, protocols, services and architectures derived from the need of emerging distributed multimedia applications, as well as from he requirements of the new communication environments. The contributions presented", } @INPROCEEDINGS{Feel94:Integrating, AUTHOR="Mike Feeley and Jeffrey S. Chase and Vivek R. Narasayya and H. M. Levy", TITLE="Integrating Coherency and Recoverability in Distributed Systems", BOOKTITLE=osdi, PAGES="215-227", YEAR=1994, ABSTRACT="We propose a technique for maintaining coherency of a transactional distributed shared memory, used by applications accessing a shared persistent store. Our goal is to improve support for fine-grained distributed data sharing in collaborative design applications, such as CAD systems and software development environments. In contrast, traditional research in distributed shared memory has focused on supporting parallel programs; in this paper, we show how distributed programs can benefit from this shared-memory abstraction as well. \par Our approach, called log-based coherency, integrates coherency support with a standard mechanism for ensuring recoverability of persistent data. In our system, transaction logs are the basis of both recoverability and coherency. We have prototyped log-based coherency as a set of extensions to RVM [Satyanarayanan et al. 94], a runtime package supporting recoverable virtual memory. Our prototype adds coherency support to RVM in a simple way that does not require changes to existing RVM applications. We report on our prototype and its performance, and discuss its relationship to other DSM systems.", } @BOOK{Feld94:Pioniere, AUTHOR="E. Feldtkeller and H. Goetzeler", TITLE="Pioniere der Wissenschaft bei Siemens", ISBN="3-89578-006-5", PUBLISHER="Publicis MCD Verlag", ADDRESS="Munich, Germany", YEAR=1994, LANGUAGE="German", KEYWORDS="history", } @ARTICLE{Fern9408:Wireless, AUTHOR="Jose J. g. Fernandes and Peter A. Watson and Jose Neves", TITLE="Wireless {LANs:} Physical Properties of Infra-Red Systems vs. Mmw Systems", JOURNAL=ieeecm, VOLUME=32, NUMBER=8, PAGES="68-73", MONTH="Aug", YEAR=1994, REFERENCES=12, KEYWORDS="wireless lans; infra-red systems; mmw systems; wireless indoor communication; broad bandwidths; carrier frequency", ABSTRACT="Over the past four years, interest in wireless indoor communications has been spectacular. As we tend to need relatively broad bandwidths for such communication, the choice of carrier frequency would seem to be between the millimeter-wave/upper microwave bands and infra-red.", } @INPROCEEDINGS{Ferr94:Garbage, AUTHOR="Paulo Ferreira and M. Shapiro", TITLE="Garbage Collection and {DSM} Consistency", BOOKTITLE=osdi, PAGES="229-241", YEAR=1994, ABSTRACT="This paper presents the design of a copying garbage collector for persistent distributed shared objects in a loosely coupled network with weakly consistent distributed shared memory (DSM). \par The main goal of the design for this garbage collector is to minimize the communication overhead due to collection between nodes of the system, and to avoid any interference with the DSM memory consistency protocol. \par Our design is based on the observation that, in a weakly consistent DSM system, the memory consistency requirements of the garbage collector are less strict than those of the applications. Thus, the garbage collector reclaims objects independently of other copies of the same objects without interfering with the DSM consistency protocol. Furthermore, our design does not require reliable communication support, and is capable of reclaiming distributed cycles of dead objects.", } @ARTICLE{Ferr94:Theoretical, AUTHOR="Katherine W. Ferrara and V. Ralph Algazi", TITLE="A Theoretical and Experimental Analysis of the Received Signal from Disturbed Blood Flow", JOURNAL=ieeekde, YEAR=1994, ABSTRACT="A theoretical and experimental study of the received ultrasonic signal from calibrated stenotic flow phantoms is presented. A finite element analysis of the velocity profile for 30, 50, and 80\% stenoses provides a basis for the study of the experimental results. High-resolution images of the returned signal obtained from a unique experimental system and a high volume concentration of scatterers are then presented. We show that in the presence of 30 and 50\% stenoses, particularly for the low velocities which would be associated with diastole, the duration of the signal correlation increases in a region which is distal to the stenosis and near the vessel walls, rather than the expected decrease. This results from the decrease in the mean velocity and velocity spread within this region. In the presence of high velocities associated with systolic flow, the magnitude of the reverse flow component increases as does the peak velocity in the center of the vessel. These changes produce an increase in the radial velocity gradient, a shift in the gradient peak, and a decrease in the correlated signal interval in comparison with laminar flow. Thus, the spatial variation in the mean velocity and velocity gradient, and spatial variation in the signal correlation can be used to detect the change in the flow profile.", } @ARTICLE{Fisc9408:Data, AUTHOR="W. Fischer and E. Wallmeier and T. Worster and Simon P. Davis and Andrew Hayter", TITLE="Data Communications Using {ATM:Architectures,} Protocols, and Resource Management", JOURNAL=ieeecm, VOLUME=32, NUMBER=8, PAGES="24-33", MONTH="Aug", YEAR=1994, REFERENCES=12, KEYWORDS="data communications; ATM; resource management; protocols; traffic characteristics", ABSTRACT="The introduction of ATM is being propelled by the need for fast data communications in public and private networks. What is needed is a clear picture of protocol architecture and traffic characteristics of the various applications to be supported both now and in the future.", } @TECHREPORT{Fisc94:Efficient, AUTHOR="Stefan Fischer and Bernd Hofmann and W. Effelsberg", TITLE="Efficient Configuration of Protocol Software for Multiprocessors", INSTITUTION={Praktische Informatik IV, Universit\"{a}t Mannhei}, YEAR=1994, ABSTRACT="Efficient implementation of communication software is of crucial importance for high-speed networks. One way to improve the runtime performance of protocol implementations in the network nodes is the use of parallelism. Formal description techniques like Estelle improve the specification process in many respects and allow for semiautomatic code generation. Therefore, they are now widely accepted. We present a code generator for Estelle that compiles and automatically configures protocol software for a multiprocessor. Software modules are distributed over the available processors and executed concurrently. We report performance results on a KSR1 with 28 available processors under the OSF/1 operating system.", URL="ftp://pi4.informatik.uni-mannheim.de/pub/techreports/tr-94-006.ps.gz", } @UNPUBLISHED{Floy94:TCP, AUTHOR="S. Floyd", TITLE="{TCP} and Explicit Congestion Notification", INSTITUTION="Lawrence Berkeley Laboratory", ADDRESS="Berkeley, California CA 94704", NOTE="A PostScript version of this document is available from ftp://ftp.ee.lbl.gov/papers/tcp\\_ecn.4.ps.Z", YEAR=1994, KEYWORDS="TCP/IP; retransmission; ECN; RED", ABSTRACT="This paper discusses the use of Explicit Congestion notification -ECN- mechanism in the TCP/IP protocol. The first part proposes new guidelines for TCP's response to ECN mechanisms -e.g., Source Quench packets, ECN fields in packet headers. Next, using simulations, we explore the benefits and drawbacks of ECN in TCP/IP networks. Our simulations use RED gateways modified to set an ECN bit in the IP packet header as an indication of congestion in the IP packet header as indication of congestion, with Reno-style TCP modified to respond to ECN as well as to packet drops as indication of congestion. The simulations show that one advantage of ECN mechanisms is in avoiding unnecessary delay of packets from low bandwidth delay sensitive TCP connection. A second advantage of ECN mechanisms is in networks -generally LANs- where the effectiveness of TCP retransmit timers is limited by the coarse granularity of the TCP clock. The paper also discusses some implementation issues concerning specific ECN mechanisms in TCP/IP networks.", } @ARTICLE{Flyn94:3D, AUTHOR="Patrick Flynn", TITLE="{3D} Object Recognition With Symmetric Models: Symmetry Extraction and Encoding", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="Object recognition systems which employ solid models and range data have been a topic of interest for several years. Model databases have the potential to become large in some environments. This paper proposes a pair of techniques for incorporating knowledge of the symmetries of object models into the recognition process. The effects of symmetric models on the speed of an object recognition system is examined in the context of an implemented system employing invariant feature indexing as a correspondence-building mechanism. Groups of model surfaces are enumerated and examined to yield a list of segment label permutations which summarize the model's symmetry. This symmetry extraction process is followed by a symmetry encoding procedure which replaces groups of features which are indistinguishable because of symmetry with a single prototype feature group. Experiments with a large model database demonstrate the utility of these symmetry extraction and encoding techniques.", } @BOOK{Ford94:Computer, AUTHOR="Warwick S. Ford", TITLE="Computer Communications Security: Principles, Standard Protocols and Techniques", ISBN="0-13-799453-2", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1994, KEYWORDS="access control; application layer; authentication; computer security; cryptology; LAN; layered protocol; network layer; network management; protocol; security; transport layer", ABSTRACT="My objectives in this book are to create an awareness and an understanding of standardized methods for securing computer networks and their applications, focusing on intersystem, as opposed to intrasystem, security functions.", } @ARTICLE{Fran9401:Performability, AUTHOR="L. Franken and Boudewijn R. Haverkort", TITLE="The performability manager", JOURNAL=ieeenet, VOLUME=8, NUMBER=1, PAGES="24-32", MONTH="January/February", YEAR=1994, REFERENCES=48, KEYWORDS="performance; quality of service; petri nets; ANSA", ABSTRACT="By dynamically reconfiguring distributed systems, the performability manager contributes to a more effective use of system components and prevents QoS degradation.", } @ARTICLE{Fran94:Computing, AUTHOR="Giuliana A. Franceschinis and R. R. Muntz", TITLE="Computing Bounds for the Performance Indices of Quasi-Lumpable Stochastic Well-Formed Nets", JOURNAL=ieeese, YEAR=1994, ABSTRACT="Structural symmetries in Stochastic Well-Formed Colored Petri Nets (SWN) lead to behavioral symmetries that can be exploited using the Symbolic Reachability Graph (SRG) construction algorithm: it allows to compute an aggregated Reachability Graph (RG) and a ``lumped'' Continuous Time Markov Chain (CTMC) that contain all the information needed to study the qualitative properties and the performance of the modeled system respectively. Some models exhibit qualitative behavioral symmetries that are not completely reflected at the CTMC level, we call them quasi-lumpable SWN models. In these cases, exact performance indices can be obtained by avoiding the aggregation of those markings that are qualitatively but not quantitatively equivalent. An alternative approach consists of aggregating all the qualitatively equivalent states, and computing approximated performance indices. In this paper a technique is proposed to compute bounds on the performance of SWN models of this kind, using the results presented in [4]. The technique is based on the Courtois and Semal's bounded aggregation method [2].", } @TECHREPORT{Fran94:Formal, AUTHOR="Torkel Franzen", TITLE="Some Formal Aspects of {AKL}", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-10", YEAR=1994, ABSTRACT="The Agents Kernel Language allows committed choice programming as well as nondeterministic logic programming based on the Andorra principle (and combinations of these), with a considerable degree of parallelism. In the present report the AKL computation model is formally defined and soundness and completeness results for a logical subset of AKL are presented. The computation model is extended to cover ports, a medium of communication used in AKL, and the solution collecting operation bagof. These extensions preserve the basic character of the computation model, and in particular the role played by the constraint theory. Declarative interpretations of these constructs are introduced, and the limitations of these readings are discussed. Finally, the confluence of strongly fair (possibly infinite) computations in a different subset of AKL is proved.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-10--SE.ps.Z", } @ARTICLE{Fred9404:Past, AUTHOR="Paul H. Fredette", TITLE="The Past, Present, and Future of Inverse Multiplexing", JOURNAL=ieeecm, VOLUME=32, NUMBER=4, PAGES="42-47", MONTH="Apr", YEAR=1994, KEYWORDS="inverse multiplexing; aggregate channel; inverse multiplexing", ABSTRACT="Aggregating channels so applications can readily select the optimum cost-bandwidth combination is becoming more attractive as applications increasingly require higher transmission bit rates.", } @INPROCEEDINGS{Free94:Distributed, AUTHOR="Vincent Freeh and David Lowenthal and G. R. Andrews", TITLE="Distributed Filaments: Efficient Fine-Grain Parallelism on a Cluster of Workstations", BOOKTITLE=osdi, PAGES="201-213", YEAR=1994, ABSTRACT="A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situations, such as iterative grid computations, recursive fork/join programs, the bodies of parallel FOR loops, and the implicit parallelism in functional or dataflow languages. It is useful both to describe massively parallel computations and as a target for code generation by compilers. However, fine-grain parallelism has long been thought to be inefficient due to the overheads of process creation, context switching, and synchronization. This paper describes a software kernel, Distributed Filaments (DF), that implements fine-grain parallelism both portably and efficiently on a workstation cluster. DF runs on existing, off-the-shelf hardware and software. It has a simple interface, so it is easy to use. DF achieves efficiency by using stateless threads on each node, overlapping communication and computation, employing a new reliable datagram communication protocol, and automatically balancing the work generated by fork/join computations.", } @BOOK{Free94:Reference, AUTHOR="Roger L. Freeman", TITLE="Reference manual for telecommunications engineering", ISBN="0-471-57960-2", PUBLISHER="John Wiley", ADDRESS="New York", YEAR=1994, KEYWORDS="telecommunications; television; networks; ISDN; X.25; anntenas; radio; noise; transmission lines; fiber optics; modulation; routing; multiplexing; electromagnetic wave propagation; numbering; traffic theory; signaling; switching; electromagnetic compatibility; facsimile; standard time and frequency; reliability; engineering economics", } @INPROCEEDINGS{Froh94:Adaptive, AUTHOR="U. Fröhlings", TITLE="Adaptive Verfahren in der optimistischen verteilten Simulation", BOOKTITLE="Workshop über parallele und verteile Simulation - Bericht Nr. AIS 21", ADDRESS="Oldenburg, Germany", PAGES="26-31", YEAR=1994, LANGUAGE="German", REFERENCES=17, KEYWORDS="distributed simulation; time warp", } @ARTICLE{Frie94:Functional, AUTHOR="Anda Friedman", TITLE="A Functional Approach to Efficient Fault Detection in Iterative Logic Arrays", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="In this paper we consider the problem of fault detection in iterative logic arrays (ILA's). This problem has been studied by numerous researchers for many years. The results can be succinctly summarized by stating that one dimensional arrays can be effectively analyzed and significant results obtained while the problems associated with arrays of dimension two or greater appear to be intractable (i.e. NP-complete) for general arbitrary ILA's. However as is the case for many other switching theory problems, general case problems which are intractable, can be readily handled for the special cases defined by functions commonly encountered in practice. We show that arrays of dimension two or greater can be effectively tested for the case when the functions defined by the arrays have inverses. Many specific arithmetic functions satisfy this property. We also show that even for functions which do not satisfy this property, the functional approach simplifies testing problems considerably.", } @ARTICLE{Fros9403:Simulating, AUTHOR="Victor S. Frost and B. Melamed", TITLE="Simulating Telecommunications Networks with Traffic Modeling", JOURNAL=ieeecm, VOLUME=32, NUMBER=3, PAGES="70-81", MONTH="Mar", YEAR=1994, KEYWORDS="simulation; telecommunications; traffic modeling", ABSTRACT="As new communications services evolve, professionals must create simulation programs to model the processing of increasing user demands.", } @ARTICLE{Fuji94:Consideration, AUTHOR="M. Fujioka and Y. Wakahara", TITLE="Consideration on Common Channel Signaling Evolution for Global Intelligent Networking", JOURNAL=ieeejsac, VOLUME=12, NUMBER=3, PAGES="510-516", YEAR=1994, REFERENCES=6, KEYWORDS="common channel; IN; intelligent network; mobile radio; overview; signalling", ABSTRACT="With th e evolution of digital networks and intelligent network(IN) capabilities, the role of common channel signaling has become more and more important. In respect to IN, common channel signaling would play asignificant role not only inside one networkbut also over multiple networks. International credit card validation and internetworking for digital mobile services represented by GSM are examples which utilize internetworking signaling ca", } @INPROCEEDINGS{Fuku94:Dynamic, AUTHOR="S. Fukumoto and Dong-Chul Park and Kazunori Okada and I. Sasase", TITLE="Dynamic channel assignment Using a channel framework for traffic congestion in a highway micro cellular system", BOOKTITLE=pmrc, PAGES="164-167 (B.2.2", YEAR=1994, REFERENCES=8, KEYWORDS="cellular system; congestion; dynamic resource allocation; mobile radio", } @INPROCEEDINGS{Fult94:Audio, AUTHOR="Jim Fulton and Greg Renda", TITLE="The Network Audio System", BOOKTITLE="X Technical Conference", ORGANIZATION="X Consortium, Cambridge, Massachusetts", NOTE="also in {\em X Resource: A Practical Journal of the X Window System}, O'Reilly, Issue 9, pp. 181--194", YEAR=1994, REFERENCES=6, KEYWORDS="packet audio; X11; windowing system", ABSTRACT="Audio input and output is rapidly becoming a standard feature in desktop devices and an expected element of user interfaces. Workstations, X terminals, and personal computers now typically include hardware capabilities ranging from 8 kHz mono ``voice quality'' up through 48 kHz stereo. Unfortunately, application programming interfaces vary widely across platforms, limiting the types of applications that can be developed in X environments. The Network Audio System , commonly but unimaginatively known as NetworkAudio, was developed by NCD for playing, recording, and manipulating audio data over a network. Like the X Window System [Scheifler92], it uses the client/server model to separate applications from the specific drivers that control audio input and output devices. A free, sample implementation of the NetworkAudio server and programming library is available for Sun and SGI platforms; additional product versions are available or have been announced for NCD X terminals, NCD PC-X servers, and SCO workstations. A number of commercial applications have also announced support, and the mailing list for NetworkAudio grows every day.", URL="ftp://ftp.x.org/contrib/audio/nas/xcon94paper.ps.gz", } @INPROCEEDINGS{Gagn94:Bandwidth, AUTHOR="M. Gagnaire and G. Macario", TITLE="Bandwidth Allocation on the Metaring Gigabit/s network", BOOKTITLE="International Conference on Information Networks And Data Communications (INDC)", PAGES=15, YEAR=1994, REFERENCES=16, KEYWORDS="bandwidth allocation; HSLAN; MAN", ABSTRACT="The Metaring access protocol includes a fairness mechanism which prevents a station from any starvation. In the case of a single priority traffic, this mechanism is called the Global FairnessMechanism (GFM). In this paper, we compare by means of simulation results different bandwidth allocation scenarios using the GFM mechanism. For that purpose, we analyse the influence of the various GFM parameters in terms of fairness and medium utilization", } @ARTICLE{Gail9401:Class, AUTHOR="H. R. Gail and S. L. Hantler and A. G. Konheim and B. A. Taylor", TITLE="An analysis of a class of telecommunication models", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=21, NUMBER="1-2", PAGES="151-161", YEAR=1994, REFERENCES=17, KEYWORDS="ATM; queueing system; M/G/1", ABSTRACT="In this short note we outline a general method for characterizing the ergodicity and computing performance measures for large class of telecommunication models. We also point out errors that have appeared in the literature when using the transform method to analyze such models.", } @INPROCEEDINGS{Gaje94:Argo, AUTHOR="Hania Gajewska and J. J. Kistler and Mark S. Manasse and D. D. Redell", TITLE="Argo: A System for Distributed Collaboration", BOOKTITLE="ACM Multimedia", ORGANIZATION="ACM", YEAR=1994, REFERENCES=31, KEYWORDS="desktop video conferencing; packet video; packet audio; conference control; shared X", ABSTRACT="The goal of the Argo system is to allow medium-sized groups of users to collaborate remotely from their desktops in a way that approaches as closely as possible the effectiveness of face-to-facemeetings In support of this goal, Argo combines high quality multi-party digital video and full-duplex audio with telepointers, shared applications, and whiteboards in a uniform and familiar environment. The shared applications can be unmodified X programs shared via a proxy server, unmodified groupware applications, and applications written using our toolkit. Workers can contact each other as easily as making a phone call, and can easily bring into a conference any material they are working on. They do so by interacting with an object-oriented, client/server conference control system. The same conference control system is used to support teleporting, i.e. moving the desktop environment from one workstation's display to another (for example, from office to home). This paper describes the system we have built to test the hypothesis that the effectiveness of remote collaboration can be substantially impacted by the responsiveness of the interaction media.", URL="http://www.research.digital.com/SRC/argo/argopapermm94.html", } @BOOK{Gala94:Applied, AUTHOR="J. Galambos and J. Gani", TITLE="Studies in Applied Probability: Papers in honour of Lajos Takács", PUBLISHER="Journal of Applied Probability", VOLUME="31a", YEAR=1994, KEYWORDS="probability theory; queueing theory; random walk; statistics; stochastic process; stochastic theory", ABSTRACT="This volume celebrates the 70th birthday of Lajos Takács. It records his academic achievements, and outlines his many contributions to the development of the theory of Stochastic Processes. Thirty-nine authors from Australia, Europe and the USA aggreed tocontribute 26 papersi in honour of Lajos. ...", } @ARTICLE{Gall9402:Omissions, AUTHOR="Jose R. Gallardo and Jaime Sanchez", TITLE="Omissions and Ambiguities in {CCITT} Recommendation {Q.921}", JOURNAL=ieeecm, VOLUME=32, NUMBER=2, PAGES="88-95", MONTH="Feb", YEAR=1994, KEYWORDS="CCITT; recommendation q.921; data link layer", ABSTRACT="Some of the recommendations for ISDN user/network-interface data link layer procedures are more likely to confuse than to enlighten.", } @ARTICLE{Gamm94:Interaction, AUTHOR="A. Gammelgaard and J. E. Kristensen", TITLE="Interaction detection, a logical approach", JOURNAL="Feature Interactions in Telecommunications Systems, IOS Press", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="178-196", YEAR=1994, REFERENCES=13, KEYWORDS="IN; intelligent network", ABSTRACT="We propose to let feature specifications be restrictions to the class of deterministic labelled transition systems. This allows a formal definition of interaction: Two feature specifications interact if each specification has a realization by such a transition system whereas the joint specification has not. A feature specification consists of two parts: network properties and declarative transition rules. A network property is a condition that", } @INPROCEEDINGS{Gang94:Metadata, AUTHOR="Gregory R. Ganger and Yale Patt", TITLE="Metadata Update Performance in File Systems", BOOKTITLE=osdi, PAGES="49-60", YEAR=1994, ABSTRACT="Structural changes, such as file creation and block allocation, have consistently been identified as file system performance problems in many user environments. We compare several implementations that maintain metadata integrity in the event of a system failure but do not require changes to the on-disk structures. In one set of schemes, the file system uses asynchronous writes and passes ordering requirements to the disk scheduler. These scheduler-enforced ordering schemes outperform the conventional approach (synchronous writes) by more than 30 percent for metadata update intensive benchmarks, but are suboptimal mainly due to their inability to safely use delayed writes when ordering is required. We therefore introduce soft updates, an implementation that asymptotically approaches memory-based file system performance (within 5 percent) while providing stronger integrity and security guarantees than most UNIX file systems. For metadata update intensive benchmarks, this improves performance by more than a factor of two when compared to the conventional approach.", } @ARTICLE{Ganz9402:Study, AUTHOR="A. Ganz and Yi Gong and B. Li", TITLE="Performance Study of Low Earth-Orbit Satellite Systems", JOURNAL=ieeecom, ISBN="0090-6778", VOLUME="COM-42", NUMBER=2, PAGES="1866-1871", YEAR=1994, REFERENCES=9, KEYWORDS="performance evaluation; system evaluation", ABSTRACT="This paper investigates the performance of low earth orbit-systems in terms of the system capacity, the average number of beam-to-beam handoffs and satellite-to-satellite handoffs, the channeloccupancy distribution and the average call drops probability.", } @ARTICLE{Garc9401:Discrete, AUTHOR="J. L. Garcia and O. Casals", TITLE="A discrete time queueing model to study the cell delay variation in an {ATM} queueing network", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=21, NUMBER="1-2", PAGES="3-22", YEAR=1994, REFERENCES=21, KEYWORDS="ATM; queueing system; delay time; DBMAP", ABSTRACT="This paper studies .. (i) the cell delay variations a CBR traffic is subject to when mixed with VBR traffic, (ii) the cell loss rate when a worst case traffic is multiplexed with VBR sources. The model we use is a queueing system in which the arrival process is a special class of discrete time batch Markovian arrival process (D-BMAP): the superposition of periodic and VBR traffic.", } @ARTICLE{Gati9411:Liberalization, AUTHOR="Leonardo Gatica", TITLE="Liberalization and Tariff Legislation in Chile", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="34-35", MONTH="Nov", YEAR=1994, KEYWORDS="liberalization; tariff legislation; chile", ABSTRACT="Chile has experienced successes and several mistakes, as the country struggles with the telecommunications revolution.", } @ARTICLE{Gavi94:Restricted, AUTHOR="Arieh Gavious and Zvi Rosberg", TITLE="A Restricted Complete Sharing Policy for a Stochastic Knapsack Problem in {BISDN}", JOURNAL=ieeecom, YEAR=1994, ABSTRACT="Consider a circuit switched broadband ISDN network that support a variety of traffic classes (e.g., data, voice, video, facsimile), each of which has its own traffic requirement and reward function. We address the problem of dynamically allocating the capacity of each circuit among the traffic classes. As an optimal allocation policy is extremely hard to find, we apply a different methodology by which we bound from above the optimal expected reward, and propose a specific threshold policy-the restricted complete sharing (RCS)-that yields a reward sufficiently close to this bound. The initial parameters of the threshold policy are found with the aid of our bounding technique, and are improved by two iterative procedures. The quality of our policy is demonstrated by several numerical examples.", } @ARTICLE{Geha94:Capsules, AUTHOR="N. Gehani", TITLE="Capsules: A Shared Memory Access Mechanism for Concurrent {C/C++}", JOURNAL=ieeepds, YEAR=1994, ABSTRACT="Concurrent C/C++ is a superset of C and C++ that provides parallel programming facilities based on message passing. Upon porting Concurrent C/C++ to a shared memory multiprocessor, we felt it would be appropriate to supplement Concurrent C/C++ with explicit facilities for synchronizing accesses to shared data structures. The capsule is a shared memory access mechanism designed especially for Concurrent C/C++ to match the C++ data abstraction facility called the class. Capsules are like monitors but they have significant advantages. Capsules satisfy Bloom's criteria for expressiveness of synchronization conditions, support inheritance, allow operations to execute in parallel, and permit them to time out. Although many concepts used in capsules have been suggested elsewhere, they are synthesized in a way which offers many advantages over classical shared memory mechanisms. In this paper, I will motivate the design of capsules, briefly review and evaluate existing shared memory mechanisms, describe capsules, give examples of capsules, compare capsules with monitors, and discuss how capsules are implemented by the Concurrent C compiler.", } @INPROCEEDINGS{Geor94:UMTS, AUTHOR="K. Georgokitsos and J. Apfelbeck", TITLE="{UMTS} performance evaluation with and without {MMP} and {TM}", BOOKTITLE="RACE Mobile Telecommunications Workshop", ADDRESS="Amsterdam, Netherlands", PAGES="441-445", YEAR=1994, REFERENCES=3, KEYWORDS="algorithm; evaluation; load balancing; load sharing; network; network stability; overload control; performance evaluation; simulation; traffic model", ABSTRACT="The mobility management platform (MMP) and the transaction management (TM) provide uniform access to network functions and load sharing facilities for UMTS. They have influence on network performance in terms of balanced load, increased network stability and more reliable and faster execution of network functions at high load. The idea of load sharing is to distribute the computational overload in an localised area around the source of the load", } @ARTICLE{Gera94:Probability, AUTHOR="E. Geraniotis and Jean-Lien C. Wu", TITLE="The Probability of Multiple Correct Packet Receptions in Direct-Sequence Spread-Spectrum Networks", JOURNAL=ieeejsac, YEAR=1994, ABSTRACT="In this paper, we provide methods to evaluate the probabilities $P(l,m-l|K),l=0,1,\ldots,m$ and $m<=K$ of exactly $l$ correct packet receptions in a group of $m$ receivers, given that $K$ packets are transmitted simultaneously from users employing direct-sequence spread spectrum (DS/SS) signaling schemes. This quantity is useful for the design and performance evaluation of protocols for admission control and dynamic code allocation in multiple-access spread spectrum packet radio networks intended for terrestrial or satellite applications. The evaluations are carried out for DS/SS networks employing BPSK modulation with coherent demodulation and convolutional codes with Viterbi decoding. Systems with geographically dispersed receivers and systems with colocated receivers are considered. Approximations based on the Independent Receiver Operation Assumption (IROA) and the Gaussian multivariate distribution are developed, and their accuracy is checked against the exact expressions derived for synchronous systems. The Joint First Error Event Approximation (JFEEA) is also developed for coded systems and compared to the IROA.", } @ARTICLE{Gerg94:Efficient, AUTHOR="Jordan Gergov and Christoph Meinel", TITLE="Efficient Boolean Manipulation With {OBDD's} Can be Extended to {FBDD's}", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="OBDD's are the state-of-the-art data structure for Boolean function manipulation. Basic tasks of Boolean manipulation such as equivalence test, satisfiability test, tautology test and single Boolean synthesis steps can be performed efficiently in terms of fixed ordered OBDD's. The bottleneck of most OBDD-applications is the size of the represented Boolean functions since the total computation merely remains tractable as long as the OBDD-representations remain of reasonable size. Since it is well known that OBDD's are restricted FBDD's (free BDD's, i.e. BDD's that test, on each path, each input variable at most once), and that FBDD-representations are often much more (sometimes even exponentially more) concise than OBDD-representations, in the following we propose to work with a more general FBDD-based data structure. We show that FBDD's of a fixed type provide, similar as OBDD's of a fixed variable ordering, canonical representations of Boolean functions, and that basic tasks of Boolean manipulation can be performed in terms of fixed typed FBDD's similarly efficient as in terms of fixed ordered OBDD's. In order to demonstrate the power of the FBDD-concept we show that the verification of the circuit design for the hidden weighted bit function proposed in 1991 can be carried out efficiently in terms of FBDD's while this is, for principal reasons, impossible in terms of OBDD's.", } @ARTICLE{Gero94:Load, AUTHOR="Dimitris Gerogiannis and Stelios Orphanoudakis", TITLE="Load Balancing Requirements in Parallel Implementations of Image Feature Extraction Tasks", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="Load balancing requirements in parallel image analysis are considered and results on the performance of parallel implementations of two image feature extraction tasks on the Connection Machine and the iPSC/2 hypercube are reported and discussed. A load redistribution algorithm, which makes use of parallel prefix operations and one-to-one permutations among the processors, is described and has been used in this work. The expected improvement in performance resulting from load balancing has been determined analytically and is compared to actual performance results obtained from the above implementations. The analytical results demonstrate the specific dependence of the expected improvement in performance on the computational and communication requirements of each task, characteristic machine parameters, a characterization of prior load distribution in terms of parameters which can be computed dynamically at the start of task execution, and the overhead incurred by load redistribution. Based on these results one may also define a set of rules for determining in advance the potential gains in performance to be obtained from application of this particular load balancing algorithm.", } @ARTICLE{Ghos94:Concurrent, AUTHOR="J. Ghosh", TITLE="Concurrent Processing of Linearly Ordered Data Structures on Hypercube Multicomputers", JOURNAL=ieeepds, YEAR=1994, ABSTRACT="This paper presents a simple and effective method for the concurrent manipulation of linearly ordered data structures on hypercube systems. The method is based on the existence of an augmented binomial search tree, called the pruned binomial tree, rooted at any arbitrary processor-node of the hypercube such that (i) every edge of the tree corresponds to a direct link between a pair of hypercube nodes, and (ii) the tree spans any arbitrary sequence of $n$ consecutive nodes containing the root, using a fan-out of at most $\lceil\log\_2n\rceil$ and a depth of at most $\lceil\log\_2n\rceil+1$. Search trees spanning non-overlapping processor lists are formed using only local information, and can be used concurrently without contention problems. Thus, they can be used for performing operations such as broadcast and merge simultaneously on sets with non-uniform sizes. Extensions of the tree to $k$-ary $n$-cubes and faulty hypercubes are presented. Applications of this concurrent data structure to low and intermediate-level image processing algorithms, and for dictionary operations involving multiple keys are also outlined.", } @ARTICLE{Gigl94:Architectural, AUTHOR="J. Giglmayr", TITLE="Architectural Framework for Optical Frequency Divison Multiplexing Systems Based on Regular Space-Frequency Interconnections", JOURNAL=ieeejlt, VOLUME=12, NUMBER=7, PAGES="1291-1306", YEAR=1994, REFERENCES=26, KEYWORDS="cross connect; optical switching; switching system; technology; transmission; WDM", ABSTRACT="The paper describes a multistage interconnection network (MIN) with regular interconnections in three dimensions (two space and one frequency dimension) and dimension-dependent switches....", } @INPROCEEDINGS{Gips94:MATRIX, AUTHOR="T. Gipser and M.-S. Kao", TITLE="{MATRIX:} a new network for multiwavelength all-optical transparent information exchange", BOOKTITLE=efoc, ISBN="3-905084-27-9", ADDRESS="Switzerland", PAGES="146-150", YEAR=1994, REFERENCES=7, KEYWORDS="multihop; network architecture; WDM", ABSTRACT="A novel all-optical mesh network calles MATRIX is presented. During the transmission in the multihop network the packets experience less than two hops on the average and no wavelength conversion takes place. Merely N wavelengths are required for the interconnection of N*N nodes. The underlying grid topology enables the use of a simple routing mechanism.", } @INPROCEEDINGS{Glas94:Caching, AUTHOR="Steven Glassman", TITLE="A Caching Relay for the World Wide Web", BOOKTITLE="First International Conference on the WWW", YEAR=1994, URL="http://www.research.digital.com/SRC/personal/Steve\_Glassman/CachingTheWeb/CachingTheWeb.html", } @ARTICLE{Gn9401:Approximation, AUTHOR="L. G n", TITLE="An approximation method for capturing complex traffic behavior in high speed networks", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=19, NUMBER=1, PAGES="5-23", YEAR=1994, REFERENCES=15, KEYWORDS="traffic model; fluid flow model; bandwidth allocation; ATM; bursty traffic; leaky bucket", ABSTRACT="This paper provides a technique to approximately map complex traffic behavior to a simple traffic model which can be fully characterized by three parameters. This approximate characterization relies on measurements taken at the access point to tthe network and enables various bandwidth mamagement procedures being implemented for high speed networks to be applicable for general classes of user traffic.", } @ARTICLE{Godf9410:Evolution, AUTHOR="A. Blanton Godfrey and Al C. Endres", TITLE="The Evolution of Quality Management Within Telecommunications", JOURNAL=ieeecm, VOLUME=32, NUMBER=10, PAGES="26-35", MONTH="Oct", YEAR=1994, KEYWORDS="quality management; telecommunications", ABSTRACT="A look back over more than 100 years in managing quality in telecommunications reveals several phases of focus.", } @INPROCEEDINGS{Gold94:Network, AUTHOR="R. P. Goldberg and J. F. Rizzo", TITLE="A network infrastructure to support {PCS}", BOOKTITLE=pmrc, PAGES="1138-1142 WA1.1", YEAR=1994, KEYWORDS="IN; intelligent network; ISDN; mobile radio; network architecture; switching", ABSTRACT="This paper describes an AIN/ISDN-based network architecture forLocal Echange Carrier (LEC) that can support flexible and feature-rich PCS offerings, and discusses the C interface to an ISDN wwitch which allows radio systems to access network switching and service control functions. ...", } @INPROCEEDINGS{Grab94:SAMSTAG, AUTHOR="J. Grabowski and others", TITLE={Die {SAMSTAG} Methode und ihre Rolle im Konformit\"atstesten}, BOOKTITLE="PIK 17", VOLUME=4, PAGES="214-224", YEAR=1994, } @INPROCEEDINGS{Graf94:Internetworking, AUTHOR="Michael L. Graf and H. J. Stuttgen", TITLE="An Internetworking Architecture for Multimedia Communication over Heterogeneous Networks", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="161-178", YEAR=1994, } @BOOK{Grah94:Concrete, AUTHOR="R. L. Graham and D. E. Knuth and O. Patashnik", TITLE="Concrete Mathematics", PUBLISHER="Addison-Wesley", YEAR=1994, KEYWORDS="algorithm; asymptotic analysis; binomial coefficient; continuous time process; discrete random variable; discrete time; generating function; mathematics; overview", } @INPROCEEDINGS{Gran94:Two, AUTHOR="S. W. Granlund", TITLE="Two examples on how to analyse signalling load of {UMTS} network by using real measurements", BOOKTITLE="RACE Mobile Telecommunications Workshop", ADDRESS="Amsterdam, Netherlands", PAGES="425-429", YEAR=1994, REFERENCES=3, KEYWORDS="measurement; mobile radio; signalling", ABSTRACT="In this paper the work load case study of GA2 for the Central London area is described by provideing examples on how to estimate location update and handover rates by using measured mobility data as input.", } @TECHREPORT{Grea94:Protocol, AUTHOR="David Greaves and D. R. McAuley and Leslie French and Eoin Hyden", TITLE="Protocol and Interface for {ATM} {LANs}", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 94-10", YEAR=1994, ABSTRACT="This paper advocates local area networks using the Asynchronous Transfer Mode where data is carried in the payloads of fixed size cells. We describe the design and performance of a simple ATM host interface for inexpensive computers together with the MSNA protocol architecture. A feature of the MSNA architecture is that it can provide ATM virtual circuits directly to applications by demultiplexing to a degree normally associated with the transport layer of a protocol stack. This leads to further simplification and efficiency in end-stream implementation. We discuss implementations of the ATM adaption leyr of varying complexity, suitable for end-systems ranging from imbedded micro-controllers to Unix file servers, and discuss the appropriate place for the adaptation layer to be terminated in a multi-media workstation.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.94.10.ps.Z", } @ARTICLE{Grif94:Negotiating, AUTHOR="N. Griffeth and Hugo Velthuijsen", TITLE="The Negotiating Agents Approach to Runtime Feature Interaction Resolution", JOURNAL="Feature Interactions in Telecommunications Systems, IOS Press", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="217-235", YEAR=1994, REFERENCES=6, KEYWORDS="IN; intelligent network", ABSTRACT="This article describes how to use the Negotiating Agents approach on a telecommunications platform. Negotiation is used in this approach to resolve conflicts between features of different users and between different features of one user. The theory behind the approach is discussed briefly. Methods for implementing the approach are given along with the methods for defining IN features that allow negotiation to resolve conflicts between them.", } @ARTICLE{Grok94:Strategische, AUTHOR="B. Groákopf and others", TITLE="Strategische Ans„tze fr ein umfassendes Telekommunikationsnetz", JOURNAL="Der Fernmelde-Ingenieur", ADDRESS="Germany", VOLUME=48, NUMBER=11, PAGES="1-53", YEAR=1994, LANGUAGE="German", REFERENCES=8, KEYWORDS="ISDN; ATM; B-ISDN; SDH; network", ABSTRACT="Ausgehend von einer Beschreibung der gegenw„rtigen Telekommunikationsnetze mit dem Schwerpunkt Telefonnetz/ISDN werden im vorliegenden Beitrag einige Ans„tze zur zuknftigen Gestaltung eines universellen Telekommunikationsnetzes vorgestellt. Dabei wird dieMeinung vertreten, daá ein universelles Netz eine sinnvollere Basis fr die Befriedigung gegenw„rtiger als auch zuknftiger Kunden- und Betreiberanforderungen bietet als verschiedene getrennt", } @ARTICLE{Grot94:VISYON, AUTHOR="P. Grotemeyer and J. Trömel", TITLE="{VISYON} (Variables Intelligentes Synchrones Optisches Netz) - ein Projekt für Synchrone Übertragungstechnik im Ortsnetz", JOURNAL=ptr, ADDRESS="Netherlands", VOLUME=52, NUMBER=2, PAGES="63-70", YEAR=1994, REFERENCES=3, KEYWORDS="field trial; network evolution; access network", ABSTRACT="Das Projekt VISYON(Variables Intelligentes Synchrones Optisches Netz) wird seit Anfang 1992 als Feldversuch im Netz der DBP Telekom erprobt. Anfang 1994 wurden die SDH Multiplex- und Leitungssysteme sowie die entsprechenden Netzmanagement Systeme installiert und in Betrieb genommen.", } @INPROCEEDINGS{Grus94:Einfluß, AUTHOR="R. Gruschwitz", TITLE="Einfluß der Kommunikationszeit auf den Speedup der parallelen Logiksimulation für Transputernetze und Workstation-Cluster", BOOKTITLE="Workshop über parallele und verteile Simulation - Bericht Nr. AIS 21", ADDRESS="Oldenburg, Germany", PAGES="14-19", YEAR=1994, LANGUAGE="German", REFERENCES=4, KEYWORDS="distributed processing; distributed simulation; distributed system", } @ARTICLE{Gtts94:Verkehrsmessungen, AUTHOR="D. Göttsche and P. Bitzl", TITLE="Verkehrsmessungen im Zeichengabesystem Nr. 7", JOURNAL="Telekom Unterrichtsblätter", ADDRESS="Germany", VOLUME=47, NUMBER=11, PAGES="506-517", YEAR=1994, LANGUAGE="German", REFERENCES=20, KEYWORDS="traffic measurement; signalling protocol", ABSTRACT="Zeitgleich mit der Umstellung des Netzes vom analogen Signalisierungsverfahren Impulskennzeichen 50 auf das digitale Zeichengabesystem (ZGS) Nr.7 wurde begleitend damit begonnen, ähnlich den Verkehrsmessungen im Nutzkanalnetz, Verkehrsuntersuchungen im ZGSNr.7 durchzuf hren. Knoten im ZGS-Nr.7-Netz sind Vermittlungsei nheiten unterschiedlicher Funktion. Kanten werden durch Knoten verbindende Zeichengabeübertragungsstrecken und Zeichengabe bertr", } @ARTICLE{Gu94:Construction, AUTHOR="Dechang Gu and Daniel J. Rosenkrantz and S. S. Ravi", TITLE="Construction of Check Sets for Algorithm-Based Fault Tolerance", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="Algorithm-Based Fault Tolerance (ABFT) is a popular approach to achieve fault and error detection in multiprocessor systems. The design problem for ABFT is concerned with the construction of a check set of minimum cardinality that detects a specified number of errors or faults. Previous work on this problem has assumed an a priori bound on the size of a check. We motivate and carry out an investigation of the problem without the bounded check size assumption. We establish upper and lower bounds on the number of checks needed to detect a given number of errors. The upper bounds are obtained through new schemes which are easy to implement, and the lower bounds are established using new types of arguments. These bounds are sharply different from those previously established under the bounded check size model. We also show that unlike error detection, the design problem for fault detection is NP-hard even for detecting only one fault.", } @ARTICLE{Gupt9403:Solution, AUTHOR="S. C. Gupta and F. Karaesmen", TITLE="Solution to complex queueing systems: a spreadsheet approach", JOURNAL=pe, VOLUME=21, NUMBER="3-4", PAGES="33-46", YEAR=1994, REFERENCES=6, KEYWORDS="queueing system; algorithm", ABSTRACT="The paper presents ideas to facilitate solving complex problems in Queueing Theory. It is demonstrated how a speadsheet can be used to solve problems. An algorithm is presented which is particularly designed for easy implementation in a spreadsheet. A template is provided illustrating the implementation of the algorithm.", } @ARTICLE{Gupt94:Error, AUTHOR="S. C. Gupta and Magda El Zarki", TITLE="Design of Error Control Schemes for Wireless Data Networks", JOURNAL="Personal, Indoor and Mobile Radio Communications (PMRC)", ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", PAGES="771-775", YEAR=1994, REFERENCES=11, KEYWORDS="error control; packet radio", ABSTRACT={The paper addresses the problem of designing a "virtual error free channel" for communication over unreliable wireless packet channels using hybrid error control schemes. For hybrid error control to be effective it is essential that an appropiate amount of forward error correction and automatic repeat requests be used. Optimal design methodologies for performance metrics of interest are developed. We also investigate the trade-offs involved whe}, } @INCOLLECTION{Gute94:Distributed, AUTHOR="Thomas Gutekunst and Thomas Schmidt and G. Schulze and J. Schweitzer and Michael Weber", TITLE="A Distributed Multimedia Joint Viewing and Tele-Operation Service for Heterogeneous Workstation Environments", BOOKTITLE="Verteilte Multimedia Systeme", EDITOR="Wolfgang Effelsberg and Kurt Rothermel", PUBLISHER="K. G. Saur, München", PAGES="145-159", YEAR=1994, KEYWORDS="JVTOS; computer-supported cooperative work; distributed architecture; multimedia", ABSTRACT="Computers are ever more thought of to support cooperative work over distances. Thus tele-cooperation tools and environments are needed which bring the meeting and joint-working onto everyone's desktop. The following paper introduces such a joint viewing and tele-operation service allowing to bridge even heterogeneous workstation environments. The required cooperation-awareness is achieved by a conference model around which the building blocks of the entire service are configured. The core services and their functionality is depicted upon which the implementation structure is developed.", URL="ftp://komsys.ethz.ch/pub/papers/Gutekunst93a.ps", } @TECHREPORT{Gwer94:Case, AUTHOR="James Gwertzman and Margo Seltzer", TITLE="The Case for Geographical Push-Caching", INSTITUTION="Harvard University, DAS", ADDRESS="Cambridge, MA 02138", NUMBER="HU TR-34-94 (excerpt", YEAR=1994, } @ARTICLE{Haba9401:Cooperation, AUTHOR="K. Habara", TITLE="Cooperation in Standardization", JOURNAL=ieeecm, VOLUME=32, NUMBER=1, PAGES="78-84", MONTH="Jan", YEAR=1994, KEYWORDS="cooperation in standardization", ABSTRACT="Global collaboration on standards has become essential with the accelerating deregulation of telecommunications", } @ARTICLE{Habe9402:Simulation, AUTHOR="R. Habermann", TITLE="Simulation Analysis of Loss Characteristics in {ATM} Switching Systems by {R1022}", JOURNAL=ett, ADDRESS="Italy", VOLUME=5, NUMBER=2, PAGES="49-56", YEAR=1994, KEYWORDS="simulation; analysis; ATM; switching system", ABSTRACT="In this paper teh results of a simulation analysis concerning the loss characteristics in ATM-switching systems are presented.", } @ARTICLE{Hais9406:Einführungsstrategie, AUTHOR="W. Haist and W. Fritsch and W. Kliemsch and H. Schneider", TITLE="Einführungsstrategie Glasfaser-Overlaynetz für Geschäftskunden", JOURNAL="Telekom Praxis", ADDRESS="Germany", NUMBER=6, PAGES="21-30", YEAR=1994, LANGUAGE="German", KEYWORDS="access network; broadband; network evolution; network planning", ABSTRACT="Die Einführung der Glasfaser bis zum Teilnehmer setzt ein wohldurchdachtes Vorgehen besonders im kostenintensiven Anschluánetz voraus. Es wird eine Doppelstrategie aus den Komponenten Ersatz- und Erweiterungsinvestitionen sowie einem gezielten systematischen Netzausbau empfohlen. Den Hauptkostenfaktor stellen die Tiefbauarbeiten dar, wogegen die Faserkosten nur einen Anteil von 4.2\% ausmachen.", } @PROCEEDINGS{Harj94:Proceedings, TITLE="{IFIP} workshop on intelligent networks", EDITOR="J. Harju and O. Martikainen and T. Karttunen", ISBN="0-412-71730-1", PUBLISHER="Chapmann \& Hall", ADDRESS="London, Great Britain", YEAR=1994, KEYWORDS="broadband; intelligent network; network management; performance evaluation; specification", } @ARTICLE{Harr9402:Approximate, AUTHOR="P. G. Harrison and A. C. Pinto", TITLE="An approximate analysis of asynchronous, packet-switched banyan networks with blocking", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=19, NUMBER="2-3", PAGES="223-258", YEAR=1994, REFERENCES=27, KEYWORDS="banyan network; algorithm; approximation; packet switching; queue length", ABSTRACT="An approximate algorithm is developed for the performance analysis of buffered, packet-switched, asynchronous networks with no feedback. The article focuses on banyan networks and the algorithm is tailored to this problem. The considered networks are organised in a finite number of stages through each of which a task passes successively in its transmission. Queue length probability distributions of each switch is derived.", } @ARTICLE{Hart9401:Distributed, AUTHOR="Andy Harter and Andrew Hopper", TITLE="A distributed location system for the active office", JOURNAL=ieeenet, VOLUME=8, NUMBER=1, PAGES="62-70", MONTH="January/February", YEAR=1994, REFERENCES=10, KEYWORDS="active badge; ANSA; location; office automation; WWW; internet; directory services", ABSTRACT="Distributed systems for locating people and equipment will be at the heart of tomorrow's active offices.", } @ARTICLE{Harv94:Wireless, AUTHOR="D. A. Harvey and R. Santalesa", TITLE="Wireless Gets Real", JOURNAL=byte, PAGES="90-96", YEAR=1994, KEYWORDS="mobile radio; packet radio", ABSTRACT="Wide-area wired communications and network-access services are rapidly being augmented by more flexible wireless solutions.", } @ARTICLE{Hasa94:Phase, AUTHOR="Pavel Hasan", TITLE="On the Phase Error Variance of a First-Order Phase-Locked Loop in the Presence of Cochannel {CW} Interference and Additive Noise", JOURNAL=ieeecom, YEAR=1994, ABSTRACT="The qualitatively different behavior of the PLL phase error variance reported in [1] and [2] under the same assumptions is examined. An error appeared in [1] is identified and corrected.", } @PROCEEDINGS{Hase94:Proceedings, TITLE="Proceedings International Conference on Local and Metropolitan Communication Systems 1994", EDITOR="T. Hasegawa and and H. Takagi", PUBLISHER="Kyoto University", ADDRESS="Kyoto, Japan", YEAR=1994, KEYWORDS="LAN; MAN", } @ARTICLE{Have9407:Numbering, AUTHOR="Ron Havens and Mark Sievers", TITLE="Numbering in a Competitive Environment", JOURNAL=ieeecm, VOLUME=32, NUMBER=7, PAGES="68-71", MONTH="Jul", YEAR=1994, KEYWORDS="numbering; competitive environment; telecommunications; NANP", ABSTRACT="In an increasingly competitive industry like telecommunications, there are other, more fundamental issues than Who should administer the NANP?", } @ARTICLE{Haye94:Calculation, AUTHOR="J. F. Hayes and F. Ayadi", TITLE="Performance calculation for an optical {MAN}", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", VOLUME=17, NUMBER=1, PAGES="17-24", YEAR=1994, REFERENCES=13, KEYWORDS="HSLAN; MAN; optical lan; performance evaluation; shufflenet", ABSTRACT="A Metropolitan Area Network employing optical fibre in a uniquefashion is described and analysed with respect to performance. There are two possible physical configurations: a basic topologysuch as the star and the tree, and the compound configuration such as the tree-star-tree. As a logical overlay which serves to route information packets between stations, a form of perfect shuffle is used.", } @ARTICLE{Hbne9401:Discrete, AUTHOR="F. H bner", TITLE="Discrete-time analysis of the busy and idle period distributions of a finite-capacity {ATM} multiplexer with periodic input", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=21, NUMBER="1-2", PAGES="23-36", YEAR=1994, REFERENCES=15, KEYWORDS="ATM; multiplexer; discrete time analysis; busy period", ABSTRACT="We present an exact solution for the distribution of the busy and idle periods of a finite-capacity ATM multiplexer.", } @INPROCEEDINGS{Hbne94:Dimensioning, AUTHOR="F. H bner", TITLE="Dimensioning of a Peak Cell Rate Monitor Algorithm Using Discrete-Time Analysis", BOOKTITLE=itc14, ADDRESS="Juan-les-Pins, France", PAGES="1415-1424", YEAR=1994, REFERENCES=10, KEYWORDS="access control; performance evaluation; ATM; discrete time analysis; traffic control; monitoring; CPN", ABSTRACT="This study deals with the monitoring of ATM cells from CBR sources which are subject to cell delay variation introduced by cellsfrom other sources. We present an analytical solution which for ms a basis for the dimensioning of the so-called peak cell rate monitor algorithm defined by the CCITT draft recommandation I.371. The solution algorithm consists of a discrete-time iteration and allows for the exact determination of the probability that t", } @ARTICLE{Heap94:Least, AUTHOR="Mark A. Heap and M. R. Mercer", TITLE="Least Upper Bounds on {OBDD} Sizes", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="This correspondence derives exact equations for the maximum number of nonterminal vertexes in reduced and quasi-reduced ordered binary decision diagrams (OBDD's). A reduced OBDD is reduced by both merging and deleting vertices, and a quasi-reduced OBDD is reduced only by merging. These formulas are used to tighten Lee's original bounds [1], and to correct the bounds recently reported in [2].", } @TECHREPORT{Hedd94:Parallelism, AUTHOR={M. Heddes and E R"utsche}, TITLE="A Survey of Parallelism in Communication Subsystems", TYPE="Research Report", INSTITUTION="IBM Zurich", NUMBER="RZ 2570", YEAR=1994, } @ARTICLE{Heid94:OEIC, AUTHOR="H. Heidrich", TITLE="{OEIC} auf Indiumphosphid: Schlüsselbauelemente für zukünftige photonische Netze", JOURNAL=ntz, ISBN="0948-728X", ADDRESS="Germany", VOLUME=47, NUMBER=11, PAGES="792-798", YEAR=1994, LANGUAGE="German", REFERENCES=4, KEYWORDS="technology", ABSTRACT="Stand der Technologie für OEIC 1994 (am HHI) Realisierung eines Überlagerungsempfängers mittels InP-Integration", } @ARTICLE{Heij9401:Communication, AUTHOR="Geert J. Heijenk and Xinli Hou and I. G. Niemegeers", TITLE="Communication Systems Supporting Multimedia Multi-user Applications", JOURNAL=ieeenet, VOLUME=8, NUMBER=1, PAGES="34-44", MONTH="January/February", YEAR=1994, REFERENCES=15, KEYWORDS="multimedia; session control; call model; call setup; signalling", ABSTRACT="The development of a service description ensures that protocol designs actually produce the desired functional behavior.", } @INPROCEEDINGS{Hein94:AMTP, AUTHOR="Bernd Heinrichs", TITLE="{AMTP:} Towards a High Performance and Configurable Multipeer Transfer Service", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="141-160", YEAR=1994, } @ARTICLE{Helm94:Determining, AUTHOR="D. P. Helmbold and C. E. McDowell and Jin-Tuu Wang", TITLE="Determining Possible Event Orders by Analyzing Sequential Traces", JOURNAL=ieeepds, YEAR=1994, ABSTRACT={One of the fundamental problems encountered when debugging a parallel program is determining the possible orders in which events could have occurred. Various problems, such as data races and intermittent deadlock, arise when there is insufficient synchronization between the tasks in a parallel program. A sequential trace of an execution can be misleading, as it implies additional event orderings, distorting the concurrent nature of the computation. This paper describes algorithms to generate, from the trace of an execution, those event orderings that can be relied on by the programmer. By its very nature, the information in an execution trace pertains only to that execution of the program, and may not generalize to other executions. We mitigate this difficulty by defining an "inferred program" based on the trace and original program, analyzing this inferred program, and showing how the inferred program relates to the original. The results of our algorithms can be used by other automated tools such as a data race detector or constraint checker. [One application discussed is the automatic location of unordered but sequential sections of code (regions which can be executed in either order, but not concurrently).] The basic algorithms described here have been implemented in a working trace analyzer for IBM Parallel Fortran. The trace analyzer graphically presents the discovered event orderings and reports various potential data races in the subject program.}, } @ARTICLE{Herb9401:ANSA, AUTHOR="A. J. Herbert", TITLE="An {ANSA} overview", JOURNAL=ieeenet, VOLUME=8, NUMBER=1, PAGES="18-23", MONTH="January/February", YEAR=1994, REFERENCES=7, KEYWORDS="ANSA; distributed systems", ABSTRACT="With the appropriate architecture, telecommunications services can work with computer applications components to support networked information services.", } @BOOK{Hert94:Optische, AUTHOR="E. Herter and Michael L. Graf", TITLE="Optische Nachrichtentechnik", ISBN="3-446-15977-0", PUBLISHER="Reihe Informationstechnik, Nachrichtentechnik, Hanser", ADDRESS="M nchen, Germany", YEAR=1994, LANGUAGE="German", KEYWORDS="fiber optics; multiplexing; optical lan; optical switching", ABSTRACT={In der Forschung untersucht man seit Jahren Methoden, um die Verstärkung, Modulation, Vermittlung (usw.) des optischen Signals als solches zu bewirken. Diese Verfahren-also eine tatsächlich "optische" Nachrichtentechnik- stehen heute an der Schwelle zur praktischen Anwendung. Nach einer knappen Darstellung der Grundlagen und der "klassischen" Glasfaserübertragung hat das vorliegende Buch zwei Schwerpunkte: Netze mit Lichtwellenleitersystemen u}, } @TECHREPORT{Hirs94:Polynomial, AUTHOR="Yoram Hirschfeld and M. Jerrum and Faron Moller", TITLE="A polynomial algorithm for deciding bisimilarity of normed context-free processes", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-08", YEAR=1994, ABSTRACT="The previous best upper bound on the complexity of deciding bisimilarity between normed context-free processes, due to Huynh and Tian, is that the problem lies in the second level of the polynomial hierarchy: their algorithm guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in NP. In this paper we improve on this result by presenting a polynomial-time algorithm which solves this problem. As a corollary, we have a polynomial algorithm for the equivalence problem for simple context-free grammars.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-08--SE.ps.Z", } @TECHREPORT{Hirs94:Polynomial2, AUTHOR="Yoram Hirschfeld and M. Jerrum and Faron Moller", TITLE="A polynomial-time algorithm for deciding bisimilation equivalence of normed Basic Parallel Processes", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-09", YEAR=1994, ABSTRACT="A polynomial-time algorithm is presented for deciding bisimulation equivalence of so-called Basic Parallel Processes: multisets of elementary processes combined by a commitative parallel-composition operator.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-09--SE.ps.Z", } @ARTICLE{Hoel94:Genus, AUTHOR="David A. Hoelzeman and Said Bettayeb", TITLE="On the Genus of Star Graphs", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="The star graph has recently been suggested as an alternative to the hypercube. The star graph has rich structure and symmetry properties as well as desirable fault-tolerant characteristics. The star graph's maximum vertex degree and diameter, viewed as functions of network size, grow less rapidly than the corresponding measures in a hypercube. We investigate the genus of the star graph and compare it with the genus of the hypercube.", } @PROCEEDINGS{Hogr94:Proceedings, TITLE="7th {IFIP} {WG} 6.1 international conference on formal description technique", EDITOR="D. Hogrefe and S. Leue", ISBN="0-412-64450-9", PUBLISHER="Chapman and Hall", ADDRESS="London, Great Britain", YEAR=1994, KEYWORDS="estelle; formal technique; lotos; protocol specification; sdl; specification; testing", } @TECHREPORT{Hong94:Internetworking, AUTHOR="D. Hong and Brett Vickers and T. Suda and C. Oliveira", TITLE="The Internetworking of Connectionless Data Networks over Public {ATM:} Connectionless Server Design and Performance", TYPE="Technical Report", INSTITUTION="University of California, Irvine, Department of Information and Computer Science", NUMBER="ICS-TR-94-41", PAGES=27, YEAR=1994, ABSTRACT="The transport of connectionless data is necessary for the compatibility of emerging wide area ATM networks with existing computer networks. This paper investigates the design and performance of a virtual connectionless network overlayed on top of cell-based connection oriented ATM networks. The virtual connectionless network is made possible by utilizing connectionless servers. Two packet forwarding techniques used by connectionless servers are examined. Forwarding connectionless packets in a cell-by-cell manner (streaming mode) is shown to result in lower packet loss and end-to-end delay than packet-by-packet forwarding of connectionless data (reassembly mode). A design and implementation are presented for a streaming mode connectionless server capable of a maximum throughput of 100 Mbps.", } @TECHREPORT{Hopp94:Medusa, AUTHOR="Stuart Wray and Tim Glauert and Andrew Hopper", TITLE="The Medusa Applications Environment", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 94-12 (video)", NOTE="Proceedings of European Computer Support for Collaborative Working, Stockholm, September 1995", YEAR=1994, ABSTRACT="The Medusa project aims to provide a rich multimedia environment for the desktop user. It is based on hardware which utilises ATM communications technology as the basic interconnect both for computers and multimedia peripherals such as cameras, microphones and other devices. The speed of the ATM fabric is sufficiently high (100Mbps at the link level) that the networking does not present a bottleneck. Small 4x4 and 8x8 ATM switches are used to implement the network in the local area. This is compatible with wide-area ATM networks and will make it possible to extend this approach. The hardware modules available are ATM video, ATM audio, ATM LCD tile, ATM disc brick and DEC Alpha workstations. The video module can accommodate four camera heads and can provide images at six different sizes for each. The audio module has four bidirectional channels and a range of sampling frequencies up to 48KHz. The display tile is based on a 640x480 active matrix display. The disc brick uses RAID-3 technology and provides 8Gbytes of storage. The system has been deployed in the laboratory and some two hundred modules and switches are available for experimentation. For the time being, raw video is being used to make easier the development of applications which incorporate the use of agents. The software platform consists of two components; an object oriented applications environment, and the applications themselves written in a scripting language called Tcl/Tk. The applications environment is a peer-to-peer architecture which uses active object to represent information sources, sinks, data converters and so on. Data can flow from module to module on connections between them. Connections between modules are simple, reliable and unbuffered. More complex connections are represented by special intermediate modules. Modules for providing basic agent features are available, ranging from simple motion and sound observers to gesture, speech and face recognition components. Applications can be prototyped rapidly and different combinations of features evaluated with ease. Applications include a media server which simultaneously provides many channels at many sizes for viewing on a workstation or display tile. A multi-way video phone uses four video streams and an audio stream between the corresponding parties. The cameras are used to provide head and shoulder and more general views into an office. Views of documents are available from a rostrum camera above the desk. Four microphones and speakers provide hands-free audio to any part of the office. In a conversation, all video streams are sent to the recipient who can choose what to watch at the largest size. Additionally, the streams can be sent to an agent which suggests or controls the way sizes are allocated to views. The decision is a combination of the amount of motion, where in the field of view the motion is taking place, together with some hysteresis to prevent flicking between scenes. It also incorporates the user's options on a per-application and per-office basis. When two corresponding parties operate in this way a total of 30 streams are sent across the ATM network. The video mail application records all views so that subsequently the recipient can choose which (one or many) to view. This presents a high load on the storage system because each view must be recorded at maximum size as at that it is not known how it will be subsequently presented. Finally, a hand tracker is shown where a two-stage algorithm starts by searching for a hand in a scene, and, having found it, draws an outline and attempts some gesture recognition. The Medusa system is currently being used to develop a variety of algorithms suitable for use by agents ranging from simple ones which can provide ubiquitous service to all clients to complex ones which are invoked as required.", URL="http://www.cam-orl.co.uk/movies.html#2", } @UNPUBLISHED{Horn94:Scalable, AUTHOR="Uwe Horn and B. Girod", TITLE="A Scalable Video Codec Using Lattice Vector Quantization", INSTITUTION="Lehrstuhl für Nachrichtentechnik, Universität Erlangen", ADDRESS="Cauerstr. 7, 91058 Erlangen, Germany", NOTE="research memorandum", YEAR=1994, REFERENCES=23, KEYWORDS="MPEG-2; video codec; scalable lattice codec; motion compensation; lattice vector quantization", ABSTRACT="A scalable video coding scheme based on spatiotemporal pyramids and multi-scale motion compensation is presented. Low complexity is obtained by lattice vector quantization and simple interpolation and downsampling filters. Experimental results are given for a digital broadcasting codec scalable over a 100:1 bitrate range. The scalable lattice VQ codec has SNR and picture quality comparable to a non-scalable MPEG-2 codec.", } @ARTICLE{Hou94:Load, AUTHOR="Chien-Long Hou and Kang G. Shin", TITLE="Load Sharing with Consideration of Future Task Arrivals in Heterogeneous Distributed Real-Time Systems", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="In a heterogeneous distributed real-time system, some nodes may experience more task arrivals than others, or tasks arriving at some nodes may have tighter laxities than those arriving at other nodes. In such an environment, transferring an unguaranteed task on a node to another node currently with the most abundant resources is not necessarily the best decision. We propose a new load sharing (LS) algorithm for real-time applications which takes into account the effect of future task arrivals on locating the best receiver for each unguaranteed task. Upon arrival of a task at a node, the node first checks whether or not it can complete the task in time using the minimum-laxity-first-served discipline. If the node cannot guarantee the arriving task or some of existing guarantees were to be invalidated as a result of inserting the task into its queue, then the node must locate a remote node to which each unguaranteed task will be transferred. The proposed LS algorithm minimizes not only the probability of transferring an unguaranteed task {cal T} to an incapable node with Bayesian analysis, but also the probability that a remote node fails to guarantee {\cal T} because of future arrivals of tighter-laxity tasks with queueing analysis. All parameters needed for a node's LS decision are collected/estimated on-line using time-stamped region-change broadcasts and Bayesian estimation. By using time-stamped region-change broadcasts, the collected state information, albeit obsolete, can be used to estimate other nodes' states [1]. Use of Bayesian estimation makes the proposed LS algorithm adaptive to dynamically varying workloads with little computational overhead. Our simulation results show that the proposed LS algorithm outperforms other existing LS algorithms in minimizing the probability of (1) dynamic failure, (2) task collisions, and (3) excessive task transfers. The performance improvement by the proposed policy over others becomes more pronounced as the degree of system heterogeneity increases.", } @ARTICLE{Hsia94:Single, AUTHOR="Shuo-Hsien Hsiao and Chi-Ming Chen", TITLE="Performance Analysis of Single-Buffered Multistage Interconnection Networks", JOURNAL=ieeecom, YEAR=1994, ABSTRACT="A new model for the performance evaluation of single-buffered multistage interconnection networks (MIN's) is proposed. Previous models proposed in solving this problem are either not accurate enough or only applicable to a special case where the switching elements (SEs) are 2 X 2 crossbars. This new model allows the analysis of a MIN with SE's of arbitrary sizes (i.e., a X a) and, through extensive simulations, has been shown to be very accurate. Since only three states are required at each stage of a MIN, this model is efficient computationally.", } @ARTICLE{Hua94:Designing, AUTHOR="Kien Hua and L. Y. Liu and Jih-Kwon Peir", TITLE="Designing High-Performance Processors Using Real Address Prediction", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="In this correspondence, we propose design techniques that may significantly simplify the cache access path, and hence offer the opportunity of shorter cycle time or fewer pipeline stages. Our proposals are based on highly accurate prediction methods that allow us to efficiently resolve address translation information early in the pipe.", } @ARTICLE{Huan9403:Refined, AUTHOR="Yao-yu Huang and S. U. Guan", TITLE="A Refined Cut-Through Buffer Management Scheme for Layered Protocol Stacks", JOURNAL=ieeecm, VOLUME=32, NUMBER=3, PAGES="82-85", MONTH="Mar", YEAR=1994, REFERENCES=3, KEYWORDS="buffer management; layered protocol stacks; protocol-execution bottleneck; cut-through; protocol implementation", ABSTRACT="Avoiding recopying of user data as it is passed between protocol layers helps break the protocol-execution bottleneck.", } @ARTICLE{Huan9406:Separation, AUTHOR="Chia-chi Huang and A. Leon-Garcia", TITLE="Separation Principle of Dynamic Transmission and Enqueueing Priorities for Real- and Nonreal-Time Traffic in {ATM} Multiplexers", JOURNAL=ieanep, ISBN="1063-6692", VOLUME=2, NUMBER=6, PAGES="588-601", YEAR=1994, REFERENCES=13, KEYWORDS="real time; ATM; multiplexer; QOS; queueing discipline; buffer management", ABSTRACT={This paper describes the slot-oriented queueing disciplines thatfurther involve the buffer management of the output queue of ATM switches. A fundamental principle called the "Separation Principle" will be present, which assert that 1) the QoS (measured bythe time-cumulative cell loss for each traffic class) region ofthe "efficient" disciplines (provide the best QoS tradeoff between the two types of traffic) can be divided into two mutually e}, } @ARTICLE{Huan94:Priority, AUTHOR="Tien-Yu Huang and Wu. J.-L. C.", TITLE="Priority promotion {DQDB} networks to improve fairness", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", ADDRESS="Great Britain", VOLUME=17, NUMBER=5, PAGES="332-338", YEAR=1994, REFERENCES=11, KEYWORDS="dqdb; fairness; MAN", ABSTRACT="In this paper, we present a new solution, the priority promotion (PP) scheme, to improve the fairness problem of the DQDB network. This solution requires only a minor modification of the current protocol, and wastes negligible bandwidth to solve the unfairness problem.", } @ARTICLE{Huan94:Reservation, AUTHOR="Nian-Chyi Huang and Chung-Ching Chiou", TITLE="Reservation scheme for {CRMA} high-speed networks", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", VOLUME=17, NUMBER=6, PAGES="396-406", YEAR=1994, REFERENCES=19, KEYWORDS="HSLAN; LAN; MAN; reservation", ABSTRACT="In this paper, we propose a new reservation scheme for CRMA high-speed networks to make a shorter cycle length. Simulation results show that compared with the original CRMA reservation scheme,this new scheme does result in a much shorter average cycle length. Furthermore, the proposed scheme also obtains better throughput (slot utilization), as well as a lower access delay.", } @INPROCEEDINGS{Hube94:Architecture, AUTHOR="M. Huber and R. Osborne", TITLE="Architecture of an all-optical ring network", BOOKTITLE=efoc, ISBN="3-905084-27-9", ADDRESS="Switzerland", PAGES="102-105", YEAR=1994, REFERENCES=4, KEYWORDS="network architecture; protection; ring network; WDM", ABSTRACT="An optical ring employing wavelength division multiplexing is motivated within the context of a future high-capacity optical transport network for the public area. This paper discusses various realization and functional aspects of the ring including architecture, optical protection switching strategies and the optical elements for its implementation. The ring is also applicable in local area networks.", } @ARTICLE{Hugh9405:Geographic, AUTHOR="J. P. Hughes and William R. Franta", TITLE="Geographic extension of {HIPPI} channels via high-speed {SONET}", JOURNAL=ieeenet, VOLUME=8, NUMBER=3, PAGES="42-53", MONTH="May/June", YEAR=1994, REFERENCES=13, KEYWORDS="HIPPI; SONET; local area networks", ABSTRACT="Key to the performance of a long distance HIPPI extension mechanism is a method of ``relaxing'' the HIPPI protocol so that full round-trip times are not required by the connection and flow control components.", } @ARTICLE{Hull94:Database, AUTHOR="Jonathan J. Hull", TITLE="A Database for Handwritten Text Recognition Research", JOURNAL=ieeepami, VOLUME=16, YEAR=1994, ABSTRACT="An image database for handwritten text recognition research is described. Digital images of approximately 5000 city names, 5000 state names, 10000 ZIP Codes, and 50000 alphanumeric characters are included. Each image was scanned from mail in a working post office at 300 pixels/in in 8-b grayscale on a high-quality flat bed digitizer. The data were unconstrained for the writer, style, and method of preparation. These characteristics help overcome the limitations of earlier databases that contained only isolated characters or were prepared in a laboratory setting under prescribed circumstances. Also, the database is divided into explicit training and testing sets to facilitate the sharing of results among researchers as well as performance comparisons.", } @TECHREPORT{Hutc94:Quality, AUTHOR="D. Hutchison and G. Coulson and Andrew T Campbell and G. S. Blair", TITLE="Quality of Service Management in Distributed Systems", INSTITUTION="Lancester University", NUMBER="MPG-94-02", YEAR=1994, ANNOTE="To be published in a book on Distributed Systems Management edited by Morris Solomon, Imperial College london", URL="ftp://ftp.comp.lancs.ac.uk/pub/mpg/MPG-94-02.ps", } @BOOK{Händ94:ATM, AUTHOR="Rainer Händel and M. Huber and Stefan Schröder", TITLE="{ATM} Networks: Concepts, Protocols, Applications", ISBN="0-201-42274-3", PUBLISHER="Addison-Wesley", YEAR=1994, KEYWORDS="architecture; ATM; ITU; B-ISDN; connectionless service; cross connect; data traffic; frame relay; internetworking; network; optical switching; protocol; SDH; signalling; signalling protocol; standard; switching system; transmission system; fast packet switching; tutorial", } @ARTICLE{Imie94:Wireless, AUTHOR="T. Imielinski and Badri Nath", TITLE="Wireless Computing", JOURNAL=cacm, VOLUME=37, NUMBER=10, PAGES="18-28", YEAR=1994, REFERENCES=25, KEYWORDS="mobile radio", } @ARTICLE{Inou9404:Granulated, AUTHOR="Y. Inoue and Noriyuki Terada", TITLE="Granulated Broadband Networks", JOURNAL=ieeecm, VOLUME=32, NUMBER=4, PAGES="56-63", MONTH="Apr", YEAR=1994, KEYWORDS="granulated broadband networks; ATM", ABSTRACT="A new ATM platform concept can accelerate the introduction of broadband services with enhanced integration of existing narrowband services --- including POTS.", } @ARTICLE{Intr94:Decoded, AUTHOR="Gideon D. Intrater and Ilan Y. Spillinger", TITLE="Performance Evaluation of a Decoded Instruction Cache for Variable Instruction Length Computers", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="A Decoded INstruction Cache (DINC) is a buffer between the instruction decoder and other instruction pipeline stages. In this paper, we explain how techniques that reduce the branch penalty on a DINC, can improve CPU performance. We also analyze the impact of some of the design parameters of DINCs on variable instruction length computers. Our study indicates that tuning the mapping of the instructions into the cache can improve performance substantially. Tuning must be based on the instruction length distribution for a specific architecture. In addition, the associativity degree has a greater effect on the DINC's performance than on the performance of regular caches. We discuss the difference between the performance of DINCs and other caches, when longer cache lines are used. We present a model to estimate the miss rate based on its characteristics, that were discussed and analyzed throughout this paper. Our conclusions are based on both analytical study and trace driven simulations of several integer UNIX (Trademark) applications.", } @ARTICLE{Irme9401:Shaping, AUTHOR="T. Irmer", TITLE="Shaping Future Telecommunications: The Challenge of Global Standardization", JOURNAL=ieeecm, VOLUME=32, NUMBER=1, PAGES="20-29", MONTH="Jan", YEAR=1994, KEYWORDS="telecommunications; global standardization", ABSTRACT="Rapid changes in telecommunication technologies and the telecommunications environment are presenting new opportunities and challenges to global telecommunication standardization.", } @ARTICLE{Irvi9405:Role, AUTHOR="D. R. Irvin", TITLE="The role of customer premises bandwidth management", JOURNAL=ieeenet, VOLUME=8, NUMBER=3, PAGES="18-25", MONTH="May/June", YEAR=1994, REFERENCES=14, KEYWORDS="leased line; pricing", ABSTRACT="In the evolving era of high-speed wide-area networking, customer premises bandwidth management should offer economic advantages well into the future.", } @INPROCEEDINGS{Isaa94:Iterative, AUTHOR="Ellen A. Isaacs and T. D. Morris and Thomas K. Rodriguez", TITLE="Iterative Design of a Collaborative Application: A Case Study", BOOKTITLE="Workshop on Software Engineering and Human-Computer Interaction: Joint Research Issues", INSTITUTION="Sun Microsystems", ADDRESS="Sorrento, Italy", PAGES="119-121", YEAR=1994, KEYWORDS="user interface; CSCW; conferencing; multimedia", ABSTRACT="Developing usable software applications can be difficult because the goals of software engineers and human interface engineers often conflict. Our group used a process that reduced the workload of the software engineers and yet produced a particularly usable and well-engineered application. This process included designing the UI before coding, developing the application's user interface in a UI builder, and regularly testing the application with users under realistic conditions. This latter point was an important achievement because it is critical and yet particularly difficult to test collaborative applications. Carrying out these activities enabled the software engineers and human interface engineers to work closely together as a cooperative team because everyone was able to contribute valued components to the effort.", URL="http://www.sun.com/tech/projects/coco/papers/forum/se.hci.workshop.ps", } @INCOLLECTION{Isaa94:Lessons, AUTHOR="Ellen A. Isaacs and T. D. Morris and Thomas K. Rodriguez", TITLE="Lessons Learned from a Successful Collaboration Between Software Engineers and Human Interface Engineers", BOOKTITLE="Lecture Notes in Computer Science", PUBLISHER="Springer Verlag", PAGES="232-240", YEAR=1994, KEYWORDS="HCI; forum; user interface", ABSTRACT="Most software applications are difficult to use because the development process emphasizes the quality of the architecture and not the usability of the application. Programs can be both well engineered and usable if software engineers work with human interface engineers who not only design the user interface but advocate architectural decisions that help make tasks more natural for users. Our group used a process that reduced the workload of the software engineers and yet produced a particularly usable and well-engineered application. This process included designing the UI before coding, developing the application's user interface in a UI builder, and regularly testing the application with users under realistic conditions. This latter point was an important achievement because it is critical and yet particularly difficult to test collaborative applications. Carrying out these activities enabled the software engineers and human interface engineers to work closely together as a cooperative team because everyone was able to contribute valued components to the effort.", URL="http://www.sun.com/tech/projects/coco/papers/forum/se.hci.journal.ps", } @ARTICLE{Isaa94:What, AUTHOR="Ellen A. Isaacs and John C. Tang", TITLE="What Video Can and Cannot Do for Collaboration: A Case Study", JOURNAL=mms, VOLUME=2, PAGES="63-73", YEAR=1994, KEYWORDS="multimedia conferencing; packet video", ABSTRACT="As multimedia becomes an integral part of collaborative systems, we must understand how to design such systems to support users' rich set of existing interaction skills, rather than requiring people to adapt to arbitrary constraints of technology-driven designs. To understand how we can make effective use of video in remote collaboration, we compared a small team's interactions through a desktop video conferencing prototype with face-to-face interactions and phone conversations. We found that, compared with audio-only, the video channel of our desktop video conferencing prototype adds or improves the ability to show understanding, forecast responses, give non-verbal information, enhance verbal descriptions, manage pauses and express attitudes. These findings suggest that video may be better than the phone for handling conflict and other interaction-intense activities. However, the advantages of video depend critically on the nearly-instantaneous transmission of audio, even if it means getting out of sync with the video image. Nonetheless, when compared with face-to-face interaction, it can be difficult in video interactions to notice peripheral cues, control the floor, have side conversations, point to things or manipulate real-world objects. To enable rich interactions fully, video should be integrated with other distributed tools that increase the extent and type of shared space in a way that enables natural collaborative behaviors within those environments.", URL="mailto:isaacs@eng.sun.com", } @ARTICLE{Ishi9401:Generalized, AUTHOR="F. Ishizaki and T. Takine and Yutaka Takahashi and Toshiharu Hasegawa", TITLE="A generalized {SBBP/G/1} queue and its applications", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=21, NUMBER="1-2", PAGES="163-181", YEAR=1994, REFERENCES=15, KEYWORDS="queueing system; batch arrival; discrete time queue", ABSTRACT="We consider a discrete-time single-server queueing system with generalized switch batch Bernoulli arrival and a general service time process. Customers arrive to the system in batches and service times are generally distributed. The batch size and the service time distributions are governed by a discrete-time alternating renewal process with states 1 and 2.", } @ARTICLE{Ivan9407:Network, AUTHOR="William D. Ivancic and Mary J. Shalkhauser and Jorge A. Quintana", TITLE="A Network Architecture for a Geostationary Communication Satellite", JOURNAL=ieeecm, VOLUME=32, NUMBER=7, PAGES="72-85", MONTH="Jul", YEAR=1994, KEYWORDS="geostationary communication satellite; m-vsat communication system", ABSTRACT="An M-VSAT communication system envisioned by NASA would provide low data rate, direct-to-the-user communications services.", } @ARTICLE{Iwai94:Investigation, AUTHOR="Hisato Iwai and Takayasu Shiokawa and Yoshio Karasawa", TITLE="An Investigation of Space-Path Hybrid Diversity Scheme for Base Station Reception in {CDMA} Mobile Radio", JOURNAL=ieeejsac, YEAR=1994, ABSTRACT="In CDMA mobile radio communication systems, degradation of instantaneous signal to interference power ratio (C/I), which causes impairment of frequency utilization factor, will be significant in multipath fading environments. In this paper, a hybrid diversity scheme for fading reduction combining effects of space diversity and path diversity (represented by the RAKE method) is investigated. A quantitative evaluation of fading reduction effects of the hybrid diversity is performed, comparing them with those of space diversity only and path diversity only. The hybrid diversity scheme is promising in environments where the delay spread of a transmission path is 1 microsecond, or less.", } @ARTICLE{Jaqu94:Collision, AUTHOR="P. Jaquet and P. M hlethaler and Nicolas Rivierre", TITLE="Collision Detection in {HIPERLAN}", JOURNAL="Personal, Indoor and Mobile Radio Communications (PMRC)", ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", PAGES="875-879", YEAR=1994, REFERENCES=4, KEYWORDS="collision detection; LAN; multiple access channel; radio channel", ABSTRACT="The Collision Detection (CD) is an interesting feature which provdes optimal performance to radio LANs such to make the latter comparable to wired LANs (e.g. Ethernet). The European HIPERLAN 20 Mbps standard is the natural environment for this implementation, since this standard involves the most powerful Physical base and the most multivalent architecture for radio LANs. In this paper we describe one possible way to detect collision in radio L", } @ARTICLE{Jeon94:Adaptive, AUTHOR="Dae Gwon. Jeong and Cheong H. Choi and Whasook Jeon", TITLE="Adaptive Bandwidth Waste Rate: a fair bandwidth sharing scheme for the {DQ} protocol with multiple priority classes", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", VOLUME="17 NUMBER=8", PAGES="571-580", YEAR=1994, REFERENCES=11, KEYWORDS="dqdb; fairness; HSLAN; LAN; MAN; multiple priority", ABSTRACT="In distributed queue dual bus (DQDB) networks, the distributed queueing protocol is used to control access of asynchronous datato the bus. This paper proposes a new scheme, the adaptive bandwidth waste rate (ABWR) scheme for fair bandwidth sharing among active nodes under the DQ protocol with multiple priority clases.", } @ARTICLE{Jger94:Kausale, AUTHOR="R. Jäger", TITLE="Kausale Zeitreihenanalyse am Beispiel des Telephonverkehrs", JOURNAL="Frequenz", ADDRESS="Germany", VOLUME=48, PAGES="162-176", YEAR=1994, LANGUAGE="German", REFERENCES=7, KEYWORDS="traffic analysis; telephony", ABSTRACT="Das Hauptanliegen einer Zeitreihenanalyse besteht darin, die innere Sruktur von Zeitreihen zu erkennen. Sind dabei gewisse Gesetzmäßigkeiten feststellbar, so können u.a. rational begr ndete Vorhersagen über deren zukünftige Entwicklung getroffen werden. Bei dem hier diskutierten Ansatz wird eine gegebene Zeitreihe in ihre kausalen Grundkomponenten zerlegt. Man kann damit letztlich tiefere Einblicke in die Zusammenhänge und Gesetzmäßigkeiten", } @ARTICLE{Jing94:Extending, AUTHOR="Wen Jing and M. Paterakis", TITLE="Extending the single-node {DQDB} analytical model to analyze network-wide performance", JOURNAL=cnis, ADDRESS="Netherlands", VOLUME=27, PAGES="653-675", YEAR=1994, REFERENCES=12, KEYWORDS="analytical model; DQDB; MAN", ABSTRACT="The exact analytical model of DQDB is known to have state space explosion problem which makes its analysis intractable. The apporximate single-node analytical model, introduced in a paper by Bisdikian and extend in a paper by Jing and Paterakis, has been proven to be a tractable model capable of providing valuable insight into the DQDB network behavior. In this paper, we show how to further extend the single-node model to approximately evaluate", } @INPROCEEDINGS{Jlic94:Protocol, AUTHOR="B. J lich and D. Plassmann", TITLE="Protocol Design and Performance Analysis of an Intermediate-Hop Radio Network Architecture for {MBS}", BOOKTITLE=pmrc, ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", PAGES="1178-1182", YEAR=1994, REFERENCES=6, KEYWORDS="ATM; multihop; packet radio", ABSTRACT="A proposal for an intermediate-hop radio network is presented which is a MS-MS-link allowing network based on the Mobile Broadband System (MBS). MBS operating at 60 GHz frequencies has most likely to rely on line of sight (LOS) connections, which results in the known problem of shadowing. The proposed network architecture is compared with conventional cellular radio networks as well as with ad-hoc radio networks by a performance analysis, that", } @ARTICLE{Jnge94:Profibus, AUTHOR="B. J nger", TITLE="Profibus contra {Interbus-S}", JOURNAL="Elektronik", ADDRESS="Germany", VOLUME=21, PAGES="68-79", YEAR=1994, LANGUAGE="German", KEYWORDS="bus; comparison; media access control", ABSTRACT="Die zwei Feldbusse halten einen gemeinsamen, denkw rdigen Rekord: Selten wurde von den Vertretern der jeweiligen Marketingabteilungen so viel geschrieben, wie über diese beiden Kommunikationssysteme. Legt man die jetzt vorliegenden Normpapiere zugrunde, dann widerlegen sie die häufig aufgestellte Behauptung, daß f r die Bearbeitung von E/A-orientierten Feldgeräten ein anderer Feldbus nötig sei als für intelligente Geräte mit vorverarbeitender F", } @ARTICLE{Jone9405:Baseband, AUTHOR="John Jones", TITLE="Baseband and Passband Transport Systems for Interactive Video Services", JOURNAL=ieeecm, VOLUME=32, NUMBER=5, PAGES="90-101", MONTH="May", YEAR=1994, REFERENCES=38, KEYWORDS="baseband; passband; transport systems; video services; baseband; passband; video on demand; CATV; economics", ABSTRACT="Baseband has emerged as the preferred approach for today's interactive video services applications.", } @ARTICLE{Jone94:Multiple, AUTHOR="Wen-Ben Jone and Chengke Wu", TITLE="Multiple Fault Detection in Parity Checkers", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="Parity checkers are widely used in digital systems to detect errors when systems are in operation. Since parity checkers are monitoring circuits, their reliability must be guaranteed by performing a thorough testing. In this work, multiple fault detection of parity checkers is investigated. We have found that all multiple stuck-at faults occurring on a parity tree can be completely detected using test patterns provided by the identity matrix plus zero vector. The identity matrix contains 1s on the main diagonal and 0s elsewhere; while the zero vector contains 0s. The identity matrix vectors can also detect all multiple general bridging faults, if the bridgings result in a wired-AND effect. However, test patterns generated from the identity matrix and binary matrix are required to detect a majority of the multiple bridging faults which yield wired-OR connections. Note that the binary matrix contains two 1s at each column of the matrix.", } @INPROCEEDINGS{Jons94:Personal, AUTHOR="U. Jonsson and S. Kleier", TITLE="Personal Communication - Network Aspects and Implementations", BOOKTITLE="Towards a Pan-European Telecommunication Service Infrastructure - IS\&N Second International Conference", ADDRESS="Denmark", PAGES="321-331", YEAR=1994, KEYWORDS="implementation; IN; intelligent network; internetworking; mobile radio", ABSTRACT="The paper presents some network aspects of a personal communication concept in multiple networks. It proposes a possible functional network architecture based on the Intelligent Network Capability Set 2 standard. It also discusses a cordless access to a personal communication service. Finally, an implementation of a demonstrator, done within the RACE mobilise project, is described.", } @ARTICLE{Jose94:Bar, AUTHOR="Eugene Joseph and T. Pavlidis", TITLE="Bar Code Waveform Recognition Using Peak Locations", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="Traditionally, zero crossings of the second derivative provide edge features for the classification of blurred waveforms. The accuracy of these edge features deteriorates in the case of severely blurred images. In this paper, a new feature is presented that is more resistant to the blurring process, the image, and waveform peaks. In addition, an estimate of the standard deviation $\sigma$ of the blurring kernel is used to perform minor deblurring of the waveform. Statistical pattern recognition is used to classify the peaks as bar code characters. The noise tolerance of this recognition algorithm is increased by using an adaptive, histogram-based technique to remove the noise. In a bar code environment that requires a misclassification rate of less than one in a million, the recognition algorithm showed a 43\% performance improvement over current commercial bar code reading equipment.", } @BOOK{Jung94:Graphen, AUTHOR="D. Jungnickel", TITLE="Graphen, Netzwerke und Algorithmen", ISBN="3-411-14263-4", PUBLISHER="BI-Wiss.-Verlag", ADDRESS="Mannheim, Germany", YEAR=1994, LANGUAGE="German", KEYWORDS="algorithm; combinatorial method; graph marking algorithm; graph theory; greedy algorithm; network; np problem; optimization; overview", ABSTRACT={Das Buch behandelt den graphentheoretisch formulierbaren Teil der Kombinatorischen Optimierung, wobei der Schwerpunkt auf der Darstellung effizienter Algorithmen liegt. Die behandelten Probleme stammen meist aus den Anwendungen insbesondere in der Wirtschaft (z.B. Bestimmung kuerzester oder zuverlaessigster Wege in Verkehrs-oder Kommunikationsnetzen, Projektplanung, Entwurf von Verkehrsnetzen, "Fluesse" in Pipeline-Systemen, kuerzeste Rundreise}, } @ARTICLE{Kada94:100Base, AUTHOR="J. Kadambi and S. Barilovits", TITLE="An Analysis of {100Base-VG} Demand Priority Protocol: Effects on Real-Time Communications", JOURNAL="SPIE", VOLUME=2188, PAGES="279-286", YEAR=1994, REFERENCES=8, KEYWORDS="HSLAN; LAN; real time", ABSTRACT="In this paper, we analyze the performance of 100Base-VG using asimple analytical and simulation model. Expressions for networkutilization, throughput and access delay are derived. From these, we show that 100Base-VG provides the basic characteristics required by a real-time network architecture at the data link layer to support guarantees for delay, delay jitter and throughput.", } @ARTICLE{Kama94:Collision, AUTHOR="A. E. Kamal and H. S. Hassanein", TITLE="Analysis of collision-avoidance star {LANs}", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", VOLUME="17 NUMBER=8", PAGES="589-599", YEAR=1994, REFERENCES=14, KEYWORDS="analysis; LAN; performance evaluation; star network", ABSTRACT="We present a novel approach to the approximate modelling of symmetric systems where users behaviours are highly dependent. The model follows the behaviour of a tagged user in an exact manner,and the rest of the users behaviour is approximated by mimicking that of the tagged user at steady state using an iterative approach.", } @ARTICLE{Kami9402:Dynamic, AUTHOR="R. J. Horn I. I. I and George B. Adams I. I. I and Pradeep K. Dubey", TITLE="Dynamic trace analysis for analytic modeling of superscalar performance", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=19, NUMBER="2-3", PAGES="259-276", YEAR=1994, REFERENCES=30, KEYWORDS="performance model; analytical model; trace; concurrency", ABSTRACT="To study the performance of superscalar processors, a method of analyzing dynamic instruction traces to characterize program parallelism is introduced. A new parameter, the beta / alpha ratio, is used to quantify the available parallelism within programs versus the scope of concurrency detection. Performance is evaluated within a framework of multi-instruction issue, speculative execution, dynamic scheduling, and finite scope of concurrency det", } @ARTICLE{Kana94:Rotation, AUTHOR="Kenichi Kanatani", TITLE="Analysis of {3-D} Rotation Fitting", JOURNAL=ieeepami, YEAR=1994, ABSTRACT={Computational techniques for fitting a 3-D rotation to 3-D data are recapitulated in a refined form as minimization over proper rotations, extending three existing methods-the method of singular value decomposition, the method of polar decomposition, and the method of quaternion representation. Then, we describe the problem of 3-D motion estimation in this new light. Finally, we define the "covariance matrix" of a rotation, and analyze the statistical behavior of errors in 3-D rotation fitting.}, } @ARTICLE{Kana94:Stereo, AUTHOR="Takeo Kanade and Masatoshi Okutomi", TITLE="A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="A central problem in stereo matching by computing correlation or sum of squared differences (SSD) lies in selecting an appropriate window size. The window size must be large enough to include enough intensity variation for reliable matching, but small enough to avoid the effects of projective distortion. If the window is too small and does not cover enough intensity variation, it gives a poor disparity estimate, because the signal (intensity variation) to noise ratio is low. If, on the other hand, the window is too large and covers a region in which the depth of scene points (i.e., disparity) varies, then the position of maximum correlation or minimum SSD may not represent correct matching due to different projective distortions in the left and right images. For this reason, a window size must be selected adaptively depending on local variations of intensity and disparity. We present a method to select an appropriate window by evaluating the local variation of the intensity and the disparity. We employ a statistical model of the disparity distribution within the window. This modeling enables us to assess how disparity variation, as well as intensity variation, within a window affects the uncertainty of disparity estimate at the center point of the window. As a result, we can devise a method which searches for a window that produces the estimate of disparity with the least uncertainty for each pixel of an image: the method controls not only the size but also the shape (rectangle) of the window. We have embedded this adaptive-window method in an iterative stereo matching algorithm: starting with an initial estimate of the disparity map, the algorithm iteratively updates the disparity estimate for each point by choosing the size and shape of a window till it converges. The stereo matching algorithm has been tested on both synthetic and real images, and the quality of the disparity maps obtained demonstrates the effectiveness of the adaptive window method.", } @TECHREPORT{Karl94:Glass, AUTHOR={Jussi Karlgren and Kristina H"o"ok and Andrea C. Lantz and J. Palme and Dani Pargman}, TITLE="The glass box user model for filtering", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-14", YEAR=1994, ABSTRACT="The first requirement on an interactive system in a domain such as information filtering is to be an interface to knowledge, rather than just a knowledgeable interface. We borrow the computation instruction metaphor of a system as 'a black box in a glass box' as a means to conceptualize the problem of giving a user control over the actions of an interactive system. The application domain we work in is that of information filtering. In the 'black box', we hide complex knowledge of the domain objects such as facts and assumptions about text genre identification, while the 'glass box', which is what the user sees, only shows the neat top level knowledge of the domain conceptual categories such as e.g. categorization rules.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-14--SE.ps.Z", } @TECHREPORT{Karl94:Mumbling, AUTHOR="Jussi Karlgren", TITLE="Mumbling - User-Driven Cooperative Interaction", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="T94-01", YEAR=1994, ABSTRACT="This paper suggests a scheme for raising the cooperativeness of natural language interfaces without changing either modality or system linguistic competence, but by heightening the level of interactivity and by aiding the user in maintaining the responsibility for the discourse. In short: hands-off-pragmatics at the computer interface.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--94-01--SE.ps.Z", } @TECHREPORT{Karl94:Newsgroup, AUTHOR="Jussi Karlgren", TITLE="Newsgroup Clustering Based On User Behavior - A Recommendation Algebra", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="T94-04", YEAR=1994, ABSTRACT="User models are a tool for guiding system behavior in interactive systems, and their utility and properties, desirable and undesirabled have been investigated in this context. There are several ways of utilizing information about the user that have NOT been implemented, however. In this paper a scheme for users to peek at other users' user models to extract information is proposed, in an information retrieval or information filtering domain. The material used for the study is a set of .newsrc files.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--94-04--SE.ps.Z", } @ARTICLE{Kary94:Unstructured, AUTHOR="George Karypis and V. Kumar", TITLE="Unstructured Tree Search on {SIMD} Parallel Computers", JOURNAL=ieeepds, YEAR=1994, ABSTRACT="In this paper, we present new methods for load balancing of unstructured tree computations on large-scale SIMD machines, and analyze the scalability of these and other existing schemes. An efficient formulation of tree search on a SIMD machine consists of two major components: (i) a triggering mechanism, which determines when the search space redistribution must occur to balance the search space over processors; and (ii) a scheme to redistribute the search space. We have devised a new redistribution mechanism and a new triggering mechanism. Either of these can be used in conjunction with triggering and redistribution mechanisms developed by other researchers. We analyze the scalability of these mechanisms, and verify the results experimentally. The analysis and experiments show that our new load balancing methods are highly scalable on SIMD architectures. Their scalability is shown to be no worse than that of the best load balancing schemes on MIMD architectures. We verify our theoretical results by implementing the 15-puzzle problem on a CM-2 SIMD parallel computer. [CM-2 is a registered trademark of Thinking Machines Corporation]", } @INPROCEEDINGS{Kato94:UMTS, AUTHOR="J.-P. Katoen and A. Saidi and I. Baccaro", TITLE="A {UMTS} Network Architecture", BOOKTITLE="RACE Mobile Telecommunications Workshop", PAGES="285-289", YEAR=1994, REFERENCES=5, KEYWORDS="IN; mobile radio; network architecture; overview; survey", ABSTRACT="This paper proposes a Functional Architecure and a corresponding Network Architecture for the Universal Mobile Telecommunication System (UMTS). Procedures like call handling, location management, and handover are considered. ... Integration with existing and forthcoming networks for fixed communications is anticipated and the Intelligent Network (IN) philosophy is applied.", } @ARTICLE{Katz94:Adaptation, AUTHOR="Randy H. Katz", TITLE="Adaptation and mobility in wireless information systems", JOURNAL="IEEE Personal Communications", VOLUME=1, NUMBER=1, PAGES="6-17", MONTH="First Quarter", YEAR=1994, REFERENCES=20, KEYWORDS="PCS; mobility; survey; hand-off; mobile IP", URL="http://www.comsoc.org/pubs/surveys/katz/katz-orig.html", } @ARTICLE{Kels94:Efficient, AUTHOR="Todd P. Kelsey and Kewal K. Sauja and Shiang-feng Lee", TITLE="An Efficient Algorithm for Sequential Circuit Test Generation", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="This paper presents an efficient sequential circuit automatic test generation algorithm. The algorithm is based on Podem and uses a nine-valued logic model. Among the novel features of the algorithm are use of an Initial Timeframe Algorithm and correct implementation of a solution to the Previous State Information Problem. The Initial Timeframe Algorithm, one of the most important aspects of the test generator, determines the number of timeframes required to excite the fault for which a test is to be derived and the number of timeframes required to observe the excited fault. Correct determination of the number of timeframes in which the fault should be excited (activated) and observed saves the test generator from performing unnecessary search in the input space. Test generation is unidirectional, i.e. it is done strictly in forward time, and flip-flops in the initial timeframe are never assigned a state that needs to be justified later. The algorithm saves both the good and the faulty machine states after finding a test to aid in subsequent test generation. The Previous State Information Problem, which has often been ignored by existing test generators, is presented and discussed in the paper. Experimental results are presented to demonstrate the effectiveness of the algorithm.", } @UNPUBLISHED{Kesh94:Packet, AUTHOR="S. Keshav", TITLE="Packet-pair flow control", INSTITUTION="AT\&T Bell Laboratories", ADDRESS="Murray Hill, New Jersey", PAGES=45, NOTE="submitted for publication", YEAR=1994, REFERENCES=67, KEYWORDS="flow control; fair queueing", ABSTRACT="This paper presents the packet-pair rate-based feedback flow control scheme. This scheme is designed for networks where individual connections do not reserve bandwidth and for the available bitrate (best effort) component of integrated networks. We assume a round-robin-like queue service discipline in the output queues of the network's switches, and propose a linear stochastic model for a single conversation in a network of such switches. These model motivates the packet-pair rate probing technique, which forms the basis for provably stable discrete and continuous time rate-based flow control. We present a novel state estimation scheme based on fuzzy logic. We then address several practical concerns: dealing with system startup, retransmission and timeout strategy, and dynamic setpoint probing. We present a finite state machine as well as source code for a model implementation. The dynamics of a single source, the interactions of multiple sources, and the behavior of packet-pair sources in a variety of benchmark scenarios are evaluated by means of detailed simulations. We close with some remarks about possible extensions to packet-pair, limitations of this work, and an outline of related work.", URL="ftp://ftp.research.att.com/dist/qos/pp.ps.Z", } @ARTICLE{Khoe9403:Coherent, AUTHOR="Giok-Djan Khoe", TITLE="Coherent Multicarrier Lightwave Technology for Flexible Capacity Networks", JOURNAL=ieeecm, VOLUME=32, NUMBER=3, PAGES="22-33", MONTH="Mar", YEAR=1994, REFERENCES=104, KEYWORDS="coherent multicarrier lightwave; flexible capacity networks; optical networks; WDM", ABSTRACT="Highly flexible and survivable networks can be built by allocating optical carriers of heterodyne systems.", } @ARTICLE{Kim9406:Multinet, AUTHOR="H. Kim", TITLE="Design and Performance of Multinet Switch: A Multistage {ATM} SwitchArchitecture with Partially Shared Buffers", JOURNAL=ieanep, ISBN="1063-6692", VOLUME=2, NUMBER=6, PAGES="571-580", YEAR=1994, REFERENCES=21, KEYWORDS="design; ATM; switching system", ABSTRACT="In this paper, a new ATM switch architecture is presented. The proposed Multinet switch is a self-routing multistage switch withpartially shared internal buffers capable of achieving 100\% throughput under uniform traffic. Although it provides incoming ATMcells with multiple paths, the cell sequence is maintained throughout the switch fabric thus eliminating the out-of-order cell sequence problem.", } @ARTICLE{Kim94:Hypercube, AUTHOR="Jaehyung Kim and Ch. Das", TITLE="Hypercube Communication Delay With Wormhole Routing", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="We present an analytical model for the performance evaluation of hypercube computers. This analysis is aimed at modeling a deadlock free wormhole routing scheme prevalent on second generation hypercube systems. Probability of blocking and average message delay are the two performance measures discussed here. We start with the communication traffic to find the probability of blocking. The traffic analysis can capture any message destination distribution. Next, we find the average message delay that consists of two parts. The first part is the actual message transfer delay between any source and destination nodes. The second part of the delay is due to the blocking caused by wormhole routing scheme. The analysis is also extended to virtual cut-through routing and random wormhole routing techniques. The validity of the model is demonstrated by comparing analytical results with those from simulation.", } @ARTICLE{Kimb94:Feature, AUTHOR="K. Kimbler and E. Kuisch and J. Muller", TITLE="Feature Interaction among Pan-European Services", JOURNAL="Feature Interactions in Telecommunications Systems, IOS Press", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="73-85", YEAR=1994, REFERENCES=8, KEYWORDS="IN; intelligent network", ABSTRACT="This paper presents results of the research on feature interaction performed in PEIN, a EURESCOM research project. The objective of the paper is to communicate the practical experience of the project with feature interactions and to discuss the technical approach used by the project.", } @ARTICLE{Kimb94:Use, AUTHOR="K. Kimbler and D. Sobirk", TITLE="Use Case Driven Analysis of Feature Interactions", JOURNAL="Feature Interactions in Telecommunications Systems, IOS Press", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="167-177", YEAR=1994, REFERENCES=13, KEYWORDS="IN; intelligent network", ABSTRACT="This paper introduces a user-oriented approach to feature interaction analysis. The presented method is an extension of the Use Case Driven Analysis technique originating from Object Oriented Software Engineering. It aims first at creating the Use-Case Model which described different possible ways of using the system services, and then building the Service Usage Model which shows dynamic relations among the services and their features from user", } @INPROCEEDINGS{Kirk94:Information, AUTHOR="Thomas Kirk and Alon Y. Levy and Rashmi Srivastava", TITLE="The information manifold", BOOKTITLE="CAIA Workshop on Intelligent Access to Online Digital Libraries", YEAR=1994, KEYWORDS="WWW; world-wide web; information retrieval; internet", } @ARTICLE{Kiul9411:Telecommunications, AUTHOR="Nalaila Kiula", TITLE="Telecommunications Development in Tanzania", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="36-37", MONTH="Nov", YEAR=1994, KEYWORDS="telecommunications development; tanzania", ABSTRACT="Tanzania has set a goal of one telephone per hundred people by the year 2000.", } @ARTICLE{Klue9409:Securing, AUTHOR="Henry M. Kluepfel", TITLE="Securing a Global Village and Its Resources", JOURNAL=ieeecm, VOLUME=32, NUMBER=9, PAGES="82-89", MONTH="Sep", YEAR=1994, KEYWORDS="global village; communications networks; security", ABSTRACT="In an international economy and social infrastructure that is growing more dependent everyday on its communications networks, more attention must be placed on the security and integrity of the components and interfaces of those critical structures.", } @PHDTHESIS{Koch94:Entwurf, AUTHOR="H. Kocher", TITLE="Entwurf und Implementierung einer Simulationsbibliothek unter Anwendung objektorientierter Methoden", SERIES="Bericht über verkehrstheoretische Arbeiten", SCHOOL="Universität Stuttgart, Elektrotechnik, IND", ADDRESS="Stuttgart, Germany", VOLUME=59, YEAR=1994, LANGUAGE="German", KEYWORDS="C++; discrete event simulation; object-oriented programming; simulation; simulation model; software engineering", } @INPROCEEDINGS{Koch94:Message, AUTHOR="Povl T. Koch and R. J. Fowler and Eric Jul", TITLE="Message-Driven Relaxed Consistency in a Software Distributed Shared Memory", BOOKTITLE=osdi, PAGES="75-85", YEAR=1994, ABSTRACT="Message-passing and distributed shared memory have their respective advantages and disadvantages in distributed parallel programming. We approach the problem of integrating both mechanisms into a single system by proposing a new {\em message-driven coherency} mechanism. Messages carrying explicit causality annotations are exchanged to trigger memory coherency actions. By adding annotations to standard message-based protocols, it is easy to construct efficient implementations of common synchronization and communication mechanisms. Because these are user-level messages, the set of available primitives is extended easily with language- or application-specific mechanisms. CarlOS, an experimental prototype for evaluating this approach, is derived from the lazy release consistent memory of TreadMarks. We describe the message-driven coherency memory model used in CarlOS, and we examine the performance of several applications.", } @ARTICLE{Koda9402:Customer, AUTHOR="T. Kodama and Takeo Fukuda", TITLE="Customer Premises Networks of the Future", JOURNAL=ieeecm, VOLUME=32, NUMBER=2, PAGES="96-98", MONTH="Feb", YEAR=1994, KEYWORDS="ATM; B-ISDN", ABSTRACT="B-ISDN based on ATM technologies is expected to offer enhanced and sophisticated services to users, but selecting a graceful migration path is critical.", } @BOOK{Kond94:Digital, AUTHOR="A. M. Kondoz", TITLE="Digital Speech -- Coding for Low Bit Rate Communication Systems", ISBN="0-471-95064-5", PUBLISHER="Wiley", ADDRESS="Chichester", YEAR=1994, KEYWORDS="digital signal processing; packet voice; speech detection; LPC; voice coding; speech coding; sampling; quantization; CELP; error control", ANNOTE="Includes CELP subroutines in C.", } @INPROCEEDINGS{Kori94:Description, AUTHOR="J. A. Korinthios and E. Sykas", TITLE="Description of the Addressing Mechanisms in the Universal Mobile Telecommunication System {(UMTS)} Access Network", BOOKTITLE="RACE Mobile Telecommunications Workshop", PAGES="400-404", YEAR=1994, REFERENCES=7, KEYWORDS="application; connectionless service; mobile radio; network; network layer; osi; signalling; access network", ABSTRACT="In this paper the addressing mechanisms in the UMTS Access Network (UAN) are described. A connectionless network layer service is used to provide a subnetwork independent signalling transport in the UAN. It also incorporates the necessary routing and addressing of MTs and Fixed Network Entities in all envisaged configurations and environments. Additionally, it can efficiently support addressing of applications and enables multiple Service Provi", } @INPROCEEDINGS{Kotz94:Disk, AUTHOR="David Kotz", TITLE="Disk-directed {I/O} for {MIMD} Multiprocessors", BOOKTITLE=osdi, PAGES="61-74", YEAR=1994, ABSTRACT="Many scientific applications that run on today's multiprocessors, such as weather forecasting and seismic analysis, are bottlenecked by their file-I/O needs. Even if the multiprocessor is configured with sufficient I/O hardware, the file-system software often fails to provide the available bandwidth to the application. Although libraries and enhanced file-system interfaces can make a significant improvement, we believe that fundamental changes are needed in the file-server software. We propose a new technique, disk-directed I/O, to allow the disk servers to determine the flow of data for maximum performance. Our simulations show that tremendous performance gains are possible. Indeed, disk-directed I/O provided consistent high periormance that was largely independent of data distribution, obtained up to 93\% of peak disk bandwidth, and was as much as 16 times faster than traditional parallel file systems.", } @ARTICLE{Kouv9401:ME, AUTHOR="D. D. Kouvatsos and N. Tabet-Aouel and S. G. Denazis", TITLE="{ME-based} approximations for general discrete-time queueing models", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=21, NUMBER="1-2", PAGES="81-109", YEAR=1994, REFERENCES=28, KEYWORDS="ATM; queueing system; discrete time; switching block; central buffer", ABSTRACT="Product-form approximations, based on the principle of maximum entropy (ME), are characterized for general multi-buffered and shared buffer discrete-time queueing models with arrivals first (AF) and departures first (DF) buffer management policies.", } @ARTICLE{Kova9404:Multi, AUTHOR="Kenneth d. Kovarik and Payam Maveddat", TITLE="Multi-Rate {ISDN}", JOURNAL=ieeecm, VOLUME=32, NUMBER=4, PAGES="48-55", MONTH="Apr", YEAR=1994, KEYWORDS="multi-rate isdn; ISDN; inverse multiplexing", ABSTRACT="A new technology provides a simple way of extending today's ISDN network services to meet the emerging requirements of high-bandwidth services such as videoconferencing, multimedia, and imaging.", } @ARTICLE{Kris9408:Programmable, AUTHOR="A. S. Krishnakumar and W. Fischer and K. Sabnany", TITLE="The Programmable Protocol {VLSI} Engin {(PROVE)}", JOURNAL="{IEEE} Transactions on Communications", VOLUME=42, NUMBER=8, PAGES="2630-42", YEAR=1994, KEYWORDS="prove; ask", } @PROCEEDINGS{Kugl94:Pan, TITLE="Towards a Pan-European Telecommunication Service Infrastructure", EDITOR="H. J. Kugler and A. Mullery and N. Niebert", SERIES="Lecture Notes in Computer Science", PUBLISHER="Springer-Verlag", ADDRESS="Germany", NUMBER=851, YEAR=1994, KEYWORDS="architecture; communication network; IN; intelligent network; network architecture; network management; security; service integration", } @ARTICLE{Kulk94:Local, AUTHOR="Sunil Suresh Kulkarni and S. K. Mitter and Tristan Richardson and J. Tsitsiklis", TITLE="Local Versus Non-Local Computation of Length of Digitized Curves", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="In this paper, we consider the problem of computing the length of a curve from digitized versions of the curve using parallel computation. Our aim is to study the inherent parallel computational complexity of this problem as a function of the digitization level. Precise formulations for the digitization, the parallel computation, and notions of local and nonlocal computations are given. We show that length cannot be computed locally from digitizations on rectangular tessellations. However, for a random tessellation and appropriate deterministic ones, we show that the length of straight line segments can be computed locally. Implications of our results for a method for image segmentation and a number open problems are discussed.", } @ARTICLE{Kung94:L, AUTHOR="Roberto Kung and X. Maitre", TITLE="L'architecture du réseau intelligent", JOURNAL="L'écho des Recherches", ADDRESS="Issy-les-Moulineaux, France", VOLUME=157, PAGES="5-14", YEAR=1994, LANGUAGE="French", KEYWORDS="architecture; IN; intelligent network; network architecture; overview", ABSTRACT="This article explains what an intelligent network (IN) is and reviews the progress achieved by FRANCE TELECOM on its implementation. According to ITU-T definition, ...", } @ARTICLE{Kuo94:Keyword, AUTHOR="Shihder Kuo and Oscar E. Agazzi", TITLE="Keyword Spotting in Poorly Printed Documents Using Pseudo {2D} Hidden Markov Models", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="An algorithm for robust machine recognition of keywords embedded in a poorly printed document is presented. For each keyword, two statistical models, named pseudo 2D Hidden Markov Models (HMMs), are created for representing the actual keyword and all the other extraneous words, respectively. Dynamic programming is then used for matching an unknown input word with the two models and making a maximum likelihood decision. Although the models are pseudo 2D in the sense that they are not fully connected two dimensional networks, they are shown to be general enough in characterizing printed words efficiently. These models facilitate a nice ``elastic matching'' property in both horizontal and vertical directions, which makes the recognizer to be not only independent of size and slant but also tolerant of highly deformed and noisy words. The system is evaluated on a synthetically created database which contains about 26,000 words. Currently, we achieve the recognition accuracy of 99\% when words in testing and training sets are of the same font size, and 96\% when they are in different sizes. In the latter case, the conventional 1D HMM achieves only 70\% accuracy rate.", } @ARTICLE{Kühn94:Common, AUTHOR="P. J. Kühn and C. D. Pack and R. A. Skoog", TITLE="Common Channel Signaling Networks: Past, Present, Future", JOURNAL=ieeejsac, VOLUME="12 NUMBER=3", YEAR=1994, REFERENCES=13, KEYWORDS="common channel; overview; signalling", ABSTRACT="JSAC Guest Editorial: The autors wish to provide a unification of this issue's papers by providing a clear context for them,", } @ARTICLE{LaMa9405:Two, AUTHOR="R. LaMaire and Dimitrios Serpanos", TITLE="Two-Dimensional Round-Robin Schedulers for Packet Switches with Multiple Input Queues", JOURNAL=ieanep, ISBN="1063-6692", VOLUME=2, NUMBER=5, PAGES="471-482", YEAR=1994, REFERENCES=11, KEYWORDS="round robin; scheduling; packet switching", ABSTRACT="The article presents a new scheduler, the two-dimensional round robin (2DRR) scheduler, that provides high throughput and fair access in a packet switch that uses multiple input queues. It considers an architecture in which each input port maintains a separate queue for each output.", } @INPROCEEDINGS{Ladk94:What, AUTHOR="P. B. Ladkin and S. Leue", TITLE="What do message sequence charts mean?", BOOKTITLE="Formal Description Techniques VI, IFIP Transactions C, 6th International Conference on Formal Description Techniques", EDITOR="R. L. Tenney and P. D. Amer and M. Ü. Uyar", PUBLISHER="North-Holland", PAGES="301-316", YEAR=1994, } @INPROCEEDINGS{Lamp94:EXtended, AUTHOR="B. Lamparter and W. Effelsberg", TITLE="eXtended Color Cell Compression -- A Runtime-efficient Compression Scheme for Software Video", BOOKTITLE="2nd International Workshop on Advanced Teleservices and High Speed Communication Architectures", YEAR=1994, URL="http://www.informatik.uni-mannheim.de/informatik/publications/index.publications.html", } @BOOK{Lamp94:LaTeX, AUTHOR="Leslie Lamport", TITLE="LaTeX: a document preparation system", EDITION=2, ISBN="0-201-52983-1", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1994, KEYWORDS="latex; electronic publishing; tex; latex2e; computerized typeseting", ANNOTE="Describes new version of LaTeX.", } @ARTICLE{Laru94:Loop, AUTHOR="J. R. Larus", TITLE="Loop-Level Parallelism in Numeric and Symbolic Programs", JOURNAL=ieeepds, YEAR=1994, ABSTRACT="This paper describes a new technique for estimating and understanding the speed improvement that can result from executing a program on a parallel computer. The technique requires no additional programming and minimal effort by a program's author. The analysis begins by tracing a sequential program. A parallelism analyzer (pp) uses information from the trace to simulate parallel execution of the program. In addition to predicting parallel performance, pp measures many aspects of a program's dynamic behavior. This paper presents measurements of six substantial programs. These results indicate that the three symbolic (nonnumeric) programs differ substantially from the numeric programs and, as a consequence, cannot be automatically parallelized with the same compilation techniques.", } @ARTICLE{Lato94:Successive, AUTHOR="G. Latouche", TITLE="On Successive Packet Losses in Systems with Periodic Input Traffic", JOURNAL=ieeecom, PAGES="4 pages", YEAR=1994, ABSTRACT="In ATM packet networks, packets may be lost due to a temporary buffer overflow. Under certain conditions, it is possible that a succession of packets are lost, which belong to the same communication. The object of this note is to analyze conditions under which this phenomenon may occur.", } @ARTICLE{Laue9403:Architectures, AUTHOR="G. Lauer", TITLE="{IN} Architectures for Implementing Universal Personal Telecommunications", JOURNAL=ieeenet, VOLUME=8, NUMBER=2, PAGES="6-16", MONTH="March/April", YEAR=1994, REFERENCES=12, KEYWORDS="architecture; IN; intelligent network", ABSTRACT="Alternative architectures provide UPT services to wireline users with different levels of privacy, complexity, and performance.", } @ARTICLE{Law9403:Simulation, AUTHOR="A. M. Law and M. G. McComas", TITLE="Simulation Software for Communications Networks: The State of the Art", JOURNAL=ieeecm, VOLUME=32, NUMBER=3, PAGES="44-51", MONTH="Mar", YEAR=1994, REFERENCES=15, KEYWORDS="simulation software; communications networks; simulation; tools", ABSTRACT="In the last five to ten years, simulation has been used with greater frequency to analyze communications networks, due in part to the increased number of networks in existence and to their greater complexity.", } @INPROCEEDINGS{Lawn94:Call, AUTHOR="D. Lawniczak and J. Dahlström", TITLE="Evaluation of Call Set-up and Location Management Procedures in {UMTS}", BOOKTITLE="RACE Mobile Telecommunications Workshop", PAGES="411-415", YEAR=1994, REFERENCES=8, KEYWORDS="evaluation; failure; IN; mobile radio; performance evaluation; simulation", ABSTRACT="This paper presents results from simulation case studies of call handling and location management procedures in UMTS. The simulation work, which focuses on the performance of the fixed network parts of UMTS, has been performed by the workpackage NESSY2 within the MONET project. In particular, different implementation options for the relationships between the service control, call control and bearer control of the call set-up procedure are inves", } @ARTICLE{Laza94:Scalable, AUTHOR="Aurel A. Lazar and K. H. Tseng and Koon Seng Lim and W. Choe", TITLE="A Scalable and Reusable Emulator for Evaluating the Performance of {SS7} Networks", JOURNAL=ieeejsac, VOLUME="12 NUMBER=3", PAGES="395-404", YEAR=1994, REFERENCES=17, KEYWORDS="performance evaluation; signalling; signalling protocol", ABSTRACT="A scalable and reusable emulator was designed and implemented for studying the behavior of SS7 networks.", } @ARTICLE{Lee94:Bends, AUTHOR="D. Lee and C.-L. Yang and C. K. Wong", TITLE="On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="In this paper, we consider problems of finding assorted rectilinear paths among rectilinear obstacles in two-layer interconnection model according to the number of bends and the I-layer distance (y-distance). Using a horizontal wave-front approach, optimal $\theta(e \log e)$ time algorithms are presented to find the shortest path and the minimum-bend path using linear space, and to find the shortest minimum-bend path and the minimum-bend shortest path using $O(e \log e)$ space, where $e$ is the number of obstacle edges. By the same approach, we also derive an algorithm for finding a shortest two-layer distance ($xy$-distance) minimum-bend path in optimal $\theta (e \log e)$ time using $O(e \log e)$ space.", } @ARTICLE{Lee94:Efficient, AUTHOR="Duan-Shin. Lee and Young-Chon Kim and Gaurav Patel", TITLE="Efficient Signature File Methods for Text Retrieval", JOURNAL=ieeekde, YEAR=1994, ABSTRACT="Signature files have been studied extensively as an access method for textual databases. Many approaches have been proposed for searching signatures files efficiently. However, different methods make different assumptions and use different performance measures, making it difficult to compare their performance. In this paper, we study three basic methods proposed in the literature, namely, the indexed descriptor file, the two-level superimposed coding scheme, and the partitioned signature file approach. The contribution of this paper is two-fold. First, we present a uniform analytical performance model so that the methods can be compared fairly and consistently. The analysis shows that the two-level superimposed coding scheme, if stored in a transposed file, has the best performance. Second, we extend the two-level superimposed coding method into a multi-level superimposed coding method, we obtain the optimal number of levels for the multi-level method and show that for databases with reasonable size the optimal value is much larger than 2, which is assumed in the two-level method. The accuracy of the analytical formula is demonstrated by simulation.", } @ARTICLE{Lee94:Framework, AUTHOR="K. Y. Lee and William Jr. Mansfield and Amit Sheth", TITLE="A Framework for Controlling Cooperative Agents", JOURNAL=ieeecomp, YEAR=1994, ABSTRACT="Supporting advanced applications involving multiple users in a distributed computing environment consisting of heterogeneous and autonomous resources is a challenging endeavor. Examples of evolving applications of this type include computer supported cooperative work, interactive TV, and advanced telecommunication services such as multimedia teleconferencing. A software paradigm that can support such an application in a flexible and reliable manner is that of a distributed cooperative task in which multiple agents cooperate to achieve the application objective. A critical issue in such a paradigm is that of controlling interactions among the cooperating agents. In particular, the agents must cooperate to meet the application objectives and react to unpredictable user interventions and system failures. We propose a software system called the ITX system to define, observe, and control complex interactions among cooperating agents. This system supports both adaptive cooperation among agents and reliable operations on shared objects (representing cooperative objectives, shared data structures and resources) that are stored in heterogeneous and autonomous component systems. We use the example of a multimedia teleconferencing service to illustrate many important features and advantages of the ITX system. cooperative task, distributed cooperating agents, interactive transactions, shared cooperative objective, shared objects, fixed-point criterion, interative transaction execution, multimedia teleconferencing", } @INPROCEEDINGS{Lee94:HiPEC, AUTHOR="C.-H. Lee and M.-S. Chen and R.-F. Chang", TITLE="HiPEC: High Performance External Virtual Memory Caching", BOOKTITLE=osdi, PAGES="153-164", YEAR=1994, ABSTRACT="Traditional operating systems use a fixed LRU-like page replacement policy and centralized frame pool that cannot properly serve all types of memory access patterns of various applications. As a result, many memory-intensive applications, such as databases, multimedia applications and scientific simulators, induce excessive page faults and page replacement when running on top of existing operating systems. \par This paper presents a High Performance External virtual memory Caching mechanism (HiPEC) to provide applications with their own specific page replacement management. The user specific policy, programmed in the HiPEC command set, is stored in user address space. When a page fault occurs, the kernel fetches and interprets the corresponding policy commands to perform the user-specific page replacement management. Experimental results show that HiPEC induces little overhead and can significantly improve performance for memory-intensive applications.", } @BOOK{Lehm94:Schaltungsdesign, AUTHOR="G. Lehmann and B. Wunder and M. Selz", TITLE="Schaltungsdesign mit {VHDL:} Synthese, Simulation und Dokumentationdigitaler Schaltungen", PUBLISHER="Franzis", ADDRESS="Germany", YEAR=1994, LANGUAGE="German", KEYWORDS="hardware design language", } @INPROCEEDINGS{Leue94:Enhancing, AUTHOR="S. Leue and Ph. Oechslin", TITLE="Enhancing Integrated Layer Processing using Common Case Anticipation and Data Dependence Analysis, extended abstract", BOOKTITLE="First International Workshop on High Performance Protocol Architectures", EDITOR="Jon Crowcroft and C. Huitema", YEAR=1994, } @TECHREPORT{Leue94:Formal, AUTHOR="S. Leue and Ph. Oechslin", TITLE="A formal approach to optimized parallel protocol implementation", INSTITUTION="University of Berne, Institute for Informatics", YEAR=1994, } @INPROCEEDINGS{Leue94:Formalizations, AUTHOR="S. Leue and Ph. Oechslin", TITLE="Formalizations and Algorithms for Optimized Parallel Protocol Implementation", BOOKTITLE=icnp, PUBLISHER="{IEEE} Computer Society Press", PAGES="178-185", YEAR=1994, } @INPROCEEDINGS{Leue94:SDL, AUTHOR="S. Leue and Ph. Oechslin", TITLE="From {SDL} specifications to optimized parallel protocol implementations, extended abstract.", BOOKTITLE="4th International {IFIP} Workshop on Protocols for High Speed Networks", EDITOR="M. R. Ito and G. W. Neufeld", PUBLISHER="Chapman \& Hall", YEAR=1994, } @ARTICLE{Li94:AMS, AUTHOR="Jinyang Li and James S. K. Ang and Xuejun Tong and Michel Tueni", TITLE="{AMS:} A Declarative Formalism for Hierarchical Representation of Procedural Knowledge", JOURNAL=ieeekde, YEAR=1994, ABSTRACT="This paper presents a domain-independent formalism, called Activity Manager System (or AMS), for the explicit, hierarchical representation of procedural knowledge. The formalism is able to: 1) Describe procedures at a reasonable level of complexity and completeness; 2) Generate dynamically procedures at different levels of abstraction; 3) Organize knowledge hierarchies by means of abstract entities; and 4) Allow knowledge reusability at different levels of abstraction. AMS uses the notions of Activity, Activity Network, State and Memory Organization Packet for Activities (or MOPA) to represent abstractions, and allows the user to model an application in a hierarchical manner. The advantages and limitations of AMS are also discussed.", } @INPROCEEDINGS{Li94:Extended, AUTHOR="Yuheng Li and S. Andresen", TITLE="An Extended Packet Reservation Multiple Access Protocol For Wireless Multimedia Commuication", BOOKTITLE=pmrc, ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", PAGES="1254-1259", YEAR=1994, REFERENCES=9, KEYWORDS="mobile radio; multiple access; prma", ABSTRACT="We present an Extended Packet Reservation Multiple Access (EPRMA) protocol for wireless multimedia services. It supports multi-bitrate reservation, dynamic slot and frequency carrier association, and effective contention mechanism. The improved link utilisatin is achieved by burst traffic statistically multiplexed on a wide bandwidth. Simulatin study shows the significant increase in trunking efficiency. Principles of traffic control and resour", } @TECHREPORT{Liaw94:Straw, AUTHOR="FongChing Liaw", TITLE="A straw man proposal for {ATM} Group Multicast Routing and Signaling Protocol: Architecture Overview", TYPE="Contribution", INSTITUTION="ATM Forum", NUMBER="94-0995", YEAR=1994, KEYWORDS="ATM; multicast", URL="ftp://ftp.atmforum.org", } @ARTICLE{Lida9401:Domestic, AUTHOR="Tokuo Lida", TITLE="Domestic Standards in a Changing World", JOURNAL=ieeecm, VOLUME=32, NUMBER=1, PAGES="46-51", MONTH="Jan", YEAR=1994, KEYWORDS="domestic standards; interconnectivity", ABSTRACT="As users demand ever-greater diversity and worldwide interconnectivity, domestic and glob- al standards must become compatible.", } @ARTICLE{Lim94:Exact1, AUTHOR="Koon Seng Lim and R. H. Deng and K. Ranai", TITLE="Exact and approximate models to obtain average throughput of the {FDDI} {MAC} protocol - Part 1: Symmetric systems", JOURNAL=comcom, VOLUME=17, NUMBER=2, PAGES="83-93", YEAR=1994, REFERENCES=13, KEYWORDS="FDDI; HSLAN; LAN; MAN; throughput", ABSTRACT="We present an alternative method for computing the exact mean throughput of a symmetric FDDI network with both asynchronous andsynchronous transmissions using a simple mean value approach. Closed form solutions for the exact mean throughput and token rotation time of a single priority symmetric network are derived.", } @ARTICLE{Lim94:Exact2, AUTHOR="Koon Seng Lim and R. H. Deng and K. Ranai", TITLE="Exact and approximate models to obtain average throughput of the {FDDI} {MAC} protocol - Part {II:} asymmetric systems", JOURNAL=comcom, VOLUME=17, NUMBER=4, PAGES="251-256", YEAR=1994, REFERENCES=4, KEYWORDS="analysis; FDDI; throughput; throughput analysis", ABSTRACT="The complexity of the FDDI MAC protocol has made its exact analysis extremely difficult. More often than not, statistical approaches to the problem have produced complex approximations which are both time consuming to compare and are restricted to only very simple network configurations. In the second part of this two-part paper, we propose an alternative approach for computing the the approximate mean throughput of a multiple priority asymmetric FDDI", } @ARTICLE{Lin94:Building, AUTHOR="F. Lin and Y. Lin", TITLE="A Building Block Approach to Detecting and Resolving Feature Interactions", JOURNAL="Feature Interactions in Telecommunications Systems, IOS Press", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="86-191", YEAR=1994, REFERENCES=22, KEYWORDS="IN; intelligent network", ABSTRACT="This paper presents a methodology we envision for detecting and resolving feature interactions. The methodology is based on a building block approach, in which features and their operating contexts are building blocks that can be composed in any combination to detect an resolve their interactions. This methodology is applicable to the phases in the software life cycle that address the creation of new features such as requirements, specification", } @ARTICLE{Lin94:Optimal, AUTHOR="T.-P. Lin and Kang G. Shin", TITLE="An Optimal Retry Policy Based on Fault Classification", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="An optimal (in some sense) retry policy in a computer system is usually derived under an unrealistic assumption that fault characteristics are known a priori and remain unchanged throughout the mission lifetime. In such a case, the optimal retry period depends only upon the system's status at the time of fault detection. We propose to remedy this deficiency by formulating the optimal retry problem as a Bayesian decision problem where not only the time of fault detection but also the results of earlier retries are used to estimate the current fault characteristics. Previous knowledge about fault characteristics is represented by the prior distributions of fault--related parameters which are updated whenever new samples are obtained from retry and detection mechanisms. A new fault classification scheme is proposed to assign a temporal fault type (i.e., permanent or intermittent or transient) to each detected fault so that the corresponding fault parameters can be estimated. The estimated fault parameters are then used to derive the optimal retry period that minimizes the mean task completion time. Efficient algorithms are developed to determine the optimal retry period on-line upon detection of each fault. To evaluate the goodness of the proposed retry policy, it is compared with, and is always found to outperform, a number of fixed-retry-period policies.", } @TECHREPORT{Lisp94:Unfolding, AUTHOR="Björn Lisper", TITLE="Unfolding of Programs with Nondeterminism", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-02", YEAR=1994, ABSTRACT="In Lisper: 'Total Unfolding: Theory and Applications' some results were proved regarding properties of unfolding of purely functional programs. Especially, a theorem was shown that relates the termination of symbolic evaluation of a 'less instantiated' term relative to the termination of a 'more instantiated' term. An application is partial evaluation, where unfolding of function definitions is frequently performed to enable further simplifications of the resulting specialized program. The unfolding must then be kept under control to ensure that the partial evaluation terminates. In this paper, we extend the termination result from purely functional programs programs with nondeterministic operations. We give an operational semantics where the behaviour of operators is defined through rewrite rules: nondeterminism then occurs when the resulting term rewriting system is nonconfluent. For the confluent part, the previous termination results carry over. It is, however, not guaranteed in general that the resulting unfolded program has the same semantics as the original program. We give conditions on the rewrite rules that guarantee that both versions have the same semantics, and we show that they apply to a nontrivial class of nondeterministic languages.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-02--SE.ps.Z", } @INPROCEEDINGS{Lore94:Verteilte, AUTHOR="H. Lorek", TITLE="Verteilte Simulation individuen-orientierter biologischer Modelle", BOOKTITLE="Workshop über parallele und verteile Simulation - Bericht Nr. AIS 21", ADDRESS="Oldenburg, Germany", PAGES="32-39", YEAR=1994, LANGUAGE="German", REFERENCES=17, KEYWORDS="distributed simulation", ABSTRACT="Im ersten Teil der Arbeit werden individuen-orientierte Modelle genauer betrachtet und gegen über klassischen Modellierungstechniken abgegrenzt. Eine naheliegende Art der verteilten Simulation individuen-orienteirter Modelle wird angegeben, sowie grundsätzliche Probleme dargestellt. Im zweiten Teil dieser Arbeit wird ein konkretes individuen-orientiertes Modell eines Fischschwarms und seine verteilte Implementierung vorgestellt. Ergebnisse von L", } @ARTICLE{Lun94:Pipeline, AUTHOR="Daniel Pak-Kong Lun and Wan-Chi SIU", TITLE="A Pipeline Design for the Realization of the Prime Factor Algorithm Using the Extended Diagonal Structure", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="In this paper, an efficient pipeline architecture is proposed for the realization of the Prime Factor Algorithm (PFA) for digital signal processing. By using the extended diagonal feature of the Chinese Remainder Theorem (CRT) mapping, we show that the input data sequence can be directly loaded into a multi-dimensional array for the PFA computation without any permutation. Short length modules are modified such that an in-place and in-order computation is allowed. The computed results can then be directly restored back to the memory array without the need for further reordering. More importantly, the CRT mapping can also be used to represent the output data, hence we can utilize the extended diagonal feature of the CRT mapping to directly send the computed results to the outside world. As compared to the previous approaches, the present approach requires no shifting or rotation during the data loading and retrieval processes. In the case of multi-dimensional PFA computation, it does not require the computation to be split up into a number of two-dimensional computations. Hence the overhead required for data loading and retrieval in each two-dimensional stage can be saved.", } @TECHREPORT{Lyle9408:Existence, AUTHOR="Bryan Lyles", TITLE="Existence Proof of {ABR} Mechanism", TYPE="Research Report", INSTITUTION="ITU Telecommunication", NUMBER="8/13", YEAR=1994, ABSTRACT="This document contains a mechanism which is presented as an existence proof for ABR service. It is being forwarded to the November meeting of Study Group 13, in order to facilitate discussions about the desireability of ABR service. This is not a proposal intended as the basis for specific recomendation text.", } @ARTICLE{MacN9402:RESearch, AUTHOR="E. A. MacNair and R. L. Gordon", TITLE="An Introduction to the {RESearch} Queueing Package for Modeling Contention Systems", JOURNAL="Simulation Digest - ACM \& IEEE Computer Society", VOLUME=24, NUMBER=2, PAGES="40-70", YEAR=1994, REFERENCES=16, KEYWORDS="contention; queueing network; RESQ", ABSTRACT="The RESearch Queueing Package (RESQ) and the RESearch Queueing Modeling Environment (RESQME) form a system for constructing, sol ving and analyzing extended queueing network models.", } @INPROCEEDINGS{Maca94:Formal, AUTHOR="M. Mac an Airchinnigh and D. Belsnes and G. O'Regan", TITLE="Formal Methods \& Service Specification", BOOKTITLE="Towards a Pan-European Telecommunication Service Infrastructure - IS\&N Second International Conference", PAGES="563-572", YEAR=1994, REFERENCES=19, KEYWORDS="formal technique; IN; intelligent network", ABSTRACT="In this paper we begin by establishing our universe of discourse in order to de-mystify the term 'formal methods'. Then, recognising the real need to justify yet again the use of 'formal methods' in industry, we set forth those principles by which management may be guided. Finally, we indicate exactly in what manner 'formal methods' may be embedded within a system development process model. For definiteness, our arguments are presented within t", } @TECHREPORT{Magn94:Efficient, AUTHOR="Peter S. Magnusson and Anders Landin and Erik Hagersten", TITLE="Efficient Software Synchronization on Large Cache Coherent Multiprocessors", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-07", YEAR=1994, ABSTRACT="Large-scale shared-memory multiprocessors typically have long latencies for remote data accesses. A key issue for execution performance of many common applications is the synchronization cost. The communication scalability of synchronization has been improved by the introduction of queue-based spin-locks instead of Test \& (Test \& Set). For architectures with long access latencies for global data, attention should also be paid to the number of global accesses that are involved in synchronization. We present a method to characterize the performance of proposed queue lock algorithms, and apply it to previously published algorithms. We also present two new queue locks, the LH lock and the M lock. We compare the locks in terms of performance, memory requirements, code size, and required hardware support. The LH lock is the simplest of all the locks, yet requires only an atomic swap operation. The M lock is superior in terms of global accesses needed to perform synchronization and still competitive in all other criteria. We conclude that the M lock is the best overall queue lock for the class of architectures studied.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-07--SE.ps.Z", } @ARTICLE{Mahm94:Multilevel, AUTHOR="Masud Mahmud", TITLE="Performance Analysis of Multilevel Bus Networks for Hierarchical Multiprocessors", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="A multiple bus system provides more bandwidth and a high degree of fault tolerance than a single bus system. But such a system becomes very expensive for a large number of processors and memory modules, due to the requirement of too many connections (switches). Lang proposed a different bus-based system [1], known as the partial multiple bus system, which requires less number of connections than multiple bus system, but with a slight degradation in system performance. This paper presents a new type of bus-based system, called the multilevel bus system. Such a bus architecture can be used to design hierarchical multiprocessors. This bus-based system requires significantly less number of connections than multiple and partial multiple bus systems. This system is very cost effective, compared to multiple and partial multiple bus systems, when there exists some locality in computations. Analytical and simulation models have been developed to determine the performance of both synchronous and asynchronous multilevel bus systems. The results obtained from the analysis show that a multilevel bus system performs fairly close to other bus-based systems for the hierarchical reference (HR) model. In the HR model a processor accesses its nearest memory modules more frequently than other memory modules.", } @ARTICLE{Mali94:Beginners, AUTHOR="L. Maliniak", TITLE="A Beginners's Guide To {VHDL}", JOURNAL="Electronic design", ADDRESS="Great Britain", VOLUME="42 NUMBER=21", PAGES="75-82", YEAR=1994, KEYWORDS="hardware design language", ABSTRACT="Learn the basics about VHDL and find out where to get more information.", } @ARTICLE{Man94:Detection, AUTHOR="Yael Man and Isak Gath", TITLE="Detection and Separation of Ring-Shaped Clusters Using Fuzzy Clustering", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="A new fuzzy clustering algorithm, designed to detect and characterize ring-shaped clusters and combinations of ring-shaped and compact spherical clusters, has been developed. This FKR (Fuzzy K-Rings) algorithm includes automatic search for proper initial conditions in the two cases of concentric and excentric (intersected) combinations of clusters. Validity criteria based on Total Fuzzy Area and Fuzzy Density are used to estimate the optimal number of substructures in the data set. The FKR algorithm has been tested on a variety of simulated combinations of ring-shaped and compact spherical clusters, and its performance proved to be very good both in identifying the input shapes, and in recovering the input parameters. Application of the FKR algorithm to an MRI image of the heart's left ventricle was aimed to investigate the possibility of utilizing this algorithm as an aid in image processing.", } @INPROCEEDINGS{Manb94:Glimpse, AUTHOR="Udi Manber and Shiquan Wu", TITLE="{GLIMPSE:} a tool to search through entire file systems", BOOKTITLE=usenixw, NOTE="also Department of Computer Science, University of Arizona, Technical Report TR 93-34", YEAR=1994, REFERENCES=10, KEYWORDS="file system; searching; agrep; index", ABSTRACT="GLIMPSE, which stands for GLobal IMPlicit SEarch, provides indexing and query schemes for file systems. The novelty of glimpse is that it uses a very small index -- in most cases 2-4\% of the size of the text -- and still allows very flexible full-text retrieval including Boolean queries, approximate matching (i.e., allowing misspelling) and even searching for regular expressions. In a sense, glimpse extends agrep to entire file systems, while preserving most of its functionality and simplicity. Query times are typically slower than with inverted indexes, but they are still fast enough for many applications. For example, it took 5 seconds of CPU time to find all 19 occurrences of Usenix AND Winter in a file system containing 69MB of text spanning 4300 files. Glimpse is particularly designed for personal information, such as one's own file system. The main characteristic of personal information is that it is non-uniform and includes many types of documents. An information retrieval system for personal information should support many types of queries, flexible interaction, low overhead, and customization. All these are important features of glimpse.", URL="ftp://cs.arizona.edu/glimpse/glimpse.ps.Z, ftp://cs.arizona.edu/reports/1993/TR93-34.ps.Z", } @ARTICLE{Mark94:ATM, AUTHOR="D. R. Marks", TITLE="{ATM} From A to {Z:} A Definitive Glossary for Enterprise Network Managers", JOURNAL=datacommunications, PAGES="113-122", YEAR=1994, KEYWORDS="ATM", } @BOOK{Mark94:Fuzzy, AUTHOR="R. J. Marks", TITLE="Fuzzy Logic Technology and Applications", PUBLISHER="IEEE", YEAR=1994, KEYWORDS="communication; fuzzy heuristics; fuzzy statistics; image transfer; neural network", ABSTRACT="... contains application-oriented material from IEEE conferences and journals ...", } @INPROCEEDINGS{Mark94:Modeling, AUTHOR="J. W. Mark", TITLE="Performance Modeling and Control of {ATM} Networks", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="87-110", YEAR=1994, } @INPROCEEDINGS{Mark94:Related, AUTHOR="J. G. Markoulidakis and F. Baumann", TITLE="Evaluation Studies related to Location Management", BOOKTITLE="RACE Mobile Telecommunications Workshop", PAGES="416-417", YEAR=1994, KEYWORDS="evaluation; performance evaluation; planning; QOS; simulation; traffic model", } @UNPUBLISHED{Mars94:ATM, AUTHOR="Marco {Ajmone Marsan} and A. Bianco and T. V. Do and L. Jereb and Renato {Lo Cigno} and Maurizio M. Munafo'", TITLE="{ATM} Simulation with {CLASS}", INSTITUTION="Dipartimento di Elettronica, Politecnico di Torino", ADDRESS="Corso Duca degli Abruzzi 24, 10129 Torino, Italy", NOTE="contract n. H-9112-0353 PHARE-ACCORD", YEAR=1994, REFERENCES=23, KEYWORDS="connectionless services; ATM; connectionless atm services simulator; performance analysis; shaping and policing", ABSTRACT="The paper describes an efficient software tool for the analysis of the qulity of connectionless services provided by ATM networks. The Tool is named CLASS for ConnectionLess ATM Services Simulator. CLASS is a time-driven, slotted, synchronous simulatior, entirely written in standard C language. CLASS allows the performance analysis of ATM networks adopting the viewpoint of both the end-user, and the network manager; the measured performance parameters include the cell and message loss probabilities and the cell and message delay jitters. The investigation of the impact of shaping and policing techniques, and the use of connectionless servers on the network performance is also supported. With CLASS, the network synthetic workload can be modeled choosing from a variety of traffic generators ranging from simple poisson traffic sources to sources modeling the traffic produced when higher level protocols, like TCP, access the ATM services.", } @BOOK{Mars94:SQL, AUTHOR="J. Marsch and J. Fritze", TITLE="{SQL} - Eine praxisorientierte Einführung", ISBN="3-528-15210-9", PUBLISHER="Vieweg", ADDRESS="Germany", YEAR=1994, LANGUAGE="German", KEYWORDS="database; overview; sql", ABSTRACT="Die praktischen Seiten von SQL in der für den Anwender und Entwickler notwendigen Tiefe darzustellen, ist Ziel dieses Buches mit folgenden Themenschwerpunkten: - Entwicklung von Datenbanksystemen; - Entwurf relationaler Datenbanken; - Vom Entwurf zur Datenbank; - Datenbankabfragen; Transaktionsprogrammierung; - Embedded SQL; - Benutzersichten (Views); - DCL-Befehle.", } @ARTICLE{Mats9403:Twisted, AUTHOR="M. Matsumoto", TITLE="Twisted {GFSR} Generators {II}", JOURNAL="ACM Transactions on Modeling and Computing Simulation", VOLUME=4, NUMBER=3, PAGES="266-254", YEAR=1994, REFERENCES=9, KEYWORDS="distribution; random number", ABSTRACT="The article introduces und analyzes a new twisted GFSR generatorvariant.", } @ARTICLE{Matu9401:CITEL, AUTHOR="Miguel Angel Matute", TITLE="{CITEL:} Formulating Telecommunications in the Americas", JOURNAL=ieeecm, VOLUME=32, NUMBER=1, PAGES="38-39", MONTH="Jan", YEAR=1994, KEYWORDS="CITEL; telecommunications; americas", ABSTRACT="The Inter-American Telecommunications Commission must help diverse countries interconnect their national networks.", } @ARTICLE{McDo94:Public, AUTHOR="John McDonald", TITLE="Public Network Integrity - Avoiding a Crisis in Trust", JOURNAL=ieeejsac, VOLUME="12 NUMBER=1", PAGES="5-12", YEAR=1994, REFERENCES=38, KEYWORDS="fault tolerance; network stability; public network; self healing network", ABSTRACT="Examples of fatal network failures Definition of integrity, reliability, quality, availability Reasons for failures: increasing bandwidth, complexity, capacity, concentrated common channel signalling; errors in thinking (for example not only single, but multiple errors have to be considered) Availability objectives (and example values) ULE (User Lost Erlang) as a proposal for a mean to measure network failures", } @TECHREPORT{Meye94:MHEG, AUTHOR="Thomas Meyer--Boudnik", TITLE="{MHEG:} Ein Austauschformat für interaktive Multimedia--Präsentationen", INSTITUTION={Praktische Informatik IV, Universit\"{a}t Mannhei}, NUMBER="TR-94-002", YEAR=1994, ABSTRACT="Die logische Struktur von interaktiven Multimedia-Präsentationen wird vergleichbar mit der Struktur eines Textdokumentes durch die Definition von Beziehungen zwischen den einzelnen Inhalten bestimmt. Je nach Anwendungsgebiet kann ein Autor heute aus einer Vielzahl von Sprachen zur Beschreibung dieser Strukturinformationen in Form eines Skriptes wählen. Die Wiedergabe einer Multimedia-Präsentation erfolgt stets elektronisch, meist durch die Abarbeitung des Skriptes mit Hilfe einer entsprechenden Laufzeitumgebung. Die verschiedenen Sprachen, die unterschiedlichen Laufzeitumgebungen und die Heterogenität der Multimedia-Systeme behindern somit einen sytemübergreifenden Austausch. Dieser Bericht beschreibt den aufkommenden MHEG-Standard, der ein Austauschformat für interaktive Multimedia-Präsentationen normt. Mit einer systemunabhängigen Kodierung der Strukturinformationen schafft MHEG eine neues Format, das die Speicherung, den Austausch und die Wiedergabe von multimedialen Informationen erleichtern wird. Da dieses Format eine endgültige, d.h. ausführbare Darstellung repräsentiert, ist eine Weiterverarbeitung der Strukturinformationen nicht vorgesehen.", URL="ftp://pi4.informatik.uni-mannheim.de/pub/techreports/tr-94-002.ps.gz", } @ARTICLE{Miki9402:Service, AUTHOR="T. Miki", TITLE="Toward the Service-Rich Era", JOURNAL=ieeecm, VOLUME=32, NUMBER=2, PAGES="34-39", MONTH="Feb", YEAR=1994, KEYWORDS="optical acces networks; FTTH", ABSTRACT="To remain viable, telecommunication earners must construct sophisticated optical access networks based on FTTH.", } @ARTICLE{Miss94:DS, AUTHOR="M. Missiroli and Flavio Muratore and Valerio Palestini and Franco Pattini", TITLE="{DS-CDMA} access for mobile communications: performance and comparisons with other techniques", JOURNAL="CSELT Technical reports", ADDRESS="Italy", VOLUME="12 NUMBER=3", PAGES="361-377", YEAR=1994, REFERENCES=14, KEYWORDS="cdma; mobile radio; tdma", ABSTRACT="This paper investigates the potential application of a DS-CDMA technique in digital mobile radio systems. Spread spectrum techniques are among the candidate access methods for third generation systems such as FPLMTS or UMTS.", } @INPROCEEDINGS{Mitt94:Dynamic, AUTHOR="H. Mitts", TITLE="Dynamic allocation of functions to nodes", BOOKTITLE="RACE Mobile Telecommunications Workshop", PAGES="314-318", YEAR=1994, REFERENCES=7, KEYWORDS="distributed processing; mobile radio; network architecture; access network", ABSTRACT="... This paper prposes an approach based on location transparent distributed processing to support the different allocations of control functions.", } @ARTICLE{Moch9402:Technologies, AUTHOR="Yukou Mochida", TITLE="Technologies for Local-Access Fibering", JOURNAL=ieeecm, VOLUME=32, NUMBER=2, PAGES="64-73", MONTH="Feb", YEAR=1994, KEYWORDS="local-access systems; passive-optical networks", ABSTRACT="Passive-optical networks and other technologies signal a new age for fiber in local-access systems.", } @ARTICLE{Moha94:Two, AUTHOR="S. Mohan and Raj Jain", TITLE="Two user location strategies for personal communication services", JOURNAL="IEEE Personal Communications", VOLUME=1, NUMBER=1, PAGES="42-50", MONTH="First Quarter", YEAR=1994, REFERENCES=13, KEYWORDS="PCS; mobility; user location", } @PROCEEDINGS{Monj94:Rechnergestützter, TITLE="Rechnergestützter Entwurf und Architektur mikroelektronischer Systeme", EDITOR="D. Monjau", ADDRESS="Oberwiesenthal, Germany", NOTE="3. GI/ITG/GME-Fachtagung", YEAR=1994, LANGUAGE="German", KEYWORDS="architecture; microprocessor; multiprocessor; neural network; signal processing; test; vlsi", } @TECHREPORT{Mont94:Scout, AUTHOR="A. Montz and David Mosberger and S. O'Mealley and L. L. Peterson and T. Proebsting and John Hartman", TITLE="Scout: A Communications-Oriented Operationg System", HOWPUBLISHED="white paper", INSTITUTION="Department of Computer Science, The University of Arizona", NUMBER="94-20", YEAR=1994, KEYWORDS="scout; ILP; USC; UPC; gnu; gcc", } @UNPUBLISHED{More94:HDCC, AUTHOR="Henry Moreton and J. SMITH", TITLE="{HDCC} -- a software based compression algorithm for video conferencing", INSTITUTION="Silicon Graphics Computer Systems", ADDRESS="Mountain View, California", NOTE="white paper", YEAR=1994, REFERENCES=4, KEYWORDS="video compression; packet video; nv; ivs; inperson", ABSTRACT="The availability of low cost, high performance workstations with bundled or inexpensive video has created a demand for a low cost video conferencing solution. Support for video conferencing facilities on low cost workstations require algorithms that have both low data rates and low associated computational costs. The acceptability of lower frame rates and variable quality images make software-only implementations possible. HDCC is a software only compression algorithm that supports video conferencing over a LAN, and is the basis for the video conferencing product, InPerson, on Indy, a low cost workstation from Silicon Graphics. By concentrating the computational load in the encoder, conferences of large numbers of individuals can be supported without serious performance degradation. At 320 by 240 resolution, 30 frames per second, HDCC encode utilizes approximately 23\% of a 100 MHz RISC processor and HDCC decode requires 3 \% for each decode stream. The low computational load is required to allow other computational activities to be supporte concurrently, e.g., a shared white board. The algorithm uses selective update where only those portions of the image that have changed sufficiently from frame to subsequent frame are transmitted over the LAN. Selection of blocks for transmission is made based on a rotating sampling of each block. Blocks are sorted by frame to frame luminance gradient, blocks with large gradients are given higher transmission priority.", ANNOTE="Based on 8-bit dithered RGB (3 bits R, 3 bits G, 2 bits B); conditional replenishment using 8 by 8 blocks. 1 bit per pixel.", URL="ftp://gaia.cs.umass.edu/pub/hgschulz/More94:HDCC.ps.Z", } @ARTICLE{Morr94:Modelling, AUTHOR="T. D. Morris and Harry Perros", TITLE="Performance Modelling of a Multi-Buffered Banyan Switch Under Bursty Traffic", JOURNAL="IEEE trans. on comp. systems", VOLUME="C-42", PAGES=5, YEAR=1994, KEYWORDS="ATM; performance evaluation; modeling; banyan network; bursty traffic; switching block; switching network", } @ARTICLE{Morr94:Use, AUTHOR="A. S. Morris", TITLE="Use of Colour to Describe System States in a Process Simulation Language", JOURNAL="Simulation", VOLUME="62 NUMBER=1", PAGES="20-26", YEAR=1994, REFERENCES=3, KEYWORDS="distributed simulation; distributed system", ABSTRACT="The paper describes an extension to a standard, block-structured, interactive simulation language in which colours are used to indicate the levels of variables in the simulated process. A coding system is used to classify the level of simulated process variables in three regions of safe, unsafe and dangerous operation, represented by green, yellow and red colours respectively. Theenhanced simulation package facilitates controller development.", } @INPROCEEDINGS{Mudh94:Service, AUTHOR="P. Mudhar", TITLE="A Service Creation Environment for a future intelligent network", BOOKTITLE="Towards a Pan-European Telecommunication Service Infrastructure - IS\&N Second International Conference", PAGES="333-342", YEAR=1994, REFERENCES=17, KEYWORDS="IN; intelligent network", ABSTRACT={This paper presents the model of the service creation environment (SCE) for a future intelligent network developed within EURESCOM project P103, "Evolution of the Intelligent Network". The SCE models the service creation phase of the service lifecycle using an object oriented service composition technique developed within the project. The SCE model incorporates a model for service constituents storage and guidelines for service SCE interaction}, } @ARTICLE{Mukh9405:Intrusion, AUTHOR="B. Mukherjee and L. T. Heberlein and Karl Levitt", TITLE="Network intrusion detection", JOURNAL=ieeenet, VOLUME=8, NUMBER=3, PAGES="26-41", MONTH="May/June", YEAR=1994, REFERENCES=36, KEYWORDS="security; intrusion detection", ABSTRACT="Intrusion detection is a new, retrofit approach for providing a sense of security in existing computers and data networks, while allowing them to operate in their current ``open'' mode.", } @ARTICLE{Mull94:Characterizations, AUTHOR="J. Muller", TITLE="Some Characterizations of Functions Computable in On-Line Arithmetic", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="After a short introduction to on-line computing, we prove that the functions computable in on-line by a finite automaton are piecewise affine functions whose coefficients are rational numbers (i.e. the functions $f(x)=ax+b$, or $f(x, y)=ax+by+c$ where $a$, $b$, and $c$ are rational). A consequence of this study is that multiplication, division, and elementary functions of operands of arbitrarily long length cannot be performed using bounded-size operators.", } @PROCEEDINGS{Anon94:Elektronik, TITLE="Elektronik im Kraftfahrzeug - Electronic Systems for Vehicles", EDITOR="Anonymous", SERIES="VDI Berichte", PUBLISHER="VDI-Gesellschaft Fahrzeugtechnik", ADDRESS="Baden-Baden, Germany", VOLUME=1152, YEAR=1994, LANGUAGE="German", KEYWORDS="bus; network topology", } @TECHREPORT{IEEE94:IEEE, AUTHOR="I. E. EE", TITLE="{IEEE} Standard {VHDL} Language Reference Manual", INSTITUTION="IEEE", YEAR=1994, KEYWORDS="hardware design language; reference; standard", } @ARTICLE{Naar94:Datex, AUTHOR="M. Naar", TITLE="Datex {M,} die deutsche Datenautobahn", JOURNAL="Funkschau", ADDRESS="Germany", VOLUME=23, PAGES="54-55", YEAR=1994, LANGUAGE="German", KEYWORDS="dqdb; MAN", ABSTRACT="Mit Datex M bietet die Telekom eine Datenautobahn, die schon inkonkreten Projekten ihren Nutzen bewiesen hat.", } @ARTICLE{Naga94:FINITE, AUTHOR="R. Nagarajan and James F. Kurose and Donald F. Towsley", TITLE="Finite-horizon statistical quality-of-service measures for high-speed networks", JOURNAL=jhsn, VOLUME=3, PAGES="344-351", YEAR=1994, REFERENCES=44, KEYWORDS="high speed; network; QOS; statistical technique; transient analysis", ABSTRACT="In this paper, we show that the steady state analysis is not entirely sufficient for QoS purposes in future high-speed networks as it yields long-run performance measures that are not appropriate for envisaged applications in HSNs. New QoS criteria for such applications are proposed an their computation detailed for some simple queueing models. ...", } @ARTICLE{Naga94:Highly, AUTHOR="Jiro Naganuma and Takeshi Ogura", TITLE="A Highly {OR-Parallel} Inference Machine (Multi-ASCA) and its Performance Evaluation - An Architecture and its Load Balancing Algorithms", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="An architecture and its four load balancing algorithms for a highly OR-parallel inference machine are proposed, and its performance is evaluated in a trace-driven simulation study. This inference machine consists of a large number of processing elements (PEs) with serial I/O links directly connected to each other in a simply modified mesh network. Each PE is a high-speed sequential Prolog processor with its own local memory. The activity of all PEs is locally controlled by four new load balancing algorithms based on purely local communication. Communication is allowed only between directly connected PEs. These load balancing algorithms reduce communication overhead in a load balancing and make it possible to accomplish highly OR-parallel execution. A software simulator using a trace-driven simulation technique based on an inference tree has been developed, and some typical OR-parallel benchmarks such as the $n$-queens problem have been simulated on it. The average communication per load balancing is reduced from 1/30 to 1/100 by the interaction of these load balancing algorithms as compared with a conventional copying method. The inference machine (1024 PEs: 32 X 32 array) attains 300-600 times parallel speedup, assuming 1 MLIPS (mega logical inference second) PE and a 20 MBPS (megabit per second) each serial I/O link, which could be easily integrated on a single chip using current VLSI technology. This highly OR-parallel inference machine promises to be an important step towards the realization of a high-performance artificial intelligence system.", } @INPROCEEDINGS{Nahu94:Parallelized, AUTHOR="Erich Nahum and David Yates and James F. Kurose and Donald F. Towsley", TITLE="Performance Issues in Parallelized Network Protocols", BOOKTITLE=osdi, PAGES="125-137", YEAR=1994, ABSTRACT="Parallel processing has been proposed as a means of improving network protocol throughput. Several different strategies have been taken towards parallelizing protocols. A relatively popular approach is {\em packet-level parallelism,} where packets are distributed across processors. \par This paper provides an experimental performance study of packet-level parallelism on a contemporary shared memory multiprocessor. We examine several unexplored areas in packet-level parallelism and investigate how various protocol structuring and implementation techniques can affect performance. We study TCP/IP and UDP/IP protocol stacks implemented with a parallel version of the x-kernel running in user space on Silicon Graphics multiprocessors. \par Our results show that only limited packet-level parallelism can be achieved within a single connection under TCP but that using multiple connections can improve available parallelism. We also demonstrate that packet ordering plays a key role in determining single-connection TCP performance, that careful use of locks is a necessity, and that selective exploitation of caching can improve throughput. We also describe experiments that compare parallel protocol performance on two generations of a parallel machine and show how computer architectural trends can influence performance.", URL="ftp://gaia.cs.umass.edu/pub/Nahu94:Performance.ps.Z", } @ARTICLE{Nak9401:Coordinating, AUTHOR="Donovan Nak", TITLE="Coordinating Global Standards and Market Demands", JOURNAL=ieeecm, VOLUME=32, NUMBER=1, PAGES="72-77", MONTH="Jan", YEAR=1994, KEYWORDS="global standards; market demands; telecommunications", ABSTRACT="The telecommunications infrastructure is becoming more commonly recognized as a key factor in socioeconomic development.", } @ARTICLE{Naka9403:Soliton, AUTHOR="Masataka Nakazawa", TITLE="Soliton Transmission in Telecommunication Networks", JOURNAL=ieeecm, VOLUME=32, NUMBER=3, PAGES="34-43", MONTH="Mar", YEAR=1994, REFERENCES=15, KEYWORDS="soliton transmission; telecommunication networks; erbium-doped; solitons; lightwave networks; laser; fiber optics", ABSTRACT="Erbium-doped fiber amplifiers are a major breakthrough for soliton communications.", } @ARTICLE{Nakh94:Error, AUTHOR="Michel Nakhla", TITLE="Error Probability for Multilevel Digital Systems in Presence of Intersymbol Interference and Additive Noise", JOURNAL=ieeecom, YEAR=1994, ABSTRACT="Generalization of a recently published technique for the evaluation of error probability in fiber-optic communication systems is described. The crux of the method is a minimax approximation of the cumulative distribution function of the additive noise. The additive noise is not constrained to be Gaussian. Examples and comparisons with previously published techniques are presented.", } @ARTICLE{Nara94:Recursive, AUTHOR="M. J. Narasimha", TITLE="A Recursive Structure with Applications to Self-Routing Switching Networks", JOURNAL="IEEE trans. on comp. systems", VOLUME="C-42", PAGES=3, YEAR=1994, KEYWORDS="ATM; network; concentrator; routing; self routing", } @TECHREPORT{Nati94:Realizing, AUTHOR="{National Research Council}", TITLE="Realizing the Information Future: The {Internet} and Beyond", ISBN="0-309-05044-8", INSTITUTION="National Research Council", PUBLISHER="National Academy Press", ADDRESS="Washington, D.C.", YEAR=1994, KEYWORDS="internet; NII; policy; NREN", URL="http://xerxes.nas.edu:70/1/nap/online/rtif", } @ARTICLE{Ndou9409:Fuzzy, AUTHOR="T. D. Ndousse", TITLE="Fuzzy Neural Control of Voice Cells in {ATM} Networks", JOURNAL=ieeejsac, VOLUME="SAC-12", NUMBER=9, PAGES="1488-1494", YEAR=1994, REFERENCES=13, KEYWORDS="ATM; network; leaky bucket; QOS", ABSTRACT="The Paper presents the design of a fuzzy controller for managingcells generated by voice sources in asynchronous transfer mode (ATM) networks.", } @INPROCEEDINGS{Neck94:Verteilte, AUTHOR="T. Necker", TITLE="Verteilte Simulation auf der Basis einer objektorientierten Bibliothek", BOOKTITLE="Workshop über parallele und verteile Simulation - Bericht Nr. AIS 21", ADDRESS="Oldenburg, Germany", PAGES="8-10", YEAR=1994, LANGUAGE="German", REFERENCES=5, KEYWORDS="distributed simulation; object-oriented programming; simulation", ABSTRACT="Das Konzept einer objektorientierten Simulationsbibliothek wird vorgestellt.", } @ARTICLE{Nels94:Finding, AUTHOR="Randal C. Nelson", TITLE="Finding Line Segments by Stick Growing", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="A method is described for extracting lineal features from an image using extended local information to provide robustness and sensitivity. The method utilizes both gradient magnitude and direction information, and incorporates explicit lineal and end-stop terms. These terms are combined nonlinearly to produce an energy landscape in which local minima correspond to lineal features called sticks that can be represented as line segments. A hill climbing (stick-growing) process is used to find these minima. The method is compared to two others, and found to have improved gap-crossing characteristics.", } @ARTICLE{Neum9409:Kerberos, AUTHOR="B. Clifford Neuman and Ts'o Theodore", TITLE="Kerberos: An Authentication Service for Computer Networks", JOURNAL=ieeecm, VOLUME=32, NUMBER=9, PAGES="33-39", MONTH="Sep", YEAR=1994, KEYWORDS="kerberos; authentication service; computer networks; cryptography; authentication; security; encryption; network; internet; authorization; passcode; public-key", ABSTRACT="Authentication is critical for the security of computer systems. Without knowledge of the identity of a principal requesting an operation, it's difficult to decide whether the operation should be allowed. Traditional authentication methods are not suitable for use in computer networks where attackers monitor network traffic to intercept passwords. The use of strong authentication methods that do not disclose passwords is imperative. The Kerberos authentication system is well suited for authentication of users in such environments.", URL="http://nii.isi.edu/publications/kerberos-neuman-tso.html", } @ARTICLE{Newm9403:ATM, AUTHOR="P. Newman", TITLE="{ATM} Local Area Networks", JOURNAL=ieeecm, VOLUME=32, NUMBER=3, PAGES="86-98", MONTH="Mar", YEAR=1994, REFERENCES=48, KEYWORDS="ATM; local area networks; local-area network; MAC; lan emulation", ABSTRACT="LAN emulation offers a best-effort, connectionless, packet transfer service at the MAC sublayer, implemented on top of a connection-oriented ATM network.", } @ARTICLE{Newm9408:Traffic, AUTHOR="P. Newman", TITLE="Traffic Management for {ATM} Local Area Networks", JOURNAL=ieeecm, VOLUME=32, NUMBER=8, PAGES="44-51", MONTH="Aug", YEAR=1994, REFERENCES=24, KEYWORDS="traffic management; ATM; local area networks; bursty traffic; bandwidth sharing; circuit switching", ABSTRACT="Considerable progress has already been made in implementing constant bit rate services, similar to conventional circuit switching, over ATM. However, the bursty nature of data traffic requires dynamic bandwidth sharing similar to packet switching, and this is still under investigation.", } @ARTICLE{Nied9402:Pseudorandom, AUTHOR="H. Niederreiter", TITLE="Pseudorandom vector generation by the inversive method", JOURNAL=tomacs, VOLUME=4, NUMBER=2, PAGES="191-212", YEAR=1994, REFERENCES=23, KEYWORDS="rng; rvg", ABSTRACT=".. we carry out a detailed analysis of the inversive method for the generation of uniform pseudorandom vectors.", } @TECHREPORT{Niel94:Experiments, AUTHOR="Annemarie B. Nielsen and E. Aarstad and H. Pettersen and T. Renger and R. Elvang and J. Kroeze and J. Witters", TITLE="Experiments on {ATM} Traffic Control in the {EXPLOIT} Testbed", INSTITUTION="RACE Project EXPLOIT", PAGES=12, NOTE="Contact renger@ind.uni-stuttgart.d400.de", YEAR=1994, REFERENCES=14, ABSTRACT="Efficient and robust traffic control is required for Asynchronous Transfer Mode (ATM) based networks in order to support the wide variety of Quality of Service (QoS) demands for evolving broadband services and applications. To achieve high network utilisation traffic control functions may take advantage of the possible multiplexing gain between connections with variable cell rates. The proper operation of these functions can only be validated within a real switching environment like the RACE EXPLOIT Testbed in Basel, Switzerland. This paper investigates the Usage Parameter Control (UPC) function by performing experiments with an implemented leaky bucket mechanism. Both traffic generators and real traffic sources are used. Furthermore, Connection Admission Control (CAC) is studied by multiplexing of both homogeneous and heterogeneous traffic. Experimental results are compared with analytical calculations. KEYWORDS=", } @TECHREPORT{Nils94:V, AUTHOR={Robert Nilsson and Kent S. Saxi Hammarstr"om}, TITLE="{V:} A Visual Query Language for Multimodal Interfaces", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="T94-08", YEAR=1994, ABSTRACT="This thesis proposes a two-dimensional, visual, direct manipulation query language intended to be used as an alternate modality to natural language in a multimodal interface. The language focuses on the visualisation of the logic of queries, and is intended to be flexible, extensible, and to have at least the expressive power of first order predicate logic with constraints. The language provides a basis for future inclusion of higher order logic (and thus a framework for database navigation with the language itself), DBMS features, and generalised quantifiers. As far as we have been able to judge, no such visual language of equal expressive power already exists. A 'proof of concept' prototype has been implemented that illustrates some of the key concepts of the language.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--94-08--SE.ps.Z", } @ARTICLE{Nola9407:Integrated, AUTHOR="D. A. Nolan and V. A. Bhagavatula and Lerminiaux C.", TITLE="integrated-Optics Planar Components", JOURNAL=ieeecm, VOLUME=32, NUMBER=7, PAGES="62-67", MONTH="Jul", YEAR=1994, KEYWORDS="optics; planar components", ABSTRACT="Optical fiber architectures of the future are envisioned employing extensive splitting of optical signals.", } @ARTICLE{Norp9411:UMTS, AUTHOR="Toon Norp and Ad J. M. Roovers", TITLE="{UMTS} Integrated with {B-ISDN}", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="60-65", MONTH="Nov", YEAR=1994, REFERENCES=8, KEYWORDS="UMTS; B-ISDN; telecommunications; mobile telephony; ISDN; signaling", ABSTRACT="Since, by the turn of the century, a mobile terminal will be involved in 50 percent of all calls, it is critical that the integration of the fixed and mobile telecommunication systems succeeds. This will require that BISDN support some features necessary to provide mobility services to the users.", } @ARTICLE{Norr9410:Life, AUTHOR="Mark Norris and Peter Rigby and Sinclair Guillaume Stockman", TITLE="Life After {ISO} 9001: British Telecom's Approach to Software Quality", JOURNAL=ieeecm, VOLUME=32, NUMBER=10, PAGES="58-63", MONTH="Oct", YEAR=1994, KEYWORDS="ISO 9001; british telecom; software quality; process control", ABSTRACT="After years of experience focusing on software quality, BT has learned a key lesson: the process controls introduced through ISO 9001 are but the first step in getting real quality gains. Attention must be paid to the software product and, most importantly, to those who produce the goods.", } @INPROCEEDINGS{Nort94:Applications, AUTHOR="Stephen C. North and Eleftherios Koutsofios", TITLE="Applications of Graph Visualization", BOOKTITLE="Graphics Interface", PAGES="235-245", YEAR=1994, } @INPROCEEDINGS{OGra94:Groupware, AUTHOR="Ted O'Grady and Saul Greenberg", TITLE="A groupware environment for complete meetings", BOOKTITLE="CHI", YEAR=1994, REFERENCES=2, KEYWORDS="groupware; CSCW; desktop conferencing; virtual meeting room", ABSTRACT="Meetings have different phases: a pre-meeting setup phase, a during meeting phase and a post-meeting teardown phase. Additionally, meetings are individual, each requiring a different set of tools and applications. We are developing a prototype groupware environment that addresses the different phases of meetings as well as providing for customizable meetings.", URL="ftp://ftp.cpsc.ucalgary.ca/pub/projects/grouplab/papers/complete\_meetings.CHI94.ps", } @ARTICLE{OMah9405:Security, AUTHOR="Donal O'Mahony", TITLE="Security considerations in a network management environment", JOURNAL=ieeenet, VOLUME=8, NUMBER=3, PAGES="12-17", MONTH="May/June", YEAR=1994, KEYWORDS="security; network management", ABSTRACT="When the exchange of management information takes places across the boundary between two separate management domains, and makes use of public data networks, security issues must be considered in greater detail.", } @ARTICLE{OSul94:Regularized, AUTHOR="Finbarr O'Sullivan and Maijian Qian", TITLE="A Regularized Contrast Statistic for Object Boundary Estimation-Implementation and Statistical Evaluation", JOURNAL=ieeepami, VOLUME=16, YEAR=1994, ABSTRACT="We propose an optimization approach to the estimation of a simple closed curve describing the boundary of an object represented in an image. The problem arises in a variety of applications, such as template matching schemes for medical image registration. A regularized optimization formulation with an objective function that measures the normalized image contrast between the inside and outside of a boundary is proposed. Numerical methods are developed to implement the approach, and a set of simulation studies are carried out to quantify statistical performance characteristics. One set of simulations models emission computed tomography (ECT) images; a second set considers images with a locally coherent noise pattern. In both cases, the error characteristics are found to be quite encouraging. The approach is highly automated, which offers some practical advantages over currently used technologies in the medical imaging field.", } @INPROCEEDINGS{OToo94:Opportunistic, AUTHOR="James O'Toole and L. Shrira", TITLE="Opportunistic Log: Efficient Installation Reads in a Reliable Storage Server", BOOKTITLE=osdi, PAGES="39-48", YEAR=1994, ABSTRACT="In a distributed storage system clielit caches managed on the basis of small granularity objects can provide better memory utilization then page-based caches. However, object servers, unlike page servers, must perform additional disk reads. These {\em installation reads} are required to install modified objects onto their conresponding disk pages. The opportunistic log is a new technique that significantly reduces the cost of installation reads. It defers the installation reads, removing them from the modification commit path, and manages a large pool of pending installation reads that can be scheduled efficiently. \par Using simulations, we show that the opportunistic log substantially enhances the I/O performance of reliable storage servers. An object server without the opportunistic log requires much better client caching to outperform a page server. With an opportunistic log, only a small client cache improvement suffices. \par Our results imply that efficient scheduling of installation reads can substantially improve the performance of larege-scale storage systems and therefore introduces a new perfonnance tradeoff between page-based and object-based architectures.", } @ARTICLE{Obal94:Importance, AUTHOR="W. M. Keese I. I. and W. H. Sanders", TITLE="Importance Sampling Simulation in {UltraSAN}", JOURNAL="Simulation", VOLUME="62 NUMBER=1", PAGES="98-111", YEAR=1994, REFERENCES=28, KEYWORDS="importance sampling; petri net; simulation", ABSTRACT="This paper presents a software tool that facilitates experimentation with importance sampling by addressing the problem of simulating rare events. First, the tool ist based on a flexible framework for specifying importance sampling simulations in terms ofstochastic activity networks. Second, once specified, the importance sampoling simulation program is automatically generated bythe tool, freeing the researcher to focus on the modeling prob.", } @ARTICLE{Ohta94:Classification, AUTHOR="T. Ohta and Y. Harada", TITLE="Classification, Detection and Resolution of Services Interactions in Telecommunication Services", JOURNAL="Feature Interactions in Telecommunications Systems, IOS Press", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="60-72", YEAR=1994, REFERENCES=8, KEYWORDS="IN; intelligent network", ABSTRACT="This paper proposes a way to classify, detect and resolve service interactions in telecommunication services. First, a general framework for classifying the interactions is described and then, based on our experiments, a detailed explanation of the classification, detection and resolution of interactions in the services specification design stage are described.", } @BOOK{Ohta94:Packet, AUTHOR="Naohisa Ohta", TITLE="Packet Video - Modelling and Signal Processing", PUBLISHER="Artech House", ADDRESS="Great Britain", YEAR=1994, KEYWORDS="ATM; modeling; packet video; source model; video coding", } @INPROCEEDINGS{Olan94:DECT, AUTHOR="P. Olanders", TITLE="{DECT} standardisation - Status and future actvities", BOOKTITLE=pmrc, ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", PAGES="1064-1069", YEAR=1994, KEYWORDS="radio channel; standardization", ABSTRACT="The standardisation of DECT in ETSI has been very productive, the DECT standard is one of the first to be completed. The basic DECT standards were approved in 1992, after which type approval (regulatory) standards were made (approved 1993/1994). During the last year the focus of standardisation has shifted towards application standards, e.g. DECT/GSM and DECT/ISDN Interworking Profiles. One of the latest development in DECT has been the Generic", } @BOOK{Olse94:System, AUTHOR="Anders Olsen and Ove Færgemand and B. Muller-Pedersen and R. Reed and others", TITLE="System Engineering Using {SDL-92}", ISBN="0-444-89872-7", PUBLISHER="North-Holland", ADDRESS="Netherlands", YEAR=1994, KEYWORDS="ASN.1; object-oriented programming; protocol; protocol specification; sdl; specification; specification language", ABSTRACT="This book is based on the earlier book: 'Telecommunictaion Systems Engineering using SDL' by Roberto Saracco, J.R.W. Smith and Rick Reed. This book is neither a complete rewrite nor just a new edition; both the feedback on the earlier book and the new perspectives on SDL use (which are enabled by the additional features of SDL' 92) have led to significant revision. ... This book reflects recent work carried out by the authors and their involvem", } @ARTICLE{Olso9402:Operating, AUTHOR="Douglas W. Olson and H. R. Salloum and Mark A. Seely and A. B. Walsh", TITLE="Operating and Powering Optical Fiber Networks", JOURNAL=ieeecm, VOLUME=32, NUMBER=2, PAGES="74-77", MONTH="Feb", YEAR=1994, KEYWORDS="optical fiber networks; telephony; video dial tone", ABSTRACT="LECs can extend the high-quality operations support they provide for telephony to the video dial tone services that will be implemented on broadband networks.", } @ARTICLE{Omun94:Pipelined, AUTHOR="Daniel S. Omundsen and A. R. Kaye and S. A. Mahmoud", TITLE="A Pipelined, Multi-Processor Architecture for a Connectionless Server for Broadband {ISDN.}", JOURNAL="IEEE/ACM Transactions on Networking 1994", YEAR=1994, ABSTRACT="The Direct Provision of Connectionless Service in BISDN calls for servers that are connected to or are part of an ATM network to provide the routing function at input speeds up to 622 Mb/s. Routing is achieved in such a server by changing the VCI/VPI headers in the ATM cells; actual switching is done by existing switches in the ATM network. The paper presents an architecture capable of executing all the functions of a server at input speeds up to 622 Mb/s, scalable to multiple inputs at that speed, making use of processors and special hardware that are available today. To avoid storing large quantities of data, the architecture routes data packets by examining routing information in the initial cell of the packet and routing subsequent cells as they arrive rather than waiting until the complete packet has arrived. It is capable of handling packets that have been multiplexed at the SAR sublayer using AAL Type 3/4 and, with minor modifications, could also handle Type 5 traffic. Arguments are also presented for the use of AAL Type 5 for the Direct Connectionless Service.", } @BOOK{Onvu94:Asynchronous, AUTHOR="R. O. Onvural", TITLE="Asynchronous Transfer Mode Networks: Performance Issues", ISBN="0-89006-662-0", PUBLISHER="Artech House", ADDRESS="Boston", YEAR=1994, KEYWORDS="ATM; performance; routing; transport protocols", } @ARTICLE{Osma94:Discriminatory, AUTHOR="Hossam Osman and Moustafa M. Fahmy", TITLE="On the Discriminatory Power of Adaptive Feed-Forward Layered Networks", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="This paper expands the available theoretical framework that establishes a link between discriminant analysis and adaptive feed-forward layered linear-output networks used as mean-square classifiers. This has the advantages of providing more theoretical justification for the use of these nets in pattern classification and gaining a better insight into their behavior and about their use. We prove that, under reasonable assumptions, minimizing the mean-square error at the network output is equivalent to minimizing the following: (i) the difference between the optimum value of a familiar discriminant criterion and the value of this criterion evaluated in the space spanned by the outputs of the final hidden layer, and (ii) the difference between the values of the same discriminant criterion evaluated in desired-output and actual-output subspaces. We also illustrate, under specific constraints, how to solve the following problem: given a feature extraction criterion, how the target coding scheme can be selected such that this criterion is maximized at the output of the network final hidden layer. Other properties for these networks are explored.", } @UNPUBLISHED{Ostr94:Tele, AUTHOR="Edgar Ostrowski and Frank Ruge", TITLE="Tele-Cooperation Requirements on the Transport Subsystem", INSTITUTION="TUB-PRZ (Technische Universität Berlin)", ADDRESS="Berlin, Germany", NOTE="internal memorandum", YEAR=1994, KEYWORDS="quality of service; QOS; JVTOS", ABSTRACT="This paper gives an overview of the transport service requirements of the Joint Viewing Teleoperation Service (JVTOS) which has been specified by the RACE project R2060 (CIO: Coordination, Implementation and Operation of Multimedia Teleservices) for support of collaborative work and group computing. The analysis of the different components for a JVTOS enviroment leads to a general framework of telecooperation service requirements to the transport subsystem, e.g. videoteleconferencing and collaborative work. These requirements are classified by the components of the service and its set of parameters to the transport system.", } @BOOK{Oust94:Tcl, AUTHOR="J. Ousterhout", TITLE="Tcl and the Tk Toolkit", ISBN="0-201-63337-X", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1994, KEYWORDS="tcl; command languages; tk toolkit; window systems; programming languages", } @ARTICLE{Pahl94:Wireless, AUTHOR="K. Pahlavan and A. H. Levesque", TITLE="Wireless Data Communication", JOURNAL=ieeeproc, VOLUME="82 NUMBER=9", PAGES="1398-1430", YEAR=1994, REFERENCES=198, KEYWORDS="mobile radio; packet radio; radio channel", ABSTRACT="Wireless data services and systems represent a rapidly growing and increasingly important segment of the communications industry. In this paper we present an overview of this field, emphasizing three major elements: 1) technologies utilized in existing and currently planned wireless data services, 2) issues related to the performance of these systems, and 3) discernible trends in the continuing development of wireless data systems. While the wi", } @ARTICLE{Paik94:Deleting, AUTHOR="Doowon Paik and S. M. Reddy and S. Sahni", TITLE="Deleting Vertices to Bound Path Length", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="We examine the vertex deletion problem for weighted directed acyclic graphs (wdags). The objective is to delete the fewest number of vertices so that the resulting wdag has no path of length $>\delta$. Several simplified versions of this problem are shown to be NP-hard. However, the problem is solved in linear time when the wdag is a rooted tree and in quadratic time when the wdag is a series-parallel graph.", } @ARTICLE{Palu94:Derivation, AUTHOR="Daniel L. Palumbo", TITLE="The Derivation and Experimental Verification of Clock Synchronization Theory", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="The objective of this work is to validate mathematically derived clock synchronization theories and their associated algorithms through experiment. Two theories are considered, the Interactive Convergence Clock Synchronization Algorithm and the Mid-Point Algorithm. Special clock circuitry was designed and built so that several operating conditions and failure modes (including malicious failures) could be tested. Both theories are shown to predict conservative upper bounds (i.e., measured values of clock skew were always less than the theory prediction). Insight gained during experimentation led to alternative derivations of the theories. These new theories accurately predict the clock system's behavior. It is found that a 100\% penalty is paid to tolerate worst case failures. It is also shown that under optimal conditions (with minimum error and no failures) the clock skew can be as much as 3 clock ticks. Clock skew grows to 6 clock ticks when failures are present. Finally, it is concluded that one cannot rely solely on test procedures or theoretical analysis to predict worst case conditions.", } @ARTICLE{Panc9405:MPEG, AUTHOR="P. Pancha and Magda El Zarki", TITLE="{MPEG} Coding For Variable Bit Rate Video Transmission", JOURNAL=ieeecm, VOLUME=32, NUMBER=5, PAGES="54-67", MONTH="May", YEAR=1994, REFERENCES=10, KEYWORDS="mpeg coding; variable bit rate; video transmission; real-time transmission; MPEG; source modeling; packet video", ABSTRACT="For real-time transmission of broadcast-quality video on ATM-based B-ISDN, the intraframe to interframe ratio and the quantizer scale are two key parameters that can be used to con- trol a video source in a network environment. Their impact on the traffic characteristics of the coder provides insights into the cell arrival process for an MPEG source.", } @ARTICLE{Pang94:Generalized, AUTHOR="Joseph Pang and F. A. Tobagi and S. Boyd", TITLE="Generalized Access Control Strategies for Integrated Services Token Passing Systems", JOURNAL=ieeecom, VOLUME="42 NUMBER=8", PAGES="2561-2570", YEAR=1994, REFERENCES=16, KEYWORDS="fddi; token bus; token passing", ABSTRACT="The demand for integrated services local area networks is increasing at a rapid pace with the advent of many new and exciting applications: office and factory automation, distributed computing, and multimedia communications. To support these new applications, it is imperative to integrate traffic with diverse statistical characteristics and differing delay requirements on the same network. An attractive approach for integrating traffic has been", } @ARTICLE{Papa94:Hierarchical, AUTHOR="Georgios Papadimitriou", TITLE="Hierarchical Discretized Pursuit Nonlinear Learning Automata with Rapid Convergence and High Accuracy.", JOURNAL=ieeekde, YEAR=1994, ABSTRACT="In this paper, a new absorbing multiaction learning automaton which is epsilon-optimal is introduced. It is a hierarchical discretized pursuit nonlinear learning automaton which uses a new algorithm for positioning the actions on the leaves of the hierarchical tree. The proposed automaton achieves the highest performance (speed of convergence, CPU time and accuracy) among all the absorbing learning automata reported in the literature up to now. Extensive simulation results indicate the superiority proposed scheme. Furthermore, it is proved that the proposed automaton is epsilon-optimal in every stationary stochastic environment", } @ARTICLE{Papa94:New, AUTHOR="Georgios Papadimitriou", TITLE="A New Approach to the Design of Reinforcement Schemes for Learning Automata: Stochastic Estimator Learning Algorithms", JOURNAL=ieeekde, YEAR=1994, ABSTRACT={In this paper a new class of learning automata is introduced. The new automata use a stochastic estimator and are able to operate in nonstationary environments with high accuracy and high adaptation rate. According to the stochastic estimator scheme, the estimates of the mean rewards of actions are computed stochastically. So, they are not strictly dependent on the environmental responses. The dependence between the stochastic estimates and the deterministic estimator's contents is more relaxed when the latter are old and probably invalid. In this way, actions that have not been selected recently, have the opportunity to be estimated as "optimal", to increase their choice probability and consequently, to be selected. Thus, the estimator is always recently updated and consequently, able to be adapted to environmental changes. The performance of the Stochastic Estimator Learning Automaton (SELA) is superior over the previous well-known S-model ergodic schemes. Furthermore, it is proved that SELA is absolutely expedient in every stationary S-model random environment.}, } @ARTICLE{Papa94:Provably, AUTHOR="C. V. Papadopoulos", TITLE="Provably optimal algorithms for signal routing", JOURNAL="Computer Systems Science and Engineering", VOLUME="9 NUMBER=4", PAGES="211-219", YEAR=1994, REFERENCES=23, KEYWORDS="routing; routing algorithm", ABSTRACT="in this paper, we propose a provably good performance-driven global routing algorithm for both cell-based and building block design. The algorithm simultaneously minimizes both routing cost and the longest interconnection path, so that both are bounded by small constant factors away from optimal. Our method is based on the following results. ....", } @ARTICLE{Para9411:Missing, AUTHOR="Jonathan L. Parapak", TITLE="The Missing Link and Vision 2000", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="40-41", MONTH="Nov", YEAR=1994, KEYWORDS="telecommunications infrastructure", ABSTRACT="Indonesia's goal is a well-developed telecommunications infrastructure that provides high-quality service for everyone.", } @ARTICLE{Pasq94:Multimedia, AUTHOR="J. Pasquale and George C. Polyzos and E. C. Anderson and Vachaspathi Kompella", TITLE="The Multimedia Multicast Channel", JOURNAL=internet, VOLUME=5, NUMBER=4, PAGES="151-162", YEAR=1994, REFERENCES=30, KEYWORDS="multicast; multimedia; dissemination; computer networks", ABSTRACT="The Multimedia Multicast Channel is a dissemination-oriented communication abstraction providing a service analogous to that of a cable television broadcast channel. A source transmits multimedia information such as video and audio streams onto a channel, and a varying number of receivers `tune in' to the channel to receive a selected set of streams. To support heterogenity, each receiver may tailor the selected streams to meet individual needs through the use of filters. The design encourages a very loose coupling between the source and the receivers, promoting open-loop control for the underlying network protocols.", } @ARTICLE{Paul94:L´évolution, AUTHOR="E. Paul and H. Blanchard and B. Parfait", TITLE="L´évolution de l´architecture du réseau intelligent", JOURNAL="L'écho des Recherches", ADDRESS="Issy-les-Moulineaux, France", VOLUME=157, PAGES="17-34", YEAR=1994, LANGUAGE="French", KEYWORDS="implementation; IN; intelligent network; ISDN; network management; overview; telephony", ABSTRACT="The intelligent network (IN) architecture is in the process of implementation on the FRANCE TELECOM PSTN. It was defined to offer such services as the FT intelligent card, free-phone servicesand the Transgroupe virtual private network service. Already, short term changes are envisaged to diversify the range of IN services, to make greater use of ITU-T and ETSI international standards. ... The question of ... integration with ... TMN is discuss", } @ARTICLE{Paxs9407:Growth, AUTHOR="V. Paxson", TITLE="Growth trends in wide-area {TCP} connections", JOURNAL=ieeenet, VOLUME=8, NUMBER=4, PAGES="8-17", MONTH="July/August", YEAR=1994, REFERENCES=26, KEYWORDS="internet; traffic characterization; TCP", ABSTRACT="A recently completed single-site study has yielded information about how Internet traffic will evolve, as new users discover the Internet and existing users find new ways to incorporate the Internet into the work patterns.", } @ARTICLE{Peha9405:SNR, AUTHOR="Jon M. Peha and F. A. Tobagi", TITLE="Specification and Analysis of the {SNR} High-Speed Transport Protocol", JOURNAL=ieanep, ISBN="1063-6692", VOLUME=2, NUMBER=5, PAGES="483-496", YEAR=1994, REFERENCES=26, KEYWORDS="protocol; high speed; transport protocol", ABSTRACT={This paper considers a high-speed transport protocol, called theSNR protocol, in detail. A formal specification of the protocolis presented, using the protocol model "systems of communicating machines", and the protocol is then analyzed through the specification. The paper also discusses the difficulties encountered during the analysis of such a complex protocol, and suggests some possible solutions to these problems.}, } @ARTICLE{Perk94:Mobile, AUTHOR="C. E. Perkins and P. Bhagwat", TITLE="A mobile networking system based on the {Internet} Protocol", JOURNAL="IEEE Personal Communications", VOLUME=1, NUMBER=1, PAGES="32-41", MONTH="First Quarter", YEAR=1994, REFERENCES=15, KEYWORDS="PCS; mobility; internetworking; IP; mobile IP", } @PROCEEDINGS{Perr94:High, TITLE="High Speed Networks and their {PerformanceIFIP} Transactions {C-21}", EDITOR="Harry Perros and Y. Viniotis", PUBLISHER="IFIP Transactions, North Holland", YEAR=1994, KEYWORDS="ATM; congestion control; high speed; LAN; MAN; measurement; network; performance evaluation; protocol; queueing theory", } @BOOK{Perr94:Queueing, AUTHOR="Harry Perros", TITLE="Queueing Networks with Blocking: Exact and Approximate Solutions", ISBN="0-19-508580-9", PUBLISHER="Oxford University Press", ADDRESS="New York, New York", YEAR=1994, REFERENCES=271, KEYWORDS="approximation; blocking; closed queueing network; cox distribution; matrix geometric method; numerical method; open network; product form; queueing network; tandem queue", ABSTRACT="However, in real-life systems frequently the storage space in front of a server is finite. This observation has given rise to the study of queueing networks with finite capacity nodes. Due to the limitations imposed on the capacity of these nodes, the folw of sustomers through one node may be momentarily stopped if a destination node has reached its capacity. This is known as blocking, and in view of this, a queuing network with finite capacity", } @ARTICLE{Pete9401:Global, AUTHOR="Gerald. H. Peterson and C. A. Dvorak", TITLE="Global Standards", JOURNAL=ieeecm, VOLUME=32, NUMBER=1, PAGES="3 pages", MONTH="Jan", YEAR=1994, KEYWORDS="global standards", ABSTRACT="The provisioning of telecommunication services, more generally Global Information Movement and Management (GIM\&M), is critically coupled in timing and content to meeting both general and unique requirements of customers. In many cases the provisioning of these services depends on the development of global technical agreements on matters affecting the inter-operation among two or more service providers operating with equipment provided by competing suppliers. One of the most effective and efficient ways of establishing global technical inter-operational agreements has been found to be through the development of global telecommunication standards. However, while these global technical standards are an important facilitator in the provisioning of GIM\&M services, care must be taken to assure that these standards are not excessively constraining on the ability of the service provider to make innovations necessary to meet the dynamic needs of customers. With the above thoughts in mind, this article focuses on concerns, objectives and benefits of the global standardization processes and products from the perspective of a GIM\&M service provider. Account is given to the very diverse technical content of standards, i.e., switching, signaling, transmission, operations, maintenance, and performance and on the interdependencies of these technical areas with each other and with supporting information technologies. These aspects are then viewed from the perspective of the benefits that global standards provide to the very focused need of meeting fast turn-around requirements of the service marketplace as defined by service innovation and customer requirements.", } @ARTICLE{Phip94:HIPERLAN, AUTHOR="T. E. Phipps", TITLE="{HIPERLAN} Medium Access Control", JOURNAL="Personal, Indoor and Mobile Radio Communications (PMRC)", ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", PAGES="870-874", YEAR=1994, KEYWORDS="LAN; mobile radio", ABSTRACT="This paper reviews the Medium Access Control (MAC) methods suitable for radio Local Area Networks (LANs), particular attention is given to methods that have been considered for use in the new ETSI RES10 standard, called HIPERLAN.", } @INPROCEEDINGS{Ping94:Comparison, AUTHOR="Shridhar Pingali and Donald F. Towsley and James F. Kurose", TITLE="A Comparison of Sender-Initiated and Receiver-Initiated Reliable Multicast Protocols", BOOKTITLE=sigmetrics, YEAR=1994, REFERENCES=17, KEYWORDS="sender-initiated multicast protocols; receiver-initiated multicast; negative acknowledgment; positive acknowledgment; reliable multicast", ABSTRACT="Sender-initiated multicast protocols, based on the use of positive acknowledgments (ACKs), lead to an ACK implosion problem at the sender as the number of receivers increases Briefly, the ACK implosion problem refers to the significant overhead incurred by the sending host due to the processing of ACKs from each receiver. A potential solution to this problem is to shift the burden of providing reliable data transfer to the receivers -thus resulting in a receiver-initiated multicast error control protocol based on the use of negative acknowledgments -NAKs-. In this paper we determine the maximum throughputs of the sending and receiving hosts for generic sender-initiated and receiver-initiated protocols. We show that the receiver-initiated error control protocols provide substantially higher than their sender-initiated counterparts. We further demonstrate that the introduction of random delays prior to generating NAKs coupled with the multicasting of NAKs to all receivers has the potential for an additional substantial increase in the throughput of receiver-initiated error control protocols over sender-initiated protocols.", URL="ftp://gaia.cs.umass.edu/pub/Ping94:Multicast.ps.Z", } @ARTICLE{Pins9406:Blocking, AUTHOR="E. Pinsky and A. E. Conway and Wen-Zu Liu", TITLE="Blocking Formulae for the Engset Model", JOURNAL=ieeecom, ISBN="0090-6778", VOLUME="COM-42", NUMBER=6, PAGES="2213-2214", YEAR=1994, REFERENCES=10, KEYWORDS="congestion; engset formula; blocking", ABSTRACT="This paper presents a simple recursive algorithms for computing call and time congestion in the classical Engset model with M sources and N servers. The first recursion has the complexity of O(MN) and gives the blocking probabilities for all intermediate values of M and N. The second recursion assumes a particular value of M and has the complexity of O(M). It gives the blocking probabilities for all intermediate values of N. Both recursions are", } @ARTICLE{Pisc9411:Telecommunications, AUTHOR="Aileen A. Pisciotta", TITLE="Telecommunications Reforms: Options, Models, and Global Challenges", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="28-31", MONTH="Nov", YEAR=1994, KEYWORDS="telecommunications; options; models; global challenges", ABSTRACT="Continued internationalization of telecom providers and services allows all countries to participate in a new global order", } @INPROCEEDINGS{Pitk94:Simple, AUTHOR="Jim Pitkow and Mimi Recker", TITLE="A Simple Yet Robust Caching Algorithm Based on Dynamic Access Patterns", BOOKTITLE="Second World Wide Web Conference: Mosaic and the Web", YEAR=1994, URL="http://www.ncsa.uiuc.edu/SDG/IT94/Proceedings/DDay/pitkow/caching.html", } @INPROCEEDINGS{Plas94:Location, AUTHOR="D. Plassmann", TITLE="Location management for {MBS}", BOOKTITLE="RACE Mobile Telecommunications Workshop", ADDRESS="Amsterdam, Netherlands", PAGES="418-423", YEAR=1994, REFERENCES=6, KEYWORDS="algorithm; cellular system; survey", ABSTRACT="Several location management strategies applicable in cellular networks are presented. Analytical modelling approaches for signalling cost minimisation are discussed. results of a GSM based case study are given. A hybrid dynamic strategy for MBS (Mobile Broadband System) is proposed.", } @ARTICLE{Poll94:EBAMA, AUTHOR="G. P. Pollini and T. J. Haas", TITLE="{E-BAMA} vs. {RAMA}", JOURNAL=ieeenet, VOLUME=8, NUMBER=2, PAGES="18-25", YEAR=1994, REFERENCES=11, KEYWORDS="mobile radio; multiple access", ABSTRACT="Under certain conditions, one of these two multiple-access protocols for mobile wireless communication offers superior throughput delay.", } @INPROCEEDINGS{Pomb94:Flow, AUTHOR="A. Pombortsis and I. Vlahavas", TITLE="Flow Control and Switching Strategy for Preventing Congestion in Multistage Networks", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="69-86", YEAR=1994, } @ARTICLE{Port9410:Technological, AUTHOR="Thomas La Porta and M. Veeraraghavan and Ender Ayanoglu and Mark Karol and R. D. Gitlin", TITLE="{B-ISDN:} A Technological Discontinuity", JOURNAL=ieeecm, VOLUME=32, NUMBER=10, PAGES="84-97", MONTH="Oct", YEAR=1994, KEYWORDS="B-ISDN; technological discontinuity; communications; broadband networks", ABSTRACT="The transition to B-ISDN from current networks represents a major technological discontinuity for the communications world. These discontinuities must be considered for the successful evolution of existing networks to broadband networks.", } @TECHREPORT{Port94:ATM, AUTHOR="Jahn Porter and Andrew Hopper", TITLE="An {ATM} based protocol for Wireless {LANs}", TYPE="Technical Report", INSTITUTION="Olivetti Reserach Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 94-2", YEAR=1994, ABSTRACT="This paper presents a solution to the problem of connectivity of portables to an ATM wired network in the local area environment. A compatible ATM approach is used to provide support for multi-media traffic. Spatial re-use of a single frequency with a large number of small cells is used to increase the aggregate throughput. An experimental system based on low-cost fixed ATM switches and software controlled base stations has been developed.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.94.2.ps.Z", } @ARTICLE{Prei9403:Effects, AUTHOR="B. R. Preiss and W. M. Loucks and I. D. Macintyre", TITLE="Effects of the Checkpoint Interval on Time and Space in Time Warp", JOURNAL=tomacs, VOLUME=4, NUMBER=3, PAGES="223-253", YEAR=1994, REFERENCES=30, KEYWORDS="checkpointing technique; discrete event simulation; time warp", ABSTRACT="The article examines the trade-off between execution time and memory space in optimistically synchronized parallel discrete-event simulation. Furthermore this article introduces parallel discrete-event simulation and describes an implementation of the mostcommon optimistic synchronization method. It also covers process scheduling, message cancellation, checkpoint interval, the experiments performed to assess the space/time trade-off, the impac", } @ARTICLE{Proz9411:Development, AUTHOR="Oleg P. Prozhivalsky", TITLE="Development of Telecommunication in Ukraine", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="42-43", MONTH="Nov", YEAR=1994, KEYWORDS="telecommunication; ukraine", ABSTRACT="The PTT Ministry of Ukraine ahs developed a plan that details development activities through the year 2005", } @ARTICLE{Raab94:ERBIUM, AUTHOR="C. Raabe and B. Teichmann and D. Will", TITLE="{ERBIUM} {DOTIERTE} {FASERVERSTÄRKER}", JOURNAL=ptr, ADDRESS="Netherlands", VOLUME="52 NUMBER=2", PAGES="56-62", YEAR=1994, REFERENCES=6, KEYWORDS="technology", ABSTRACT="Beschreibung integrierter faseroptischer Verstärker, die bertragungsunabhängig für das dritte optische Fenster (1550nm) eingesetzt werden können.", } @PROCEEDINGS{Rafi94:Protocol, TITLE="Protocol Test Systems, {VI} - {IFIP} Transactions {C-19}", EDITOR="O. Rafiq", PUBLISHER="IFIP Transactions, Nort Holland", YEAR=1994, KEYWORDS="protocol; protocol testing; testing", } @TECHREPORT{Ramp94:Processor, AUTHOR="Sanjeev Rampal and D. P. Agrawal and R. H. Douglas", TITLE="Processor Scheduling Algorithms for minimizing Buffer Requirements in Multimedia Applications", INSTITUTION="Center for Communication and Signal Processing", ADDRESS="North Carolina State University, Box 7911", NUMBER="TR 94/16", YEAR=1994, KEYWORDS="static priority preemptive scheduling; real-time application; buffer minimization", ABSTRACT="The increasing use of audio, video and multimedia applications on workstations, mandates the use of real-time processor scheduling techniques. Real-time scheduling algorithms have mostly concentrated on meeting applications deadlines, such as those required video playback for example. Another important requirement for such applications is large buffer memory due to the high data rates involved. We investigate priority allocation algorithms for static priority based preemptive real-time scheduling of periodic task sets. These algorithms are directed at applications in which worst case execution latency is not critical so that priority allocation should be directed towards buffer minimization rather than meeting deadlines. Examples of such applications include video and audio playout and recording, browsing through a database with audio and video data and all types of non-interactive real-time applications, we refer to these as throughput oriented real-time applications. The techniques developed retain the simplicity of implementation of static priority scheduling while eliminating eliminating their drawback of not being able to achieve 100\% processor utilization. In addition, we we are able to obtain hard bounds on worst case execution time which are low enough for most practical deadline based applications also. We show that the standard rate monotone priority allocation algorithm is not optimal in terms of our goal of minimizing input buffer size. Approximate algorithms are then derived, which perform better than the rate-monotone algorithm and bounds on their performance are derived. Average case performance is studied using simulation. The best performance is seen in an algorithm which combines rate-monotone and shortest job first type of priority orderings. Finally, it is shown that these approaches can also be used to obtain deadline-based scheduling algorithms for task sets with arbitrary deadlines. The existence of an optimal buffer minimization algorithm is left as an open problem.", URL="ftp://ftp.csc.ncsu.edu/pup/rtcomm/RTSchedBuff.ps", } @INPROCEEDINGS{Ramp94:Reservation, AUTHOR="Sanjeev Rampal and Douglas Reeves and D. P. Agrawal", TITLE="A Reservation Based-Method for Providing Guaranteed {QoS} in {ATM} networks", BOOKTITLE="2nd {IFIP} Workshop on Performance Evaluation and Analysis of {ATM} Networks", ORGANIZATION="IFIP", YEAR=1994, KEYWORDS="ATM; QOS; reservation; weighted round robin", ABSTRACT="We investigate an approach towards supporting diverse quality of service requirements in broadband networks based on the asynchronous transfer mode. The approach involves deterministic bandwidth reservation at the VP (virtual path) level and statistical multiplexing within each VP. A Weighted Round Robin (WRR) server is used to enforce bandwidth reservations. A connection admission algorithm is developed, which accounts for end to end delay and loss guarantees. This paper deals with VCs that traverse a single VP. The multiple VP case is for future work. It is shown that the amount of network bandwidth required by a VP is minimized by allowing all the allowable loss to occur at the first link of a VP, when there is no statistical multiplexing across VPs. Achievable utilization is shown using simulations based on voice traffic. The effects of the parameters of the WRR server (the vacation time) on the cell loss probability is also studied using simulation.", URL="ftp://ftp.csc.ncsu.edu/pup/rtcomm/QOSinATM.ps", } @ARTICLE{Rao94:New, AUTHOR="Yan Rao and C. Eswaran", TITLE="A New Algorithm for {BTC} Image Bit Plane Coding", JOURNAL=ieeecom, YEAR=1994, ABSTRACT="A new look-up table technique for the coding of the block truncated image bit plane is presented in this letter which yields better images in the subjective as well as in the mean square sense compared to the one proposed by Mitchell and Delp.", } @ARTICLE{Rayc94:ATM, AUTHOR="D. Raychaudhuri and N. Wilson", TITLE="{ATM-Based} Transport Architecture for Multiservicees Wireless Personal Communication Networks", JOURNAL=ieeejsac, VOLUME="12 NUMBER=8", PAGES="1401-1414", YEAR=1994, REFERENCES=45, KEYWORDS="ATM; multiple access; network architecture; tdma", ABSTRACT={THis paper presents an ATM-based transport architecture for next-generation multiservices personal communication networks (PCN). Such "muntimedia capable" integrated services wireless networks are motivated by an anticipated demand for wireless extensions to future broadband networks. An ATM compatible wireless network concept capable of supproting a mix of broadband ISDN services including constant bi-rate (CBR), variable bit-rate (VBR) and pa}, } @ARTICLE{Reil9401:Perspective, AUTHOR="Arthur K. Reilly", TITLE="A {U.S.} Perspective on Standards Development", JOURNAL=ieeecm, VOLUME=32, NUMBER=1, PAGES="30-37", MONTH="Jan", YEAR=1994, KEYWORDS="standards development; communications", ABSTRACT="The foundation for the interconnected society of the 21st century is being built today. The key is the availability of compatible national, regional, and global communications standards.", } @ARTICLE{Ren9401:Leaky, AUTHOR="J. F. Ren and J. W. Mark and J. W. Wong", TITLE="Performance Analysis of a Leaky-bucket Controlled {ATM} Multiplexer", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=19, NUMBER=1, PAGES="73-101", YEAR=1994, REFERENCES=30, KEYWORDS="ATM; leaky bucket; statistical multiplexer; decomposition", ABSTRACT="The paper is concerned primarily with the burst and the cell level control. The system consists of a number of input sources, each controlled by a leaky bucket mechanism.The output from the leaky bucket are fed to a statistical multiplexer. A unified state space representation for the leaky-buckets-multiplexer system is used and a spectral expansion method to analyse the cell level and the burst level behaviors. Numerical results are given.", } @ARTICLE{Rich94:Cochannel, AUTHOR="David A. Rich and Steven Bo and Frank A. Cassara", TITLE="Cochannel {FM} Interference Suppression Using Adaptive Notch Filters", JOURNAL=ieeecom, YEAR=1994, ABSTRACT="In this paper, a method of reducing cochannel FM interference with adaptive tracking notch filters, first proposed by E. Baghdady, is refined and extended. Analytical descriptions and computer simulations of a novel adaptive notch filter are presented. The new form of adaptive notch filter is useful for suppressing strong cochannel FM and CW signals and allows simple, practical realizations of very high $Q$ adaptive notch filters in either analog or digital technologies. The analysis demonstrates that when the instantaneous frequency of the stronger interfering FM carrier signal is known precisely, the stronger signal can be completely eliminated. In some cases, placing an additional adaptive notch filter in front of the stronger signal demodulator to suppress the weaker desired cochannel signal improves the estimate of the stronger signal.", } @ARTICLE{Rich9410:Teleporting, AUTHOR="Tristan Richardson and Bennett Frazer and G. E. Mapp and Andrew Hopper", TITLE="Teleporting in an X Window System Environment", JOURNAL=ieeepcm, VOLUME=1, NUMBER=3, MONTH="Third Quarter", YEAR=1994, KEYWORDS="X window system; mobility", ABSTRACT="Teleporting is the ability to redirect a windowing environment to different computer displays. This paper describes the implementation of a teleporting system developed at Olivetti Research Laboratory (ORL). We outline two particular features of the system that make it powerful. First, t operates with existing applications, which will run without any modification. Second, it incorporates sophisticated techniques of personnel and equipment location which make it simple to use. Teleporting may represent a development in attempts to achieve a ubiquitous, personalised computing environment for all.", } @TECHREPORT{Rich94:Teleporting, AUTHOR="Tristan Richardson and Bennett Frazer and G. E. Mapp and Andrew Hopper", TITLE="Teleporting in an X Window System Environment", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 94-4", YEAR=1994, ABSTRACT="Teleporting is the ability to redirect a windowing environment to different computer displays. This paper describes the implementation of a teleporting system developed at Olivetti Research Laboratory (ORL). We outline two particular features of the system that make it powerful. First, t operates with existing applications, which will run without any modification. Second, it incorporates sophisticated techniques of personnel and equipment location which make it simple to use. Teleporting may represent a development in attempts to achieve a ubiquitous, personalised computing environment for all.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.94.4.html/paper.html", } @TECHREPORT{Ritt94:Generic, AUTHOR="M. Ritter", TITLE="Analysis of the Generic Cell Rate Algorithm Monitoring On/off-Traffic", INSTITUTION="University of Würzburg, Institute of Computer Science", ADDRESS="Würzburg, Germany", VOLUME=77, PAGES="1-17", YEAR=1994, REFERENCES=85, KEYWORDS="analysis; monitoring; traffic parameter; ATM; source policing; leaky bucket; algorithm", ABSTRACT="This study deals with the enforcement of source parameters in ATM networks. An algorithm for monitoring the cell rate of a connection is the so-called generic cell rate algorithm. At the moment, only peak cell rate policing is standardized, but there are discussions in the standard commisions to introduce a second source parameter, the sustainable cell rate in conjunction with a burst tolerance. These source parameters are defined at the physical", } @BOOK{Robe94:Computer, AUTHOR="T. G. Robertazzi", TITLE="Computer networks and systems: queueing theory and performance", ISBN="0-387-94170-3", PUBLISHER="Springer Verlag", ADDRESS="New York", YEAR=1994, KEYWORDS="queueing theory; performance evaluation; MVA; M/M/1; networks of queues; numerical solution; mean value analysis; norton's equivalent; simulation; stochastic petri nets; discrete time queueing systems; probability; computer networks", } @ARTICLE{Robe94:Effect, AUTHOR="R. Clark Robertson and T. T. Ha", TITLE="Effect of capture on throughput of variable length packet Aloha systems", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", VOLUME="17 NUMBER=12", PAGES="836-842", YEAR=1994, REFERENCES=15, KEYWORDS="aloha; LAN", ABSTRACT="The effect of the capture phenomenon on the throughput of a radio communications system using the Aloha random access protocol with variable length packets is examined. In a packet radio communications system, the base station typically receives stronger signals from near users than from far users, leading tothe so-called 'near/far effect'....", } @ARTICLE{Roge94:Optimal, AUTHOR="Roger Wattenhofer and D. Meliksetian and Chi-Ming Chen", TITLE="Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles", JOURNAL=ieeepds, YEAR=1994, ABSTRACT="Communication between processors is one of the most important issues in parallel and distributed systems. In this paper we study the communication aspects of a well known multiprocessor structure, the Cube-Connected Cycles (CCC). Only non-optimal routing algorithms and bounds on the diameter of restricted subclasses of the CCC have been presented in earlier work. In this paper, we present an optimal routing algorithm for the general CCC, with a formal proof of its optimality. Based on this routing algorithm, we derive the exact network diameter for the general CCC.", } @INPROCEEDINGS{Rome94:Dynamic, AUTHOR="Theodore H. Romer and D. Lee and B. N. Bershad", TITLE="Dynamic Page Mapping Policies for Cache Conflict Resolution on Standard Hardware", BOOKTITLE=osdi, PAGES="255-266", YEAR=1994, ABSTRACT="In computer systems with large, physically-indexed, direct-mapped caches, a poor mapping from virtual to physical pages causes excessive cache conflict misses. In a previous paper we proposed a simple hardware device, the Cache Miss Lookaside (CML) Buffer, which identifies pages that are suffering from conflict misses. The operating system can use this information to implement a dynamic page mapping policy that resolves conflicts by performing an in-memory copy of one of the conflicting pages, and updating the virtual to physical mappings. In this paper, we propose several dynamic page mapping policies that detect and resolve cache conflicts using hardware available in existing systems, such as a TLB and cache miss counter, to locate possible cache conflicts. We evaluate the simulated performance of a variety of mapping policies, and show that a dynamic page mapping policy using standard hardware can improve upon the performance of a static policy, but is not as effective as special-purpose hardware such as an associative cache or a CML buffer. We also describe the implementation and performance of a software-based dynamic policy on a DEC Alpha workstation running DEC OSF/1.", } @INPROCEEDINGS{Rons94:Computer, AUTHOR="M. Ronström", TITLE="Computer Architectures for Evaluation of the {UMTS} Network", BOOKTITLE="RACE Mobile Telecommunications Workshop", PAGES="462-465", YEAR=1994, REFERENCES=2, KEYWORDS="cache memory; communication; computer architecture; memory; overview; performance prediction; processor; survey", ABSTRACT="... To enable proper evaluation it is necessary to know the performance of telecommunication nodes when the UMTS network will be installed. Therefore Computer Architecure development has been studied. In this article Computer Architecure for 1997 and 2001 is presented.", } @TECHREPORT{Rose94:Approximate, AUTHOR="O. Rose", TITLE="Approximate Analysis of an {ATM} Multiplexer with {MPEG} Video Input", INSTITUTION="Institute of Computer Science - University of Würzburg", ADDRESS="Würzburg, Germany", VOLUME=79, PAGES="1-9", YEAR=1994, REFERENCES=3, KEYWORDS="ATM; approximation; analysis; multiplexer", ABSTRACT="Variable bit rate (VBR) video is expected to be a major source of traffic for the B-ISDN. The MPEG coding scheme is one of the possibilities considered for the compression of video data. In this paper a simple model for an MPEG coded video stream is developed which is used for the approximation of the cell loss rates at an ATM multiplexer buffer with MPEG video input. Results showing the approximation quality of the traffic model for several loss", } @TECHREPORT{Rose94:Delivery, AUTHOR="O. Rose and M. R. Frater", TITLE="Delivery of {MPEG} Video Services over {ATM}", INSTITUTION="Institute of Computer Science, University of Würzburg", ADDRESS="Würzburg, Germany", VOLUME=86, PAGES="1-10", YEAR=1994, REFERENCES=12, KEYWORDS="ATM; video service", ABSTRACT="Variable bit rate (VBR) video is expected to be a major source of traffic for the B-ISDN. While many methods for coding and compressing this video have been proposed, it is likely that the MPEG standard will be commonly used. In this paper, the authors explore the effect of the MPEG Group of Pictures (GOP) structure onthe performance of a multiplexer carrying this video traffic from a number of independent sources. The authors conclude that", } @TECHREPORT{Rose94:Registration, AUTHOR="Mark Roseman and Saul Greenberg", TITLE="Registration for Real-Time Groupware", INSTITUTION="Department of Computer Science, University of Calgary", ADDRESS="Alberta, Canada", NUMBER="94/533/02", YEAR=1994, REFERENCES=5, KEYWORDS="real-time groupware; registration; pre-meeting process; flexibility; toolkits; architectures", ABSTRACT="This paper examines the groupware registration problems, both social and technical, that occur as users select their tools and the others who will share them. We argue that users require far better and more flexible registration than is provided in today's systems. From our examination of users' needs we derive a set of requirements for groupware registration tools. We present a general registration architecture for creating different registration scenarios, and illustrate a number of the scenarios that we have created.", URL="ftp://ftp.cpsc.ucalgary.ca/pub/users/roseman/registration.ps", } @BOOK{Rose94:Simple, AUTHOR="Marshall T. Rose", TITLE="The simple book: an introduction to internet management", ISBN="0-13-177254-6", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1994, KEYWORDS="network management; SNMP; snmpv2", } @BOOK{Ross94:Simulationsstudie, AUTHOR="A. Rossnagel and others", TITLE="Die Simulationsstudie Rechtspflege", PUBLISHER="provet/GMD; Projektgruppe Verfassungsverträgliche Technikgestalt", ADDRESS="Germany", YEAR=1994, LANGUAGE="German", KEYWORDS="overview", } @ARTICLE{Rost9402:Robust, AUTHOR="Emilia Rosti and others", TITLE="Robust partitioning policies of multiprocessor systems", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=19, NUMBER="2-3", PAGES="141-165", YEAR=1994, REFERENCES=19, KEYWORDS="multiprocessor; multiprogramming; partition function; robustness", ABSTRACT="One approach for multiprogramming parallel multiprocessor systems is to divide the set of processing elements into independent partitions, and simultaneously execute a different parallel program in each partition. In the paper several adaptive partitioning policies are evaluated. Their behavior, as well as the behavior of static policies, is investigated using real parallel programs. Results on a iPSC/2 hypercube system are reported.", } @INPROCEEDINGS{Roth94:CINEMA, AUTHOR="K. Rothermel and I. Barth and T. Helbig", TITLE="{CINEMA} - An Architecture for Distributed Multimedia Applications", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="253-272", YEAR=1994, } @ARTICLE{Rous94:Congestion, AUTHOR="J. K. Roussos and E. G. Economou and P. Georgiadis", TITLE="Congestion avoidance in high speed interconnected voice data traffic {LANs}", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", VOLUME="17 NUMBER=4", PAGES="242-250", YEAR=1994, REFERENCES=11, KEYWORDS="fddi; HSLAN; interconnection; LAN; MAN", ABSTRACT="This paper presents congestion avoidance protocols in high speed interconnected LANs carrying both voice and data traffic. The networks are assumed to be interconnected by bridges. The protocols proposed rely on the periodic transmission of MAC control frames, called congestion notification frames, from the bridge to the source stations.", } @ARTICLE{Rubi9401:Distributed, AUTHOR="Harvey Rubin and N. Natarajan", TITLE="A distributed software architecture for telecommunication networks", JOURNAL=ieeenet, VOLUME=8, NUMBER=1, PAGES="8-17", MONTH="January/February", YEAR=1994, REFERENCES=18, KEYWORDS="INA; TMN; RM-ODP; IN; intelligent networks; OSCA; CMIP", ABSTRACT="The Information Networking Architecture (INA) brings together distributed computing, telecommunications, and management standards in a framework for telecommunications software design.", } @ARTICLE{Rubi9401:Input, AUTHOR="I. Rubin and Kuang-Shin Lin", TITLE="Input rate flow control for high speed communications networks using burst level feedback control", JOURNAL=ett, ADDRESS="Italy", VOLUME=5, NUMBER=1, PAGES="107-123", YEAR=1994, REFERENCES=16, KEYWORDS="ATM; source policing; flow control", 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 signalling messages to the stations. These messages allow the stations to adapt their credit increment rates in accordance with system burst loading conditions.", } @ARTICLE{Sa9411:Telecommunications, AUTHOR="Ronaldo Sa", TITLE="Telecommunications in Brazil: The Role of the Private Sector", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="44-45", MONTH="Nov", YEAR=1994, KEYWORDS="telecommunications; brazil; private sector", ABSTRACT="There are opportunities for the participation of private capital in many niches of the telecommunications field in Brazil.", } @ARTICLE{Saha94:Approximation, AUTHOR="A. Saha and Chengke Wu and D. T. Tang", TITLE="Approximation, Dimension Reduction, and Nonconvex Optimization Using Linear Superpositions of Gaussians", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="This paper concerns neural network approaches to function approximation and optimization using linear superposition of Gaussians (or what are popularly known as Radial Basis Function (RBF) networks). The problem of function approximation is one of estimating an underlying function $f$, given samples of the form $\ldots$ When the dimension of the input is high and the number of samples small, estimation of the function becomes difficult due to the sparsity of samples in local regions. We find that this problem of high dimensionality can be overcome to some extent by using linear transformations of the input in the Gaussian kernels. Such transformations induce intrinsic dimension reduction, and can be exploited for identifying key factors of the input and for the phase space reconstruction of dynamical systems, without explicitly computing the dimension and delay. We present a generalization that uses multiple linear projections onto scalars and successive RBF networks (MLPRBF) that estimate the function based on these scalar values. Such networks are universal and smooth approximators, and they address the problem of data sparsity that plagues most kernel-type estimators. In many applications, such as in control problems, it is necessary to approximate the underlying function from the data, and then suggest inputs that will give some desired output response. The latter is a problem of optimization. We derive some key properties of RBF networks that provide suitable grounds for implementing efficient search strategies for nonconvex optimization within the same framework.", } @BOOK{Sait94:Teletraffic, AUTHOR="H. Saito", TITLE="Teletraffic Technologies in {ATM} Networks", ISBN="0-89006-622-1", PUBLISHER="Artech House", ADDRESS="Boston", YEAR=1994, KEYWORDS="ATM; BISDN; traffic control; resource management; dimensioning; CAC", } @ARTICLE{Sale94:Modified, AUTHOR="K. Saleh and H. Ural and A. Agarwal", TITLE="Modified distributed snapshots algorithm for protocol stabilization", JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.", VOLUME="17 NUMBER=12", PAGES="863-870", YEAR=1994, REFERENCES=16, KEYWORDS="checkpointing technique; communication protocol; fsm", ABSTRACT="This paper assesses the use of Chanz and Lamport's distributed snapshots algorithm (DSA) for stabilizing a communication protocol, a special type of distributed system. We show that wen a loss of coordination occurs during the distributed execution of theprotocol, DSA is not guaranteed to terminate, and therefore it sometimes fails to obtain a global state of snapshot. We proposesome modifications to DSA to solve this problem.", } @ARTICLE{Sali9411:Telecommunications, AUTHOR="E. K. Salia", TITLE="Telecommunications' Role in National Development in Ghana", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="46-47", MONTH="Nov", YEAR=1994, KEYWORDS="telecommunications; national development; ghana", ABSTRACT="In Ghana, widespread availability of telecom services will promote advancement and decentralization of government.", } @ARTICLE{Sand9409:Access, AUTHOR="R. S. Sandhu and Pierangela Samarati", TITLE="Access Control: Principles and Practice", JOURNAL=ieeecm, VOLUME=32, NUMBER=9, PAGES="40-49", MONTH="Sep", YEAR=1994, KEYWORDS="access control; security", ABSTRACT="Access control constrains what a user can do directly, as well as what programs executing on behalf of the users are allowed to do. In this way access control seeks to prevent activity that could lead to breach of security.", } @ARTICLE{Sart94:Partial, AUTHOR="Claudio Sartori and M. R. Scalas", TITLE="Partial Indexing for Non-Uniform Data Distributions in Relational {DBMSs}", JOURNAL=ieeekde, YEAR=1994, ABSTRACT="It is well known that the effectiveness of relational database systems is greatly dependent on the efficiency of the data access strategies. For this reason, much work has been devoted to the development of new access techniques, supported by adequate access structures such as the $B^+$ trees. The effectiveness of the $B^+$ tree also depends on the data distribution characteristics: in particular, poor performance results when the data show strong key value distribution unbalancing. The aim of this paper is to present the partial index: a new access structure which is useful in such cases of unbalancing, as an alternative to the $B^+$ tree unclustered indexes. The access structures are built in the physical design phase and at execution (or compilation) time the optimizer chooses the most efficient access path. Thus, integration of the partial indexing technique in the design and in the optimization process are also described.", } @ARTICLE{Saru9409:Signal, AUTHOR="Masatoshi Saruwatori", TITLE="All-Optical Signal Processing in Ultrahigh-Speed Optical Transmission", JOURNAL=ieeecm, VOLUME=32, NUMBER=9, PAGES="98-105", MONTH="Sep", YEAR=1994, KEYWORDS="optical; signal processing; ultrahigh-speed; optical transmission", ABSTRACT="The coming broadband era will require very high-speed technologies that can handle more than 100-Gb/s for both transmission lines and transmission nodes. Novel all-optical signal processing technologies that offer unsurpassed Performance are urgently required.", } @ARTICLE{Sast94:Stochastic, AUTHOR="P. S. Sastry and M. A. L. Thathachar", TITLE="Analysis of Stochastic Automata Algorithm for Relaxation Labeling", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="A parallel stochastic algorithm for relaxation labeling proposed in [1] is analyzed. For the case of symmetric compatibility functions, it is proved that the algorithm will always converge to a consistent labeling.", } @MASTERSTHESIS{Saud94:Erstellen, AUTHOR="M. Sauder", TITLE="Erstellen eines Tools für die Verkehrsplanung zum Bestimmen der notwendigen Leitungskapazitäten zwischen den Netzelementen innerhalb des {GSM-Netzes} der Mannesmann Mobilfunk {GmbH}", SCHOOL="Technische Universität Dresden, IfN", ADDRESS="Dresden, Germany", PAGES=113, YEAR=1994, LANGUAGE="German", REFERENCES=11, KEYWORDS="network planning; network design", ABSTRACT="Ein Ziel der Arbeit ist die visuelle Darstellung bestehender Netzelemente sowie deren Vernetzung. Die Kalkulation der notwendigen Leitungskapazitäten wurde für verschiedene zeitliche Etappen des Netzausbaus realisiert. Dabei wurden die Auslastung bestehender Leitungselemente unter Berücksichtigung verschiedener Schwellwerte errechnet sowie eine Prognose für geplante Strecken erstellt.", } @ARTICLE{Saul9403:Simulation, AUTHOR="Emilie T. Saulnier and Betty J. Bortscheller", TITLE="Simulation Model Reusability", JOURNAL=ieeecm, VOLUME=32, NUMBER=3, PAGES="64-69", MONTH="Mar", YEAR=1994, REFERENCES=13, KEYWORDS="simulation; reusability; simulation; reuse; software engineering", ABSTRACT="Simulation packages do not provide an effective infrastructure for reusing models, but reuse will become a reality as more tools provide database capabilities and other features.", } @TECHREPORT{Saul94:Argument, AUTHOR="Ashley Saulsbury and Tim Wilkinson and John. B. Carter", TITLE="An Argument for Simple {COMA}", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-15", YEAR=1994, ABSTRACT="We present design details and some initial performance results of a novel scalable shared memory multiprocessor architecture that incorporates the major strengths of several contemporary multiprocessor architectures while avoiding their most serious weaknesses. Specifically, our architecture design incorporates the automatic data migration and replication features of cache-only memory architecture (COMA) machines, but replaces much of the complex hardware of COMA with a software layer that manages page-grained cache space allocation, as found in distributed virtual shared memory (DVSM) systems. Unlike DVSM however, pages are sub-divided into cache-line sized blocks, and for shared pages the coherence of these blocks is maintained by hardware. Moving much of COMA's hardware functionality to software simplifies the machine design and reduces development time, while supporting fine-grain coherence in hardware greatly decreases the impact of DVSM software overheads. We call the resulting hybrid hardware and software multiprocessor architecture Simple COMA. By allowing shared data to be replicated in a node's main memory (in addition to its caches), the number of remote memory accesses is greatly reduced compared to a traditional cache coherent non-uniform memory access (CC-NUMA) architecture. Preliminary results indicate that despite the reduced hardware complexity and the need to handle allocation page faults in software, the performance of Simple COMA is comparable to that of more complex all-hardware designs.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-15--SE.ps.Z", } @INPROCEEDINGS{Scal94:Shared, AUTHOR="Daniel J. Scales and Monica S. Lam", TITLE="The Design and Evaluation of a Shared Object System for Distributed Memory Machines", BOOKTITLE=osdi, PAGES="101-114", YEAR=1994, ABSTRACT="This paper describes the design and evaluation of SAM, a shared object system for distributed memory machines. SAM is a portable run-time system that provides a global name space and automatic caching of shared data. SAM incorporates mechanisms to address the problem of high communication overheads on distributed memory machines; these mechanisms include tying synchronization to data access, chaotic access to data, prefetching of data, and pushing of data to remote processors. SAM has been implemented on the CM-5, Intel iPSC/860 and Paragon, IBM SPI, and networks of workstations running PVM. SAM applications run on all these platforms without modification. \par This paper provides an extensive analysis on several complex scientific algorithms written in SAM on a variety of hardware platforms. We find that the performance of these SAM applications depends fundamentally on the scalability of the underlying parallel algorithm, and whether the algorithm's communication requirements can be satisfied by the hardware. Our experience suggests that SAM is successful in allowing programmers to use distributed memory machines effectively with much less programming effort than required today.", } @PHDTHESIS{Schö94:Kopplung, AUTHOR="W. Schödl", TITLE="Kopplung von {DQDB-Regionalnetzen} mit {ATM-Weitverkehrsnetzen:} Architektur, Steuerstrategien und Leistungsverhalten", SERIES="Bericht über verkehrstheoretische Arbeiten", SCHOOL="Universität Stuttgart, Elektrotechnik, IND", ADDRESS="Stuttgart, Germany", VOLUME=58, YEAR=1994, LANGUAGE="German", KEYWORDS="approximation; architecture; ATM; B-ISDN; DQDB; fluid flow model; interconnection; MAN; modeling; WAN", } @INPROCEEDINGS{Schf94:Verteilte, AUTHOR="S. Schöf and M. Sonnenschein and R. Wieting", TITLE="Verteilte Simulation von {THOR-Netzen}", BOOKTITLE="Workshop über parallele und verteile Simulation - Bericht Nr. AIS 21", ADDRESS="Oldenburg, Germany", PAGES="20-25", YEAR=1994, LANGUAGE="German", REFERENCES=17, KEYWORDS="distributed simulation; petri net", ABSTRACT="In dieser Arbeit werden die wesentlichen Konzepte des zugrundeliegenden Netzmodells der THORNs kurz beschrieben. Danach werden die im Projekt DNS (Distributed Net Simulation) des Oldenburger Forschungs- und Entwicklungsinstituts für Informatik-Werkzeuge und -Systeme (OFFIS) verwendeten Werkzeuge und Strategien zur verteilten Simulation solcher Netze dargestellt.", } @INPROCEEDINGS{Schi94:Modelling, AUTHOR="I. Schieferdecker", TITLE="Performance Modelling with Structured Actions", BOOKTITLE="International Workshop on Quality of Communication-Based Systems", EDITOR="G. Hommel", ISBN="ISBN: 0-7923-3259-8", INSTITUTION="GMD FOKUS", PUBLISHER="Kluwer Academic Publishers", PAGES="85-104", YEAR=1994, } @INPROCEEDINGS{Schl94:Simulationskerne, AUTHOR="R. Schlagenhaft and C. Sporrer", TITLE="Simulationskerne für verteilte und shared-memory Architekturen", BOOKTITLE="Workshop über parallele und verteile Simulation - Bericht Nr. AIS 21", ADDRESS="Oldenburg, Germany", PAGES="3-7", YEAR=1994, LANGUAGE="German", REFERENCES=5, KEYWORDS="shared resource; simulation; time warp", ABSTRACT="Es wurde ein Time-Warp-Simulatorkern für ein verteiltes Rechnernetz entwickelt, der die gleiche Modellschnittstelle bietet wie ein von der University of Calgary entwickelter Kern für die virtual-shared-memory Rechner KSR1 bzw. KSR2. Simulationsmodelle können auf beiden Kernen unverändert simuliert werden. Als Performancemodelle zur Evaluierung und dem Vergleich der beiden Kerne wurden zwei Modelle f r SS7-Netzwerke verwendet. Die erreichbaren S", } @ARTICLE{Schm9402:Spezifikation, AUTHOR="L. Schmickler", TITLE="Die spezifikation einer Q3-Schnittstelle am Beispiel des optischen Anschlußnetzes", JOURNAL=ntz, ADDRESS="Germany", VOLUME=47, NUMBER=2, PAGES="78-84", YEAR=1994, LANGUAGE="German", REFERENCES=7, KEYWORDS="network management; protocol specification", ABSTRACT="TMN Standard Q3", } @BOOK{Schm94:ISO, AUTHOR="C. Schmauch", TITLE="{ISO} 9000 for Software Developers", ISBN="0-87389-246-1", PUBLISHER="ASQC Quality Press", ADDRESS="Wisconsin", YEAR=1994, REFERENCES=35, KEYWORDS="ISO; overview; software; software engineering; standard", ABSTRACT="This book provides an easy-to-understand introduction to ISO 9000 quality standards for software development professionals and corporations. It is written at an introductory level that delivers a basic explanation of what is required to achieve ISO 9000 conformance and registration for the software development environment. Topics include: Introduction to ISO 9000 standards Standard elements of the standards Characteristics of an ISO 9000 qual", } @ARTICLE{Scho94:Optimal, AUTHOR="Dan Schonfeld", TITLE="Optimal Structuring Elements for the Morphological Pattern Restoration of Binary Images", JOURNAL=ieeepami, VOLUME=16, YEAR=1994, ABSTRACT="In this paper, we derive the optimal structuring elements of morphological filters in image restoration. The expected pattern transformation of random sets is presented. A mathematical framework for the solution of statistical inference problems for random sets is subsequently proposed. The statistical inference framework proposed is based on the least mean difference (LMD) estimator. The least mean difference (LMD) estimator is defined to minimize the cardinality of the expected pattern transformation of the set-difference of the parameter and the estimate. Several important results for the determination of the least mean difference (LMD) estimator are derived. The least mean difference (LMD) structuring elements of morphological filters in image restoration are finally derived.", } @ARTICLE{Schr9402:Local, AUTHOR="F. Schreiber", TITLE="Local correlation of occupancy of the finite buffer queue {M/M/1/N}", JOURNAL="AEÜ Hirzel-Verlag", ADDRESS="Stuttgart, Germany", VOLUME=48, NUMBER=2, PAGES="63-67", YEAR=1994, REFERENCES=14, KEYWORDS="M/M/1/S; loss probability; correlation", ABSTRACT={In order to characterize the correlation properties of the random variable "occupancy X", the formula of the so called local correlation coefficient is derived as a supplement to the CDF(X), whose level G\_N is equal to the loss prob.}, } @ARTICLE{Schu94:Zeitspiel, AUTHOR="M. Schumann and A. Lobinger", TITLE="Zeitspiel", JOURNAL=ix, ADDRESS="Germany", VOLUME=11, PAGES="168-173", YEAR=1994, LANGUAGE="German", REFERENCES=6, KEYWORDS="operating system; time stamp; time to completion", ABSTRACT="Verfahren zur Messung der Laufzeit von Prozessen unter Unix werden am Beispiel von SunOS und Solaris vorgestellt", } @INPROCEEDINGS{Seda94:Mosaic, AUTHOR="Jeff Sedayao", TITLE={"Mosaic Will Kill My Network!" - Studying Network Traffic Patterns of Mosaic Use}, BOOKTITLE="Second World Wide Web Conference: Mosaic and the Web", YEAR=1994, URL="http://www.ncsa.uiuc.edu/SDG/IT94/Proceedings/DDay/sedayao/mos\_traf\_paper.html", } @INPROCEEDINGS{Seib94:MIMD, AUTHOR="W. Seibold and M. Götzer", TITLE="Design of a {MIMD} Supported Simulator for High Speed {LAN's}", BOOKTITLE="Workshop über parallele und verteile Simulation - Bericht Nr. AIS 21", ADDRESS="Oldenburg, Germany", PAGES="11-13", YEAR=1994, LANGUAGE="German", REFERENCES=7, KEYWORDS="distributed simulation; hardware; simulation", ABSTRACT="Vorstellung eines Projekts zur hardwareoptimierten parallelen Simulation von Hochgeschwindigkeitskommunikationsnetzen.", } @ARTICLE{Seit9401:User, AUTHOR="N. B. Seitz and Stephen. Wolf and Stephen Voran and Randy Bloomfield", TITLE="User-Oriented Measures of Telecommunication Quality", JOURNAL=ieeecm, VOLUME=32, NUMBER=1, PAGES="56-67", MONTH="Jan", YEAR=1994, KEYWORDS="user-oriented measures; telecommunication quality; standardization", ABSTRACT="Objective, perception-based measures of telecommunication service quality are being standardized in national and international committees.", } @BOOK{Seli94:Real, AUTHOR="B. Selic and G. Gullekson and P. W. Ward", TITLE="Real-Time Object-Oriented Modeling", ISBN="0-471-59917-4", PUBLISHER="Wiley \& Sons", ADDRESS="New York", YEAR=1994, REFERENCES=101, KEYWORDS="modeling; object-oriented programming; real time; software engineering", ABSTRACT="This book offers: A single consistent set of graphical modeling concepts, chosen to improve developer effectiveness, which apply uniformly to analysis, design, and implementation. This reduces the learning curve to master the entire method and eliminates expensive discontinuities across different stages of development. An approach to the object paradigm that is easy to learn and that applies to the construction of reusable architectural desig", } @ARTICLE{Seun94:Spin, AUTHOR="J. Seung-Ju and K. Gil-Yong", TITLE="Spin-Block Synchronization Algorithm in The Shared Memory Multiprocessor System", JOURNAL=acmosrev, PAGES="15-30", YEAR=1994, REFERENCES=15, KEYWORDS="memory management; multiprocessor system; shared resource", ABSTRACT="In this paper a new algorithm for spin-block synchronization ina multiprocessor system is proposed. It is based on type of queue lock and block lock.", } @ARTICLE{Sevc9402:Application, AUTHOR="K. C. Sevcik", TITLE="Application scheduling and processor allocation in multiprogrammed parallel processing systems", JOURNAL=pe, ADDRESS="Amsterdam, Netherlands", VOLUME=19, NUMBER="2-3", PAGES="107-140", YEAR=1994, REFERENCES=46, KEYWORDS="multiprocessor; scheduling; response time; service time; estimation", ABSTRACT="When large-scale multiprocessors for parallel processing are subjected to heavy diverse workloads of applications, it will be necessary to schedule them in a multiprogrammed fashion in order to use the system resources effectivly and keep response times low. Information about the characteristics of individual applications can be used to achieve effective scheduling. The paper proposes parameters for characterizing applications.", } @ARTICLE{Shan9407:Simulation, AUTHOR="K. S. Shanmugan", TITLE="Simulation and Implementation Tools for Signal Processing and Communication Systems", JOURNAL=ieeecm, VOLUME=32, NUMBER=7, PAGES="36-41", MONTH="Jul", YEAR=1994, KEYWORDS="simulation; signal processing; communication systems", ABSTRACT="It is now possible to move easily from a top level simulation model of a system toward its implementation.", } @ARTICLE{Shar9406:Universality, AUTHOR="J. Sharony and T. E. Stern and Yuheng Li", TITLE="The Universality of Multidimensional Switching Networks", JOURNAL=ieanep, ISBN="1063-6692", VOLUME=2, NUMBER=6, PAGES="602-611", YEAR=1994, REFERENCES=19, KEYWORDS="switching network; hierarchical", ABSTRACT="Multidimensional switching networks are networks that utilize more than one degree of freedom (e.g., space, wavelength, time, code). The main idea is to use several dimensions of practical size in hierarchical multiplexing to overcome the physical constraints present when using only one dimension of large size. The article generalized the case of a one-dimensional switching networks to k-dimensional switching networks.", } @ARTICLE{Shas94:Projective, AUTHOR="Amnon Shashua", TITLE="Projective Structure from Uncalibrated Images: Structure from Motion and Recognition", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="We address the problem of reconstructing 3D space in a projective framework from two or more views, and the problem of artificially generating novel views of the scene from two given views (re-projection). We describe an invariance relation which provides a new description of structure, we call projective depth, which is captured by a single equation relating image point correspondences across two or more views and the homographies of two arbitrary virtual planes. The framework is based on knowledge of correspondence of features across views, is linear, extremely simple, and the computations of structure readily extends to over-determination using multiple views. Experimental results demonstrate a high degree of accuracy in both tasks - reconstruction and re-projection.", } @PROCEEDINGS{Shep94:4, TITLE="4th International Workshop on Network and Operating System Support for Digital Audio and Video", EDITOR="Doug Shepherd and Gordon Blair and G. Coulson", ISBN="3-540-58404-8", ORGANIZATION="ACM/IEEE", PUBLISHER="Springer-Verlag", ADDRESS="New York", VOLUME=846, YEAR=1994, } @ARTICLE{Shin94:Analytic, AUTHOR="Kang G. Shin and Chien-Long Hou", TITLE="Analytic Models of Adaptive Load Sharing Schemes in Distributed Real-Time Systems", JOURNAL=ieeepds, YEAR=1994, ABSTRACT="In a distributed real-time system, non-uniform task arrivals may temporarily overload some nodes while leaving some other nodes idle. As a result, some of the tasks on an overloaded node may miss their deadlines even if the overall system has the capacity to meet the deadlines of all tasks. In a companion paper [1], we proposed, without any modeling analysis, a decentralized, dynamic load sharing (LS) scheme as a solution to this problem. In this paper, we develop analytic queueing models to comparatively evaluate the proposed LS scheme as well as three other schemes: no LS, LS with random selection of a receiver node, and LS with perfect information. The evolution of a node's load state is modeled as a continuous-time semi-Markov process, where cumulative execution time (CET) rather than the commonly-used queue length (QL), is employed to describe the workload of a node. Not only fundamental differences among the different LS schemes are addressed in the analytic models, but also implementation overheads are taken into account. Several metrics relevant to real-time performance are derived from these models: in particular, we evaluate the probability of a task missing its deadline, called the probability of dynamic failure. The proposed scheme is compared against other LS schemes using these performance metrics. The validity of analytic models is checked with simulations. Both analytic and simulation results indicate that by using judicious exchange/use of state information and Bayesian decision mechanisms, the proposed scheme makes a significant improvement over other existing LS schemes in minimizing the probability of dynamic failure.", } @ARTICLE{Shin94:Time, AUTHOR="Kang G. Shin and Hyun Kim", TITLE="A Time Redundancy Approach to {TMR} Failures Using Fault-State Likelihoods", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="Failure to establish a majority among the processing modules in a triple modular redundant (TMR) system, called a TMR failure, is detected by using two voters and a disagreement detector. Assuming that no more than one module becomes permanently faulty during the execution of a task, Re-execution of the task on the Same HardWare (RSHW) upon detection of a TMR failure becomes a cost-effective recovery method, because (i) the TMR system can mask the effects of one faulty module while RSHW can recover from non-permanent faults, and (ii) system reconfiguration - Replace the faulty HardWare, reload, and Restart (RHWR) - is expensive both in time and hardware. We propose an adaptive recovery method for TMR failures by ``optimally'' choosing either RSHW or RHWR based on the estimation of the costs involved. We apply the Bayes theorem to update the likelihoods of all possible states in the TMR system with each voting result. Upon detection of a TMR failure, the expected cost of RSHW is derived with these likelihoods and then compared with that of RHWR. RSHW will continue either until it recovers from the TMR failure or until the expected cost of RSHW becomes larger than that of RHWR. As the number of unsuccessful RSHWs increases, the probability of permanent fault(s) having caused the TMR failure will increase, which will, in turn, increase the cost of RSHW. Our simulation results show that the proposed method outperforms the conventional reconfiguration method using only RHWR under various conditions.", } @ARTICLE{Shu94:Vector, AUTHOR="Chiao Fe Shu and Raj Jain", TITLE="Vector Field Analysis for Oriented Patterns", JOURNAL=ieeepami, YEAR=1994, ABSTRACT="We present a method, based on the properties of vector fields, for the estimation of a set of symbolic descriptors (node, saddle, star-node, improper-node, center, and spiral) from linear orientation fields. Planar first-order phase portraits are used to model the linear orientation fields. A weighted linear estimator is developed to estimate linear phase portraits, using only the flow orientation. A classification scheme for planar first-order phase portraits, based on their local properties: curl, divergence, and deformation is developed. We present results of experiments on noise-added synthetic flow patterns and real oriented textures.", } @BOOK{Sieg94:ATM, AUTHOR="G. Siegmund", TITLE="{ATM:} Die Technik des Breitband-ISDN: 2., berarb. u. erw. Auflage", ISBN="3-7685-3994-6", PUBLISHER="Kommunikation \& Technik, v. Decker", ADDRESS="Heidelberg, Germany", YEAR=1994, LANGUAGE="German", REFERENCES=16, KEYWORDS="ATM; B-ISDN; LAN; MAN; signalling; switching", } @TECHREPORT{Sime94:Prototype, AUTHOR="Palmen L. Simeonov and I. Miloucheva", TITLE="Prototype Performance Evaluation of Multimedia Service Components", INSTITUTION="TUB-PRZ (Technische Universität Berlin)", ADDRESS="Berlin, Germany", YEAR=1994, KEYWORDS="JVTOS; ATM; temporal logic of actions (tla+); sics protocol implementation measurement system (spims)", ABSTRACT="This paper deals with a formal approach for decomposition and description of multimedia service components and their performance analysis. This approach is based on TLA+ (Temporal Logic of Actions) specifications. A TLA+ based specification of multimedia components is transformed into porocess model types supported by SPIMS (SICS Protocol Implementation Measurement System). The multimedia components prototype derived in this way is then evaluated with the SPIMS tool for different QoS parameters. We present and discuss scenarios for using this method for performance analysis to the Audio-Visual communication (AVC) component of the Joint-Viewing and Tele-Operation Service (JVTOS) which is described as a consistent set of activities with the TLA+ formal technique. The paper describes results that we achieved in th framework of the RACE project TOPIC. The performance analysis of the multimedia prototypes using SPIMS application is based on the TCP/IP and XTP protocols running on FDDI and ATM networks.", } @ARTICLE{Simm9407:Strategy, AUTHOR="Jane Simmons", TITLE="A strategy for designing error detection schemes for general data networks", JOURNAL=ieeenet, VOLUME=8, NUMBER=4, PAGES="41-48", MONTH="July/August", YEAR=1994, REFERENCES=10, KEYWORDS="error detection; CRC; protocol design", ABSTRACT="The author presents a five-step methodology that provides insight into the order in which errors should be considered when designing an error detection scheme, which types of error detection mechanisms are most effective, and which layer should be responsible for detecting a given type of error.", } @ARTICLE{Simm9410:Interfacing, AUTHOR="Annette Simmons", TITLE="Interfacing Numbers with People: Lessons in Quality Measurement Techniques", JOURNAL=ieeecm, VOLUME=32, NUMBER=10, PAGES="36-41", MONTH="Oct", YEAR=1994, KEYWORDS="interfacing; quality measurement techniques; TQM", ABSTRACT="The secret of successful TQM is integration of all elements. Some of the most important lessons learned have centered around the issue of interfacing people with numbers.", } @ARTICLE{Siva94:Lightwave, AUTHOR="Kumar N. Sivarajan and R. Ramaswami", TITLE="Lightwave Networks Based on de Bruijn Graphs", JOURNAL=ieanep, VOLUME="2 NUMBER=1", PAGES="70-79", YEAR=1994, REFERENCES=14, KEYWORDS="graph theory; multihop; shufflenet", ABSTRACT="This paper proposes de Bruijn graphs as logical topologies for multihop lightwave networks. After deriving bounds on the throughput and delay performance of any logical topology, throughput and delay performance of de Bruijn graphs for two different routing schemes are computed and compared with the bounds and performance of shufflenets. For a given maximum nodal in- and out-degree and average number of hops between stations, a logical topology", } @TECHREPORT{Sjol94:Fixpoint, AUTHOR={Thomas Sj"oland and Da Sahlin}, TITLE="Fixpoint Analysis of Type and Alias in {AKL} Programs", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R94-13b", YEAR=1994, ABSTRACT="We have defined and implemented a method for analysis of the CCP language AKL in the spirit of abstract interpretation that uses a static set of semantic equations which abstracts the concurrent execution of an AKL program. The method strictly separates the setting up of the equation system from the solving of the system with a fixpoint procedure. The computation strategies used, results for a number of test programs and the conclusions we draw from this experimental effort are reported. The software implementing the system described herein, is deliverable number D.WP.1.6.1.M2 in the ESPRIT project ParForce 6707.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-13b--SE.ps.Z", } @ARTICLE{Smit9411:Telecommunications, AUTHOR="Philip Smith and Gregory C. Staple", TITLE="Telecommunications Sector Reform", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="50-53", MONTH="Nov", YEAR=1994, KEYWORDS="telecommunications; sector reform", ABSTRACT="Once a government is persuaded that encouraging new ser- vice suppliers is likely to close the gap between demand and supply, hard choices must be made about how to proceed.", } @ARTICLE{Smit94:Distributed, AUTHOR="Ralph J. Smith and D. G. Griffiths", TITLE="Distributed Management of Future Global Multi-Service Networks", JOURNAL="British Telecommunications Engineering", ADDRESS="Great Britain", VOLUME=13, PAGES="221-226", YEAR=1994, REFERENCES=12, KEYWORDS="network management", ABSTRACT="Multi-Service Networks - wide range of services Definition of a service includes quality of service, target and guaranteed minimum provision times, availability, ... Standardised service models using managed objects Advantages of distributed management: fault tolerance, faster response, local knowledge, less administration traffic, limit time zone problems Agent technology: coordinating, intelligent, autonomous agents Agents have a generic part", } @INPROCEEDINGS{Sobr94:Multiple, AUTHOR="J. L. Sobrinho and J. M. Brazio", TITLE="A Multiple Access Protocol for Integrated Voice and High-Speed Data in Wireless Networks", BOOKTITLE=pmrc, ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", PAGES="1264-1270", YEAR=1994, REFERENCES=14, KEYWORDS="mobile radio; multiple access; packet radio", ABSTRACT="An asynchronous multiple access protocol is presented for integrated voice/data communications in wireless networks, whereby the base station coordinates the uplink access of terminals within its cell with short control- ling messages. Voice terminals are given access rights to the channel in a round-robin order, and transmit variable length packets to adapt to congestion. On the other hand, data termi- nals have to contend for air-time with mi", } @ARTICLE{Sohr94:Bursty, AUTHOR="K. Sohraby and M. Sidi", TITLE="On the Performance of Bursty and Modulated Sources Subject to Leaky Bucket Rate-Based Access Control Schemes", JOURNAL="IEEE trans. on comp. systems", VOLUME="C-42", PAGES=10, YEAR=1994, KEYWORDS="ATM; performance evaluation; access control; modeling; markov process; leaky bucket; bursty traffic; connection admission control", } @ARTICLE{Sosi94:Efficient, AUTHOR="Rok Sosic and Jun Gu", TITLE="Efficient Local Search With Conflict Minimization: A Case Study of the N-Queens Problem", JOURNAL=ieeekde, YEAR=1994, ABSTRACT="Backtracking search is frequently applied to solve a constraint-based search problem but it often suffers from exponential growth of computing time. We present an alternative to backtracking search: local search based on conflict minimization. We have applied this general search framework to study a benchmark constraint-based search problem, the $n$-queens problem. An efficient local search algorithm for the $n$-queens problem was implemented. This algorithm, running in linear time, does not backtrack at all. It is capable of finding a solution for extremely large size $n$-queens problems. For example, on a workstation computer, it can find a solution for 3,000,000 queens in less than 55 seconds.", } @BOOK{Span94:Dienste, AUTHOR="O. Spaniol and C. Popien and B. Meyer", TITLE="Dienste und Dienstvermittlung in Client/Server-Systemen", PUBLISHER="Thomson's Aktuelle Tutorien", ADDRESS="Germany", YEAR=1994, LANGUAGE="German", KEYWORDS="distributed system", } @ARTICLE{Span94:Evolution, AUTHOR="O. Spaniol", TITLE="The Evolution of Wireless Networking: Conformance or Conflict with the {OSI} Reference Model?", JOURNAL="Personal, Indoor and Mobile Radio Communications (PMRC)", ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", PAGES="786-793", YEAR=1994, REFERENCES=32, KEYWORDS="cellular system; mobile radio; packet radio; radio channel", ABSTRACT="Wireless technologies form one of today's most dynamic and interesting markets in the field of commu- nication systems. The introduction of digital second generation systems and the development of third gener- ation systems offering integrated services will merge areas that are often still separated nowadays, like speech, synchronous and asynchronous data and multi- media services. Since wireless networking is rooted in telecommunication, futur", } @ARTICLE{Stag9411:ITU, AUTHOR="Domenico Stagliano", TITLE="The {ITU's} Role in the Restructuring Revolution", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="48-49", MONTH="Nov", YEAR=1994, KEYWORDS="ITU; restructuring revolution", ABSTRACT="The ITU recognizes a twofold mission: monitoring regulatory and technological developments and linking restructuring changes to basic telecommunication development needs.", } @TECHREPORT{Staj94:Writing, AUTHOR="Frank Stajano", TITLE="Writing Tcl Programs in the Medusa Applications Environment", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 94-7", NOTE="Proceedings of Tcl/Tk Workshop, New Orleans, June 1994", YEAR=1994, ABSTRACT="Medusa is an applications environment for distributed multimedia which has been designed and developed at the Olivetti Research Laboratory in Cambridge, U.K. The software building blocks, or modules, are written in C++, while the applications that create networks of modules and make useful things with them are written in Tcl/Tk/TCL-DP.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.94.7.ps.Z", } @ARTICLE{Stal9410:Back, AUTHOR="W. Stallings", TITLE="Back to Basics: Cryptographic Algorithms", JOURNAL="Connexions", VOLUME=8, NUMBER=10, PAGES="2-11", MONTH="Oct", YEAR=1994, REFERENCES=7, KEYWORDS="cryptographic algorithms; public keys; RSA; digital signature; DSS; secure hash functions; MD5; secure hash algorithm; security", } @BOOK{Stal94:Advances, AUTHOR="W. Stallings", TITLE="Advances in Local and Metropolitan Area Networks", ISBN="0-8186-5042-7", PUBLISHER="IEEE Computer Society Press", ADDRESS="Los Alamitos, California", YEAR=1994, REFERENCES=105, KEYWORDS="interface; internetworking; LAN; MAN; overview; performance evaluation; standardization", } @INPROCEEDINGS{Stam94:Multiple, AUTHOR="D. Stamatelos and Anthony Ephremides", TITLE="Multiple Access Capability of Indoor Wireless Networks Using Spatial Diversity", BOOKTITLE=pmrc, ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", PAGES="1271-1275", YEAR=1994, REFERENCES=9, KEYWORDS="radio channel; spatial channel reuse", ABSTRACT="In this paper we address the improvement in multiple access capability of an indoor wlreless network that is achieved when equipment employing adaptive ar- rays is used. We speciflcally apply thls improvement to the problem of optimal base-station placement. In the past we have considered indoor environments with con- ventional omnidirectional antennas. In this study we consider indoor wireless aystems using adaptive arrays at the base-stations", } @ARTICLE{Stas9406:Adaptation, AUTHOR="G. I. Stassinopoulos and others", TITLE="Performance Evaluation of Adaptation Functions in the {ATM} Environment", JOURNAL=ieeecom, ISBN="0090-6778", VOLUME="COM-42", NUMBER=6, PAGES="2335-2344", YEAR=1994, REFERENCES=16, KEYWORDS="ATM; performance evaluation; ISDN; protocol", ABSTRACT="The paper models and evaluates key design issues for the Adaption Layer in ATM networks. The role and efficient design of the adaption layer is crucial for future B-ISDN based on ATM. The article concentrates on packet-mode adaption services analyzing and simulating relevant protocols employed for narrowband ISDN signaling and packet data. Processing and transmission resources are modeled.", } @ARTICLE{Stee9403:Systematic, AUTHOR="Peter Steenkiste", TITLE="A Systematic Approach to Host Interface Design for High-Speed Networks", JOURNAL="{IEEE} Computer", VOLUME=27, NUMBER=3, PAGES="47-57", YEAR=1994, KEYWORDS="optimize; cache; dma; copy; hardware", } @ARTICLE{Stee9410:Baldrige, AUTHOR="Marion M. Steeples", TITLE="The Baldrige Award and {ISO} 9000 in the Quality Management Processes", JOURNAL=ieeecm, VOLUME=32, NUMBER=10, PAGES="52-57", MONTH="Oct", YEAR=1994, KEYWORDS="baldrige award; ISO 9000; quality management processes", ABSTRACT="As global competitiveness has escalated the race for ever- improving quality, Baldrige and ISO 9000 have become pivotal forces in evolving quality improvement toward universal criteria defining what quality is and how it is achieved.", } @ARTICLE{Stef94:L, AUTHOR="J. B. Stefani and Roberto Kung and Y. Lepeti", TITLE="L'architecture à long terme {SERENITE}", JOURNAL="L'écho des Recherches", ADDRESS="Issy-les-Moulineaux, France", VOLUME=157, YEAR=1994, KEYWORDS="architecture; distributed processing; IN; intelligent network; network architecture", ABSTRACT="... L'idée fondamentale consiste à considérer un réseau comme un système réparti ouvert et à appliquer les principes du traitement réparti ouvert defini dans le modèle de référence ODP (Open Distributed Processing) ...", } @INPROCEEDINGS{Stei94:Human, AUTHOR="R. Steinmetz", TITLE="Human Perception of Audio-Visual Skew", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="235-252", YEAR=1994, } @BOOK{Stev94:TCP, AUTHOR="W. Richard Stevens", TITLE="{TCP/IP} illustrated: the implementation", ISBN="0-201-63354-X", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", VOLUME=2, YEAR=1994, KEYWORDS="TCP; IP; debugging; network protocol implementation", } @BOOK{Stev94:TCP1, AUTHOR="W. Richard Stevens", TITLE="{TCP/IP} illustrated: the protocols", ISBN="0-201-63346-9", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", VOLUME=1, YEAR=1994, KEYWORDS="TCP; IP; debugging; network protocols", } @UNPUBLISHED{Stol94:Lokalisierungsdienst, AUTHOR="René Stolp", TITLE="Lokalisierungsdienst für Mitarbeiter zur Teilnahme an {AV-Konferenzen} auf Login-Basis", INSTITUTION="Technische Universität Berlin, Fachgebiet Offene Kommunikationssysteme", ADDRESS="Berlin, Germany", NOTE="Instructor: Tom Pfeifer", YEAR=1994, LANGUAGE="German", REFERENCES=1, KEYWORDS="conference control; locating users; rwho; rusers; finger; directory service; login; idle time; client-server; user location", ABSTRACT="Ziel des Projektes war die Erstellung eines Lokalisierungsdienstes in einem UNIX-Netzwerk.", } @ARTICLE{Su94:Throughput, AUTHOR="Yu Ted Su and JianJang Huang", TITLE="Throughput Analysis and Optimal Design of Banyan Switches with Bypass Queues", JOURNAL="IEEE trans. on comp. systems", VOLUME="C-42", PAGES=4, YEAR=1994, KEYWORDS="ATM; performance evaluation; switching network; banyan network", } @ARTICLE{Sun94:Comments, AUTHOR="Cha-Hon Sun and Stephen Wang", TITLE="Comments on ``Distributed Algorithms for Network Recognition Problems''", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="Ramarao [1] proposes distributed algorithms to recognize five network topologies. In this paper, we first use a counter example to comment that the approach in [1] of recognizing a star topology is incomplete. Then we propose two modified approaches to do the work.", } @ARTICLE{Sun94:Fault, AUTHOR="Jing Sun and E. Cerny and J. Gecsei", TITLE="Fault-Tolerance in a Class of Sorting Networks", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="The early study of fault-tolerance in efficient sorting networks only achieved single-fault tolerance. By eliminating critical comparators, Rudolph presented a 1-fault tolerant design of the balanced sorting network (BSN) at the cost of one redundant stage of N/2 comparators and two permuters external to the network. In this paper, we show, however, that 1-fault tolerance of BSN can be achieved without introducing redundancy and external permuters. Furthermore, we provide solutions to the open question of how to achieve multiple-fault tolerance in BSN. We analyze the problem from a higher-level by introducing a new concept of critical stages, and find that all stages in previous designs are critical. A 2-fault tolerant design of BSN is then discovered after eliminating its critical stages. The new design has a similar network architecture (i.e., a multistage network with the output recirculated back to the input) and the same hardware cost as Rudolph's, but it has many distinguished features: It becomes 3-fault tolerant by duplicating the redundant stage. It can be generalized to a $(k+1)$-fault tolerant design if $1<=k$ redundant stages are added; and the resulting network has no critical stages but critical $(k+1)$-tuples of stages. Sorting would fail if and only if all stages of a critical $(k+1)$-tuple are faulty. It can be extended to new topologies with an arbitrary number of stages, without external permuters, that may achieve an arbitrary degree of fault-tolerance. The performance analysis shows that the new designs achieve much higher probabilities of correct sorting in the presence of faulty comparators than the previous reported designs.", } @ARTICLE{Suzu9404:ATM, AUTHOR="T. Suzuki", TITLE="{ATM} Adaptation Layer Protocol", JOURNAL=ieeecm, VOLUME=32, NUMBER=4, PAGES="80-83", MONTH="Apr", YEAR=1994, KEYWORDS="ATM; adaptation layer protocol; aal type5; adaptation layer; AAL", ABSTRACT="The proposed AAL type 5 will reduce protocol processing and transmission overhead.", } @INPROCEEDINGS{Syka94:Communication, AUTHOR="E. Sykas and E. P. Adamidis", TITLE="On the Communication Among {UMTS} {DDB} Domains", BOOKTITLE="RACE Mobile Telecommunications Workshop", PAGES="450-454", YEAR=1994, KEYWORDS="distributed database; internetworking; mobile radio", ABSTRACT="In this paper the communication among UMTS DDB domains is considered. During the past MONET work on UMTS DDB, the so called 'black box' approach was adopted without taking into account the distribution of user/terminal data. However, the movement of users/terminals among areas covered by different operators/networks results in a distribution and exchange of user/terminal data among these domains. A functional model is proposed for the communicq", } @ARTICLE{Tage94:Lichtleitermodell, AUTHOR="O. Tageman", TITLE="Lichtleitermodell für {HSpice} Modellieransätze für die Design-Simulation und -Optimierung", JOURNAL="Elektronik", ADDRESS="Germany", VOLUME=22, PAGES="118-126", YEAR=1994, KEYWORDS="simulation; simulation model; technology", } @ARTICLE{Taka9410:Network, AUTHOR="Masahiro Taka and T. Abe", TITLE="Network Reliability Design Techniques to Improve Customer Satisfaction", JOURNAL=ieeecm, VOLUME=32, NUMBER=10, PAGES="64-69", MONTH="Oct", YEAR=1994, KEYWORDS="network reliability; network design techniques; customer satisfaction", ABSTRACT="NTT has developed network design techniques including reliability measures, specifications, and design methodologies to improve customers' satisfaction with the reliability of telecommunication services.", } @ARTICLE{Taki94:Discrete, AUTHOR="T. Takine and B. Sengupta and Toshiharu Hasegawa", TITLE="An Analysis of a Discrete-Time Queue for Broadband {ISDN} with Priorities among Traffic Classes", JOURNAL="IEEE trans. on comp. systems", VOLUME="C-42", PAGES=9, YEAR=1994, KEYWORDS="ATM; classification; B-ISDN; priority; discrete time queue; queueing system", } @PHDTHESIS{Tang94:Modellierung, AUTHOR="M. Tangemann", TITLE="Modellierung und Analyse von lokalen Hochgeschwindigkeitsnetzen mit zeitgesteuerten Token Passing-Medienzugriffsprotokollen", SCHOOL="Universität Stuttgart, Elektrotechnik, IND", ADDRESS="Stuttgart, Germany", VOLUME=57, YEAR=1994, LANGUAGE="German", KEYWORDS="analysis; decomposition; FDDI; high speed; HSLAN; MAN; media access control; modeling; performance evaluation; polling; time control; token passing; token system", } @INPROCEEDINGS{Tawb94:End, AUTHOR="Wassim Tawbi and A. Fladenmuller and E. Horlait", TITLE="End-system {QOS} Management of Multimedia Applications", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="203-215", YEAR=1994, } @INPROCEEDINGS{Tayl94:Hiperlan, AUTHOR="L. Taylor", TITLE="The Hiperlan {MAC} Sub-Layer Architecture", BOOKTITLE=pmrc, ISBN="90-5199-193-2", ADDRESS="Amsterdam, Netherlands", YEAR=1994, REFERENCES=4, KEYWORDS="multiple access; network architecture; packet radio", ABSTRACT="There are two main activities under way in the standardization of Wireless LANs. In the USA, the most important activity is that of the IEEE 802.11 committee. In Europe, ETSI RES 10 is developing a standard called H i p e r lan. Hiperlan addresses the requirements of high performance data communications for LAN traffic over a radio channel. Hiperlan assumes that the population of the LAN is likely to be dynamic i.e. inherent to Hiperlan behavio", } @ARTICLE{Temp94:Z, AUTHOR="J. Templ", TITLE="Z richer Spezialität", JOURNAL=ix, ADDRESS="Germany", VOLUME=9, PAGES="138-143", YEAR=1994, LANGUAGE="German", REFERENCES=5, KEYWORDS="C++; programming language", ABSTRACT="Während sich C++ im industriellen Umfeld im Aufwind befindet, schickt sich die Programmiersprache Oberon an, das Erbe von Pascal im Ausbildungsbereich anzutreten. Eine Gegen berstellung beider Sprachen zeigt deren Konzepte und Unterschiede.", } @ARTICLE{Thak94:Algorithms, AUTHOR="Arun K. Thakore and Shaowen Su and H-K. Lam", TITLE="Algorithms for Asynchronous Parallel Processing of Object-Oriented Databases", JOURNAL=ieeekde, YEAR=1994, ABSTRACT="Management of large quantities of complex data is essential in many advanced application areas. Object-Oriented (OO) database management systems have been developed to effectively model and process the complex domain knowledge. They have been shown to outperform some existing relational systems. The existing implementations of OO database management systems attempt to improve the efficiency of OO queries by explicitly capturing the relationships among objects. However, the execution of complex queries involving the retrieval of objects from many classes and relationships among them causes the existing systems to operate inefficiently. In this paper, we present parallel algorithms for the processing of queries against a large OO database. The algorithms are based on a closed model of query processing using pattern-based access instead of the conventional value-based access. During processing, the algorithms avoid the execution of time-consuming join operations by making use of the explicitly stored object associations. Generation of large quantities of temporary data is avoided by marking objects using their identifiers and by employing a two-phase query processing strategy. A query is processed by concurrent multiple waves, thereby improving parallelism and avoiding the complexities introduced in their sequential implementation. The correctness and the performance of the parallel algorithms have been tested and analyzed by running parallel programs on a 32-node Transputer based parallel machine designed and developed at the IBM Research Center at Yorktown Heights. Benchmark queries of different semantic complexities are generated and their performance is analyzed for various data and query parameters.", } @ARTICLE{Thib94:Fast, AUTHOR="C. Thibeault and Y. Savaria and J. L. Houle", TITLE="A Fast Method to Evaluate the Optimum Number of Spares in Defect-Tolerant Integrated Circuits", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="In this paper, we present a method to accelerate the search for the number of spares to be included in defect-tolerant integrated circuits. Our method is obtained by bringing two modifications to a conventional evaluation method. The main motivations behind the development of this method are: the possibilities offered by the implementation of defect tolerance, the existence of many yield models, which may predict different results in terms of optimum number of spares, and the fact that some models are very compute intensive. The modeling methods leading to several usual yield models are briefly presented here. We also present results showing that our method is valid for a wide range of parameters. Moreover, this method can be applied to all with yield models considered here and it can significantly reduce the time spent in the search for the best possible reconfiguration strategies.", } @ARTICLE{Thie94:Gleichzeitig, AUTHOR="U. Thiemann", TITLE="Gleichzeitig berall", JOURNAL=ix, ADDRESS="Hannover, Germany", VOLUME=7, PAGES="152-156", YEAR=1994, REFERENCES=6, KEYWORDS="distributed processing; parallel computing; parallel software", ABSTRACT="Mehrere Rechner in einem Netzwerk zu einer parallelen virtuellen Maschine zusammenzufassen bietet den Vorteil, ohne zusätzlicheInvestitionen die vorhandene Rechenleistung nutzen zu können. Mit Hilfe von PVM ist dies als verhältnismäßig leicht installierbare reine Softwarelösung realisierbar.", } @BOOK{Tich94:Configuration, AUTHOR="W. F. Tichy", TITLE="Configuration Management", ISBN="0-471-94245-6", PUBLISHER="Trends in Software (2), John Wiley \& Sons", YEAR=1994, KEYWORDS="software; software engineering", ABSTRACT="Software Configuartion Management is an established discipline with proven benefits for the software industry. Automation of many of the procedures reduces considerably the tedium of traditional configuration management techniques , as well as providing better and faster services, and a reduction in errors. This latest volume in the Trends in Software series provides a sampling of current work to develop new tools and techniques designed to im", } @ARTICLE{Tind94:High, AUTHOR="R. F. Tinder and R. I. Klaus and J. A Snodderley", TITLE="High Speed Microprogrammable Asynchronous Controller Modules", JOURNAL=ieeetc, YEAR=1994, ABSTRACT="A unique family of high speed, microprogrammable asynchronous controller (MAC) modules is described in this paper. Each MAC module consists of two fundamental mode machines that communicate by means of a handshake interface that permits it to be driven by any programmable logic device including ROMs. Any state machine controller designed with a MAC module will operate free of critical races, essential hazards and output race glitches, and will have static hazard-free state variables. A multiplicity of programmable logic devices can be used to drive one or more MAC modules to achieve complex, but reliable, asynchronous, time-shared and/or parallel processing of data. Individual MAC modules having state variables numbering $l,m,n,\ldots$ can be cascaded to produce an available system state capacity of $2^l \times 2^m \times 2^n \times \ldots$ states with up to $(l+m+n+\ldots)$-way transition capability, all without compromising speed or reliability.", } @MASTERSTHESIS{Tisc94:Stochastische, AUTHOR="T. Tischer", TITLE="Stochastische Fluid-Flow-Modelle für {ATM-Multiplexer}", EDITOR="M. Baumann", TYPE="Diplomarbeit", SCHOOL="TU Dresden, IfN-TK", ADDRESS="Dresden, Germany", PAGES=64, YEAR=1994, LANGUAGE="German", REFERENCES=7, KEYWORDS="ATM; multiplexer; buffer; fluid flow model; performance evaluation; approximation; decomposition", ABSTRACT="Theoretische Aufarbeitung und Implementierung (C) von Verfahrenzur Analyse des Fluid-Flow-Modells eines ATM-Multiplexers mit endlichem Puffer und heterogener, burstartiger Verkehrslast. Umfaßt Kronecker-Dekomposition der Systemmatrizen zur Lösung des Eigengrößen-Problems und Approximationstechniken für das Randwertproblem.", } @ARTICLE{Tiso9401:Selective, AUTHOR="C. Tison and H. Bruneel", TITLE="Selective repeat {ARQ} with memory", JOURNAL="AEÜ Hirzel Verlag", ADDRESS="Stuttgart, Germany", VOLUME=48, NUMBER=1, PAGES="55-57", YEAR=1994, REFERENCES=6, KEYWORDS="ARQ; selective repeat protocol; performance evaluation", ABSTRACT="We investigate the throughput efficiency of a selective repeat ARQ scheme, in which multiple contigous copies of each data block are sent instead of one single copy and whereby at the receiver side several copies are combined to make a decision. Two different demodulation schemes are considered.", } @ARTICLE{To94:Multistar, AUTHOR="Philip P. To and Takshing P. Yum and Y.-W. Leung", TITLE="Multistar Implementation of Expandable Shuffle Nets", JOURNAL=ieanep, VOLUME="2 NUMBER=4", PAGES="344-351", YEAR=1994, REFERENCES=13, KEYWORDS="network; shufflenet; star; WDM", ABSTRACT="Shuffle Net is one of the many architectures proposed for multihop lightwave networks. Its advantages include low mean-internodal distance and simple routing. Modular growth of Shuffle Nets, however, is generally difficult and requires many hardware and software reconfigurations. In this paper, we consider a multistar implemntation of Shuffle Net and discuss how a (p,k) Shuffle Net can be expanded to a (p,k+1) Shuffle Net in modular phases, whe", } @BOOK{Torn94:Taschenbuch, AUTHOR="W. Tornow", TITLE="Taschenbuch der Nachrichtentechnik: Ingenieurwissen für die Praxis", PUBLISHER="Schiele \& Schön", ADDRESS="Germany", YEAR=1994, LANGUAGE="German", KEYWORDS="B-ISDN; IN; intelligent network; ISDN; iso reference model; mobile radio; multimedia; network; optical switching; signalling; standardization", } @ARTICLE{Tran9407:Simulation, AUTHOR="William H. Tranter and Kurt Kosbar", TITLE="Simulation of Communication Systems", JOURNAL=ieeecm, VOLUME=32, NUMBER=7, PAGES="26-35", MONTH="Jul", YEAR=1994, KEYWORDS="simulation; communication systems", ABSTRACT="When a complex system and a complex channel model are encountered, the result is typically a design or analysis problem that cannot be solved using traditional mathematical analysis.", } @INPROCEEDINGS{Tran94:Discrete, AUTHOR="P. Tran-Gia", TITLE="Discrete-Time Analysis of Usage Parameter Control Functions in {ATM} Systems", BOOKTITLE="Architecture and Protocols for High-Speed Networks", EDITOR="Otto Spaniol and André Danthine and Wolfgang Effelsberg", ISBN="0-7923-9512-3", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston/London/Dordrecht", PAGES="111-132", YEAR=1994, } @ARTICLE{Trin9411:Seeking, AUTHOR="Josefina Trinidad-Lichauco", TITLE="Seeking Sustained Development in the", JOURNAL=ieeecm, VOLUME=32, NUMBER=11, PAGES="38-39", MONTH="Nov", YEAR=1994, KEYWORDS="telecommunications infrastructure", ABSTRACT="Growth of the telecommunications infrastructure has been given impetus through the PHILIPPINES 2000 plan.", } @ARTICLE{Tsan94:Detecting, AUTHOR="S. Tsang and E. H. Magill", TITLE="Detecting Feature Interactions in the Intelligent Network", JOURNAL="Feature Interactions in Telecommunications Systems, IOS Press", ISBN="90-5199-165-7", ADDRESS="Amsterdam, Netherlands", PAGES="236-248", YEAR=1994, REFERENCES=18, KEYWORDS="IN; intelligent network", ABSTRACT={This paper describes a distributed run-time approach to detecting feature interactions. The technique monitors feature and resource state transitions in run-time and by comparing these to "state signatures", which represent valid state transitions. It is possible to determine if a feature is operating correctly. It is assumed that incorrect operation is caused by feature interaction. The approach requires no centralised "a priori" knowledge of}, } @ARTICLE{Tsit94:Efficient, AUTHOR="George D. Tsitsiklis and John N. Stamoulis", TITLE="Efficient Routing Schemes for Multiple Broadcasts in Hypercubes", JOURNAL=ieeepds, YEAR=1994, ABSTRACT="We analyze the following problem: Each node of the binary hypercube independently generates packets according to a Poisson process with rate $L$; each of the packets is to be broadcast to all other nodes. Assuming unit packet length and no other communications taking place, we observe that the system can be stable in steady-state only if the load factor $P^(def) L[(2^d - 1)/d]$ satisfies $P<1$, where $d$ is the dimensionality (diameter) of the hypercube; moreover, we establish some lower bounds for the steady-state average delay $D$ per packet. We devise and analyze two distributed routing schemes which are efficient, in the following sense: Stability is maintained for all $P