@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",