@TECHREPORT{Unit85:DoD, AUTHOR="United States Department of Defense", TITLE="{DoD} {WGS-1984} - Its Definition and Relationships with Local Geodetic Systems", TYPE="Report", INSTITUTION="United States Department of Defense", ADDRESS="Washington, DC", NUMBER="AD-A188 815 DMA; 612", YEAR=1995, KEYWORDS="GPS; longitude; latitude; geographic location", } @INPROCEEDINGS{Käpp9408:Synchronisation, AUTHOR="Thomas Käppner and F. Henkel and M. Müller and A. Schröer", TITLE="Synchronisation in einer verteilten Entwicklungs- und Laufzeitumgebung für multimediale Anwendungen", BOOKTITLE="Jahrestagung der Gesellschaft für Informatik (GI): Innovationen bei Rechen- und Kommunikationssystemen", INSTITUTION="IBM Heidelberg", ADDRESS="Hamburg", MONTH="August/September", YEAR=1995, LANGUAGE="German", KEYWORDS="packet audio; packet video; multimedia objects; intramedia synchronization; intermedia synchronization", ABSTRACT="Integrierte Multimediasysteme ermöglichen neuartige Anwendungen, deren Qualität vom Nutzer jedoch an der Qualität analoger Lösungen gemessen wird. Einen Beitrag zur Akzeptanz dieser Anwendungen ist die Realisierung von Synchronisationsmechanismen, die die zeitlich korrekte Wiedergabe von erzeugten und bearbeiteten Audio- und Videodaten sicherstellen. Die Distributed Multimedia Objects (DMO) Services bilden eine Plattform zur Unterstützung multimedialer Anwendungen. Anwendungen spezifieren ihre Anforderungen an die Bearbeitung und Synchronisation multimedialer Dienste durch Objekte, die dann zur Ausführungszeit in einer Echtzeitumgebung realisiert werden. Dieser Artikel beschreibt die prinzipiellen Methoden zur Synchronisation von Medien auf Endsystemen und ihr Integration in die DMO Services.", } @BOOK{Tann95:Practical, AUTHOR="Michael Tanner", TITLE="Practical Queueing Analysis", ISBN="0-07-709078-0", PUBLISHER="McGraw-Hill", ADDRESS="London", YEAR=1995, KEYWORDS="queueing theory; probability; statistics", } @ARTICLE{Chou9505:Copyright, AUTHOR="A. K. Choudhury and N. F. Maxemchuk and Sunil Paul and Henning Schulzrinne", TITLE="Copyright Protection for Electronic Publishing over Computer", JOURNAL=ieeenet, VOLUME=9, NUMBER=3, PAGES="12-20", MONTH="May/June", YEAR=1995, REFERENCES=33, KEYWORDS="electronic publishing; WWW; security", ABSTRACT="One of the major challenges faced by electronic publishing is that of preventing individuals from easily copying and illegally distributing electronic documents. The authors explore the use of cryptographic protocols to discourage the distribution of illicit electronic copies, and propose an architecture and two separate strategies for making electronic document distribution secure.", URL="ftp://gaia.cs.umass.edu/pub/Chou9505:Copyright.ps.gz", } @ARTICLE{Schu9507:IPv6, AUTHOR="Henning Schulzrinne", TITLE="{IPv6} -- The New {Internet} Protocol", JOURNAL=pik, VOLUME=18, NUMBER=3, PAGES="165-167", MONTH="July-September", YEAR=1995, REFERENCES=1, KEYWORDS="Internet; IPng; IPv6; network protocol; network layer", URL="http://www.cs.columbia.edu/~hgs/papers/Schu9507\_IPv6.ps.gz", } @ARTICLE{Armi9501:How, AUTHOR="Grenville Armitage and Keith M. Adams", TITLE="How inefficient is {IP} over {ATM} anyway?", JOURNAL=ieeenet, VOLUME=9, NUMBER=1, PAGES="18-26", MONTH="January/February", YEAR=1995, REFERENCES=14, KEYWORDS="ATM; IP; traffic characteristics; efficiency", ABSTRACT="The impending introduction of long and short haul links based on ATM has led to its application to packet services such as the DARPA Internet Protocol (IP). Some earlier work on IP traffic between IP routers (WAN traffic) has led to concerns over the efficiency of using small cells. The authors describe the results of IP traffic traces taken within a departmental LAN over a 16-day period. This traffic is used to drive a model of IP-over-ATM to analyze the real efficiency of the technique.", } @ARTICLE{Wats9501:Demand, AUTHOR="G. N. Watson and A. Albrecht and J. Curcio and Daniel Dave and Steven Goody and J. Grinham and M. P. Spratt and Patricia A. Thaler", TITLE="The demand priority {MAC} protocol", JOURNAL=ieeenet, VOLUME=9, NUMBER=1, PAGES="28-34", MONTH="January/February", YEAR=1995, REFERENCES=8, KEYWORDS="Ethernet; Demand Priority; media access; LAN", ABSTRACT="The Demand Priority MAC protocol, currently being standardized in IEEE 802.12, offers substantial benefits over the CSMA/CD protocol of IEEE 802.3. By preserving both the curren wiring infrastructure and investment in software, and by using the very simple Demand Priority MAC protocol, 100 Mb/s LANs could soon be as low-cost as 10Base-T is today.", } @ARTICLE{Wals9501:GIGAswitch, AUTHOR="Robert J. Walsh and Cüneyt M. Özveren", TITLE="The {GIGAswitch} control processor", JOURNAL=ieeenet, VOLUME=9, NUMBER=1, PAGES="36-43", MONTH="January/February", YEAR=1995, REFERENCES=5, KEYWORDS="router; switch; FDDI; bridge; hardware; control processor; cache; ARP; hashing", ABSTRACT="Concerns about guaranteed forward progress and high performance can be addressed in a networking device. Guaranteed progress is provided by proper queueing, buffer quota, and interrupt strategies. High performance is provided by efficient multicast, constant-time address searches, and minimized cache refills from main memory.", } @BOOK{Come95:Internetworking1, AUTHOR="D. Comer", TITLE="Internetworking with {TCP/IP}", EDITION="3rd", ISBN="0-13-216987-8", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs, New Jersey", VOLUME=1, YEAR=1995, KEYWORDS="computer networks; TCP/IP; internet", } @UNPUBLISHED{Buch95:Pilotversuch, AUTHOR="Andreas Buchelt and Rolf Heidemann", TITLE="Pilotversuch der Deutschen Telekom ``Interaktive Video-Dienste Berlin''", INSTITUTION="Alcatel SEL", ADDRESS="Berlin and Stuttgart, Germany", NOTE="project description leaflet", YEAR=1995, KEYWORDS="video on demand; MPEG", ABSTRACT="Briefly describes the Berlin video-on-demand trial using a hybrid fiber/coax architecture. 120 GByte of MPEG-coded movies are stored for about 50 users.", } @TECHREPORT{Kala95:TCP, AUTHOR="L. Kalampoukas and A. Varma", TITLE="Performance of {TCP} over Multi-hop {ATM} Networks: A Comparative Study of {ATM-Layer} Congestion Control Schemes", INSTITUTION="University of California, Santa Cruz", ADDRESS="Santa Cruz, CA 95064 USA", NUMBER="UCSC-CRL-95-13", YEAR=1995, ABSTRACT="We study the performance of TCP/IP over multi-hop ATM network by simulating an effort to evaluate the effectiveness of various congestion control schemes at the ATM layer. The congestion control schemes considered are the ATM-Early Packet Discard and link-level flow control. The performance of these schemes are compared against that of an ATM layer with no congestion control, as well as TCP/IP over as datagram network. We compare the schemes in terms of the throughput obtained by long and short connections, number of retransmissions, end-to-end delays, and fairness in bandwidth allocation between connections with unequal round-trip delays. Our results show that significant unfairness in the amount of bandwidth allocated to connections may result in a large ATM network if no congestion control policies are used at the ATM layer. The ATM-EPD scheme is able to remove some of the unfairness, providing performance close to that of a datagram network., but can still provide unacceptable performance if the buffer sizes in the switches are small. Link-level flow control provided the best performance among the studied schemes.", URL="ftp://ftp.cse.ucsc.edu/pub/tr/ucsc-crl-95-13.ps.Z", } @ARTICLE{Ster9507:Report, AUTHOR="J. P. Sterbenz and Henning Schulzrinne and Joseph D. Touch", TITLE="Report and Discussion on the {IEEE} ComSoc {TCGN} Gigabit Networking Workshop 1995", JOURNAL=ieeenet, VOLUME=9, NUMBER=4, PAGES="9-21", MONTH="July/August", YEAR=1995, REFERENCES=7, KEYWORDS="ATM; TCP/IP; Internet; high-speed networks", ABSTRACT="The strong message provided by the contributions to this year's workshop is that a number of researchers are concerned with the practical implications of running TCP/IP over ATM, and most of those dealing with higher layer issues use TCP/IP over ATM out of expediency.", URL="http://www.cs.columbia.edu/~hgs/papers/Ster9507\_Report.ps.gz", } @TECHREPORT{Morr95:Detailed, AUTHOR="R. M. Morris", TITLE="Detailed Behavior of {TCP} over {ATM}", INSTITUTION="Harvard University", YEAR=1995, KEYWORDS="ATM; TCP; congestion control; partial packet discard", ABSTRACT="A number of studies [Romanow93] [Minden94] have shown that TCP can perform badly over ATM networks, often wasting up to half the available bandwidth. In contrast, TCP peforms well over packet-switched networks. This paper explores the causes of this difference and suggests some solutions. A previous study [RomFloyd94] demonstrates that TCP works better if switches drop whole packets rather than individual cells, a technique called Early Packet Discard. The reason suggested is that otherwise bandwidth is wasted by transmitting fragments of partially dropped packets, which the receiving TCP cannot use. This work suggests a different cause of poor TCP performance over ATM, based on detailed observations using hardware monitors in the CreditNet switch. TCP performs well only if the network tends to drop a single packet when TCP increases its window too much. In fact ATM switches tend to drop cells from multiple packets when the window increases too much, causing TCP to pause for a long time rather than continuing with a reduced window. A practical conclusion from this is that TCP might work better if it could recover quickly from multiple dropped packets, as well as single drops. Such a solution might be easier than developing the hardware required for Early Packet Discard in ATM switches. This is a simplified version of a paper written by H. T. Kung and Robert Morris to appear in GLOBECOM .", URL="http://www.eecs.harvard.edu/~rtm/tcp-atm/tcp-atm-1.html", } @BOOK{Kuma95:MBone, AUTHOR="V. Kumar", TITLE="{MBone:} Interactive Multimedia On The {Internet}", ISBN="1-56205-397-3", PUBLISHER="Macmillan Publishing (Simon \& Schuster)", YEAR=1995, KEYWORDS="MBONE; Internet; multicast; interactive multimedia", URL="http://www.mcp.com", } @BOOK{Save95:MBONE, AUTHOR="Kevin Savetz and Neill Randall and Yves Lepage", TITLE="{MBONE:} Multicasting tomorrow's {Internet}", ISBN="1-56884-723-8", PUBLISHER="IDG Books", ADDRESS="Foster City, CA", YEAR=1995, KEYWORDS="MBONE; Internet; multicast; interactive multimedia", } @ARTICLE{Rous9503:Dynamic, AUTHOR="George Rouskas and Mahmoud Ammar", TITLE="Dynamic Reconfiguration in Multihop {WDM} Networks", JOURNAL=jhsn, VOLUME=4, NUMBER=3, PAGES="221-238", YEAR=1995, ABSTRACT="We consider multichannel multihop lightwave networks with stations equipped with a small number of transmitters and receivers. By assigning wavelengths to the receivers and transmitters at each station, one can define the logical connectivity of the network independently of the underlying physical topology. The advent of fast tunable optical transmitters and receivers makes it feasible to dynamically update the network connectivity to accommodate traffic demands that vary over time. Of major concern in such design is how the connectivity should react to changes in traffic patterns. The problem is formulated as a Markovian Decision Process and the properties of the optimal configuration policy are identified. These properties are then used to develop an algorithm for obtaining policies that make decisions similar to the decisions of the optimal policy. A procedure is also proposed to manage the large state space for systems with a large number of stations.", URL="http://www.csc.ncsu.edu/departmental/faculty/G\_Rouskas/WWW/Ar0ra/Journals/JHSN95.ps.Z", } @BOOK{Redl95:Introduction, AUTHOR="Siegmund M. Redl and Michael Weber and Malcolm W. Oliphant", TITLE="An Introduction to {GSM}", ISBN="0-89006-785-6", PUBLISHER="Artech House", ADDRESS="Boston", PAGES=379, YEAR=1995, KEYWORDS="GSM; mobile communications", } @ARTICLE{Voge95:Distributed, AUTHOR="A. Vogel and Brigitte Kerherve and Gregor V. Bochmann and J. Gecsei", TITLE="Distributed Multimedia and {QOS:} A Survey", JOURNAL=ieeemm, VOLUME=2, NUMBER=2, MONTH="Summer", YEAR=1995, ABSTRACT="Quality of service is increasingly important for all components within distributed multimedia systems, as this survey reveals. We discuss QOS parameters found in communication protocols, operating systems, multimedia databases, and file servers, as well as those directly affecting the human user.", URL="http://www.computer.org/multimedia/mu1995/u2toc.htm", } @BOOK{Maie95:8, AUTHOR="Gunther Maier and Andreas Wildberger", TITLE="In 8 Sekunden um die Welt", EDITION="4th", ISBN="3-89319-944-6", PUBLISHER="Addison-Wesley", ADDRESS="Bonn, Germany", YEAR=1995, LANGUAGE="German", KEYWORDS="Internet; tutorial; WWW; gopher; WAIS; telnet; ftp", } @BOOK{Hals95:Data, AUTHOR="F. Halsall", TITLE="Data communications, computer networks and open systems", EDITION="4th", ISBN="0-201-42293-X", PUBLISHER="Addison Wesley", ADDRESS="Wokingham, England", YEAR=1995, KEYWORDS="networking; tutorial; data communications; modems; encryption; coding; error detection; X.25; X.75; IP; CLNP; X.500; ASN.1", } @BOOK{Stee95:Routing, TITLE="Routing in Communications Networks", EDITOR="Martha Steenstrup", ISBN="0-13-010752-2", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1995, KEYWORDS="telecommunications; switching systems; routing; Internet", } @MANUAL{ISO95:Revised, AUTHOR="I. S. O/IEC", TITLE="Revised Working Draft on: Framework for Formal Methods in Conformance Testing", ORGANIZATION="ISO/IEC and ITU-T", NOTE="Project JTC1/SC21/WG7/P54", YEAR=1995, } @MANUAL{ISO95:CD13236, AUTHOR="I. S. O", TITLE="13236: Information Technology -- Quality of Service Framework -- Part: 1", ORGANIZATION="ISO/IEC", ADDRESS="Geneva, Switzerland", YEAR=1995, } @PROCEEDINGS{Demb95:15th, TITLE="15th International Symposium on Protocol Specification, Testing and Verification", EDITOR="P. Dembinski and M. Sredniawa", SERIES="IFIP Transactions", PUBLISHER="North-Holland", ADDRESS="Warsaw, Poland", YEAR=1995, } @PHDTHESIS{Togg95:Efficient, AUTHOR="D. Toggweiler", TITLE="Efficient Test Case Generation for ditributed Systems specified by automata", SCHOOL="University of Bern", YEAR=1995, } @ARTICLE{Scho95:Data, AUTHOR="Hans van der Schoot and H. Ural", TITLE="Data flow oriented test selection for {LOTOS}", JOURNAL=cnis, VOLUME=27, NUMBER=7, PAGES="1111-1136", YEAR=1995, } @PHDTHESIS{Nahm95:Conformance, AUTHOR="Robert Nahm", TITLE="Conformance Testing based on Formal Description Techniques and Message Sequence Charts", SCHOOL="University of Bern", YEAR=1995, } @INPROCEEDINGS{Leue95:Specifying, AUTHOR="S. Leue", TITLE="Specifying Real-Time Requirements for {SDL} Specifications --- a Temporal Logic-Based Approach", BOOKTITLE="15th International Symposium on Protocol Specification, Testing and Verification", EDITOR="P. Dembinski and M. Sredniawa", SERIES="IFIP Transactions", PUBLISHER="North-Holland", ADDRESS="Warsaw, Poland", PAGES="19-34", YEAR=1995, } @INPROCEEDINGS{Kone95:Including, AUTHOR="O. Koné and R. Castanet", TITLE="Including Physical Time Constraints in Conformance", BOOKTITLE="15th International Symposium on Protocol Specification, Testing and Verification", EDITOR="P. Dembinski and M. Sredniawa", SERIES="IFIP Transactions", PUBLISHER="North-Holland", ADDRESS="Warsaw, Poland", PAGES="443-446", YEAR=1995, } @INPROCEEDINGS{Ulri95:Approach, AUTHOR="A. Ulrich and S. T. Chanson", TITLE="An Approach for Testing Distributed Software Systems", BOOKTITLE="15th International Symposium on Protocol Specification, Testing and Verification", EDITOR="P. Dembinski and M. Sredniawa and P. Dembinski", SERIES="IFIP Transactions", PUBLISHER="North-Holland", ADDRESS="Warsaw, Poland", PAGES="107-122", YEAR=1995, } @INPROCEEDINGS{Kris95:Formal, AUTHOR="F. Kristoffersen and M. Phaloppou and J. Tretmans", TITLE="Formal Methods in Conformance Testing --- Tutorial", BOOKTITLE="15th International Symposium on Protocol Specification, Testing and Verification", EDITOR="P. Dembinski and M. Sredniawa", SERIES="IFIP Transactions", PUBLISHER="North-Holland", ADDRESS="Warsaw, Poland", YEAR=1995, } @TECHREPORT{Dama95:Reservation, AUTHOR="Spiridon Damaskos and H. F. Salama", TITLE="Reservation mechanisms for efficient resource management in internetworks", TYPE="Forschungsberichte des Fachbereichs Informatik", INSTITUTION="Technische Universität Berlin", ADDRESS="Berlin, Germany", NUMBER="95-24", YEAR=1995, KEYWORDS="resource reservation; RSVP; multicast; filtering", ABSTRACT="Distributed multimedia applications with quality of service requirements that must be guaranteed by the underlying network are evolving at a fast pace. Resource reservation protocols are essential to enable efficient resource management in internetworks. We survey existing resource reservation protocols and the reservation styles they support. Current protocols do not permit different reservation styles to be combined within the same session. We show, using simulation of realistic scenarios that allowing different reservation styles to coexist within the same session yields more efficient management of resources and provides more satisfactory service to the applications. We then show the need for shared dynamic reservation styles which allow the users to switch between sources without the possibility of service interruption. A complete mechanism for implementing the shared dynamic reservation style is proposed, along with three techniques to enhance its effectiveness in managing the network resources. The effectiveness of these three techniques is evaluated using simulation.", } @TECHREPORT{Mapp95:Preliminary, AUTHOR="G. E. Mapp", TITLE="Preliminary Performance Evaluation of {SandiaXTP} on {ATM} at {ORL}", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 95-10", NOTE="PROMS, Second Workshop on Protocols for Multimedia Systems, Salzburg, Austria, October 1995", YEAR=1995, ABSTRACT="With the deployment of high speed networks based on ATM, multimedia systems are quickly becoming an integral part of distributed computing environments. Protocols which can transport multimedia data are essential for the success of this new enterprise. XTP is one such protocol. In this paper we examine the issues involved in porting SandiaXTP to the ORL's ATM environment and assess its performance using some preliminary tests.", URL="ftp://ftp.cam-orl.co.uk:/pub/docs/ORL/tr95.10.ps.Z", } @TECHREPORT{Bisw95:Representative, AUTHOR="S. K. Biswas and Andrew Hopper", TITLE="A Representative Based Architecture for Handling Mobility in Connection Oriented Radio Networks", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 95-9", NOTE="ICUPC, International Conference on Universal Personal Communications, Tokyo, Japan, November 1995", YEAR=1995, ABSTRACT="This paper presents a connection management architecture tuned for handling mobility in a radio network environment. A new concept of per roaming entity software agent, known as mobile representative, is used for insulating fixed network entities from the effects of user mobility. It is shown that mobile representatives can be used for distributing mobility management within fixed backbone network, depending on the instantaneous physical locations of mobile terminals. This paper describes a representative management architecture followed by a novel connection caching strategy which is used for achieving low-latency and scalable connection handovers.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.95.9.ps.Z", } @TECHREPORT{Brow95:Automatic, AUTHOR="M. R. Brown and Jonathan Foote and Gareth Jones and Karen Sparck-Jones and Steve Young", TITLE="Automatic Content-Based Retrieval of Broadcast News", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 95-8", YEAR=1995, ABSTRACT="This paper presents current work on a video retrieval project at Cambridge University and Olivetti Research Limited (ORL). We show that statistical methods developed for text retrieval are also effective for retrieving and browsing multimedia documents. These methods allow rapid retrieval of news broadcasts by information content determined from teletext subtitles. Information retrieval results for experiments performed on a large archive of news broadcasts are presented. This is made possible by the ORL Medusa system, which allows practical recording, storage, and playback of tens of gigabytes of multimedia data. This work is a step towards practical retrieval of multimedia documents, where the information content is determined from speech recognition performed on the audio soundtrack. We describe the project background, the ORL Medusa multimedia system, and retrieval application, as well as the news broadcast corpus and methods of browsing the retrieved news stories.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.95.8/index.html", } @TECHREPORT{Rich95:Teleporting, AUTHOR="Tristan Richardson", TITLE="Teleporting - Mobile X Sessions", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 95-7", NOTE="Proceedings Ninth Annual X Technical Conference, Boston MA, January 1995", YEAR=1995, ABSTRACT="This paper examines issues involved in making an X session mobile. A mobile X session is one which is not fixed to a particular X display, but can be materialised on demand at any suitable display. The Teleporting System developed at Olivetti Research Laboratory (ORL) is a tool for experiencing mobile X sessions. It provides a familiar, personalised way of making temporary use of X displays as the user moves from place to place. When linked to location facilities such as those provided by the Olivetti Active Badge System the traditional log-in process can be almost entirely eliminated, allowing the nomadic user to easily make use of computing resources which are to hand.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.95.7.html/paper.html", } @TECHREPORT{Benn95:Developments, AUTHOR="Frazer Bennett and Andrew Hopper", TITLE="Developments in Networked Multimedia", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 95-6", YEAR=1995, ABSTRACT="This paper discusses developments in multimedia applications and systems from a network-oriented point of view. We highlight the different generations of network that have been used as substrates for multimedia experiments, focusing particularly on two systems that we have developed. Finally, we look forward to a third generation of network, the subject of more recent attention, which we hope will make ubiquitous, mobile, networked multimedia applications possible.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.95.6.ps.Z", } @TECHREPORT{Staj95:Taming, AUTHOR="Frank Stajano and Richard Walker", TITLE="Taming the Complexity of Distributed Multimedia Applications", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 95-5", NOTE="1995 Usenix Tcl/Tk Workshop, Toronto, July 1995", YEAR=1995, ABSTRACT="The Medusa environment for networked multimedia uses Tcl to compose applications out of low-level processing blocks called modules. A medium-sized application such as a two way multi-stream videophone already uses around one hundred interworking modules, running in parallel on several host machines. This paper shows how we overcome the inherent complexity of such applications: to deal with parallelism we use a multi-threaded library hidden behind a single-threaded Tcl interpreter; to build higher order components than the modules we use the object oriented extension [incr Tcl]; and to exploit the variety of available input and output devices we adopt the Model-View-Controller paradigm.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.95.5.ps.Z", } @TECHREPORT{Clar95:Medusa, AUTHOR="David Clarke", TITLE="The Medusa Video Brick: An {ATM} Camera", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratories", ADDRESS="Cambridge, England", NUMBER="TR 95-4", YEAR=1995, ABSTRACT="This technical report describes the Medusa Video Brick, which is an ATM peripheral for the capture of video. The Video Brick supports multiple concurrent streams of video at different qualities, and connects directly to the Olivetti Research ATM network without requiring the presence of any host workstation.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.95.4.ps.Z", } @TECHREPORT{Chan95:RAID, AUTHOR="A. Chaney and I. Wilson and Andrew Hopper", TITLE="The Design and Implementation of a {RAID-3} Multimedia File Server", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 95-3", NOTE="5th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV), Durham NH, USA, April 1995", YEAR=1995, ABSTRACT="The Olivetti Research Laboratory has developed an experimental system based on intelligent peripherals connected directly to an ATM network. As well as multimedia modules (e.g. audio and video) the system also includes a directly connected RAID-3 storage server called the 'Disc Brick'. This paper describes the architecture of the Disc Brick, and discusses some of the hardware and software issues raised by its design. It also presents measurements taken from a Disc Brick in operation, and discusses how the observations relate to the original design objectives. Finally, the paper attempts to evaluate the Disc Brick as part of ORL's family of directly connected peripherals.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.95.3.ps.Z", } @TECHREPORT{Sama95:Parameterisation, AUTHOR="Ferdinando Samaria and Andy Harter", TITLE="Parameterisation of a Stochastic Model for Human Face Identification", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="95-2", NOTE="2nd IEEE Workshop on Applications of Computer Vision, Sarasota FL, December 1994", YEAR=1995, ABSTRACT="Recent work on face identification using continuous density Hidden Markov Models (HMMs) has shown that stochastic modelling can be used successfully to encode feature information. When frontal images of faces are sampled using top-bottom scanning, there is a natural order in which the features appear and this can be conveniently be modelled using a top-bottom HMM. However, a top-bottom HMM is characterised by different parameters, the choice of which has so far been based on subjective intuition. This paper presents a set of experimental results in which various HMM parameterisations are analysed.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/paper.95.2.ps.Z", } @TECHREPORT{Heap95:Real, AUTHOR="Tony Heap and Ferdinando Samaria", TITLE="Real-Time Hand Tracking and Gesture Recognition Using Smart Snakes", TYPE="Technical Report", INSTITUTION="Olivetti Research Laboratory (ORL)", ADDRESS="Cambridge, England", NUMBER="TR 95-1", YEAR=1995, ABSTRACT="This paper gives architecture and implementation details of a hand tracking and gesture recognition system which has been developed at Olivetti Research Limited as an application for the Medusa distributed multimedia environment. The system uses live 15-bit colour video from a networked camera, runs in real time (25 frames/sec on a DEC Alpha), and copes well with background clutter. Tracking is achieved using the 2D deformable Active Shape Models (smart snakes) of Cootes and Taylor, and a genetic algorithm is used to perform an initial global image search. The Point Distribution Model used for both snakes and genetic algorithms provides a generic and flexible model that can be used to track any 2D deformable object.", URL="ftp://ftp.cam-orl.co.uk/pub/docs/ORL/tr.95.1.ps.Z", } @ARTICLE{Bren9507:Striping, AUTHOR="C. Brendan and Traw S. and Jonathan Smith", TITLE="Striping Within the Network Susbystem", JOURNAL=ieeenet, VOLUME=9, NUMBER=4, PAGES="22-32", MONTH="July/August", YEAR=1995, REFERENCES=16, ABSTRACT="Striping is a general architectural technique for the transparent aggregation of multiple, functionally similar, recources to obtain higher performance. This article establishes a precise terminology for discussing striping and striping techniques, differentiates striping from the more general architectural technique of multiplexing, and outlines the major uses and trade-offs associated with the technique within the network subsystem.", } @ARTICLE{Yang9507:Taxonomy, AUTHOR="C.-L. Yang and A. Reddy", TITLE="A Taxonomy for Congestion Control Algorithms in Packet Switching Networks", JOURNAL=ieeenet, VOLUME=9, NUMBER=4, PAGES="34-45", MONTH="July/August", YEAR=1995, REFERENCES=52, ABSTRACT="The authors propose a new taxonomy for congestion control algorithms in packet switching networks based on control theory. This taxonomy provides a coherent framework for the comparative study of existing algorithms and offers clues toward the development of the new congestion control strategies.", } @ARTICLE{Lee9507:Routing1, AUTHOR="Whay Lee and Michael G. Hluchyj and Pierre A. Humblet", TITLE="Routing Subject to Quality of Service Constraints in Integrated Communication Networks", JOURNAL=ieeenet, VOLUME=9, NUMBER=4, PAGES="46-55", YEAR=1995, LANGUAGE="English", REFERENCES=38, ABSTRACT="With increasingly diverse QOS requirements, it is impractical to continue to rely on conventional routing paradigms that emphasize the search for an optimal path based on a predertermined metric, or a particular function of multiple metrics. Modern routing strategies must not only be adaptive to network charges but also offer considerable economy of scope.", } @BOOK{Kauf95:Network, AUTHOR="Charlie Kaufman and R. Perlman and Mike Speciner", TITLE="Network Security: Private Communication in a Public World", ISBN="0-13-061466-1", PUBLISHER="PTR Prentice Hall", ADDRESS="Englewood Cliffs, NJ", YEAR=1995, KEYWORDS="security; encryption; Internet", } @BOOK{Russ95:Signaling, AUTHOR="Travis Russell", TITLE="Signaling system #7", ISBN="0-07-054991-5", PUBLISHER="McGraw-Hill", ADDRESS="New York", YEAR=1995, KEYWORDS="signaling; SS7; telephony; telecommunications switching systems; MTP; SCCP; TCAP; ISUP", } @BOOK{Welc95:Practical, AUTHOR="Brent B. Welch", TITLE="Practical Programming in Tcl and Tk", ISBN="0-13-182007-9", PUBLISHER="Prentice Hall PTR", ADDRESS="Upper Saddle River, New Jersey", YEAR=1995, KEYWORDS="Tcl; Tk toolkit; programming languages; scripting languages", } @BOOK{Blac95:ATM, AUTHOR="U. Black", TITLE="{ATM} - Foundation for Broadband Networks", ISBN="0-13-297178-X", PUBLISHER="Prentice Hall PTR", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1995, KEYWORDS="ATM; broadband networks; survey; packet switching", } @BOOK{Stei95:Multimedia, AUTHOR="R. Steinmetz and K. Nahrstedt", TITLE="Multimedia: computing, communications and applications", ISBN="0-13-324435-0", PUBLISHER="Prentice Hall PTR", ADDRESS="Upper Saddle River, New Jersey", YEAR=1995, KEYWORDS="multimedia; continuous media; audio; images; graphics; video; animation; data compression; optical storage media; multimedia operating systems; networking systems; multimedia communication systems; database systems; documents; hypertext; MHEG; user interfaces; synchronization; abstractions for programming; multimedia applications", } @TECHREPORT{Waer95:Simplistic, AUTHOR="Annika Waern and Ola Stenborg", TITLE="A simplistic approach to keyhole plan recognition", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="T95-01", YEAR=1995, ABSTRACT="When applying plan recognition to Human - Computer Interaction, one must cope with users exhibiting a large amount of reactive behaviour: users that change tasks, or change strategies for achieving tasks. Most current approaches to keyhole plan recognition do not address this problem. We describe an application domain for plan recognition, where users exhibit reactive rather than plan-based behaviour, and where existing approaches to plan recognition do not perform well. In order to enable plan recognition in this domain, we have developed an extremely simplistic mechanism for keyhole plan recognition, 'intention guessing'. The algorithm is based on descriptions of observable behaviour, and is able to recognize certain instances of plan failures, suboptimal plans and erroneous actions. At run-time, the algorithm only keeps track of a limited number of the most recent actions, which makes the algorithm 'forgetful'. This property makes the algorithm suitable for domains where users frequently change strategies.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--95-01--SE.ps.Z", } @TECHREPORT{Fred95:Proof, AUTHOR="Lars-Âke Fredlund and Jan F. Groote and Henri Korver", TITLE="A Proof of a Leader Election Protocol in {microCRL} ($\mu$CRL)", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R95-01", YEAR=1995, ABSTRACT="In 1982 Dolev, Klawe \& Rodeh presented an O(n log n) unidirectional distributed algorithm for the circular extrema-finding (or leader-election) problem. At the same time Peterson came up with a nearly identical solution. In this paper, we bring the correctness of this algorithm to a completely formal level. This relatively small protocol, which can be described on half a page, requires a rather involved proof for guaranteeing that it behaves well in all possible circumstances. To our knowledge, this is one of the more advanced case-studies in formal verification based on process algebra.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--95-01--SE.ps.Z", } @TECHREPORT{Karl95:Capacity, AUTHOR="G. Karlsson", TITLE="Capacity Reservation in {ATM} Networks", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R95-02", YEAR=1995, ABSTRACT="The research on traffic control has not yet lead to a consensus on how to properly allocate resources in ATM networks. There are consequently no practicable methods available now when the initial deployment of ATM switches and terminals is under way. Yet, many of the applications which motivate the deployment uses multi-media and will thus require some degree of performance guarantees on the information transfer. Here we suggest a readily applicable method for reserving capacity in ATM networks. Cells using the reserved capacity may only depart at fixed time-instances, and have reserved buffers in the network nodes. The scheme gives a lossless performance, can be implemented with low complexity; it simplifies the call-acceptance and allows ``best effort'' traffic to use slack in the reserved and all of the non-reserved capacity.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--95-02--SE.ps.Z", } @TECHREPORT{Ande95:Syntax, AUTHOR="Anders Andersson", TITLE="Syntax Analyzer Generator for Agents", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R95-05", YEAR=1995, ABSTRACT="LALR(1) parser generators in conjunction with imperative programming languages is the standard solution for parsing applications. Contrary to popular belief, this situation is not entirely satisfactory. With imperative tools like Yacc, it is difficult to add actions to a grammar without introducing conflicts. Also, LALR(1) is not powerful enough to meet the needs of languages like C++. We argue that LALR(1) parsing in conjuction with concurrent constraint programming is an interesting option that solves the former problem. We also show how deep guards and don't-know non-determinism can be exploited to solve the latter problem. These ideas have been incorporated in the Saga parser generator described in this report. Saga is an integrated generator for lexical analyzers and parsers. It is based on AKL, a multiparadigm programming language based on a concurrent constraint framework. It is intended both as a research tool to demonstrate the power offered by concurrent constraints, and as a practical tool for the Agents programming system. As a practical tool, Saga features many improvements over tools like Yacc. For example, Saga offers powerful syntax, elegant reporting and resolution of conflicts and powerful error handling in the generated syntax analyzers.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--95-05--SE.ps.Z", } @TECHREPORT{Scho95:Computation, AUTHOR="Erik Schön", TITLE="On the Computation of Fixpoints in Static Program Analysis with an Application to {AKL}", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R95-06", YEAR=1995, ABSTRACT="This report features an introduction to lattice- and fixpoint theory and a survey of methods and recent results for fixpoint computations in static program analysis. As the number of equations in static program analysis tend to be very large, it is extremely important to avoid unnecessary computations and hence to find an optimal order in which to compute the functions. It is also important to have an efficient method for detecting stability. An algorithm satisfying these two requirements is Bourdoncle's algorithm for finding a weak topological ordering of a directed graph which may contain cycles. This algorithm is a generalization of Tarjan's algorithm for finding the strongly connected components of a directed graph. This report presents results from experiments with a fixpoint solver in the analysis framework for AKL (Agents Kernel Language, a concurrent constraint language developed at SICS) using the above ideas showing that a considerable speed-up (up to 3000\%) can be achieved compared to that of a fixpoint solver based on strongly connected components. This is explained by showing how weak topological orders computed by Bourdoncle's algorithm incorporate many intuitively good heuristics. The report also introduces partially argument independent functions, a class of functions particularly suited to the repetitive scheme of computations that arise in fixpoint computations. A function of this type needs to be re-evaluated only with respect to those of its arguments which have changed since its latest evaluation.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--95-06--SE.ps.Z", } @TECHREPORT{Lisp95:Computing, AUTHOR="Björn Lisper", TITLE="Computing in Unpredictable Environments: Semantics, Reduction Strategies, and Program Transformations", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R95-07", YEAR=1995, ABSTRACT="We study systems where deterministic computations take place in environments which may behave nondeterministically. We give a simple formalization by unions of abstract reduction systems, on which various semantics can be based in a straightforward manner. We then prove that under a simple condition on the reduction systems, the following holds: reduction strategies which are cofinal for the deterministic reduction system will implement the semantics for the combined system, provided the environment behaves in a 'fair' manner, and certain program transformations, such as folding and unfolding, will preserve the semantics. An application is evaluation strategies and program transformations for concurrent languages.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--95-07--SE.ps.Z", } @TECHREPORT{Hook95:Adaption, AUTHOR="Kristina Höök", TITLE="Adaption to the User's Task", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R95-08", YEAR=1995, ABSTRACT="Adapting explanations to users with varying background knowledge and abilities is a difficult task: the explanation content, style, amount of details, terms used, etc. may be affected in various ways. We have used our analysis of the information seeking tasks of the users in one particular domain as a basis for adaptation. We structured the domain information into a set of information entities where each entity describes one aspect of a node in the information space. Each information entity is fitted to one or several information seeking tasks, and by combining entities we create an explanation adapted to the user's current task. We do not avoid concepts which are unknown to the user in our information entities. Instead we allow the users to ask follow-up questions on those concepts in order to cater the users' differences in background knowledge. Which follow-up questions are available also depends on the users' current task. Finally, we emphasise the need to make the difference between the adapted explanations obvious to the user. Only then can the users predict which explanations best fit their need and thereby control the self-adaptive mechanisms of the system. So, our system is adaptive to the information seeking task of the user, while the user's knowledge, abilities and roles, are catered for by other means.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--95-08--SE.ps.Z", } @TECHREPORT{Kris95:Best, AUTHOR="Jan Kristoferson", TITLE="Best Probability of Activation and Performance Comparisons for Several Designs of Sparse Distributed Memory", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R95-00", YEAR=1995, ABSTRACT="The optimal probability of activation and the corresponding performance is studied for three designs of Sparse Distributed Memory, namely, Kanerva's original design, Jaeckel's selected-coordinates design and Karlsson's modification of Jaeckel's design. We will assume that the hard locations (in Karlsson's case, the masks), the storage addresses and the stored data are randomly chosen, and we will consider different levels of random noise in the reading address.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--95-09--SE.ps.Z", } @TECHREPORT{Karl95:Fast, AUTHOR="Roland Karlsson", TITLE="Evaluation of a Fast Activation Mechanism for the Kanerva {SDM} Memory", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R95-10", YEAR=1995, ABSTRACT="A method has been found, making it feasable to use large SDM memories on single or `small scale parallel' computers. The method is here described and evaluated.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--95-10--SE.ps.Z", } @TECHREPORT{Kris95:Comments, AUTHOR="Jan Kristoferson", TITLE="Some Comments on the Information Stored in Sparse Distributed Memory", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R95-11", YEAR=1995, ABSTRACT="An unknown number T of random data vectors have been stored in a sparse distributed memory with randomly chosen hard locations. A method is given to estimate T. The estimate is unbiased, and the coefficient of variation is roughly inversely proportional to the square root of MU, where M is the number of hard locations in the memory and U the length of data.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--95-11--SE.ps.Z", } @TECHREPORT{Sjoe95:Improving, AUTHOR="Gunnar Sjoedin", TITLE="Improving the Capacity of {SDM}", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R95-12", YEAR=1995, ABSTRACT="A more efficient way of reading the SDM memory is presented. This is accomplished by using implicit information, hitherto not utilized, to find the information-carrying units and thus removing unnecessary noise when reading the memory.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--95-12--SE.ps.Z", } @TECHREPORT{Sjoe95:Convergence, AUTHOR="Gunnar Sjoedin", TITLE="Convergence and new operations in {SDM}", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R95-13", YEAR=1995, ABSTRACT="A new method for converging in the SDM memory, utilizing the Jaeckel/Karlsson activation mechanism, is presented. A set of new operations to utilize the memory is introduced.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--95-13--SE.ps.Z", } @TECHREPORT{Karl95:Asynchronous, AUTHOR="G. Karlsson", TITLE="Asynchronous Transfer of Video", TYPE="Technical Report", INSTITUTION="Swedish Institute of Computer Science (SICS)", ADDRESS="Kista, Sweden", NUMBER="R95-14", YEAR=1995, ABSTRACT="Video transfers across IP and ATM networks have received much research attention during the last ten years. Various video services are expected in the future, enabled by the rapid development in video coding and broadband network technology. This paper gives an introduction to the issues involved in asynchronous video transfers. Brief overviews of video coding, rate control, multiplexing, as well as delay, error and loss control are given.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--95-14--SE.ps.Z, http://www.sics.se/libindex.html", } @INPROCEEDINGS{Ahuj95:ARCHWAYS, AUTHOR="S. R. Ahuja and J. R. Ensor and Doree Duncan Seligmann", TITLE="{ARCHWAYS:} Making Remote Multimedia Conversations Persistent and Natural", BOOKTITLE="Technology Summit Telecom", INSTITUTION="Bell Labs", YEAR=1995, REFERENCES=10, KEYWORDS="holophonics; stereo localization", ABSTRACT="Archways is a distributed computer program that manages computer- and network-based resources to support multimedia communication sessions within the context of long-term collaborations. The Archways service prototype is built on an underlying services creation and execution environment called MR. MR provides persistent contexts, called meeting rooms, in which services can be created and used. Archways uses the MR rooms to provide its users with a persistent environment for both real-time group interactions and long-term storage of shared information. Real-time interactions are supported by mechanisms for conducting meetings, defining participant meeting roles, coordinating information exchange in multiple media, etc. The persistent environment's long-term memory allows people to schedule meetings, relate one meeting to another, prepare meeting environments, record and replay meeting minutes, etc. This memory can also be used as a message system, allowing people to leave notes and programs for one another in well-known locations. The Archways user interface is based on the concept that conversations among remote parties occur within virtual spaces while the parties remain in their own physical spaces. Therefore, when an Archways user is communicating with another person or program, the system's user interface automatically generates three-dimensional visual and aural displays of the physical environment of the user and relates that to the displays that it generates for virtual communication space. In summary, the interface portrays communication as a natural extension to the familiar, everyday physical environment of the user.", URL="http://www.cs.columbia.edu/~doree/archways/telecom95/Archways.html", } @INPROCEEDINGS{Touc95:Performance, AUTHOR="Joseph D. Touch", TITLE="Performance Analysis of {MD5}", BOOKTITLE=sigcomm, INSTITUTION="ISI", PUBLISHER="ACM", ADDRESS="Boston, Massachusetts", YEAR=1995, REFERENCES=31, KEYWORDS="MD5; checksum; cryptography; authentication; implementation", ABSTRACT="MD5 is an authentication algorithm proposed as the required implementation of the authentication option in IPv6. This paper presents an analysis of the speed at which MD5 can be implemented in software and hardware, and discusses whether its use interferes with high bandwidth networking. The analysis indicates that MD5 software currently runs at 85 Mbps on a 190 Mhz RISC architecture, a rate that cannot be improved more than 20-40\%. Because MD5 processes the entire body of a packet, this data rate is insufficient for current high bandwidth networks, including HiPPI and FiberChannel. Further analysis indicates that a 300 Mhz custom VLSI CMOS hardware implementation of MD5 may run as fast as 256 Mbps. The hardware rate cannot support existing IPv4 data rates on high bandwidth links (800 Mbps HiPPI). The use of MD5 as the default required authentication algorithm in IPv6 should therefore be reconsidered, and an alternative should be proposed. This paper includes a brief description of the properties of such an alternative, including a sample alternate hash algorithm.", URL="http://www.isi.edu/div7/people/touch.home/pubs/sigcomm95.html", } @ARTICLE{Awde9505:Split, AUTHOR="Ra'ed Awdeh and Hussein Mouftah", TITLE="The split-switching network {(SSN):} a high performance multicast {ATM} switch", JOURNAL="International Journal of Communication Systems", VOLUME=8, NUMBER=3, PAGES="191-202", MONTH="May/June", YEAR=1995, } @INPROCEEDINGS{Brin95:Copy, AUTHOR="Sergey Brin and J. Richard Davis and H. Garcia-Molina", TITLE="Copy Detection Mechanisms for Digital Documents", BOOKTITLE=sigmod, INSTITUTION="Stanford University", YEAR=1995, KEYWORDS="copy protection; electronic publishing", ABSTRACT="In a digital library system, documents are available in digital form and therefore are more easily copied and their copyrights are more easily violated. This is a very serious problem, as it discourages owners of valuable information from sharing it with authorized users. There are two main philosophies for addressing this problem: prevention and detection. The former actually makes unauthorized use of documents difficult or impossible while the latter makes it easier to discover such activity. In this paper we propose a system for registering documents and then detecting copies, either complete copies or partial copies. We describe algorithms for such detection and metrics required for evaluating detection mechanisms (covering accuracy, efficiency and security). We also describe a working prototype, called COPS, describe implementation issues, and present experimental results that suggest the proper settings for copy detection parameters.", URL="http://www-db.stanford.edu/pub/brin/1995/copy.ps", } @TECHREPORT{Vive95:Distribution, AUTHOR="Juan Quemada Vives and Tomas de Miguel and A. Azcorra and Santiago Pavon and Joaquin Salvachua and Manuel Petit and Jose Ignacio Moreno and P. L. C. Alonso", TITLE="Distribution of {ABC1995} over the European {ATM} pilot network with the Isabel application", TYPE="Technical Report", INSTITUTION="DIT-UPM and Telefonica I+D, Spain", NUMBER="BRAIN", YEAR=1995, KEYWORDS="CSCW", ABSTRACT="This paper decribes the experience of using the ISABEL application for the distribution of the 1995 RACE Summer School ABC 1995. ABC 1995 has been a massive event where up to forteen auditoriums spread all over Europe have been interconnected during one week. The ISABEL CSCW application together with a broadband ATM subnetwork established over the Pan European ATM Pilot network has provided one of the core elements for the distribution of the lectures, panels and other activities of ABC 1995 and for the interaction between the sites. This paper focusses on the ISABEL application functionality for auditorium based distance learning, on the broadband network used and on the experience gained during ABC 1995.", URL="http://www.dit.upm.es/~brain/bris95.html", } @INPROCEEDINGS{Abde95:Study, AUTHOR="M. H. Abdelaziz and I. Stavrakakis", TITLE="Study of an Adaptive Rate Control Scheme under Unequal Propagation Delays", BOOKTITLE=icc, ADDRESS="Seattle, WA", PAGES="1964-1968", YEAR=1995, KEYWORDS="Adaptive feedback; congestion control; ATM; propagation delay", ABSTRACT="In this paper, a queueing model is developed and analyzed to evaluate the performance of a number of remote and local connections subject to a simple two-level (Binary) adaptive rate control scheme. An efficient technique is developed for the computation of the individual cell loss probabilities of the local and remote connections; the dimensionality of the formulated model is independent of the associated propagation delays. Numerical results quantify the bias against remote connections of buffer management schemes which are fair with respect to connections with equal propagation delays.", } @TECHREPORT{Birm95:Provisioning, AUTHOR="A. Birman and V. Firoiu and R. Guerin and D. Kandlur", TITLE="Provisioning of {RSVP-based} Services over a Large {ATM} Network", TYPE="Research Report", INSTITUTION="IBM Research Division", ADDRESS="T. J. Watson Research Center, Yorktown Heights, New York, New York", NUMBER="RC 20250", YEAR=1995, ABSTRACT="In this work we address the problem of flow establishment with QoS constraints and reservation of resources in an IP network that spands over ATM networks. Specifically we study the interaction and integration of the RSVP protocol using Integrated Services flow specifications with the ATM signaling. Among the issues raised by such an integration are: the interaction between the flow/call establishment protocols, and the translation between flow/call characteristics. For these issues we sketch serveral possible solutions rather than focus on a particular design. Finally we discuss the extensions to RSVP and to the ATM signaling required for the implementation of these solutions", } @BOOK{Kou95:Digital, AUTHOR="Weidong KOU", TITLE="Digital image compression: algorithms and standards", ISBN="0-7923-9626-X", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston", YEAR=1995, KEYWORDS="image coding; JPEG; fax; JBIG; MPEG; fractal compression; video coding; H.261", } @TECHREPORT{Guyt95:Locating, AUTHOR="James D. Guyton and M. Schwartz", TITLE="Locating Nearby Copies of Replicated {Internet} Servers", INSTITUTION="Department of Computer Science, University of Colorado", ADDRESS="Boulder, Colorado", NUMBER="CU-CS-762-95", NOTE="Submitted for publication", YEAR=1995, KEYWORDS="Harvest; WWW; directory services", ABSTRACT="In this paper we consider the problem of choosing among a collection of replicated servers, focusing on the question of how to make choices that segregate client/server traffic according to network topology. We explore the cost and effectiveness of a variety of approaches, ranging from those requiring routing layer support (e.g., anycast) to those that build location databases using application-level probe tools like traceroute. We uncover a number of tradeoffs between effectiveness, network cost, ease of deployment, and portability across different types of networks. We performed our experiments using a simulation parameterized by a topology collected from 7 survey sites across the United States, exploring a global collection of Network Time Protocol servers.", URL="ftp://ftp.cs.colorado.edu/pub/cs/techreports/schwartz/ReplSvrLoc.ps.Z", } @MASTERSTHESIS{Wess95:Intelligent, AUTHOR="Duane Wessels", TITLE="Intelligent Caching for World-Wide Web Objects", SCHOOL="Interdisciplinary Telecommunications Program, University of Colorado", ADDRESS="Boulder, Colorado", YEAR=1995, KEYWORDS="WWW; caching", ABSTRACT="This thesis describes some software designed to improve access to World-Wide Web (WWW) data on the global Internet. The tools used for retrieving WWW objects allow users to be unaware of where the data actually resides. Huge inefficiencies result when objects are repeatedly transmitted across relatively slow wide area network (WAN) connections. A solution to this problem is to install object caches at strategic places in the network. Caches are implemented on proxy servers which act as intermediaries between local clients and remote servers. Frequently accessed objects will already be in the cache thereby speeding delivery time to clients and reducing WAN traffic. Caching proxy servers for the World-Wide Web already exist, most notably the original CERN server. The CERN implementation leaves a lot of room for improvement. The software developed and described here is designed to give a better response to clients and impose less of a load on the server host. Internet servers maintain no state information about client accesses. This leads to an NFS-like model of caching where clients are responsible for maintaining cache consistency. This thesis investigates an AFS-like model whereby server sites issue callbacks to the sites which keep cached copies of the server's data. A cache negotiation protocol is described which gives information providers control of how, and for how long, their data may be distributed throughout remote network caches. The following problems are addressed: The development of a single-process, non-blocking proxy server for lower system load; The maintenance of up-to-date and accurate cache data with minimal network overhead; The design of efficient and robust algorithms for cache management.", URL="http://morse.colorado.edu/~wessels/Proxy/Thesis/", } @TECHREPORT{Yu95:Design, AUTHOR="P. S. Yu and J. Wolf and H. Shachnai", TITLE="Design and Analysis of a Look-ahead Scheduling Scheme to Support Pause-Resume for Video-on-Demand Applications", TYPE="IBM Research Report", INSTITUTION="IBM Research", ADDRESS="Yorktown Height, New York", NUMBER="RC19683", YEAR=1995, KEYWORDS="video-on-demand; VOD", } @BOOK{Frie95:International, AUTHOR="Rob Frieden", TITLE="International Telecommunications Handbook", ISBN="0-89006-568-3", PUBLISHER="Artech House", ADDRESS="Norwood, Massachusetts", YEAR=1995, KEYWORDS="telecommunications policy; telecommunication; international trade; communications capacity", ANNOTE="The actual cost of providing a minute of telephone service between the United States and Europe is roughly $0.25 a minute, but the accounting rate can exceed that by 400\% or more. (p. 134) The accounting rate with Germany in 1992 was 0.8 special drawing rights of $1.14. (p. 138). Contains transmission capacity forecast.", } @BOOK{Tane95:Distributed, AUTHOR="A. S. Tanenbaum", TITLE="Distributed Operating Systems", ISBN="0-13-219908-4", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs", YEAR=1995, KEYWORDS="operating systems", } @MISC{Grou95:Native, AUTHOR="The Parlay Group", TITLE="Native {ATM} Services: Semantic Description", HOWPUBLISHED="{ATM} Forum contribution 95-0008R4", YEAR=1995, KEYWORDS="API interface", } @PHDTHESIS{Leue95:Methods, AUTHOR="S. Leue", TITLE="Methods and Semantics for Telecommunications Systems Engineering", SCHOOL="Universität Bern, Switzerland", YEAR=1995, } @INCOLLECTION{Fowl95:Libraries, AUTHOR="Glenn Fowler and David Korn and Eleftherios Koutsofios and Stephen C. North and Kiem-Phon Vo", TITLE="Libraries and File System Architecture; Intertool Connections", BOOKTITLE="Practical Reusable Unix Software", EDITOR="David G. Belanger and Bala Krishnamurthy", PUBLISHER="John Wiley \& Sons, Inc.", YEAR=1995, } @INPROCEEDINGS{Enge95:Signalling, AUTHOR="R. Engel and T. Bieri and B. Keller", TITLE="Signalling in {ATM} Networks: Experiences With an Object-Oriented Solution", BOOKTITLE="ICPPP 94", YEAR=1995, } @INPROCEEDINGS{Huen95:Framework, AUTHOR="H. Hueni and Ralph Johnson and R. Engel", TITLE="A Framework for Network Protocol Software", BOOKTITLE="OOPSLA", YEAR=1995, KEYWORDS="conduits; herman; ascom; ATM; signalling; 2931", } @TECHREPORT{Alme95:High, AUTHOR="W. Almesberger", TITLE="High-speed {ATM} networking on low-end computer systems", INSTITUTION="Laboratoire de Réseaux de Communication, Swiss Federal Institute of Technology Lausanne", NUMBER="DI 95/147", NOTE="{URL}:ftp://lrcwww.epfl.ch/pub/linux/atm/papers/a tm\_on\_lowend.ps.gz", YEAR=1995, KEYWORDS="ATM; Linux; woa", } @TECHREPORT{ISOI95:MPEG, AUTHOR="I. S. O/IEC", TITLE="{MPEG-4} Proposal Pachage Description {(PPD)} - Revision 3", INSTITUTION="{ISO/IEC JTC/SC29/WG11}", YEAR=1995, KEYWORDS="MPEG 4", } @ARTICLE{Appe95:HyperODA, AUTHOR="W. Scheller Appelt", TITLE="{HyperODA} - Going Beyond Traditional Document Structures", EDITOR="J. L. Schumny", JOURNAL="Computer Standards and Interfaces", ISBN="ISSN: 0920-5489", INSTITUTION="GMD FOKUS", PUBLISHER="Elsevier Science Publishers B.V. , North-Holland", VOLUME=17, NUMBER=1, PAGES="13-21", YEAR=1995, } @ARTICLE{Ecke95:Objekt, AUTHOR="K. P. Eckert", TITLE="Objekt-Orientiertheit in offenen Systemen", SERIES="(Thomson's Aktuelle Tutorien)", JOURNAL="Objekt-Orientiertheit in offenen Systemen", ISBN="ISBN: 3-8266-0161-0", INSTITUTION="GMD FOKUS", PUBLISHER="International Thomson Publishing", VOLUME=14, YEAR=1995, } @ARTICLE{Gold95:Broadband, AUTHOR="G. Goldacker", TITLE="{Broadband-ISDN} Standardization - State of the Art", EDITOR="J. L. Schumny", JOURNAL="Computer Standards and Interfaces", ISBN="ISSN: 0920-5489", INSTITUTION="GMD FOKUS", PUBLISHER="Elsevier Science Publishers B.V. , North-Holland", VOLUME=17, NUMBER=1, PAGES="55-62", YEAR=1995, } @ARTICLE{Kans95:First, AUTHOR="K. Kansy and E. Moeller and P. Wisskirchen", TITLE="From First to Second Generation Computer Graphics Standards", JOURNAL="Computer Standards and Interfaces", INSTITUTION="GMD FOKUS", PUBLISHER="Elsevier Science Publishers B.V., North-Holland", VOLUME=17, NUMBER=1, PAGES="35-43", YEAR=1995, } @ARTICLE{Pusc95:Global, AUTHOR="H. Pusch", TITLE="Design and Implementation of a Global Reference Mechanism for Data Objects", EDITOR="J. L. Schumny", JOURNAL="Computer Standards and Interfaces", ISBN="ISSN: 0920-5489", INSTITUTION="GMD FOKUS", PUBLISHER="Elsevier Science Publishers B.V. , North-Holland", VOLUME=17, NUMBER=2, PAGES="181-192", YEAR=1995, } @ARTICLE{Schr95:Evolution, AUTHOR="G. Sch rmann", TITLE="The Evolution from Open Systems Interconnection {(OSI)} to Open Distributed Processing {(ODP)}", EDITOR="J. L. Berg and H. Schumny", JOURNAL="Computer Standards and Interfaces", ISBN="ISSN: 0920-5489", INSTITUTION="GMD FOKUS", PUBLISHER="Elsevier Science Publishers B.V. , North-Holland", VOLUME=1, NUMBER=1, PAGES="107-113", YEAR=1995, } @MISC{Gwer95:Autonomous, AUTHOR="James Gwertzman", TITLE="Autonomous Replication in Wide Area Networks", ADDRESS="Cambridge, MA 02138", NOTE="Senior Thesis, Harvard University, DAS", YEAR=1995, } @ARTICLE{Vett9502:ATM, AUTHOR="Ronald J. Vetter", TITLE="{ATM} concepts, architectures, and protocols", JOURNAL=cacm, VOLUME=38, NUMBER=2, PAGES="31-38", YEAR=1995, REFERENCES=25, KEYWORDS="ATM; survey; LAN", ABSTRACT="What is ATM? This article is intended to aquaint readers with this emerging technology and describe some of the concepts embodied within it.", } @ARTICLE{Kim9502:ATM, AUTHOR="Byung G. Kim and Peter Wang", TITLE="{ATM} network: goals and challenges", JOURNAL=cacm, VOLUME=38, NUMBER=2, PAGES="39-44", YEAR=1995, REFERENCES=22, KEYWORDS="ATM; survey; statistical multiplexing", ABSTRACT="Four major benefits of the ATM technology are considered: scalability, statistical multiplexing; traffic integration, and network simplicity.", } @ARTICLE{Iwat9502:ATM, AUTHOR="A. Iwata and N. Mori and C. Ikeda and H. Suzuki and M. Ott", TITLE="{ATM} connection and traffic management schemes for multimedia internetworking", JOURNAL=cacm, VOLUME=38, NUMBER=2, PAGES="72-89", YEAR=1995, REFERENCES=24, KEYWORDS="ATM; traffic control; QOS; multimedia; protocol engineering", ABSTRACT="The aspects of multimedia traffic over ATM are discussed.", } @ARTICLE{Perl9502:Improvements, AUTHOR="M. Perloff and K. Reiss", TITLE="Improvements to {TCP} performance in high-speed {ATM} networks", JOURNAL=cacm, VOLUME=38, NUMBER=2, PAGES="90-100", YEAR=1995, REFERENCES=9, KEYWORDS="ATM; TCP/IP; protocol performance; switching block", ABSTRACT="... certain features of ATM technology lead to a substantial degradation of TCP connection throughput under congestion condtions. ... most of the proposed additional mechanisms require substantial complication of the ATM switches.", } @ARTICLE{Fote9502:ATM, AUTHOR="Shivir Fotedar and M. Gerla and P. Crocetti and L. Fratta", TITLE="{ATM} virtual private networks", JOURNAL=cacm, VOLUME=38, NUMBER=2, PAGES="101-109", YEAR=1995, REFERENCES=16, KEYWORDS="ATM; VPN; QOS; performance evaluation; traffic control; ABR", ABSTRACT="Transport of CBR and VBR traffic over ATM.", } @ARTICLE{Harn95:Product, AUTHOR="N. Harnpanichpun and", TITLE="Product-form discrete-time queues in series with batch transition:late arrival case", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=21, PAGES="261-269", YEAR=1995, REFERENCES=16, KEYWORDS="Product Form; Queueing Network; Discrete Time Queue", ABSTRACT="This not presents a product-form equilibrium distribution for the specific type of queues in series, in which group transitions are allowed both in arrival and in service. Only the late arrival case is considered here. The results are valid for the discrete-time queueing network with geometric arrivals and the truncated geometric service time.", } @ARTICLE{Kasa95:Waiting, AUTHOR="S. Kasahara and Yutaka Takahashi and Toshiharu Hasegawa", TITLE="Analysis of waiting time of {M/G/1/K} system with vacations under random scheduling and {LCFS}", JOURNAL=pe, ADDRESS="Japan", VOLUME=21, PAGES="239-259", YEAR=1995, REFERENCES=8, KEYWORDS="M/G/1; Waiting Time", ABSTRACT="This paper considers an M/G/1/K queuing system with multiple vacations under random scheduling and LCFS disciplines.", } @ARTICLE{Suga95:Nonpreemtive, AUTHOR="A. Sugahara and T. Takine and Yutaka Takahashi and Toshiharu Hasegawa", TITLE="Analysis of a nonpreemtive priority queue with {SPP} arrivals of high class", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=21, PAGES="215-238", YEAR=1995, REFERENCES=17, KEYWORDS="Nonpreemptive Priority; SPP; Queueing System", ABSTRACT="This paper considers a nonpreemtive priority queueing system with two priority classes of customers, where high priority customers arrive to the system in accordance with a switched Possion process (SPP) and low priority customers in accordance with a Poisson process.", } @ARTICLE{Ibe95:Multi, AUTHOR="Oliver C. Ibe and Julian Keilson", TITLE="Multi-server threshold queues with hysteresis", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=21, PAGES="185-213", YEAR=1995, REFERENCES=19, KEYWORDS="Green Function; Multiserver; Queueing System", ABSTRACT="A queueing system with k servers operates in the following manner. When the system is empty, arriving customers are attended by only one server. A set of forward threshold values is defined sothat at epochs at which the number of customers in the system exceeds a forward threshold value an extra server is added. Similarly, a set of reverse threshold values is defined so that at epochs at which the number of customers in the system becomes less", } @ARTICLE{Schi9501:Aktuelle, AUTHOR="A. Schill", TITLE="Aktuelle Standards und neue Technologien in heterogenen Workstation-Netzen", JOURNAL=itti, ADDRESS="Germany", VOLUME=37, NUMBER=1, PAGES="38-45", YEAR=1995, LANGUAGE="German", REFERENCES=10, KEYWORDS="Workstation; Network; Heterogeneous Server", ABSTRACT="This paper gives an overview of current industry standards for applications in heterogeneous workstation networks. A major focusarea is the client/server-based OSF Distributed Computing Environment. In addition to remote procedure call, supplemental services, namely directory and security, as well as interoperability aspects are discussed. A comparison with related standardizationefford includes OMG CORBA, application-layer OSI standards, and", } @ARTICLE{Tava9501:Hochleistungs, AUTHOR="D. Tavangarian and M. Koch and G. Hipper", TITLE="Hochleistungs-Datenverarbeitung in Workstation-Clustern", JOURNAL=itti, ADDRESS="Germany", VOLUME=37, NUMBER=1, PAGES="29-37", YEAR=1995, LANGUAGE="German", REFERENCES=24, KEYWORDS="Workstation; Network; Cluster Analysis", ABSTRACT="The first part of the paper describes a concept for concurrent execution of applications within a cluster of workstations with known communication networks to realize high performance computing. The second part introduces architectures for the realisationof new workstation clusters with concurrently working communication networks. After a performance analysis of such systems willbe developed some concepts for the optimization of these cluste", } @ARTICLE{Flei9502:Klasse, AUTHOR="G. Fleischmann and M. Gente", TITLE="Eine Klasse gerichteter, azyklischer Graphen zur Leistungsbewertung paralleler Systeme", JOURNAL=itti, ADDRESS="Germany", VOLUME=37, NUMBER=2, PAGES="12-17", YEAR=1995, LANGUAGE="German", REFERENCES=14, KEYWORDS="Graph Model; Stochastic Timing; Performance Evaluation", ABSTRACT="The prediction of the completion time of parallel programs by exact evaluation of graph models is only possible for relatively small problems, when stochastic run times are supposed for the nodes. The article describes the class of regular graphs which areparticularly suited for the modelling and performance evaluation of parallel systems. The article assumes that regular graphs have a property which allows for the extrapolation of results fo", } @ARTICLE{Reut9502:Parallele, AUTHOR="A. Reuter", TITLE="Parallele Datenbanksysteme - Eine šbersicht unter Architektur- undLeistungsaspekten", JOURNAL=itti, ADDRESS="Germany", VOLUME=37, NUMBER=2, PAGES="18-28", YEAR=1995, LANGUAGE="German", REFERENCES=19, KEYWORDS="Architecture; Parallel Computing; Database", ABSTRACT="This paper consists of two main parts: First, it surveys the methods and techniques for parallel execution in database systems, including aspects such as load distribution, synchronization, etc. Second, it explains which of these techniques are applied to which degree in commercial products. It concludes with a summaryfrom a performance perspective.", } @ARTICLE{Berr9502:Leistungscharakteristika, AUTHOR="R. Berrendorf and U. Detert", TITLE="Leistungscharakteristika von Parallelrechnern: Fallstudie Intel Paragon", JOURNAL=itti, ADDRESS="Germany", VOLUME=37, NUMBER=2, PAGES="37-45", YEAR=1995, LANGUAGE="German", REFERENCES=10, KEYWORDS="Performance Parameter; Parallel Computing; Interconnection; Network", ABSTRACT="The article summarizes typical performance characterictics of the Intel Paragon XP/S 10 parallel computer system. The assessmentof the performance feature focuses on three topics: The computeperformance of selected library routines and application programs, the communication performance of the processor interconnection network, and the transfer bandwidth of Parallel File System. In all three areas, performance data obtained in practical measu", } @ARTICLE{Mark9502:Calculation, AUTHOR="Z. Markov", TITLE="Calculation of the Collision Probability in a Trunk Group Containing a Faulty Trunk", JOURNAL=aeu, ADDRESS="YU", VOLUME=49, NUMBER=2, PAGES="107-108", YEAR=1995, REFERENCES=3, KEYWORDS="Calculation; Fault", ABSTRACT="The group of both-way telecommunication trunks containing one faulty but accessible trunk is observed. The fraction of collided calls on faulty trunk has been calculated. The fact that a faulty trunk may be seen as a collector of collided calls is emphasized.", } @ARTICLE{Akar95:Markov, AUTHOR="N. Akar and Erdal Arikan", TITLE="Markov modulated periodic arrival process offered to an {ATM} multiplexer", JOURNAL=pe, ISBN="0166-5316", ADDRESS="Netherlands", VOLUME=22, PAGES="175-190", YEAR=1995, REFERENCES=17, KEYWORDS="ATM; Network; Fluid Flow Model; ND/D/1", ABSTRACT="The article provides an analytical approach to solve for the queueing system via an approximation to the transient behavior of the nD/D/1 queue. A numerical example for a packetized voice multiplexer is finally given to demonstrate the results.", } @ARTICLE{Blan95:Optimization, AUTHOR="J. P. Blanc and R. van der Mei", TITLE="Optimization of polling systems with Bernoulli schedules", JOURNAL=pe, ISBN="0166-5316", ADDRESS="Netherlands", VOLUME=22, PAGES="139-158", YEAR=1995, REFERENCES=32, KEYWORDS="Polling System; Optimization; Scheduling; Power Method", ABSTRACT="This paper concerns optimization of cyclic polling systems with respect to the service disciplines at the nodes. The service disciplines are chosen to be Bernoulli schedules. Furthermore a fast approach to approximate the optimal schedule is presented and tested.", } @ARTICLE{Xion95:Simple, AUTHOR="Yongqiang Xiong and H. Bruneel", TITLE="A simple approach to obtain tight upper bounds for the asymptotic queueing behavior of statistical multiplexers with heterogeneous togeneous traffic", JOURNAL=pe, ISBN="0166-5316", ADDRESS="Belgium", VOLUME=22, PAGES="159-173", YEAR=1995, REFERENCES=20, KEYWORDS="ATM; Statistical Multiplexer; Markov Process; Heterogeneous Traffic; Asymptotic Analysis; MMBP", ABSTRACT="A statistical multiplexer with infinite buffer capacity and a finite number of independent (not necessarily identical) 2-state MMBP (Markov Modulated Bernoulli Process) traffic sources is considered in this paper, which is modeled as a discrete-time single-server queueing system with correlated arrivals.", } @ARTICLE{Liu9501:Burst, AUTHOR="Z. Liu and Donald F. Towsley", TITLE="Burst Reduction Properties of Rate-Control Throttles: Downstream Queue Behavior", JOURNAL=ieanep, ISBN="1063-6692", VOLUME=3, NUMBER=1, PAGES="82-90", YEAR=1995, REFERENCES=21, KEYWORDS="Reduction; flow Control; leaky Bucket; waiting Time", ABSTRACT="This paper presents rate-based flow control throttles feeding a sequence of single server infinte capacity queues. Specifically,it is considered two types of throttles, the token bank and theleaky bucket.", } @INPROCEEDINGS{Pere95:Reliable, AUTHOR="Maryann Perez and C. Cadena", TITLE="Reliable Circuit Network Design Considering the Economic Value of Lost Traffic", BOOKTITLE="3rd International Conference on Telecommunication Systems Modeling and Analysis", ADDRESS="Nashville, Tennessee", PAGES="507-516", YEAR=1995, REFERENCES=10, KEYWORDS="network design; failure; reliability", ABSTRACT="This article concentrates on the problem of designing an economically optimal reliable network considering not only the investment and operational costs, but also the opportunity cost of the calls that are not served for each pair of network nodes, in each of the feasible routes and in each of the possible states of the system. This problem is formulated as a mathematical programming model, which is reduced to a linear mixed integer problem.", } @ARTICLE{Mora95:Analytical, AUTHOR="L. de Moraes and R. C. A. Ferreira", TITLE="Analytical modeling and performance of dual-bus high-speed networks under the adaptive cycle cell insertion {(ACCI)} protocol", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=22, PAGES="195-219", YEAR=1995, REFERENCES=10, KEYWORDS="MAN; access protocol; performance evaluation", ABSTRACT="New access protocol similar to DQDB but fairness improved; compatible to ATM", } @ARTICLE{Herk95:Route, AUTHOR="A. Herkersdorf and L. Heusler and E. Maehle", TITLE="Route discovery for multstage fabrics in {ATM} switching nodes", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=22, PAGES="221-238", YEAR=1995, REFERENCES=8, KEYWORDS="ATM; LAN; switching network; routing", ABSTRACT="Routing algorithm within the switching network of the PRIZMA architecture of IBM Rschlikon", } @ARTICLE{Wang95:Approximate, AUTHOR="Stephen Wang and J. A. Silvester", TITLE="An approximate model for performance evaluation of real-time multimedia communication systems", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=22, PAGES="239-256", YEAR=1995, REFERENCES=26, KEYWORDS="Traffic source model; MMPP; ATM; batch arrival", ABSTRACT=".. the cell arrival process from integrated voice and data sources is approximated by a two-state MMPP with batch arrivals.", } @ARTICLE{Bisd95:Framework, AUTHOR="C. Bisdikian and W. Matragi and K. Sohraby", TITLE="A framework for jitter analysis in cell based multiplexers", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=22, PAGES="257-277", YEAR=1995, REFERENCES=21, KEYWORDS="ATM; multiplexer; jitter; discrete time queue", ABSTRACT="Analysis of the distribution of jitter.", } @INPROCEEDINGS{Knig95:Fundamental, AUTHOR="Edward W. Knightly and D. Wrege and Li J. J. and Hui Zhang", TITLE="Fundamental Limits and Tradeoffs of Providing Deterministic Guarantees to {VBR} Video Traffic", BOOKTITLE=sigmetrics, ADDRESS="Canada", PAGES="79-88", YEAR=1995, REFERENCES=15, KEYWORDS="ATM; Performance Measurement; Performance Evaluation; Connection Admission Control; Traffic Model; Video Coding", ABSTRACT="A network service, that can provide DETERMINISTIC guarantees onthe maximum throughput and the maximum delay of VBR video traffic is described. MPEG-compressed Video tracec are used for evaluation.", } @INPROCEEDINGS{Elwa95:Fundamental, AUTHOR="A. I. Elwalid and Daniel P. Heymann and T. V. Lakshman and D. Mitra and A. Weiss", TITLE="Fundamental Results on the Performance of {ATM} Multiplexers with Application to Video Teleconferencing", BOOKTITLE=sigmetrics, ADDRESS="Canada", PAGES="86-97", YEAR=1995, REFERENCES=40, KEYWORDS="ATM; Performance Evaluation; Traffic Model; Switching", ABSTRACT="Bounds and approximations for analyzing ATM multiplexers are given. This approximation is applied to statistical models of video teleconference traffic. The results are compared with simulations driven by real traffic.", } @ARTICLE{Taki9502:Cell, AUTHOR="T. Takine and T. Suda and Toshiharu Hasegawa", TITLE="Cell Loss and Output Process Analyses of a Finite-Buffer Dicrete-Time {ATM} Queuing System with Correlated Arrivals", JOURNAL=ieeecom, VOLUME="COM-43", NUMBER=2, PAGES="1022-1037", YEAR=1995, REFERENCES=40, KEYWORDS="ATM; Performance Evaluation; Semi Markov Process; Traffic model", ABSTRACT="An ATM switching node with correlated cell arrivals is analyzed. Cells arrive according to a semi-Mariovian process. Cell lossprob., consecutive loss prob., and distribution of loss periodlengths is investigated. Also characteristics of the cell output ofthe ATM-switch are of interest.", } @ARTICLE{Simo9502:Message, AUTHOR="F. Simonot and Y. H. Song and J. Thomesse", TITLE="Message Sojourn Time for {TDM} Schemes with Any Buffer Capacity", JOURNAL=ieeecom, VOLUME="COM-43", NUMBER=2, PAGES="1013-1021", YEAR=1995, REFERENCES=22, KEYWORDS="ATM; Performance Evaluation", ABSTRACT="The main concern is to provide a general solution for the exactmessage sojourn time in the queue that should be available whatever the storage capacity may be. The pdf and Laplace Transf. of the message sojourn time are derived. The expected value is compared to that obtained by other authors.", } @ARTICLE{Jaco9502:Saturation, AUTHOR="L. Jacob and A. Kumar", TITLE="Saturation Throughput Analysis of an Input Queueing {ATM} Switch with Multiclass Bursty Traffic", JOURNAL=ieeecom, VOLUME="COM-43", NUMBER=2, PAGES="757-761", YEAR=1995, REFERENCES=11, KEYWORDS="ATM; Performance Evaluation; Traffic model; Bursty traffic; Input Buffer; Priority", ABSTRACT="An NxN nonblocking ATM-Switch with input cell queueing is considered. The cell arrival process are geometrically distributed bursts of consecutive cells with two classes of traffic. The asymptotic (N->unlimited) saturation throughput is derived.", } @ARTICLE{Baza9502:Superposition, AUTHOR="Z. Bazanowski and Ulrich Killat", TITLE="The Superposition of Cell Streams with Geometrically Distributed Interarrivals in an {ATM} Multiplexer", JOURNAL=ieeecom, VOLUME="COM-43", NUMBER=2, PAGES="1323-1325", YEAR=1995, REFERENCES=3, KEYWORDS="ATM; Queueing System; Traffic model; G/D/1; GEO/D/1", ABSTRACT="The queue building up in an ATM multiplexer is considered. The cell stream at each input line is modelled as an independent Bernoulli process. Different average utilizations for each input line are allowed. The main result is a closed formula for the queue length distribution.", } @ARTICLE{Cour9502:Admission, AUTHOR="C. A. Courcoubetis and G. Kesidis and A. Ridder and J. Walrand and others", TITLE="Admission Control and Routing in {ATM} Networks using Inferences from Measured Buffer Occupany", JOURNAL=ieeecom, VOLUME="COM-43", NUMBER=2, PAGES="1778-1784", YEAR=1995, REFERENCES=14, KEYWORDS="ATM; Connection Admission Control; Routing; Markovian Queueing System; Fluid Flow Model", ABSTRACT="The issue of call acceptance and routing is addressed. The goalis to design an algorithm that guarantees bounds of the fractionof cells lost by a call. No traffic models are necessary. Each switch estimates the additional fraction of cells lost if a new call would be routed through the switch. The estimates are obtained by extrapolating. Simulations were performed using Markov fluid sources to test the validity of the approach.", } @ARTICLE{Stey9502:Multiplexers, AUTHOR="B. Steyaert and H. Bruneel", TITLE="On the Performance of Multiplexers with Three-State Bursty Sources: Analytical Results", JOURNAL=ieeecom, VOLUME="COM-43", NUMBER=2, PAGES="1299-1303", YEAR=1995, REFERENCES=11, KEYWORDS="ATM; Performance Evaluation; Traffic model; Statistical Multiplexer", ABSTRACT="A multiplexer with inf. capacity and a finite number of indep. ident. bursty sources is considered. The burstiness is captured by assuming a mixture of two geometric for the active periods and a geometric distribution for the passive periods. The performance of the multiplexer is studied using analytical techniques which results in closed form expressions for the mean and the taildistribution of the buffer contents an the delay.", } @ARTICLE{Bolo9502:Optimal, AUTHOR="J. C. Bolot and A. U. Shankar", TITLE="Optimal Least-Squares Approximations to the Transient Behavior of the Stable {M/M/1} Queue", JOURNAL=ieeecom, VOLUME="COM-43", NUMBER=2, PAGES="1293-1298", YEAR=1995, REFERENCES=19, KEYWORDS="ATM; Queueing Network; M/M/1; Approximation", ABSTRACT="A simple exponential approximation for the transient behavior of the stable M/M/1 Queue is presented. The approximations are optimal in least-square sense. The error of the approximation can be computed.", } @PHDTHESIS{Herr95:Stochastische, AUTHOR="C. Herrmann", TITLE="Stochastische Modelle für {ATM-Konzepte}", SERIES="Aachener Beiträge zur Mobil- und Telekommunikation", ISBN="3-86073-380-X", SCHOOL="TH Aachen", ADDRESS="Aachen, Germany", VOLUME=1, PAGES=130, YEAR=1995, LANGUAGE="German", REFERENCES=123, KEYWORDS="ATM; discrete time analysis; performance evaluation; multiplexer; DBMAP; semi Markov process; output process; delay analysis; transient analysis; traffic mix; correlation", ABSTRACT="Overview of recent results of discrete-time queueing models (esp. Semi-Markovian and DBMAP input processes). New contributions: relatively explicit solutions for DBMAP/G/1-S (including transient analysis), superposition of two DBMAPs and per-stream QoS assessment, Semi-Markovian representation of the output process.", } @INPROCEEDINGS{Baum95:Finite, AUTHOR="M. Baumann", TITLE="Finite Time Cell Loss Ratios in an {ATM} Multiplexer with Bursty Traffic Load", BOOKTITLE="3rd International Conference on Telecommunication Systems Modeling and Analysis", ADDRESS="Nashville, Tennessee", PAGES="12-18", YEAR=1995, REFERENCES=16, KEYWORDS="ATM; multiplexer; QOS; performance evaluation; transient analysis", ABSTRACT="Analysis of finite-time cell loss ratios in an ATM multiplexer.For an approximate Markov chain model of the system, the cell loss process is modelled by a DBMAP. The evaluation of the counting function (repeated multiplication of the matrix generating function) yields the pdf of lost cells during a certain time period. Numerical results reveal different finite time behaviours fordifferent ways of increasing the system utilisation.", } @INPROCEEDINGS{Baza95:Trade, AUTHOR="Z. Bazanowski and Ulrich Killat", TITLE="Trade-Offs in {VP-based} and {VC-based} Traffic Shaping", BOOKTITLE="3rd International Conference on Telecommunication Systems Modeling and Analysis", ADDRESS="Nashville, Tennessee", PAGES="78-85", YEAR=1995, REFERENCES=15, KEYWORDS="ATM; multiplexer; performance evaluation; discrete time analysis; delay analysis; virtual channel; virtual path; traffic shaping", ABSTRACT="Exact analysis of a VP-based cell spacing multiplexer receivingperiodic cell streams (using Benes-approach). Numerical resultsreveal drastic differences of VC- and VP-based cell spacing in terms of delay and delay variation experienced by a cell passinga multiplexer.", } @INPROCEEDINGS{Mikl95:Quo, AUTHOR="A. R. Mikler and J. W. Wong and V. Honavar", TITLE="Quo Vadis - Adaptive Heuristics for Routing in Large CommunicationNetworks", BOOKTITLE="3rd International Conference on Telecommunication Systems Modeling and Analysis", ADDRESS="Nashville, Tennessee", PAGES="66-76", YEAR=1995, REFERENCES=28, KEYWORDS="routing algorithm; heuristics; large network; congestion control", ABSTRACT={"Quo Vadis" is a framework for intelligent traffic management invery large communication networks. It employs a distributed representation of network state information using local load measurements supplemented by a less precise global summary. Routing decisions are based on parameterized heuristics. Simulation results demonstrate the ability of the system to avoid congestion under a variety of network load conditions.}, } @INPROCEEDINGS{Gavi95:Models, AUTHOR="Bezalel X Gavish and S. Sridhar", TITLE="Models for Configuring Cellular Networks with Mobility", BOOKTITLE="3rd International Conference on Telecommunication Systems Modeling and Analysis", ADDRESS="Nashville, Tennessee", PAGES="168-178", YEAR=1995, REFERENCES=25, KEYWORDS="cellular system; mobile radio; network planning", ABSTRACT="The paper addresses the role of mobility in configuring cellularnetworks, with focus on the economic aspects of network configuration. It builds upon an earlier model to explicitly account for subscriber mobility. First, the relationship between mobilityand various aspects of network configuration is shown. This is used in developing models to capture the dynamics of mobility innetwork configuration.", } @INPROCEEDINGS{Shab95:TND, AUTHOR="M. Shabaz", TITLE="{TND-Tool:} A Tool for Topological Network Design of Mobile Communication Networks", BOOKTITLE="3rd International Conference on Telecommunication Systems Modeling and Analysis", ADDRESS="Nashville, Tennessee", PAGES="187-193", YEAR=1995, REFERENCES=8, KEYWORDS="network design; network topology; optimization; tool", ABSTRACT="The paper introduces a tool fulfilling the requirements arisingwhen developing a network topology. The philosophy of the tool and its requirement model which uses the Hatlay \& Pirbhai methodare explained. After describing the internal structure, an example scenario is shown. A performance analysis and new and specialfeatures are presented.", } @INPROCEEDINGS{Wood95:Equilibrium, AUTHOR="M. E. Woodward and N. Khoudro", TITLE="Equilibrium Point Analysis of a Random Access {CDMA} Satellite Packet Broadcast Channel", BOOKTITLE="3rd International Conference on Telecommunication Systems Modeling and Analysis", ADDRESS="Nashville, Tennessee", PAGES="387-401", YEAR=1995, REFERENCES=11, KEYWORDS="CDMA; performance evaluation; satellite radio; discrete time analysis", ABSTRACT="A random access CDMA satellite packet broadcast channel is modelled in the form of a discrete-time queueing network (virtual queueing network) and the model is solved using equilibrium point analysis. Performance results for throughput and mean packet delay are obtained from the model and validated against simulationsfor both direct sequence spreading and frequency hopping.", } @INPROCEEDINGS{Benm95:Rate, AUTHOR="Lotfi Benmohamed and David Su", TITLE="Analysis of the Rate-Based Traffic Management Proposal for {ATM} Networks", BOOKTITLE="3rd International Conference on Telecommunication Systems Modeling and Analysis", ADDRESS="Nashville, Tennessee", PAGES="451-457", YEAR=1995, REFERENCES=14, KEYWORDS="ATM; flow control; ABR; analysis; traffic control", ABSTRACT="This paper addresses the analysis of the rate-based proposal forthe feedback flow control of the Available Bit Rate (ABR) service in ATM networks. The analysis presented here provides optimalvalues of the parameters of the control mechanism. These valuesachieve maximum link utilization while minimizing the buffer requirement.", } @INPROCEEDINGS{Medd95:Formulas, AUTHOR="A. Meddeb and C. Rosenberg and F. Guillemin", TITLE="Formulas for Cell Delay Variation in {ATM} Networks", BOOKTITLE="3rd International Conference on Telecommunication Systems Modeling and Analysis", ADDRESS="Nashville, Tennessee", PAGES="464-468", YEAR=1995, REFERENCES=10, KEYWORDS="ATM; delay analysis; multiplexer; heuristics", ABSTRACT="This paper deals with the clumping aspect of CDV. We propose very simple approximate formulas to compute the CDV parameter \tau introduced in the ITU-T by means of the Virtual Scheduling Algorithm for a CBR connection passing through a series of multiplexing stages. Extensive simulations have been run to validate theseformulas which have also been compared with other heuristic (but non closed form) rules which have been proposed earlier.", } @INPROCEEDINGS{Kant95:Analytic, AUTHOR="K. Kant", TITLE="Analytic Modeling of {SSCOP}", BOOKTITLE="3rd International Conference on Telecommunication Systems Modeling and Analysis", ADDRESS="Nashville, Tennessee", PAGES="469-482", YEAR=1995, REFERENCES=7, KEYWORDS="protocol performance; analysis; delay analysis; generating function; signalling protocol", ABSTRACT="Analytic model of SSCOP (Service Specific Connection Oriented Protocol), which is a signaling protocol for B-ISDN. It provides error correction and guaranteed message delivery via \_selective\_retransmission of errored PDUs. It is quite intricate and requires approximate handling of some aspects in order to obtain a tractable model. The paper shows how to analyze the protocol withand without high priority by a generating function approach.", } @ARTICLE{Bolc95:Leistungsbewertung, AUTHOR="G. Bolch and M. Roessler and R. Zimmer", TITLE="Leistungsbewertung mit {PEPSY-QNS} und {MOSES}", JOURNAL=itti, PUBLISHER="R. Oldenbourg Verlag", ADDRESS="Germany", VOLUME=37, NUMBER=3, PAGES="28-33", YEAR=1995, LANGUAGE="German", REFERENCES=10, KEYWORDS="performance evaluation; modeling; markovian model of system behaviour; simulation model; analytical model; steady state analysis; queueing network", ABSTRACT="PEPSY-QNS (Performance Evaluation and Prediction SYstem for Queueing NetworkS) dient zur Modellierung dynamischer Systeme wie z.B. Rechnernetze. Die Eingabe erfolgt ueber die grafische Oberflaeche XPEPSY, Leistungskenngroessen koennen mittels exakter und approximativer analytischer Verfahren sowie mittles Simulation berechnet werden.", } @ARTICLE{Bell9506:Experimental, AUTHOR="P. Bell and R. O'Keefe", TITLE="An experimental investigation into the efficiacy of visual interactive simulation", JOURNAL=mms, VOLUME=41, NUMBER=6, PAGES="1018-1038", YEAR=1995, REFERENCES=57, KEYWORDS="Simulation method; animation; model", ABSTRACT="Visual interactive simulation", } @ARTICLE{Bene9503:New, AUTHOR="G. Benelli and A. Garzelli", TITLE="A New Selective {ARQ} Scheme with a Finite Buffer", JOURNAL=ett, ADDRESS="Italy", VOLUME=6, NUMBER=3, PAGES="365-373", YEAR=1995, REFERENCES=15, KEYWORDS="ARQ; Finite Buffer", ABSTRACT="This paper describes a new selective ARQ protocol with a finite-length buffer. The proposed protocol achieves higher throughputsthan similar schemes, giving comparable results to selective protocols with infinite-length buffers for high error rates in thecommunication channel.", } @ARTICLE{Chao9502:Large, AUTHOR="Hung-Po Chao and B. S. Choe", TITLE="Design and Analysis of a Large-Scale Multicast Output Buffered {ATMSwitch}", JOURNAL=ieanep, VOLUME=3, NUMBER=2, PAGES="126-138", YEAR=1995, REFERENCES=25, KEYWORDS="Design; Analysis; Multicast; Output Buffer; ATM", ABSTRACT="The article proposes and analyzes a recursive modular architecture for implementing a large-scale multicast output buffered ATM switch (MOBAS). A multicast knockout principle, an extension of the generalized knockout principle, is applied in constructing the MOBAS in order to reduce the hardware complexity by almost one order of magnitude.", } @ARTICLE{Cris9502:Throughput, AUTHOR="K. Crisler and M. Needham", TITLE="Throughput analysis of reservation {ALOHA} multiple access", JOURNAL=elet, ADDRESS="Great Britain", VOLUME=31, NUMBER=2, PAGES="87-89", YEAR=1995, REFERENCES=6, KEYWORDS="Packet Radio; Multiple Access; ALOHA", ABSTRACT="The theoretical relationship between throughput S and offered load G of reservation ALOHA (R-ALOHA) is derived. Closed-form expressions are given. It is shown that the performance of one version of R-ALOHA is mathematically equivalent to that of carrier sense multiple access with collision detection (CSMA/CD) under special circumstances.", } @ARTICLE{Davi9506:Sensivity, AUTHOR="Jim Davis and W. A. Massey and W. Whitt", TITLE="Sensivity to the service-time distribution in the nonstationary {Erlang} loss model", JOURNAL=mms, VOLUME=41, NUMBER=6, PAGES="1107-1116", YEAR=1995, REFERENCES=30, KEYWORDS="Loss system; Erlang B formula; instationary arrival", ABSTRACT="We develop a simple effective numerical algorithm for the M(t)/PH/s/o model with two service phases and a nonhomogeneoeus Poisson arrival process...", } @ARTICLE{Gira9505:Revenue, AUTHOR="Andre Girard and R. Zidane", TITLE="Revenue Optimization of {B-ISDN} Networks", JOURNAL=ieeecom, VOLUME="COM-43", NUMBER=5, PAGES="1992-1997", YEAR=1995, REFERENCES=16, KEYWORDS="B-ISDN; Optimization; Routing", ABSTRACT="The article considers the optimization of routing in a broadbandISDN network through the maximization of the revenue generated by the network.Two types of calls are offered to the network with different holding times and bandwidths. The routing is alternative routing and load sharing.", } @ARTICLE{Hart9503:Capacity, AUTHOR="H. L. Hartmann and H. He", TITLE="Capacity Assignment for Circuit-Switched Reference Networks with Nonhierarchical Routing", JOURNAL=ett, ADDRESS="Italy", VOLUME=6, NUMBER=3, PAGES="353-363", YEAR=1995, REFERENCES=10, KEYWORDS="Network planning; Capacity Assignment; Circuit Switching; Nonhierarchical Network", ABSTRACT="The article presents an exact theoretical solution of the Capacity Assignment - Problem for symmetric circuit-switched networks.First is presented the formulation of the end-to-end blockings with nonhierarchical two-link path alternate routing for reversible and nonreversible scheme. Next is derived the Kuhn-Tucker conditions for the CA-problem.", } @ARTICLE{Hash95:Models, AUTHOR="O. Hashida and Yutaka Takahashi and H. Yamashita", TITLE="Performance models for information communication networks", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=23, PAGES="91-92", YEAR=1995, KEYWORDS="Performance Model; Communication Network", ABSTRACT="This special issue of Performance Evaluation contains five papers selected from those presented at the Symposium on Performance Models for Information Communication Networks, which was held from January 20 to 22, 1994 in Hakone, Japan, and was sponsored bygrant in aid for scientific research, the Ministry of Education.", } @ARTICLE{Hali95:Polynomial, AUTHOR="G. Haálinger", TITLE="A polynomial factorization approach to the discrete time {GI/G/1/(N)} queue size distribution", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=23, PAGES="217-240", YEAR=1995, REFERENCES=39, KEYWORDS="GI/G/1; Discrete Time Analysis; Polynomial", ABSTRACT="The queue of a single server is considered with independent and identically distributed interarrival and service times and an infinte (GI/G/1) or finite (GI/G/1/N) waiting room. The queue discipline is non-preemtive and independent of the service times.", } @ARTICLE{Ishi95:Discrete, AUTHOR="F. Ishizaki and T. Takine and Toshiharu Hasegawa", TITLE="Analysis of a discrete-time queue with gated priority", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=23, PAGES="121-143", YEAR=1995, REFERENCES=14, KEYWORDS="Discrete time queue; correlation; service time; interarrival time; priority", ABSTRACT="This paper considers a discrete-time queue with gated priority. Low priority customers arrive at the first queue at the gate in batches according to a batch Bernoulli process (BBP). When the gate opens, all low priority customers at the first queue move tothe second queue at a single server. On the other hand, high priority customers directly join the second queue upon arrival. The arrival process of high priority customers is assumed to be a", } @ARTICLE{Koba95:Steady, AUTHOR="Kazutomo Kobayashi and Yutaka Takahashi", TITLE="Steady-state analysis of {ATM} multiplexer with variable input rate through diffusion approximation", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=23, PAGES="163-184", YEAR=1995, REFERENCES=13, KEYWORDS="ATM; fluid flow model; diffusion approximation", ABSTRACT="The article proposes an approximation formula for the stationarydistribution of the buffer content of a fluid model for an ATM multiplexer in which the input rate process is given as a Gaussian process.", } @ARTICLE{Lee9502:Cell, AUTHOR="M. J. Lee and S. Ahn", TITLE="Cell Loss Analysis and Design Trade-Offs of Nonblocking {ATM} Switches with Nonuniform Traffic", JOURNAL=ieanep, VOLUME=3, NUMBER=2, PAGES="199-210", YEAR=1995, REFERENCES=18, KEYWORDS="ATM; switching network; Analysis; Design; Nonblocking", ABSTRACT="This paper addresses design trade-offs existing between finite input/output buffer sizes and speed-up factor in a nonblocking ATM switch. It also provides an algorithm for effective buffer sharing that alleviates the performance degradation caused by traffic nonuniformity.", } @ARTICLE{Leun9502:Generalised, AUTHOR="Y.-W. Leung", TITLE="Generalised multicopy {ALOHA}", JOURNAL=elet, ADDRESS="Great Britain", VOLUME=31, NUMBER=2, PAGES="82-83", YEAR=1995, REFERENCES=5, KEYWORDS="Packet Radio; Information Theory; ALOHA", ABSTRACT="Two enhancements are proposed for multicopy ALOHA. First, a probabilistic transmission policy is proposed to relax the constraint of an integral number of copies. Secondly, artificial power capture is introduced to multicopy ALOHA. The numerical results show that generalised multicopy ALOHA can significantly increase the throughput when the traffic is heavy.", } @ARTICLE{Mach95:Bridge, AUTHOR="F. Machihara", TITLE="A bridge between preemtive and non-preemtive queueing models", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=23, PAGES="93-106", YEAR=1995, REFERENCES=17, KEYWORDS="Preemptive Resume Queue; Conservation Law; MAP", ABSTRACT="A preemtive priority MAP, G/G1, G2/1 queue with two types of customers is considered. Here, the priority customers' arrival process follows the Markovian Arrival Process. The relationship between the work load and waiting times of priority and non-prioritycustomers is derived. As a result a new conservation law for the preemtive queue is obtained. Using this law and the waiting times of the preemtive queue, waiting times for a non-preemtive pr", } @ARTICLE{Min9502:Nonblocking, AUTHOR="P. S. Min and H. Saidi and M. Hegde", TITLE="A Nonblocking Architecture for Broadband Multichannel Switching", JOURNAL=ieanep, VOLUME=3, NUMBER=2, PAGES="181-198", YEAR=1995, REFERENCES=29, KEYWORDS="Nonblocking; Architecture; Broadband; Multichannel; Switching network", ABSTRACT="This paper investigates multichannel switching as a promising alternative to traditional single-channel switching where virtual paths established in a switch are between a single input channeland a single output channel.", } @ARTICLE{Mitr95:Spectral, AUTHOR="I. Mitrani and R. Chakka", TITLE="Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=23, PAGES="241-260", YEAR=1995, REFERENCES=18, KEYWORDS="Markov Process; Matrix Geometric Method", ABSTRACT="Many two-dimensional Markov models whose state space is a semi-infinite strip can be solved efficiently by means of spectral expansion. This method and its application are described in the context of an M/M/N queue with general breakdowns and repairs.", } @ARTICLE{Ofek9502:METANET, AUTHOR="Y. Ofek and M. Yung", TITLE="{METANET:} Principles of an Arbitrary Topology {LAN}", JOURNAL=ieanep, VOLUME=3, NUMBER=2, PAGES="169-180", YEAR=1995, REFERENCES=42, KEYWORDS="LAN; arbitration", ABSTRACT="The MetaNet is a scalable local area network (LAN) architecture with an arbitrary topology and a switch at each node (i.e., a switch based LAN). Its design provides on one hand a service in which any node can try to transmit asynchronously in a bursty manner without reservation as much as it can (as in traditional LAN), and on the other hand the network access and flow control ensure the following properties: (1) no packet loss due to congestion, (2) fair access to the network, (3) no deadlocks, and (4) self-routing with broadcast. The switching over this network requires only a (5) single buffer per input link. The MetaNet is asynchronous, distributed, and designed for transmission of fixed size cells or variable size packets. It can be viewed as a general-topology buffer-insertion architecture with fairness, thus as generalizing the MetaRing architecture.", } @ARTICLE{zver95:Reliable, AUTHOR="C. M. zveren and R. Simcoe and George Varghese", TITLE="Reliable and Efficient Hop-by-Hop Flow Control", JOURNAL=ieeejsac, VOLUME="SAC-13", NUMBER=4, PAGES="642-650", YEAR=1995, REFERENCES=15, KEYWORDS="Flow Control; Throughput", ABSTRACT="Hop-by-Hop flow control can be used to fairly share the bandwidth of a network among competing flows. No data is lost even in overload conditions; yet each flow gets access to the maximum thoughput when the network is lightly loaded. However, some schemes for hop-by-hop flow control require too much memory; some of them are not resilient to errors. The article proposes a scheme formaking hop-by-hop flow control resilient and show that it has a", } @ARTICLE{Pena95:Forecasting, AUTHOR="D. Pena", TITLE="Forecasting Growth with Time Series Models", JOURNAL="Journal of Forecasting", VOLUME=14, PAGES="97-105", YEAR=1995, REFERENCES=8, KEYWORDS="Forecasting; regression analysis; stationary process; time series analysis", ABSTRACT="The paper compares the structure and the forcasting performance of three models for estimating future growth in a time series. A regression model gives minimum weight to the last observed growth and maximum weigth to the observed growth in the middle. A first-order integrated ARIMA model gives uniform weigths to all observed growths, a second-order ARIMA model gives maximum weigths to the last and minimum weigths to the beginning of the sample", } @ARTICLE{Rock9502:Access, AUTHOR="M. Rocks", TITLE="Implementation of the Access Network in Germany", JOURNAL="Optics and Photonics News", NUMBER=2, PAGES="33-39", YEAR=1995, REFERENCES=8, KEYWORDS="Access network; broadband; network evolution; network architecture", ABSTRACT="The article gives a review of Germany's Optical Access Line (OPAl). Optoelectronic interfaces and distribution services are diskussed as well as future strategies.", } @ARTICLE{Taka95:Pseudo, AUTHOR="Yutaka Takahashi and B. Kumar", TITLE="Pseudo-conservation law for a priority polling system with mixed service strategies", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=23, PAGES="107-120", YEAR=1995, REFERENCES=22, KEYWORDS="Discrete Time Queue; Polling System; Priority; Conservation Law", ABSTRACT="This papers considers a discrete-time cyclic-service system consisting of multiple stations visited by a single server. Several priority classes of customers arrive at each station according to independent batch Bernoulli processes. The head-of-the-line priority rule and non-zero switch-over times between stations are assumed.", } @ARTICLE{Tana95:Transient, AUTHOR="Toshiaki Tanaka and O. Hashida and Yutaka Takahashi", TITLE="Transient analysis of fluid model for {ATM} statistical multiplexer", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=23, PAGES="145-162", YEAR=1995, REFERENCES=19, KEYWORDS="ATM; Fluid Flow Model; Transient Analysis", ABSTRACT="The article analyzes the transient behavior of a fluid model of ATM multiplexer, in which the input process is generated by a Markov modulated rate process (MMR Process). This model is a natural extension of the on-off-type multi-entry queueing model whichhas been widely used for modeling ATM multiplexers with bursty inputs.", } @MASTERSTHESIS{Trei95:Optimierungsverfahren, AUTHOR="F. Treiber", TITLE="Optimierungsverfahren für das {BSS} in {GSM-Netzen}", SCHOOL="Technische Universität Dresden", ADDRESS="Dresden, Germany", PAGES=66, YEAR=1995, LANGUAGE="German", REFERENCES=14, KEYWORDS="Network optimization; network planning; network architecture; network topology", ABSTRACT="In der Diplomarbeit wurde versucht, die bei der BSS-Planung eines Mobilfunknetzes auftretenden Optimierungsprobleme in ihrer Komlexität darzulegen und Ansätze zu deren Lösung so zu entwickeln,daá sich diese Verfahren auf einem Rechner implementieren lassen.", } @ARTICLE{Truo95:LAN, AUTHOR="H. L. Truong and William W. Ellington and J. Boudec and A. Meier", TITLE="{LAN} Emulation on an {ATM} Network", JOURNAL=ieeecm, PAGES="70-85", YEAR=1995, REFERENCES=35, KEYWORDS="LAN; ATM; Architecture", ABSTRACT="The authors evaluated architecture alternatives relating to the provision of a LAN emulation service over a connection-oriented ATM network, and present the LAN emulation architecture as actually adopted by the ATM Forum LANE SWG.", } @ARTICLE{Yang95:Comparison, AUTHOR="Oliver Yang", TITLE="Performance comparison of some discrete service time systems", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=23, PAGES="261-284", YEAR=1995, REFERENCES=7, KEYWORDS="Communication Network; M/D/1; Priority; Performance Evaluation; Queue Length; Waiting Time; Interdeparture Time", ABSTRACT="This paper analyzes and compares the slotted time operation and the non-slotted time operation of a single-server system with deterministic service time. These two operations are commonly usedto model discrete service time systems in computer or digital communications.", } @ARTICLE{Scho9506:Multipoint, AUTHOR="John Schormans and Ralph J. Smith and C. I. Philips", TITLE="Performance evaluation of multipoint cell buffering in {ATM}", JOURNAL=elet, VOLUME=31, NUMBER=6, PAGES="431-432", YEAR=1995, REFERENCES=4, KEYWORDS="ATM; Switching; Buffer Management", ABSTRACT="The design and dimensioning of ATM switching elements is complicated by the need to develop effective buffer management strategies when certain network services are inherently 'broadcast' in nature. Analyses of the effect of point to MP buffering in ATM switch architectures have concentrated on designing/analysing switches that will support MP services. These assume cell replication within an element without specifically modelling it. This lett", } @ARTICLE{Virt9507:Numerical, AUTHOR="J. T. Virtamo", TITLE="Numerical evaluation of the distribution of unfinished work in an {M/D/1} system", JOURNAL=elet, ADDRESS="Great Britain", VOLUME=31, NUMBER=7, PAGES="531-532", YEAR=1995, KEYWORDS="ATM; Multiplexing; M/D/1", ABSTRACT="The known closed form solution for the buffer content distribution of an M/D/1 system poses a numerical difficulty for heavily loaded systems. A new recursive algorithm is presented which avoids this numerical problem.", } @ARTICLE{Chou95:Algorithm, AUTHOR="G. L. Choudhury and K. K. Leung and W. Whitt", TITLE="An Algorithm To Compute Blocking Probabilities In Multi-Rate Multi-Class Multi-Resource Loss Models", JOURNAL=aap, VOLUME=27, PAGES="1104-1143", YEAR=1995, REFERENCES=52, KEYWORDS="Blocking; Loss System; Resource Sharing; Circuit Switching; Generating Function", ABSTRACT="This paper considers a family of product-form loss models, including loss networks (or circuit-switched communication networks) and a class of resource-sharing models.", } @ARTICLE{Kont95:Markov, AUTHOR="K. P. Kontovasilis and N. Mitrou", TITLE="Markov-Modulated Traffic With Nearly Complete Decomposability Characteristics And Associated Fluid Queueing Models", JOURNAL=aap, VOLUME=27, PAGES="1144-1185", YEAR=1995, REFERENCES=19, KEYWORDS="Fluid flow model; Perturbation; Multiplexing", ABSTRACT="This paper considers fluid queueing models of Markov-modulated traffic that, due to large differences in the time-scales of events, possess structural characteristics that yield a nearly completely decomposable (NCD) state-space.", } @ARTICLE{Raat9507:Simulation, AUTHOR="K. Raatikainen", TITLE="Simulation-based Estimation of Proportions", JOURNAL=mms, VOLUME=41, NUMBER=7, PAGES="1202-1223", YEAR=1995, REFERENCES=22, KEYWORDS="Discrete Event Simulation", ABSTRACT="Simulated estimates for several proportions are needed in many simulation studies. The author proposes a method for controlling the length of a simulation run so that the proportions estimatedsatisfy a prespecified precision requirement.", } @ARTICLE{Chao95:Queueing, AUTHOR="XiuLi Chao", TITLE="A queueing network model with catastrophes and product form solution", JOURNAL=orl, VOLUME=18, PAGES="75-79", YEAR=1995, REFERENCES=16, KEYWORDS="Queueing Network; Computer System; Product Form", ABSTRACT="Consider a network of queues with the possibility of catastrophes at each station. When a catastrophe occurse at one service station, all the customers there are destroyes immediately, and theserver is then sent for repair. The catastrophes may come either from outside the system or from another service station. Steady-state probability of the queue sizes is obtained, and is shownto have a product form solution.", } @ARTICLE{Conw95:Two, AUTHOR="A. E. Conway and Julian Keilson", TITLE="Analysis of a two-stage finite buffer flow controlled queueing model by a compensation method", JOURNAL=orl, VOLUME=18, PAGES="65-74", YEAR=1995, REFERENCES=16, KEYWORDS="Blocking; Finite Buffer; Flow Control; Green Function", ABSTRACT="The exact analysis of two-stage finite buffer Markovian queueingmodel with blocking and window flow control is considered. The state distribution and mean performance performance measures areobtained by applying a so-called compensation method. This reduces the problem to that of (1) finding the Green's function for a related bivariate homogeneous Markov process defined on an unrestricted two-dimensional state space and (2) solving a relativ", } @ARTICLE{Hill95:TEStool, AUTHOR="J. S. Hill and B. Melamed", TITLE="{TEStool:} A viual interactive environment for modeling autocorrelated time series", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=24, PAGES="3-22", YEAR=1995, REFERENCES=12, KEYWORDS="Autocorrelation; Simulation; Source Model; Stochastic Process", ABSTRACT="TEStool is a visual interactive software environment for modeling autocorrelated time series, using a versatile class of stochastic processes called TES (Transform-Expand-Sample). This paper explains the TES approach to modeling empirical autocorrelated time series adopted in TEStool, as well as TEStool's graphical user interface (GUI).", } @ARTICLE{Klev95:Queueing, AUTHOR="R. L. Klevans and W. J. Stewart", TITLE="From queueing networks to Markov chains: the {XMARCA} interface", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=24, PAGES="23-45", YEAR=1995, REFERENCES=21, KEYWORDS="Software; Queueing System; Markov Chain", ABSTRACT="XMARCA is a graphical tool that permits a user to manipulate icons of queueing components to build closed queueing networks thatare then solved by numerical procedures.", } @ARTICLE{Chio95:GreatSPN, AUTHOR="Giovanni Chiola and Giuliana A. Franceschinis and R. Gaeta and M. Ribaudo", TITLE="{GreatSPN} 1.7: graphical editor and analyzer for timed and stochastic Petri nets", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=24, PAGES="47-68", YEAR=1995, REFERENCES=22, KEYWORDS="Petri Net; GSPN; Modeling; Simulation", ABSTRACT="This paper describes the GreatSPN 1.7 package for the modeling, validation, and performance evaluation of distributed systems using Generalized Stochastic Petri Nets and their colored extension. The tool provides a friendly framework to experiment with timed Petri net based modeling techniques.", } @ARTICLE{Germ95:TimeNET, AUTHOR="R. German and C. Kelling and A. Zimmermann and G. Hommel", TITLE="TimeNET: a toolkit for evaluating non-Markovian stochastic Petri nets", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=24, PAGES="69-87", YEAR=1995, REFERENCES=34, KEYWORDS="Performance Model; Analysis; Simulation; Petri Net", ABSTRACT="This paper describes TimeNET (Time Net Evaluation Tool), a software package for the modeling and evaluation of stochastic Petri nets with non-exponentially distributed firing times. TimeNET has been developed at the Technische Universit,t Berlin in severalresearch projects. A graphical user interface is provided for the model specification and specialized analysis and simulation components is are used for the automated model evaluation. The i", } @ARTICLE{Sand95:UltraSAN, AUTHOR="W. H. Sanders and W. D. Obal and M. A. Qureshi and F. K. Widjanarko", TITLE="The {UltraSAN} modeling environment", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=24, PAGES="89-115", YEAR=1995, REFERENCES=42, KEYWORDS="Petri Net; Stochastic Network; Evaluation", ABSTRACT="Model-based evaluation of computer systems and networks is an increasingly important activity. For modeling to be used effectively, software environments are needed that ease model specification, construction, and solution. Easy to use, graphical methods for model specification that support solution of families of models with differing parameter values are also needed. Since no model solution technique is ideal for all situations, multiple anal", } @ARTICLE{Fran95:Toolset, AUTHOR="G. Franks and others", TITLE="A toolset for performance engineering and software design of client-server systems", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=24, PAGES="117-136", YEAR=1995, REFERENCES=33, KEYWORDS="Software Engineering; Performance Model; Distributed System", ABSTRACT="TimeBench/SRVN is a prototype toolset for computer-aided designand performance analysis of software, with an emphasis on distributed client-server systems.", } @ARTICLE{Ajmo95:ATM, AUTHOR="Marco {Ajmone Marsan} and others", TITLE="{ATM} simulation with {CLASS}", JOURNAL=pe, ADDRESS="Netherlands", VOLUME=24, PAGES="137-159", YEAR=1995, REFERENCES=27, KEYWORDS="ATM; Network; B-ISDN; Simulation", ABSTRACT="The paper describes an efficient, versatile and extensible software tool for the analysis of the quality of connectionless services in ATM networks. The tool is named CLASS for ConnectionLess ATM Services Simulator. CLASS is a time-driven, slotted, synchronous simulator, entirely written in standard C language.", } @ARTICLE{Akaz9501:Personal, AUTHOR="N. Akazawa and T. Tanda and T. Chiba and T. Kawaguchi", TITLE="Personal Handy Phone System Portable Station Design for Hand-Over operation", JOURNAL=nttrev, ADDRESS="Japan", VOLUME=7, NUMBER=1, PAGES="74-79", YEAR=1995, REFERENCES=3, KEYWORDS="Handover; Portability; MAT", ABSTRACT="In the Personal Handy Phone System, the channel must be handed over from one zone to another zone at the Portable Station. This involves two important processes: detecting that the channel hasmoved outside of the communication zone and determining the newzone. This article describes these two processes.", } @INPROCEEDINGS{Aue95:Multiple, AUTHOR="V. Aue and G. Fettweis and H. Nuszkowski", TITLE="A Multiple-Access Scheme for Multimedia Cellular Systems", BOOKTITLE="Fachtagung", ADDRESS="Ilmenau, Germany", PAGES="1-6", YEAR=1995, KEYWORDS="Multiple Access; Cellular System; CDMA", ABSTRACT="This paper proposes a new code-division multiple access system design based on a multi-carrier modulation scheme which especially suits the needs for wireless multimedia applications.", } @ARTICLE{Baha95:Results, AUTHOR="A. S. Bahai and G. Fettweis", TITLE="Results on Multi-Carrier {CDMA} Receiver Design", JOURNAL=globecom, PAGES="915-918", YEAR=1995, REFERENCES=4, KEYWORDS="CDMA; Design", ABSTRACT="Spread spectrum techniques require accurate timing and carrier synchronization and usually encounter performance loss under significant Doppler spread condition. Applying the multi-carrier technique to spread spectrum systems makes the system more robust against timing offset and Doppler spread. The optimum receiver for multi-carrier systems can be designed using duality principle in communication systems. Sensitivity to frequency and timing ph", } @ARTICLE{Baus9503:Von, AUTHOR="F. Bause and M. Sczittnick", TITLE="Design von Modellierungstools zur Leistungsbewertung: {HIT,} {MACOM,} {QPN-Tool}", JOURNAL=itti, ADDRESS="Germany", VOLUME=37, NUMBER=3, PAGES="34-40", YEAR=1995, LANGUAGE="German", REFERENCES=19, KEYWORDS="Design; Tool; Performance Evaluation; Simulation", ABSTRACT="This article describes important design criteria for such tools, which are given by the intended application area, the underlying modelling formalism, used analysis techniques and user interfaces.", } @ARTICLE{Beil9503:Werkzeuge, AUTHOR="H. Beilner", TITLE="Werkzeuge zur modellgesttzten Leistungsbewertung", JOURNAL=itti, ADDRESS="Germany", VOLUME=37, NUMBER=3, PAGES="5-9", YEAR=1995, LANGUAGE="German", REFERENCES=5, KEYWORDS="Performance Evaluation; Tool", ABSTRACT="Dieses Themenheft besch„ftigt sich vorrangig mit Aspekten der IS(Informations- verarbeitendes System)-Leistung, ein Begriff, der Eigenschaften der Effektivit„t (wie niedrige Antwortzeiten undhoher Durchsatz) und Effizienz (wie hohe Ressourcen-Nutzung undgeringer Overhead) subsumiert.", } @ARTICLE{Bono9507:Adaptive, AUTHOR="F. Bonomi and D. Mitra and J. B. Seery", TITLE="Adaptive Algorithms for Feedback-Based Flow Control in High-Speed,Wide-Area {ATM} Networks", JOURNAL=ieeejsac, VOLUME="SAC-13", NUMBER=7, PAGES="1267-1283", YEAR=1995, REFERENCES=24, KEYWORDS="Algorithm; Flow Control; Feedback; High Speed; ATM; Network", ABSTRACT="This paper gives a class of flow control algorithms for the adaptive allocation of bandwidths to virtual connections (VC) in high-speed, wide-area ATM networks.", } @ARTICLE{Fara9507:New, AUTHOR="A. Farag¢ and Søren Blaabjerg and L. Ast and G. Gordos and T. Henk", TITLE="A New Degree of Freedom in {ATM} Network Dimensioning: Optimizing the Logical Configuration", JOURNAL=ieeejsac, VOLUME="SAC-13", NUMBER=7, PAGES="1199-1205", YEAR=1995, REFERENCES=14, KEYWORDS="ATM; Network; Optimization", ABSTRACT="A mathematical model is presented that provides a well-defined formulation of the logical configuration problem of ATM networks with the objective of maximizing the total expected network revenue, given the physical network parameters and the traffic requirements of each virtual subnetwork.", } @ARTICLE{Fari95:Re, AUTHOR="A. E. Faria and R. C. Souza", TITLE="A Re-evaluation of the Quasi-Bayes Approach to the Linear Combination of Forecast", JOURNAL="Journal of Forecasting", VOLUME=14, PAGES="533-542", YEAR=1995, REFERENCES=15, KEYWORDS="Forecasting", ABSTRACT="The subjective forecasts used in decision analysis should, in principle, synthesize all available evidence about the subject in analysis. In this manner, when part of the evidence consists of a variety of forecasting models or expert opinions, Decision Theory requires the decision maker to formulate a combination of these predictors. This work takes into account the Bayesian methodologies outperformance and quasi-Bayes, as well as classical mod", } @ARTICLE{Fons95:Exact, AUTHOR="P. Fonseca and Jonathan Pitts and L. G. Cuthbert", TITLE="Exact fluid-flow analysis of single {ON/OFF} source feeding an {ATM} buffer with space priority", JOURNAL=elet, ADDRESS="Great Britain", VOLUME=31, NUMBER=13, PAGES="1028-1029", YEAR=1995, REFERENCES=5, KEYWORDS="ATM; Queueing Theory; Analysis; Buffer; fluid flow model; priority", ABSTRACT="The article describes the analysis of an ATM buffer with space priority.", } @ARTICLE{Geye9505:NETPLAN, AUTHOR="M. Geyer and M. M. Buchner", TITLE="{NETPLAN} 2000: die neue Dimension toolgesttzter Netzgestaltung", JOURNAL="Telcom Report", ADDRESS="Germany", VOLUME=18, NUMBER=5, PAGES="240-247", YEAR=1995, LANGUAGE="German", KEYWORDS="Network; Network Planning; Network Architecture", ABSTRACT="Der Artikel beschreibt NETPLAN 2000: ein rechnergesttztes Planungssystem zum Dimensionieren und Optimieren von Transportnetzen.", } @ARTICLE{Gibb9507:Network, AUTHOR="R. J. Gibbens and F. P. Kelly", TITLE="Network Programming Methods for Loss Networks", JOURNAL=ieeejsac, VOLUME=13, NUMBER=7, PAGES="1189-1198", YEAR=1995, REFERENCES=36, KEYWORDS="Loss System; Network; Programming", ABSTRACT="This paper describes how some of the insights available form thestochastic analysis of dynamic routing may be cooperated into the classical mathematical programming approach to the design of networks.", } @ARTICLE{Hart9503:Modellierung, AUTHOR="F. Hartleb and P. Dauphin and R. Klar and A. Quick and M. Siegle", TITLE="Modellierung und Meßunterstützung mit dem Werkzeug {PEPP}", JOURNAL=itti, ADDRESS="Germany", VOLUME=37, NUMBER=3, PAGES="41-46", YEAR=1995, KEYWORDS="Modeling; graph model", ABSTRACT="PEPP erlaubt die ablauforientierte Modellierung paralleler Programme mit stochastischen Graphmodellen. Exakte und approximative Auswerteverfahren erm”glichen Laufzeitvorhersagen fr Graphmodelle von unterschiedlichem Typhus und Komplexit„t. Darberhinaus bietet PEPP Funktionen zur Untersttzung der modellgesteuerten Messung und die M”glichkeit, Modelle mit beliebigen gemessenen Verteilungsfunktionen zu parametrisieren.", } @ARTICLE{Hori9501:Frame, AUTHOR="S. Hori and K. Kaneshige and H. Saigo and H. Shinoda", TITLE="Frame Relay Protocols and Efforts to Develop Application Techniques", JOURNAL=nttrev, ADDRESS="Japan", VOLUME=7, NUMBER=1, PAGES="28-34", YEAR=1995, REFERENCES=1, KEYWORDS="Frame Relay; Protocol; User Interface", ABSTRACT="This article describes the features of frame relay protocols, the higher layer protocols when frame relay is used as a wide-areanetwork and efforts under way to establish techniques for usingthe frame relay network.", } @ARTICLE{Ilia95:Congestion, AUTHOR="I. Iliadis", TITLE="Congestion Control For Long Propagation Delay", JOURNAL="IBM report", ADDRESS="Rschlikon, Switzerland", PAGES="1-7", YEAR=1995, KEYWORDS="Congestion Control; Delay", } @ARTICLE{Li9504:Network, AUTHOR="Gang Li and P. W. Dowd", TITLE="An Analysis of Network Performance Degradation Induced by WorkloadFluctuations", JOURNAL=ieanep, VOLUME=3, NUMBER=4, PAGES="433-440", YEAR=1995, REFERENCES=24, KEYWORDS="Analysis; Workload", ABSTRACT="This paper presents an analysis of network performance degradation induced by workload fluctuations. The basis idea of the analysis is based on catastrophe theory. The analysis shows that fluctuations in workload may change the dynamic structure of the system state space and cause the network performance to vary drastically.", } @ARTICLE{Pool9503:Tools, AUTHOR="R. J. Pooley", TITLE="Performance Analysis Tools in Europe", JOURNAL=itti, ADDRESS="Germany", VOLUME=37, NUMBER=3, PAGES="10-16", YEAR=1995, REFERENCES=32, KEYWORDS="Analysis; Tool", ABSTRACT="Dieser Beitrag enth„lt eine šbersicht an derzeit verfgbaren Werkzeugen zur Leistungs-Modellierung von Rechensystemen und Netzwerken, die seitens kommerzieller und akademischer Organisationen in Europa erh„ltlich sind.", } @ARTICLE{Smit9503:Evolution, AUTHOR="C. U. Smith", TITLE="The Evolution of Performance Analysis Tools", JOURNAL=itti, ADDRESS="Germany", VOLUME=37, NUMBER=3, PAGES="17-20", YEAR=1995, REFERENCES=41, KEYWORDS="Analysis; Tool", ABSTRACT="This article reviews the evolution of tools for modeling and evaluating the performance of computer and communication systems.", } @ARTICLE{Vinc9512:Relationship, AUTHOR="B. Vinck and H. Bruneel", TITLE="Relationship between delay and buffer contents in {ATM} queues", JOURNAL=elet, ADDRESS="Great Britain", VOLUME=31, NUMBER=12, PAGES="952-954", YEAR=1995, REFERENCES=4, KEYWORDS="ATM; Delay; Buffer", ABSTRACT="The article presents a relationship between the distribution of the buffer contents during an arbitrary slot and the delay experienced by an arbitrary customer, in the context of discrete-timequeues with a single server with deterministic service times ofone slot. The relationship is established under the most general conditions possible.", } @ARTICLE{Wabn9503:PAPS, AUTHOR="H. Wabnig and G. Haring", TITLE="{PAPS-Werkzeuge} zur Leistungsvorhersage von parallelen Systemen", JOURNAL=itti, ADDRESS="Germany", VOLUME=37, NUMBER=3, PAGES="48-53", YEAR=1995, LANGUAGE="German", REFERENCES=11, KEYWORDS="Tool; Parallel Computing; Performance Prediction", ABSTRACT="In diesem Artikel werden, neben der allgemeinen Beschreibung derPAPS-Werkzeuge, die Konzepte zur Realisierung der automatischenLeistungsmodellgenerierung detailliert dargestellt.", } @ARTICLE{Weis9506:Large, AUTHOR="A. Weiss", TITLE="An Introduction to Large Deviations for Communication Networks", JOURNAL=ieeejsac, VOLUME=13, NUMBER=6, PAGES="938-951", YEAR=1995, REFERENCES=34, KEYWORDS="ATM; Network; Analysis", ABSTRACT="This paper is an introduction to some large deviations techniques that have been used for analyzing models of communication networks.", } @ARTICLE{Yumi9501:Dawn, AUTHOR="H. Yumiba and M. Nagasawa and T. Koinuma", TITLE="The Dawn of a New Computer Communications Service - Frame Relay Sevice Meeting New Needs for High-Speed Data Communicationss", JOURNAL=nttrev, ADDRESS="Japan", VOLUME=7, NUMBER=1, PAGES="21-23", YEAR=1995, KEYWORDS="Communication; Frame Relay; High Speed", ABSTRACT="This article presents an overview of frame relay service, and describes the technologies for constructing frame relay systems, the communications protocols involved and applications technologies, among other aspects.", } @ARTICLE{Chen9512:Queueing, AUTHOR="Xiaopeng Chen and Ioannis Lambadaris and J. F. Hayes", TITLE="Queueing Analysis of {ATM} Multicast Switching Models", JOURNAL=ieeecom, ADDRESS="Canada", VOLUME=43, NUMBER=12, PAGES="2886-2890", YEAR=1995, REFERENCES=9, KEYWORDS="ATM; Multicast; Switching", ABSTRACT="The performance of a multicast switching system with a cyclic priority input access scheme is evaluated by means of an analytic model which may treat two distinct multicast switches in a unified way. The performance measure is the packet delay at the inputbuffer of the system. The analysis is subsequently performed using matrx-geometric techniques and the numerical results are compared with simulations.", } @ARTICLE{Malh95:Computationally, AUTHOR="M. Malhotra", TITLE="A computationally efficient technique for transient analysis of repairable Markovian systems", JOURNAL=pe, VOLUME=24, PAGES="311-331", YEAR=1995, REFERENCES=34, KEYWORDS="Availability; Dependency; Markov Chain; Performability; Reliability; Stability; Transient Analysis", ABSTRACT="A technique to design efficient methods using a combination of explicit (non-stiff) and implicit (stiff) ODE methods for numerical transient analysis of repairable Markovian systems is proposed. Repairable systems give rise to stiff Markov chains due to extreme disparity between failure rates and repair rates. The authors approach is based on the observation that stiff Markov chains are non-stiff for an initial phase of the solution interval. A", } @TECHREPORT{Gerl95:Toolkit, AUTHOR="N. Gerlich", TITLE="A Toolkit of Octave Functions for Discrete-Time Analysis of Queueing Systems", INSTITUTION="Institute of Computer Science, University of Würzburg", ADDRESS="Würzburg, Germany", VOLUME=128, PAGES="1-20", YEAR=1995, REFERENCES=127, KEYWORDS="Tool; discrete time analysis; queueing system", ABSTRACT="The modularity of the Discrete-Time Analysis (DTA) technique calls for a toolkit consisting of all operators involved in order to easily implement the algorithms on a computer using object-oriented language. This paper presents a toolkit of DTA operators written in the Octave language. The use of the toolkit is demonstrated by the numerical analysis of the discrete-time GI/GI/1 queueing system and the recently often employed discrete-time GI/GI/1", } @ARTICLE{Karg9502:Randomized, AUTHOR="D. R. Karger and P. N. Klein and R. E. Tarjan", TITLE="A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees", JOURNAL=jacm, VOLUME=42, NUMBER=2, PAGES="321-328", YEAR=1995, REFERENCES=23, KEYWORDS="Algorithm; Analysis; Complexity; Graph Theory; Tree Network", ABSTRACT="The authors present a randomized linear-time algorithm to find aminimum spanning tree in a connected graph with edge weights. The algorithm uses random sampling in combination with a recentlydiscovered linear-time algorithm for verifying a minimum spanning tree. The computational model is a unit-cost random-access machine with the restriction that the only operations allowed on edge weights are binary comparisons.", } @ARTICLE{Gouv9501:2n, AUTHOR="L. Gouveia", TITLE="A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem", JOURNAL=or, VOLUME=43, NUMBER=1, PAGES="130-141", YEAR=1995, REFERENCES=29, KEYWORDS="Network; Graph Theory; Algorithm; Tree Network", ABSTRACT="This paper presents a new formulation for the Capacitated Minimal Spanning Tree (CMST) problem. One advantage of the new formulation is that it is more compact (in the number of constraints) than a well-known formulation. Additionally, the authors show that the linear programming relaxation of both formulations produces optimal solutions with the same cost.", } @ARTICLE{Magn9501:Modeling, AUTHOR="T. L. Magnanti and P. B. Mirchandani and R. Vachani", TITLE="Modeling and Solving the Two-Facility Capacitated Network Loading Problem", JOURNAL=or, VOLUME=43, NUMBER=1, PAGES="142-157", YEAR=1995, REFERENCES=36, KEYWORDS="Network; Design; Analysis", ABSTRACT="This paper studies a topical and economically significant capacitated Network design problem that arises in the telecommunivations industry.", } @ARTICLE{Bala9501:Decomposition, AUTHOR="A. Balakrishnan and T. L. Magnanti and R. T. Wong", TITLE="A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning", JOURNAL=or, VOLUME=43, NUMBER=1, PAGES="58-75", YEAR=1995, REFERENCES=6, KEYWORDS="Network; Programming; Decomposition; Algorithm", ABSTRACT="This paper develops and tests a decomposition methodology to generate cost-effective expansion plans, with performance guarantees, for one major component of the network hierarchy - the local access network.", } @ARTICLE{Chan9501:Lower, AUTHOR="Shih-Fu Chang and Bezalel X Gavish", TITLE="Lower Bounding Procedures for Multiperiods Telecommunications Network Expansion Problems", JOURNAL=or, VOLUME=43, NUMBER=1, PAGES="43-57", YEAR=1995, REFERENCES=17, KEYWORDS="Network; Lower Bound; Algorithm", ABSTRACT="This paper suggests an improved formulation for the multiperiod network topology and capacity expansion problem and proposes newlower bounding schemes based on it. It differs from earlier formulations and solution methods in that entirely new and different subproblems are solved and a number of lower bound tightening schemes are added within the framework of a Lagrangian relaxation.", } @ARTICLE{Lee9501:Logical, AUTHOR="M. J. Lee and James Yee", TITLE="A Logical Topology and Discrete Capacity Assignment Algorithm for Reconfigurable Networks", JOURNAL=or, VOLUME=43, NUMBER=1, PAGES="102-115", YEAR=1995, REFERENCES=10, KEYWORDS="Logical Network Structure; Topology; Algorithm; Reconfigurable Network", ABSTRACT="A reconfigurable network is a circuit-switched network where theeffective topology and capacities can be dynamically adapted tochanges in the traffic requirements or to changes in the structure of the network due to failures. The application of reconfigurable networks considred in this paper is data communications. The authors formulated the joint topology, capacity and routing problem in a reconfigurable network as a nonlinear, mixed intege", } @ARTICLE{Nede9509:End, AUTHOR="L. Nederlof and Kris Struyve and Chris O'Shea and Howard S. Misser and Yonggang Du and Braulio Tamayo", TITLE="End-to-End Survivable Broadband Networks", JOURNAL=ieeecm, VOLUME=33, NUMBER=9, PAGES="63-71", MONTH="Sep", YEAR=1995, KEYWORDS="End-to-End survivable broadband networks; SDH; ATM; public broadband networks", ABSTRACT="Within the EC-sponsored RACE program, the IMMUNE project was established to analyze and specify appropriate strategies for introducing end-to-end survivability into corporate and public broadband networks.", } @ARTICLE{Wong9505:M, AUTHOR="Eugene Wong and Takshing P. Yum and Kenneth Chan", TITLE="Analysis of the M and {M²} Routings in Circuit-Switched Networks", JOURNAL="Communication Networks", VOLUME=6, NUMBER=5, PAGES="613-619", YEAR=1995, REFERENCES=14, KEYWORDS="Analysis; Routing; Circuit Switching; Network", ABSTRACT="In this paper, the authors analyze two alternate-path routing rules called the Maximum Free Circuit routing and the Maximum FreeCircuit with Minimum Occupied channel routing.", } @ARTICLE{Ko9504:Cable, AUTHOR="D. P. Ko and M. Gell", TITLE="Cable Franchise Growth in the {U.K.}", JOURNAL=ett, ADDRESS="Italy", VOLUME=6, NUMBER=4, PAGES="397-406", YEAR=1995, REFERENCES=39, KEYWORDS="Network; forecasting", ABSTRACT="A phenomenoligical model of the growth in the franchised cable network in the UK is presented. The model provides insight into the different growth regimes which have been exhibitied, and reveals a universal characteristic displayed by the market. Using the model as a guide into the future suggests that the growth targets set by regulatory authority will be missed.", } @ARTICLE{Ash9507:Dynamic, AUTHOR="G. R. Ash", TITLE="Dynamic Network Evolution, with Examples from {AT\&T's} Evolving Dynamic Network", JOURNAL=ieeecm, VOLUME=33, NUMBER=7, PAGES="26-39", YEAR=1995, REFERENCES=26, KEYWORDS="Network Evolution; Routing; Dynamic Routing", ABSTRACT="Dynamic network evolution achieves network performance improvement and cost reduction by taking advantage of new advanced technologies being introduced into the network to achieve greater network flexibility and efficiency.", } @ARTICLE{Kawa9507:State, AUTHOR="K. Kawashima and A. Inoue", TITLE="State- and Time-Dependent Routing in the {NTT} Network", JOURNAL=ieeecm, VOLUME=33, NUMBER=7, PAGES="40-47", YEAR=1995, REFERENCES=30, KEYWORDS="State Dependent Routing; Routing; Dynamic Routing", ABSTRACT="This article gives an overview of STR (state- and time-dependentrouting) and its advanced call-level routing, describes the current STR network and the performance of STR with two examples from the NTT network, and addresses a dimensioning method for STR.", } @ARTICLE{Rgni9507:Dynamically, AUTHOR="J. Rëgnier and F. Bëdard and Jean Choquette and A. Caron", TITLE="Dynamically Controlled Routing in Networks with Non-DCR-Compliant Switches", JOURNAL=ieeecm, VOLUME=33, NUMBER=7, PAGES="48-52", YEAR=1995, REFERENCES=9, KEYWORDS="Routing; Dynamic Routing", ABSTRACT="First the paper presents DCR, and describes how it can be enhanced to interwork with non-DCR switches. The following section also describes the routing schemes considered for the non-DCR switches, and describes how they can interwork with DCR. After that it is analysed the performance that a network can expect to achieve when it supports DCR in its DCR switches in conjunction with one of the other routing schemes in its non-DCR switches.", } @ARTICLE{Kash9507:Dynamic, AUTHOR="A. Kashper and Y. Watanabe", TITLE="Dynamic Routing in the Multiple Carrier International Network", JOURNAL=ieeecm, VOLUME=33, NUMBER=7, PAGES="54-61", YEAR=1995, REFERENCES=12, KEYWORDS="Routing; Dynamic Routing", ABSTRACT="The article presents an overview of the efforts of the 13 participating carriers that comprise the Worldwide Intelligent Network(WIN) Dynamic Routing Group to introduce dynamic routing internationally.", } @ARTICLE{Kris9507:Improved, AUTHOR="K. R. Krishnan and R. D. Doverspike and C. D. Pack", TITLE="Improved Survivability with Multi-Layer Dynamic Routing", JOURNAL=ieeecm, VOLUME=33, NUMBER=7, PAGES="62-68", YEAR=1995, REFERENCES=14, KEYWORDS="Routing; Dynamic Routing", ABSTRACT="This article deals with the integrated design and analysis of a telecommuniactions network to achieve specified levels of survivability under various failure modes and conditions.", } @ARTICLE{Chem9507:Fuzzy, AUTHOR="Prosper Chemouil and J. Khalfet and M. Lebourges", TITLE="A Fuzzy Control Approach for Adaptive Traffic Routing", JOURNAL=ieeecm, VOLUME=33, NUMBER=7, PAGES="70-76", YEAR=1995, REFERENCES=13, KEYWORDS="Control; Adaptive Routing", ABSTRACT="This article investigates the use of fuzzy control techniques for adaptive traffic routing in telephone networks.", } @ARTICLE{Gibb9506:Decision, AUTHOR="R. J. Gibbens and F. P. Kelly and P. B. Key", TITLE="A Decision-Theoretic Approach to Call Admission Control in {ATM} Networks", JOURNAL=ieeejsac, VOLUME="SAC-13", NUMBER=6, PAGES="1101-1113", YEAR=1995, REFERENCES=41, KEYWORDS="ATM; Control; Analysis; CDV; PERFORMANCE EVALUATION", ABSTRACT="This paper describes a simple and robust ATM call admission control, and develpos the theoretical background for its analysis.", } @INPROCEEDINGS{Mark95:UPC, AUTHOR="B. L. Mark and G. Ramamurthy", TITLE="{UPC} Based Traffic Descriptors for {ATM:} How to determine, interpretand use them", BOOKTITLE="First International ATM Traffic Expert Symposium", ADDRESS="Basel, Switzerland", PAGES="1-14", YEAR=1995, REFERENCES=4, KEYWORDS="ATM; Traffic Parameter; Leaky Bucket; SOURCE POLICING; TRAFFIC SHAPING", ABSTRACT="This paper addresses the following basic problems: Given a cell stream from arbitrary traffic source, how should the values of the UPC parameters be chosen? The answer should depend on the characteristics of the cell stream, the user's tolerance for traffic shaping, and the CAC function. The scheme of the paper is based on the dual leaky bucket algorithm discussed.", } @ARTICLE{Yama9508:Limitation, AUTHOR="Naoaki Yamanaka and Y. Sato and K. Sato", TITLE="Performance Limitation of the Leaky Bucket Algorithm for {ATM} Networks", JOURNAL=ieeecom, ADDRESS="Canada", VOLUME="COM-43", NUMBER=8, PAGES="2298-2300", YEAR=1995, REFERENCES=13, KEYWORDS="ATM; Leaky Bucket; Algorithm; PERFORMANCE EVALUATION; SOURCE POLICING; BANDWIDTH ALLOCATION", ABSTRACT={The performance limitation of the "Leaky Bucket Algorithm" is analyzed for usage parameter control and traffic management in ATMnetworks. Simulation results show that the conventional statistical bandwidth allocation method, which uses "the worst pattern derived from the cell interarrival time moments" permitted by the Leaky Bucket algorithm, can not guarantee the QoS. As a result, this paper proves that the VC/VP bandwidth allocation method b}, } @ARTICLE{Mant95:Network, AUTHOR="Sam Manthorpe", TITLE="Network modelling", JOURNAL="WWW", ADDRESS="Switzerland", PAGES="1-5", YEAR=1995, REFERENCES=7, KEYWORDS="ATM; Network; Modeling; QOS", ABSTRACT="This article shows the dependencies between protocol layers especially in ATM environments. It shows, how important it is, to do not only performance evaluation on the ATM layer, but take effects on higher layers into account. Document at http://lrcwww.epfl.ch/people/sam/research\_protlevels.html . For information on author see also http://lrcwww.epfl.ch/people/sam/sam\_contact.html", } @INPROCEEDINGS{Baum95:Large, AUTHOR="M. Baumann", TITLE="Large Deviation Approximation of Finite-Time {CLR} in an {ATM-Multiplexer}", BOOKTITLE="IEEE ATM Workshop", ADDRESS="Washington, DC", PAGES="1-3", YEAR=1995, KEYWORDS="ATM; Multiplexer; Approximation; ND/D/1", ABSTRACT="Traditional approaches to evaluate QoS parameters of the B-ISDN are based on a steady state analysis of network elements. Recentresults reveal, however, that the actual CLR perceived during afinite observation time may differ remarkably from the predicted steady state value. Available contributions deal with parameters like the distribution of the number of lost cells during lossy periods, and conditional cell loss probabilities.", } @ARTICLE{Chan9501:Smoothing, AUTHOR="C. J. Chang", TITLE="Smoothing Point Processes as a Means to Increase Throughput", JOURNAL=or, VOLUME=43, NUMBER=1, PAGES="117-129", YEAR=1995, REFERENCES=36, KEYWORDS="Throughput; Point Process", ABSTRACT="Unlike the leaky-bucket scheme which regulates the input rate, the filters the author study in this paper reduce the variabilityof interarrival times (subject to a maximum delay contraint foreach customer). These filters are called smoothing filters for point processes. By considering the output processes of various queueing systems, the author show that an ifinite-server queue acts as a smoothing filter for a doubly stochastic Poisson proce", } @ARTICLE{Tse9506:Statistical, AUTHOR="D. Tse and Robert Gallager and J. Tsitsiklis", TITLE="Statistical Multiplexing of Multiple Time-Scale Markov Streams", JOURNAL=ieeejsac, VOLUME="SAC-13", NUMBER=6, PAGES="1028-1038", YEAR=1995, REFERENCES=24, KEYWORDS="Statistical Multiplexing; Markov Process; Stream Traffic; CORRELATION; APPROXIMATION; ATM", ABSTRACT="The article studies the problem of statistical multiplexing of cell streams that have correlations at multiple time-scales. Eachstream is modeled by a singularly pertubed Markov-modulated process with some state transitions occuring much less frequently than others.", } @ARTICLE{Mant95:Buffer, AUTHOR="Sam Manthorpe", TITLE="Buffer and Bandwidth Allocation for {TCP} data traffic: ExperimentalResults", JOURNAL="WWW", ADDRESS="Switzerland", PAGES="1-10", YEAR=1995, REFERENCES=11, KEYWORDS="ATM; TCP/IP; Buffer; Bandwidth Allocation; Data Traffic; QOS", ABSTRACT="This paper discusses the dimensioning of buffers and the bandwidth allocation for data in the ATM network. The paper presents experimental results from the COMBINE Testbed. see: http://lrcsuns.epfl.ch", } @ARTICLE{Kell95:Notes, AUTHOR="F. P. Kelly", TITLE="Notes on Effective Bandwidths", JOURNAL="WWW", ADDRESS="Great Britain", PAGES=28, YEAR=1995, REFERENCES=56, KEYWORDS="Bandwidth Allocation; Multiplexing; Analysis; Model", ABSTRACT="view of work to date on effective bandwidths, emphasising the unifying role of the concept: as a summary of the statistical characteristics of sources over different time and space scales; in bounds, limits and approximationsfor various models of multiplexing under QoS constraints; and as the basis for simple and robust tariffing and connection acceptance control mech. for poorly character. traffic., see: http://www.statslab.cam.ac.uk/~frank/", } @ARTICLE{Cour95:Buffer, AUTHOR="C. A. Courcoubetis and R. A. Weber", TITLE="Buffer Overflow Asymptotics for a Buffer Handling many Traffic Sources", JOURNAL="WWW", ADDRESS="GR", PAGES=21, YEAR=1995, REFERENCES=14, KEYWORDS="ATM; Buffer; Overflow; Traffic Source; Asymptotic analysis; Markov system; fluid flow model", ABSTRACT="As a model for an ATM switch the authors consider the overflow frequency of a queue that is served at a constant rate and in which the arrival process is the superposition of N traffic streams.", } @ARTICLE{Abat95:Limits, AUTHOR="J. Abate and W. Whitt", TITLE="Limits and Approximations for the Busy-Period Distribution in Single-Server Queues", JOURNAL="Probability in the Engineering and Informational Sciences", VOLUME=9, NUMBER=4, PAGES="581-602", YEAR=1995, REFERENCES=33, KEYWORDS="Approximation; busy period; distribution function; heavy traffic approximation; limit theorem; M/G/1; queueing system; single server", ABSTRACT="Limit theorems are established and relatively simple closed-form approximations are developed for the busy-period distribution in single-server queues. For the M/G/1 queze, the complementary busy-period c.d.f. is shown to be asymptotically equivalent as t -> infinity to a scaled version of the heavy-traffic limit (obtained as rho -> 1), where the scaling parameters are based on the asymptotics as t -> infinity. We call this the asymptotic norma", } @ARTICLE{Adan95:Fitting, AUTHOR="I. Adan and M. van Eenige and J. Resing", TITLE="Fitting Discrete Distributions on the First Two Moments", JOURNAL="Probability in the Engineering and Informational Sciences", VOLUME=9, NUMBER=4, PAGES="623-632", YEAR=1995, REFERENCES=10, KEYWORDS="Approximation; d/g/1; discrete time; distribution function; estimation; iterative method", ABSTRACT="In this paper we present a simple method to fit a discrete distribution on the first two moments of a given random variable. With the fitted distribution we solve approximately Lindley's equation for the D/G/1 queue with discrete service-time distribution using a moment-iteration method. Numerical results show excellent performance of the method.", } @ARTICLE{Agra95:Architecture, AUTHOR="J. P. Agrawal and Upkar Varshney", TITLE="Architecture and Performance of {MLAN:} A Multimedia Local {ATM} Network", JOURNAL="Simulation", VOLUME=64, NUMBER=1, PAGES="15-26", YEAR=1995, REFERENCES=21, KEYWORDS="Lan; protocol", ABSTRACT="In this paper we present a Multimedia Local ATM Network (MLAN) protocol suitable for campus environment wich operates in the native ATM mode, does dynamic and fair bandwidth allocation as per desired criteria, guarantees continuous access to real time and high priority data traffic and offers connectionless as well as connection-oriented services for MLAN-ATM network communications. The protocol has been designed for a bidirectional broadcast", } @ARTICLE{Ahre95:Symbiose, AUTHOR="F. Ahrens and K. Etschberger", TITLE="Die Symbiose zweier Favoriten", JOURNAL="Elektronik", ADDRESS="Germany", VOLUME=10, PAGES="54-61", YEAR=1995, LANGUAGE="German", REFERENCES=3, KEYWORDS="Bus; shared bus; software", ABSTRACT="CAN, ein ursprünglich für das Automobil gedachtes Bussystem, und Windows, ein Betriebssystem für den B roalltag: Zwei Systeme, die immer stärker in die Autmatisierungstechnik eindringen. Mit dem richtigen Know-how lassen sie sich vorteilhaft kombinieren.", } @INPROCEEDINGS{Al95:RING, AUTHOR="Rashid Al-Naami", TITLE="A ring network with two tokens", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="839-842", YEAR=1995, REFERENCES=5, KEYWORDS="Media access control; ring network; token ring", ABSTRACT="The throughput of a token-ring network is a function of the propagation delay, and that is due to the decrease in the throughput along with the increase of the propagation delay. In a traditional token-ring network where is a single token is used, a transmitting station emits a free token to the next station after it receives the leading edge of its frame, so one can notice that the propagation delay has a grat impact on the throughput. In this", } @ARTICLE{Andr95:Accelerated, AUTHOR="S. Andradóttir and J. M. Calvin and P. W. Glynn", TITLE="Accelerated Regeneration for Markov Chain Simulations", JOURNAL="Probability in the Engineering and Informational Sciences", VOLUME=9, NUMBER=4, PAGES="497-523", YEAR=1995, REFERENCES=24, KEYWORDS="Decomposition; markov chain; regenerative simulation", ABSTRACT={This paper describes a generalization of the classical regenreative method of simulation output analysis. Instead of blocking a generated sample path on return to a fixed return state, a more general scheme to randomly decompose the path is used. In some cases, this decompositioni scheme results in regeneration times that are a supersequence of the classical regeneration times. This "accelerated" regeneration is advantageous in several simulati}, } @ARTICLE{Andr95:Propagation, AUTHOR="J. B. Andresen and Theodore Rappaport and S. Yoshida", TITLE="Propagation Measurements and Models for Wireless Communications Channels", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=33, NUMBER=1, PAGES="42-49", YEAR=1995, REFERENCES=30, KEYWORDS="Mobile radio; radio channel", ABSTRACT="To achieve ubiquitous PCS, new and novel ways of classifying wireless environments will be needed that are both widely encompassing and reasonably compact.", } @ARTICLE{Arai95:Dielectric, AUTHOR="T. Arai and K. Ayusawa", TITLE="Dielectric Resonator Filter for 10 Gbit/s Optical Transmission Systems", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="117-120", YEAR=1995, REFERENCES=6, KEYWORDS="Network; technology", } @ARTICLE{Arim95:µm, AUTHOR="H. Arimoto and T. Munakata and Y. Saito", TITLE="1.3 µm Low Threshold Current Strained Layer-Multi Quantum Well Laser Diode", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="79-82", YEAR=1995, REFERENCES=7, KEYWORDS="Network; technology", } @INPROCEEDINGS{Ayan95:Reduction, AUTHOR="Ender Ayanoglu", TITLE="Reduction of Restoration Capacity Requirements in Advanced Optical Networks", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="1018-1022", YEAR=1995, KEYWORDS="Protection; wan", ABSTRACT="This paper investigates the required excess capacity and the required number of optical transceivers for restoration against single link or node failures in future MANs and WANs. The following aspects of optical networking technology are taken into account: (i) elctronic switching and optical transmission with one wavelength per fiber, (ii) WDM, (iii) tunable transmitters and receivers, (iv) optical bypass technology, and (v) wavelength convers", } @ARTICLE{Ayna95:Modeling, AUTHOR="R. Aynai and Y. Ismailov and M. Liljenstam and A. Popescu and others", TITLE="Modeling and Simulation of a High Speed {LAN}", JOURNAL="Simulation", VOLUME=64, NUMBER=1, PAGES="7-14", YEAR=1995, REFERENCES=10, KEYWORDS="Discrete event simulation; distributed simulation", ABSTRACT="Simulation is a tool that can be used to assess functionality and performance of communication networks and protocols. However, efficient simulation of complex communication systmes is not a trivial task. In this paper, we discuss modeling and simulation of bus-based communication networks and present the results of modeling and simulation of a multigigabit/s LAN. We used parallel simulation techniques to reduce the simulation time of the LAN a", } @INPROCEEDINGS{Aziz95:Effects, AUTHOR="M. Azizoglu and R. A. Barry and A. Mokhtar", TITLE="The Effects of Tuning Time in Bandwidth-Limited Optical Braodcast Networks", BOOKTITLE=infocom, ISBN="0-8186-6990-X", ADDRESS="Los Alamitos, California", PAGES="138-145", YEAR=1995, REFERENCES=12, KEYWORDS="Network; optical lan; optical switching; tuning; wdm", ABSTRACT="We consider the effects of tuning delay in optical braodcast networks. We show that for off-line scheduling these effects are small event if the tuning time is as large as the packet duration. In particular, we consider scheduling of random traffic with tunable transmitters and fixed-tuned receivers. We provide a lower bound to the completion time of any off-line schedule with an arbitrary number of wavelengths. We then describe a near-optimal", } @ARTICLE{Baac95:Photonik, AUTHOR="C. Baack and E. J. Bachus and K.-D. Langer and G. Walf", TITLE="Photonik für die Telekommunikation - Teil 1", JOURNAL=ntz, ISBN="0948-728X", PUBLISHER="VDE-Verlag", ADDRESS="Germany", VOLUME=48, NUMBER=10, PAGES="20-25", YEAR=1995, LANGUAGE="German", REFERENCES=15, KEYWORDS="Multiplexing; network; wdm", ABSTRACT="Übersicht über photonische Multiplexverfahren und Netzelemente", } @PHDTHESIS{Bafu95:Modellierung, AUTHOR="M. Bafutto", TITLE="Modellierung, Verkehrsanalyse und Planung von Zentralkanal-Signalisiernetzen im {ISDN} mit besonderer Ber cksichtigung neuer Dienste der Mobilkommunikation und des Intelligenten Netzes", SCHOOL="Universität Stuttgart, Elektrotechnik, IND", ADDRESS="Stuttgart, Germany", VOLUME=63, NOTE="Bericht über verkehrstheoretische Arbeiten", YEAR=1995, LANGUAGE="German", KEYWORDS="Capacity planning; decomposition; intelligent network; mobile radio; modeling; network planning; signalling; signalling protocol; traffic model", } @INPROCEEDINGS{Bake95:High, AUTHOR="G. Baker and Gert Van der Plas", TITLE="High Speed Access for the Full Service Network", BOOKTITLE=efoc, ADDRESS="Netherlands", PAGES="162-165", YEAR=1995, REFERENCES=9, KEYWORDS="Atm; integrated network; access network", ABSTRACT="To provide high speed access new technologies are required. Therefore the architecture and network concept is presented with: - end-to-end use of ATM - different access media (fiber, twisted pair, coax) - integration of NB and BB services", } @INPROCEEDINGS{Bala95:ATM, AUTHOR="R. Balay and A. Nilsson", TITLE="On per-session performance of an {ATM} multiplexer with heterogeneous speed links", BOOKTITLE="Data Communications and their Performance: the Sixth IFIP WG6.3 Conference on Performance", ISBN="0-412-73250-5", ADDRESS="London, Great Britain", PAGES="18-32", YEAR=1995, REFERENCES=9, KEYWORDS="Atm; batch arrival; discrete time analysis; finite buffer; high speed; mmbp; multiplexer; performance evaluation; qos", ABSTRACT="Our aim in this paper is to provide insight on a session's performance in the presence of different speed links at an ATM multiplexr. We describe a queueing model for such scenarios considering a finite capacity buffer and bursty traffic with correlated arrivals. We use Markov Modulated Bernoulli Process (MMBP) as the traffic model for the session of interest and model the cross traffic as an MMBP with batch arrivals. We present exact analysis", } @ARTICLE{Balz95:Economic, AUTHOR="S. Balzaretti and M. de Bortoli and U. Ferrero and M. Ravera", TITLE="Economic evaluations for the access network: results of the {RACE} {R2087/TITAN} project", JOURNAL="CSELT Technical reports", ADDRESS="Italy", VOLUME=23, NUMBER=5, PAGES="625-633", YEAR=1995, REFERENCES=4, KEYWORDS="Comparison; cost; cost function; economic evaluation; wdm; access network", ABSTRACT="The paper describes the methodology and the tool developed in the RACE R2087/TITAN project for the techno-economic evaluation and comparison of different architectures to implement an optical access network. A summary of the results is also provided.", } @ARTICLE{Bane95:Algorithms, AUTHOR="S. Banerjee and B. Mukherjee", TITLE="Algorithms for Optimized Node Arrangements in ShuffleNet Based Multihop Lightwave Networks", JOURNAL=jhsn, VOLUME=4, NUMBER=4, PAGES="361-383", YEAR=1995, REFERENCES=24, KEYWORDS="Algorithm; asymmetric load; heuristics; multihop; reconfiguration; shufflenet; wdm", ABSTRACT="The goal of this study is to exploit the capabilities of lightwave technology in order to construct optimized regular multihop networks when the traffic flow among the network nodes is asymmetric. The specific problem addressed here is as follows: Given that the network nodes must be connected in a regular interconnection pattern and that the node positions in the regular network can be adjusted by properly tuning their optical transceivers, wh", } @ARTICLE{Barb95:DS, AUTHOR="S. Barberis and E. Berruto and L. Banzano and E. Gaiani and others", TITLE="Performance evaluation of a {DS-CDMA} system in indoor environment with macrodiversity", JOURNAL="CSELT Technical reports", ADDRESS="Italy", VOLUME=23, NUMBER=4, PAGES="507-520", YEAR=1995, REFERENCES=3, KEYWORDS="Cdma; mobile radio; performance evaluation", ABSTRACT="In this paper the performance of a DS-CDMA system (designed within the CODIT project) is evaluated focusing on an indoor environment. This analysis gives an indication about the behaviour of the macrodiversity and soft handoff in a typical business environment. This work has been carried out in the RACE project R2020 CODIT in the framework of the Community Research Programme with a financial contribution by the Commission.", } @ARTICLE{Barr95:Network, AUTHOR="C. F. Barry and Sanjay K. Agrawal and N. L. Taranenko and others", TITLE="Network Interface Design for Multi-Gbit/s {WDM} Optical Networks", JOURNAL=jhsn, VOLUME=4, NUMBER=1, PAGES="61-76", YEAR=1995, REFERENCES=8, KEYWORDS="Atm; network; packet switching; real time", ABSTRACT="The design of a distributed, small, fast packet switched network interface that provides electronic buffering and switching for the data channel in reconfigurable multi-Gbps WDM optical networks is reported. The high-speed interface has been constructed and tested in such a WDM network, STARNET, which is based on a physical passive star topology and is intended for backbone applications in Campus Networks.", } @INPROCEEDINGS{Barr95:Model, AUTHOR="R. A. Barry and Doug Marquis", TITLE="Evaluation of a Model of Blocking Probability in All-Optical Mesh Networks without Wavelength Changers", BOOKTITLE="SPIE All-Optical Communication Systems: Architecture, Control, and Network Issues", ISBN="0-8194-1978-8", ADDRESS="Bellingham, USA", PAGES="154-167", YEAR=1995, REFERENCES=13, KEYWORDS="Blocking; modeling; performance evaluation", ABSTRACT="We describe the design and performance of a wide-area all-optical network. An improved model of the benefits of wavelength changers in all-optical mesh networks is presented and comparisons are made to simulations. The model is shown to be accurate for a moderate number of wavelengths and a small blocking probability for a variety of networks.", } @INPROCEEDINGS{Bart95:Distributed, AUTHOR="R. Bartos and R. Kannan and K. Y. Lee and Harry F. Jordan", TITLE="Distributed Optical {ATM} Switching Architectures", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="1751-1755", YEAR=1995, REFERENCES=7, KEYWORDS="Atm; optical switching; wdm", ABSTRACT="In this paper we propose a new class of distributed optical ATM switching architectures for WANs. The network consists of geographically distributed group routing nodes (GRNs) connected by WDM links in different topologies. Individual users, such as LANs or high performance computers, are attached to each GRN. A GRN consists of routing modules (RMs), each of which contains a small number of fixed wavelength transmitters and passive wavelength d", } @INPROCEEDINGS{Base95:Intelligent, AUTHOR="R. J. Baseil and B. Hoang", TITLE="Intelligent Network Qualification", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="211-215", YEAR=1995, REFERENCES=2, KEYWORDS="In; intelligent network", ABSTRACT="Intelligent Networks (IN) throughout the world offer the opportunity for telecommunications administrations as well as third-party service companies to provide application development and control of services. These INs are generally comprised of systems from many different suppliers, an the services offered may need to function in cooperation with other carriers. In an environment with such distributed and shared responsibilities, it is importa", } @INPROCEEDINGS{Beck95:Multimedia, AUTHOR="D. Becker and A. Grebe", TITLE="Multimedia Traffic in buffer-Insertion Gbits/s-LANs", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="165-169", YEAR=1995, REFERENCES=14, KEYWORDS="Man; multimedia; traffic model", ABSTRACT="In this paper we present a dynamic priority access schme, which supports Multimedia traffic in shared media Gbit/s-LANs. We assume a slotted buffer-insertion ring ATM LAN, which topology is based on a dual counter-rotating ring network with shortes path routing. The dynamic priority access mechanism for delay sensitive data is described. To achieve fairness for simultaneous asynchonous data traffic in the presence of high priority delay sensit", } @ARTICLE{Bend95:Photonic, AUTHOR="G. Bendelli and M. Burzio and M. Calzavara and P. Cinato and others", TITLE="Photonic {ATM} switch based on a multiwavelength fiber loop buffer", JOURNAL="CSELT Technical reports", ADDRESS="Italy", VOLUME=23, NUMBER=3, PAGES="331-335", YEAR=1995, REFERENCES=4, KEYWORDS="Atm; optical switching; wdm", ABSTRACT="A photonic ATM switch based on a multiwavelength fiber loop buffer, including fast tunable wavelength converters and filters, and an electronic control is described. For the first time, simultaneous cell routing and contention resolution are demonstrated by this approach.", } @INPROCEEDINGS{Bert95:Experimental, AUTHOR="L. Berthelon and C. Coeurjolly and P. A. Perrier and others", TITLE="Experimental demonstration of a cellular gigabit photonic transport network with wavelength routing", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="387-391", YEAR=1995, REFERENCES=5, KEYWORDS="Cellular system; field trial; wan; wdm", ABSTRACT="In this paper, a demonstrator of such a photonic transport network, assembled with commercially available components, is reported on. In addition to increased capacity, the proposed layer would provide geographically distributed switching with enhanced connectivity, route protection, multi bit-rate transmission capability, and allow easy upgradability and network scalability.", } @ARTICLE{Bert95:Distributional, AUTHOR="D. Bertsimas and D. Nakazato", TITLE="The Distributional Little's Law and its Applications", JOURNAL=or, VOLUME=43, NUMBER=2, PAGES="298-310", YEAR=1995, REFERENCES=31, KEYWORDS="Distribution; fifo; little's formula; proof; queue length; queueing system; queueing theory", ABSTRACT="This paper discusses the distributional Little's law and examines its applications in a variety of queueing systems. The distributional law relates the steady-state distributions of the number in the system (or in the queue) and the time spent in the system (or in the queue) in a queueing system under FIFO. We provide a new proof of the distributional law and in the process we generalize a well known theorem of Burke on the equality of pre-arri", } @ARTICLE{Boll95:Call, AUTHOR="R. Bolla and F. Davoli", TITLE="Call admission control and bandwidth allocation in a multiservice {DQDB} network", JOURNAL=comcom, PUBLISHER="Butterworth-Heinemann", VOLUME=18, NUMBER=8, PAGES="537-544", YEAR=1995, REFERENCES=21, KEYWORDS="Bandwidth allocation; connection admission control; dqdb; fairness; lan; man; network", ABSTRACT="We consider a DQDB network carrying both isochronous and asynchonous traffic flows. Different classes of isochronous traffic are distinguished, according to thir speed and originating user site, and their dynamics is modelled by contiuous time Markov chains; the asynchronous packet traffic is represented by a single class.", } @ARTICLE{Boll95:Distributed, AUTHOR="R. Bolla and F. Davoli and A. D. Febbraro", TITLE="Distributed Coordinated Deflection Routing Algorithms for High Speed Networks", JOURNAL=jhsn, VOLUME=4, NUMBER=3, PAGES="287-297", YEAR=1995, REFERENCES=9, KEYWORDS="Distributed algorithm; dynamic routing; routing; routing algorithm", } @ARTICLE{Bore95:Limits, AUTHOR="Michael S. Borella and B. Mukherjee", TITLE="Limits of Multicasting in a Packet-Switched {WDM} Single-Hop Local Lightwave Network", JOURNAL=jhsn, VOLUME=4, NUMBER=2, PAGES="155-167", YEAR=1995, REFERENCES=28, KEYWORDS="Blocking; multicast; packet switching; wdm", ABSTRACT="In this study, we show how multicasting in a broadcast and select environment can dramatically increase the throughput of the network. Using a Markov model and a simulation, we show that multicasting significantly improves the limiting performance of both small and large networks, especially when each node is equipped with multiple receivers.", } @ARTICLE{Bors95:Globally, AUTHOR="Sem. C. Borst", TITLE="A Globally Gated Polling System with a Dormant Server", JOURNAL="Probability in the Engineering and Informational Sciences", VOLUME=9, NUMBER=2, PAGES="239-254", YEAR=1995, REFERENCES=22, KEYWORDS="Analytical model; cycle time; distribution; gated service; performance evaluation; polling; polling system;vacation system; waiting time", ABSTRACT="We study a globally gated polling system with a dormant server, which makes a halt at its home base when there are no customers present in the system. We derive an explicit expression for the cycle time distribution as well as for the waiting-time distribution at each of the queues. As a justification of the dormant server policy, we show the waiting time at each of the queues to be smaller (in the increasing-convex-ordering sense) thatn in the", } @ARTICLE{Bowe95:Ten, AUTHOR="J. P. Bowen and M. G. Hinchey", TITLE="Ten Commandments of Formal Methods", JOURNAL=ieeecomp, VOLUME=28, NUMBER=4, PAGES="56-63", YEAR=1995, REFERENCES=11, KEYWORDS="Formal technique; specification; specification language", ABSTRACT="Formal methods permit more precise specifications and earlier error detection. Software developers who want to benefit from formal methods would be wise to heed these ten guidelines", } @INPROCEEDINGS{Brac95:Obstacles, AUTHOR="C. A. Bracket", TITLE="Obstacles on the Way to Transparent Multiwavelength Networks", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="705-708", YEAR=1995, KEYWORDS="Network evolution; tutorial; wdm", } @ARTICLE{Bram95:Location, AUTHOR="J. Bramel and D. Simchi-Levi", TITLE="A Location Based Heuristic for General Routing Problems", JOURNAL=or, VOLUME=43, NUMBER=4, PAGES="649-660", YEAR=1995, REFERENCES=27, KEYWORDS="Algorithm; heuristics; np problem; routing; routing algorithm", ABSTRACT="The paper presents a general framework for modeling routing problems based on formulating them as a traditional location problem called the capacitated concentrator location problem. We apply this framework to two classical routing problems: the capacitated vehicle routing problem and the inventory routing problem. In the former case, the heuristic is proven to be asymptotically optimal for any distribution of customer demands and locations. Co", } @ARTICLE{Bran95:Single, AUTHOR="Maite Brandt-Pearce and B. Aazhang", TITLE="Performance Analysis of Single-user and Multiuser Detectors for Optical Code Division Multiple Access Communication Systems", JOURNAL=ieeecom, VOLUME=43, NUMBER=2, PAGES="435-444", YEAR=1995, REFERENCES=21, KEYWORDS="Multiple access channel", ABSTRACT="This study examines the performance of an optimum single-user detector and two multiuser detectors for OCDMA in the presence of additive light intensity noise and Poisson detection.", } @PROCEEDINGS{Brau95:Proceedings, AUTHOR="W. Brauer and David Gries and J. Stoer", TITLE="{AISB} Workshop: Evolutionary Computing; Selected Papers", SERIES="Lecture Notes in Computer Science", ISBN="3-540-60469-3", PUBLISHER="Springer", ADDRESS="Sheffield, U.K.", YEAR=1995, KEYWORDS="Programming", } @INPROCEEDINGS{Bret95:Intelligent, AUTHOR="Y. Bretecher and Bernard Vilain", TITLE="The Intelligent Network in a Broadband Context", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="57-61", YEAR=1995, REFERENCES=5, KEYWORDS="In; intelligent network; sdl", ABSTRACT="The Intelligent Network concept has been developed as a new network architecture with the aim of facilitating service provision. Thus, initial studies of IN have concentrated on PSTN/ISDN requirements (the so called Capability Set 1). Extensions to CS1 are being proposed by standards setting organizations. B-ISDN services are candidates likely to be retained in the definition of a future capability set (i.e. CS3). B-ISDN signalling relies on a", } @ARTICLE{Broe95:Low, AUTHOR="L. A. Broeke and L. P. Jong and J. Davidse and A. H. M. Roermund", TITLE="A Low-Cost Multichannel Optical Transmission System for Video Signals", JOURNAL=ieeecom, VOLUME=43, NUMBER=9, PAGES="2493-2501", YEAR=1995, REFERENCES=13, KEYWORDS="Tdm; technology; transmission system", ABSTRACT="A novel low-cost multichannel optical transmission system for video signals is described. The system uses time-division multiplex pulse-position modulation. The transmitter and receiver are realized in a standard bipolar process while an external low-cost laser and PIN photodiode are used.", } @INPROCEEDINGS{Brus95:Experimental, AUTHOR="Gary Brush and M. T. Denoncourt and N. D. Jasinski", TITLE="Experimental Validation of New Services: {PCS} Network Simulation and New Services Exploration Tool", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="309-313", YEAR=1995, REFERENCES=8, KEYWORDS="In; intelligent network", ABSTRACT="Planning and developing a new switch network service is an extremely expensive proposition, particularly with the ever growing number of interfaces that have to be met to allow interoperability among a myriad of systems on which the service must reside. Some new switch services can run into many millions of dollars in the planning and development life cycle only to result in a service that did not meet market needs or requires extensive redesig", } @INPROCEEDINGS{Buns95:Concepts, AUTHOR="S. Bunse and L. Dembeck and G. Eilenberger and W. Idler and others", TITLE="Concepts and Components for Optical Routing Nodes in Transparent and Packet Based High Speed Networks", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="429-432", YEAR=1995, REFERENCES=4, KEYWORDS="Optical switching; routing; switching component", } @BOOK{Burn95:Concurrency, AUTHOR="A. Burns and A. J. Wellings", TITLE="Concurrency in Ada", ISBN="0-521-41471-7", PUBLISHER="Cambridge University Press", ADDRESS="Cambridge, Great Britain", YEAR=1995, REFERENCES=24, KEYWORDS="Ada; concurrency; programming; programming language", ABSTRACT="A major feature of the Ada programming language is the facilities it provides for concurrent programming. Alan Burns and Andy Wellings provide here a thorough and self-contained account of concurrent programming in Ada, and so show users, even beginners, how to harness the full power of the whole language.", } @INPROCEEDINGS{Cahn95:Deployment, AUTHOR="Robert S. Cahn", TITLE="The Deployment of Private {WDM} Networks", BOOKTITLE="SPIE All-Optical Communication Systems: Architecture, Control, and Network Issues", ISBN="0-8194-1978-8", ADDRESS="Bellingham, USA", PAGES="254-263", YEAR=1995, REFERENCES=4, KEYWORDS="Atm; cost; network design; private network; wdm", ABSTRACT="In this paper, we investigate of deploying WDM with ATM networks. The WDM networks provide the physical layer, the ATM networks form a logical layer, using light paths from the WDM network. Ther are 4 different benefits to be derived from such an arrangement, including the possibility of reduced network cost. An algorithm for the design of logical networks is developed. This algorithm has been incorporated in the Intrepid network design tool.", } @INPROCEEDINGS{Camp95:Security, AUTHOR="M. Campana and P. Chauvaud and Henry Gilbert", TITLE="Security Architecture for the {UPT} Service", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="226-230", YEAR=1995, REFERENCES=2, KEYWORDS="In; intelligent network; security", ABSTRACT="In this paper, we analyse the security implications of introducing intelligent network features such as personal mobility in the telecommunication network. We describe various aspects of the security architecture developed by ETSI for protecting the UPT service against frauds, with particular emphasis on dynamic authentication methods. We discuss implementation issues (e.g. the realisation of the UPT access device), and the potential extension", } @INPROCEEDINGS{Camp95:Wavelenght, AUTHOR="R. Campbell and G. Sherlock and Douglas Williams and R. Payne and others", TITLE="A Wavelenght Stable Uncooled Laser for Access Networks", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="545-548", YEAR=1995, REFERENCES=6, KEYWORDS="Access network", ABSTRACT="The development of a fiber grating laser as a low cost source in an AON is described, by use of angled facet semiconductor laser chirps.", } @ARTICLE{Cape95:Multiple, AUTHOR="J. Capetanakis", TITLE="Multiple Resource Multiple Access Algorithms", JOURNAL=ieeecom, VOLUME=43, NUMBER=2, PAGES="1273-1276", YEAR=1995, REFERENCES=7, KEYWORDS="Mobile radio; multiple access", ABSTRACT="Two distributed multiple resource/multiple access algorithms, the ROP and the DROP, that are applicable to mobile networks connected by point-to-.point radio or satellite links are presented and the maximum throughput is determined. These algorithms are dynamic in that they adapt to variable network topology and connectivity. It is also shown that, for symmetric networks, no ohter algorithm perfoms better than the DROP.", } @INPROCEEDINGS{Cava95:Integrated, AUTHOR="A. R. Cavalli and H. Fouchal and S.-B. Kim and P. Maigron", TITLE="An Integrated Tool for {LOTOS} Development", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="539-544", YEAR=1995, REFERENCES=6, KEYWORDS="Computer tool; formal technique; lotos", ABSTRACT="This paper presents a toolset which covers several steps of system design using the LOTOS language, and which has been integrated into the Concerto Software Factory. The main components are structural editors for both LOTS language and Hennessy-Milner modal logic, a symbolic action generator, a formal checker which is able to formally verify whether properties expressed in modal logic are true on specifications, and a conformance test sequence", } @INPROCEEDINGS{Chan95:EXPERIMENTAL, AUTHOR="C. K. Chan and L. Chen and K.-M. Cheung", TITLE="Experimental demonstration of a high-speed all-optical tunable-channel multi-access {(TCMA)} network", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="1761-1765", YEAR=1995, REFERENCES=19, KEYWORDS="Multiple access; technology; wdm", ABSTRACT="This paper presents the experimental demonstration of an ultrahigh-speed all-optical tunable-channel multiaccess (TCMA) network based on novel ideas and technologies that could surmount the difficulties in ultrahigh-speed optical TDM networking.", } @ARTICLE{Chan95:Application, AUTHOR="Kenneth Chan and Haichen Cheng and H.-I. Liu and K. A. Ahmed", TITLE="Application of Optical Solitons in High-Speed and Wavelength-Division-Multiplexed Lightwave Communication Systems", JOURNAL=jhsn, VOLUME=4, NUMBER=1, PAGES="41-59", YEAR=1995, REFERENCES=104, KEYWORDS="Fiber optics; wdm", } @INPROCEEDINGS{Chen95:Optical, AUTHOR="Chi-Ming Chen and S. Banerjee", TITLE="Optical Switch Configuration and Lightpath Assignment in Wavelength Routing Multihop Lightwave Networks", BOOKTITLE=infocom, ISBN="0-8186-6990-X", ADDRESS="Los Alamitos, California", PAGES="1300-1307", YEAR=1995, REFERENCES=24, KEYWORDS="Graph marking algorithm; optical switching; routing algorithm; wdm", ABSTRACT="A wide-area transparent optical network can be constructed by using wavelength routers and switches, each dealing with only a small number of wavelengths. In this work we consider the problem of configuring the wavelength routers based on the observed traffic. Various policies for wavelength routing, and the corresponding assignment of wavelengths along the routes, have been studied before which are based on minimizing congestion, average hop-d", } @BOOK{Chen95:ATM, AUTHOR="Tai-Ann Chen and S. Liu", TITLE="{ATM} Switching Systems", ISBN="0-89006-682-5", PUBLISHER="The Artech House Telecommunications Library, Artech House", ADDRESS="Boston, London", YEAR=1995, REFERENCES=31, KEYWORDS="Atm; b-isdn; connection admission control; network management; overview; sdh; switching; switching system; traffic control", ABSTRACT="This book is intended to be self-contained for readers with different backgrounds in communications networks. It is organized into two parts. The first part, consisting of Chapters 1 through 4, provides the relevant technical background information on ATM. These chapters lay the necessary foundation for the construction of the switch model in the second part, which consists of Chapters 5 through 10. These chapters develop a top-down view of the", } @INPROCEEDINGS{Chia95:Hierarchical, AUTHOR="F. Chiaraluce and A. Borella and F. Meschini", TITLE="Analysis of Hierarchical Optical Networks", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="56-59", YEAR=1995, REFERENCES=6, KEYWORDS="Hierarchical network; throughput analysis", ABSTRACT="A simple theoretical approach is presented for the throughput performance evaluation of a WDM optical network hierarchically organized in three layers. The lower level consists of single-hop subnetworks, whilst the intermediate and upper ones employ a multi-hop strategy.", } @INPROCEEDINGS{Chia95:Sizeability, AUTHOR="D. Chiaroni and C. Chauzat and D. D. Bouard and M. Sotom", TITLE="Sizeability Analysis of a High-Speed Photonic Packet Switching Architecture", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="793-796", YEAR=1995, REFERENCES=5, KEYWORDS="Optical switching; packet switching", } @INPROCEEDINGS{Chin95:Test, AUTHOR="B.-M. Chin and A. R. Cavalli and T. Macavei", TITLE="Test generation from {SDL} and Input/Output Finite State Machines", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="447-452", YEAR=1995, REFERENCES=12, KEYWORDS="Fsm; sdl; test tool", ABSTRACT="In this paper a method is presented to generate test sequences from SDL specifications, in order to verify the conformity of the implementation with the specification. From SDL specifications, a global I/O FSM (Input/Output Finite State Machine) is obtained. This I/O FSM will be the starting point for test sequences generation. To resolve nondeterminism in the I/O FSM, some heuristics will be proposed to the user. For the identification of stat", } @INPROCEEDINGS{Chip95:Hybrid, AUTHOR="Renu Chipalkatti and Z. Zhang", TITLE="A Hybrid Dynamic Reservation Protocol for an Optical Star Network", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="998-1006", YEAR=1995, REFERENCES=20, KEYWORDS="Access protocol; media access control; star network; wdm", ABSTRACT="We consider a passive star coupler network, employing WDM, where stations are equipped with fixed transmitters and tunable receivers. In such networks, the efficiency of the protocol for coordinating the data transmission between the transmitter and receives is of critical importance. In this paper, we address this issue and propose a novel Hybrid Dynamic Reservation Protocol (HDRP) which combines the attractive features of the Aloha and Reserv", } @ARTICLE{Chla95:Contention, AUTHOR="I. Chlamtac and A. Fumagalli and Leonid Kazovsky and P. T. Poggiolini", TITLE="A Contention/Collision Free {WDM} Ring Network for Multi Gigabit Packet Switched Communication", JOURNAL=jhsn, VOLUME=4, NUMBER=2, PAGES="201-219", YEAR=1995, REFERENCES=17, KEYWORDS="Multichannel; packet switching; ring; wdm", ABSTRACT="In this paper we present an approach which, in WDM packet switched networks with ring topology, allows for contention and collison free transmission, simplifying the access protocols and the receiver hardware. In addition the proposed solution does not require packet deflection/retransmission, thus resolving the network problem of unpredictable packet latency. A side effect of this solution is thus the possibility to exactly evaluate the power", } @INPROCEEDINGS{Cho95:MCDQDB, AUTHOR="W. Cho and C. Shim and M.-L. Song and John Lee and Shiang-feng Lee", TITLE="{MCDQDB} (Multi-Channel {DQDB)} using {WDM} (Wavelength Division Multiplexing)", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="2205-2209", YEAR=1995, REFERENCES=11, KEYWORDS="Dqdb; man; network architecture; network protocol; performance evaluation; wdm", ABSTRACT="We introduce a new protocol, MCDQDB, for multi-channel dual-bus MAN which is the extension of a single channel DQDB MAN. MCDQDB can be easily implemented with the state-of-the-art WDM technology and conformed to the IEEE 802.6 standard, DQDB, with the improvement of fairness and access delay.", } @INPROCEEDINGS{Choi95:Call, AUTHOR="G. B. Choi and Ching-Chih Han and C.-H. Yim", TITLE="Call Control of Intelligent Peripheral based on Neural Networks", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="288-292", YEAR=1995, REFERENCES=6, KEYWORDS="In; intelligent network; neural network; queueing system", ABSTRACT="This paper describes a call control scheme using neural network for the Intelligent Peripheral (IP) system which provides a flexible, generic interface for end-user interactions in intelligent networks. The call control scheme of IP is inherently different from that of ordinary communications systems because offered resources are not links or channels but speech recognizer, voice identifiere, text-to-voice translator, etc. In the first part, we", } @INPROCEEDINGS{Choi95:Petri, AUTHOR="J.-K. Choi and H. Kim and Wenke Lee and Y. R. Kwon", TITLE="A Petri-Nets Based Approach for Detecting Feature Interactions in Telecommunications Services", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="596-601", YEAR=1995, REFERENCES=10, KEYWORDS="In; intelligent network; petri net", ABSTRACT="The problem of feature interactions is a major obstacle to the rapid deployment of new telecommunications services. In this paper, we propose a formal approach to detection of the feature interactions by describing the Intelligent Network service feature and the basic call process as Petri-nets models. To model feature specifications and automatically analyze interactions between them, the supporting environment which a service designer can use", } @ARTICLE{Choi95:Photonic, AUTHOR="Young-Soo Choi and H. Tode and H. Okada and H. Ikeda", TITLE="A Photonic {ATM} Switch Architecture for {WDM} Optical Networks", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="1333-1335", YEAR=1995, REFERENCES=7, KEYWORDS="Atm; optical switching; wdm", ABSTRACT="A large capacity photonic ATM switch architecture using WDM technology is proposed in this paper. The proposed switch is suitable for WDM optical ATM networks, that is, an input and an output of the switch are wavelength division multiplexed. The basic switch module of the proposed switch has a simple architecture, and reduces the amount of a buffer hardware by introducing the WDM concept.", } @INPROCEEDINGS{Chou95:Statistical, AUTHOR="Chien-Chun Chou and Kang G. Shin", TITLE="Statistical Real-Time Channels on Multiaccess Networks", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="29-34", YEAR=1995, REFERENCES=8, KEYWORDS="Media access control; multimedia; statistical multiplexing", ABSTRACT="Real-time communication with performance guarantees is expected to become an important and necessary feature of future computer networks. In this paper, we present a scheme which can provide real-time communication services with both absolute and statistical performance guarantees on multiaccess networks for given input traffic characteristics and performance requirements.", } @ARTICLE{Chow95:Fast, AUTHOR="Ching-Hua Chow and J. D. Bicknell and S. McCaughey and S. Syed", TITLE="Performance Analysis of Fast Distributed Link Restoration Algorithms", JOURNAL="International Journal of Communication Systems", PUBLISHER="John Wiley", ADDRESS="Great Britain", VOLUME=8, NUMBER=6, PAGES="325-345", YEAR=1995, REFERENCES=33, KEYWORDS="Distributed algorithm; error recovery; fault tolerance; fiber optics; performance metrics; protection; routing algorithm; self healing network; shortest path", ABSTRACT="Four distributed link restoration algorithms are analysed in detail using a set of important performance metrics and functional characteristics. The functional characteristics are used to explain how these algorithms function and provide insight into their performance. The analysis and simulation results indicate that the two prong link restoration algorithm, which is based on issuing aggregate restoration requests from both ends of the disrupt", } @ARTICLE{Cido95:New, AUTHOR="I. Cidon and I. Gopal and S. Kutten", TITLE="New Models and Algorithms for Future Networks", JOURNAL=ieeeit, VOLUME=41, NUMBER=3, PAGES="769-780", YEAR=1995, REFERENCES=38, KEYWORDS="Atm; communication protocol; complexity; high speed; network management; performance measure; routing; switching; topology", ABSTRACT="In future networks, transmisison and switching capacity will dominate processing capacity. In this paper we investivate the way in which distributed algorithms should be changed in order to operate efficiently in this new environment. We introduce a class of new models for distributed algorithms which make explicit the difference between switching and processing. Based on these new models we define new message and time complexity measures which", } @MANUAL{Clau95:ATM, AUTHOR="J. Claus and G. Siegmund", TITLE="Das {ATM-Handbuch:} Grundlagen, Planung, Einsatz", ISBN="3-7785-2384-8", PUBLISHER="H thig", ADDRESS="Heidelberg, Germany", YEAR=1995, LANGUAGE="German", KEYWORDS="Atm; b-isdn; network management; overview; sdh; signalling", ABSTRACT="Das ATM-Handbuch beschreibt die Grundlagen des ATM-Verfahrens, bietet einen roten Faden durch die Standardisierungs-Dokumente, informiert über deren Weiterentwicklung und ermöglicht als Loseblattwerk einen stets aktuellen Überblick für Entwickler, Anbieter und Netzbetreiber.", } @INPROCEEDINGS{Cles95:Power, AUTHOR="B. Clesca and C. Coeurjolly and S. Gauchard and L. Berthelon and others", TITLE="Power Limitation in 4x2.5 Gbit/s {WDM} Transmission Systems", BOOKTITLE=efoc, ADDRESS="Netherlands", PAGES="37-41", YEAR=1995, REFERENCES=9, KEYWORDS="Wdm", ABSTRACT="4x2.5-Gbit/s WDM channel are considered for performing 10-Gbit/s data transmissions within optical terrestrial backbones. Because of multichannel propagation new nonlinear effects appear: - cross-phase modulation - four-wave mixing", } @ARTICLE{Coch95:Aspects, AUTHOR="P. Cochrane and David JT Heatley", TITLE="Aspects of Optical Transparency", JOURNAL="British Telecommunications Engineering", ADDRESS="Great Britain", VOLUME=14, PAGES="33-37", YEAR=1995, REFERENCES=4, KEYWORDS="Network; transparency", ABSTRACT="Prospects of transparent optical networks: no hierarchies required / analogue and digital transmission; in future: analogue switching and analogue transmission / reliability improvement by doubling only the active elements + additionally: diverse routing / impact of single node failures on customers increases rapidly", } @INPROCEEDINGS{Colo95:Mobility, AUTHOR="G. Colombo", TITLE="Mobility Models for Mobile System Design and Dimensioning", BOOKTITLE="9th ITC Specialists Seminar: Teletraffic Modelling and Measurement in Broadband and Mob", ADDRESS="Leidschendam, Netherlands", PAGES="133-146", YEAR=1995, KEYWORDS="Mobile radio; performance evaluation; system design", ABSTRACT="... The paper then proceeds with the analysis of a possible model for the introduced two-fold random behaviour. Mobility is represented as a stochastic process describing both voice/data activity of the traffic source and its dynamic roaming within the cellular radio coverage and the fixed entities of the mobile network. ...", } @INPROCEEDINGS{Cott95:Ultrafast, AUTHOR="D. Cotter and M. Shabeer and K. L. Smith and D. Rogers", TITLE="Ultrafast Self-Routing Networks", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="210-213", YEAR=1995, REFERENCES=10, KEYWORDS="Optical switching; packet switching; self routing; timing problem", ABSTRACT="Recent advances in the development of ultrafast self-routing networks are described. The severe problem of network synchronisation and clock distribution is solved using a hybrid scheme, in which cell-level timing is distributed globally, whilst bit-level picosecond timing is carried by each cell individually. A new keyword coding scheme is described that allows multi-Gbit/s cell header-address recognition using the minimum number of ultrafast", } @ARTICLE{Cyre95:Generating, AUTHOR="W. R. Cyre and Jean Armstrong and A. J. Honcharik", TITLE="Generating Simulation Models from Natural Language Specifications", JOURNAL="Simulation", VOLUME=65, NUMBER=4, PAGES="239-251", YEAR=1995, REFERENCES=18, KEYWORDS="Hierarchical modeling; modeling", ABSTRACT="A prototype system for the automatic generation of VHDL simulation models from requirements expressed in natural language is described. Requirements are parsed and analyzed semantically to produce knowledge representations called conceptual graphs. ...", } @ARTICLE{Dale95:Channel, AUTHOR="M. R. Dale and R. M. Gagliardi", TITLE="Channel Coding for Asynchronous Fiberoptic {CDMA} Communications", JOURNAL=ieeecom, VOLUME=43, NUMBER=9, PAGES="2485-2492", YEAR=1995, REFERENCES=20, KEYWORDS="CDMA; error-correcting code; fiber optics", } @PROCEEDINGS{Demb95:Proceedings, TITLE="15th {IFIP} {WG6.1} International Symposium on Protocol Specification, Testing and Verification", ISBN="0-412-71620-8", PUBLISHER="IFIP (The International Federation for Information Processing), Chapman \& Hall", ADDRESS="London, Great Britain", YEAR=1995, KEYWORDS="Protocol; protocol specification; protocol testing; protocol verification", ABSTRACT="Protocol engineering is becoming increasingly complex and more dependent on real-time constraints, as it faces the challenge of high-speed technologies and new applications. This book describes various approaches, design methods and tools which have developed to meet these changes. Issues discussed include: real-time extensions to existing FDTs and FDT-based tools; new results in temporal analysis and verification of large systems", } @BOOK{DePr95:Asynchronous, AUTHOR="M. de Prycker", TITLE="Asynchronous Transfer Mode: Solution for Broadband {ISDN;} 3rd Ed.", ISBN="0-13-342171-6", PUBLISHER="Prentice Hall", ADDRESS="London, Great Britain", YEAR=1995, REFERENCES=50, KEYWORDS="Atm; b-isdn; congestion control; lan; network; overview; standard; switching; traffic control; video service", } @ARTICLE{DeSi95:Wireless, AUTHOR="A. DeSimone and S. Nanda", TITLE="Wireless data: Systems, standards, services", JOURNAL=wln, ISBN="1022-0038", PUBLISHER="Baltzer Science Publishers", VOLUME=1, NUMBER=3, PAGES="241-253", YEAR=1995, REFERENCES=34, KEYWORDS="Comparison; overview; standard; tcp/ip", ABSTRACT="Based upon our experience and work with standards and systems we attempt to put wireless data into perspective. We compare and contrast major services and products and identify the choices that were made and why.", } @INPROCEEDINGS{Digh95:Link, AUTHOR="R. S. Dighe and Q. Ren and B. Sengupta", TITLE="A Link Based Alternative Routing Scheme for Network Restoration under Failure", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="2118-2123", YEAR=1995, REFERENCES=10, KEYWORDS="Alternate routing; capacity assignment; heuristics; routing; routing algorithm", ABSTRACT="In this paper we present an alternative routing scheme which ensures that the network restores itself under any single link failure. In addition, our scheme has the advantage that restoration of the network occurs immediately on discovery of failure. An efficient heuristic algorithm, based on maximal-flow algorithm, is first used to partition the network into two parts (one for regular traffic, one for re-routed traffic). Then, we show how to u", } @ARTICLE{Dobo95:MAC, AUTHOR="W. Dobosiewicz and P. Gburzynski", TITLE="On a {MAC} protocol Based on Distributed Cycles", JOURNAL=jhsn, VOLUME=4, NUMBER=3, PAGES="275-286", YEAR=1995, KEYWORDS="Man; media access control; ring network", ABSTRACT="This papere introduces a novel transmission scheduling schme applicable to high-speed ring netwokrs. The essence of the proposed schme is a special marker, called the terminator, circulating in the ring. The maximum normalised throughput of our protocol does not degrade with the increasing propagation length of the ring and the stations endure small access delays under light load. our protocol also offers a full-scale isochronous service withou", } @ARTICLE{Duel95:Family, AUTHOR="A. Duell-Hallen", TITLE="A Family of Multiuser Decision-Feedback Detectors for Asynchronous Code-Division Multiple-Access Channels", JOURNAL=ieeecom, VOLUME=43, NUMBER=2, PAGES="421-434", YEAR=1995, REFERENCES=22, KEYWORDS="Multiple access channel", ABSTRACT="We introduce decision-feedback and partial feedback detectors for asynchronous CDMA channels. Twostage detectors with decision-feedback in the second stage are also studied. The derivation of the decision-feedback detector is based on spectral factorization which leads to a white-noise channel model. We also describe two implementations of the maximum-likelihood detector for this model.", } @INPROCEEDINGS{Dumo95:GUIDELINES, AUTHOR="Philip Dumortier and F. Masetti and M. Sotom", TITLE="{GUIDELINES} {FOR} {SCALABLE} {OPTICAL} {TELECOMMUNICATION} {NETWORKS}", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="1012-1017", YEAR=1995, REFERENCES=17, KEYWORDS="Network design; network evolution; optical switching; reliability; tdm; wan; wdm", ABSTRACT="Not all WDM-based architectures can be simply extrapolated to a worldwide scale. Some seemingly scalable elements of these architectures saturate at some point along network expansion. This paper analyses scalability issues related to the core network.", } @ARTICLE{Dupu95:Au, AUTHOR="Fabrice Dupuy and Roberto Kung", TITLE="Au-delà du réseau intelligent: le réseau d'information {TINA}", JOURNAL="L'écho des Recherches", ADDRESS="Issy-les-Moulineaux, France", VOLUME=162, PAGES="49-60", YEAR=1995, LANGUAGE="French", REFERENCES=17, KEYWORDS="Architecture; distributed system; information network; intelligent network; overview", ABSTRACT="... Cet article décrit les charactéristiques de l´architecture TINA à l'aide d'un exemple de service et brosse un tableau des avantages que permettraient d'apporter certains de ses concepts.", } @ARTICLE{Econ95:Learning, AUTHOR="Anastasios Economides", TITLE="Learning Automata Routeing in Connection-Oriented Networks", JOURNAL="International Journal of Communication Systems", PUBLISHER="John Wiley", ADDRESS="Great Britain", VOLUME=8, NUMBER=4, PAGES="225-237", YEAR=1995, REFERENCES=30, KEYWORDS="Routing; routing algorithm", ABSTRACT="Learning automata are used at the source nodes of a connection-oriented network to dynamically route newly arriving virtual calls to their destination. First, two new learning automata are introduced. Then tese two automata, as well as the well known L learning automaton and the deterministic shortest-path algorithms are used in a simulation program to route virtual calls.", } @ARTICLE{Edne95:New, AUTHOR="J. Edney", TITLE="802.11: The New Wireless Standard", JOURNAL=datacommunications, PAGES="77-86", YEAR=1995, KEYWORDS="Lan; overview; radio channel; standard", ABSTRACT="The IEEE 802.11 committee, which is charged with establishing a wireless LAN standard, is expected to release its recommendations within the next few months. The draft standard defines the basic media and configuration issues, transmission procedures, throughput requirements, and range characteristics for wireless LAN technology.", } @ARTICLE{Eise95:Arc, AUTHOR="H. A. Eiselt and M. Gendreau and G. Laporte", TITLE="Arc Routing Problems, Part {II:} The Rural Postman Problem", JOURNAL=or, VOLUME=43, NUMBER=3, PAGES="399-414", YEAR=1995, REFERENCES=91, KEYWORDS="Algorithm; np problem; routing; routing algorithm", ABSTRACT="This is the second half of a two-part survey on arc routing problems. (first part: March-April 1995) Here, the rural postman problem (RPP) is reviewed. The paper is organized as follows: applications, the undirected RPP, the directed RPP, the stacker crane problem, and the capacitated arc routing problem", } @INPROCEEDINGS{Elix95:Open, AUTHOR="M. Elixmann and B. de Greef and A. M. M. Lelkens and others", TITLE="Open Switching - Extending Control Architectures to Facilitate Applications", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="239-243", YEAR=1995, REFERENCES=9, KEYWORDS="Architecture; standard", ABSTRACT="Open Switching facilitates the introduction of new applications and services from areas such as computer-supported telephony, personal communications, intelligent networking and multimedia conferencing in telecommunication networks. For the fast and efficient realization of the applications, data processing and switching have to be combined. The Open Switching architecture is a versatile concept for external call control by applications that is", } @ARTICLE{Eppe95:Spaß, AUTHOR="K. Eppele", TITLE="Spaß ab 100", JOURNAL=ix, ADDRESS="Germany", VOLUME=4, PAGES="80-90", YEAR=1995, LANGUAGE="German", REFERENCES=4, KEYWORDS="Ethernet; hslan; lan", ABSTRACT="Inzwischen gibt es eine ganze Auswahl von Hochgeschwindigkeitstechnologien mit Durchsatzraten ab 100 MBit/s aufwärts: neben FDDI gehören dazu die 100-MBit-Ethernet-Ansätze, ATM und seit neuestem Fibre Channel. Da scheint die Wahl schwer. Doch wer die gebotenen Alternativen dem eigenen kurz- und langfristigen Bedarf gegen berstellt, dem d rfte die Entscheidung schon sehr viel leichter fallen", } @ARTICLE{Eyna95:Methodology, AUTHOR="C. Eynard and Marco Lenti and A. Lombardo and O. Marengo and S. Palazzo", TITLE="A Methodology for the Performance Evaluation of Data Query Strategies in Universal Mobile Telecommunication Systems {(UMTS)}", JOURNAL=ieeejsac, VOLUME=13, NUMBER=5, PAGES="893-907", YEAR=1995, REFERENCES=15, KEYWORDS="Database; distributed database; method; mobile radio; modeling; performance evaluation", ABSTRACT="The anticipated emergence of third-generation mobile systems, referred to as universal mobile telecommunication systems (UMTS), raises the problem of reconsidering the design of the database destined to contain user information. In particular, it is expected that the key concept of the new database architecture will be high distribution and fast updating of information. So far, the problem of determining the most appropriate distributed databas", } @INPROCEEDINGS{Faer95:SDL, AUTHOR="O. Faergemand and Amardeo C. Sarma", TITLE="{SDL} - An Established Language with New Features and Applications", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="108-112", YEAR=1995, REFERENCES=16, KEYWORDS="Sdl; specification; specification language", ABSTRACT="The Specification and Description Language (SDL) with its intuitive graphical syntax is widely spread within the telecommunications area. Inits newest version, SDL '92, SDL with a sound formal basis includes object-orientation, non-determinism and remote procedures. The paper presents the current version of SDL, focusing on its new features. Widely available commercial and experimental tools are described. It gives an overview of the support fo", } @ARTICLE{Fall95:Time, AUTHOR="D. D. Fallconer and Fumiyuki Adachi and B. Gudmundson", TITLE="Time Division Multiple Access Methods for Wireless Personal Communications", JOURNAL=ieeecm, ISBN="0163-6804", ADDRESS="New York, New York", VOLUME=33, NUMBER=1, PAGES="50-57", YEAR=1995, REFERENCES=29, KEYWORDS="Radio channel; tdma", ABSTRACT="TDMA is a classic approach to multiple access in digital cellular wireless communications systems and is the multiple access technique of choice for several digital cellular and PCS systems.", } @INPROCEEDINGS{Farn95:EFFICIENT, AUTHOR="T. D. Farnham and B. N. T. Foxon", TITLE="{AN} {EFFICIENT} {RECOVERY} {PROTOCOL} {FOR} {DISTRIBUTED} {NETWORK} {PLANNING} {INFORMATION} {WITH} {NETWORK} {PARTITIONING} {AND} {EQUIPMENT} {FAILURE}", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="952-957", YEAR=1995, REFERENCES=9, KEYWORDS="Algorithm; capacity planning; network management; protection", ABSTRACT="This paper is concerned with an efficient recovery protocol for distributed network planning information.", } @INPROCEEDINGS{Fasb95:Mobility, AUTHOR="A. Fasbender and S. Hoff and M. Pietschmann", TITLE="Mobility Management in Third Generation Mobile Networks", BOOKTITLE="IFIP TC6 International Workshop on Personal Wireless Communications (Wireless Local Access), IFIP TC6", ADDRESS="Prague, CZ", PAGES="33-46", YEAR=1995, KEYWORDS="Algorithm; distributed database; hierarchical; mobile radio; performance evaluation", ABSTRACT="... In this paper we present an improved distributed location registration and update scheme taking into account the characteristics of next generation cellular systems. Our algorithm makes use of the mixed cell structure to define a hierarchical mobility management. The performance of the distributed scheme is compared to a centralised and another recently published approach with respect to the signalling tarffic due to location updates and mo", } @PROCEEDINGS{Fdid95:Data, TITLE="Data Communications and their Performance: the Sixth {IFIP} {WG6.3} Conference on Performance of Computer Networks", EDITOR="S. Fdida and R. O. Onvural", ISBN="0-412-73250-5", PUBLISHER="Chapman \& Hall", ADDRESS="Istanbul, Turkey", YEAR=1995, KEYWORDS="ATM; data communication; performance evaluation; source model; switching", } @INPROCEEDINGS{Feld95:Simultaneous, AUTHOR="R. Feldmann and J. P. Meester and T. H. Wood", TITLE="Simultaneous Narrowband and Broadband Transmission on a Single Fiber in a Passive Optical Network", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="243-246", YEAR=1995, REFERENCES=4, KEYWORDS="Access network", ABSTRACT="We demonstrate that a broadband PON incorporating TDM, SCMA and coarse WDM can operate simultaneously with a baseband digital network modeled after current-generation N-PONs.", } @INPROCEEDINGS{Fiel95:NET, AUTHOR="Brian Field and Taieb Znati and D. Mossé", TITLE="{-NET} : A Framework For A Versatile Network Architecture To Support Real-Time Communication Performance Guarantees", BOOKTITLE=infocom, ISBN="0-8186-6990-X", ADDRESS="Los Alamitos, California", PAGES="1188-1196", YEAR=1995, REFERENCES=13, KEYWORDS="Lan; man; network architecture", ABSTRACT="This paper proposes a new network architecture, called the Versatile Network Architecture, which provides a framework for flexible support of communication requirements in real-time networks.", } @INPROCEEDINGS{Fior95:Application, AUTHOR="A. Fioretti and A. Aguilar and J. Baudron and G. Leroy and others", TITLE="Application of Optical Transparency to the Telecommunications Core Network", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="67-71", YEAR=1995, REFERENCES=20, KEYWORDS="Network architecture; protection; ring network; transparency; wdm", ABSTRACT="Optics in the telecommunications core network provide capacity, flexibility and transparency that can mask the heterogeneity of the transported entities from users and operators. By entities are meant the payload, transfer modes and bit rates. Optical transparency can be efficiently exploited in a future network architecture, whose nodes are interconnected via bi-directional WDM links. Optically transparent cross-connects and add/drop multiple", } @INPROCEEDINGS{Folk95:Impact, AUTHOR="A. Folkestad and S. Kleier and C. Görg", TITLE="Impact of {UPT} Services on Network Performance and Call Set-Up Times: Distribution of {UPT} Service Logic in {SS7}", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="97-101", YEAR=1995, REFERENCES=12, KEYWORDS="In; intelligent network; signalling", ABSTRACT="With the expected number of UPT users, the impact on the signalling network could be dramatic if the UPT service is designed without forethought. The paper presents the numbering scenarios for UPT and the use of a Personal User Identity (PUI) as an indirect address between the UPT number and the UPT service profile. Three models for distribution of UPT service logic in SS7 are analyzed and evaluated with respect to mean values for the set-up ti", } @ARTICLE{Foo95:Two, AUTHOR="Chun-Choong Foo and S. K. Lim and R. Sharp and K. M. Lye and B. T. Tan and others", TITLE="Two-Way Calling Public {CT2} Telepoint System", JOURNAL=ieeejsac, VOLUME=13, NUMBER=5, PAGES="923-931", YEAR=1995, REFERENCES=12, KEYWORDS="Mobile radio; system design", ABSTRACT="In most current implementations of CT2 telepoint systems, only handset initiated calls are allowed. This paper describes a design to allow two-way calling for the CT2 publuc telepoint system with minimal modifications to the current CT2 infrastructure and the public switched telephone network /PSTN). The design makes use of centralized databases in the home location register (HLR) and visitor location register (VLR) to track location of handset", } @INPROCEEDINGS{Fran95:Network, AUTHOR="P. W. France and J. H. Mackenzie", TITLE="Network Design for the Information Superhighway", BOOKTITLE=efoc, PAGES="23-26", YEAR=1995, KEYWORDS="Network architecture; access network", ABSTRACT="It's described how a PTO could migrate an existing narrowband telephony network towards a future broadband network. A new network architecture based on a reduced number of core switching nodes and the technology options for the access network are presented.", } @INPROCEEDINGS{Frig95:Demonstration, AUTHOR="N. J. Frigo and P. P. Iannone and K. C. Reichmann and J. T. Walker and others", TITLE="Demonstration of Performance-Tiered Modulators in a {WDM} {PON} with a Single Shared Source", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="441-444", YEAR=1995, REFERENCES=11, KEYWORDS="Wdm", ABSTRACT="We demonstrate flexibility in subsystem selection for a WDM PON in which a single optical source is shared by all subscribers. An optical modulator at each terminal impresses upstream data on portions of the downstream signals. Modulator choice is flexible.", } @ARTICLE{Fuji95:Super, AUTHOR="H. Fujimaki and K. Yamano and Ken-Ichi Suzuki", TITLE="Super High-speed Silicon Bipolar Process Technology", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="113-116", YEAR=1995, REFERENCES=4, KEYWORDS="Network; technology", } @INPROCEEDINGS{Fuji95:ATM, AUTHOR="Y. Fujita and T.-H. Wu and Henry Fowler", TITLE="{ATM} {VP} Protection Switching and Applications", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="83-86", YEAR=1995, REFERENCES=13, KEYWORDS="Atm; error recovery; fault tolerance; protection; virtual path; vpn", ABSTRACT="This paper discusses several open issues and proposals needed to define ATM protection switching architectures. Possible ATM/VP protection switching system implementations that do not change the existing ATM cross-connect system architecture are described. A relative comparison of the ATM protection switching system and its STM counterpart, and a possible interworking scheme across the layers, are also discussed.", } @ARTICLE{Fuku95:Optical, AUTHOR="I. Fukuzaki and T. Nakamura and Y. Katsukii", TITLE="Optical Circuit Module for Er-Doped Fiber Amplifier", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="69-72", YEAR=1995, REFERENCES=3, KEYWORDS="B-isdn; network; technology", ABSTRACT="The application of erbium-doped fiber amplifiers is applied to long-haul transmission systems and subscriber systems. Low insertion loss and compactness of optical components are important issues for fiber amplifier with high performance and compactness. We developed an optical circuit module which integrated optical components in a small package, and input/output ports on one surface. This optical circuit module was mounted to video signal dis", } @ARTICLE{Funa95:Remote, AUTHOR="J. Funatsu and T. Katoh and T. Matsushita and K. Honda", TITLE="{Remote-I} Interface Service Unit Type E Basic Service Line Connection Extension Unit", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="51-54", YEAR=1995, REFERENCES=1, KEYWORDS="Fiber optics; network; technology", ABSTRACT="R-ISU type E basic service line connection extension unit provides speech sound band signals and low-speed and high-speed data to users by extending lines from leased line service node equipment or I interface service units to remote locations by optical fiber cable. Since installation is a desktop type, extendibility and cost efficiency to construct ghis system are superb.", } @BOOK{Furh95:Guided, AUTHOR="B. Furht and M. Milenkovic", TITLE="A Guided Tour of Multimedia Systems and Applications", ISBN="0-8186-7054-1", PUBLISHER="IEEEE Computer Society Press", ADDRESS="Los Alamitos, Californai", YEAR=1995, KEYWORDS="Multimedia; survey", ABSTRACT="The book includes 36 (already published) papers by leading authorities on multimedia technology and applications.", } @ARTICLE{Gabr95:Gigabit, AUTHOR="J. M. Gabriagues and D. Chiaroni and D. D. Bouard and P. Gavignet and others", TITLE="Design and Implementation of a Gigabit {ATM} Photonic Switching Matrix", JOURNAL=jhsn, VOLUME=4, NUMBER=4, PAGES="425-437", YEAR=1995, REFERENCES=25, KEYWORDS="Atm; optical switching; wdm", ABSTRACT="This paper presents a high-performance ATM photonic switching matrix, consisting of an all-optical self-routing high-speed network elctrically controlled. The matrix internal architecture is based on wavelength encoding, for cell routing and multiplexing, and on output queueing, for providing the buffering function: its operating principles are fully illustrated. The matrix optical key components are described in detail, discussing as well the", } @INPROCEEDINGS{Gabr95:OASIS, AUTHOR="J. M. Gabriagues and J. B. Jacob", TITLE="{OASIS:} A High-Speed photonic {ATM} switch Results and Perspectives", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="457-461", YEAR=1995, REFERENCES=12, KEYWORDS="Atm; optical switching; wdm", ABSTRACT="The OASIS switching concept relies on the routing and the buffering of ATM cells in the optical domain, taking advantage of new optoelectronic components capable of dynamic wavelength allocation and fast gating. A 4-element cell buffer was implemented. A new architecture is described based on the experience gained from the OASIS demonstration. This architecture is an adaptation of the first switching concept to the broadcast and select routing", } @BOOK{Gamm95:Patterns, AUTHOR="E. Gamma and M. Helm and Marjory Johnson and John M. Vlissides", TITLE="Design Patterns: elements of reusable object-oriented software", ISBN="0-201-63361-2", PUBLISHER="Addison-Wesley Professional Computing Series, Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1995, REFERENCES=89, KEYWORDS="Object-oriented programming", ABSTRACT="Capturing a wealth of experience about the design of object-oriented software, four top-notch designers present a catalog of simple and succinct solutions to commonly occurring design problems. Previously undocumented, these 23 patterns allow designers to create more flexible, elegant, and ultimately reusable designs without having to rediscover the design solutions themselves.", } @INPROCEEDINGS{Garc95:Exact, AUTHOR="J. L. Garcia and J. Barcelo and O. Casals", TITLE="An exact model for the multiplexing of worst case traffic sources", BOOKTITLE="Data Communications and their Performance: the Sixth IFIP WG6.3 Conference on Performance", ISBN="0-412-73250-5", ADDRESS="London, Great Britain", PAGES="3-17", YEAR=1995, REFERENCES=12, KEYWORDS="Analytical model; ATM; congestion control; multiplexer; ND/D/1; traffic model", ABSTRACT={In this paper we analyse a multiplexer handling a number of identical and independent Worst Case Traffic (WCT) sources. Each WCT source produces a periodic stream of cells consisting of a constant number of back-to-back cells followed by a silent period of constant duration. The WCT can model the traffic produced by a "malicious" user who sends an ON/OFF traffic where a burst of back-to-back cells whose length is the largest compatible with the}, } @INPROCEEDINGS{Gard95:Net, AUTHOR="L. M. Gardner and I. Hal Sudborough and I. G. Tollis", TITLE="Net Solver: A Software Tool For the Design of Survivable Networks", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="926-930", YEAR=1995, REFERENCES=16, KEYWORDS="Fault tolerance; network design; network planning; protection; ring network; self healing network", ABSTRACT="We present a software tool (Net Solver) that designs survivable networks based on self-healing ring architecture. Our tool iteratively finds a good ring cover and routing for all point-to-point traffic on a given network. The solutions produced by Net Solver are 10-50\% better than those initially chosen or than those produced by hand. We have implemented a prototype that runs on a PC.", } @INPROCEEDINGS{Gavi95:USAGE, AUTHOR="J. Gavilan and A. Becerra and I. Berberana", TITLE="{USAGE} {OF} {VSAT} {FOR} {TCP/IP} {BASED} {LAN} {INTERCONNECTION}", BOOKTITLE=infocom, ISBN="0-8186-6990-X", ADDRESS="Los Alamitos, California", PAGES="861-866", YEAR=1995, REFERENCES=7, KEYWORDS="Interconnection; lan; satellite radio; tcp/ip", ABSTRACT="In this paper an analysis of the possibilities of usage of VSAT netwokrs for the interconnection of TCP/IP based LANs is performed.", } @ARTICLE{Gay95:Theoretical, AUTHOR="E. Gay and M. J. Chawki and D. H. B. Hoa and V. Tholey", TITLE="Theoretical Simulation and Experimental Investigation on a {WDM} Survivable Unidirectional Open Ring Network Using Tunable Channel Selecting Receivers", JOURNAL=ieeejlt, VOLUME=13, NUMBER=8, PAGES="1636-1647", YEAR=1995, REFERENCES=25, KEYWORDS="Fault tolerance; field trial; ring network; wdm", ABSTRACT="In this paper, theoretical and experimantal investigations on a WDM reconfigurable open ring network are reported. The theoretical study is focused on network component characteristics and ring network structure. These aspects will form the basis of numerical modeling.The software COMSIS is used for the simulation. The simulation takes into account the most improtant parameters: node structure, link losses, EDFA characteristics, optical powers", } @BOOK{Geih95:Client, AUTHOR="Kurt Geihs", TITLE="Client/Server-SystemeGrundlagen und Architektur", PUBLISHER="Thomson's Aktuelle Tutorien", ADDRESS="Germany", YEAR=1995, LANGUAGE="German", KEYWORDS="Architecture; computer network; distributed system; overview", } @INPROCEEDINGS{Geor95:Recent, AUTHOR="T. Georges", TITLE="Recent advances on soliton systems", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="311-316", YEAR=1995, REFERENCES=29, KEYWORDS="Transmission; transmission system", } @INPROCEEDINGS{Gerl95:Protocols, AUTHOR="M. Gerla and B. Kannan and P. Palnati", TITLE="Protocols for an Optical Star Interconnect for High Speed Mesh Networks", BOOKTITLE=infocom, ISBN="0-8186-6990-X", ADDRESS="Los Alamitos, California", PAGES="146-153", YEAR=1995, REFERENCES=11, KEYWORDS="Bandwidth allocation; network; optical lan; star network; wdm", ABSTRACT="Optical networks can provide higher throughputs while high speed electronic networks possess the intelligence for network control and management. We present a two level high speed network architecture that combines the throughput advantage of optical netowkrs and the intelligence of electronic processing. One lever is a High Speed Mesh LAN which uses wormhole routing, source routing and hop-by-hop flow control mechanisms with mesh routers to pr", } @ARTICLE{Gior95:Dimensioning, AUTHOR="M. Giorgi and R. Cadeddu", TITLE="Dimensioning an optical transport network with wavelength division multiplexing", JOURNAL="CSELT Technical reports", ADDRESS="Italy", VOLUME=23, NUMBER=5, PAGES="555-565", YEAR=1995, REFERENCES=3, KEYWORDS="Capacity planning; cost; cost function; network planning; protection; wdm", ABSTRACT="This paper is concerned with the dimensioning of a multi-wavelength transport network. A heuristic algorithm takes optical node and link costs into account, and is used to dimension the optical sub-network that maximizes transport network efficiency in terms of equipment cost and electrical cross-connect size.", } @INPROCEEDINGS{Gips95:Survivability, AUTHOR="T. Gipser", TITLE="Survivability and Scalability Aspects of the All-Optical Network {MATRIX}", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="196-199", YEAR=1995, REFERENCES=20, KEYWORDS="Fault tolerance; multihop; network architecture; wdm", ABSTRACT="MATRIX is an all-optical multihop network in which packets are distributed with wavelength continuity. A high conncectivity degree together with a good channel efficiency enable a huge network capacity. Multiple optical paths between any pair of network nodes provide good network survivability.", } @INPROCEEDINGS{Glad95:Optical, AUTHOR="N. Gladisch and N. Gieschen and M. Rooks", TITLE="Optical Frequency Switching Between {OFDM} Networks", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="236-239", YEAR=1995, REFERENCES=4, KEYWORDS="Lan; optical lan; optical switching; wdm; access network", ABSTRACT="Switched high speed links are required to connect broadband LANs. In this paper the different possibilities of switched communication between individual LANs using star networks and OFDM are shown: - single- and multichannel gateway techniques - channel routing - pure passive optical network expansions", } @BOOK{Gomm95:Datenfern, AUTHOR="H. Gommlich and E. Schuon", TITLE="Datenfernübertragung und ihre Meßtechnik", ISBN="3-7949-0588-1", PUBLISHER="Schiele \& Schön", ADDRESS="Berlin, Germany", YEAR=1995, LANGUAGE="German", KEYWORDS="Data transmission; measurement; measurement method", ABSTRACT="... dem geschilderten Konzept entsprechend ist der Inhalt in vier große Abschnitte gegliedert, wobei der erste und der dritte jeweils an die beiden nachfolgenden heranf hren: - Grundlagen der digitalen Datenübertragung - Meßaufgaben und Meßgeräte für die digitale Daten bertragung - Übertragungsverfahren und Übertragungswege - Meßaufgaben und Meßgeräte für die Übertragungswege ...", } @ARTICLE{Gong95:Approximate, AUTHOR="Yi Gong and M. Paterakis", TITLE="An Approximate Performance Fairness Analysis of the pi-Persistent Protocol with Destination Release", JOURNAL=ieeecom, VOLUME=43, NUMBER=5, PAGES="1877-1880", YEAR=1995, REFERENCES=10, KEYWORDS="Dqdb; fairness; man; media access control; performance evaluation", ABSTRACT="Sufficient conditions are derived for achieving the two most important fairness criteria in the design of access protocols for high-speed metropolitan area networks., the delay and throughput fairness criteria. A probabilistic scheduling schme, known as the pi-persistent protocol is considered, which has been shown to be suitable for applications requiring large bandwidth over long repeater-free distances and also amenable to an approximate ana", } @ARTICLE{Good95:MEDIUM, AUTHOR="D. S. Goodall and A. K. Burston", TITLE="{MEDIUM} {ACCESS} {CONTROL} {FOR} {ASYNCHRONOUS} {TRAFFIC} {IN} {THE} {AMNET} {LAN}", JOURNAL="International Journal of Communication Systems", ADDRESS="Great Britain", VOLUME=8, NUMBER=5, PAGES="155-163", YEAR=1995, REFERENCES=8, KEYWORDS="Atm; lan; media access control; multimedia; slotted ring", } @INPROCEEDINGS{Grab95:Combining, AUTHOR="J. Grabowski and D. Hogefe and I. Nussbaumer and Andreas Spichiger", TITLE="Combining {MSCs} and Data Descriptions in order to Generate Executable Test Cases for {ISDN} Systems", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="148-152", YEAR=1995, REFERENCES=13, KEYWORDS="Asn.1; protocol specification; protocol testing; simscript; specification; testing", ABSTRACT="A method for the automatic implementation of test cases from their specification is presented. For the specification MSCs are used. Special care is taken over the inclusion of message definitions and constraints. For this purpose a new concept for the reference and modification of constraints is introduced. The whole method has been implemented in a set of prototype tools.", } @ARTICLE{Grah95:Photonic, AUTHOR="Adrian Grah and T. D. Todd", TITLE="Photonic Ring and Bus Networks with Reduced Station Hardware", JOURNAL=jhsn, VOLUME=4, NUMBER=1, PAGES="77-98", YEAR=1995, REFERENCES=18, KEYWORDS="Bus; lan; man; network; ring; wdm", ABSTRACT="In this paper, four different WDM bus/ring networks are considered. All four have user station hardware designs with various reductions in the number of tapping points, number of transmitters and receivers and their tunability requirements. With each reduction in hardware, protocol complexities and performance reductions are introduced. In all cases, dynamic packet-switched operation is achieved. The designs thus give an indication of the cost/", } @ARTICLE{Grts95:Polyhedral, AUTHOR="M. Grötschel and Clyde L. Monma and M. Stoer", TITLE="Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements", JOURNAL=or, VOLUME=43, NUMBER=6, PAGES="1012-1024", YEAR=1995, REFERENCES=21, KEYWORDS="Fault tolerance; fully connected network; linear optimization; linear programming; network design; network optimization; protection", ABSTRACT={We consider the improtant practical and theoretical problem of designing alow-cost communications network which can survive failures of certain network components. Our initial interest in this area was motivated by the need to design certain "two-connected" survivable topologies for fiber optic communication networks of interest to the regional telephone companies. In this paper, we describe some polyhedral results for network design problems w}, } @INPROCEEDINGS{Guil95:Two, AUTHOR="C. Guillemot and F. Clerot and S. Loualiche and J. M. Simon and others", TITLE="A Two-Stage Transparent Packet Switch Architecture Based on Wavelength Conversion", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="765-768", YEAR=1995, REFERENCES=5, KEYWORDS="Optical switching; packet switching", } @INPROCEEDINGS{Guo95:ShuffleNet, AUTHOR="Duanyang Guo and W. Guo and A. S. Acampora", TITLE="ShuffleNet=Hypercube x Ring and Embedding ShuffleNet on Mesh Network", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="1766-1772", YEAR=1995, REFERENCES=12, KEYWORDS="Graph theory; hypercube; interconnection network; network topology; shufflenet", ABSTRACT="In this paper, we for the first time show that topologically a ShuffleNet is th multiplication of hypercube and ring, similar to cube-connected-cycle. This finding relates ShuffleNet to the well-understood hypercube and enables us to embed ShuffleNet on mesh network using a small number of fiber buses and an even small number of wavelengths.", } @INPROCEEDINGS{Guo95:Scalable, AUTHOR="Duanyang Guo and W. Guo and A. S. Acampora", TITLE="Scalable Multihop {WDM} Passive Ring with Optimal Wavelength Assignment and Adaptive Wavelength Routing", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="2195-2204", YEAR=1995, REFERENCES=7, KEYWORDS="Network architecture; network design; ring network; wdm", ABSTRACT="This paper presents a scalable multihop WDM passive ring architecture for LANs or MANs. The network consists of optical interfaces, which are connected into a ring by fibers. Each optical interface is completely passive and unpowered. We apply the multihop principle by introducing a regular multi-loop ring called wheel as the optical connectivity and embedding it onto the single-loop fiber ring. ..", } @ARTICLE{Guo9504:Scalable, AUTHOR="Duanyang Guo and Y. Yemini and Z. Zhang and W. Guo", TITLE="Scalable High-Speed Protocols for {WDM} Optical Star Networks", JOURNAL=jhsn, VOLUME=4, NUMBER=4, PAGES="341-360", YEAR=1995, REFERENCES=15, KEYWORDS="Access protocol; delay analysis; media access control; optical lan; routing; star network; throughput performance; WDM", ABSTRACT="This paper proposes scalable conflict-free media access protocols for WDM optical passive star networks using shared parallel queueing adn wormhole scheduling. Shared parallel queueing is to associate several parallel queues with a data channel, rather than one deep queue (as in DT-WDMA) or N static queues. This significantly reduces both the hardware resource requirement and the control signalling demand. Wormhole scheduling is to schedule mul", } @INPROCEEDINGS{Halr95:SOJOURN, AUTHOR="S. Halrong and L. Lemin and L. Jianxin", TITLE="Sojourn time analysis of prioritized {DQDB} {(IEEE802.6)} {MAN} with bursty traffic input", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="151-156", YEAR=1995, REFERENCES=6, KEYWORDS="Analysis; bursty traffic; dqdb; priority", ABSTRACT="The sojourn time of the prioritzed DQDB MAN with bursty traffic input is studied in this paper. The expression of the mean sojourn time of the message transmitted at the higher priority level is given briefly. After investigating the transient behavior of a related random walk process, the sojourn time of th epacket at the lower priority level is derived. Then, we obtain the expression for the mean sojourn time of the message with the lower tra", } @INPROCEEDINGS{Hane95:Broadband, AUTHOR="M. Haner and T. N. Nielsen and J. Nykolak and H.-C. Chen and others", TITLE="Broadband Fiber Loops with Wireless Access", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="227-230", YEAR=1995, REFERENCES=2, KEYWORDS="Wdm; access network", ABSTRACT="Support of wireless sewrvices by a conventional fiber network as: - point-to-point links - interconnection of cellular base stations - radio relay - fixed wireless loops", } @INPROCEEDINGS{Hani95:Limitations, AUTHOR="N. Hanik", TITLE="Limitations of the Transmission Capacity of Optical Frequency-Division-Multiplexed Systems Due to Four Wave Mixing", BOOKTITLE=efoc, PAGES="213-216", YEAR=1995, REFERENCES=8, KEYWORDS="Error rate; wdm", ABSTRACT="The nonlinear perturbation of OFDM systems is investigated. For high channel numbers and small frequency distances the input channel power is limited to the sub-mW-range to avoid rapid increase of bit error rate.", } @ARTICLE{Hara95:TDM, AUTHOR="H. Harada and S. Kajiya and K. Tsukamoto and Shozo Komaki and N. Moringa", TITLE="{TDM} Intercell Connection Fiber-Optic Bus Link for Personal Radio Communication Systems", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="1287-1294", YEAR=1995, REFERENCES=10, KEYWORDS="Bus; communication system; fiber optics; tdm", ABSTRACT="Performance degradation due to optical beat noise is severe problem in subcarrier multiplexing systems. To solve this problems, this paper proposes a new type of intercell connection bus fiber-optic link using time division multiplexing. This paper also analyzes transmission performance.", } @ARTICLE{Hare95:Polling, AUTHOR="A. Harel and A. Stulman", TITLE="Polling, Greedy and Horizon Servers on a Circle", JOURNAL=or, VOLUME=43, NUMBER=1, PAGES="177-186", YEAR=1995, LANGUAGE="english", REFERENCES=24, KEYWORDS="Comparison; greedy algorithm; performance evaluation; polling system; queueing system; scheduling", ABSTRACT="Service in a loop-based polling system consists of a single server moving around a closed tour, stopping to perform services wherever requests are encountered. There are N stations (unit buffer queues) spaced one unit of distance apart, and the server moves at a unit speed. All queues are identical, and the service time is deterministic. We compare the two well known cyclic polling and greedy servers with a new control policy called the horizon", } @ARTICLE{Hari95:Optical, AUTHOR="K. Harikae", TITLE="Optical Access System Technology to Support Multimedia Service Field Trials", JOURNAL=nttrev, ADDRESS="Japan", VOLUME=7, NUMBER=6, PAGES="74-79", YEAR=1995, KEYWORDS="Field trial; access network", ABSTRACT="NTT is conducting several multimedia trials with the approaching multimedia age in mind. The service field trials conducted in the Tachikawa Area as one of such trials presents CATV video transmission service, video-on-demand and telephone service in combination to subscribers to let them enjoy advanced communications services for general households. Of the optical access system technology applied to this trial for presenting these compositing", } @ARTICLE{Harm95:Local, AUTHOR="Dale D. Harman and Garng Huang and Gi-Hong Im and Matt D. Nguyen and J. J. Werner and Michael Wong", TITLE="Local Distribution for Interactive Multimedia {TV} to the Home", JOURNAL=ieeemm, VOLUME=2, NUMBER=3, PAGES="14-23", MONTH="Fall", YEAR=1995, REFERENCES=8, KEYWORDS="carrierless AM/PM (CAP); interactive TV; residential networking; fiber-to-the-curb; unshielded twisted pair; switched digital video; digital local distribution technology; ATM; field trial; interactive; media access control; multimedia; multiple access; physical layer; polling; slotted aloha;tdma; telephone channel", ABSTRACT="This paper discusses a local distribution system for interactive multimedia TV (IMTV) to the home. The network architecture considered here is fiber to the curb, and local distribution of the IMTV signals to and from the home is provided on telephone wiring and coaxial cable. The downstream IMTV channel, from the curb to the home, operates at a data rate of 51.84 Mbps, and the upstream channel, from the home to the curb, operates at a data rate of 1.62 Mbps.", URL="http://www.computer.org/multimedia/mu1995/u3toc.htm", } @ARTICLE{Heid95:Photonische, AUTHOR="H. Heidrich", TITLE="Photonische {IC} warten auf ihre Nutzung", JOURNAL=ntz, ISBN="0948-728X", ADDRESS="Germany", VOLUME=48, NUMBER=12, PAGES="30-35", YEAR=1995, LANGUAGE="German", REFERENCES=9, KEYWORDS="Technology", ABSTRACT="Stand der Forschung bei photonischen ICs (PIC) basierend auf Indiumphosphid - Integrationstechnik Kostenfaktoren beim Aufbau von PICs (Verbingung Chip-Faser, ...) Entwicklung eines Integrationsprozesses am HHI", } @INPROCEEDINGS{Hein95:Solutions, AUTHOR="W. Heinmiller and Randal L. Schwartz and M. Stanke", TITLE="Solutions for Mediated Access to the Intelligent Network", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="217-221", YEAR=1995, REFERENCES=3, KEYWORDS="In; intelligent network; open network", ABSTRACT={In this paper, we propose a service architecture that allows access to the intelligent network (IN) from a service control point (SCP) belonging to any service provider. We define a set of new network functions which are collectively referred to as "mediation". The requirements for these functions were determined by external and internal market research to elicit the needs and expectations of companies who may become service providers. We prese}, } @ARTICLE{Helm95:Digital, AUTHOR="J. Helms and A. Reichelt and M. Semjen and B. H. Verbeek", TITLE="32 Digital Uncompressed {TV} Channel Distribution Via 8 {HDWDM} Channels", JOURNAL=ieeejlt, VOLUME=13, NUMBER=8, PAGES="1648-1654", YEAR=1995, REFERENCES=9, KEYWORDS="Broadcast; field trial; technology; wdm", ABSTRACT="The performance of a demonstrator for the distribution of 32 digital uncompressed TV channels using HDWDM has been examined. For the transmission 8 optical wavelengths have been used spaced by 2 nm in the 1529-1543nm range carrying a data rate of 8x622 Mb/s. Without optical amplifier a splitting factor of 16 has been obtained for the PON with low crosstalk and polarization sensitivities. The demonstrator is the distributive part of a combined d", } @TECHREPORT{Hend95:Local, AUTHOR="N. Hendrich", TITLE="Local stability learning rules and phase space gardening in neural networks", TYPE="Berichte des Fachbereichs Informatik", INSTITUTION="Universität Hamburg", ADDRESS="Hamburg, Germany", NUMBER=173, YEAR=1995, REFERENCES=39, KEYWORDS="Neural network; physics; stability; statistics", ABSTRACT="This report studies the dynamical properties of Hopfield-Gardner neural networks, with the object of phase-space gardening. It introduces the new concept of local stability learning rules that specify the stability of each pattern at each neuron individually. Simulations of the networks show that these learning rules allow to adjust the size and shape the basins of attraction of the stored patterns as desired.", } @INPROCEEDINGS{Herb95:Experiences, AUTHOR="R. Herber and H. Richter and S. Carter and A. Hill and J. Pietzsch", TITLE="Experiences with Upgrading of Passive Optical Networks Using Wavelength Division Multiplexing", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="235-238", YEAR=1995, REFERENCES=2, KEYWORDS="Field trial; network evolution; wdm; access network", } @INPROCEEDINGS{Herm95:Intelligent, AUTHOR="M. Herman", TITLE="Intelligent Wide Area Centrex", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="331-335", YEAR=1995, KEYWORDS="In; intelligent network", ABSTRACT="This paper shows the technical feasibility of an Area Wide Centrex that maximizes the use of concepts from Intelligent Networks (IN) to provide a feature rich, feature transparent network solution for business communications. This service is called the Intelligent Area Wide Centrex (I-AWC). The I-AWC will be characterized by service logic development in the Service Control Point, and the separation of the user features from user access. This so", } @INPROCEEDINGS{Hers95:Dynamic, AUTHOR="A. Herschtal and M. Herzberg", TITLE="Dynamic Capacity Allocation and Optimal Rearrangement for Reconfigurable Networks", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="946-951", YEAR=1995, REFERENCES=7, KEYWORDS="Algorithm; capacity planning; dynamic reconfiguration; dynamic resource allocation; protection", ABSTRACT="This paper presents some suitable techniques for assigning and managing bandwidth demands on a logically meshed network so as to enhance the networks traffic carrying ability. The techniques are used to: generate eligible paths for capacity allocation, allocate capacity and reconfigure the logical network. They were tested through simulation studies on a sample network.", } @ARTICLE{Herz95:Hop, AUTHOR="M. Herzberg and S. J. Bye and A. Utano", TITLE="The Hop-Limit Approach for Spare-Capacity Assignment in Survivable Networks", JOURNAL=ieanep, VOLUME=3, NUMBER=6, PAGES="775-784", YEAR=1995, REFERENCES=26, KEYWORDS="Capacity assignment; capacity planning; linear programming; network flow; self healing network", ABSTRACT="This paper presents a new approach for spare-capacity assignment in mesh-type self-healing networks which use reconfigurable network elements as transmission hubs. Under this approach the process of reducing total weighted cost of spare capacity is obtained by taking into account all networks eligible restoration routes which do not violate a predetermined hop-limit value. The process derived considers a given set of possible failure scenarios.", } @INPROCEEDINGS{Hess95:COMPATIBLE, AUTHOR="X. Hesselbach and S. Sallent", TITLE="A compatible {ATM\_DQDB} interconnection in a broadband multi-internetworking unit", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="342-347", YEAR=1995, REFERENCES=7, KEYWORDS="Atm; dqdb; interconnection; man", ABSTRACT="This apper describes the work done and results achieved implementing a prototype of an intelligent multi-internetworking unit based on an ATM core connecting different network standards, IEEE 802.6, IEEE 802.3 and, in a second work, FDDI. ... We will focus on the ATM -IEEE 802.6 connection solution, compatible with the rest of the architecture. Also, the results of a simulation will be presented to analyze the protocol computational load to des", } @ARTICLE{Himm95:Optisches, AUTHOR="R. Himmler and U. Kohn and E. Kremers and E.-U. Scheuing and others", TITLE="Optisches Wellenlängenmultiplex - ein Weg zu höherer Übertragungskapazität", JOURNAL=ntz, ISBN="0948-728X", ADDRESS="Germany", VOLUME=48, NUMBER=10, PAGES="10-19", YEAR=1995, LANGUAGE="German", REFERENCES=13, KEYWORDS="Multiplexing; network; technology; wdm", ABSTRACT="Übersichtsartikel, behandelt Stand der Technik (1995), WDM, Systemarchitekturen, optischer Überwachungskanal, Schl sselkomponenten, Faserverstärker, Laserdioden, Filter (gute Übersicht !), Experiment", } @INPROCEEDINGS{Hira95:Distributed, AUTHOR="Miki Hirano and Y. Kinouchi and T. Suzuki", TITLE="Distributed Control Node Architecture in the Advanced Intelligent Network", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="278-282", YEAR=1995, REFERENCES=8, KEYWORDS="Architecture; database; in; intelligent network", ABSTRACT="The advanced Intelligent Network (IN) aims to provide customized services and quick service delivery to respond flexibly to the demand for new and varied services. It is expected to handle personal communication services on a nationwide scale. To implement such a network, however, the service control nodes (service control points: SCPs) must have a better cost to performance ratio over the range from small-scale to large-scale processing, must", } @INPROCEEDINGS{Hoef95:Elementary, AUTHOR="D. A. Hoeflin and V. Mendiratta", TITLE="An Elementary Model for Predicting Switching System Outage Duration", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="408-412", YEAR=1995, REFERENCES=3, KEYWORDS="Availability; error recovery; reliability; reliability measure", ABSTRACT={The objectives of the paper are: - Present a model of a recovery mechanism for switching systems - Elucidate the structural properties of this recovery mechanism that cause a system to appear "chaotic" or "well-behaved" - Identify specific objectives that are required to yield a "well-behaved" system}, } @INPROCEEDINGS{Hoff95:Photonic, AUTHOR="D. B. Hoffmann and Frank Kappe and C. Bornholdt and A. Ehrhardt and others", TITLE="Photonic Space Switches for Ultra-High-Speed Applications", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="133-136", YEAR=1995, KEYWORDS="Optical switching; technology", ABSTRACT="We report on the development of indium phosphide based fast 2*2 space switches. Mach-Zehnder devices with low switching voltage using multi-quantum well layers together with lumped electrodes desplayed cut-off frequencies of 12 GHz. In devices with travelling wave electrodes and bulk layers speeds in excess of 35 GHz were achieved.", } @BOOK{Holz95:Early, AUTHOR="Gerard J Holzmann and B. Pehrson", TITLE="The Early History of Data Networks", ISBN="0-8186-6782-6", PUBLISHER="IEEE Computer Society Press", ADDRESS="Los Alamitos, California", YEAR=1995, REFERENCES=128, KEYWORDS="Data network; history; protocol; signalling", ABSTRACT="Most of us would consider the emergence of large-scale communication networks to be a twentieth-century phenomenon. The first nationwide data networks, however, were built almost two hundred years ago. At the end of the eighteenth century, well before the electromagnetic telegraph was invented, many countries in Europe had fully operational data communications systems, with altogether close to one thousand network stations. This book gives a f", } @ARTICLE{Hori95:High, AUTHOR="H. Horikawa and M. Nakajima and Kohzoh. Nakamura and H. Yaegashi", TITLE="High Power 0.98 µm Laser Diode for Er3+-doped Optical Fiber Amplifier", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="73-78", YEAR=1995, REFERENCES=11, KEYWORDS="Network; technology", } @INPROCEEDINGS{Hori95:New, AUTHOR="H. Horikoshi and J. Takayama and K. Furugen", TITLE="New Architecture of a Cross-Connecting System for Flexible Access Network", BOOKTITLE=efoc, PAGES="190-193", YEAR=1995, REFERENCES=6, KEYWORDS="Cross connect; access network", ABSTRACT="The connecting points of main distribution frames (MDF), which are installed between outside and inside plants are analyzed. A connecting system for forthcoming FITL networks is also proposed.", } @TECHREPORT{Horv95:Classification, AUTHOR="S. Horvath and M. Kudlek", TITLE="Some Classification and Decidability Results on Primitive Words", INSTITUTION="Berichte des Fachbereichs Informatik, Fachbereich Informatik der Universität Hamburg", ADDRESS="Hamburg, Germany", YEAR=1995, REFERENCES=23, KEYWORDS="Formal technique", } @INPROCEEDINGS{Hu95:MULTI, AUTHOR="Z. Hu and W. Hsu and C. Richard Lau", TITLE="A {MULTI-HOP} {LIGHTWAVE} {NETWORK} {BASED} {ON} {STAR} {GRAPHS}", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="1779-1783", YEAR=1995, REFERENCES=22, KEYWORDS="Multihop; network topology; star network; wdm", ABSTRACT="A multi-hop lightwave network, based upon the star graphs, is studied in this paper. Schemes for embedding the star graphs and a cluster of stars in physical lightwave networks are proposed. The resulting networks have many desirable properties: high capacity, self-routing, fault tolerant and good scalability.", } @INPROCEEDINGS{Huan95:DTCAP, AUTHOR="Nian-Chyi Huang and S. T. Sheu", TITLE="{DTCAP} - A Distributed Tunable Channel Access Protocols for Multi-Channel Photonic Dual Bus Networks", BOOKTITLE=infocom, ISBN="0-8186-6990-X", ADDRESS="Los Alamitos, California", PAGES="908-915", YEAR=1995, REFERENCES=24, KEYWORDS="Dqdb; fiber optics; man; optical lan; wdm", ABSTRACT="In this paper, we prove taht the (n,m,c)-WRAP is NP-hard. An efficient Distributed Tunable-Channel Access Protocol (DTCAP) is proposed for the (1,m,c)-WRAP. Based on the DTCAP, three different schemes are proposed for assigning the wavelength/receiver. The performance of the three proposed schmes on the DTCAP are evaluated for a limited number of wavelengths and receivers, the proposed schmes substantially improve the network throughput and acc", } @INPROCEEDINGS{Hube95:Evolution, AUTHOR="M. Huber and H. Stegmeier and K.-U. Stein and K. H. Wiedeburg", TITLE="Evolution to Photonic Networking - Photonic versus Microelectronics", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="372-376", YEAR=1995, REFERENCES=9, KEYWORDS="Cross connect; network; network evolution; wdm", ABSTRACT="For growing traffic volume, cost reduction and better utilization of fibers and high capacity nodes are required. Both, photonic technology and microelectronics can be used in a complementary manner. Transmission bandwith and cross-connecting can be strongly enhanced by adding systems based on wavelength division multiplexing to the existing systems (synchronous digital hierarchy and/or asynchronous transfer mode) using electrical time division", } @ARTICLE{Hwan95:Call, AUTHOR="RenHung Hwang and James F. Kurose and Donald F. Towsley", TITLE="On Call Processing Delay in High Speed Networks", JOURNAL=ieanep, VOLUME=3, NUMBER=6, PAGES="628-639", YEAR=1995, REFERENCES=23, KEYWORDS="Blocking; call processor capacity; delay analysis; delay throughput characteristics; routing algorithm; setup time", ABSTRACT="The goal of this paper is to characterize the behavior of some processing element delays (such as f.ex. routing algorithms, propagation delays, ...) on the call setup time and accepted call throughput. This behavior is examined for three sequential routing schemes and two flooding routing schemes under various network parameters and different forms of admission control. The results of our study indicate that processing capacity and the admissio", } @ARTICLE{Iann95:Optical, AUTHOR="E. Iannone and Roberto Sabella", TITLE="Performance Evaluation of an Optical Multi-Carrier Network Using Wavelength Converters Based on {FWM} in Semiconductor Optical Amplifiers", JOURNAL=ieeejlt, VOLUME=13, NUMBER=2, PAGES="312-324", YEAR=1995, REFERENCES=36, KEYWORDS="Cross connect; optical switching; switching system; technology; transmission; wdm", ABSTRACT="An analysis of the transmission performance of an optical multi-carrier network layer employing wavelength converters based on four wave mixing in semiconductor travelling wave amplifiers is presented. The all-optical wavelength conversion proposed here would allow the network to fulfill the requirement of flexibility, maintaining the transparency of the optical layer. Analytical results, obtained by an accurate model of the transmission throug", } @PROCEEDINGS{IEEE95:Proceedings, TITLE="16th {IEEE} Real-Time Systems Symposium", EDITOR="IEEE Communications Society", ISBN="0-8186-7337-0", PUBLISHER="IEEE Computer Society Press", ADDRESS="Los Alamitos, California", YEAR=1995, KEYWORDS="Application; DQDB; fault tolerance; formal technique; real time; scheduling; timing problem", } @ARTICLE{Ikem95:Gbit, AUTHOR="K. Ikemura and T. Mukoujima and Katsuhiro Ishimura", TITLE="10 Gbit/s Multiplexer/Demultiplexer Technology", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="17-20", YEAR=1995, REFERENCES=18, KEYWORDS="Fiber optics; network; sdh; technology", ABSTRACT="Expectations for large-capacity multiplexer technologies are increasing from various quarters directed towards the conceptual implementation of the information highway. The developement of multiplexer technology, which can be flexibly applied to a variety of 10 Gbit/s multiplexing equipment, has advanced. This paper first conceptualizes 4 types of 10 Gbit/s multiplexer configurations, and describes the technology needed to implement these conf", } @INPROCEEDINGS{Ims95:Advanced, AUTHOR="L. A. Ims and D. Myhre and B. T. Olson and M. Lätheenoja and others", TITLE="Advanced Multiservice Scenarios for Europe", BOOKTITLE=efoc, PAGES="177-183", YEAR=1995, REFERENCES=7, KEYWORDS="Case study; access network", ABSTRACT="Scenarios for residential access networks are given. Techno-economic evaluation of strategies for developping the traditional access network along a cost effective path towards an effective future-proof multiservice broadband network is presented.", } @INPROCEEDINGS{Iver95:Comparison, AUTHOR="K. Iversen and D. Hampicke", TITLE="Comparison and classification of all-optical {CDMA} systems for future telecommunication networks", BOOKTITLE="SPIE All-Optical Communication Systems: Architecture, Control, and Network Issues", ISBN="0-8194-1978-8", ADDRESS="Bellingham, USA", PAGES="110-121", YEAR=1995, REFERENCES=38, KEYWORDS="Cdma; fiber optics; overview; technology; wdm", ABSTRACT="This paper shows the state of the art in fiber optical CDMA. Recent work in this area for both, systems and sequences is reviewd and analyzed. For that purpose a classification of systems, corresponding to the manner of signal processing and a classification of known (0,1)-sequences are presented. It is shown that due to the limits by currently available device technology especially two techniques are promising for implementation in broadband t", } @ARTICLE{Iwas95:Highly, AUTHOR="M. Iwashita and H. Oikawa and H. Imanaka and R. Toyoshima", TITLE="Design of Highly Reliable Optical Fiber Cable Network in Access Networks", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="1033-1042", YEAR=1995, REFERENCES=10, KEYWORDS="Communication network; fiber optics; heuristics; network design; reliability; access network", } @ARTICLE{Jabb95:Network, AUTHOR="B. Jabbari and G. Colombo and A. Nakajima and J. Kulkarni", TITLE="Network Issues for Wireless Communications", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=33, NUMBER=1, PAGES="88-98", YEAR=1995, REFERENCES=29, KEYWORDS="Cellular system; in; intelligent network; mobile radio; overview; signalling", ABSTRACT="The successful implementation of the intelligent network concept in mobile communications and UPT will bring true wireless PCS.Significant researh opportunities exist in this discipline ranging from access and assignment methods to handling real-time mobility and call-control services.", } @INPROCEEDINGS{Jaga95:Hierarchical, AUTHOR="S. Jagannath and Krishna Bala and M. Mihail", TITLE="Hierarchical design of {WDM} optical networks for {ATM} transport", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="2188-2194", YEAR=1995, REFERENCES=21, KEYWORDS="Atm; hierarchical network; network architecture; network design; wdm", ABSTRACT="In this work, a design methodology, a scheme for growth and an embedding algorithm, for building very large ATM networks over a wavelength-routed optical network layer are proposed. The overall design is multi-tiered and at each tier - subnetwork and internetwork - the WDM layer is acyclic, i.e. each and every optical path is terminated by a transmitter receiver pair. This prevents optical amplifier noise from recirculating in unterminated opti", } @INPROCEEDINGS{Jaga95:Clear, AUTHOR="S. Jagannath and Milan Kovacevic and A. S. Acampora", TITLE="Clear Channel Strategies for a Scalable Wide-Area Network", BOOKTITLE="SPIE All-Optical Communication Systems: Architecture, Control, and Network Issues", ISBN="0-8194-1978-8", ADDRESS="Bellingham, USA", PAGES="274-282", YEAR=1995, REFERENCES=7, KEYWORDS="Routing; wan", ABSTRACT="This work studies the use of wavelength translation in different Clear Channel setup strategies in a scalable all optical network. The network considered uses a Recursive Grid architecture representing the 100 largest cities and constituting of 561 access stations. As the network grows the grid is subdivided in a recursive fashion to accommodate more nodes, making the network modular. The algorithm used for routing of the calls is distributed.", } @ARTICLE{Jahr95:Realization, AUTHOR="O. Jahreis and O. Möller and Frowin Derr", TITLE="Realization of a Passive Broadband-Network Termination 1 {(B-NT1)} for the Optical User-Network Interface", JOURNAL=ett, ADDRESS="Italy", VOLUME=6, NUMBER=2, PAGES="171-179", YEAR=1995, REFERENCES=7, KEYWORDS="B-isdn; broadband; network; uni", ABSTRACT="A new passive Broadband Network Termination 1 (B-NT1) as an alternative to the active B-NT1 for B-ISDN is described which supervises the UB interface between B-LT and B-NT1. For this purpose, the B-LT generates an additional pseudo noise (PN-)signal which is reflected at the passive B-NT1 and analysed by a correlation method in the B-LT. The alarm flow between B-LT and the B-NT2 remains unchanged by introducing a new reflection alarm REFL in th", } @ARTICLE{Jain95:Auxiliary, AUTHOR="Raj Jain and Y. Lin", TITLE="An auxiliary user location strategy employing forwarding pointers to reduce network impacts of {PCS}", JOURNAL=wln, ISBN="1022-0038", VOLUME=1, NUMBER=2, PAGES="197-210", YEAR=1995, REFERENCES=21, KEYWORDS="Analysis; cellular system; mobile radio; performance evaluation", ABSTRACT="We propose an auxiliary strategy, called per-user forwarding, for locating users who move from place to place while using Personal Communications Services (PCS). The forwarding strategy augments the basic location strategy proposed in existing standards such as GSM and IS-41, with the objective of reducing network signalling and database loads in exchange for increased CPU processing and memory cost. The key observation behind forwarding is th", } @ARTICLE{Jeng95:Protocol, AUTHOR="H.-S. J. Jeng and Minkui Liu", TITLE="Protocol Conversion in Multimedia Networks: Simulation and Algorithm", JOURNAL="Simulation", VOLUME=64, NUMBER=1, PAGES="51-60", YEAR=1995, REFERENCES=15, KEYWORDS="Multimedia; protocol simulation; simulation", ABSTRACT="Out of recently proposed high speed networks such as DQDB, FDDI, ATM, etc, various issues have been examined to determine the most suitable type of backbone network for multimedia neworks. At this point in time, evaluations are still inconclusive. As a result, different high speed networks using different protocols will coexist in an integrated multimedia network in the near future. Like the traditional heterogeneous data networks, the inter-op", } @ARTICLE{Jens95:EM, AUTHOR="M. A. Jensen and Y. Rahmat-Samii", TITLE="{EM} Interaction of Handset Antennas and a Human in Personal Communications", JOURNAL=ieeeproc, VOLUME=83, NUMBER=1, PAGES="7-17", YEAR=1995, REFERENCES=18, KEYWORDS="Mobile radio; transmission", ABSTRACT="In personal communications, the electromagnetic interaction between handset-mounted antennas and the nearby biolobical tissue is a key consideration. This paper presents a thorough investigation of this antenna-tissue interaction using the finite-difference time-domain (FDTD) electomagnetic simulation approach with detailed models of real-life antennas on a transceiver handset. The monopol, side-mounted planar inverted F, top-mounted bent inver", } @ARTICLE{Jeon95:Contention, AUTHOR="H. B. Jeon and Chong Kwan Un", TITLE="Contention-Based Reservation Protocols in Multiwavelength Optical Networks with a Passive Star Topology", JOURNAL=ieeecom, VOLUME=43, NUMBER=11, PAGES="2794-2802", YEAR=1995, REFERENCES=20, KEYWORDS="Contention; optical lan; star network; wdm", ABSTRACT="In a multiwavelength optical network with tunable transceivers, an algorithm to make the transmitter and the receiver tuned to the same wavelength simultaneously is needed. This paper proposes contention-based reservation protocols using a separate control channel for multiwavelength optical networks with a passive star topology. First, we present a protocol which can be used in the network where the ratio of the end-to-end signal propagation d", } @INPROCEEDINGS{Jian95:Regular, AUTHOR="S. Jiang and T. E. Stern", TITLE="Regular Multicast Multihop Lightwave Networks", BOOKTITLE=infocom, ISBN="0-8186-6990-X", ADDRESS="Los Alamitos, California", PAGES="692-700", YEAR=1995, REFERENCES=17, KEYWORDS="Graph model; graph theory; multicast; multihop; optical switching; routing; routing algorithm", ABSTRACT={A class of multicast multihop lightwave networks is presented. These networks have a two-layered architecture, with the upper "logical layer" implemented electronically, and supported by an underlying "physical layer" implemented as a purely optical network. The unique feature studied here is that the logical topology has a regular multicast structure, which is created through the use of optical multicast in the physical layer. It is shown that}, } @INPROCEEDINGS{Jira95:NPN, AUTHOR="A. Jirachiefpattana and R. Lai", TITLE="An {NPN} System for {ESTELLE} Verification", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="435-440", YEAR=1995, REFERENCES=13, KEYWORDS="Estelle; petri net; verification", ABSTRACT="All of the ESTELLE verification tools impose some restrictions on the specifications to be verified: they use a subset of ESTELLE or restrict the complexity of the specifications that can be verified; or the specifications need to be in a variant of ESTELLE, rather than standard ESTELLE. We have developed an approach to verifying standard ESTELLE specifications by translating them into Numberical Petri Net (NPN) specifications. In this paper, w", } @INPROCEEDINGS{Joha95:Manageable, AUTHOR="S. Johansson", TITLE="A Manageable Optical Network; A Field Demonstration", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="851-854", YEAR=1995, REFERENCES=3, KEYWORDS="Cross connect; field trial; wdm", ABSTRACT="A demonstration of an optical wavelength routing network layer is carried out in the Stockholm Gigabit Network. The optical network layer is realized by OXCs and OADMs, which has been develeoped as network elements with appropriate control interface.", } @INPROCEEDINGS{Jour95:Gbit, AUTHOR="A. Jourdan and G. Soulage and S. Artigaud and H. Ort and et al", TITLE="10 Gbit/s all-optical multiwavelength transport and routing demonstrator including a reconfigurable wavelength reallocation module", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="633-636", YEAR=1995, REFERENCES=8, KEYWORDS="Field trial; reconfigurable network; wdm", } @ARTICLE{Kaba95:Bandwidth, AUTHOR="Mete Kabatepe and Kenneth Vastola", TITLE="Bandwidth allocation in fair distributed queue {(FDQ)} networks", JOURNAL=comcom, VOLUME=18, NUMBER=8, PAGES="527-536", YEAR=1995, REFERENCES=8, KEYWORDS="Bandwidth allocation; fairness; hslan; lan; man; network", ABSTRACT="Fair distributed queue (FDQ) is a high speed metropolitan area network. It has been shown that FDQ has fair throughput and delay characteristics and is a highly scalable protocol, in that its performance is little affected by growing network sizes and/or transmission speeds. In this paper, we focus on dividing the capacity arbitrarily among the active nodes. Under heavy load, this results in nodes achieving throughput rates equal to their alloc", } @ARTICLE{Kahi95:RookNet, AUTHOR="M. Kahima and R. Watanabe and R. Konuma and H. Inoue and Y. Shiraishi", TITLE="RookNet: A Rearrangeable Optical Network with High Speed Relay Processing", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="679-685", YEAR=1995, REFERENCES=10, KEYWORDS="Optical switching; technology; wdm", ABSTRACT="Various approaches on optical network systems using WDM technique have been proposed. It is difficult to make a scale of WDM network larger since a number of the optical wavelengths which can be used is limited. In order to make easily larger scale of network, multi-hop WDM network have been proposed. We have studied 2-hop network: RookNet which has simple routing algorithm and high network throughput. Nodes in RookNet are divided into row grou", } @INPROCEEDINGS{Kahn95:DT, AUTHOR="H. K. Kahng and Jongseung Park", TITLE="Performance analysis of {DT-WDMA} protocol", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="676-679", YEAR=1995, REFERENCES=14, KEYWORDS="Performance evaluation; wdm", ABSTRACT="We consider a passive star network with fixed transmitter and tunable receivers and the media access protocol, named dynamic time wavelength division multiaccess protocol (DT-WDMA), proposed by Chen, at al. It showed that DT-WDMA is relatively simple and outperforms any single channel network protocols. However, the performance showed mustly through computer simulation. In our study, analytic approach is used through modelling and mathematical", } @ARTICLE{Kaki95:Multichannel, AUTHOR="T. Kakinuma and S. Shikii and T. Yamaguchi and K. Yano", TITLE="Multichannel Optical Video Distribution System", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="33-38", YEAR=1995, REFERENCES=13, KEYWORDS="Network; technology", ABSTRACT="The configuration and features of a multichannel optical video distribution system, which frequency multiplexes multichannel AM/FM video signals and optically transmits the signals to subscriber homes, are discussed together with the test results. An EDFA, essential for the optical branching and amplifier unit of this system, was newly developed, and high output, low power consumption and miniaturization were implemented. These are also discuss", } @ARTICLE{Kao95:Image, AUTHOR="Shao-Kong Kao and B. Mukherjee", TITLE="Image transmission on the {DQDB} network", JOURNAL=comcom, VOLUME=18, NUMBER=7, PAGES="463-474", YEAR=1995, REFERENCES=9, KEYWORDS="Dqdb; image transfer; man", ABSTRACT="A new distributed queue dual bus (DQDB)-based protocol for the transmission of still images is proposed. The image encoding scheme assumed here is hierarchical encoding. DQDB queue-arbitrated (QA) slots are used for the transmission of image information. Although the paper focuses on image transmission, the protocol can be used for any other type of traffic whose data is hierarchically organized or leveloriented. The proposed protocol also acco", } @ARTICLE{Karo95:Efficient, AUTHOR="Mark Karol and Z. Liu and K. Y. Eng", TITLE="An efficient demand-assignment multiple access protocol for wireless packet {(ATM)} networks", JOURNAL="Wireless Networks, ACM-Press, Baltzer Science Publishers", ISBN="1022-0038", VOLUME=1, NUMBER=3, PAGES="267-279", YEAR=1995, REFERENCES=12, KEYWORDS="Atm; delay throughput characteristics; media access control; multiple access; multiple access channel; qos;satellite radio; access network", ABSTRACT="...we propose and study an efficient demand-assignment channel access protocol, which we call Distributed-Queueing Request Update Multiple Access (DQRUMA). The protocol can be used for a wide range of applications and geographic distances. Mobiles need to send requests to the base station only for packets that arrive to an empty buffer. For packets that arrive to a non-empty buffer, transmission requests are placed collision-free by piggybackin", } @INPROCEEDINGS{Kars95:Campus, AUTHOR="H. Karstensen and M. Honsberg and C. Hanke and J. Wieland and others", TITLE="Campus-Wide Optical Network with Fiber Ribbon Cables", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="170-173", YEAR=1995, REFERENCES=2, KEYWORDS="Lan; space division multiplex; wdm", ABSTRACT="Fiber ribbon based SDM systems are believed to be a much more economic solution for campus wide networks than a WDM system. Results are presented for a 12 channel system which support data transmission up to 24 Gbit/s.", } @ARTICLE{Karv95:Fair, AUTHOR="D. Karvelas and M. Papamichail and George C. Polyzos", TITLE="Fair {DQDB:} The Rotationg Slot Generator Scheme", JOURNAL=jhsn, VOLUME=4, NUMBER=3, PAGES="255-273", YEAR=1995, REFERENCES=11, KEYWORDS="Dqdb; man; priority; robustness", ABSTRACT="We introduce the Roating Slot Generator scheme for dual bus architectures, a medium access control protocol appropriate for high capacity Metropolitan Area Networks. This schme uses the looped bus architecture of the DQDB MAN, in which slot generation hardware is incorporated into all stations. ...", } @ARTICLE{Kash95:Research, AUTHOR="M. Kashima and Y. Nakahira and M. Hasegawa and M. Kawahara", TITLE="Research of Optical Network System of the Future", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="39-42", YEAR=1995, REFERENCES=4, KEYWORDS="Atm; lan; multihop; network; optical lan; optical switching; tdm; wdm", ABSTRACT="This paper reports the study on optical ATM switching nodes using high speed switching (by means of optical switches), optical wavelength division multiplexing LANs using WDM and optical path management technology in trunk networks.", } @ARTICLE{Kato95:Multi, AUTHOR="Y. Kato and T. L. Kunii and Y. Matsui and T. Kamijoh", TITLE="Multi-Wavelength Semiconductor Laser Array", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="93-96", YEAR=1995, REFERENCES=6, KEYWORDS="Network; technology", } @ARTICLE{Kawa95:Overload, AUTHOR="R. Kawahara and Takuya Asaka and S. Sumita", TITLE="Overload Control for the Intelligent Network and Its Analysis by Simulation", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="494-502", YEAR=1995, REFERENCES=10, KEYWORDS="In; intelligent network; overload control; simulation", ABSTRACT="This paper reports and overload control method for the Intelligent Network (IN). The IN, which is being investigated as a future communication network, facilitates both rapid introduction of new services and easy modification of existing services. In the IN, the call processing functions and data needed to achieve IN services are distributed over several nodes. Therefore, traffic demand for the various services may cause varying patterns of nod", } @ARTICLE{Keil95:Optische, AUTHOR="N. Keil", TITLE="Optische Schalter aus Kunststoff - Schl sselkomponenten in den Telekom-Netzen der Zukunft", JOURNAL="NTZ, VDE-Verlag", ISBN="0948-728X", ADDRESS="Germany", VOLUME=48, NUMBER=12, PAGES="36-41", YEAR=1995, LANGUAGE="German", REFERENCES=7, KEYWORDS="Optical switching; technology; wdm", ABSTRACT="Wichtige Funktionselemente innerhalb eines optisch transparenten Netzknotens sind Raumschalter, die die hochratigen Datensignale zielgerecht auf die gewählten Ausgangsfasern leiten. Am HHI wurde daher im Auftrag der Deutschen Telekom das weltweit erste mikroprozessorgesteuerte 4*4-Raumkoppelfeld in Polymertechnik entwickelt.", } @INPROCEEDINGS{Keil95:Rearrangeable, AUTHOR="N. Keil and H. H. Yao and C. Zawadzki and B. Strebel", TITLE="Rearrangeable Nonblocking Polymert Waveguide (4x4)-Switching-Matrix and its Application to Future {OFDM} Systems", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="240-243", YEAR=1995, REFERENCES=4, KEYWORDS="Optical switching; wdm", ABSTRACT="A rearrangeable nonblocking polymer waveguide (4x4)-switching matrix operating at 1550nm with a power consumption of as low as 30mW per single switch is described. Teh matrix consists of thermo-optic 2x2 directional-couplers.", } @ARTICLE{Kias95:Packet, AUTHOR="Kamran Kiasaleh", TITLE="Performance of Packet-Switched Fiber-Optic Frequency-Hopping Multiple-Access Networks", JOURNAL=ieeecom, VOLUME=43, NUMBER=7, PAGES="2241-2253", YEAR=1995, REFERENCES=35, KEYWORDS="Optical switching; packet switching; performance evaluation; reed-solomon code; tdm", ABSTRACT="A packet-switched frequency-hopping multiple-access (FO-FHMA) communication system based on bus topolgy is proposed and investigated. In this arrangement, access to the optical medium for the network subscribers is provided via frequency-hopping (FH). The proposed FH technique in this analysis takes advantage of the Reed-Solomon (RS) codes to encode information packets and, consequently, to combat possible burst errors at the receiver. At user", } @INPROCEEDINGS{Kihl95:Transient, AUTHOR="M. Kihl and C. Nyberg", TITLE="Transient and stationary investigations of overload control in Intelligent Networks", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="602-607", YEAR=1995, KEYWORDS="Congestion control; in; intelligent network; overload control; stationary process; transient behaviour", ABSTRACT="This paper deals with overload control algorithms which should make sure that throughput in an SCP is kept high, also under severe overload conditions. Overload control algorithms using Random admittance and Call gapping as throttling methods are examined. ... Without a proper exchange of load information between the SSPs and the SCP only efficiency can be achieved. to have fairness among the SSPs, exchange of load information is necessary.", } @INPROCEEDINGS{Kim95:K, AUTHOR="Byoung-Jo J. Kim and Harry Perros and A. Nilsson", TITLE="Performance analysis of a k-reliable multicast {ARQ} protocol", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="81-86", YEAR=1995, REFERENCES=9, KEYWORDS="Arq; multicast; performance evaluation", ABSTRACT="This paper presents a selective repeat multicasst ARQ protocol in which a message is considered to be successfully transmitted when a predefined number of acknowledgements (less than the number of all participating receivers) for the message is recieved. Analytical expressions for the maximum supportable throughput and the average number of receivers that receive a message correctly are derived. Numerical examples are provided to illustrate the", } @ARTICLE{Kim95:Simulation, AUTHOR="Jaehyung Kim", TITLE="Simulation Study of Delay Problems on Star-Coupled {WDM} Photonic Network", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="1646-1656", YEAR=1995, REFERENCES=25, KEYWORDS="Access protocol; star network; wdm; access network", ABSTRACT="This paper investigates the problems which inhibits the use of todays WDM networks. These are propagation delay, packet processing overhead, bit\&frame synchronization, and tuning latency. This paper examines the impact of the propagation delay on the performance of WDM protocols with variations in the number of channels, packet length and system size. ...", } @INPROCEEDINGS{Kim95:TRANSITION, AUTHOR="Kyu-han Kim and S. Simpson and D. Hutchison and A. W. Scott", TITLE="Transition to high speed networks {SuperJANET} experience", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", YEAR=1995, REFERENCES=10, KEYWORDS="Field trial; network", ABSTRACT="In this paper, the technological changes seen from a user perspective are addressed. A multimedia communication-based distance learning project on SuperJANET is introduced and the network performance measurements for this project are presented. These measurements suggest the employment of reservation protocol and packet scheduling. We also provide a mechanism for on-the-fly playback of continuous media.", } @ARTICLE{Klei95:Supercomputer, AUTHOR="L. Kleinrock and M. Gerla and N. Bambos and J. Cong and E. M. Gafni and others", TITLE="The Supercomputer Supernet: A Scalable Distributed Terabit Network", JOURNAL=jhsn, VOLUME=4, NUMBER=4, PAGES="407-424", YEAR=1995, REFERENCES=33, KEYWORDS="Interconnection network; network topology; wdm", ABSTRACT="... We describe a new network called the Supercomputer Supernet (SSN) that attempts to overcome interconnection problems by replacing the point-to-point links with a fiber optic interconnect system. The novel scheme employs asynchronous pipeline crossbar switches (APCS) used in parallel supercomputers to interconnect multi-channel WDM fiber optic links to an optical star (or tree) physical topology. WDM channels will be established between modu", } @ARTICLE{Koba95:GaAs, AUTHOR="Naoki. Kobayashi and M. Shikata and A. Nishino and T. Ushikubo", TITLE="GaAs High-speed {ICs} for 10 Gbit/s Optical Communication Systems", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="101-106", YEAR=1995, REFERENCES=7, KEYWORDS="Network; technology", } @ARTICLE{Kohn95:Spread, AUTHOR="R. Kohno and R. Meidan and L. B. Milstein", TITLE="Spread Spectrum Access Methods for Wireless Commmunications", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=33, NUMBER=1, PAGES="20-25", YEAR=1995, REFERENCES=42, KEYWORDS="Radio channel; spread spectrum", ABSTRACT="The authors present an overview of the characteristics of CDMA as it is currently being envisioned for use in wireless communications. There are many considerations in the design of such systems, and there are multiple designs being proposed.", } @ARTICLE{Komo95:Fiber, AUTHOR="A. Komori and M. Sakai and K. Kweon", TITLE="Fiber Optics Subscriber Loop Carrier System {(CT/RT)}", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="43-46", YEAR=1995, REFERENCES=4, KEYWORDS="Fiber optics; network; technology", ABSTRACT="The fiber optics subscriber loop carrier system (CT/RT) extends subscriber line terminals to remote areas utilizing optical subscriber loop multiplex transmission lines between switchboards and subscriber line terminals. This system was developed to contribute to the construction of optical subscriber networks for a multimedia society in the future, by promoting the introduction of optical fibers. Therefore, focus was placed on the economic asp", } @INPROCEEDINGS{Kouv95:Closed, AUTHOR="D. D. Kouvatsos and R. Fretwell", TITLE="Closed Form Performance Distributions of a Discrete Time {GI^G/D/1/N} Queue with Correlated Traffic", BOOKTITLE="Data Communications and their Performance: the Sixth IFIP WG6.3 Conference on Performance", ISBN="0-412-73250-5", ADDRESS="London, Great Britain", PAGES="141-161", YEAR=1995, REFERENCES=5, KEYWORDS="Atm; batch arrival; correlation; discrete time queue; distribution; multiplexer; performance evaluation;queue length; renewal process; single server; waiting time", ABSTRACT="A novel approach is applied to the study of a queue with general correlated traffic, in that the only features of the traffic which are taken into account are the usual measures of its correlation: the traffic is modelled as a batch renewal process. The batch renewal process is a precise tool for investigation into effects of correlation because it is the least biased choice of process which is completely determined by the infinite sets of meas", } @INPROCEEDINGS{Kova95:Electronic, AUTHOR="Milan Kovacevic and A. S. Acampora", TITLE="Electronic Wavelength Translation in Optical Networks", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="2182-2187", YEAR=1995, REFERENCES=7, KEYWORDS="Performance evaluation", ABSTRACT="In this paper we study the benefits of electronic (regenerative) wavelength translation in optical networks providing wavelength channel circuit-switching among users. The electronic translation means that an optical signal on one wavelength is converted to electronics and then converted again into an optical signal on another wavelength. A previous study has demonstrated that wavelength translation can significantly improve the performance of", } @ARTICLE{Kova95:New, AUTHOR="Milan Kovacevic and M. Gerla", TITLE="A New Optical Signal Routing Scheme for Linear Lightwave Networks", JOURNAL=ieeecom, VOLUME=43, NUMBER=12, PAGES="3004-3014", YEAR=1995, REFERENCES=11, KEYWORDS="Linear network; synchronization; tdm; tdma", ABSTRACT="In this paper we propose a new scheme for optical signal routing within linear lightwave network (LLN) subnets. LLN is a recently proposed fiber optic network which performs only linear operation on optical signals: power combining, splitting and possibly linear optical amplification. LLN can be partitioned into several subnets where each subnet is a tree providing full broadcast among all stations connected to it. We study the synchronization", } @TECHREPORT{Kova95:Behaviour, AUTHOR="A. Kovalyov", TITLE="On Behaviour Equivalence of Two Classes of Safe Petri Nets: Persistent and Conflict-Free Nets", TYPE="Berichte des Fachbereichs Informatik", INSTITUTION="Fachbereich Informatik der Universität Hamburg", ADDRESS="Hamburg, Germany", YEAR=1995, REFERENCES=10, KEYWORDS="Persistent; petri net; verification", } @TECHREPORT{Kova95:Good, AUTHOR="A. Kovalyov", TITLE="Good Behaviour in Extended Free Choice Nets", TYPE="Berichte des Fachbereichs Informatik", INSTITUTION="Fachbereich Informatik der Universität Hamburg", ADDRESS="Hamburg, Germany", YEAR=1995, REFERENCES=16, KEYWORDS="Algorithm; Petri net; protocol verification", } @INPROCEEDINGS{Krge95:Optical, AUTHOR="U. Kr ger and K. Kr ger and C. v.Helmolt and E. Pawlowski", TITLE="Optical frequency stabilisation scheme for an {OFDM} network based on widely spaced optical crossconnects", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="697-700", YEAR=1995, REFERENCES=6, KEYWORDS="Cross connect; optical switching; wdm", ABSTRACT="A frequency control scheme is introduced where within each transmitter its frequency is referenced to a silica based optical frequency discriminator, which in addition is locked to an absolute reference frequency. The described set-up is employed in an OFDM based opt. cross-connect-demonstrator (R2065; COBRA).", } @INPROCEEDINGS{Kuhl95:OFDM, AUTHOR="B. Kuhlow and P. Meißner and G. Teich and J. Vathke and G. Walf", TITLE="{OFDM} cross-connect with {3D} Free-space switching fabric", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="447-451", YEAR=1995, REFERENCES=18, KEYWORDS="Cross connect; optical switching; space division multiplex; technology; wdm", ABSTRACT="This paper outlines the implementation of a dense optical frequency division multiplexing cross-connect consisting of a frequency conversion stage with tunable frequency selective receivers and a 3D space switching fabric using free-space interconnects. Anticipating future network demands, a demonstrator has been built to explore the feasibility of key components at 1.5 µm wavelength. Performance, design aspects and functionality of developed p", } @INPROCEEDINGS{Kuis95:Network, AUTHOR="E. Kuisch and H. Hegeman and Toon Norp", TITLE="Network aspects of {UMTS}", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="421-425", YEAR=1995, REFERENCES=10, KEYWORDS="B-isdn; in; intelligent network", ABSTRACT="This paper presents R\&D achievements regarding 3rd generation mobild systems. It addresses network aspects relevant to UMTS, the Universal Mobile Telecommunications Systems, with special emphasis on the relation of UMTS to IN and B-ISDN developments. The work on which the paper is based forms a part of the RACE II MONET project, in which the authors are working. However, the views expressed are those of the authors, and do not necessarily repre", } @ARTICLE{Kuma95:Access, AUTHOR="Lakshmana Kumar and Andreas Bovopoulos", TITLE="Access protection solution for heavy load unfairness in {DQDB}", JOURNAL=comcom, VOLUME=18, NUMBER=12, PAGES="896-910", YEAR=1995, REFERENCES=23, KEYWORDS="Dqdb; fairness; man", ABSTRACT="This paper discusses the unfairness issue arising in an 802.6 DQDB network at heavy loads - when traffic demand exceeds bus capacity. At heavy loads, the end-nodes along a bus experience long delays than the other nodes. The origin and remedy of ths heavy load unfairness are discussed. Using the information about the node population and the position of individual nodes, an effective access protection scheme (APS) is formulated to counter the he", } @INPROCEEDINGS{Kung95:Open, AUTHOR="Roberto Kung", TITLE="Open Networking: is it technically possible?", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="212-216", YEAR=1995, REFERENCES=3, KEYWORDS="Intelligent network; open network", ABSTRACT="No serious study on open networking has been achieved up to now. This is not acceptable while many regulatory bodies are considering such possibility. This paper is a first attempt to identify technical aspects related to open networking: - Third parties should be able to develop their services independently from other third-party services without service-interaction problems. Unresolved service interaction problems may endanger network integri", } @ARTICLE{Kuni95:Wavelength, AUTHOR="T. L. Kunii and Hiromi Wada and Y. Matsui and T. Kamijoh", TITLE="Wavelength Tunable Light Source", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="89-92", YEAR=1995, REFERENCES=5, KEYWORDS="Network; technology", ABSTRACT="We developed a multi-electrode DBR laser as a light source which can select and control lasing wavelengths. This laser has 2 types of wavelength tuning methods: current injection to passive waveguide and temperature control using a thin film heater. We compared and examined both methods in terms of tuning range, spectral linewidth and tuning speed.", } @ARTICLE{Kuo95:ALOHA, AUTHOR="F. F. Kuo", TITLE="The {ALOHA} System", JOURNAL="ACM Computer Communications Review", VOLUME=25, NUMBER=1, PAGES="41-44", YEAR=1995, KEYWORDS="Aloha", ABSTRACT="Overview about the roots of ALOHA", } @INPROCEEDINGS{Kuro95:Optical, AUTHOR="S. Kuroyanagi and K. Hironishi and T. Maeda", TITLE="Optical Cross-Connect Architecture Using Free-Space Optical Switches Based on {PI-LOSS} Topology", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="2112-2117", YEAR=1995, REFERENCES=21, KEYWORDS="Cross connect; optical switching; technology", ABSTRACT="We propose an OXC architecture, incorporating failure restoration based on reserved wavelengths, which consists of a routing block and bypass block. We compare the number of required optical devices in our structure with a conventional structure. We also propose a polarization controlled free-space switch based on path-independent insertion loss (PI-LOSS) topology, adopt it to the routing block, and demonstrate a 4x4 prototype free-space switch", } @INPROCEEDINGS{Kwia95:Modelling, AUTHOR="M. Kwiatkowski", TITLE="Performance modelling of {UPT} networks", BOOKTITLE="4th IEEE International Conference on Universal Personal Communications (ICUPC)", ADDRESS="Tokio, Japan", YEAR=1995, KEYWORDS="Intelligent network; mobile radio; modeling", ABSTRACT="A general modelling framework for steady state performance analysis of Universal Personal Telecommunications (UPT) services in a multinetwork environment is presented in this paper. The investigated performance measures are related to Service Control points (SCPs) and databases. The proposed framework enables the modelling of UPT services described in the ITU Draft Rec. Q.76. This framework consideres the presence of UPT and non-UPT users in a", } @ARTICLE{Lai95:Simulation, AUTHOR="R. Lai and Xiao Li", TITLE="Simulation and Verification of Protocol Using Deductive Machine", JOURNAL="Simulation", VOLUME=65, NUMBER=5, YEAR=1995, REFERENCES=12, KEYWORDS="Formal technique; protocol; simulation; verification", ABSTRACT="This paper describes the technique of simulating and verifying communication protocols using a computer-aided tool, called Deductive Machine, which implements some verification theories that are based on Deductive Systems. The merit of using Deductive Machine is that it simulates the execution of a protocol and at the same time verifies the protocol against certain properties by observing the outcome of the execution. ...", } @INPROCEEDINGS{Laso95:Behaviour, AUTHOR="A. Lason", TITLE="Behaviour of {FDDI} Networks Under Heavy Synchronous Loads", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="128-131", YEAR=1995, REFERENCES=13, KEYWORDS="Fddi; hslan; lan", ABSTRACT="The paper presents simulation results for a FDDI network which is loaded with synchronous traffic like MPEG. It is shown taht a heavy load of one selected node causes the unfair behaviour of the network. The mean access delay for asynchonous frames generated by teh successor of the overloaded station is much higher thatn the others ones.", } @BOOK{Lawn95:Modellierung, AUTHOR="D. Lawniczak", TITLE="Modellierung und Bewertung der Datenverwaltungskonzepte in {UMTS}", ISBN="3-86073-381-8", PUBLISHER="Aachener Beitrge zur Mobil- und Telekommunikation, Verl. der Augustinus Buchhandlung, Diss., RWTH Aach", ADDRESS="Aachen, Germany", YEAR=1995, LANGUAGE="German", KEYWORDS="Mobile radio; modeling; performance evaluation", } @INPROCEEDINGS{Leco95:Value, AUTHOR="A. Leconte and B. E. Christensen and S. Cannon and V. Francavilla", TITLE={{"IN} value added" - the role of the {IP/SN} in {IN} and Multimedia Applications}, BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="206-210", YEAR=1995, KEYWORDS="Broadband; in; intelligent network; multimedia", ABSTRACT="In order to enhance their competitive position in an ever more deregulated environment, network operators have already or are in the process of introducing Intelligent Networks in their networks. By doing so, their goal is to add value to more traditional telecommunication services, mainly voice telephony services. Network operators see IN as a mean to increase the value of the services offered to their end users and to their larger Service Sub", } @ARTICLE{Lee95:Asynchronous, AUTHOR="John Lee and Chong Kwan Un", TITLE="Asynchronous reservation protocol for variable-sized messages in a {WDM-based} local network", JOURNAL=comcom, VOLUME=18, NUMBER=12, PAGES="880-888", YEAR=1995, REFERENCES=19, KEYWORDS="Optical lan; star network; variable packet length; wdm", ABSTRACT="In this paper, we propose and analyse an asynchronous reservation protocol for a very high-speed optical LAN using a passive star topology. Each node is equipped with a single tunable transmitter and a single tunable receiver, both of which are tunable over a range of wavelengths. A seperate channel, called the control channel, is used to coordinate message transmission on the other channels, called data channels. We consider random and idle se", } @INPROCEEDINGS{Lee95:Synchronous, AUTHOR="John Lee and Chong Kwan Un", TITLE="Synchronous Reservation Protocol for Variable-sized Messages in {WDM} Networks", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="2210-2214", YEAR=1995, REFERENCES=12, KEYWORDS="Access protocol; network protocol; star network; wdm", ABSTRACT="In this paper we propose a synchronous reservation protocol that is efficient for supporting variable-sized messages in a WDM - based local network using a passive star topology. A control channel is used to coordinate transmissions on data channels. Time is slotted with fixed-sized slots. The network can accommodate a variable number of nodes, and can operate independently of the change of the number of nodes....", } @INPROCEEDINGS{Lee95:Optimization, AUTHOR="K. Y. Lee and V. Li", TITLE="Optimization of a {WDM} Optical Packet Switch with Wavelength Converters", BOOKTITLE=infocom, ISBN="0-8186-6990-X", ADDRESS="Los Alamitos, California", PAGES="423-430", YEAR=1995, REFERENCES=8, KEYWORDS="Blocking; packet switching; tdm; wdm", ABSTRACT="This paper investigates a WDM optical packet switch with wavelength converters which can shift optical packtes to any wavelength of their destined outbound links. Wavelength conversion can reduce packet dropping probability due to wavelength contentions. However, not all the packets need conversion, and hence conversion should be optimized to reduce the number of converters and improve the quality of signal by reducing unnecessary conversion. W", } @ARTICLE{Lee95:Multi, AUTHOR="K. Y. Lee and V. Li and Sun-Young Hwang and A. E. Willner", TITLE="Multi-Wavelength All-Optical Networks with Wavelengths Outside the Erbium-Doped Fiber Amplifier Bandwidth", JOURNAL=ieeejlt, VOLUME=13, NUMBER=5, PAGES="791-801", YEAR=1995, REFERENCES=9, KEYWORDS="Network architecture; network design; network planning; routing; routing algorithm; technology; transmission; transparency; wdm", ABSTRACT="EDFAs have become the dominating technology for signal amplification in all-optical networks. One constraint of EDFAs is that they have a much narrower bandwidth compared to the low-loss region of optical fiber. Instead of using only wavelengths within the bandwidth of EDFAs (i.e. the inband channels) for communication, we propose to include wavelengths outside the EDFA bandwidth (i.e. the outband channels) as well in order to incrtease the num", } @ARTICLE{Lee95:Space, AUTHOR="Whay Lee and Pierre A. Humblet", TITLE="Space-Time Characteristics of {ALOHA} Protocols in High-Speed Bidirectional Bus Networks", JOURNAL=ieanep, VOLUME=3, NUMBER=5, PAGES="613-622", YEAR=1995, LANGUAGE="English", REFERENCES=23, KEYWORDS="Aloha; bus; hslan; media access control", ABSTRACT="We study the pace-time characteristics of ALOHA multiple-access protocols in bidirectional bus networks where transmissions are in the form of packets of constant length.", } @ARTICLE{Lela95:Slef, AUTHOR="Will Leland and M. S. Taqqu and W. Willinger and Daniel H. Wilson", TITLE="On the Self-Similar Nature of Ethernet Traffic", JOURNAL=ccr, VOLUME=25, NUMBER=1, PAGES="202-213", YEAR=1995, REFERENCES=24, KEYWORDS="Ethernet; LAN; measurement; traffic measurement", ABSTRACT={We demonstrate that Ethernet local area network (LAN) traffic is sttistically self-similar, that none of the commonly used traffic models is able to capture thsi fractal behavior, and that such behavior has serious implications for the design, control, and analysis of high-speed, cell-based networks. Intuitively, the critical characteristic of ths self-similar traffic is that there is no natural length of a "burst": at every time scale ranging}, } @ARTICLE{Li95:Bandwidth, AUTHOR="B. Li", TITLE="Bandwidth management for high speed {LANs} using wavelength division multiplexing", JOURNAL=comcom, VOLUME=18, NUMBER=8, PAGES="572-581", YEAR=1995, REFERENCES=34, KEYWORDS="Bandwidth allocation; comparison; hslan; media access control; optical lan; random access; wdm", ABSTRACT="The objectives of this paper are twofold: (1) to demonstrate key trade-offs in the design of such a protocol, through close examination of some existing proposals; (2) to advocate the application of recent development of optical components in the WDM networks, in particular transmitters and receivers with a very fast tuning speed but very limited tuning range.", } @INPROCEEDINGS{Li95:Novel, AUTHOR="B. Li and A. Ganz and C. M. Krishna", TITLE="A Novel Transmission Coordination Scheme for Single Hop Lightwave Networks", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="1784-1788", YEAR=1995, REFERENCES=10, KEYWORDS="Access protocol; media access control; wdm", ABSTRACT="This paper introduces a novel transmission coordination protocol for single hop lightwave networks based on the WDM star topology. The novel feature of this algorithm is the use of a passive listening mechanism (in-band signalling) to obtain status information regarding the network channels. The protocol is adaptive, allowing for flexible assignment of bandwidth. It is especially useful when loads and traffic distribution change with time.", } @INPROCEEDINGS{Li95:Channel, AUTHOR="B. Li and Krishna M. Sivalingam", TITLE="Channel Access Protocols for High Speed {LANs} Using {WDM:} A Comparative Study", BOOKTITLE="SPIE All-Optical Communication Systems: Architecture, Control, and Network Issues", ISBN="0-8194-1978-8", ADDRESS="Bellingham, USA", PAGES="283-294", YEAR=1995, REFERENCES=67, KEYWORDS="Access control; access protocol; control channel; lan; media access control; multiple access; overview; protocol; protocol performance; wdm", ABSTRACT="There have been many access protocal proposed for WDM networks including quite a few proposals that require many more channels than the number of nodes. The practical device characteristics impose an upper limit on the number of available WDM channels. Our focus in this paer is on systems with many nodes and small number of channels. We study the use of in-band signaling mechnosm compared to the separate control channel (out-band signaling) app", } @ARTICLE{Li95:Wavelength, AUTHOR="V. Li and A. E. Willner and P. D. Dapkus and K. Y. Lee and others", TITLE="Wavelength Conversion and Wavelength Routing for High-Efficiency All-Optical Networks: A Proposal for Research on All-Optical Networks", JOURNAL=jhsn, VOLUME=4, NUMBER=1, PAGES="5-25", YEAR=1995, REFERENCES=31, KEYWORDS="Optical switching; wdm", ABSTRACT="This paper summarizes a proposal of research on all-optical networks submitted to the U.S. NSF in 1993. The objective is to explore the possible architectures, routing protocols, and system and device implementations for the metropolitan-area or wide-area wavelength division multiplexing all-optical networks. The basic idea is to dramatically enhance the efficiency and throughput of such a WDM all-optical network by using wavelength conversion", } @ARTICLE{Lind95:ViewStation, AUTHOR="Christopher J. Lindblad and David Wetherall and William F. Stasior and et al", TITLE="ViewStation Applications: Implication for Network Traffic", JOURNAL=ieeejsac, VOLUME=13, NUMBER=5, PAGES="768-778", YEAR=1995, REFERENCES=21, KEYWORDS="Multimedia; traffic analysis; traffic engineering; traffic measurement; traffic model; traffic parameter; traffic pattern", ABSTRACT="This paper describes applications built on the View-Station, a distributed multimedia system based on Unix workstations and a gigabit per second local area network. A key tenet of the ViewStation project is the delivery of media data not just to the desktop but all the way to the application program. As processing power continues to improve, our approach enables applications that perform intensive processing of audio and video data. We hypothes", } @INPROCEEDINGS{Lsch95:Potential, AUTHOR="K. Lösch", TITLE="Potential and Implementation of Optical Technologies for High Bitrate Short Distance interconnects", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="165-171", YEAR=1995, REFERENCES=19, KEYWORDS="Atm; cross connect", ABSTRACT="Using cross-connects and switching systems in applications with high internal data rates, technical and economic constraints will be derived which require completely new approaches. Technical solutions and implementation strategies will be discussed.", } @BOOK{Lyu95:Software, AUTHOR="M. R. Lyu", TITLE="Software Fault Tolerance", ISBN="0-471-95068-8", PUBLISHER="Trends in Software (3), Wiley \& Sons", YEAR=1995, KEYWORDS="Fault tolerance; software", ABSTRACT="Fault Tollerance Techniques are an accepted practice in many engineering disciplines. For software construction, the concept is particularly relevant and can mean the difference between total and irretrievable loss of data, funds, or ultimately life (...), as opposed to the worst case of a partial or temporary systems failure.", } @ARTICLE{MA95:Approximation, AUTHOR="B. L. A. and J. W. Mark", TITLE="Approximation of the Mean Queue Length of an M/G/c Queueing System", JOURNAL=or, VOLUME=43, NUMBER=1, PAGES="158-165", YEAR=1995, LANGUAGE="english", REFERENCES=15, KEYWORDS="Approximation; m/g/n; multiserver; queue length; queueing system", ABSTRACT="A relatively robust method for the approximate analysis of the mean queue length of an M/G/c queueing system is proposed. The approximation method is developed based on the following assumptions: the residual service time of one busy server is independent of those of the other busy servers, and the system in which all the servers are busy is treated in the same way as a single-server system with c times the rate of one of the servers. The appli", } @ARTICLE{Mach95:G, AUTHOR="F. Machihara", TITLE="A {G/SM/1} Queue with Vacations Depending on Service Times", JOURNAL="Communications in Statistics - Stochastic Models", VOLUME=11, NUMBER=4, PAGES="671-690", YEAR=1995, REFERENCES=29, KEYWORDS="Decomposition; distribution; map; phase-type model; queue length; queueing system; semi markov process; vacation system; virtual waiting time; waiting time", ABSTRACT="We study a G/SM/1 queue with exhaustive service and multiple vacations. The arrival process is phase type Markov renewal and independent of the service and vacation process. The service process is semi-Markovian and may depend on the lengths of the vacations. The distributions of the virtual and the actual waiting times as well as the queue length distributions at an arbitrary time, at arrivals, and at departures are derived. In addition, we st", } @ARTICLE{Maed95:Erbium, AUTHOR="H. Maeda and S. Shikii and A. Ishii and S. Aoki", TITLE="Erbium-doped Fiber Amplifier Technology for Long-Haul Systems", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="5-10", YEAR=1995, REFERENCES=11, KEYWORDS="Fiber optics; network; technology", ABSTRACT="A means was investigated by simulation to realize low noise in erbium-doped fiber amplifiers applied to long-haul systems, and a prospect for practical application was obtained. The flattening of gain characteristics was sought in order to make the system broadband.. Further, a microprocessor was introduced and a complete monitor alarm and control function, and automatic adjustment function were devised.", } @INPROCEEDINGS{Maka95:Object, AUTHOR="B. Makarevitch", TITLE="An Object-based Model of the Service Control Function", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="183-188", YEAR=1995, REFERENCES=7, KEYWORDS="In; intelligent network; sdl", ABSTRACT="The paper presents an object-based model of the Intelligent Network functional entity Service Control Function. The Service Control Function is decomposed in the model into two layers: Service Logics Layer and Service Components Layer. Service components are run-time objects which execute generic operations on request from service logics. Furthermore, they resolve interactions between multiple service logics executed within the same call contex", } @BOOK{Malo95:Microprocessor, AUTHOR="M. S. Malone", TITLE="The Microprocessor: A Biography", ISBN="0-387-94342-0", PUBLISHER="The Electronic Library of Science, Springer, TELOS", YEAR=1995, KEYWORDS="Hardware; history; microprocessor; overview; technology", } @ARTICLE{Mand95:Importance, AUTHOR="N. B. Mandayam", TITLE="Importance Sampling for Analysis of Direct Detection Optical Communication Systems", JOURNAL=ieeecom, VOLUME=43, NUMBER=2, PAGES="229-239", YEAR=1995, REFERENCES=24, KEYWORDS="Cdma; fiber optics; simulation", ABSTRACT={We apply an Importance Sampling technique to estimate the poerformance of direct detection optical systems, where the "gain" of Importance Sampling over Monte Carlo simulations is shown to increase linearly with the system performance.}, } @INPROCEEDINGS{Marq95:Description, AUTHOR="Doug Marquis and D. M. Castagnozzi and B. R. Hemenway and others", TITLE="Description of All-Optical Network Testbed and Applications", BOOKTITLE="SPIE All-Optical Communication Systems: Architecture, Control, and Network Issues", ISBN="0-8194-1978-8", ADDRESS="Bellingham, USA", PAGES="44-52", YEAR=1995, REFERENCES=4, KEYWORDS="Application; field trial; wdm", ABSTRACT="We describe an all-optical network testbed deployed in the Boston metropolitan area, and some of the experimental applications running over the network. The network is an optical WDM system organized as a hierarchy consisting of local, metropolitan, and wide area nodes that support optical broadcast and routing modes. The network was developed by a consortium of AT\&T, DEC, and MIT.", } @ARTICLE{Mars95:Square, AUTHOR="Marco {Ajmone Marsan} and G. Albertengo and Emilio Leonardi and F. Neri", TITLE="Square Grid Topologies for Wavelength-Routing All-Optical Networks", JOURNAL=jhsn, VOLUME=4, NUMBER=4, PAGES="385-406", YEAR=1995, REFERENCES=21, KEYWORDS="Grid structure; network architecture; network topology; wdm", ABSTRACT="The paper explores the possibility of adopting square lattice regular topologies for the implementation of wavelength-routing all-optical communication networks. Similar topologies were previously proposed for the implementation of interconnection networks in high-performance computing systems, as well as high-speed electronic networks (Manhattan Street networks). The very limited processing capabilities presently allowed by optical technologie", } @INPROCEEDINGS{Mars95:Access, AUTHOR="Marco {Ajmone Marsan} and A. Bianco and A. Fumagalli and E. G. Abos and others", TITLE="Access Protocols for All-Optical {WDM} Multichannel Rings With Switched Delay Lines and Tunable Transmitters and Receivers", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="200-203", YEAR=1995, REFERENCES=8, KEYWORDS="Access protocol; ring network; transparency; wdm", ABSTRACT="Access protocols dealing with packet collision and receiver contention in WDM slotted ring networks are presented. The nodes are equipped with one tunable transmitter, one tunable receiver a number of delay lines and optical switches and a FIFO queue. Several new access strategies based on local status information are described and compared with those proposed for networks where only a fixed transmitter is available inside nodes, taking probabi", } @INPROCEEDINGS{Mars95:Global, AUTHOR="Marco {Ajmone Marsan} and Claudio E. Casetti and M. Favre and F. Neri", TITLE="The Global Fairness Algorithms for the {CRMA-II} Mac Protocol", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="161-164", YEAR=1995, REFERENCES=5, KEYWORDS="Crma; fairness; hslan; man", ABSTRACT={Simulation is used to investigate the dynamic behavior of the "global fairness" algorithms proposed for CRMA-II, where a scheduler tries to equalize the usage of network resources by all stations over a very long (ideally infinite) time span. Our results indicate that too strictly enforcing global fairness may result in undesirable short term and long-term behaviors. However, when we consider that guaranteeing global fairness is impossible due}, } @ARTICLE{Mars95:Classical, AUTHOR="G. D. Marshall", TITLE="Classical {IP} Over {ATM:} A Status Report", JOURNAL=datacommunications, PAGES="103-110", YEAR=1995, KEYWORDS="Atm; internetworking; standard", ABSTRACT="Now that the ATM Forum and the Internet Engineering Taskforce (IETF) have completed work on key interoperability specifications, ATM products complying with those specs are becoming available. That means ATM is starting to be used in production LANs and networks.", } @INPROCEEDINGS{Mase95:ATMOS, AUTHOR="F. Masetti and J. Benoit and P. Daele and H. Melchior and et al.", TITLE="{ATMOS} {(ATM} Optical Switching): Results and Conclusions of the {RACE} {R2039} Project", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="645-652", YEAR=1995, KEYWORDS="Atm; field trial; optical switching; wdm", } @ARTICLE{Mats95:Delay, AUTHOR="Y. Matsumoto", TITLE="Delay Analysis of Unidirectional Fiber-Optic Bus Networks", JOURNAL=ieeecom, VOLUME=43, NUMBER=2, PAGES="445-456", YEAR=1995, KEYWORDS="Bus; delay analysis; dqdb", ABSTRACT="In this paper we consider the pi-persistent protocol used in unidirectional fiber-optic bus networks and present a novel approximation method to evaluate the packet delay. First we model each station as a Geo/SBP/1 queueing system with pi-persistence and carry out an exact analysis. To take into account the correlation of occupied slots floating from upstream, we use the Switched Bernoulli Process (SBP) with two states for the service process.", } @INPROCEEDINGS{Mats95:Electronics, AUTHOR="T. Matsunaga and S. Hino and Ken-ichi Yukimatsu", TITLE="Electronics and Photonics in High-Speed {ATM} Switching", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="173-180", YEAR=1995, REFERENCES=10, KEYWORDS="Atm; optical switching; wdm", ABSTRACT="Two approaches are described for achieving high-speed and/or high throughput ATM switching systems for future ATM networks. One is electronic LSI-based switching and the other is FDM based photonic switching.", } @INPROCEEDINGS{Mats95:CLASSIFIED, AUTHOR="Shinji. Matsuoka and N. Kawase and Yoshiaki. Yamabayashi and Y. Kobayashi", TITLE="{CLASSIFIED} {PATH} {RESTORATION} {SCHEME} {WITH} {HITLESS} {PROTECTION} {SWITCHING} {FOR} {LARGE-CAPACITY} {TRUNK} {TRANSMISSION} {NETWORKS}", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="941-945", YEAR=1995, REFERENCES=8, KEYWORDS="Atm; protection; self healing network", ABSTRACT="For large-capacity trunk transmission networks, a path restoration scheme is proposed that has several path-classes with different self-healing grades. The proposed scheme is useful for lightening the burden imposed on VP-based ATM trunk networks. To realize the most highly-reliable restoration class, we apply a route diversity hitless protection switching initiated by parity error detection. We also discuss the improvement of bit error rate pe", } @INPROCEEDINGS{Maye95:Local, AUTHOR="Alain Mayer and Y. Ofek and M. Yung", TITLE="Local Fairness in General-Topology Networks with Convergence Routing", BOOKTITLE=infocom, ISBN="0-8186-6990-X", ADDRESS="Los Alamitos, California", PAGES="891-899", YEAR=1995, REFERENCES=11, KEYWORDS="Fairness; MAN; routing", ABSTRACT="Convergence routing is a unique variant of deflection routing which ensures that packets (or cells) will converge to their destinations along a global sense of direction. In this work we show how a global sense of direction can be used in an arbitrary network for the design of a control algorithm which (a) ensures fair access in switch-based local area networks, (b) is efficient with respect to performance measures we have developed, and (c) is easily interfaced to the convergence routing mechanism. We present performance measures which assess the new access- and flow-control algorithm: (i) Locality - only the sub-network containing conflicting traffic streams gets involved in the fairness regulation. (ii) Scalability - the data-structure sizes used in the algorithm are a function of the switching node degree, and uses constant space control signals of only 2-bit (the ATM standard, for example, dedicates four bits in the header of each cell to generic flow-control). (iii) Linear access-time measured by the maximal clique in the conflict-graph to which a node belongs, and a frequency which is inverse linear in this parameter (when the traffic pattern stabilizes).", } @ARTICLE{Medh95:Digital, AUTHOR="D. Medhi and Appie de Liefvoort and C. S. Reece", TITLE="Performance Analysis of a Digital Link with Heterogeneous Multislot Traffic", JOURNAL=ieeecom, VOLUME=43, NUMBER=2, PAGES="968-976", YEAR=1995, REFERENCES=23, KEYWORDS="Multi-service loss network; matrix exponential distribution; queuing analysis", ABSTRACT="We present a unified model to compute various performance measures when Poissian and non-Poissian (renewal) multi-slot traffic streams are offered to a digital link in a (double) loss system. We represent the non-Poissonian arrival process by a matrix-exponential distribution, requiring only that the inter-arrival distribution has a rational Laplace transform. Several distributions are considered as the non-Poissonian traffic. The resulting model uses matrix algebraic techniques only, thus not requiring any complex and/or tedious transform techniques. We also incorporate various control policies in our modeling framework using acceptance functions. Through our computational studies, we conclude that the second and the third moments of the non-Poissonian traffic have significant impact on various performance measures.", URL="http://www.cstp.umkc.edu/~dmedhi/abs/mlr\_tcomm\_95\_abs.html", } @INPROCEEDINGS{Mell95:Stream, AUTHOR="J. Mellor and Kenneth R. Grant and N. Tiles and D. Nyong", TITLE="Stream Relay Switching {LAN} Node", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="116-119", YEAR=1995, REFERENCES=22, KEYWORDS="Lan; stream traffic; switching", ABSTRACT="Nodal architectures and control mechanisms are under study to provide a local area network using switching technology that is compatible with the asynchronous transfer mode. Links to the wide area establish it as part of the local access to the Broadband ISDN. The switch control mechanism will relay streams of information between the locally connected users.", } @ARTICLE{Meyr95:Advanced, AUTHOR="Heinrich Meyr and R. K. Subramanian", TITLE="Advanced Digital Receiver Principles and Technologies for {PCS}", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=33, NUMBER=3, PAGES="68-78", YEAR=1995, REFERENCES=44, KEYWORDS="Digital transmission; technology", ABSTRACT="The synergy between digital radio communications and VLSI signal processing is revolutionizing the design of wireless terminals. Driving this synergy are certain fundamental paradigms in modern communication theory, digital signal processing, and VLSI design.", } @ARTICLE{Miki95:Time, AUTHOR="N. Miki and K. Kumozaki", TITLE="Time Division Multiple Access Protocol for a Fiber-Optic Passive Double Star Transport System", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="995-1001", YEAR=1995, REFERENCES=9, KEYWORDS="Access protocol; fiber optics; media access control; star network; tdma; access network", ABSTRACT="This paper describes a flexible point-to-multipoint access protocol for the fiber-optic passive double star (PDS) system. To provide various types of services, and permit flexibility in changing transport capacity, a time division multiple-access (TDMA) scheme for the PDS system is considered. Dynamic time slot multiplexing based on TDMA is proposed to provide required time slots efficiently according to service changes. The effectiveness of dy", } @INPROCEEDINGS{Miki95:Optical, AUTHOR="T. Miki", TITLE="Optical Network Development towards Multimedia Information Era", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="11-18", YEAR=1995, KEYWORDS="Network evolution; tutorial", } @PROCEEDINGS{Mizu95:Proceedings, TITLE="7th {IFIP} {WG} 6.1 international workshop on protocol text systems", EDITOR="T. Mizuno and T. Higashino", ISBN="0-412-71160-5", PUBLISHER="Chapman \& Hall", ADDRESS="London, Great Britain", YEAR=1995, KEYWORDS="Protocol; protocol testing; testing", } @INPROCEEDINGS{Modi95:Dynamic, AUTHOR="E. Modiano", TITLE="A Dynamic Adaptive Multi-receiver Random Access Protocol for the Code Division Multiple Access Channel", BOOKTITLE=pmrc, ISBN="0-7803-3002-1/9", PAGES="799-803", YEAR=1995, REFERENCES=5, KEYWORDS="Aloha; cdma; media access control", ABSTRACT="In this paper we present a packet multiple access protocol that is a hybrid of a pure CDMA protocol and an ALOHA random access protocol. ...", } @BOOK{Moes95:Object, AUTHOR="H. Moessenboeck", TITLE="Object-Oriented Programming in Oberon-2", ISBN="3-540-60062-0", PUBLISHER="Springer", ADDRESS="Berlin, Germany", YEAR=1995, REFERENCES=33, KEYWORDS="Object-oriented programming; programming; programming language", } @ARTICLE{Moh95:Prioritized, AUTHOR="W. M. Moh and Y.-C. Chien and T.-S. Moh and C. U. Martel", TITLE="Prioritized Conflict Resolution on Multiple Access Broadcast Networks: Algorithms and Performance", JOURNAL="Computer Systems Science and Engineering", VOLUME=10, NUMBER=4, PAGES="234-243", YEAR=1995, REFERENCES=23, KEYWORDS="Algorithm; collision resolution; lan; media access control; performance evaluation; priority; tdma", ABSTRACT="In a multiple access broadcast network all network nodes share a single shared communication channel, and there is the possibility of a collision when two or more nodes transmit at overlapping times. A prioritized conflict resolution algorithm is one which, when a collision occurs, all colliding messages are retransmitted according to their priority. We first propose PCR-CMS, a prioritized conflict resolution algorithm using control minislots.", } @INPROCEEDINGS{Moha95:Service, AUTHOR="O. E. Moharram", TITLE="Service and Resource Maintenance Management for Intelligent Networks", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="420-424", YEAR=1995, REFERENCES=6, KEYWORDS="Network management", ABSTRACT="Initial implementations of intelligent networks (INs) are being developed in various operating companies. It is anticipated that operations systems (OSs) support for the initial IN features deployment will be limited; therefore issues related to the implementation and maintenance of IN services need to be addressed. In this paper we address the service switching point (SSP) function that will be needed to support INs deployment, and identify th", } @INPROCEEDINGS{Naga95:ARCHITECTURE, AUTHOR="T. Nagata and K. Sezaki and Y. Yasuda", TITLE="A non-blocking architecture of wavelength division multiplexing photonic switching network", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="2215-2219", YEAR=1995, REFERENCES=11, KEYWORDS="Cost; optical switching; performance evaluation; wdm", ABSTRACT="This paper studies the non-blocking condition of a proposed photonic switching network which adopts WDM. It is a continuation of our previous study in which we developed the non-blocking condition of the Generalized Parallel Delta Network (GPDN) proposed for ATM switching. We consider a case where the transmission/switching speed is discrete integer and reform the previous results to reflect the discreteness. Then, we apply the GPDN as a non-bl", } @ARTICLE{Naga95:Optical, AUTHOR="N. Nagatsu and K. Sato", TITLE="Optical Path Accommodation Design Enabling Cross-Connect System Scale Evaluation", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="1339-1343", YEAR=1995, REFERENCES=6, KEYWORDS="Algorithm; channel assignment; network design; virtual path; wdm", ABSTRACT="This paper proposes novel optical path accommodation design algorithms for networks wherin the number of wavelengths multiplexed into a fiber is restricted. This algorithm optimizes both optical path route and wavelength assignment in VWP/WP networks. It minimizes optical path cross-connect system scale in terms of incoming/outgoing fiber port numbers.", } @INPROCEEDINGS{Naka95:Photonic, AUTHOR="Y. Nakahira and H. Inoue and Y. Shiraishi", TITLE="Evaluation of Photonic {ATM} Switch Architecture - Proposal of a new Switch Architecture", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="129-132", YEAR=1995, REFERENCES=11, KEYWORDS="Atm; optical switching; wdm", ABSTRACT="This paper discusses the most advantageous configuration of the photonic ATM switch based on the evaluation of several models. It clarifies the quantitative advantages attained by introducing photonic switching, and compares the merits of various systems and devices.", } @INPROCEEDINGS{Naka95:Advanced, AUTHOR="A. Nakajima and M. Kuramoto and H. Mishima and M. Yabusaki", TITLE="Advanced Intelligent Mobile Communications Network", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="320-324", YEAR=1995, REFERENCES=3, KEYWORDS="In; intelligent network", ABSTRACT={This paper describes requirements and technical issues for the Advanced Intelligent Mobile communications Networks (A-IMN). NTT DoCoMo has already implemented IMN, which covers analog and personal digital cellular (PDC) systems in nationwide Japan. A-IMN is aimed at approaching the goal of mobile communications "Personal, Multimedia, and Intelligent". For "Personal", A-IMN implements universal mobility, i.e. terminal mobility (TM) and personal}, } @ARTICLE{Naka95:Optical, AUTHOR="S. Nakaya and Y. Katsuki and T. Taya and S. Yamaoka", TITLE="Optical Parallel Transmission Module", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="65-68", YEAR=1995, REFERENCES=2, KEYWORDS="B-isdn; network; technology", ABSTRACT="In ATM switching systems, to be the core of broadband ISDN, many 2.48 Gbit/s lines are installed, and data is processed by 311 Mbit/s * 8 channels of parallel signals. We developed an optical parallel transmission module to connect units and boards of such a large scale system by optical signals. This module consists of a 12-channel LD/PD array module and a dedicated LSI, and can transmit 311 Mbit/s * 8 channels of parallel signals for 20 m or", } @PROCEEDINGS{Neuf95:Protocols, TITLE="Protocols for High Speed Networks {IV}", EDITOR="G. W. Neufeld and M. R. Ito", ISBN="0-412-71180-X", PUBLISHER="Chapman \& Hall", ADDRESS="London, Great Britain", YEAR=1995, KEYWORDS="High speed; implementation; network; protocol", } @ARTICLE{Anon95:Mehr, AUTHOR="Anonymous", TITLE="Mehr Saft im Ethernet 10 {MBit/s} und 100 {MBit/s} mit nur einem Transceiver-Baustein", JOURNAL="Elektronik", ADDRESS="Germany", VOLUME=7, PAGES="34-41", YEAR=1995, LANGUAGE="German", KEYWORDS="Ethernet; lan", ABSTRACT="Bei vielen Rechnernetzen ist ein höherer Datendurchsatz gew nscht, allerdings soll die vorhandene Kabel-Infrastruktur aus Kostengr nden bebehalten werden können. Das neue Fast-Ethernet-Verfahren ist ein interessanter Lösungsansatz, denn so können mit den herkömmlichen Ethernet-Kabeln zehnmal mehr Daten bertragen werden, wobei sich die Kosten lediglich verdoppeln und weitere Preissenkungen zu erwarten sind. Welche schaltungstechnischen Möglichk", } @PROCEEDINGS{Anon95:Sigmetrics, TITLE="Performance and Sigmetrics; Joint International Conference on Measurement and Modeling of Computer Systems", EDITOR="Anonymous", PUBLISHER="ACM Sigmetrics; IFIP Working Group 7.3", NOTE="Performance Evaluation Review, Vol. 23, No. 1", YEAR=1995, REFERENCES=27, KEYWORDS="Disk; fault tolerance; measurement; memory; modeling; multimedia; multiprocessor; network; performance evaluation; performance model; queueing system; video service", ABSTRACT="The program includes many traditional and new topics and covers a broad spectrum, including multiprocessors, multimedia, networks, fault-tolerance, video modeling, queueing applications, stochastic systems, disk and memory systems and measurement and analysis.", } @MANUAL{Anon95:Ada, AUTHOR="Anonymous", TITLE="Ada 95 Rationale: The Language; the Standard Libraries", PUBLISHER="Intermetrics", ADDRESS="Cambridge, Massachusetts", YEAR=1995, REFERENCES=118, KEYWORDS="Ada; programming language", } @MANUAL{Anon95:Ada, AUTHOR="Anonymous", TITLE="Ada Reference Manual: the Language; the Standard Libraries", PUBLISHER="Information technology-Programming Languages, Intermetrics, ANSI; ISO; IEC", ADDRESS="Cambridge, Massachusetts", YEAR=1995, KEYWORDS="Ada; programming language", } @PROCEEDINGS{Anon95:Proceedings, TITLE="All-Optical Communication Systems: Architecture, Control, and Network Issues", EDITOR="Anonymous", SERIES="SPIE Proceedings Series", ISBN="0-8194-1978-8", PUBLISHER="SPIE", ADDRESS="Bellingham, USA", NUMBER=2614, YEAR=1995, KEYWORDS="CDMA; fiber optics; network; performance evaluation; WDM; access network", } @BOOK{Anon95:Zeichengabesysteme, AUTHOR="Anonymous", TITLE="Zeichengabesysteme: eine neue Generation für {ISDN} und intelligente Netze", ISBN="3-931213-13-7", PUBLISHER="LTU-Vertriebsgesellschaft", ADDRESS="Bremen, Germany", YEAR=1995, LANGUAGE="German", KEYWORDS="Ccs; common channel; intelligent network; isdn; overview; q.931; signalling; signalling protocol", ABSTRACT="Das vorliegende Buch beschreibt umfassend und leicht verständlich die neue Zeichengabe im Netz der Deutschen Telecom (ZGS Nr. 7) und auf der Anschlußleitung (D-Kanal/DSS1). Dabei werden alle wichtigen Aspekte wie Fragen der Standardisierung, Formatisierungsprinzipien, Prozeduren, Dienste und Dienstmerkmale, Interworking und nicht zuletzt grundlegende Fragen zum Zeichengabennetz behandelt.", } @BOOK{Anon95:International, AUTHOR="Anonymous", TITLE="International Telecom Statistics 1995 - Internationale Fernmeldestatistik 1995", ISBN="ISSN 0937-8871", PUBLISHER="International Telecom Statistics, Siemens, Bereich Öffetliche Kommunikationsnetze", ADDRESS="Germany", YEAR=1995, KEYWORDS="Data; overview; statistics; telephony", } @INPROCEEDINGS{Noh95:Reconfiguration, AUTHOR="T. H. Noh and Dhadesugoor R. Vaman and Xuedao Gu", TITLE="Reconfiguration for Service and Self-Healing in {ATM} Networks Based on Virtual Paths", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="525-530", YEAR=1995, REFERENCES=11, KEYWORDS="Atm; capacity planning; reconfiguration; self healing network; virtual path", ABSTRACT="This paper presents a reconfiguration scheme resulting in capacity efficiency and fast restoration by utilizing the inherent benefits of Virtual Paths in ATM networks. The unified optimization of bandwidth reconfiguration is addressed so that switched ATM networks can support both service and survivability from a common pool of network spare capacity at a given time. The spare capacity is composed of idle bandwidth and freed up bandwidth from t", } @ARTICLE{Noro95:Routing, AUTHOR="Ciro A. Noronha and F. A. Tobagi", TITLE="Routing of Multimedia Streams in Reconfigurable {WDM} Optical Networks", JOURNAL=jhsn, VOLUME=4, NUMBER=4, PAGES="133-153", YEAR=1995, REFERENCES=17, KEYWORDS="Multimedia; network; performance evaluation; routing algorithm; wdm", ABSTRACT="Multimedia streams have different requirements than those of traditional data traffic, especially in terms of bandwidth; these requirements have to be taken into account when routing such streams. WDM local-area networks with tunable transceivers have an additional degree of freedom over their electronic counterparts: their topology can be dynamically changed. In this paper, we study the problem of routing multimedia streams in WDM networks, ta", } @ARTICLE{Nuss95:Networking, AUTHOR="Jean-Paul Nussbaumer and Baiju Patel and Frank Schaffa and J. P. Sterbenz", TITLE="Networking Requirements for Interactive Video on Demand", JOURNAL=ieeejsac, VOLUME=13, NUMBER=5, PAGES="779-787", YEAR=1995, REFERENCES=7, KEYWORDS="Cost function; multimedia; network; network topology", ABSTRACT="This paper introduces a variety of interactive video on demand (IVOD) scenarios, and introduces a cost function that captures the combined bandwidth and storage requirements of the network. This cost function is used to compare different network engineering alternatives, particularly program caching and stream sharing. The effects of nonlinear pricing and differing weights of bandwidth and storage are also reflected by the cost function. This c", } @ARTICLE{OMah95:Multiwavelength, AUTHOR="Mike O'Mahony", TITLE="Multiwavelength Optical Networks: Design Considerations", JOURNAL=jhsn, VOLUME=4, NUMBER=4, PAGES="327-339", YEAR=1995, REFERENCES=11, KEYWORDS="Cross connect; technology; wdm", ABSTRACT="This paper considers some of the major issues arising in the desing of an all-optical transport layer for telecommunication networks. The results presented relate to a European funded project MWTN. In particular the discussion focuses on the design of the optical node architecture, transmission limitations associated with the analogue nature of the network and network issues such as wavelength contention.", } @ARTICLE{OMah95:European, AUTHOR="Mike O'Mahony and D. Simeonidou and A. Yu and J. P. Zhou", TITLE="The Design of a European Optical Network", JOURNAL=ieeejlt, VOLUME=13, NUMBER=5, PAGES="817-828", YEAR=1995, REFERENCES=17, KEYWORDS="Network architecture; network design; network evolution; network planning; technology; traffic flow analysis; transmission; transparency; wdm", ABSTRACT="This paper presents a number of design issues under consideration in the development of an all-optical network linking major centers in Europe. The proposed network is characterized by spanning a large geographical area, the diameter is in excess of 3000km, but with a relatively small number of nodes (20). The study combines aspects of two optical network projects funded by the EC: COST 239 - Ultra-High Capacity Optical Transmission Networks an", } @ARTICLE{Obai95:Simulation, AUTHOR="M. S. Obaidat", TITLE="A Performance Simulation Study of the Ethernet and Token Bus Local Computer Networks", JOURNAL="Simulation", VOLUME=64, NUMBER=6, PAGES="381-396", YEAR=1995, REFERENCES=15, KEYWORDS="Ethernet; lan; simulation; token bus", ABSTRACT="This paper presents a detailed comparative performance simulation study for the Ethernet an Token Bus local computer networks. The simulation models are built using discrete-driven simulation. SIMSCRIPT II.5 is used to develop the simulation models.", } @INPROCEEDINGS{Oguc95:Novel, AUTHOR="K. Oguchi", TITLE="Novel Passive Star Coupler with Asymmetric Wavelength Characteristics for Wavelength Characteristics for ... {WDM} Star Networks Connecting Employing Arrayed-Waveguide-Gratings", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="685-688", YEAR=1995, REFERENCES=10, KEYWORDS="Optical switching; star network; wdm", ABSTRACT="New passive star-coupler employing arrayed-waveguide-grating for WDM star networks is proposed. Its assymmetric wavelength characteristics are verified by new wavelength transfer matrix method.", } @ARTICLE{Okay95:Optical, AUTHOR="H. Okayama and M. Kawahara and H. Kimura and H. Inoue", TITLE="Optical Subscriber Network System", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="47-50", YEAR=1995, REFERENCES=2, KEYWORDS="Fiber optics; network; wdm", ABSTRACT="An optical subscriber network using optical fiber as transmission lines is expected to accomodate increasing transmission capacities and provide new communication services. To implement this optical subscriber network, we developed a protocol system using optical wavelength division multiplexing (WDM) technology, which is a key technology of future optical communications. In this system which we made, the optical subscriber network consists of", } @ARTICLE{Oki95:Recursive, AUTHOR="E. Oki and Naoaki Yamanaka", TITLE="A Recursive Matrix-Calculation Method for Disjoint Path Search with Hop Link Number Constraints", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="769-774", YEAR=1995, REFERENCES=7, KEYWORDS="Communication network; multicast; multipoint; routing", ABSTRACT="A new approximation calculation method, named the Recursive Matrix-calculation (RM) method, is proposed. It uses matrix calculation to determine the number of link disjoint paths under a hop link number constraint, i.e. hop limit. The RM method does not overestimate the number of link disjoint paths. When networks are designed by this method, network reliability is perfectly guaranteed. Moreover, the RM method is based on matrix calculation, so", } @ARTICLE{Oliv95:Looping, AUTHOR="J. Oliver", TITLE="Looping the Loop", JOURNAL="Communications International", PAGES="81-86", YEAR=1995, KEYWORDS="Comparison; economic evaluation; future outlook; technology; access network", ABSTRACT="The local loop, long-time poor relation of the global telecomms family, suddenly has great expectations. Now incumbent and emergent carriers alike are queuing up as would-be suitors. John Oliver, product marketing director, Pinacl Products, tips his hat in the same direction.", } @INPROCEEDINGS{Oliv95:Role, AUTHOR="R. M. Oliver", TITLE="The Role of Different Architecture Alternatives in the Access Network", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="493-499", YEAR=1995, KEYWORDS="Cost; network architecture; access network", ABSTRACT="For new multimadia services different architecture alternatives exist. The two main types, electronical and optical systems are compared under view of costs.", } @INPROCEEDINGS{Olse95:Technoeconomic, AUTHOR="B. T. Olse and L. A. Ims and D. Myhre and K. Stordahl and T. Ramassh", TITLE="Technoeconomic Evaluation of Broadband Access Network Scenarios for the Mixed Residential and Bussiness Market", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="239-242", YEAR=1995, REFERENCES=4, KEYWORDS="Atm; access network", ABSTRACT="This paper presents a techno-economic evaluation of an aggressive ATM-PON upgrade strategy for access networks. The optical upgrade solution is compared to a more conservative upgrade strategy with enhanced copper technology combined with point to point fiber connections. The economical value is compared to the present POTS.", } @ARTICLE{Onis95:PDS, AUTHOR="K. Onishi and K. Kaneuchi and H. Ishizaki and K. Yusa", TITLE="A {PDS} Optical Subscriber Transmission System", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="27-32", YEAR=1995, REFERENCES=8, KEYWORDS="Fiber optics; network; star network; technology", ABSTRACT="PDS (Passive Double Star) systems are attracting attention as systems to implement fully optical subscriber networks. PDS systems are actively used by a variety of multiplexer systems and have features for performing transmissions. TCM-TDMA, which is proposed by NTT, is used as the multiplexing system in the system under current development. It employs a unique subscriber frame format which was designed for stable operation by dynamically alloc", } @BOOK{Ott95:Designer, AUTHOR="D. E. Ott and Wilderotter. T. J.", TITLE="A Designer's Guide to {VHDL} Synthesis: Disk included; all {VHDL} examples", ISBN="0-7923-9472-0", PUBLISHER="Kl3uwer Academic Publishers", ADDRESS="Norwell/Dordrecht", YEAR=1995, REFERENCES=5, KEYWORDS="Hardware design language", ABSTRACT="A Designer's Guide to VHDL Snthesis is intended for both design engineers who want to use VHDL-based logic synthesis to design ASICs and for managers who need to gain a practical understanding of the issues involved in using this technology. The emphasis has been placed more on practical applications of VHDL and synthesis based on actual experiences, rather than on a more theoretical approach to the language.", } @INPROCEEDINGS{Oude95:Integration, AUTHOR="J. Oudelaar and W. van den", TITLE="Integration of {UMTS} into Fixed Networks and the Use of {IN} Control Principles", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="325-329", YEAR=1995, REFERENCES=7, KEYWORDS="B-isdn; in", ABSTRACT="In the RACE II MONET project the network aspects of a third generation mobile network are studied. Two important goals in MONET regarding network and service integration are: (1) to allow integration of the future infrastructure for mobile and fixed communications (2) to offer in UMTS the same range of services as provided by the fixed networks. The integration of mobile networks with fixed networks is desirable for techno-economic reasons. In", } @INPROCEEDINGS{Ouve95:Efficient, AUTHOR="I. Ouveysi and A. Wirth", TITLE="An Efficient Heuristic for the Design of a Survivable Network Architecture for Dynamic Routing", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="921-925", YEAR=1995, REFERENCES=10, KEYWORDS="Dynamic routing; heuristics; linear optimization; network design; network optimization; network planning; optimization; protection", ABSTRACT="We investigate network planning and design under volatile conditions of link failures and traffic overload. Given the end-to-end traffic requirements, we generate a maximum spanning tree that can carry the traffic of any one origin-destination pair. The maximum spanning tree is augmented to handle any two simultaneous link failures or congestions. Then the augmented max. spanning tree is synthesized by the algorithm of Gomory \& Hu on the physic", } @ARTICLE{Ozek95:Gbit, AUTHOR="Y. Ozeki and H. Sato and N. Ohhashi and Weihong Wang", TITLE="10 Gbit/s Optical Transmitter and {3R} Receiver", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="11-16", YEAR=1995, REFERENCES=18, KEYWORDS="Fiber optics; network; sdh; technology", ABSTRACT="With the advance of multimedia, the pace of development is quickening for a 10 Gbit/s LT'-MUX, which is the key transmission system for the highest speed SDH. The technologies contained in this paper to implement an ultrahigh-speed optical interface constitute a compilaiton of leading-edge technologies in a broad range of fields such as high-speed optical device technology, ultrahigh-speed IC design and manufacturing technology, packaging techn", } @ARTICLE{Zeki95:Waiting, AUTHOR="S. Zekici and Jinyang Li and F. S. Chou", TITLE="Waiting Time in {M/G/1} Queues with Impolite Arrival Disciplines", JOURNAL="Probability in the Engineering and Informational Sciences", VOLUME=9, NUMBER=2, PAGES=255, YEAR=1995, KEYWORDS="Arrival process; m/g/1; service discipline; single server; waiting time", } @BOOK{Pabr95:Unix, AUTHOR="U. Pabrai", TITLE="Unix Internetworking", ISBN="0-89006-778-3", PUBLISHER="The Artech House Telecommunications Library, Artech House", ADDRESS="Boston, Massachusetts", YEAR=1995, KEYWORDS="Internetworking; network architecture; security; tcp/ip; unix", } @ARTICLE{Padg95:Overview, AUTHOR="J. E. Padgett and C. G. G nther and T. Hattori", TITLE="Overview of Wireless Personal Communications", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=33, NUMBER=1, PAGES="28-41", YEAR=1995, REFERENCES=30, KEYWORDS="Cellular system; mobile radio; radio channel", ABSTRACT="Cellular radio and cordless telephony have demonstrated the demand for wireless communications and provided a foundation for the development of future wireless telecommunications systems and services.", } @INPROCEEDINGS{Pala95:Feasible, AUTHOR="S. Palazzo and D. Panno and A. R. Pach", TITLE="Feasible Load Region of {DQDB} {MANs} Interconnected by a Multiport Bridge", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="154-157", YEAR=1995, REFERENCES=3, KEYWORDS="Bridge; dqdb; man", ABSTRACT={This paper investigates the behaviour of a number of DQDB subnetworks interconnected by a multiport bridge. An analytical model is presented whcih allows us to determine the "feasible load region" of the whole system. The analysis performed aims at providing some insight into the functioning of the bridge in oder to control network congestion, in particular to avoid subnetwork overloading due to the traffic generated in other subnetworks. A num}, } @INPROCEEDINGS{Panc95:Multihop, AUTHOR="G. Panchapakesan and A. Sengupta", TITLE="On Multihop Optical Network Topology Using Kautz Digraphs", BOOKTITLE=infocom, ISBN="0-8186-6990-X", ADDRESS="Los Alamitos, California", PAGES="675-682", YEAR=1995, REFERENCES=14, KEYWORDS="Graph model; graph theory; multihop; network topology; routing; routing algorithm; topology", ABSTRACT="In this paper, we propose a new topology for multihop optical networks using Kautz digraphs. The properties of such a network as a logical topology are evaluated and compared with other topologies proposed in the literature. For a given degree of each node and a given diameter of the network, a Kautz digraph supports more nodes than other topologies like shufflenet or that using a DeBruijn digraph and hence seems to be an attractive design for", } @ARTICLE{Pank95:Network, AUTHOR="Rajesh Pankaj", TITLE="All-Optical Network Topologies Based on Expander Graphs\%", JOURNAL=jhsn, VOLUME=4, NUMBER=2, PAGES="117-131", YEAR=1995, REFERENCES=27, KEYWORDS="Wdm", ABSTRACT="We discuss a class of WDM access networks that are homogeneous in the sense that each node contains both an input/output port and a switch. We focus on permutation routing problem and first present a lower bound on the number of wavelengths required for permutation routing as a function of the size and degree of the network. We then use a network topology based on expander graphs and derive an expression for the number of wavelengths that are s", } @INPROCEEDINGS{Pard95:Characteristics, AUTHOR="B. H. Pardoe and H. I. Sigiuk", TITLE="Performance characteristics of {DQDB} Network with a close loop bandwidth balancing", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="136-139", YEAR=1995, REFERENCES=10, KEYWORDS="Dqdb; fairness; man", ABSTRACT="In this paper an enhancement ot the standard BWB scheme is presented by introducing some modifications to the node protocol. In overload conditions the proposed Closed Loop BWB schme still provide the required fairness degree between the competing nodes, with full utilisation of bus bandwidth. The investigation of the proposed schme has been extended for a multi-priority traffic network, where it has been proved to be still effective.", } @INPROCEEDINGS{Pere95:Multipath, AUTHOR="R. Perez-Jimenez and V. M. Melian and M. J. Betancor", TITLE="Analysis of Multipath Impulse Response of Diffuse and Quasi-Diffuse Optical Links for {IR-WLAN}", BOOKTITLE=infocom, ISBN="0-8186-6990-X", ADDRESS="Los Alamitos, California", PAGES="924-930", YEAR=1995, REFERENCES=8, KEYWORDS="Lan; multipath", ABSTRACT="This paper studies the variation on the power budget, in an infrared optical link, for indoor channels with multipath propagation. Some emitter and receiver configurations are studied.", } @ARTICLE{Petr95:Simulation, AUTHOR="David Petr and Victor S. Frost and Lyn A. Neir and A. Demirtjis and C. L. Braun", TITLE="Simulation Comparison of Broadband Networking Technologies", JOURNAL="Simulation", VOLUME=64, NUMBER=1, PAGES="42-50", YEAR=1995, REFERENCES=6, KEYWORDS="Atm; broadband; dqdb; frame relay", ABSTRACT="This paper describes a simulation study comparing delay and throughput performance of several access/backbone combinations of Frame Relay, Asynchronous Transfer Mode (ATM), and IEEE 802.6 broadband networking technologies. The comparisons are made using similar Metropolitan Area Network (MAN) configurations supporting integrated traffic from voice, video, data and image sources. Results include complete distributions for network and end-end del", } @ARTICLE{Petr95:Methodology, AUTHOR="David Petr and Victor S. Frost and Lyn A. Neir and A. Demirtjis and C. L. Braun", TITLE="Methodology and Results of Synchronous Digital Hierarchy Network Payload Jitter Simulation", JOURNAL="Simulation", VOLUME=64, NUMBER=1, PAGES="34-41", YEAR=1995, KEYWORDS="Atm; broadband; dqdb; frame relay", ABSTRACT="Synchronous Optical Network (SONET)/Synchronous Digital Hierarchy (SDH) network implementations indicate that the jitter on the transported data exceeds desirable values in some situations. Previous researchers have written high level behavioral simulation models to study the sources and the characteristics of this jitter. These behavioral simulation models have fast run times but do not accurately model the jitter sources. Thes models' samplin", } @ARTICLE{Pfaf95:Hybrid, AUTHOR="A. Pfaff", TITLE="Hybrid Fiber/Coax in the Public Telecommunications Infrastructure", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=33, NUMBER=4, PAGES="40-45", YEAR=1995, REFERENCES=1, KEYWORDS="Fiber optics; network evolution; sdh; access network", ABSTRACT="Regional networks, interface to the public network and network management systems are a few of the significant issues with respect to the viability of HFC as the access layer to the information superhighway. If the HFC platform proves viable, telephone companies will adapt it to meet their needs in a fully integrated system.", } @ARTICLE{Priw95:Multicast, AUTHOR="V. Priwan and H. Aida and T. Saito", TITLE="The Multicast Tree Based Routing for The Complete Broadcast Multipoint-to-Multipoint Communications", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="720-728", YEAR=1995, REFERENCES=14, KEYWORDS="Communication network; multicast; multipoint; routing", ABSTRACT="This paper studies routing methods for the complete broadcast multipoint-to-multipoint communication. For a Z-node (Z-site) of the participants of the connection, each site transmitts one signal and receives Z-1 signals. The routing method based on connecting each participant by multiple directed point-to-point circuits uses wasteful bandwidth that the source-to-destination data may be duplicated needlessly. We propose routing methods that the", } @BOOK{Purs95:Error, AUTHOR="M. Purser", TITLE="Introduction to Error-Correcting Codes", ISBN="0-89006-784-8", PUBLISHER="The Artech House Telecommunications Library, Artech House", ADDRESS="Boston, London", YEAR=1995, REFERENCES=17, KEYWORDS="Error-correcting code; overview", ABSTRACT={The course of the book moves from the general concepts of block codes and distances (Chapter 1=, through linear block codes (Chapter 2), to the special linear codes that are cyclic codes (Chapter 3) and the special cyclic codes that are BCH codes (Chapter 4). By contrast Chapter 5 is devoted to Convolutional or Trellis Codes, in which data are in the form of an "infinite" stream, rather than a fixed-length block.}, } @INPROCEEDINGS{Quay95:Ranging, AUTHOR="J. A. Quayle", TITLE="Ranging on Advanced {PONs}", BOOKTITLE=efoc, PAGES="154-157", YEAR=1995, REFERENCES=4, KEYWORDS="Access network", ABSTRACT="For broadband access networks (i.e. PONs) ranging mechanisms which synchronise all the ONUs to avoid data corruption are presented. In-band, out-of-band and hybrid ranging are described.", } @INPROCEEDINGS{Raat95:Database, AUTHOR="K. Raatikainen", TITLE="Database access in intelligent networks", BOOKTITLE="IFIP workshop on intelligent networks", ISBN="0-412-71730-1", ADDRESS="London, Great Britain", PAGES="173-193", YEAR=1995, KEYWORDS="Database; intelligent network; network management; osi; overview", ABSTRACT="Future telecommunication services will extensively exploit database technology. Information needed in operation and management of telecommunication services will be organized as a logical entity. the world-wide nature of telecommunication dictates that the logical entity can only be realized through interoperability of autonomous databases that may have different internal characteristics. We review the requirements for database access in the IN", } @ARTICLE{Rama95:Optimized, AUTHOR="S. Ramamurthy and B. Mukherjee and B. Moslehi", TITLE="Optimized Partitioning of a Wavelength Distributed Data Interface Ring Network", JOURNAL=ieeejlt, VOLUME=13, NUMBER=10, PAGES="1971-1984", YEAR=1995, REFERENCES=21, KEYWORDS="Algorithm; fddi; heuristics; partition function; ring network; wdm", ABSTRACT="... For a multiwavelength version of FDDI, called WDDI (Wavelength Distributed ...) the paper examines the necessary upgrades to the architecture of a FDDI node, including its possibility to serve as a bridge. ... Specifically, the paper investigates algorithms which, based on prevailing traffic conditions, partitioning of nodes into subnetworks can be performed in an optimized fashion.", } @ARTICLE{Rana95:Markov, AUTHOR="Nol Rananand", TITLE="Markov Approximations to D-BMAPs: Information Theoretic Bounds on Queueing Performance", JOURNAL="Communications in Statistics - Stochastic Models", VOLUME=11, NUMBER=4, PAGES="713-734", YEAR=1995, REFERENCES=16, KEYWORDS="Delay analysis; information theory; maximum likelihood estimation; overflow; queueing system; dbmap", ABSTRACT={We consider the problem of approximating a discrete-time batch Markovian arrival process (D-BMAP) by a simple process such that certain corresponding buffer-related performance measures are close approximations of the true performance measures. The motivation comes from network applications where the D-BMAPs are used to represent bursty traffic streams in high-speed networks. We propose an approach for approximating a D-BMAP by a "matched" Mark}, } @ARTICLE{Rehm95:Optische, AUTHOR="W. Rehm and K. D tting and N. Kaiser and P. Vetter and others", TITLE="Optische Verbindungstechnik: Der Schl ssel zur Kommunikation mit hohen Bitraten innerhalb von Telekommunikationseinrichtungen", JOURNAL="Elektrisches Nachrichtenwesen", PUBLISHER="Alcatel", ADDRESS="Stuttgart, Germany", VOLUME=1, PAGES="65-73", YEAR=1995, LANGUAGE="German", REFERENCES=10, KEYWORDS="Technology", } @INCOLLECTION{Reic95:Service, AUTHOR="U. Reichardt and B. Heilig", TITLE="Service Creation im Intelligenten Netz {(IN)-} Der Schl ssel zum Erfolg", BOOKTITLE="Taschenbuch der telekom praxis", PUBLISHER="Schiele and Schön", ADDRESS="Germany", YEAR=1995, LANGUAGE="German", KEYWORDS="In; intelligent network; software engineering", } @INPROCEEDINGS{Ribe95:Analytical, AUTHOR="L. B. Ribeiro and J. R. F. da Rocha and A. Gamero", TITLE="Analytical Study of Lightwave Systems Taking into Account Exact Optical Filter Profile", BOOKTITLE=efoc, PAGES="46-49", YEAR=1995, REFERENCES=10, KEYWORDS="Filter", ABSTRACT="In optically amplified WDM systems narrow optical filters are required in the receiver. A statistical model is proposed which resolves the optical filter profile impact both on signal and optical noise", } @INPROCEEDINGS{Riek95:Service, AUTHOR="R. Rieken and Max Sevcik and R. Eder", TITLE="{IN} Service Creation - How to Make the Service Independent Building Block Concept Fly", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="330-334", YEAR=1995, REFERENCES=2, KEYWORDS="In; intelligent network; sdl", ABSTRACT="The current service modelling concepts for Intelligent Networks (IN) as proposed by standardisation bodies use the Service Independent Building Blocks (SIB) to represent the IN service logic. All attempts to transform the SIB to working service programs in practical networks failed because: - there is no representation of network call processing (Basic Call State Model) at SIB level possible, - no explicit support for customer service control a", } @ARTICLE{Roge95:Telcos, AUTHOR="C. Rogers", TITLE="Telcos vs. Cable {TV:} The Global View", JOURNAL=datacommunications, PAGES="75-80", YEAR=1995, KEYWORDS="Economic evaluation; future outlook; isdn; lan; telephony", } @INPROCEEDINGS{Ronc95:Network, AUTHOR="L. Ronchetti and L. Cipriani and Stefano Salsano", TITLE="A Network Architecture for Multimedia Multiparty Services and the Impact on {B-ISDN} Control Evolution", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="787-792", YEAR=1995, REFERENCES=7, KEYWORDS="B-isdn; in; intelligent network; multimedia", ABSTRACT="The realization of B-ISDN networks based on the Asynchronous Transfer Mode (ATM) technology will offer the possibility of introducing innovative multimedia multiparty services. These services will impose new requirements and introduce added complexity on the control protocols and software of the B-ISDN. Furthermore market demands are requiring that services be introduced in a rapid manner and with the move towards the liberalization of the tele", } @ARTICLE{Rose95:Conception, AUTHOR="C. Rosenberg and E. Haddad and D. Gelinas", TITLE="Conception of a {CATV-based} {MAN}", JOURNAL="Telecommunication Systems", VOLUME=4, NUMBER=3, PAGES="339-351", YEAR=1995, REFERENCES=7, KEYWORDS="Dqdb; man; star network", ABSTRACT="The objective of this paper is to propose an architecture for a CAble TeleVision (CATV) network, capable of supporting two-way transmission. The evolution is necessary for the survival of the CATV industry in an era of deregulation and of the development of the B-ISDN by the telecommunications companies. A communication transactional service is then considered an performance analysis is done under realistic assumptions.", } @PHDTHESIS{Rößl95:Einfluß, AUTHOR="G. Rößler", TITLE="Einfluß des Netzmanagements auf die Struktur von {OSI-Systemen} und eine Methode für die erstmalige Konfiguration", SERIES="Bericht über verkehrstheoretische Arbeiten", SCHOOL="IND, Elektrotechnik, Universität Stuttgart", ADDRESS="Stuttgart, Germany", VOLUME=60, YEAR=1995, LANGUAGE="German", KEYWORDS="Configuration analysis; ISO protocol; LOTOS; network management; OSI; protocol; protocol specification; protocol verification; specification; transport layer; transport protocol; verification", } @TECHREPORT{Roto95:Experiments, AUTHOR="S. Rotolo and P. Passeri and E. Vezzoni", TITLE="Studies and experiments on multiwavelength transport networks", INSTITUTION="CSELT", ADDRESS="Italy", VOLUME=23, NUMBER=5, PAGES="541-553", YEAR=1995, REFERENCES=25, KEYWORDS="Field trial; standardization; technology; wdm", ABSTRACT="The paper gives a brief overview of international activities in this field and emphasizes the important role that Italian companies, research centres and universities have played in recent years in outstanding European and national projects. In the natural evolution from the research stage to the deployment of an application, Telecom Italia is showing an increasing interest in solutions that could be effectively applied in the Italian scenario:", } @INPROCEEDINGS{Rubi95:SMARTNet, AUTHOR="I. Rubin and Hsing-Kuo Hua", TITLE="{SMARTNet:} {AN} {ALL-OPTICAL} {WAVELENGTH-DIVISION} {MESHED-RING} {PACKET-SWITCHING} {NETWORK}", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="1756-1760", YEAR=1995, REFERENCES=9, KEYWORDS="Lan; packet switching; ring network; wdm", ABSTRACT="We study an all-optical wavelength division packet-switching meshed-ring LAN/MAN. This network architecture (SMARTNet) offers a significant increase in the throughput capacity realized by any LAN/MAN shared medium network. It is ATM capable and takes best advantage of the kinds of high speed optoelectronic and optical components that can actually be constructed: very few ports, very simple routing decisions, and very little buffering.", } @ARTICLE{Rubi95:Queue, AUTHOR="I. Rubin and Jean-Lien C. Wu", TITLE="Analysis of an {M/G/1/N} Queue with Vacations and Its Iterative Application to {FDDI} Timed-Token Rings", JOURNAL=ieanep, VOLUME=3, NUMBER=6, PAGES="842-856", YEAR=1995, REFERENCES=18, KEYWORDS="Analysis; fddi; m/g/1/s; token ring", ABSTRACT="We present the analysis of an M/G/1/N queueing system with vacations under a dynamic time-limited service policy. This method is used to develop a procedure for performance analysis of a fiber distributed data interface (FDDI) network serving buffer-limited stations under asynchronous service. ...", } @ARTICLE{Rung95:Link, AUTHOR="S. Runggeratigul and W. Zhao and Y. Ji and A. Aizawa and S. Asano", TITLE="Link Capacity Assignment in Packet-Switched Network with Existing Network Consideration", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="709-719", YEAR=1995, REFERENCES=10, KEYWORDS="Algorithm; capacity assignment; capacity planning; linear programming; network planning; packet switching; wdm", ABSTRACT="When communication network planning-design is performed, especially in a short-term case, it is important to utilize existing facilities in the construction of the new network. In this paper, link capacity assignment problem (CA problem) for packet-switched networks is investigated with the consideration of the existing network. To deal with this, per-unit cost of existing link capacity is thought to be less than that of newly installed capacit", } @INPROCEEDINGS{Sabe95:HD, AUTHOR="Roberto Sabella and E. Iannone", TITLE="{HD-WDM} Transparent Optical Network Using Wavelength Converters based on {FWM} in Semiconductor Amplifiers", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="184-187", YEAR=1995, REFERENCES=10, KEYWORDS="Optical switching; wdm", ABSTRACT="Transmission through a high capacity optical transparent network layer is considered. High dense WDM is assumed. Photonic switching is realised by means of wavelength conversion.", } @ARTICLE{Saha95:Computaitional, AUTHOR="Debabrata Saha and A. Mukherjee", TITLE="Computaitional analysis of an optimal routing strategy in a hierarchical computer communicatin network", JOURNAL=comcom, VOLUME=18, NUMBER=7, PAGES="507-511", YEAR=1995, REFERENCES=17, KEYWORDS="Hierarchical routing; routing", ABSTRACT="The computational analysis of an optimal hierarchical routing to choose the best communication pyth in a large network is demonstrated in this paper. A scheme is also provided for selecting the optimal route in a hierarchical computer communicaton network. The problem of optimal routing in a hierarchical network is formulated as a non-linear combinatorial problem solved using the Lagrangean relaxation and subgradient optimization techniques. A", } @INPROCEEDINGS{Sait95:FAIR, AUTHOR="T. Saito and H. Aida and O. Altintas and Byoung-Jo J. Kim and T. Aoki", TITLE="A fair and efficient access control method for high speed multimedia {LAN} and {MAN}", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="87-92", YEAR=1995, REFERENCES=5, KEYWORDS="Fairness; hslan; lan; man; media access control", ABSTRACT="As B-ISDN is adopted into networks, the speed of LANs will increase along with the demand for multimedia applications. In view of this demand, performance of traditional methods such as CSMA/CD or Token Ring is clearly unsatisfactory. Currently, various slotted ring (or slotted bus) based LAN access control methods for handling transmission speeds in excess of 155 Mbps have been proposed. This paper first summarizes the characteristics of conve", } @INPROCEEDINGS{Sait95:FADM, AUTHOR="T. Saito and H. Aida and Byoung-Jo J. Kim", TITLE="{FADM:} a new access control method for distributed access subscriber network", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="157-162", YEAR=1995, REFERENCES=3, KEYWORDS="B-isdn; media access control; subscriber premises network; access network", ABSTRACT="In this paper, a new access control method called FADM (Frame Access Demand Multiplexing) is proposed, and the simulative analysis is performed. Based on the frame addressing method, this method features predictive access control. Compared to ohter methods, it is shown that, by employing cyclic reset algorithm and backpressure mechanism into the access control, fair and efficient network access can be achieved for various types of traffic.", } @ARTICLE{Sale95:Holographic, AUTHOR="Jawad A. Salehi and E. G. Paek", TITLE="Holographic {CDMA}", JOURNAL=ieeecom, VOLUME=43, NUMBER=9, PAGES="2434-2438", YEAR=1995, REFERENCES=16, KEYWORDS="Cdma; coding theory", } @ARTICLE{Salo95:Optik, AUTHOR="P. Salomon", TITLE="Optik im Miniformat", JOURNAL="Elektronik", ADDRESS="Germany", VOLUME=14, PAGES="60-67", YEAR=1995, LANGUAGE="German", REFERENCES=12, KEYWORDS="Technology", } @INPROCEEDINGS{Sana95:PASSIVE, AUTHOR="F. Sanaei and P. Chu", TITLE="{PASSIVE} {ALL-OPTICAL} {BUS} {NETWORK} {BASED} {ON} {MODE-SELECTIVE} {COUPLING}", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="1007-1011", YEAR=1995, REFERENCES=8, KEYWORDS="Bus; lan; technology", ABSTRACT="This paper describes a new all-optical data bus network architecture which may be considered for implementation in many all-optical systems, particularly in linear and ring LANs. A linear data bus, fabricated using 8 singlemode/multimode couplers, was constructed and characterised.", } @INPROCEEDINGS{Sanc95:Multiwavelength, AUTHOR="Jaime Sanchez and A. Galindo and K. Khan-Afshar and W. Warzanskyj", TITLE="Multiwavelength Interfaces For Broadband Network Elements", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="805-806", YEAR=1995, REFERENCES=3, KEYWORDS="Broadband; optical switching; wdm", ABSTRACT="Some relevant features of a tunable optical transceiver are presented. The transceiver is being used to provide multiwavelength optical interfaces in an existing B-ISDN broadband platform and can accomodate tunable lasers from different commercial suppliers. Coherent multichannel techniques are being used", } @ARTICLE{Sasa95:Photonic, AUTHOR="K. Sasayama and F. Fr h and Toshimi Kominato and K. Habara", TITLE="Photonic Frequency-Division-Multiplexing Highway Switch Using Integrated-Optic Multiple Ring Resonators", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="674-678", YEAR=1995, REFERENCES=6, KEYWORDS="Optical switching; technology; wdm", ABSTRACT="This paper proposes a photonic frequency-division-multiplexing (FDM) highway switch architecture consisting of 2*2 multi-frequency-channel switches (MFSs) using multiple ring resonators. An experimental MFS fabricated using a planar-lightwave-circuit (PLC) technology is demonstrated.", } @ARTICLE{Sato95:Photonic, AUTHOR="K. Sato and S. Okamoto and Akira Watanabe", TITLE="Photonic Transport Networks based on Optical Paths", JOURNAL="International Journal of Communication Systems", ADDRESS="Great Britain", VOLUME=8, NUMBER=6, PAGES="377-389", YEAR=1995, REFERENCES=46, KEYWORDS="Cost; cross connect; network architecture; virtual path", ABSTRACT="This paper explores the technologies that will enable a further leap forward in transport network evolution. First, requirements of the future transport network are elucidated. Existing network cost is evaluated and the viable means to reduce transport network cost are identified. It is demonstrated that optical path technologies will play a key role in this. Optical path realization technologies focusing on optical path CC systems are examined", } @ARTICLE{Sawa95:High, AUTHOR="T. Sawano and Shuji Suzuki and Masahiko Fujiwara and H. Nishimoto", TITLE="A High-Capacity Photonic Space-Division Switching System for Broadband Networks", JOURNAL=ieeejlt, VOLUME=13, NUMBER=2, PAGES="335-340", YEAR=1995, REFERENCES=7, KEYWORDS="Optical switching; switching system; technology; wdm", ABSTRACT="A high capacity (128-line) photonic space-division switching system prototype has been developed. All of the developments on polarization-independent LiNbO3 matrix switches, semiconductor optical amplifiers for network loss compensation and three-dimensional optical interconnections for multi-stage switching networks combine to enlarge line capacity. The system is devised to provide both HDTV distribution services that require nonblocking conne", } @ARTICLE{Scha95:Stability, AUTHOR="R. Schaßberger", TITLE="Stability of Polling Networks with State-Dependent Server Routing", JOURNAL="Probability in the Engineering and Informational Sciences", VOLUME=9, NUMBER=4, PAGES="539-550", YEAR=1995, REFERENCES=7, KEYWORDS="Markov chain; polling; polling system; recurrent process; stability; state dependent service", ABSTRACT="The polling network considered here consists of a finite collection of stations visited successively by a single server according to a state-dependent routing scheme. At every visit of a station, a possibly random number of customers are served and depart from the network thereafter. The server takes a possibly random time to walk from one station to the next. The network receives groups of customers at Poisson instants. These customers are dis", } @INPROCEEDINGS{Schn95:Influence, AUTHOR="G. Sch nemann and M. Kölling", TITLE="The Influence of Optical Access Lines on the Structure of Access Networks", BOOKTITLE=efoc, PAGES="197-199", YEAR=1995, KEYWORDS="Access network", ABSTRACT="It is the objective of every telecommunications enterprise to minimize the costs and to improve the service for its customers. This paper describes how modern technologies in connection with network design considerations may help to meet these requirements.", } @BOOK{Seil95:Taschenbuch, AUTHOR="B. Seiler", TITLE="taschenbuch der telekom praxis 1995", PUBLISHER="Schiele \& Schön", ADDRESS="Germany", YEAR=1995, LANGUAGE="German", KEYWORDS="In; intelligent network; multimedia; overview; telephony", ABSTRACT="... Bei diesem Jahrgang hat sich ... (das) Thema Multimedia alsSchwerpunkt angeboten.Weitere Fachaufsätze beschäftigen sich mit ... der Zulassung von Endgeräten unter dem Aspekt des europäischen Marktes und den Aufgaben von EURESCOM und DETECON.Mit der Diensteentwicklung im Bereich der Computerkonferenztechnik sowie im Intelligenten Netz setzen sich weitere Experten ...", } @ARTICLE{Seki95:Wireless, AUTHOR="Kazuhiko Seki and Y. Sanada and Q. R. Wang and S. Kato and V. K. Bhargava", TITLE="A Wireless Multimedia Network on a Time Division Duplex {CDMA/TDMA}", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="1002-1014", YEAR=1995, REFERENCES=26, KEYWORDS="Atm; bit error; cdma; error rate; fading; multimedia; multipath; multiple access; radio channel; access network", ABSTRACT="A novel wireless multimedia network employing a time division duplex CDMA/TDMA scheme is proposed. The network connects mobile multimedia terminals to an ATM based LAN through a radio central unit, and provides both uplink and downlink with unbalanced data rates in the same frequency band. The uplink (from a mobile terminal to a radio central unit) employs a CDMA scheme to transmit low speed human interface signals (-2.4kbit/s), and the downlin", } @ARTICLE{Seki95:Line, AUTHOR="S. Seki and T. Ichioka and Y. Ogawa", TITLE="Line Termination GaAs {ICs} for 10 Gbit/s Optical Communication System", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="107-112", YEAR=1995, REFERENCES=5, KEYWORDS="Network; technology", } @INPROCEEDINGS{Seni95:Efficient, AUTHOR="J. M. Senior and Higginbottom G. N.", TITLE="Performance Evaluation of an Efficient Hybrid Protocol for High Speed {LAN} Applications", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="120-123", YEAR=1995, REFERENCES=11, KEYWORDS="Hslan; lan; performance evaluation", ABSTRACT="In this paper a new LAN access protocol which has been called Priority and Reservation TDMA (PRTDMA) is described. The algorithm for PRTDMA has been designed to account for LANs with highly asymmetric traffic load distributions and high data transmission rates which will be present in many environments.", } @INPROCEEDINGS{Sevc95:Customers, AUTHOR="Max Sevcik and R. Lueder", TITLE="Customers in Driver's Seat: Private Intelligent Network Control Point", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="41-45", YEAR=1995, KEYWORDS="In; intelligent network; multimedia; open network", } @ARTICLE{Shar95:Parallel, AUTHOR="O. Sharon and A. Segall", TITLE="The Parallel D-Net", JOURNAL=comcom, VOLUME=18, NUMBER=8, PAGES="552-562", YEAR=1995, REFERENCES=10, KEYWORDS="Bus; hslan; man; media access control", ABSTRACT="In this paper a new topology for a passive bus is presented, enabling parallel transmissions. The topology is similar to the Folded Bus, exept that the bus edges are simulated by one station with active taps. We implement the D-Net MAC on this topology, with several slight changes. These changes, together with the new topology, enable parallel transmissions in part of the transmission cycle generated by D-Net, thus achieving higher efficiency.", } @ARTICLE{Shar95:Schemes, AUTHOR="O. Sharon and A. Segall", TITLE="Schemes for Slot Reuse in a Dual Bus System with the {CRMA} {II} {MAC}", JOURNAL=jhsn, VOLUME=4, NUMBER=3, PAGES="239-254", YEAR=1995, REFERENCES=12, KEYWORDS="Crma; man; spatial channel reuse", ABSTRACT="Several schemes for slot reuse in CRMA II when implemnted on the Dual Bus configuration are studied. They are all based on cancellations to confirmations that downstream stations transmit to upstream stations due to slot resue, thus enabling a better use of the reserved slots. A correctness proof is supplied for the schemes, together with simulation results which show a better performance of the new schmes over the original one.", } @INPROCEEDINGS{Shi95:Traffic, AUTHOR="J. Shi and John Fonseka", TITLE="Traffic-Based Survivability Analysis of Telecommunications Networks", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="936-940", YEAR=1995, REFERENCES=6, KEYWORDS="Algorithm; capacity planning; network design; network planning; reliability measure", ABSTRACT="In this paper, we define a class of traffic-based survivability measures and perform a survivability analysis of telecommunication networks based on these measures. We consider networks with and without restoration separately. For networks without restoration, we evaluate the traffic-based measures in polynomial time. For networks with restoration, we consider a preplanned restoration scheme and provide a method to calculate upper and lower bou", } @INPROCEEDINGS{Shim95:NEW, AUTHOR="C. Shim and Kun I. Park and John Lee and Shiang-feng Lee", TITLE="A new ring protocol for {ATM-MAN}", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="93-11", YEAR=1995, REFERENCES=11, KEYWORDS="Atm; man; protocol; ring; ring network", ABSTRACT="In this paper, we present a new ring protocol which is suitable for LAN/MAN compatible to the ATM networks. The proposed Y-Ring protocol provides robust reliability and flexibility for ring networks.", } @BOOK{Shir95:Scheduling, AUTHOR="B. A. Shirazi and A. R. Hurson and K. Kavi", TITLE="Scheduling and Load Balancing in Parallel and Distributed Systems", ISBN="0-8186-6587-4", PUBLISHER="IEEE Computer Society Press", ADDRESS="Los Alamitos, California", YEAR=1995, KEYWORDS="Concurrent system; distributed system; load balancing; load measurement; load sharing; scheduling; tool", ABSTRACT="The central goal of this book is to provide an overview, a detailed discussion, and a prognosis of future directions of the static scheduling and dynamic load balancing methods in parallel and distributed systems. The book covers a wide range of topics, from theoretical background to practical state-of-the-art scheduling and load balancing techniques. However, as scheduling and load balancing can potentially cover a very broad range of topics.", } @ARTICLE{Shyu9509:Survivable, AUTHOR="Ching-Chir Shyur and Shan-Hsin Tsao and Yunnan Wu", TITLE="Survivable Network Planning Methods and Tools in Taiwan", JOURNAL=ieeecm, VOLUME=33, NUMBER=9, PAGES="100-109", MONTH="Sep", YEAR=1995, REFERENCES=12, KEYWORDS="Survivable; network planning methods and tools; Taiwan; telecommunications networks; restoration services; DGT; Fault tolerance; fiber optics; protection; sdh; self healing network; tool", ABSTRACT="The capability of telecommunications networks to restore services affected by failures is a consideration in designing a broadband network architecture. The authors describe the survivable transport network planning methods and tools of the Telecommunication Laboratories of DGT in Taiwan. We introduce the survivable transport network planning methods and tools of Telecommunication Laboratories (TL) in Taiwan. The paper describes: conventional survivable architecture planning, hubbing architecture based on DCS restoration network planning, and SDH network architecture planning.", } @TECHREPORT{Simo95:Entwurf, AUTHOR="D. Simonovich", TITLE="Entwurf und Bewertung konservativer Verfahren in der verteilten Simulation", TYPE="Berichte des Fachbereichs Informatik", INSTITUTION="Fachbereich Informatik der Universität Hamburg", ADDRESS="Hamburg, Germany", YEAR=1995, LANGUAGE="German", KEYWORDS="Performance measurement; simulation", } @BOOK{Sing95:Semiconductor, AUTHOR="J. Singh", TITLE="Semiconductor Optoelectronics: Physics and Technology", ISBN="0-07-113577-4", PUBLISHER="McGraw-Hill Series in Electrical and Computing Engineering, McGraw-Hill", ADDRESS="Singapore, T", YEAR=1995, KEYWORDS="Fiber optics; hardware device; physics; technology", ABSTRACT="-Semiconductor Technology -Physics of Semiconductors - Semiconductor Optoelectronic Devices -System Needs and New Device Challenges", } @ARTICLE{Soro95:Multi, AUTHOR="M. Soroushnejad", TITLE="Multi-Access Strategies for an Integrated Voice/Data {CDMA} Packet Radio Network", JOURNAL=ieeecom, VOLUME=43, NUMBER=2, PAGES="935-945", YEAR=1995, REFERENCES=14, KEYWORDS="Voice/data integration", ABSTRACT="Multiple-access schemes are introduced and analyzed for the integration of voice and data traffic in packet radio networks using code-division multple-access (CDMA).", } @ARTICLE{Srin95:Impact, AUTHOR="Sengamedu Hanumantharao Srinivasan", TITLE="Impact of Enhanced Feature Interactions", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=33, NUMBER=1, PAGES="100-102", YEAR=1995, REFERENCES=3, KEYWORDS="In; intelligent network; telephony", } @ARTICLE{Stee95:System, AUTHOR="Raymond Steele and J. Whitehead and Wai-Choong Wong", TITLE="System Aspects of Cellular Radio", JOURNAL=ieeecm, ISBN="0163-6804", VOLUME=33, NUMBER=1, PAGES="80-86", YEAR=1995, REFERENCES=17, KEYWORDS="Cellular system; system design", ABSTRACT="The gratest single factor in enhancing spectral efficiency of a network is not complex multiple access techniques, efficient speech and channel coding, modulation, powerful protocols, etc., but the mass deployment of microcells. By this technique we can repeatedly and efficiently reuse the precious spectrum.", } @ARTICLE{Stei95:Evolutionary, AUTHOR="K.-U. Stein and G. von Straten and K. H. Moehrmann and K. A. Lutz and others", TITLE="Evolutionary Architecture for an All-Services {ATM} Access Network", JOURNAL="International Journal of Communication Systems", ADDRESS="Great Britain", VOLUME=8, NUMBER=4, PAGES="267-274", YEAR=1995, REFERENCES=6, KEYWORDS="Atm; broadband; network architecture; network evolution; access network", ABSTRACT="This paper presents a flexible concept for a broadband subscriber access network which minimizes investment costs by predominantly using the existing network infrastructure. The target network may consist of either a coaxial tree-and-branch structure or symmetrical copper pairs to the subscriber, and is connected to the central head station with the aid of optical feeder lines which can be implemented or enhanced by a PON.", } @ARTICLE{Stre95:Crossconnects, AUTHOR="B. Strebel and C. Caspar and H.-M. Foisel", TITLE="Crossconnects in optisch transparenten Netzen", JOURNAL=ntz, ISBN="0948-728X", ADDRESS="Germany", VOLUME=48, NUMBER=9, PAGES="36-40", YEAR=1995, LANGUAGE="German", REFERENCES=6, KEYWORDS="Cross connect; fiber optics; network; optical switching", ABSTRACT="Optisch transparente Netze werden ein wesentlicher Bestandteil künftiger Kommunikationsnetze sein, deren Leistungsfähigkeit durch die Verwendung der optischen Frequenzmultiplextechnik und von optischen Crossconnects maßgeblich bestimmt ist. Ein bedeutendes Merkmal dieses Netzes stellt die Transparenzlänge des optischen Signalpfads dar. Die Transparenzlänge ist durch die Eigenschaften der Übertragungsstrecke und der Crossconnects bestimmt.", } @ARTICLE{Stri95:Massively, AUTHOR="Stephen G. Strickland and R. G. Phelan", TITLE="Massively Parallel {SIMD} Simulation of Markovian {DEDS:} Event and Time Synchronous Methods", JOURNAL="Discrete Event Dynamic Systems: Theory and Applications", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston, Massachusetts", VOLUME=5, PAGES="141-166", YEAR=1995, REFERENCES=22, KEYWORDS="Distributed simulation; simd; simulation", ABSTRACT="We examine two schemes for parametric parallel simulation on SIMD supercomputers. ... In contrast to most parallel simulation approaches - wich simulate a single system using multiple processors - we simulate distinct parametric variants at each processor. We extract some of the common computation embedded in these simulations and perform it on the front-end, leaving the rest to the parallel processors.", } @ARTICLE{Sttt95:Network, AUTHOR="Heinrich J. Stüttgen", TITLE="Network Evolution and Multimedia Communication", JOURNAL=ieeemm, VOLUME=2, NUMBER=3, PAGES="42-59", MONTH="Fall", YEAR=1995, REFERENCES=26, KEYWORDS="ATM; communication network; DQDB; ISDN; multimedia; service characterization; survey", ABSTRACT="This survey paper analyzes communication requirements of evolving distributed multimedia applications. In order to understand the ongoing evolution of networking, we study how current and new networking technologies support the identified requirements. Besides functional aspects, the question how the new technologies blend with the existing infrastructures is analyzed. Infrastructure investments, e.g. wiring, interconnection and management contribute the largest part of the cost associated with the introduction of new networking technologies, thus this aspect is crucial for the success of a new technology. Finally a brief discussion of the higher layer communication issues associated with the support of integrated multimedia communication concludes the paper.", URL="http://www.computer.org/multimedia/mu1995/u3toc.htm", } @INPROCEEDINGS{Suzu95:Switched, AUTHOR="Yasunobu Suzuki", TITLE="Switched Access Star {(SAS):} Cost Effective System as Optical Fiber Infrastructure", BOOKTITLE=efoc, PAGES="169-172", YEAR=1995, REFERENCES=3, KEYWORDS="Optical switching; star network; access network", ABSTRACT="A Switched Access Star (SAS) architecture which connects one OSU in a central office to multiple ONUs via an optical switch is proposed.", } @INPROCEEDINGS{Swan95:High, AUTHOR="E. A. Swanson and R. A. Barry and D. M. Castagnozzi and S. G. Finn and others", TITLE="High Density {WDM} Network", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="228-231", YEAR=1995, REFERENCES=6, KEYWORDS="Field trial; wdm", ABSTRACT="A High-Density WDM AON is developped and new network architectures, technology components and a test-bed demonstration are shown.", } @ARTICLE{Szym95:Randomized, AUTHOR="T. H. Szymanski and Chien Fang", TITLE="Randomized Routing of Virtual Connections in Essentially Nonblocking Log N-Depth Networks", JOURNAL=ieeecom, VOLUME=43, NUMBER=9, PAGES="2521-2531", YEAR=1995, REFERENCES=25, KEYWORDS="Banyan network; circuit switching; random routing; virtual channel", } @ARTICLE{Taka95:XCM, AUTHOR="H. Takamoto and K. Ikeda and T. Noda and K. Yokochi", TITLE="{XCM-3} Cross-connect Equipment", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="23-26", YEAR=1995, REFERENCES=5, KEYWORDS="Cross connect; fiber optics; network; sdh; technology", ABSTRACT="In order to efficiently operate a network, an XCM-3 cross-connect system was developed which modifies the circuit in the transmission node of an area network. This equipment enables a system configuration which, by performing circuit modification efficiently, can flexibly match the configuration and scale of the area network; the equipment also easily handles functional modifications and additions by means of software implementation of the equi", } @ARTICLE{Taki95:Conformance, AUTHOR="T. Takine and B. Sengupta and Toshiharu Hasegawa", TITLE="A Conformance Measure for Queues", JOURNAL="Communications in Statistics - Stochastic Models", VOLUME=11, NUMBER=4, PAGES="645-670", YEAR=1995, REFERENCES=19, KEYWORDS="Interdeparture time; leaky bucket; map; output process; queue length; queueing system", ABSTRACT="In this paper, we view a queue as a filter which modifies an input process to an output process. In so doing, a question of interest is the following: To what extent has the input process been modified, or, to what extent does the output process conform to the input process? To this end, we define and characterize a conformance measure. We apply this idea to a telecommunication problem in which this issue arises naturally. We show how to find t", } @INPROCEEDINGS{Tand95:Scalable, AUTHOR="V. Tandon", TITLE="Scalable Optical Network providing Bandwith on Demand for Broadband Interactive Services", BOOKTITLE=efoc, ISBN="3-905084-38-4", ADDRESS="Basel, Switzerland", PAGES="232-235", YEAR=1995, REFERENCES=9, KEYWORDS="Transparency; wdm", ABSTRACT="Because of new broadband services network operators can expect that bandwith requirements increase significantly. In this paper the use of WDM is examined to upgrade PONs. A novel network, the LambdaPON, is proposed, which makes optical transparent connections available. Also wavelength reuse is proposed to augment network capacity.", } @BOOK{Tane95:Moderne, AUTHOR="A. S. Tanenbaum", TITLE="Moderne Betriebssysteme: 2., verb. Aufl.", ISBN="3-446-18402-3", PUBLISHER="Hanser-Studienb cher der Informatik, Hanser", ADDRESS="M nchen, Germany", YEAR=1995, LANGUAGE="German", REFERENCES=77, KEYWORDS="Distributed system; multiprocessing; multiprocessor; operating system; unix; virtual memory", } @ARTICLE{Tanr95:Impact, AUTHOR="M. O. Tanrikulu and Ozan K. Tonguz", TITLE="The Impact of Crosstalk and Phase Noise in Multichannel Coherent Optical {ASK} Systems", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="1278-1286", YEAR=1995, REFERENCES=14, KEYWORDS="Multichannel", ABSTRACT="This paper investigates the effect of crosstalk in multichannel coherent optical ASK systems. A closed-form signal-to-noise ratio expression as a function of number of channels, channel separation, laser phase noise, intermediate frequency filter bandwidth expansion factor, system bit rate, and additive shot noise is presented.", } @ARTICLE{Thom95:Zuk, AUTHOR="K. Thomas", TITLE="Die zukünftige Netzevolution bei der Deutschen Telekom", JOURNAL=ntz, ISBN="0948-728X", ADDRESS="Germany", VOLUME=48, NUMBER=3, PAGES="10-17", YEAR=1995, LANGUAGE="German", KEYWORDS="In; network; network evolution", ABSTRACT="Stand der Telekom Geplante Evolution: - Produktivitätssteigerung durch: bis '97 VST in neuen Bundesländern komplett digital, in alten Bundesländern jede VST zumindest z.T. digital; bis 2000: keine elektromechanische Wähler mehr im Netz in Zukunft: 23 Weitverkehrs-VST statt bisher 71 Zentral-/Haupt-VST - Weiterentwicklung der Netze: 3 Ebenen: übertragungstechnische Ebene", } @INPROCEEDINGS{Till95:Optical, AUTHOR="F. Tillerot and R. Auffret and D. H. B. Hoa and F. Delorme and others", TITLE="All Optical Synchronous Burst and Wavelength Conversion Routing Access Network", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="433-436", YEAR=1995, REFERENCES=4, KEYWORDS="Star network; access network", ABSTRACT="A star network using synchronous burst access and wavelangth conversion routing scheme is experimentally tested. The node router controls the subscriber addresses, lowering the complexity of user terminals and offering a multi-connection capability.", } @INPROCEEDINGS{Till95:WDM, AUTHOR="F. Tillerot and M. J. Chawki and V. Tholey and D. H. B. Hoa and others", TITLE="Introduction of the {WDM} Technique in {SDH} Networks", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="392-396", YEAR=1995, REFERENCES=8, KEYWORDS="Optical switching; sdh; wdm", ABSTRACT="This paper is focused on the introduction of the multiwavelength technique in the three layers of a SDH based network. In the trunk layer, WDM offers optical parallelism in a single fiber. Cross-connection can be achieved either passively (i. e. with tunable filters) or by means of wavelength converters. The latter solution was implemented in a 4x4 optical cross-connect. In the junction network, the feasibility of a 3-station WDM self-healing r", } @INPROCEEDINGS{Toku95:Optical, AUTHOR="Nobuyuki. Tokura and Y. Kajiyama", TITLE="An Optical Path based Self-Healing Ring System", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="473-476", YEAR=1995, REFERENCES=9, KEYWORDS="Error recovery; protection; ring network; self healing network", } @ARTICLE{Tomi95:Connection, AUTHOR="T. Tomioka and S. Ohshima", TITLE="Connection-Based Optical Wavelength Division Multiplexed Network with Time Slot Rearrangement", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="1295-1300", YEAR=1995, REFERENCES=5, KEYWORDS="Lan; rearrangement; star network; tdm; wdm", ABSTRACT="We have proposed a connection-based optical WDM network architecture. The topology is passive star and a network controller (NWC) is connected to manage the time slot assignment. Each station's transmitting wavelength is fixed and is different from that of other stations. Each receiver changes the receiving wavelength slot by slot. Stations reserve time slots with permission of the NWC. Once a time slot is reserved the station can use the slot", } @INPROCEEDINGS{Tong95:Wavelength, AUTHOR="Franklin Fuk-Kay Tong and K. L. Ho and T. Schrans and W. E. Hall and G. Grand and others", TITLE="A Wavelength-Matching Scheme for {WDM} Systems", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="797-800", YEAR=1995, REFERENCES=10, KEYWORDS="Optical switching; wdm", ABSTRACT="We propose a simple and low-cost wavelength-matching scheme for multi-wavelength optical links and networks using grating demultiplexers. We demonstrated that the wavelength can be matched and maintained within 0.006nm with teh reference wavelength.", } @ARTICLE{Tong95:Principles, AUTHOR="Sheau-Ru Tong and Dong-Hui Du and Ronald J. Vetter", TITLE="Design Principles for Multi-Hop Wavelength and Time Division Multiplexed Optical Passive Star Networks", JOURNAL=jhsn, VOLUME=4, NUMBER=2, PAGES="189-200", YEAR=1995, REFERENCES=7, KEYWORDS="Interconnection network; star network; wdm", ABSTRACT="In this paper we study multi-hop WTDM networks where each station has only one fixed wavelength transmitter and one fixed wavelength receiver. We propose a graph model, called a Receiving Graph Model, to represent these networks such that their inherent properties can be easily understood and alternative designs can be compared. Furthermore, we discuss several design principles and theoretical performance limitations of such networks.", } @ARTICLE{Topl95:Synchronization, AUTHOR="S. Topliss and D. Beeler and L. Altwegg", TITLE="Synchronization for Passive Optical Networks", JOURNAL=ieeejlt, VOLUME=13, NUMBER=5, PAGES="947-953", YEAR=1995, REFERENCES=19, KEYWORDS="Atm; synchronization; tdm; technology", ABSTRACT="This paper addresses the problem of synchronization at the line termination of a passive optical network that uses high-speed time division multiple access. Synchronization is a critical function since each ATM cell arrives with unknown phase. An ASIC has been developed to perform this function at 622Mb/s and is outlined here.", } @BOOK{Torn95:Instruction, AUTHOR="H. C. Torng and S. Vassiliadis", TITLE="Instruction-Level Parallel Processors", ISBN="0-8186-6527-0", PUBLISHER="IEEE Computer Society Press", ADDRESS="Los Alamitos, California", YEAR=1995, REFERENCES=17, KEYWORDS="Multiprocessing; parallel computing; pipeline processing; processor", ABSTRACT="Contents: Introduction Dependencies among instructions and their resolution Branch handling Code scheduling and VLIW machine organizations Superscalar machine organizations Memory accesses, interrupt handling, and multithread processing Measurements of instruction-level parallelism", } @ARTICLE{Touc95:Defining, AUTHOR="Joseph D. Touch", TITLE="Defining High-Speed Protocols: Five Challenges and an Example that Survives the Challenges", JOURNAL=ieeejsac, VOLUME=13, NUMBER=5, PAGES="828-835", YEAR=1995, REFERENCES=14, KEYWORDS="Communication protocol; network protocol; protocol engineering", ABSTRACT={The First IEEE Gigabit Networking (GBN) Workshop defined a set of characteristics of "interesting" high-speed applications The GBN criteria ensure that the application addresses a significant problem, and that it actually requires a gigabit network. This paper presents five challenges that augment the GBN criteria. These challenges ask whether gigabit applications require new research into different protocols, or can be supported by exiting pro}, } @ARTICLE{Trid95:Supporting, AUTHOR="S. Tridandapani and J. S. Meditch", TITLE="Supporting Multipoint Connections in Multi-Hop {WDM} Optical Networks", JOURNAL=jhsn, VOLUME=4, NUMBER=2, PAGES="169-187", YEAR=1995, REFERENCES=26, KEYWORDS="Multicast; network topology; traffic model; wdm", ABSTRACT="The paper presents a heuristic algorithm for the optimal placement of nodes to satisfy traffic matrices that have multipoint connections. Two logical topologies, the bidirectional linear chain and the bidirectional ring, are the target topologies considered. They are evaluated with respect to three traffic madels based on fixed, uniform, and geometric distribution of the number of destinations. Monte-Carlo simulation results for this algorithm", } @INPROCEEDINGS{Trid95:CHANNEL, AUTHOR="S. Tridandapani and B. Mukherjee", TITLE="{CHANNEL} {SHARING} {IN} {MULTI-HOP} {WDM} {LIGHTWAVE} {NETWORKS} (Do We Really Need More Channels?)", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="1773-1778", YEAR=1995, REFERENCES=11, KEYWORDS="Multihop; performance evaluation; star network; wdm", ABSTRACT="We provide a general method using channel-sharing to construct practical multi-hop networks under this limitation (number of wavlengths). The method is applied to a generalized shuffle-exchange-based architecture. We also develop a general modeling procedure for the analysis of shared-channel multi-hop WDM networks. The analysis enables the study of the effects of two important parameters governing the performance of such networks, namely propa", } @ARTICLE{Tsai95:Bandwidth, AUTHOR="Shiau-He Tsai and T.-P. Lin and C. Qiao", TITLE="Bandwidth allocation for isochronous connections in {DQDB} using the {PA} scheme", JOURNAL=comcom, VOLUME=18, NUMBER=8, PAGES="545-551", YEAR=1995, REFERENCES=14, KEYWORDS="Bandwidth allocation; dqdb; man; network; scheduling; synchronous transmission", ABSTRACT="The PA scheme in DQDB is suitable for constant-rate and connection-oriented transmissions. In this paper, we propose and evaluate four bandwidth allocation policies, which are based on the harmonic case of the pinwheel scheduling algorithm. for isochronous connections using the PA scheme.", } @INPROCEEDINGS{Uchi95:Environment, AUTHOR="S. Uchiyama and T. Nishida and Hitoshi Watanabe and Y. Hirohisa", TITLE="An Environment for Supplementary Service Development", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="88-102", YEAR=1995, REFERENCES=8, KEYWORDS="In; intelligent network", ABSTRACT="This paper describes a supplementary service control architecture and an environment for supplementary service development. Using these technologies, we have achieved a substantial improvement in efficiency and quality of supplementary service software development. In our architecture, the basic service control is properly separated to a basic call state model (BCSM) and a call control common library, which is a collection of service software", } @ARTICLE{Ulus95:Network, AUTHOR="Ozgür Ulusoy", TITLE="Network access protocol for hard real-time communication systems", JOURNAL=comcom, VOLUME=18, NUMBER=12, PAGES="943-948", YEAR=1995, REFERENCES=12, KEYWORDS="Csma/cd; lan; media access control; real time; time constrained communication", ABSTRACT={In this paper, we propose a new real-time network access protocol which is based on the CSMA/CD scheme. The protocol classifies the messages into two classes as "criticla" and "noncritical" messages. The messages close to their deadlines are considered to be critical. A critical message is givben the right to access the network by preempting a noncritical message in transmission. ...}, } @ARTICLE{Unge95:Hoher, AUTHOR="B. Ungerer", TITLE="Hoher Kehrwert", JOURNAL=ct, ADDRESS="Germany", VOLUME=4, PAGES="278-288", YEAR=1995, LANGUAGE="German", REFERENCES=4, KEYWORDS="Ethernet; HSLAN; LAN", ABSTRACT="Ein heftiger Zwist ums Ethernet-Erbe ist im Gang. Die Kontrahenten sind verschieden kompatibel zu 10Base-T: 100VG will die Verkabelung sichern, 100Base-T das Protokoll. Als Alternative gilt Switching, das ein altes Netz mit Minimalaufwand beschleunigen kann. Twisted-Pair-Verkabelungen sind sofort aufr stbar - doch lohnt sich auch ein Kehraus der Koax-Netze?", } @INPROCEEDINGS{Bree95:Functional, AUTHOR="J. van Breemen and I. Carretero and G. Kettler and A. Profumo and others", TITLE="A Functional Architecture for the {ATM} Access Network", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="357-361", YEAR=1995, REFERENCES=5, KEYWORDS="Atm; access network", ABSTRACT="A set of general requirements for the Access Network is presented. taking into account these requirements, a number of ATM functions is elaborated and some trade-offs are indicated. This leads to a generic functional architecture that supports different types of network elements in the AN, like active multiplexers or concentrators, service multiplexers and Passive Optical Networks (PON). We apply the general functional architecture to specific", } @INPROCEEDINGS{Plas95:Demonstration, AUTHOR="G. van der Plas and R. Smets and B. Suard and Willem Verbiest", TITLE="Demonstration of an {ATM-based} Passive Optical Network in the {FTTH} trial on Bermuda", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="988-992", YEAR=1995, REFERENCES=5, KEYWORDS="Atm; field trial; access network", ABSTRACT="This paper presents an ATM-based Passive Optical Network (APON) that has been installed for a VoD trial on Bermuda. An overview is given of the configuration of the network and of the operation of the VoD service. The basic principles of the operation of the APON access network are presented.", } @INPROCEEDINGS{Vand95:Evolution, AUTHOR="Gert Van der Plas and I. de Voorde", TITLE="The Evolution of the Optical Access Network and the Related Technical Issues", BOOKTITLE="SPIE All-Optical Communication Systems: Architecture, Control, and Network Issues", ISBN="0-8194-1978-8", ADDRESS="Bellingham, USA", PAGES="296-303", YEAR=1995, REFERENCES=7, KEYWORDS="Atm; network architecture; network evolution; access network", ABSTRACT="Currently, the developed bi-directional broadband PONs have a maximum splitting factor around 32 and a range less thatn 20 km. Due to the expected switching node consolidation the access network will have to cover a wider range. An access network based on a cascade of PONs is proposed. Optical transmission is supported by the introduction of optical amplifiers, offering the advantage of transparency. In this paper, the technological issues to r", } @INPROCEEDINGS{VanH95:Liberalisation, AUTHOR="B. Van Houtte", TITLE="Liberalisation of Telecommunications Infrastructure and Services in the European Union", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="485-492", YEAR=1995, REFERENCES=9, KEYWORDS="Communication network; integrated network", ABSTRACT="In 1987 the EU has started the process of liberalising the telecommunications industry.The regulations and steps for reaching a the free market are described.", } @INPROCEEDINGS{Maas95:Call, AUTHOR="C. van Maastricht and E. Schalk", TITLE="Call modelling in a Broadband {IN} architecture", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="340-344", YEAR=1995, REFERENCES=4, KEYWORDS="B-isdn; in; intelligent network; model; standard; standardization", ABSTRACT="This paper describes the design of a telecommunication system based on integration of IN and B-ISDN technology. The target of the design is to construct a system architecture with flexible broadband service creation and execution within the framework of the currently available documentation on IN Capability Set 2 and B-ISDN Capability Set 2. The scope is limited to the functional model and the call modelling. The functional model of the integra", } @ARTICLE{Nee95:Slotted, AUTHOR="Richard {Van Nee} and Rogier van Wolfswinkel and Ramjee - Prasad", TITLE="Slotted {ALOHA} and Code Division Multiple Access Techniques for {LAND-Mobile} Satellite Personal Communications", JOURNAL=ieeejsac, VOLUME=13, NUMBER=2, PAGES="382-388", YEAR=1995, REFERENCES=20, KEYWORDS="Mobile radio; satellite radio; slotted aloha", } @INPROCEEDINGS{Venk95:MAC, AUTHOR="P. Venkataram and S. R. Pawamana", TITLE="A design of a {MAC} layer a protocol for {CBR} and {VBR} data transmission on single channel in wireless {LANs}", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="684-689", YEAR=1995, REFERENCES=13, KEYWORDS="Media access control; mobile radio", ABSTRACT="This paper presents a design of a MAC Layer protocol for CBR and VBR traffic transmission on a single channel in wireless LANs. The proposed protocol utilizes the channel spatially in a distributed manner on any partially connected networks.", } @ARTICLE{Vita95:Supervisory, AUTHOR="P. D. Vita and M. Potenza", TITLE="Supervisory systems for optically amplified networks: issues and trends", JOURNAL="CSELT Technical reports", ADDRESS="Italy", VOLUME=23, NUMBER=5, PAGES="583-592", YEAR=1995, REFERENCES=26, KEYWORDS="Fiber optics; monitoring; standardization", ABSTRACT="This contribution discusses proposals, problems and trends in the field of supervisory systems for optically amplified telecommunications networks. Possible implementations of this monitoring channel are briefly reviewed, stressing advantages and drawbacks of the various schemes. Finally, a general philosophy for the supervisory channel reflecting the current views of the standardizations bodies is presented.", } @ARTICLE{Vita95:Still, AUTHOR="P. D. Vita and A. Rossaro", TITLE="Still open questions in optical fibres and cables standardization", JOURNAL="CSELT Technical reports", ADDRESS="Italy", VOLUME=23, NUMBER=5, PAGES="681-689", YEAR=1995, REFERENCES=27, KEYWORDS="Fiber optics; standard; standardization", ABSTRACT="An overview of the main standardization activities in the field of optical fibres and cables is presented. Attention is focussed on the current status of standardization and emerging trends in the work of the main international bodies. Outstanding problems are discussed together with a number of proposed solutions.", } @PROCEEDINGS{Vuon95:Protocol, TITLE="Protocol Specification, Testing and Verification {XIV}", EDITOR="Son Vuong and S. T. Chanson", ISBN="0-412-63640-9", PUBLISHER="Chapman \& Hall", ADDRESS="London, Great Britain", YEAR=1995, KEYWORDS="Protocol; protocol specification; protocol testing; protocol verification", } @INPROCEEDINGS{Wada95:Progress, AUTHOR="O. Wada", TITLE="Progress in Optoelectronic Device Technologies for Optical Interconnection and Photonic Switching", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="214159-163", YEAR=1995, REFERENCES=5, KEYWORDS="Optical switching", ABSTRACT="Device Technologies for optical interconnections and photonic switching are proposed. Optical signal transmission provide many advantages to conventional electrical wiring. An approach to develop ultrafast all-optical switching devices is described.", } @INPROCEEDINGS{Waka95:Intelligent, AUTHOR="M. Wakamoto and M. Fukazawa and M. Kim and Kurenai Murakami", TITLE="Intelligent Network Architecture with Layered Call Model for Multimedia-on-Demand Service", BOOKTITLE=iss, ISBN="3-8007-2093-0", ADDRESS="Berlin, Offenbach, Germany", PAGES="201-205", YEAR=1995, REFERENCES=3, KEYWORDS="B-isdn; in; intelligent network; multimedia", ABSTRACT="This paper proposes an intelligent network (IN) architecture for a multimedia-on-demand (MOD) service, paying particular attention to the call model. It describes the requirements for and a general model of a MOD service from a service control viewpoint. We first demonstrate that IN architecture is effective for MOD service control. Next we propose a call model, which is an essential element of IN service control architecture. A specific MOD se", } @ARTICLE{Wata95:Optical, AUTHOR="Akira Watanabe and S. Okamoto and K. Sato", TITLE="Optical Path Cross-Connect Node Architecture Offering High Modularity for Virtual Wavelength Paths", JOURNAL=ieice_communications, ADDRESS="Japan", VOLUME="E78-B", PAGES="686-693", YEAR=1995, REFERENCES=35, KEYWORDS="Cross connect; optical switching; technology; wdm", ABSTRACT="Recent technical advances in WDM technologies suggest that their practival application is imminent. By adopting WDM technologies in the transport network, a bandwidth abundant B-ISDN could be realized cost-effectively. This requires the introduction of WDM technologies, especially into the path layer. This paper explores optical path cross-connect (OPXC) nodes that offer very high levels of expandability because existing traffic demands, which", } @INPROCEEDINGS{Waut95:Wavelength, AUTHOR="N. Wauters and P. Demeester", TITLE="Wavelength Routing Algorithms for Transparent Optical Networks", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="855-858", YEAR=1995, REFERENCES=6, KEYWORDS="Algorithm; routing algorithm; wdm", ABSTRACT="An extensive study is made of wavelength routing in optical cross-connected networks. Different algorithms have been studied and compared on a variety of network examples.", } @INPROCEEDINGS{Waut95:G, AUTHOR="N. Wauters and P. Demeester and G. Depovere", TITLE="G.tna Representation of Optical Cross-Connected Networks", BOOKTITLE=efoc, PAGES="70-73", YEAR=1995, REFERENCES=6, KEYWORDS="Cross connect; network architecture; sdh; standard", ABSTRACT="A proposal is made to extend G.tna with optical layers to represent optical multiplexing and optical cross-connecting.", } @ARTICLE{Wegn95:Dynamische, AUTHOR="H. Wegner", TITLE="Dynamische Verkehrslenkung im geplanten Weitverkehrsnetz der Deutschen Telekom", JOURNAL=ntz, ISBN="0948-728X", PUBLISHER="VDE-Verlag", ADDRESS="Germany", VOLUME=48, NUMBER=12, PAGES="10-16", YEAR=1995, LANGUAGE="German", REFERENCES=8, KEYWORDS="Alternate routing; dynamic routing; hierarchical routing; routing", ABSTRACT="Netzstrukturen in der Telekommunikation: Hierarchische / Nichthierarchische Netze Neues Netzkonzept der Deutschen Telekom ADR (Alternative Dynamic Routing): dezentral, Auswahl günstiger Alternativwege mit zwei Wegabschnitten, zustandsabhängige Liste von verfügbaren Alternativwegen; genaue Beschreibung des Verfahrens Leistungsuntersuchungen mittels Simulation", } @ARTICLE{Weis95:Indices, AUTHOR="I. Weissman", TITLE="The Indices of the Largest among n Independent Observations", JOURNAL="Communications in Statistics - Stochastic Models", VOLUME=11, NUMBER=4, PAGES="613-629", YEAR=1995, REFERENCES=23, KEYWORDS="Asymptotic analysis; distribution; extreme value theorem; limit theorem; stochastic analysis; stochastic process", ABSTRACT="Let X\_1, X\_2,... be independent random variables with continuous distribution functions F\_1, F\_2, ... respectively, M\_n^k is the kth largest among X\_1, ... ,X\_n and L\_n^k = min{j<=n: X\_j = M\_n^k}. We study the asymptotic distribution of L\_n^k as n -> infinity and k is fixed under the assumption that there exist constants a\_n>0 and b\_n such that ... converges in distribution to an extremal process. We also report on some progress made in solving", } @ARTICLE{Wern95:Kleine, AUTHOR="B. Werner", TITLE="Der kleine Bruder des {Interbus-S} Die Integration des Sonsor-Loop", JOURNAL="Elektronik", ADDRESS="Germany", VOLUME=1, PAGES="44-46", YEAR=1995, LANGUAGE="German", KEYWORDS="Bus", ABSTRACT={Zusammen mit der Universität Magdeburg entwickelte Phoenix Contact den "Sensor-Loop". Auf Basis des Bussystems Interbus-S soll er den direkten Anschluß von analogen und digitalen Sensoren und Aktoren vereinfachen. Die Sensoren und Aktoren werden dabei nur noch mit einem zweiadrigen Kabel verbunden, das gleichzeitig Energie und Daten berträgt.}, } @ARTICLE{Wies95:Standard, AUTHOR="Jeffrey E. Wieselthier and C. M. Barnhart and Anthony Ephremides", TITLE="Standard Clock Simulation and Ordinal Optimization Applied to Admission Control in Integrated Communication Networks", JOURNAL="Discrete Event Dynamic Systems: Theory and Applications", PUBLISHER="Kluwer Academic Publishers", ADDRESS="Boston, Massachusetts", VOLUME=5, PAGES="243-280", YEAR=1995, KEYWORDS="Optimization; simulation", ABSTRACT="In this paper we apply the ideas of ordinal optimization and the technique of Standard Clock simulation to the voice-call admission-control problem in integrated voice/data multihop radio networks. This is an important problem in networking that is not amenable to exact analysis by means of the usual network modeling techniques. We first describe the use of the SC approach on sequential machines, and quantify the speedup in simulation time that", } @INPROCEEDINGS{Witt95:Effect, AUTHOR="S. Wittevrongel and H. Bruneel", TITLE="Effect of the on-period distribution on the performance of an {ATM} multiplexer fed by on/off sources: an analytical study", BOOKTITLE="Data Communications and their Performance: the Sixth IFIP WG6.3 Conference on Performance", ISBN="0-412-73250-5", ADDRESS="London, Great Britain", PAGES="33-47", YEAR=1995, REFERENCES=9, KEYWORDS="Atm; bursty traffic; multiplexer; performance evaluation; source model; traffic source model", ABSTRACT="In this paper, we consider a statistical multiplexer in an ATM network, which is fed by a finite number of independent bursty on/off traffic sources. Most of the previous work assumes a two-state on/off model, where both the on-periods and the off-periods are geometrically distributed. We assume a general distribution for the on-period lengths, and we study the effect of the on-period distribution on the multiplexer performance. Both the homoge", } @ARTICLE{Wong95:Technology, AUTHOR="Y.-M. Wong and D. J. Muehlner and C. C. Faudskar and others", TITLE="Technology Development of a High-Density 32-Channel 16-Gb/s Optical Data Link For Optical Interconnection Applications for the Optoelectronic Technology Consortium {(OETC)}", JOURNAL=ieeejlt, VOLUME=13, NUMBER=6, PAGES="995-1016", YEAR=1995, REFERENCES=23, KEYWORDS="Fiber optics; interconnection network; technology", ABSTRACT="A parallel, 32-channel, high density (140um pitch), 500 Mb/s NRZ, point-to-point, optical data link has been fabricated using existing GaAs IC, silicon optical bench and multichip module technologies. ...", } @ARTICLE{Wrig95:Architectural, AUTHOR="Thomas Wright", TITLE="An Architectural Framework for Networks", JOURNAL="British Telecommunications Engineering", ADDRESS="Great Britain", VOLUME=14, PAGES="141-148", YEAR=1995, REFERENCES=3, KEYWORDS="Architecture; future outlook; network architecture; overview", ABSTRACT="The very complexity of modern networks and the design dependencies between both jeopardises their viability and places considerable constraints on evolution. Network architecture offers a way out of this log jam by providing the discipline, concepts and terminology to compartmentalise the problem into manageable and unambiguous pieces. This article describes, at a top level, the role that network architecture plays in the process from customer", } @INPROCEEDINGS{Wutt95:Simple, AUTHOR="L. Wuttisittikulkij and Mike O'Mahony", TITLE="A Simple Algorithm for Wavelength Assignment in Optical Networks", BOOKTITLE="21st European Conference on Optical Communication (ECOC), Belgacom", ISBN="90-9008471-1", ADDRESS="Brussels, Belgium", PAGES="859-862", YEAR=1995, REFERENCES=11, KEYWORDS="Algorithm; routing algorithm; wdm", ABSTRACT="This paper presents a fast and practical algorithm that requires only a small number of iterations and demands considerably less computational time than standard optimisation methods for wavelength assignment on network links. In addition, no rearrangement of existing connections is required.", } @INPROCEEDINGS{Wutt95:MULTIWAVELENGTH, AUTHOR="L. Wuttisittikulkij and Mike O'Mahony", TITLE="{MULTIWAVELENGTH} {SELF-HEALING} {RING} {TRANSPARENT} {NETWORKS}", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="45-49", YEAR=1995, REFERENCES=12, KEYWORDS="Ring network; self healing network; wdm", ABSTRACT="This paper describes the use of optical CC nodes for implementing multiwavelength unidirectional and bi-direcitonal self-healing ring networks. A comparison of these two ring structures is presented in terms of the number of wavelengths required to satisfy a uniform random traffic demand. Two protection strategies based on the electronic self-healing ring principles are applied to the WDM networks.", } @INPROCEEDINGS{Xiao95:Perfonrmance, AUTHOR="W. Xiaowen and H. Shunji and L. Lemin", TITLE="Perfonrmance Evaluation of Priority Packet Reservation Multiple Access and Adaptive Packet Reservation Multiple Access", BOOKTITLE=iccc, ADDRESS="Seoul, ROK", PAGES="690-694", YEAR=1995, REFERENCES=10, KEYWORDS="Multiple access; prma", ABSTRACT="The multiple access protocol of the third generation microcellular wireless communication systems is researched in this paper. Packet Reservation Multiple Access (PRMA) is a Reservation-ALOHA like protocol for wireless terminals to transmit packet speech to a base station. Speech Activity Detection is used to increase capacity, therefore, Prma is most likely to be used in the future integrated microcellular wireless communication systems. In th", } @INPROCEEDINGS{Yama95:SPARE, AUTHOR="Jiro Yamada", TITLE="A {SPARE} {CAPACITY} {DESIGN} {METHOD} {FOR} {RESTORABLE} {NETWORKS}", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="931-935", YEAR=1995, REFERENCES=12, KEYWORDS="Algorithm; capacity planning; network design; network planning", ABSTRACT="This paper proposes an algorithm to design efficient spare path networks. This algorithm is a heuristic algorithm to achieve near-optimization by repeating the movement to objective-function-value constant orientation and the value decrease orientation. Performance evaluation results show that the solution obtained with the proposed method is very close to the LP solution.", } @ARTICLE{Yama95:Laser, AUTHOR="K. Yamada and H. Murai and N. Mineo and Y. Ogawa", TITLE="Laser Diode Monolithically Integrated With External Modulator", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="83-88", YEAR=1995, REFERENCES=14, KEYWORDS="Network; technology", } @ARTICLE{Yama95:Analog, AUTHOR="T. Yamaguchi and T. Itoh and J. Hanai and M. Saitoh and T. Tsubota", TITLE="Analog Optical Transmission System for Radio Base Stations", JOURNAL=oki, ADDRESS="Japan", VOLUME=61, NUMBER=15, PAGES="39-42", YEAR=1995, REFERENCES=4, KEYWORDS="Network; technology", } @INPROCEEDINGS{Yan95:DESIGNING, AUTHOR="J. Yan and M. E. Beshai", TITLE="Designing an {ATM-based} broadband network: an overview", BOOKTITLE=globecom, ISBN="0-7803-2509-5", ADDRESS="Singapore, SGP", PAGES="245-251", YEAR=1995, REFERENCES=8, KEYWORDS="Atm; connection admission control; network design; network planning; overview; qos", ABSTRACT="This paper highlights the main areas where the multi-service network design differs from that of the present telecommunications network, and offers an overview of an integrated solution to the entire analysis and synthesis problem. More detailed analysis is provided in two main areas: the network-wide link sizing and the end-to-end performance at both the call and cell levels. The performance evaluation is based on a precise and computationall", } @ARTICLE{Yene95:Flow, AUTHOR="B. Yener and Terry Boult", TITLE="Flow Trees: A Lower Bound Computation Tool with Applications to Rearrangeable Multihop Lightwave Network Optimization", JOURNAL=jhsn, VOLUME=4, NUMBER=1, PAGES="99-113", YEAR=1995, REFERENCES=11, KEYWORDS="Algorithm; lower bound; multihop; network; network optimization; wdm", ABSTRACT="This paper presents a new method for computing the lower bounds for multihop network design problems which is particularly well suited to optical networks. More specifically, given N stations each with d transceivers and pairwise average traffic values of the stations, the method provides a lower bound for the combined problem of finding optimum (i) allocation of wavelengths to the stations to determine a configuration and (ii) routing of the t", } @ARTICLE{Yosh95:Recent, AUTHOR="J. Yoshida and M. Naganuma", TITLE="Recent Research Trends and Issues in Photonic Switching Devices", JOURNAL=nttrev, ADDRESS="Japan", VOLUME=7, NUMBER=5, PAGES="24-29", YEAR=1995, REFERENCES=14, KEYWORDS="Optical switching; switching; technology; wdm", ABSTRACT="This special issue focuses on the photonic switching devices being studied and developed at the NTT Opto-electronics Laboratories. This paper summarizes the fundamentals of the photonic switching devices and their prospects.", } @ARTICLE{Zwei95:Effective, AUTHOR="G. Zweig", TITLE="An Effective Tour Construction And Improvement Procedure For The Traveling Salesman Problem", JOURNAL=or, VOLUME=43, NUMBER=6, PAGES="1049-1057", YEAR=1995, REFERENCES=25, KEYWORDS="Graph theory; greedy algorithm; heuristics; linear optimization; linear programming; optimization", ABSTRACT="This paper presents an effective neighborhood structure for the traveling salesman problem. The neighbors of a tour are defined as the tours that can be produced by breaking the initial tour into two closed subtours, rejoining the subtours in a new configuration, and finally performing local optimization around all the changed edges. This process of generating a neighbor is termed divide and merge.", } @INCOLLECTION{Shen95:Service, AUTHOR="S. Shenker", TITLE="Service Models and Pricing Policies for an Integrated Services {Internet}", BOOKTITLE="Public Access to the Internet", EDITOR="B. Kahin and J. Keller", PUBLISHER="MIT Press", PAGES="315-337", YEAR=1995, } @ARTICLE{Zhan9504:Rate, AUTHOR="Hui Zhang and D. Ferrari", TITLE="Rate-Controlled Service Disciplines", JOURNAL=jhsn, VOLUME=3, NUMBER=4, PAGES="389-412", YEAR=1995, } @TECHREPORT{Goya95:Generalized, AUTHOR="P. Goyal and Harrick Vin", TITLE="Generalized Guaranteed Rate Scheduling Algorithms: A Framework", INSTITUTION="Department of Computer Sciences, University of Texas at Austin", ADDRESS="Austin, Texas", NUMBER="TR-95-30", YEAR=1995, } @TECHREPORT{Jha95:Playback, AUTHOR="Sanjay Jha", TITLE="Playback and Jitter Control for Real-Time Video-conferencing", INSTITUTION="Department of Computer Science, Columbia University", ADDRESS="New York, New York", NUMBER="CUCS-031-95", YEAR=1995, KEYWORDS="jitter; playback control; playback delay; packet audio; packet video", ABSTRACT="The purpose of this report is to examine the problems associated with display (playback) of live continuous media under varying conditions for an internetwork of workstations running general purpose operating system such as Unix. Under the assumption that the network cannot guarantee the required bounds on delay and jitter, there is a need to accommodate the delay jitter in the end systems. Various methods of jitter smoothing at the end systems and their suitability to audio as well as video transmission have been discussed. An experimental test bed which was used to investigate these problems is described. Some initial empirical results obtained using this test bed are also presented.", URL="ftp://ftp.cs.columbia.edu/reports/reports-1995/cucs-031-95a.ps.gz", } @TECHREPORT{Flor95:QosME, AUTHOR="Patricia Florissi", TITLE="QoSME: {QoS} Management Environment", INSTITUTION="Department of Computer Science, Columbia University", ADDRESS="New York, New York", NUMBER="CUCS-036-95", NOTE="Phd Thesis", YEAR=1995, ABSTRACT="Distributed multimedia applications are sensitive to the Quality of Service (QoS) delivered by underlying communication networks. For example, a video conference exchange can be very sensitive to the effective network throughput. Network jitter can greatly disrupt a speech stream. The main question this thesis addresses is how to adapt multimedia applications to the QoS delivered by the network and vice versa. Such adaptation is especially important because current networks are unable to assure the QoS required by applications and the latter is usually unprepared for periods of QoS degradation. This work introduces the QoS Management Environment (QoSME) that provides mechanisms for such adaptation. The main contributions of this thesis are: (.) Language level abstractions for QoS management. The Quality Assurance Language (QuAL) in QoSME enables the specification of how to allocate, monitor, analyze, and adapt to delivered QoS. Applications can express in QuAL their QoS needs and how to handle potential violations. (.) Automatic QoS monitoring. QoSME automatically generates the instrumentation to monitor QoS when applications use QuAL constructs. The QoSME runtime scrutinizes interactions among applications, transport protocols, and Operating Systems (OS) and collects in QoS Management Information Bases (MIBs) statistics on the QoS delivered. (.) Integration of QoS and standard network management. A Simple Network Management Protocol (SNMP) agent embedded in QoSME provides QoS MIB access to SNMP managers. The latter can use this feature to monitor end-to-end QoS delivery and adapt network resource allocation and operations accordingly. A partial prototype of QoSME has been released for public access. It runs on SunOS 4.3 and Solaris 2.3 and supports communication on ATM adaptation layer, ST-II, UDP/IP, TCP/IP, and Unix internal protocols.", URL="ftp://ftp.cs.columbia.edu/reports/reports-1995/cucs-036-95.ps.gz", } @TECHREPORT{Flor95:Gigabit, AUTHOR="D. Florissi and Y. Yemini", TITLE="The gigabit per second Isochronet switch", INSTITUTION="Department of Computer Science, Columbia University", ADDRESS="New York, New York", NUMBER="CUCS-006-95", YEAR=1995, ABSTRACT="This paper overviews an electronic design and implementation of a scaleable gigabit per second multi-protocol switch based on the Isochronets high-speed network architecture. Isochronets do not require frame header processing in the switches and, consequently, they are scaleable with link speeds, support multiple frame structures, and are suitable for all-optical implementations. The electronic switch has low cost and uses simple off-the-shelf components. The switch interface is simple and provides novel services such as guaranteed Quality of Service (QoS) and propagation of synchronization signals to upper protocol layers, including applications. The switch allows the negotiation of QoS while promoting flexible resource sharing. This paper also proposes an all-optical switch design that can be realized with current optical devices. The modular switch designs are scaleable in number of nodes and link speed. Using faster implementation technology, the electronic design can reach scores of gigabits per second, while the all-optical design can potentially operate at terabits per second.", URL="ftp://ftp.cs.columbia.edu/reports/reports-1995/cucs-006-95.ps.gz", } @TECHREPORT{Yemi95:Overview, AUTHOR="Y. Yemini and D. Florissi", TITLE="An Overview of the Isochronets architecture for high speed networks", INSTITUTION="Department of Computer Science, Columbia University", ADDRESS="New York, New York", NUMBER="CUCS-007-95", YEAR=1995, ABSTRACT="This paper overviews the novel Route Switching (RS) technique. In RS, network nodes switch different routing trees over time. Traffic moves along routing trees to the roots during the tree activation period or band. Contrary to circuits, routes do not change frequently, allowing RS to pre-established routes for prolonged network operations. Contrary to packets, routes can be switched over time without frame header processing, allowing RS to scale to any network speed and to be implemented using all-optical technology. RS provide flexible quality of service control and multicasting through allocation of bands to trees. They can be tuned to span a spectrum of performance behaviors, outperforming both Circuit or Packet Switching, as evidenced by the performance study in this paper. RS is the basis for the novel Isochronets high-speed network architecture. Isochronets operate at the media-access layer and can support multiple framing protocols simultaneously. Internetworking is reduced to a simple media-layer bridging. A gigabit-per-second Isochronet switch prototype has been implemented to demonstrate the feasibility of RS.", URL="ftp://ftp.cs.columbia.edu/reports/reports-1995/cucs-007-95.ps.gz", } @ARTICLE{Perk95:Using, AUTHOR="C. E. Perkins and Kevin Luo", TITLE="Using {DHCP} with computers that move", JOURNAL=wln, VOLUME=1, PAGES="341-353", YEAR=1995, REFERENCES=13, KEYWORDS="DHCP; mobility; address allocation; security; wireless networks", ABSTRACT="The Dynamic Host Configuration Protocol (DHCP) was designed to allow the frequent allocation of resources and configuration information useful to Internet hosts at boot time, including Internet addresses in particular. It turns out that getting a new Internet address is crucial to the problem of enabling the movement of Internet hosts from one network to another, and thus DHCP is quite relevant to the problem of providing seamless, transparent mobility to Internet hosts. We decided to investigate the ways that DHCP could be of assistance in this regard. Since the DHCP protocol was not designed itself for the purpose of providing host mobility, a number of problems arise. Our experience with deploying DHCP, and our proposed mechanisms for the use of DHCP with mobile computers, are the subjects of this paper.", } @ARTICLE{Chas9509:Satellites, AUTHOR="Henry Chasia", TITLE="Satellites and Developing Countries", JOURNAL=ieeecm, VOLUME=33, NUMBER=9, PAGES="110-113", MONTH="Sep", YEAR=1995, KEYWORDS="Satellites; Developing Countries; economies", ABSTRACT="Most developing countries use satellite technology for international rather than for domestic communication. The potential exists in this application for enormous increases in traffic, and the impact on developing countries' economies will be the greatest.", } @ARTICLE{Bald9509:Latin, AUTHOR="Paulo Ricardo Hermano Balduino", TITLE="Latin America Goes Wireless via Satellite", JOURNAL=ieeecm, VOLUME=33, NUMBER=9, PAGES="114-123", MONTH="Sep", YEAR=1995, KEYWORDS="Latin America; Wireless; Satellite communications", ABSTRACT="At a time when Latin America is moving toward deregulation and competition, policies governing satellite communications shall be reconsidered to assure that the region will build up its position in this strategic area.", } @ARTICLE{John9509:Europe, AUTHOR="M. E. Johnson", TITLE="Europe Prepares for {WRC-95:} Mobile Satellite Service Issues", JOURNAL=ieeecm, VOLUME=33, NUMBER=9, PAGES="124-127", MONTH="Sep", YEAR=1995, KEYWORDS="Europe; WRC-95; Mobile Satellite Service", ABSTRACT="The basic objective of the European proposals is to achieve an even playing field for the introduction of competitive mobile satellite services that can provide global services from the earliest feasible common date.", } @ARTICLE{Zava9509:New, AUTHOR="J. de la", TITLE="A New {CITEL} Fosters Telecommunications in the Americas", JOURNAL=ieeecm, VOLUME=33, NUMBER=9, PAGES="128-131", MONTH="Sep", YEAR=1995, KEYWORDS="CITEL; Telecommunications; Americas", ABSTRACT="As CITEL becomes a more effective organization, the number of private entities seeking to be associate members will grow and have an ever increasing influence on the group's work.", } @INPROCEEDINGS{Elli95:Dynamic, AUTHOR="C. A. Ellis and Karim Keddara and Grzegorz Rozenberg", TITLE="Dynamic change within workflow systems", BOOKTITLE="COCS (Conference on organizational computing systems)", PAGES="10-21", YEAR=1995, KEYWORDS="CSCW; floor control; coordination", } @INPROCEEDINGS{Domm9508:Floor, AUTHOR="H.-P. Dommel and J. J. Garcia-Luna-Aceves", TITLE="Floor Control for Networked Multimedia Applications", BOOKTITLE="ACM SIGCOMM Middleware Workshop", ADDRESS="Cambridge, Massachusetts", MONTH="August/September", YEAR=1995, KEYWORDS="CSCW; floor control; coordination", URL="http://www.cse.ucsc.edu/research/ccrg/publications/peter.sigcomm95.mwws.pospaper.html", } @MISC{Sass95:rat, AUTHOR="M. Angela Sasse and V. J. Hardman and I. Kouvelas and C. E. Perkins and O. Hodson and A. I. Watson and Mark Handley and Jon Crowcroft", TITLE="{RAT} (Robust-Audio Tool)", YEAR=1995, KEYWORDS="rat; RTP; packet audio; loss compensation", ABSTRACT="The Robust-Audio Tool (RAT) is a tool designed to allow multiple users to talk to each other over the Multicast Backbone (Mbone) of the Internet. RAT is designed to be adaptive to network and host conditions.", URL="http://www-mice.cs.ucl.ac.uk/mice/rat/", } @BOOK{Frie95:Growth, AUTHOR="Amy Friedlande", TITLE="Emerging Infrastructure: The Growth of Railroads", PUBLISHER="CNRI", ADDRESS="Washington, DC", YEAR=1995, KEYWORDS="railroad; infrastructure", ABSTRACT="This paper examines the historical literature with respect to three related questions about the development of railroads: When and how did take-off occur? What were the public and private roles? And, how did an integrated infrastructure emerge from a web of independently owned lines with frequently incompatible physical attributes? Railroad construction in the U.S. began in the late 1820s and 1830s and took place over the next 70 years in the context of enormous geographical, demographic, social, and economic growth in the country as a whole. The railroads do not appear to have caused this growth, as has sometimes been alleged. But they did profoundly affect its course, and in so doing, became the dominant element of the national transportation system. By all accounts, 'take-off' for the railroads occurred in the 1850s. Before that time, the lines were mostly local. During and after the 1850s, however, construction accelerated rapidly, and relatively short routes were linked to provide longer distance traffic. Much of this traffic went from eastern urban centers to Chicago, which emerged as a transportation/processing hub between 1850 and 1860. By the Civil War, several companies had begun construction west of the Mississippi River in anticipation of a transcontinental railroad. Between 1860 and 1890, the national rail system became increasingly elaborate and uniform, characterized by standardization of gauge and administrative practices, and increasingly dominated by an emerging, informal group of major companies. As the first 'Big Business,' the major railroad companies pioneered modern business practices and organizational structures to cope with their own size, expansive operations, and internal complexities. With increasing size, moreover, they also became more similar and discovered advantages to cooperation in a climate otherwise characterized by fierce competition. Construction of railroads, like public works projects since the 1780s, was a joint public/private enterprise. The majority of the funding appears to have come from private sources. But public intervention played an important role, both in increasing investors' confidence and ensuring that sufficient funds would be available to complete construction.", URL="http://www.cnri.reston.va.us/series.html#rail", } @BOOK{Frie95:Natural, AUTHOR="Amy Friedlander", TITLE="Natural Monopoly and Universal Service: Telephones and Telegraphs in the {U.S.} Communications Infrastructure, 1837-1940", PUBLISHER="CNRI", ADDRESS="Washington, DC", YEAR=1995, KEYWORDS="telephone; telegraph; history", ABSTRACT="This study examines the history of the telegraph and telephone industries in the United States from the perspectives of technology, corporate strategy, politics, and economics. Under the aegis of the Bell Company and its successors, the telephone followed a path similar to that pioneered in the 1860s by the telegraph giant, Western Union. Indeed, the telephone itself was invented in the 1870s as an unanticipated product of efforts to solve technological limitations of telegraphy. Like Western Union, Bell targeted communications among urban, commercial interests (as opposed to private residential and/or rural users). And, like Western Union, Bell was eventually organized as a private sector monopoly. Limitations in telephone transmission capability in the 1870s and early 1880s initially confined the telephone company to local service, while telegraphy remained the only means of long distance communication. After 1885, Bell also began to move toward long distance service by forming a subsidiary, American Telephone and Telegraph (AT\&T). However, technology represented a constraint on long distance service until the introduction of the loading coil in 1900-1901. What drove AT\&T's research and development in long distance telephone technology in the late 1880s was the coming expiration of key patents in 1894, when AT\&T foresaw intense competition that did, indeed, occur. Between 1894 and 1907, independent telephone companies proliferated to meet consumer demand that AT\&T (re-structured in 1899 as the holding company of regional operating companies) had ignored. This partially organized independent movement challenged the Bell companies in key regions, notably the Midwest and the North Central states. To counter it, AT\&T through its affiliates similarly expanded its scope of service. AT\&T gradually assumed technological and organizational control of an integrated system of local and long distance service through a policy of interconnections with selected independent companies as well as through acquisitions, mergers, and (after 1907) a willing acceptance of state and federal regulation. Although dual service (i.e., access either to the Bell System or to telephone service offered by an independent company) persisted into the 1920s, the independents operated within the technological standard set by AT\&T. The telephone system was not fully extended to provide potential access to the entire population, particularly the dispersed rural poor, until the Rural Electrification Act (REA) and other federal programs provided the incentive after World War II. Thus, state and federal programs, which were designed for other purposes, were also instrumental in the expansion of telephone service to serve national needs.", URL="http://www.cnri.reston.va.us/series.html#teltel", } @INPROCEEDINGS{Jain95:OSU, AUTHOR="Raj Jain and Shiv Kalyanaraman and R. Viswanathan", TITLE="The {OSU} Scheme for Congestion Avoidance in {ATM} networks Using Explicit Rate Indication", BOOKTITLE="WATM First Workshop on ATM Traffic Management", ADDRESS="Paris, France", PAGES=20, YEAR=1995, ABSTRACT="An explicit rate indication scheme for congestion avoidance in computer and telecommunication networks is proposed. The sources monitor their load and provide the information periodically to the switches. The switches, in turn, compute the load level and ask the sources to adjust their rates up or down. The scheme achieves high link utilization, fair allocation of rates among contending sources and provides quick convergence. A backward congestion notification option is also provided. The conditions under which this option is useful are indicated.", URL="http://www.cis.ohio-state.edu/~jain/papers/osuc\_con.htm", } @BOOK{Kleij95:Speech, AUTHOR="W. B. Kleijn and K. K. Paliwal", TITLE="Speech Coding and Synthesis", PUBLISHER="Elsevier Press", ADDRESS="Amsterdam", YEAR=1995, KEYWORDS="speech; speech compression; signal processing", } @TECHREPORT{Resn95:Heavy, AUTHOR="Sid Resnick", TITLE="Heavy Tail Modeling and Teletraffic Data", TYPE="Technical Report", INSTITUTION="Cornell University", NUMBER="TR 1134", YEAR=1995, URL="ftp://ftp.orie.cornell.edu/pub/techreps/TR1134.ps.Z", } @TECHREPORT{Kris95:Pricing, AUTHOR="A. Krishnamurthy and T. D.C. Little and D. Castañon", TITLE="A Pricing Mechanism for Scalable Video Delivery", TYPE="MCL Technical Report", INSTITUTION="Department of Electrical and Computer Engineering, Boston University", ADDRESS="Boston, Massachusetts", NUMBER="10-01-1995", YEAR=1995, KEYWORDS="Scalable video delivery; pricing policy; real-time networks; connection-oriented services; protocols; video-on-demand", ABSTRACT="Many video applications exhibit tolerance to continuous media scaling. Scaling is acceptable due to human tolerance to degradation in picture quality, frame loss and end-to-end delay. CM scaling enables the network to utilize its resources efficiently for supporting additional customers and to increase its revenue. However, due to quality degradation, users will not be willing to tolerate scaling unless it is coupled with monetary or availability incentives. In this paper we propose a pricing policy and a corresponding admission control scheme for scalable video applications. The pricing policy is two-tiered, based on a connection setup component and a scalable component. Connections which are more scalable are charged less but are more liable to be degraded. The proposed policy trades off performance degradation with monetary incentives to improve user benefit and network revenue, and to decrease the blocking probability of connection requests. We demonstrate by means of simulation that this policy encourages users to specify the scalability of an application to the network.", URL="http://hulk.bu.edu/pubs/papers/1995/anand-msj95/TR-10-01-95.html", } @INPROCEEDINGS{Bail95:Modeling, AUTHOR="Joseph P. Bailey", TITLE="Modeling the Economics of Imperfect Interoperability for Telecommunications", BOOKTITLE="3rd International Conference on Telecommunication Systems Modeling and Analysis", ADDRESS="Nashville, Tennessee", YEAR=1995, REFERENCES=17, KEYWORDS="Internet economics; standardization", ABSTRACT="Different telecommunications applications, such as telephony, data transfer, broadcast video, etc., have risen as separate industries, each with its own infrastructure. Networks and their equipment have been tailored to meet specific applications. The boundaries between these infrastructures have been enforced through government regulation. There has been a recent change, however, in the way these infrastructures may be used for future applications. In general, notions of separate, closed systems have been abandoned for more open and interoperable systems. This change is seen in the technology, policy, and business of telecommunications. In this paper, we define interoperability and argue that perfect interoperability may not be attainable nor even desirable. We develop a conceptual framework of a continuum of degrees of interoperability and examine some metrics that quantify the benefits and costs of interoperability. Two models have been built to support our claims: video dial tone (VDT) and high definition television (HDTV). These models imply different levels of interoperability and support our conclusion that imperfect interoperability may be even more beneficial than perfect interoperability.", URL="http://rpcp.mit.edu/Pubs/model\_imp/abstract.html", } @MANUAL{SunS95:Sun, AUTHOR="SunSoft", TITLE="{SunSHIELD} Basic Security Module Guide", ORGANIZATION="SunSoft", ADDRESS="Mountain View, CA", YEAR=1995, } @TECHREPORT{Cros95:Active, AUTHOR="M. Crosbie and Eugene Spafford", TITLE="Active Defense of a Computer System Using Autonomous Agents", INSTITUTION="COAST Laboratory, Department of Computer Science, Purdue University", ADDRESS="West Lafayette, IN", NUMBER="CSD-TR-95-008", YEAR=1995, } @INPROCEEDINGS{Kuma95:Software, AUTHOR="Surinder Kumar and Eugene Spafford", TITLE="A Software Architecture to Support Misuse Intrusion Detection", BOOKTITLE="18th National Information Security Conference", PAGES="194-204", YEAR=1995, } @ARTICLE{Naor9502:Competitiveness, AUTHOR="Yossi Azar Joseph Naor and R. Rom", TITLE="The Competitiveness of On-Line Assignments", JOURNAL="Journal of Algorithms", VOLUME=18, NUMBER=2, PAGES="221-237", YEAR=1995, REFERENCES=14, ABSTRACT="Consider the on-line problem, where a number of servers are ready to provide service to a set of customers. Each customer's job can be handled by any of a subset of the servers. Customers arrive one by one and the problem is to assign each customer to an appropriate server in a manner that will balance the load on the servers. This problem can be modeled in a natural way by a bipartite graph where the vertices of one side (customers) appear one at a time and the vertices of the other side (servers) are known in advance. We derive tight bounds on the competitive ratio in both deterministic and randomized cases. Let n denote the number of servers. In the deterministic case we provide an on-line algorithm that achieves a competitive ratio of k=(log/sub 2/ n) (up to an additive 1) and prove that this is the best competitive ratio that can be achieved by any deterministic on-line algorithm. In a similar way we prove that the competitive ratio for the randomized case is k'=ln(n) (up to an additive 1). We conclude that for this problem, randomized algorithms differ from deterministic ones by precisely a constant factor.", } @BOOK{Huit95:Routing, AUTHOR="C. Huitema", TITLE="Routing in the {Internet}", ISBN="0-13-132192-7", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs", YEAR=1995, KEYWORDS="routing; OSPF; CIDR; IP multicast; IGMP; BGP", } @BOOK{Satt95:Internet, AUTHOR="Michael Sattler and Greg Horman", TITLE="{Internet} {TV} With Cu-Seeme", ISBN="1-575210061", PUBLISHER="SAMS", YEAR=1995, KEYWORDS="video conferencing; Cu-SeeMe", } @INPROCEEDINGS{Yene95:Topological, AUTHOR="B. Yener and Y. Ofek and M. Yung", TITLE="Topological Design of Loss-Free Switch-Based {LANs}", BOOKTITLE=infocom, ADDRESS="Boston, Massachusetts", PAGES="88-96", YEAR=1995, ABSTRACT="This paper presents a new design methodology and tools to construct a switch-based LAN with (i) scalable throughput, (ii) no loss due to congestion, and (iii) two routing modes: FIFO or non-FIFO. More specifically, given a bounded degree (number of switch ports) at each node, the design is based on the construction of multiple virtual rings under the following constraints: (i) the virtual rings are pairwise edge-disjoint, and (ii) there is at least one virtual ring between any pair of nodes. The target topology is obtained from the edge union of the multiple virtual rings. The objectives of the above two constraints are (i) to ensure no loss due to congestion inside the network of bursty traffic sources, and (ii) to ensure convergence of packets/cells to their destinations. The virtual rings are constructed by a new methodology that employs Combinatorial Block Designs together with a new algorithm for realizing any size networks. It is shown that the bound on the maximum route length, under the two constraints, is O(\sqrt N) for an N-node network.", } @INPROCEEDINGS{MacK95:Pricing, AUTHOR="Jeff MacKie-Mason and Hal R. Varian", TITLE="Pricing the {Internet}", BOOKTITLE="Kahin and Keller (eds): Public Access to the Internet", PUBLISHER="MIT Press", ADDRESS="Cambridge, MA", PAGES="269-314", YEAR=1995, ABSTRACT="We describe the technology and costs of the Internet, then discuss how to design efficient pricing in order to allocate scarce Internet resources. We offer a smart market as a device to efficiently price congestion", URL="http://www-personal.umich.edu/~jmm/papers.html", } @ARTICLE{Weis95:Composition, AUTHOR="Richard Weiss and A. Duda and D. K. Gifford", TITLE="Composition and Search with a Video Algebra", JOURNAL=ieeemm, VOLUME=2, NUMBER=1, MONTH="Spring", YEAR=1995, KEYWORDS="algebraic video; video algebra; content-based retrieval; video indexing and searching; video databases", ABSTRACT="We introduce a new data model called algebraic video that provides operations for the composition, search, navigation and playback of digital video presentations. Video presentations are composed using a video algebra that consists of a set of basic operations on video segments to produce a desired video stream. The video algebra contains operations for temporally and spatially combining video segments as well as for attaching attributes to these segments. Algebraic video access methods also query and navigation operations. Query and navigation allow users to discover video presentations of interest by describing desired attributes and exploring a presentation's context. Unlike previous approaches, algebraic video permits video expressions to be nested in arbitrarily deep hierarchies. It also permits video segments to inherit attributes by context. Experience with a prototype algebraic video system suggests that algebraic video is an effective way to access and manage video. The prototype system is used to discover video segments of interest from existing collections and create new video presentations with algebraic combinations of these segments.", URL="http://www.computer.org/multimedia/mu1995/u1toc.htm", } @ARTICLE{Meye95:MHEG, AUTHOR="Thomas Meyer-Boudnik and W. Effelsberg", TITLE="{MHEG} Explained", JOURNAL=ieeemm, VOLUME=2, NUMBER=1, MONTH="Spring", YEAR=1995, ABSTRACT="This article surveys the upcoming MHEG standard, as under development by the Multimedia Hypermedia Experts Group of ISO. Its scope is to define a system-independent encoding of the structure information which can be used for storing, exchanging, and executing of multimedia presentations in final form. We use a running example to describe the building blocks of an MHEG encoded presentation. To contribute our experience using MHEG in a networked multimedia kiosk environment, we present a complete MHEG run-time environment.", URL="http://www.computer.org/multimedia/mu1995/u1toc.htm", } @ARTICLE{Rooh95:ATM, AUTHOR="Reza Rooholamini and V. Cherkassky", TITLE="{ATM-Based} Multimedia Servers", JOURNAL=ieeemm, VOLUME=2, NUMBER=1, MONTH="Spring", YEAR=1995, ABSTRACT="The architecture of the next generation of multiprocessor systems is influenced by the rapid evolution of the client-server paradigm, advances in IC technology, the merging of computers and communications, and the preservation of current software investments. The next generation of multiprocessors will be deployed as servers in a multimedia client-server environment. Currently, servers can not handle multimedia traffic internally and effectively delivering the high bandwidth of the network to the processing and storage subsystems. In dealing with this problem, this article proposes three scaleable and subsystem-based multimedia server architectures. The server's subsystems are interconnected using ATM which allows high speed transfer of multimedia information across the server's subsystems, such as the storage, processor-memory, and network/communications.", URL="http://www.computer.org/multimedia/mu1995/u1toc.htm", } @ARTICLE{Nahr95:QOS, AUTHOR="K. Nahrstedt and Jonathan Smith", TITLE="The {QOS} Broker", JOURNAL=ieeemm, VOLUME=2, NUMBER=1, MONTH="Spring", YEAR=1995, KEYWORDS="quality-of-service; scheduling; real-time communications and services; remote-control applications; software architecture for multimedia", ABSTRACT="Many networked multimedia applications are delay-sensitive, and require services with guarantees of resource availability and timeliness. For networks such as those based on Asynchronous Transfer Mode (ATM), these service requirements are specified through Quality of Service (QoS) parameters. QoS guarantees are needed at multiple layers in an end-to-end protocol architecture. Delivering end-to-end QoS requires an architecture for resource management at the system end-points (e.g., computer workstation hosts), as well as in the underlying network. We describe a model for an end-point entity called the QoS Broker. The broker orchestrates resources at the end-points, coordinating resource management across layer boundaries. As an intermediary, it hides implementation details from applications and per-layer resource managers. Services such as translation, admission and negotiation are used by the broker to properly configure the system to application needs. Configuration is achieved via QoS negotiation resulting in one or more connections through the communications system. The negotiation involves all components of the communication system needed for the setup. An important property of the broker is its role as an active intermediary which insulates cooperating entities from operational details of other entities. The broker manages communication among the entities to create the desired system configuration. It can be viewed as a software engineering technique for distributed multimedia system architectures. We have implemented an experimental prototype of a QoS Broker on IBM RISC System/6000 hosts connected by an ATM LAN. This prototype was validated using a telerobotics application. This application has very strict timing constraints. It helped us to identify limitations of our system and requirements for system support, and serves as a testbed for our architecture.", URL="http://www.computer.org/multimedia/mu1995/u1toc.htm", } @ARTICLE{Guha95:Controlling, AUTHOR="Amit Guha and Allalaghatta Pavan and Jia Liu and Barry A. Roberts", TITLE="Controlling the Process with Distributed Multimedia", JOURNAL=ieeemm, VOLUME=2, NUMBER=2, MONTH="Summer", YEAR=1995, KEYWORDS="distributed multimedia; real-time systems; asynchronous transfer mode; client-server; process control", ABSTRACT="Multimedia in the process control industry has broad scope in terms of incorporating diverse imaging sensors as well as using multimedia data for visualizing, monitoring, and controlling time- critical processes. Our research has shown that a distributed architecture based on a client-server model that operates on multimedia data, together with specialized image processing hardware and a number of commercial products can be very effective in monitoring and controlling a film coating process.", URL="http://www.computer.org/multimedia/mu1995/u2toc.htm", } @ARTICLE{Bead95:Experiments, AUTHOR="H. W. Beadle", TITLE="Experiments in Multipoint Multimedia Telecommunication", JOURNAL=ieeemm, VOLUME=2, NUMBER=2, MONTH="Summer", YEAR=1995, KEYWORDS="multimedia; telecommunications; networks; applications; digital communications; computer supported collaborative work; DQDB; experimental results; case studies", ABSTRACT="This paper presents the outcomes of five years of investigations into the interaction between multimedia telecommunications services and broadband networks including the results of experiments on networks of national scale. The experiments demonstrate how the high-level architectural primitives allow rapid creation of multi-point, multi-media applications. We present objective performance measurements and subjective useability results for the applications. The results were derived from a number of private and public trials on Ethernet, a heterogenous multimedia network, a national DQDB network (Fastpac) and an experimental ATM network. We conclude that limited multimedia telecommunications systems and services with intuitive user interfaces can be rapidly constructed with current technologies. However, there is still insufficient evidence to assess whether such systems can provide organisations with benefits great enough to justify their current cost.", URL="http://www.computer.org/multimedia/mu1995/u2toc.htm", } @ARTICLE{Dedr95:Consumption, AUTHOR="Rick Dedrick", TITLE="A Consumption Model for Targeted Electronic Advertising", JOURNAL=ieeemm, VOLUME=2, NUMBER=2, MONTH="Summer", YEAR=1995, ABSTRACT="Information distribution networks will give consumers access to rich-media-based electronic content in both business and home settings. Electronic advertising will become an integral component of such networks, subsidizing consumption while providing a new service for consumers without invading their personal space. The consumption model presented here explains how consumer-driven advertising might develop -- and why it probably won't be soon.", URL="http://www.computer.org/multimedia/mu1995/u2toc.htm", } @ARTICLE{Subr95:Quality, AUTHOR="P. A. Subrahmanyam and K. J. Singh and Guy Story and William Schell", TITLE="Quality Assurance in Scripting", JOURNAL=ieeemm, VOLUME=2, NUMBER=2, MONTH="Summer", YEAR=1995, KEYWORDS="scripting; interactive television; formal methods; finite state machines", ABSTRACT="Multimedia application programs, including interactive television (ITV) applications, are often developed by using a ``multimedia scripting language''. The experience of many application designers is that it is often quite difficult to envision all the different situations that can be encountered in the course of a user session or game, and to ensure that the needed responses have indeed been included in the script. Before committing a widely replicated application over a publicly accessed network such as the phone or cable network, it is both desirable and cost-effective to ensure that an application is ``customer-proof'' to a certain extent -- so as to avoid unexpected, and potentially catastrophic, allocation of network resources. Unfortunately, most scripting platforms tend to ignore such ``quality assurance'' issues. We describe a methodology to address this problem. The content developers author applications using a graphical front end for a scripting language M that can be viewed as defining a hierarchy of ``directors'' and ``actors''. We have developed formal semantics for this scripting language in terms of an ensemble of interacting finite state machines that supports multimedia objects; a translator from M to another internal automaton-based representation that supports formal analysis has been implemented. Given this framework, properties pertaining to an interactive user session or game -- such as the possibility of deadlock, potential scenarios that might be encountered, resource utilization, etc.-- can be posed as queries that can be analytically answered using an associated tool set. Successful analysis of useful properties has been done on games that are part of a prototype ITV demonstration script. Our experiments underline the usefulness of performing formal analysis.", URL="http://www.computer.org/multimedia/mu1995/u2toc.htm", } @ARTICLE{Pan95:Tutorial, AUTHOR="Davis Pan", TITLE="A Tutorial on {MPEG/Audio} Compression", JOURNAL=ieeemm, VOLUME=2, NUMBER=2, MONTH="Summer", YEAR=1995, ABSTRACT="This tutorial covers the theory behind MPEG/audio compression. This algorithm was developed by the Motion Picture Experts Group (MPEG), as an International Organization for Standardization (ISO) standard for the high fidelity compression of digital audio. The MPEG/audio compression standard is one part of a multiple part standard that addresses the compression of video (11172-2), the compression of audio (11172-3), and the synchronization of the audio, video, and related data streams (11172-1) to an aggregate bit rate of about 1.5 Mbits/sec. The MPEG/audio standard also can be used for audio-only applications to compress high fidelity audio data at much lower bit rates. While the MPEG/audio compression algorithm is lossy, often it can provide ``transparent'', perceptually lossless, compression even with compression factors of 6-to-1 or more. The algorithm works by exploiting the perceptual properties of the human auditory system. This paper also will cover the basics of psychoacoustic modeling and the methods used by the MPEG/audio algorithm to compress audio data with least perceptible degradation.", URL="http://www.computer.org/multimedia/mu1995/u2toc.htm", } @ARTICLE{Hirz95:Temporal, AUTHOR="Nael Hirzalla and Ben Falchuk and Ahmed Karmouch", TITLE="A Temporal Model for Interactive Multimedia Scenarios", JOURNAL=ieeemm, VOLUME=2, NUMBER=3, MONTH="Fall", YEAR=1995, KEYWORDS="multimedia document; scenario; temporal relationships; user interaction; active multimedia; scenario representation; non-halting options", ABSTRACT="Authoring multimedia documents remains a challenge; unlike a book, a multimedia document has temporal relations which need to be specified at the authoring stage (for instance synchronized audio and video, or text subtitles synchronized to video) and relations that are simply unknown at authoring-time (for instance waiting for a user input before rendering a media object, or waiting upon a user action which will drive the playback of the document in a certain direction). Hypermedia documents, in contrast, contain no concept of time; they are store-and-forward and nothing happens until a user selects a choice. Currently there are a number of authoring tools available that allow authors to create scenarios but very few allow authors to create active multimedia scenarios. By this we mean that the resulting document will not only play itself back but will change its course dynamically, depending on user interactions. The goal of our research was to create such a representation and authoring tool. In this paper we present a temporal model for interactive scenarios. We provide a new representation for asynchronous and synchronous temporal events. Our emphasis is on allowing authors to create scenarios which offer non-halting, transparent options to viewers. We then contrast and compare related works to ours.", URL="http://www.computer.org/multimedia/mu1995/u3toc.htm", } @ARTICLE{Apte95:Video, AUTHOR="Ronnie T. Apteker and Joseph Fisher and Valentin S. Kisimov and Hanoch Neishlos", TITLE="Video Acceptability and Frame Rate", JOURNAL=ieeemm, VOLUME=2, NUMBER=3, MONTH="Fall", YEAR=1995, KEYWORDS="frame rate; message content; multimedia; perception; temporality; watchability", ABSTRACT="This paper examines the effects that degrading frame rates has on user perception of a video application in a typical Graphic User Interface (GUI) environment. Specifically, experimentation shows that degrading the frame rate, which is a QoS parameter, of a continuous media stream exhibits perceived differences depending on the nature of the application. It was found that degrading the QoS of a multimedia session has different consequences for the network bandwidth required for different distributed multimedia applications, which is directly related to the number of users that can be supported concurrently by a multimedia server.", URL="http://www.computer.org/multimedia/mu1995/u3toc.htm", } @ARTICLE{Carr95:Practical, AUTHOR="Sylvain Carrier and Nicolaos D. Georganas", TITLE="Practical Multimedia Electronic Mail on {X.400}", JOURNAL=ieeemm, VOLUME=2, NUMBER=4, MONTH="Winter", YEAR=1995, ABSTRACT="The proliferation of small and large computer networks and workstations has been the supporting platform for the extensive use and growth of electronic mail. As users became accustomed to the usefulness of electronic mail, they also encountered its limitations with regards to multimedia content and interoperability. An approach that provides a multimedia capability to X.400 that has a built-in interoperability with the Internet/MIME standard is proposed. This approach ensures that existing X.400 and Internet electronic mail facilities can be used to transport and exchange multimedia information by using published interoperability documents. The implementation of the prototype by the MCRLab at the University of Ottawa based on this approach is presented. Brief compatibility comparisons with military messaging standards and other multimedia mail projects are also provided.", URL="http://www.computer.org/multimedia/mu1995/u4toc.htm", } @ARTICLE{Gini95:Hypermedia, AUTHOR="Athula Ginige and David B. Lowe and J. Robertson", TITLE="Hypermedia Authoring", JOURNAL=ieeemm, VOLUME=2, NUMBER=4, MONTH="Winter", YEAR=1995, KEYWORDS="multimedia hypermedia authoring linking structuring models", ABSTRACT="A critical aspect of developing hypermedia applications is being able to identify the interlinking within the information, and structure it in such a way that enhances accessibility. This is a major part of the process which is referred to as authoring. There are many approaches to authoring. Some are suitable for small prototypes. When developing large hypermedia systems, or systems which are likely to require maintenance over a period of time, it becomes esential to select or more structured approach, and appropriate methodologies to support the development process. The use of an inappropriate approach to authoring can result in systems which have a greatly inflated development cost, which do not provide the level of functionality desired, and are difficult to use and maintain.", URL="http://www.computer.org/multimedia/mu1995/u4toc.htm", } @ARTICLE{Hell95:Media, AUTHOR="R. Heller and C. Dianne Martin", TITLE="A Media Taxonomy", JOURNAL=ieeemm, VOLUME=2, NUMBER=4, MONTH="Winter", YEAR=1995, KEYWORDS="multimedia evaluation; media value; media taxonomy", ABSTRACT="This paper presents a Media Taxonomy that can be used in both the research and development of multimedia applications. The taxonomy is shown as a two-dimensional categorization framework. The increasingly complex media types (text, graphics, sound, motion) make up the vertical dimension. The expression of each medium in three arbitrary categories (Elaboration, Representation, Abstraction) delineates the horizontal dimension. The horizontal dimension of media expression moves from the concrete, fully explicated expression of information to the abstract, metaphoric form of information within each medium. The taxonomy has been used successfully in two graduate level multimedia courses, the first one focusing on multimedia design and the second on the research and evaluation of interactive multimedia. It correlates well with previous categorizations of mul timedia and contributes to the growing arsenal of analysis tools that will enable researchers to more fully understand the impact and value-added by an individual medium in a multimedia presentation.", URL="http://www.computer.org/multimedia/mu1995/u4toc.htm", } @ARTICLE{Vett95:Using, AUTHOR="Ronald J. Vetter and Carol A. Ward and S. S. Shapiro", TITLE="Using Color and Text in Multimedia Projections", JOURNAL=ieeemm, VOLUME=2, NUMBER=4, MONTH="Winter", YEAR=1995, ABSTRACT="In this article we describe some of the problems that we have experienced with the projection of multimedia materials in a classroom setting. For example, certain colors that look good together on the screen and are easily distinguishable may not be easily recognized as different when the colors are sent through a projection panel and displayed with an overhead projector. This article provides some guidelines that developers of multimedia presentations should follow in order to avoid some of the common problems associated with the projection of these materials. We also discuss the appropriate use of color in multimedia applications based on psychological and physiological factors. An example of how this information can be used is also provided.", URL="http://www.computer.org/multimedia/mu1995/u4toc.htm", } @ARTICLE{Alon95:Teaching, AUTHOR="Fernando Alonso and Angélica de Antonio and José L. Fuertes and César Montes", TITLE="Teaching Communication Skills to Hearing-Impaired Children With An Intelligent Multimedia System", JOURNAL=ieeemm, VOLUME=2, NUMBER=4, MONTH="Winter", YEAR=1995, KEYWORDS="Language acquisition; hearing-impaired children; computerized teaching method; intelligent tutoring system; 3D animation; digitized video", ABSTRACT="Mehida is a multimedia system offering hearing-impaired children an easy and attractive method to communicate with their hearing and deaf peers. It is a total communication method whose objective is the acquisition of various forms of communication available to the hearing impaired simultaneously: sign language, speech, fingerspelling, lip reading, reading and writing. Didactic activities and games are used to teach the different means of communication. This approach gives the child the chance to practice the different types of communication. A character has been created in the shape of a pear to assist and guide the child. The pupil identifies with the character at all times, as it explains what the child is being asked to do during each activity. The Mehida learning process is divided into five stages: basic learning, prereading and prewriting, syllable, word, and sentence reading and writing. Each phase establishes a hierarchy of didactic objectives which are the expression of the skills and knowledge to be acquired by the child during the learning process (e.g., Learning concepts of similarity), broken down into a series of lower level operational objectives (e.g., Select figures of the same shape, size and colour).", URL="http://www.computer.org/multimedia/mu1995/u4toc.htm", } @ARTICLE{Kemp95:Multimedia, AUTHOR="Zarine Kemp", TITLE="Multimedia and Spatial Information Systems", JOURNAL=ieeemm, VOLUME=2, NUMBER=4, MONTH="Winter", YEAR=1995, KEYWORDS="multimedia; geo-relational model; object-oriented model; spatial information system", ABSTRACT="The incorporation of multimedia data types is increasingly becoming a requirement in spatial information systems (SIS). Pictures, sounds, animated sequences and unstructured text are examples of data which may form an integral part of geographically located entities in information systems. We provide an overview of the application domain and consider issues and problems pertinent to the inclusion of multimedia capabilities in spatial information systems. We introduce an example ecological application with extensive multimedia requirements to illustrate how multimedia data may be integrated with spatial information systems in a generic, application-independent manner. The problem is considered by describing how multimedia capabilities have been incorporated into a spatial information system based on the geo-relational model and then discussing the use of an object-oriented model to enable a better integration of SIS and multimedia data.", URL="http://www.computer.org/multimedia/mu1995/u4toc.htm", } @BOOK{Lucy95:Addressing, AUTHOR="William M. Lucy", TITLE="Addressing Systems -- A Training Guide for 9-1-1", ISBN="1-883119-18-9", PUBLISHER="National Emergency Number Association", ADDRESS="Coshocton, Ohio", YEAR=1995, KEYWORDS="911; emergency calling; telephone service", } @MISC{High95:Whiteboard, AUTHOR="Julian Highfield and Kristian Hasler", TITLE="Whiteboard tool", NOTE="http://www-mice.cs.ucl.ac.uk/multimedia/software/wbd/", YEAR=1995, LANGUAGE="English", ABSTRACT="WBD is a shared whiteboard compatible with the LBL whiteboard, WB.", URL="http://www-mice.cs.ucl.ac.uk/multimedia/software/wbd/", } @INPROCEEDINGS{KarlssonG:hype, AUTHOR="Gunnar Karlsson and Goran Djuknic", TITLE="The Role of Video in Broadband Communications: Enabler and Enhancer of Applications, or Hype?", BOOKTITLE="Second International Workshop on Community Networking: Integrated Multimedia Services to the Home", ADDRESS="Princeton, USA", MONTH="JUN", YEAR=1995, } @INPROCEEDINGS{Magn95:Efficient, AUTHOR="Peter S. Magnusson and Bengt Werner", TITLE="Efficient Memory Simulation in {SimICS}", BOOKTITLE="28th Annual Simulation Symposium", YEAR=1995, ABSTRACT="We describe novel techniques used for efficient simulation of memory in SimICS, an instruction level simulator developed at SICS. The design has focused on efficiently supporting the simulation of multiprocess, analyzing complex memory hierarchies and running large binaries with a mixture of system-level and user-level code. A software caching mechanism (the Simulator Translation Cache, STC) improves the performance of interpreted memory operations by reducing the number of calls to complex memory simulation code. Major data structures are allocated lazily to reduce the size of the simulator process. A well-defined internal interface to generic memory simulation simplifies user extensions. Leveraging on a flexible interpreter based on threaded code allows runtime selection of statistics gathering, memory profiling, and cache simulation with low overhead. The result is a memory simulation scheme that supports a range of features for use in computer architecture research, program profiling, and debugging.", URL="http://www.sics.se/simics/publications/simsymp95.ps.Z", } @MISC{Moe:thesis, AUTHOR="Andreas Moestedt", TITLE="The {DDMlite,} Design and Implementation of a {COMA} Multiprocessor", HOWPUBLISHED="MSc thesis", YEAR=1995, URL="http://www.sics.se/ddmlite/report\_ds.ps", } @INPROCEEDINGS{Sau:arg, AUTHOR="Ashley Saulsbury and Tim Wilkinson and John Carter and Anders Landin", TITLE="An Argument for Simple {COMA}", BOOKTITLE="of First IEEE Conf. on High Performance Computer Architecture", ADDRESS="Rayleigh, N.Carolina, USA", MONTH="JAN", YEAR=1995, URL="http://www.sics.se/~ans/simple-coma/hpca-95/paper.html", } @INPROCEEDINGS{Hags95:OS6, AUTHOR="O. Hagsand and Stephen Pink and Ashley Saulsbury", TITLE="{OS6:} A Distributed Operating System for a Next Generation of Computer Networks", BOOKTITLE="IEEE International Workshop on Object Orientation in Operating Systems", ADDRESS="Lund, Sweden", MONTH="JUL", YEAR=1995, URL="http://www.sics.se/cna/publications/OS6.ps", } @INPROCEEDINGS{Cohe95:Handover, AUTHOR="Reuven Cohen and Baiju Patel and Adrian Segall", TITLE="Handover in a Micro-Cell Packet Switched Mobile Network", BOOKTITLE="Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies", VOLUME=2, PAGES="496-503", YEAR=1995, } @INPROCEEDINGS{Perk95:DHCP, AUTHOR="Charles E. Perkins and T. Jagannadh", TITLE="{DHCP} for mobile networking with {TCP/IP}", BOOKTITLE="IEEE Symposium on Computers and Communications", PAGES="255-261", YEAR=1995, } @INPROCEEDINGS{Chik95:Mobile, AUTHOR="V. Chikarmane and Rick Bunt and Carey Williamson", TITLE="Mobile {IP-based} Multicast as a Service for Mobile Hosts", BOOKTITLE="Second International Workshop on Services in Distributed and Networked Environments", PAGES="11-18", YEAR=1995, } @INPROCEEDINGS{Bakr95:Handoff, AUTHOR="Ajay Bakre and Badrinath B. R.", TITLE="Handoff and System Support for Indirect {TCP/IP}", BOOKTITLE="Symposium on Mobile and Location-Independent Computing", ADDRESS="Ann Arbor, Michigan", YEAR=1995, } @INPROCEEDINGS{Bake95:Changing, AUTHOR="Mary G. Baker", TITLE="Changing Communication Environments in MosquitoNet", BOOKTITLE="IEEE Proceedings of Workshop on Mobile Computing Systems and Applications, 1994", PAGES="64-68", YEAR=1995, } @INPROCEEDINGS{Bakr95:I, AUTHOR="Ajay Bakre and Badri Nath", TITLE="{I-TCP:} Indirect {TCP} for Mobile Hosts", BOOKTITLE="15th International Conference on Distributed Computing Systems", PAGES="136-143", YEAR=1995, } @ARTICLE{Pate95:Architecture, AUTHOR="Baiju Patel and Partha Bhattacharya and Y. Rekhter and Archana Krishna", TITLE="An Architecture and Implementation Toward Multiprotocol Mobility", JOURNAL="IEEE Personal Communications", VOLUME=2, NUMBER=3, PAGES="32-42", YEAR=1995, } @INPROCEEDINGS{Agra95:Testbed, AUTHOR="Prathima Agrawal and Abhaya Asthana and Mark Cravatts and Eoin Hyden and Paul Krzyzanowski and Partho Mishra and B. Narendran and Mani B. Srivastava", TITLE="A Testbed For Mobile Network Computing", BOOKTITLE="IEEE International Conference on Communications, ICC 1995", ADDRESS="Seattle", VOLUME=1, PAGES="410-416", YEAR=1995, } @ARTICLE{Kirb95:Locating, AUTHOR="Graham N. C. Kirby", TITLE="Locating the User", JOURNAL="Communication International", YEAR=1995, } @INPROCEEDINGS{Bagr95:Hierarchical, AUTHOR="Rajive Bagrodia and Mario Gerla and Leonard Kleinrock and J. Short and Jung-Tsung Tsai", TITLE="A Hierarchical Simulation Environment for Mobile Wireless Networks", BOOKTITLE="of 1995 Winter Simulation Conference", ADDRESS="Arlington, VA.", YEAR=1995, } @ARTICLE{Cors95:Reservation, AUTHOR="M. Scott Corson and Stephen G. Batsell", TITLE="A Reservation-Based Multicast {(RBM)} Routing Protocol for Mobile Networks: Initial Route Construction Phase", JOURNAL="ACM Journal on Wireless Networks", YEAR=1995, } @INPROCEEDINGS{Lin95:Distributed, AUTHOR="Chunhung Lin and Mario Gerla", TITLE="A Distributed Architecture for Multimedia in a Multihop Dynamic Packet Radio Networks", BOOKTITLE="of IEEE GLOBECOM '95", YEAR=1995, } @INPROCEEDINGS{Murt95:Routing, AUTHOR="Shree Murthy and J.J. Garcia-Luna-Aceves", TITLE="A Routing Protocol for Packet Radio Networks", BOOKTITLE="first Annual International Conference on Mobile Computing and Networking", PAGES="86-95", YEAR=1995, } @INPROCEEDINGS{Chan95:Topological, AUTHOR="Hong-Seong Chang and Byoung-Wan Kim and Chang Gun Lee and Yanghee Choi and Sang Min and Hyun Yang and Chong Sang Kim", TITLE="Topological Design and Routing for Low Earth Orbit Saltellite Networks", BOOKTITLE="of GLOBECOM '95", PAGES="529-535", YEAR=1995, } @TECHREPORT{Hans95:TCP, AUTHOR="Jorgen Svaerke Hansen and Torben Reich and Birger Andersen", TITLE="{TCP/IP} in a Mobile Computing Environment", INSTITUTION="University of Copenhagen", NOTE="ftp://ftp.diku.dk/diku/distlab/amigos/", YEAR=1995, } @INPROCEEDINGS{Maff95:Generic, AUTHOR="Silvano Maffeis and Walter Bischofberger and Kai-Uwe Matzel", TITLE="A Generic Multicast Transport Service to Support Disconnected Operation", BOOKTITLE="Second USENIX Symposium on Mobile and Location-Independent Computing", YEAR=1995, } @ARTICLE{Skor95:Minimum, AUTHOR="Jadranka Skorin-Kapov and Jean-Francois Labourdette", TITLE="On Minimum Congestion Routing in Logically Rearrangeable Multihop Lightwave Networks", JOURNAL="Journal of Heuristics", VOLUME=1, PAGES="129-145", YEAR=1995, LANGUAGE="English", } @INPROCEEDINGS{Kris9504:Cluster, AUTHOR="P. Krishna and M. Chatterjee and Nitin Vaidya and Dhiraj K. Pradhan", TITLE="Cluster-based Approach for Routing in Ad-Hoc Networks", BOOKTITLE="Second USENIX Symposium on Mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="This paper presents a ``cluster-based'' approach to routing in ad-hoc networks. A cluster is defined by a subset of nodes which are `reachable' to each other. Our approach is motivated by our study of existence of clusters (size greater than 2) in random graphs. The basic idea behind the protocol is to divide the graph into number of overlapping clusters. A change in the network topology corresponds to a change in the cluster membership. Performance of the proposed routing protocol(reconvergence time, and update overhead) will hence be determined by the average cluster size in the network graph. The effectiveness of this approach lies in the fact that existing routing protocols can be directly applied to the network -- replacing the nodes by clusters. When the average cluster size is less than 2, the proposed approach does not perform any worse than the existing routing protocols. Generalization of the proposed approach is a subject of ongoing research.", URL="http://www.usenix.org/publications/library/proceedings/mob95/krishna.html", } @INPROCEEDINGS{Bakr9504:Handoff, AUTHOR="Ajay Bakre and Badri Nath", TITLE="Handoff and System Support for Indirect {TCP/IP}", BOOKTITLE="Second USENIX Symposium on Mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="Over the past few years, Transmission Control Protocol (TCP) has become the most widely used transport layer protocol on the Internet. TCP performs poorly however, if one of the communicating hosts is a mobile wireless computer . One way to address this performance problem is to modify TCP to make it aware of host mobility. Such an approach is infeasible because of the sheer number of hosts on the Internet using TCP. Another way is to build a separate transport layer protocol for mobile hosts but this raises interoperability problems with the existing stationary hosts. An indirect transport layer protocol such as I-TCP allows using a separate transport protocol for the wireless link between a mobile host and its Mobile Support Router (MSR) without causing interoperability problems with the fixed network. Experiments with I-TCP have shown significant improvement in throughput over regular TCP . Use of indirect protocols requires additional functionality at the MSRs. In this paper we describe the implementation of such functionality for I-TCP. We also present measurements for the time needed for handoffs in case a mobile host with an active connection switches cells.", URL="http://www.usenix.org/publications/library/proceedings/mob95/bakre.html", } @INPROCEEDINGS{Trot9504:Wireless, AUTHOR="John Trotter and Mark Cravatts", TITLE="Wireless Adapter Architecture for Mobile Computing", BOOKTITLE="Second USENIX Symposium on Mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="We present the architecture of an indoor wireless adapter card for use in nanocellular wireless networks. The card, called FAWN (Flexible Adapter for Wireless Networking), includes an RF modem, a CPU and an interface to a host computer. The card supports mobility, allowing portable machines to handoff between base-stations while maintaining a high speed, low latency wireless connection. By executing the MAC algorithms on the FAWN card the host computer is able to run its applications at full speed. In addition, this approach enhances the cardUs applicability for use in a wide variety of machines as it presents a simple and universal interface. The on-board CPU can also be used as the controller, allowing the card to be used as the central component in embedded wireless designs. The card has been constructed and is being used as part of a larger wireless project in AT\&T.", URL="http://www.usenix.org/publications/library/proceedings/mob95/trotter.html", } @INPROCEEDINGS{Raja9504:MCE, AUTHOR="Ramki Rajagopalan and Sridhar Alagar and S. Venkatesan", TITLE="{MCE:} An Integrated Mobile Computing Environment and Simulation Testbed", BOOKTITLE="Second USENIX Symposium on Mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="Integrated Mobile Computing Environment and simulation testbed (MCE) is a software platform to design, develop, and test algorithms and applications for a network of mobile and static computers. MCE is designed with the idea of providing users with a transparent system so that an application may be tested on the simulation testbed and then used directly on the network without any source code changes. MCE provides default functionalities like routing, location tracking, and handoff along with service access points to add or change services resulting in a unique integrated environment for development and testing. MCE may also be used as a platform to evaluate and compare various mobile network algorithms.", URL="http://www.usenix.org/publications/library/proceedings/mob95/raja.html", } @INPROCEEDINGS{Davi9504:Network, AUTHOR="N. J. Davies and G. S. Blair and Keith Cheverst and Adrian Friday", TITLE="A Network Emulator to Support the Development of Adaptive Applications", BOOKTITLE="Second USENIX Symposium on Mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="Mobile applications must operate in environments in which the network connectivity, input/output devices, power and contextual information available to them may all vary. Applications which react to changes in these parameters in order to ensure continuing service to the user are termed adaptive applications and have recently emerged as an area of intense research activity. In this paper we describe the design and implementation of a network emulator which facilitates research in this field by allowing applications to be exposed to user controlled fluctuations in network service. The emulator can be used with any application which uses UDP and requires only minimal changes to the application or, it may be used with applications written using the ANSAware distributed systems platform in which case no changes are necessary to the application. The design and implementation of the emulator are described in this paper as our experiences of using the emulator to model three distinct types of wireless network: GSM, an analogue cellular service and a simple shared radio channel. The source code for the emulator is freely available and instructions on obtaining the code are also included.", URL="http://www.usenix.org/publications/library/proceedings/mob95/davies.html", } @INPROCEEDINGS{Nobl9504:Programming, AUTHOR="Brian Noble and Morgan Price and M. Satyanarayanan", TITLE="A Programming Interface for Application-Aware Adaptation in Mobile Computing", BOOKTITLE="Second USENIX Symposium on Mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="Mobile clients face wide variations in network conditions and local resource availability when accessing remote data. Coping with this uncertainty requires the ability to retrieve and present data at varying degrees of fidelity. In this paper we present applicaton-aware adaptation as a solution to this problem. The essence of our solution is a collaborative partnership between applications and the operating system. We describe the Odyssey API for application-aware adaptation and demonstrate its use in accessing two types of data: video and maps.", URL="http://www.usenix.org/publications/library/proceedings/mob95/noble.html", } @INPROCEEDINGS{Mont9504:System, AUTHOR="G. Montenegro and Steve Drach", TITLE="System Isolation and Network Fast-Fail Capability in Solaris", BOOKTITLE="Second USENIX Symposium on Mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="UNIX hosts configured for network operation typically hang, or freeze, when temporarily disconnected from the network. This failure is unacceptable to the user of a mobile host who purposely disconnects the host from the network in order to move it to another location not serviced by a network connection. This paper describes an approach that automatically enables a system to continue to function, in a diminished capacity, when disconnected from the network.", URL="http://www.usenix.org/publications/library/proceedings/mob95/montenegro.html", } @INPROCEEDINGS{Maff9504:Generic, AUTHOR="Silvano Maffeis and Walter Bischofberger and Kai-Uwe Matzel", TITLE="A Generic Multicast Transport Serviceto Support Disconnected Operation", BOOKTITLE="Second USENIX Symposium on Mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="Many mobile computing applications can profit from process groups and reliable multicast communication to maintain replicated data, but most operating systems available today fail in providing the primitive operations needed by such applications. In this paper we describe a highly configurable, Generic Multicast Transport Service (GTS), which supports the implementation of group-based applications in wide-area settings. GTS is unique in that it offers fault-tolerant, order-preserving multicast on arbitrary communication protocols, including e-mail. As another distinguishing mark, messages can be sent to processes even when they are temporarily unavailable, which permits disconnected operation and mobility. We further propose an object-oriented system design consisting of adaptor objects interconnected to form a protocol tree. Adaptor objects offer a common interface to dissimilar communication protocols, and make it easy to incorporate new protocols into GTS. Currently, GTS is being used in a cooperative software engineering environment and in other projects. GTS is available for anonymous ftp.", URL="http://www.usenix.org/publications/library/proceedings/mob95/maffeis.html", } @INPROCEEDINGS{Hust9504:Partially, AUTHOR="L. B. Huston and P. Honeyman", TITLE="Partially Connected Operation", BOOKTITLE="Second USENIX Symposium on Mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="RPC latencies and other network-related delays can frustrate mobile users of a distributed file system. Disconnected operation helps, but fails to use networking opportunities to their full advantage. In this paper we describe partially connected operation, an extension of disconnected operation that resolves cache misses and preserves client cache consistency, but does not incur the write latencies of a fully connected client. Benchmarks of partially connected mode over a slow network indicate overall system performance comparable to fully connected operation over Ethernet.", URL="http://www.usenix.org/publications/library/proceedings/mob95/huston.html", } @INPROCEEDINGS{Denn9504:Distributed, AUTHOR="Thomas G. Dennehy", TITLE="A Distributed Software Architecture for {GPS-Driven} Mobile Applications", BOOKTITLE="Second USENIX Symposium on Mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="The unique requirements of voice recognition can shape a software architecture in many ways that have proven effective for mobile and distributed applications. We show in this paper that extending the voice recognition model of translating utterances into sentences to include translating a variety of real-world events into a command protocol can create an architecture whose components operate identically on hand-held devices, man-portable or vehicle-borne units, notebook, or desktop computers. SANSE, a portable navigation and geographic information management system having several redundant user interfaces, is described. In SANSE a collection of distributed Interactors translate events-spoken words, input from GPS hardware, timers expiring, input from files or communication links, and direct manipulation actions-into SANSE commands that are sent to one or more Receivers, which can execute commands without regard to their source. The complete operation of this system can be captured in vocabulary of less than 70 words, small enough to provide speaker-independent operation yet rich enough to be broadly applicable. The architecture can be extended by adding new Interactor types without affecting the operation of the baseline system.", URL="http://www.usenix.org/publications/library/proceedings/mob95/dennehy.html", } @INPROCEEDINGS{Imie9504:Energy, AUTHOR="T. Imielinski and Monish Gupta and Sarma Peyyeti", TITLE="Energy Efficient Data Filtering and Communication in Mobile Wireless Computing", BOOKTITLE="Second USENIX Symposium on Mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="Battery power is a scarce resource in mobile wireless computers. We discuss energy-efficient software solutions for wireless information services and general data communication. Our approach is based on allowing the receiver to be shut off when no communication is taking place and letting the CPU be in an energy efficient doze mode as long as possible. Minimizing transmissions (which are much more energy consuming than receiving) from mobile hosts also leads to efficient use of battery power. We present two protocols based on this approach. The first protocol uses multicast addresses to filter out unwanted packets without waking up the CPU. Reusability of local addresses, similar to frequency reuse, facilitates using a limited multicast address space. The second protocol advocates a wake-up based scheme to save receiver power in a mobile host. We discuss the tradeoff between energy savings and increase in delay. Experiments with implementation of these two protocols show that a significant improvement in battery usage can be achieved, making a case for certain features to be provided in hardware.", URL="http://www.usenix.org/publications/library/proceedings/mob95/imielinski.html", } @INPROCEEDINGS{Doug9504:Adaptive, AUTHOR="F. Douglis and P. Krishnan and B. N. Bershad", TITLE="Adaptive Disk Spin-down Policies for Mobile Computers", BOOKTITLE="Second USENIX Symposium on Mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="Mobile computers typically spin down their hard disk after a fixed period of inactivity. If this threshold is too long, the disk wastes energy; if it is too short, the delay due to spinning the disk up again frustrates the user. Usage patterns change over time, so a single fixed threshold may not be appropriate at all times. Also, different users may have varying priorities with respect to trading off energy conservation against performance. We describe a method for varying the spin-down threshold dynamically by adapting to the user's access patterns and priorities. Adaptive spin-down can in some circumstances reduce by up to 50 the number of disk spin-ups that are deemed by the user to be inconvenient, while only moderately increasing energy consumption.", URL="http://www.usenix.org/publications/library/proceedings/mob95/douglis.html", } @INPROCEEDINGS{Swee9504:Scalability, AUTHOR="Adam Sweeney and Doug Doucette and W. Hu and Christopher R. Anderson and Mike Nishimoto and Geoff Peck", TITLE="Scalability in the {XFS} File System", BOOKTITLE="Second USENIX symposium in mobile and location-independent computing proceedings", ADDRESS="Ann Arbor, Michigan", DAYS=10, MONTH="Apr", YEAR=1995, ABSTRACT="In this paper we describe the architecture and design of a new file system, XFS, for Silicon Graphics' IRIX operating system. It is a general purpose file system for use on both workstations and servers. The focus of the paper is on the mechanisms used by XFS to scale capacity and performance in supporting very large file systems. The large file system support includes mechanisms for managing large files, Louisianarge numbers of files, large directories, and very high performance I/O. In discussing the mechanisms used for scalability we include both descriptions of the XFS on-disk data structures and analyses of why they were chosen. We discuss in detail our use of B+ trees in place of many of the more traditional linear file system structures. XFS has been shipping to customers since December of 1994 in a version of IRIX 5.3, and we are continuing to improve its performance and add features in upcoming releases. We include performance results from running on the latest version of XFS to demonstrate the viability of our design.", URL="http://www.usenix.org/publications/library/proceedings/sd96/sweeney.html", } @INPROCEEDINGS{Stev9501:Portals, AUTHOR="W. Richard Stevens and Jan-Simon Pendry", TITLE="Portals in {4.4BSD}", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="Portals were added to 4.4BSD as an experimental feature and are in the publicly available 4.4BSD-Lite distribution. Portals provide access to alternate file types or devices using names in the normal filesystem that a process just opens. For example, an open of /p/tcp/foo.com/smtp returns a TCP socket descriptor to the calling process that is connected to the SMTP server on the specified host. By providing access through the normal filesystem, the calling process need not be aware of the special functions necessary to create a TCP socket and establish a TCP connection. This makes TCP connections, for example, available to programs such as Awk, Tcl, and shell scripts. This paper describes the implementation of portals in 4.4BSD as another type of filesystem and provides some examples.", URL="http://www.usenix.org/publications/library/proceedings/neworl/stevens.html", } @INPROCEEDINGS{John9501:Dynamic, AUTHOR="Aju John", TITLE="Dynamic Vnodes - Design and Implementation", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="Dynamic vnodes make the UNIX kernel responsive to a varying demand for vnodes, without a need to rebuild the kernel. It also optimizes the usage of memory by deallocating excess vnodes. This paper describes the design and implementation of dynamic vnodes in DEC OSF/1 V3.0. The focus is on the vnode deallocation logic in a Symmetric Multi-Processing environment. Deallocation of vnodes differs from the familiar concept of dynamically allocated data structures in the following ways: the legacy name-cache design implicitly assumes that vnodes are never deallocated, and the vnode free-list needs to cache unused vnodes effectively.", URL="http://www.usenix.org/publications/library/proceedings/neworl/john.html", } @INPROCEEDINGS{Pend9501:Union, AUTHOR="Jan-Simon Pendry and Marshall K. McKusick", TITLE="Union Mounts in 4.4BSD-Lite", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="This paper describes the design and rationale behind union mounts, a new filesystem-namespace management tool available in 4.4BSD-Lite. Unlike a traditional mount that hides the contents of the directory on which it is placed, a union mount presents a view of a merger of the two directories. Although only the filesystem at the top of the union stack can be modified, the union filesystem gives the appearance of allowing anything to be deleted or modified. Files in the lower layer may be deleted with whiteout in the top layer. Files to be modified are automatically copied to the top layer. This new functionality makes possible several new applications including the ability to apply patches to a CD-ROM and eliminate symbolic links generated by an automounter. Also possible is the provision of per-user views of the filesystem, allowing private views of a shared work area, or local builds from a centrally shared read-only source tree.", URL="http://www.usenix.org/publications/library/proceedings/neworl/mckusick.html", } @INPROCEEDINGS{Deva9501:Alternatives, AUTHOR="Murthy Devarakonda and Ajay Mohindra and Jill Simoneaux and William H. Tetzlaff", TITLE="Evaluation of Design Alternatives for a Cluster File System", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="Based on implementation experience and measurements, this paper presents an evaluation of design alternatives to a cluster file system. The file system is targeted for IBM cluster systems, Scalable POWERparallel and AIX HACMP/600. We considered a shared disk approach where serialized, multiple instances of a single-system file system directly access file data as disk blocks, and a shared file system approach which is the conventional method of distributing file system function between a client and a server. We conclude that the shared disk approach suffers formt eh difficulties of metadata serialization, pooor write-sharing performance, and read throughput.", URL="http://www.usenix.org/publications/library/proceedings/neworl/devarakonda.html", } @INPROCEEDINGS{Gold9501:MULTI, AUTHOR="Jonathan S. Goldick and Kathy Benninger and Christopher Kirby and Christopher Maher and Bill Zumach", TITLE="Multi-resident {AFS:} an adventure in mass storage", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="The Pittsburgh Supercomputing Center has been working to integrate distributed file system technology with hierarchical mass storage. We produced a system utilizing the Andrew File System that can be interfaced to many mass storage systems. We retained the semantics of AFS and compatibilitywith standard clients and servers. The architecture has a logical separation between the facility that provides the user interface and access semantics and the management of the storage systems that contain user data. Support for file level replication is provided for high availability to data in a fashion that is transparent to users. This system is called Multi-Resident AFS.", URL="http://www.usenix.org/publications/library/proceedings/neworl/zumach.html", } @INPROCEEDINGS{Mill9501:RAMA, AUTHOR="Ethan L. Miller and Randy H. Katz", TITLE="{RAMA:} Easy Access to a High-Bandwidth Massively Parallel File System", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="Massively parallel file systems must provide high bandwidth file access to programs running on their machines. Most accomplish this goal by striping files across arrays of disks attached to a few specialized I/O nodes in the massively parallel processor (MPP). This arrangement requires programmers to give the file system many hints on how their data is to be laid out on disk if they want to achieve good performance. Additionally, the custom interface makes massively parallel file systems hard for programmers to use and difficult to seamlessly integrate into an environment with workstations and tertiary storage. The RAMA file system addresses these problems by providing a massively parallel file system that does not need user hints to provide good performance. RAMA takes advantage of the recent decrease in physical disk size by assuming that each processor in an MPP has one or more disks attached to it. Hashing is then used to pseudo-randomly distribute data to all of these disks, insuring high bandwidth regardless of access pattern. Since MPP programs often have many nodes accessing a single file in parallel, the file system must allow access to different parts of the file without relying on a particular node. In RAMA, a file request involves only two nodes - the node making the request and the node on whose disk the data is stored. Thus, RAMA scales well to hundreds of processors. Since RAMA needs no layout hints from applications, it fits well into systems where users cannot (or will not) provide such hints. Fortunately, this flexibility does not cause a large loss of performance. RAMA's simulated performance is within 10-15\% of the optimum performance of a similarly-sized striped file system, and is a factor of 4 or more better than a striped file system with poorly laid out data.", URL="http://www.usenix.org/publications/library/proceedings/neworl/miller.html", } @INPROCEEDINGS{Kuma9501:Flexible, AUTHOR="P. R. Kumar and M. Satyanarayanan", TITLE="Flexible and Safe Resolution of File Conflicts", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="In this paper we describe the support provided by the Coda File System for transparent resolution of conflicts arising from concurrent updates to a file in different network partitions. Such partitions often occur in mobile computing environments. Coda provides a framework for invoking customized pieces of code called application-specific resolvers (asrs) that encapsulate the knowledge needed for file resolution. If resolution succeeds, the user notices nothing more than a slight performance delay. Only if resolution fails does the user have to resort to manual repair. Our design combines a rule-based approach to asr selection with transactional encapsulation of asr execution. This paper shows how such an approach leads to flexible and efficient file resolution without loss of security or robustness.", URL="http://www.usenix.org/publications/library/proceedings/neworl/kumar.html", } @INPROCEEDINGS{Dill9501:OODCE, AUTHOR="J. Dilley", TITLE="{OODCE:} A {C++} Framework for the {OSF} Distributed Computing Environment", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="This paper presents a method for developing object-oriented distributed applications using the C++ and DCE technologies. The core of this package is a DCE IDL-to-C++ compiler and a set of C++ classes providing easy access to DCE functionality. Using this approach we were able to develop more object-oriented distributed applications, and saw a significant decrease in application code size. This contributed to an increase in developer productivity and code maintainability.", URL="http://www.usenix.org/publications/library/proceedings/neworl/dilley.html", } @INPROCEEDINGS{Stev9501:Mach, AUTHOR="John Stevenson and D. P. Julin", TITLE="Mach-US: {UNIX} On Generic {OS} Object Servers", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="This paper examines the Mach-US operating system, its unique architecture, and the lessons demonstrated through its implementation. Mach-US is an object-oriented multi-server OS which runs on the Mach3.0 kernel. Mach-US has a set of separate servers supplying orthogonal OS services and a library which is loaded into each user process. This library uses the services to generate the semantics of the Mach2.5/4.3BSD application programmers interface (API). This architecture makes Mach-US a flexible research platform and a powerful tool for developing and examining various OS service options. We will briefly describe Mach-US, the motivations for its design choices, and its demonstrated strengths and weaknesses. We will then discuss the insights that we've acquired in the areas of multi-server architecture, OS remote method invocation, Object Oriented technology for OS implementation, API independent OS services, UNIX API re-implementation, and smart user-space API emulation libraries.", URL="http://www.usenix.org/publications/library/proceedings/neworl/stevenson.html", } @INPROCEEDINGS{Wald9501:Events, AUTHOR="Jim Waldo and Ann Wollrath and G. Wyant and Samuel C. Kendall", TITLE="Events in an {RPC} Based Distributed System", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="We show how to build a distributed system allowing objects to register interest in and receive notifications of events in other objects. The system is built on top of a pair of interfaces that are interesting only in their extreme simplicity. We then present a simple and efficient implementation of these interfaces. We then show how more complex functionality can be introduced to the system by adding third-party services. These services can be added without changing the simple interfaces, and without changing the objects in the system that do not need the functionality of those services. Finally, we note a number of open issues that remain, and attempt to draw some conclusions based on the work.", URL="http://www.usenix.org/publications/library/proceedings/neworl/waldo.html", } @INPROCEEDINGS{Talb9501:Turning, AUTHOR="Jacques Talbot", TITLE="Turning the {AIX} Operating System into an {MP-capable} {OS}", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="This paper describes those MP features that Bull and IBM together introduced into the AIX operating system to support the Symmetric Multiprocessor machine marketed by Bull under the Escala name and by IBM under the RS/6000 Models G30, J30 and R30 names. The PowerPC architecture and the AIX operating system present some specific challenges. We present the major problems encountered and how they were solved.", URL="http://www.usenix.org/publications/library/proceedings/neworl/talbot.html", } @INPROCEEDINGS{Kawa9501:Flash, AUTHOR="Atsuo Kawaguchi and Shingo Nishioka and Hiroshi Motoda", TITLE="A Flash-Memory Based File System", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="A flash memory device driver that supports a conventional UNIX file system transparently was designed. To avoid the limitations due to flash memory's restricted number of write cycles and its inability to be overwritten, this driver writes data to the flash memory system sequentially as a Log-structured File System (LFS) does and uses a cleaner to collect valid data blocks and reclaim invalid ones by erasing the corresponding flash memory regions. Measurements showed that the overhead of the cleaner has little effect on the performance of the prototype when utilization is low but that the effect becomes critical as the utilization gets higher, reducing the random write throughput from 222 Kbytes/s at 30\% utilization to 40 Kbytes/s at 90\% utilization. The performance of the prototype in the Andrew Benchmark test is roughly equivalent to that of the 4.4BSD Pageable Memory based File System (MFS).", URL="http://www.usenix.org/publications/library/proceedings/neworl/kawaguchi.html", } @INPROCEEDINGS{Berm9501:TRON, AUTHOR="Andrew Berman and Virgil Bourassa and Erik Selberg", TITLE="{TRON:} Process-Specific File Protection for the {UNIX} Operating System", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="The file protection mechanism provided in UNIX is insufficient for current computing environments. While the UNIX file protection system attempts to protect users from attacks by other users, it does not directly address the agents of destruction-executing processes. As computing environments become more interconnected and interdependent, there is increasing pressure and opportunity for users to acquire and test non-secure, and possibly malicious, software. We introduce TRON, a process-level discretionary access control system for UNIX. TRON allows users to specify capabilities for a process' access to individual files, directories, and directory trees. These capabilities are enforced by system call wrappers compiled into the operating system kernel. No privileged system calls, special files, system administrator intervention, or changes to the file system are required. Existing UNIX programs can be run without recompilation under TRON-enhanced UNIX. Thus, TRON improves UNIX security while maintaining current standards of flexibility and openness.", URL="http://www.usenix.org/publications/library/proceedings/neworl/bourassa.html", } @INPROCEEDINGS{Yan9501:SIFT, AUTHOR="T.-Y. Yan and H. Garcia-Molina", TITLE="{SIFT} -- A Tool for Wide-Area Information Dissemination", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="The dissemination model is becoming increasingly important in wide-area information system. In this model, the user subscribes to an information dissemination service by submitting profiles that describe his interests. He then passively receives new, filtered information. The Stanford Information Filtering Tool (SIFT) is a tool to help provide such service. It supports full-text filtering using well-known information retrieval models. The SIFT filtering engine implements novel indexing techniques, capable of processing large volumes of information against a large number of profiles. It runs on several major Unix platforms and is freely available to the public. In this paper we present SIFT's approach to user interest modeling and user-server communication. We demonstrate the processing capability of SIFT by describing a running server that disseminates USENET News. We present an empirical study of SIFT's performance, examining its main memory requirement and ability to scale with information volume and user population.", URL="http://www.usenix.org/publications/library/proceedings/neworl/yan.html", } @INPROCEEDINGS{Mogu9501:IMPLICATIONS, AUTHOR="J. C. Mogul and Joel F. Bartlett and Robert Mayo and Amitabh Srivastava", TITLE="{PERFORMANCE} {IMPLICATIONS} {OF} {MULTIPLE} {POINTER} {SIZES}", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="Many users need 64-bit architectures: 32-bit systems cannot support the largest applications, and 64-bit systems perform better for some applications. However, performance on some other applications can suffer from the use of large pointers; large pointers can also constrain feasible problem size. Such applications are best served by a 64-bit machine that supports the use of both 32-bit and 64-bit pointer variables. This paper analyzes several programs and programming techniques to understand the performance implications of different pointer sizes. Many (but not all) programs show small but definite performance consequences, primarily due to cache and paging effects.", URL="http://www.usenix.org/publications/library/proceedings/neworl/mogul.html", } @INPROCEEDINGS{Gold9501:Idleness, AUTHOR="Richard A. Golding and Peter Bosch and Carl Staelin and Tim Sullivan and John Wilkes", TITLE="Idleness is not sloth", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="Many people have observed that computer systems spend much of their time idle, and various schemes have been proposed to use this idle time productively. The commonest approach is to off-load activity from busy periods to less-busy ones in order to improve system responsiveness. In addition, speculative work can be performed in idle periods in the hopes that it will be needed later at times of higher utilization, or non-renewable resource like battery power can be conserved by disabling unused resources. We found opportunities to exploit idle time in our work on storage systems, and after a few attempts to tackle specific instances of it in ad hoc ways, began to investigate general mechanisms that could be applied to this problem. Our results include a taxonomy of idle-time detection algorithms, metrics for evaluating them, and an evaluation of a number of idleness predictors that we generated from our taxonomy.", URL="http://www.usenix.org/publications/library/proceedings/neworl/wilkes.html", } @INPROCEEDINGS{Plan9501:Libckpt, AUTHOR="James Plank and Michael Beck and Gerry Kingsley and Kin Li", TITLE="Libckpt: Transparent Checkpointing under Unix", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="Checkpointing is a simple technique for rollback recovery: the state of an executing program is periodically saved to a disk file from which it can be recovered after a failure. While recent research has developed a collection of powerful techniques for minimizing the overhead of writing checkpoint files, checkpointing remains unavailable to most application developers. In this paper we describe libckpt, a portable checkpointing tool for Unix that implements all applicable performance optimizations which are reported in the literature. While libckpt can be used in a mode which is almost totally transparent to the programmer, it also supports the incorporation of user directives into the creation of checkpoints. This ``user-directed'' checkpointing is an innovation which is unique to our work.", URL="http://www.usenix.org/publications/library/proceedings/neworl/plank.html", } @INPROCEEDINGS{Ho9501:Optimizing, AUTHOR="W. W. Ho and W. Chang and Lilian H. Leung", TITLE="Optimizing the Performance of Dynamically-Linked Programs", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="Dynamically-linked programs in general do not perform as well as statically-linked programs. This paper identifies three main areas that account for the performance loss. First, symbols are referenced indirectly and thus extra instructions are required. Second, the overhead in run-time symbol resolution is significant. Third, poor locality of functions in shared libraries and data structures maintained by the run-time linker may result in poor memory utilization. This paper presents new optimization techniques we developed that address these three areas and significantly improve the performance of dynamically-linked programs. Also, we provide measurements of the performance improvement achieved. Most importantly, we show that all desirable features of shared libraries can be achieved without sacrificing performance.", URL="http://www.usenix.org/publications/library/proceedings/neworl/ho.html", } @INPROCEEDINGS{Arno9501:DP, AUTHOR="David M. Arnow", TITLE="{DP:} A library for building portable, reliable distributed applications", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="DP is a library of process management and communication tools for writing portable, reliable distributed applications. It provides support for a flexible set of message operations as well as process creation and management. It has been successfully used in developing distributed Monte Carlo, disjunctive programming and integer goal programming codes.It differs from PVM and similar libraries in its support for lightweight, unreliable messages, as well as asynchronous delivery of interrupt-generating messages. In addition, DP supports the development of long-running distributed applications tolerant to the failure or loss of a subset of its processors.", URL="http://www.usenix.org/publications/library/proceedings/neworl/arnow.html", } @INPROCEEDINGS{Selt9501:File, AUTHOR="Margo Seltzer and Keith A. Smith and H. Balakrishnan and John H. Chang and Sara McMains and Venkata N. Padmanabhan", TITLE="File System Logging Versus Clustering: A Performance Comparison", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="The Log-structured File System (LFS), introduced in 1991 [8], has received much attention for its potential order-of-magnitude improvement in file system performance. Early research results [9] showed that small file performance could scale with processor speed and that cleaning costs could be kept low, allowing LFS to write at an effective bandwidth of 62 to 83\% of the maximum. Later work showed that the presence of synchronous disk operations could degrade performance by as much as 62\% and that cleaning overhead could become prohibitive in transaction processing workloads, reducing performance by as much as 40\%. The same work showed that the addition of clustered reads and writes in the Berkeley Fast File System [6] (FFS) made it competitive with LFS in large-file handling and software development environments as approximated by the Andrew benchmark [4]. These seemingly inconsistent results have caused confusion in the file system research community. This paper presents a detailed performance comparison of the 4.4BSD Log-structured File System and the 4.4BSD Fast File System. Ignoring cleaner overhead, our results show that the order-of-magnitude improvement in performance claimed for LFS applies only to meta-data intensive activities, specifically the creation of files one-kilobyte or less and deletion of files 64 kilobytes or less. For small files, both systems provide comparable read performance, but LFS offers superior performance on writes. For large files (one megabyte and larger), the performance of the two file systems is comparable. When FFS is tuned for writing, its large-file write performance is approximately 15\% better than LFS, but its read performance is 25\% worse. When FFS is optimized for reading, its large-file read and write performance is comparable to LFS. Both LFS and FFS can suffer performance degradation, due to cleaning and disk fragmentation respectively. We find that active FFS file systems function at approximately 85-95\% of their maximum performance after two to three years. We examine LFS cleaner performance in a transaction processing environment and find that cleaner overhead reduces LFS performance by more than 33\% when the disk is 50\% full.", URL="http://www.usenix.org/publications/library/proceedings/neworl/seltzer.html", } @INPROCEEDINGS{Vaha9501:Metadata, AUTHOR="Uresh Vahalia and Cary G. Gray and Dennis Ting", TITLE="Metadata Logging in an {NFS} Server", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="Over the last few years, there have been several efforts to use logging to improve performance, reliability, and recovery times of file systems. The two major techniques are metadata logging, where the log records metadata changes and is a supplement to the on-disk file system, and log-structured file systems, whose log is their only on-disk representation. When the file system is mainly or wholly accessed through the Network File System (NFS) protocol, it adds new considerations to the suitability of the logging technique. NFS requires that all operations be updated to stable storage before returning. As a result, file system implementations that were effective for local access may perform poorly on an NFS server. This paper analyzes the issues regarding the use of logging on an NFS server, and describes an implementation of a BSD Fast File System (FFS) with metadata logging that performs effectively for a dedicated NFS server.", URL="http://www.usenix.org/publications/library/proceedings/neworl/vahalia.html", } @INPROCEEDINGS{Blac9501:Heuristic, AUTHOR="T. Blackwell and Jim Harris and Margo Seltzer", TITLE="Heuristic Cleaning Algorithms in Log-Structured File Systems", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="Research results show that while Log-Structured File Systems (LFS) offer the potential for dramatically improved file system performance, the cleaner can seriously degrade performance, by as much as 40\% in transaction processing workloads [9]. Our goal is to examine trace data from live file systems and use those to derive simple heuristics that will permit the cleaner to run without interfering with normal file access. Our results show that trivial heuristics perform very well, allowing 97\% of all cleaning on the most heavily loaded system we studied to be done in the background.", URL="http://www.usenix.org/publications/library/proceedings/neworl/blackwell.html", } @INPROCEEDINGS{Rams9501:New, AUTHOR="Norman Ramsey and Mary F. Fernandez", TITLE="The New Jersey Machine-Code Toolkit", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="The New Jersey Machine-Code Toolkit helps programmers write applications that process machine code. Applications that use the toolkit are written at an assembly-language level of abstraction, but they recognize and emit binary. Guided by a short instruction-set specification, the toolkit generates all the bit-manipulating code. The toolkit's specification language uses four concepts: fields and tokens describe parts of instructions, patterns describe binary encodings of instructions or groups of instructions, and constructors map between the assembly-language and binary levels. These concepts are suitable for describing both CISC and RISC machines; we have written specifications for the MIPS R3000, SPARC, and Intel 486 instruction sets. We have used the toolkit to help write two applications: a debugger and a linker. The toolkit generates efficient code; for example, the linker emits binary up to 15\% faster than it emits assembly language, making it 1.7-2 times faster to produce an a.out directly than by using the assembler.", URL="http://www.usenix.org/publications/library/proceedings/neworl/ramsey.html", } @INPROCEEDINGS{Eust9501:ATOM, AUTHOR="Alan Eustace and Amitabh Srivastava", TITLE="{ATOM,} A Flexible Interface for Building High Performance Program Analysis Tools", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="Code instrumentation is a powerful mechanism for understanding program behavior. Unfortunately, code instrumentation is extremely difficult, and therefore has been mostly relegated to building special purpose tools for use on standard industry benchmark suites. ATOM (Analysis Tools with OM) provides a very flexible and efficient code instrumentation interface that allows powerful, high performance program analysis tools to be built with very little effort. This paper illustrates this flexibility by building five complete tools that span the interests of application programmers, computer architects, and compiler writers. This flexibility does not come at the expense of performance. Because ATOM uses procedure calls as the interface between the application and the analysis routines, the performance of each tool is similar to or greatly exceeds the best known hand-crafted implementations.", URL="http://www.usenix.org/publications/library/proceedings/neworl/eustace.html", } @INPROCEEDINGS{Grah9501:Adaptable, AUTHOR="Susan L. Graham and S. E. Lucco and R. Wahbe", TITLE="Adaptable Binary Programs", BOOKTITLE=usenix, ADDRESS="New Orleans, Louisiana", DAYS=16, MONTH="Jan", YEAR=1995, ABSTRACT="To accurately and comprehensively monitor a program's behavior, many performance measurement tools transform the program's executable representation or binary. By instrumenting binary programs to monitor program events, tools can precisely analyze compiler optimization effectiveness, memory system performance, pipeline interlocking, and other dynamic program characteristics that are fully exposed only at this level. Binary transformation has also been used to support software-enforced fault isolation, debugging, machine re-targeting, and machine-dependent optimization. At present, binary transformation applications face a difficult trade-off. Previous approaches to implementing robust transformations result in significant disk space and run-time overhead. To improve efficiency, some current systems sacrifice robustness, relying on heuristic assumptions about the program and recognition of compiler-dependent code generation idioms. In this paper we begin by investigating the run-time and disk space overhead of transformation strategies that do not require assumptions about the program's control flow or register usage. We then detail simple information about the binary program that can significantly reduce this overhead. For each type of information, we show how it enables a corresponding type of binary transformation. We call binary programs that contain such enabling information adaptable binaries. Because adaptable binary information is simple, any compiler can generate it. Despite its simplicity, adaptable binary information has the necessary and sufficient expressive power to support a rich set of binary transformations.", URL="http://www.usenix.org/publications/library/proceedings/neworl/wahbe.html", } @TECHREPORT{Shuk9501:Multicast, AUTHOR="Shridhar B. Shukla", TITLE="Multicast Tree Construction in Network Topologies with Asymmetric Link Loads", TYPE="Technical Report", INSTITUTION="Electrical and Computer Engineering, Naval Postgraduate School", ADDRESS="Monterey, California", MONTH=jan, YEAR=1995, KEYWORDS="multicast tree construction; distribution centers; resource reservation; asymmetric link loads; multiparty interactions", ABSTRACT="This paper addresses the problem of constructing multicast trees with reservation of resources. The main features of the approach described here are that it tolerates asymmetric traffic loads on network links and algorithmically locates data distribution centers for every multiparticipant interaction. A fast and scalable algorithm for locating distribution centers based on the network load and a priori knowledge of participants' locations and resource requirements is given. To explicitly handle cases of disjoint send and receive paths between two nodes, a protocol to build separate send-trees and receive-trees around the centers located in the above manner is given. Simulation results on various topologies are presented showing that, with the above center location mechanism, center-specific trees yield lower tree cost than source-specific trees for many concurrent senders with only a modest increase in the average path length. The use of distribution centers, a priori information, and sensitivity to load asymmetry permit effective combination of center-specific and source-specific trees for an interaction and eliminate the need for symmetry checks during resource reservation.", URL="ftp://ftp.nps.navy.mil/pub/ece/shukla/nps-mltcst-asym-linksv1.ps.Z", } @ARTICLE{Ayan9501:AIRMAIL, AUTHOR="Ender Ayanoglu and Sunil Paul and Thomas La Porta and K. Sabnani and R. D. Gitlin", TITLE="{AIRMAIL:} A link-layer protocol for wireless networks", JOURNAL=wln, VOLUME=1, NUMBER=1, MONTH=jan, YEAR=1995, KEYWORDS="wireless networks; link layer", ABSTRACT="This paper describes the design and performance of a link-layer protocol for indoor and outdoor wireless networks. The protocol is asymmetric to reduce the processing load at the mobile, reliability is established by a combination of automatic repeat request and forward error correction, and link-layer packets are transferred appropriately during handoffs. The protocol is named ``AIRMAIL'' (AsymmetrIc Reliable Mobile Access In Link-layer). The asymmetry is needed in the design because the mobile terminals have limited power and smaller processing capability than the base stations. The key ideas in the asymmetric protocol design consist of placing bulk of the intelligence in the base station as opposed to placing it symmetrically, in requiring the mobile terminal to combine several acknowledgments into a single acknowledgment to conserve power, and in designing the base stations to send periodic status messages, while making the acknowledgment from the mobile terminal event-driven. The asymmetry in the protocol design results in a one-third reduction of compiled code. The forward error correction technique incorporates three levels of channel coding which interact adaptively. The motivation for using a combination of forward error correction and link-layer retransmissions is to obtain better performance in terms of end-to-end throughput and latency by correcting errors in an unreliable wireless channel in addition to end-to-end correction rather than by correcting errors only by end-to-end retransmissions. The coding overhead is changed adaptively so that bandwidth expansion due to forward error correction is minimized. Integrity of the link during handoffs (in the face of mobility) is handled by window management and state transfer. The protocol has been implemented. Experimental performance results based on the implementation are presented.", } @ARTICLE{Mark9501:Evaluation, AUTHOR="J. G. Markoulidakis and G. L. Lyberopoulos and D. F. Tsirkas and E. Sykas", TITLE="Evaluation of location area planning scenarios in future mobile telecommunication systems", JOURNAL=wln, VOLUME=1, NUMBER=1, MONTH=jan, YEAR=1995, KEYWORDS="wireless networks; signalling", ABSTRACT="In third generation mobile telecommunication systems, signalling requirements due to location updating and paging are epxected to be remarkable, mainly because of the huge number of mobile subscribers. Location area planning is characterized by the trade-off between the number of location updates and the amount of paging signalling that the network has to deal with. Location area planning should be based on criteria which guarantee that signalling load will be kept under tolerable levels. Various approaches for location area planning in a city environment - the worst case environment - are discussed in this paper. The simplest approach is the use of heuristic algorithms for approximating the optimum location area configuration. Then more complex scenarios which are based on geographical criteria (population distribution, highway topology, etc.) are investigated. Finally, user mobility characteristics are taken into account in the most complex scenarios. All scenarios are applied over a simulation model representing a city area, providing us with a very clear view of their performance characteristics.", } @ARTICLE{Rao9501:Interworking, AUTHOR="S. V. Rao and David J. Goodman and G. P. Pollini and K. S. Meier-Hellstern", TITLE="Interworking between Digital European Cordless Telecommunications and a distributed packet switch", JOURNAL=wln, VOLUME=1, NUMBER=1, MONTH=jan, YEAR=1995, KEYWORDS="wireless networks; DECT", ABSTRACT="The Digital European Cordless Telecommunications (DECT) standard specifies an air interface. DECT requires an external infrastructure to transfer information between wireless terminals and to transfer information between a wireless terminal and a fixed network. The Public Switched Telephone Network, The GSM Cellular Network, Private Branch Exchanges and mobile data networks are all under investigation as DECT backbone networks. In this paper we look to the future and describe interworking between DECT air interface and a wireless network infrastructure referred to as a Cellular Packet Switch. To achieve distributed network control, the Cellular Packet Switch uses an IEEE 802.6 Metropolitan Area Network to link base stations, databases and fixed networks. In this paper we specify details of DECT information transport on the Matropolitan Area Network. We also give examples of Network Layer message flows for location updating and handover. The messages for other key procedures including call origination and release appear in a more detailed technical report.", } @ARTICLE{Liu9501:Performance, AUTHOR="Z. Liu and Magda El Zarki", TITLE="Performance analysis of {DS-CDMA} with slotted {ALOHA} random access for packet {PCN's}", JOURNAL=wln, VOLUME=1, NUMBER=1, MONTH=jan, YEAR=1995, KEYWORDS="wireless networks; media access", ABSTRACT="In this paper we present a discrete time Markov chain based analytical framework for the study of Direct-Sequence Code-Division-Multiple-Access (DS-CDMA) with slotted ALOHA random access protocols (DS-CDMA-S-ALOHA) for packet Personal-Communications-Networks (PCNs). It incorporates both the random access and the random errors associated with DS-CDMA-S-ALOHA protocols into a unified framework. The key feature is that it distinguishes between the two stages in the transmission process, namely the access stage and the reception stage, which characterize the random access and the random errors associated with DS-CDMA-S-ALOHA protocols respectively. Two DS-CDMA-S-ALOHA protocols are presented and analyzed. The performance of the protocols and the effects of the design parameters, namely the packet retransmission probability and the forward error correction code rate of the Bose-Chaudhuri-Hocquenhem (BCH) block codes are evaluated numerically and compared with a bandwith equivalent conventional multi-channel slotted ALOHA DS-CDMA-S-ALOHA protocols can double the troughput with respect to that of a bandwith equivalent conventional multi-channel slotted ALOHA system", } @ARTICLE{Math9501:Distribution, AUTHOR="R. Mathar and J. Mattfeldt", TITLE="On the distribution of cumulated interference power in Rayleigh fading channels", JOURNAL=wln, VOLUME=1, NUMBER=1, MONTH=jan, YEAR=1995, KEYWORDS="wireless networks", ABSTRACT="This paper deals with the distribution of cumulated instantaneous interference power in a Rayleigh fading channel for an infinite number of interfering stations, where each station transmits with a certain probability, independently of all others. If all distances are known, a necessary and sufficient condition is given for the corresponding distribution to be nondefective. Explicit formulae of density and distribution functions are obtained in the interesting special case that interfering stations are located on a linear grid. Moreover, the Laplace transform of cumulated power is investigated when the positions of stations follow a one- or two-dimensional Poisson process. It turns out that the corresponding distribution is defective for the two-dimensional models.", } @ARTICLE{Esco9501:Run, AUTHOR="J. Escobar", TITLE="Run-away dynamics of {CDMA} channels in an adaptive packet radio network", JOURNAL=wln, VOLUME=1, NUMBER=1, MONTH=jan, YEAR=1995, KEYWORDS="wireless networks; transient analysis; media access", ABSTRACT="Radio communication offers the great advantage of mobility for users. At least two important systems exploit this feature: packet radio networks and personal communication systems. Since their radio links are subject to rapid changes in quality, the ability to adapt to these changes has much to offer in improving throughput, delay, and robustness characteristics. This paper addresses three areas. First, it presents the design fundamentals of an adaptive link-gain control algorithm for a multiple access radio channel. Second, it develops a probabilistic model for a related family of algorithms, which includes models for the effects of code-division multiple access interference. Third, it uses two sample algorithms to explore the transient behaviour of the system. The two algorithms are chosen to compare the relative merits of designs that emphasize adapting to channel noise versus adapting to multiple access interference. Transient analysis is sparse in the literature and is an important contribution of this paper.", } @ARTICLE{Awer9501:Competitive, AUTHOR="B. Awerbuch and Y. Azar", TITLE="Competitive multicast routing in virtual circuit environments", JOURNAL=wln, VOLUME=1, NUMBER=1, MONTH=jan, YEAR=1995, KEYWORDS="wireless networks; routing; multicast", ABSTRACT="In this paper, we introduce and solve the multicast routing problem for virtual circuit environment without making any assumptions about the communication patterns, or about the network topology. By multicast we refer to the case where one source transmits to several destinations the same information. Also, we allow arbitrary interleaving of subscription patterns for different multicast groups, i.e. the destinations for each group arrive at an arbitrary order and may be interleaved with destinations of other groups. Our goal is to make route selection so as to minimize congestion of the bottleneck link. This is the first analytical treatment for this problem in its full generality. The main contribution of this paper is an on-line competitive routing strategy that has an $O(\log n\log d)$ competitive factor where $n$ is the size of the network and $d (