@ARTICLE{Abde00:QoS, AUTHOR="T. F. Abdelzaher and Ella M. Atkins and Kang G. Shin", TITLE="{QoS} negotiation in real-time systems and its application to automated flight control", JOURNAL=ieeetc, YEAR=2000, KEYWORDS="Embedded real-time systems; QoS negotiation; adaptive QoS", ABSTRACT="We propose a model for quality-of-service (QoS) negotiation in building real-time services to meet both predictability and graceful degradation requirements. QoS negotiation is shown to (i) outperform conventional ``binary'' admission control schemes (either guaranteeing the required QoS or rejecting the service request), and (ii) achieve higher application perceived system utility. We incorporated the proposed QoS-negotiation model into an example real-time middleware service, called RTPOOL, which manages a distributed pool of shared computing resources (processors) to guarantee timeliness QoS for real-time applications. The efficacy and power of QoS negotiation are demonstrated for an automated flight control system implemented on a network of PCs running RTPOOL. This system is used to fly an F-16 fighter aircraft modeled using the Aerial Combat (ACM) F-16 Flight Simulator. Experimental results indicate that QoS negotiation, while maintaining real-time guarantees, enables graceful QoS degradation under conditions in which traditional schedulability analysis and admission control schemes fail.", URL="ftp://rtcl.eecs.umich.edu/outgoing/zaher/negotiation.ps", } @BOOK{Hers00:IP, AUTHOR="Olivier Hersent and David Gurle and Jean-Pierre Petit", TITLE="{IP} telephony", ISBN="0-201-619105", PUBLISHER="Addison Wesley", ADDRESS="Reading, Massachusetts", YEAR=2000, KEYWORDS="Internet telephony; SIP; H.323", } @TECHREPORT{Cisc00:Packet, AUTHOR="{Cisco Systems}", TITLE="{Packet-over-SONET/SDH}", TYPE="Application Note", INSTITUTION="Cisco", YEAR=2000, KEYWORDS="SONET; restoration; OSPF", ABSTRACT="Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH) and optical fiber have emerged as significant technologies for building large-scale, high-speed, Internet Protocol (IP)-based networks. Even though SONET/SDH is frequently labeled as ``Old World'' because it is a time division-multiplexing (TDM) technology optimized for voice traffic, its capability to provide high-bandwidth capacity for transporting data is the primary reason for ubiquitous use in the Internet and large enterprise data networks. Packet over SONET (PoS) technology, which allows efficient transport of data over SONET/SDH, has certainly been a major player in accommodating the explosive growth on the Internet. Cisco Systems helped pioneer PoS technology and has been at the forefront in delivering high-performance and cost-effective PoS solutions for use in service provider and enterprise networks. PoS provides a flexible solution that can be used in a variety of transport applications. Well known applications include use in network backbone infrastructures and data aggregation or distribution on the network edge and in the metropolitan area. Router PoS interfaces are frequently connected to Add Drop Multiplexers (ADMs), terminating point-to-point SONET/SDH links. Direct connections over dark fiber or via dense wave-division multiplexing (DWDM) systems is becoming increasingly popular.", ANNOTE="Claims that IP routing protocols with elaborate timing mechanisms to guarantee routing stability are unable to keep up, they would typically converge in several seconds after an alternate physical path has been selected.", URL="http://www.cisco.com/warp/public/cc/cisco/mkt/core/12000/prodlit/gspos\_an.htm", } @ARTICLE{DeVl00:Quality, AUTHOR="D. Vleeschauwer and Jan Janssen and G. H. Petit and Fabrice Poppe", TITLE="Quality Bounds for Packetized Voice Transport", JOURNAL="Alcatel Telecommunications Review", PAGES="19-24", MONTH="1st Quarter", YEAR=2000, KEYWORDS="packet voice; delay; quality of service; perceptual quality; VoIP", ABSTRACT="Mouth-to-ear delay and distortion are the main factors that determine the quality of a voice call. In the case of packetized voice calls, distortion may be introduced by the codec that compresses the voice signal or by the loss of voice packets. Controlling both the mouth-to-ear delay and distortion is the key to offering high quality packetized voice calls. The article discusses the E-model for predicting the subjective quality of a telephone call based on its characterizing transmission parameters. This model can be used to calculate a rating R that predicts subjective user reactions. Based on the model, the authors look at the influence of mouth-to-ear delay and distortion on the quality of a telephone call. They then determine the quality bounds that a network must comply with in order to provide an acceptable quality for packetized voice transport.", URL="http://www.alcatel.com/telecom/mbd/publi/atr/1\_00/pages/04.htm", } @INPROCEEDINGS{Feld0008:Deriving, AUTHOR="Anja Feldmann and Albert Greenberg and Carsten Lund and Nick Reingold and Jennifer Rexford and Fred True", TITLE="Deriving traffic demands for operational {IP} networks: Methodology and experience", BOOKTITLE=sigcomm, INSTITUTION="AT\\&T Research", ADDRESS="Stockholm, Sweden", MONTH="August/September", YEAR=2000, REFERENCES=17, KEYWORDS="traffic engineering", ABSTRACT="Engineering a large IP backbone network without an accurate, network-wide view of the actual traffic demands is challenging, to say the least. Shifts in user behavior, the emergence of new services and applications, changes in routing policies, and failures of network elements can result in significant (and sudden) uctuations in the traffic demands across the backbone. In this paper, we present a carefully constructed model of traffic demands to support traffic engineering and performance debugging of large operational Internet Service Provider networks. An important property of our model is that by defining traffic demand as volume of load originating from an ingress link and destined to a set of egress links, it is capable of capturing and predicting how routing can affect interdomain traffic, i.e., the traffic demands between individual domains. To infer the traffic demands, we propose a measurement methodology that combines low-level measurements collected at all ingress links with reachability information about all egress links. We discuss how to cope with situations where practical considerations limit the amount and quality of the necessary data. Specifically, we show how to infer interdomain traffic demands using measurements collected at a smaller number of edge links -- the peering links connecting to neighboring providers. We report on our experience in deriving the traffic demands in an operational IP backbone network, by collecting, validating, and joining very large and diverse sets of usage, configuration, and routing data from a large number of locations within the network and over extended periods of time (weeks). We conclude by providing a preliminary analysis of the observed dynamics of the traffic demands and a discussion of the practical implications for traffic engineering.", URL="http://www.research.att.com/~jrex/papers/sigcomm00.ps", } @ARTICLE{Cela00:Dynamic, AUTHOR="Nedo Celandroni and Erina Ferro and Invalid Invalid and Antonio Chimienti and Maurizio Lucenteforte", TITLE="Dynamic rate shaping on {MPEG-2} video streams for bandwidth saving on a faded satellite link", JOURNAL=ett, VOLUME=11, NUMBER=4, NOTE="Special issue on service quality control in multimedia wireless networks", MONTH="July/August", YEAR=2000, KEYWORDS="VBR; DSR; MPEG; scalability; layers; fading; satellites; noisy link; errors; video quality", ABSTRACT="In a previous work, we studied how to send a video stream over a noisy satellite channel using the scalability features of the MPEG­2 standard. The base and the enhancement flows were sent with different levels of protection (bit and coding rates) in order to deal with the channel degradation. In this paper, we add Dynamic Rate Shaping (DRS), thus obtaining a greater flexibility in the choice of transmission parameters. In fact, it is possible to trim the required bandwidth in continuous mode in the working range, thus saving some bandwidth when keeping the video quality constant during changing fade conditions. The performances of DRS applied to both the non­scalable and the scalable MPEG­2 coded video streams are shown separately. An application of the techniques presented is discussed, and some criteria are given for choosing the most suitable parameters, according to the service quality requirements.", URL="mailto:F.Potorti@cnuce.cnr.it", } @ARTICLE{Ofek00:Combined, AUTHOR="Yoram Ofek and Moti Yung", TITLE="Combined Asynchronous/Synchronous Packet Switching Architecture: {QoS} Guarantees for Integrated Parallel Computing and Real-Time Traffic", JOURNAL=jpdc, PAGES="275-296", YEAR=2000, } @INPROCEEDINGS{Papa0008:Data, AUTHOR="Maria Papadopouli and Henning Schulzrinne and Paul Castro and Parviz Kermani and Chatschik Bisdikian and Mahmoud Naghshineh", TITLE="Data Gathering and Distribution Across Widely Distributed Devices", BOOKTITLE=sigcomm, INSTITUTION="Columbia University", ADDRESS="Stockholm, Sweden", NOTE="student poster session", MONTH="August/September", YEAR=2000, KEYWORDS="mobile; wireless; sensor; pervasive; discovery; caching", ABSTRACT="In the years to come we envision mobile users roaming through metropolitan areas enabled with pervasive computing and communications. They will use their cellular phones, PDAs or laptops or other personal mobile devices to run context-aware services. To support these services, there will be a large number of sensors monitoring or measuring entities for a certain context (such as temperature, motion, location, presence of people or physical objects, speed, ``state'' of a room or a user) and producing data. Context-aware applications on the mobile devices will query for these sensors data as needed. Service discovery systems, such as JINI, SDS, INS, can be used to assist the mobile user to locate the (desired) sensors data. However, these protocols do not scale well in the wide area network (WAN). Our goal is to design a discovery system for application-specific sensor data in the WAN. The system considers a metropolitan area with a distributed collection of cooperating hosts attached to data repositories. The hosts act as application-based routers to locate the sensors data for the applications. The hosts gather the raw data produced by the sensors and store them in the repositories together with supporting XML-style meta-data or attributes. Queries for sensor data are expressed using these attributes. The relevant data for a query may reside in several (possibly disjoint) domains. By collecting data that either correspond to measurements from more than one sensor or to a longer monitoring period, the information certainty (accuracy) may increase. Moreover, applications have different requirements for information certainty and may trade it for a faster response. We design an infrastructure with the following characteristics: Each host generates indices (based on the application-specific attributes of the data) to characterize its stored content. The hosts cooperate with each other, learn about their indices and form application-specific hierarchies to forward the queries. An index is used as a ``hint'' to forward a query to the relevant data repository(ies). A host may participate in several hierarchies. The hierarchies expand or shrink based on the data availability and query popularity, i.e., we allow hosts to join or leave a hierarchy. The core hierarchy is location-based. In this logical hierarchy, each node corresponds to a group of hosts. Each host knows how to route a query to another host in the group or across the groups of t he hierarchy. A host may decompose a ``complex'' query to simpler ones and forward them further to the relevant data repositories. Based on the application requirements, the responses are processed, composed and forwarded back to the application. In this work-in-progress poster, we discuss some fundamental characteristics of the multi-sensor systems, some design choices for supporting a scalable infra structure, and investigate how the hosts can locate faster the relevant data repository(ies).", URL="http://www.cs.columbia.edu/~maria/sigcomm2000-poster.ps", } @ARTICLE{Bake00:Case, AUTHOR="Fred andy Baker", TITLE="The Case for {QoS} -- Even if you could afford it, overprovisioning doesn't satisfy all application service-level requirements", JOURNAL="Packet Magazine", VOLUME=12, NUMBER=4, MONTH="Fourth Quarter", YEAR=2000, REFERENCES=4, KEYWORDS="QoS; queue management; tail drop; global synchronization; service classes; RED; CAR; Assured Forwarding", ABSTRACT="Do you really need QoS? Cisco Fellow Fred Baker makes the case that overprovisioning alone won't cut it with today's converged networks. He also explores the nature of TCP and the most effective QoS techniques to ensure the level of service each application requires.", URL="http://www.cisco.com/warp/public/784/packet/oct00/p62-cover.html", } @ARTICLE{Fung0012:Transport, AUTHOR="King P. Fung and Rocky Chang", TITLE="A Transport-Level Proxy for Secure Multimedia Streams", JOURNAL=ic, VOLUME=4, NUMBER=6, PAGES="57-67", MONTH="November/December", YEAR=2000, REFERENCES=14, KEYWORDS="security; firewall; SOCKS; RTSP", ABSTRACT="To provide secure traversal service, firewalls need more than static packet filtering and application-level proxies. SOCKS is an application-independent transport-level proxy that offers user-level authentication and data encryption. An extended SOCKS UDP binding model with appropriate socket calls is proposed to provide complete support for UDP-based, multimedia streaming applications. This article investigates the suitability of SOCKS, a transport-level proxy solution adopted by the Internet Engineering Task Force's Authenticated Firewall Traversal Working Group, for supporting multimedia streaming applications. The name SOCKS came from Secure Sockets, originally developed by David Koblas and Michelle Koblas. Specifically, we identify two problems encountered by SOCKS: a mismatch of call sequences between the SOCKS transport model and multimedia streaming protocols transport models, and inadequate socket call support for UDP binding. Failure to resolve these problems results in the firewall's blocking of the multimedia streams. We use the real-time streaming pro-tocol (RTSP), an IETF-proposed standard, to illustrate the problems, and we propose an enhanced SOCKS to provide complete support for UDP-based applications, particularly multimedia streaming applications.", URL="http://computer.org/internet/ic2000/", } @BOOK{Garc00:Communication, AUTHOR="Leon Garcia and Indra Widjaja", TITLE="Communication Networks - Fundamental Concepts and Key Architectures", ISBN="0-070228396", PUBLISHER="McGraw-Hill", YEAR=2000, KEYWORDS="computer networks; tutorial; text book; summary", URL="http://www.mhhe.com/engcs/compsci/leon-garcia/", } @INPROCEEDINGS{Bess00:Service, AUTHOR="Sandford Bessler and A. V. Nisanyan and K. Peterbauer and Rudolf Pailer and Johannes Stadler", TITLE="A Service Platform for Internet-Telecom Services using {SIP}", BOOKTITLE="Smartnet", INSTITUTION="Vienna University of Technology", YEAR=2000, REFERENCES=7, KEYWORDS="service platform; SIP; multimedia services; convergence in heterogeneous networks; Parlay", ABSTRACT="This paper proposes the introduction of a Service Platform for the creation, execution and management of multimedia services in heterogeneous networks. Examining the business-roles, the actors in the Service Platform are identified. Furthermore several common building blocks for developing services for the Internet are described and a brief overview of some modern technologies for an object-oriented, component-based, distributed platform for multimedia services is given. The Session Initiation Protocol (SIP) has been identified as very useful to implement all functions according to the multimedia part of the Platform. The usage of the PARLAY API as an open interface between the Platform Services and SIP, the PSTN or the mobile network provides a lot of additional advantages. The interworking between SIP and PARLAY is shown in a call-routing example. Furthermore the call-setup for a multimedia (e.g. video) conference is explained. This should demonstrate the usefulness and the ability of this protocol for introducing a session concept. Finally an outlook of open research topics regarding this concept is given as well as a short overview of related work.", URL="http://www.ikn.tuwien.ac.at/ftw-a1/SMARTNET\_SUBMISSION\_Final.doc", } @ARTICLE{Shen0001:Regular, AUTHOR="Prashant Shenoy and Harrick Vin", TITLE="Failure recovery algorithms for multimedia servers", JOURNAL=mms, VOLUME=8, NUMBER=1, PAGES="1-19", YEAR=2000, KEYWORDS="Multimedia storage servers;Redundant disk arrays;RAID;Fault tolerance;Video compression algorithms", ABSTRACT="In this paper, we present two novel disk failure recovery methods that utilize the inherent characteristics of video streams for efficient recovery. Whereas the first method exploits the inherent redundancy in video streams (rather than error-correcting codes) to approximately reconstruct data stored on failed disks, the second method exploits the sequentiality of video playback to reduce the overhead of online failure recovery in conventional RAID arrays. For the former approach, we present loss-resilient versions of JPEG and MPEG compression algorithms. We present an inherently redundant array of disks (IRAD) architecture that combines these loss-resilient compression algorithms with techniques for efficient placement of video streams on disk arrays to ensure that on-the-fly recovery does not impose any additional load on the array. Together, they enhance the scalability of multimedia servers by (1) integrating the recovery process with the decompression of video streams, and thereby distributing the reconstruction process across the clients; and (2) supporting graceful degradation in the quality of recovered images with increase in the number of disk failures. We present analytical and experimental results to show that both schemes significantly reduce the failure recovery overhead in a multimedia server.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008001/00080001.pdf", } @ARTICLE{Krun0001:Regular, AUTHOR="Marwan Krunz and George Apostolopoulos", TITLE="Efficient support for interactive scanning operations in {MPEG-based} video-on-demand systems", JOURNAL=mms, VOLUME=8, NUMBER=1, PAGES="20-36", YEAR=2000, KEYWORDS="MPEG;Video scheduling;Interactive video-on-demand;Scanning operations", ABSTRACT="In this paper, we present an efficient approach for supporting fast-scanning (FS) operations in MPEG-based video-on-demand (VOD) systems. This approach is based on storing multiple, differently encoded versions of the same movie at the server. A normal version is used for normal playback, while several scan versions are used for FS. Each scan version supports forward and backward FS at a given speedup. The server responds to an FS request by switching from the normal version to an appropriate scan version. Scanning versions are produced by encoding a sample of the raw frames using the same GOP pattern of the normal version. When a scanning version is decoded and played back at the normal frame rate, it gives a perceptual motion speedup. By being able to control the traffic envelopes of the scan versions, our approach can be integrated into a previously proposed framework for distributing archived, MPEG-coded video streams. FS operations are supported using no or little extra network bandwidth beyond what is already allocated for normal playback. Mechanisms for controlling the traffic envelopes of the scan versions are presented. The actions taken by the server and the client's decoder in response to various types of interactive requests are described in detail. The latency incurred in implementing various interactive requests is shown to be within an acceptable range. Striping and disk-scheduling strategies for storing various versions at the server are presented. Issues related to the implementation of our approach are discussed.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008001/00080020.pdf", } @ARTICLE{Ford0001:Regular, AUTHOR="Ralph M. Ford and Craig Robson and Daniel Temple and Michael Gerlach", TITLE="Metrics for shot boundary detection in digital video sequences", JOURNAL=mms, VOLUME=8, NUMBER=1, PAGES="37-46", YEAR=2000, KEYWORDS="Scene change detection;Shot boundary detection;Video indexing", ABSTRACT="The detection of shot boundaries in video sequences is an important task for generating indexed video databases. This paper provides a comprehensive quantitative comparison of the metrics that have been applied to shot boundary detection. In addition, several standardized statistical tests that have not been applied to this problem, as well as three new metrics, are considered. A mathematical framework for quantitatively comparing metrics is supplied. Experimental results based on a video database containing 39,000 frames are included.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008001/00080037.pdf", } @ARTICLE{Tse0001:Regular, AUTHOR="Philip Kwok Chung Tse and Clement H. C. Leung", TITLE="Improving multimedia systems performance using constant-density recording disks", JOURNAL=mms, VOLUME=8, NUMBER=1, PAGES="47-56", YEAR=2000, KEYWORDS="Multimedia storage;Constant-density recording disk;Disk performance;Performance analysis", ABSTRACT="Multimedia systems store and retrieve large amounts of data which require extremely high disk bandwidth and their performance critically depends on the efficiency of disk storage. However, existing magnetic disks are designed for small amounts of data retrievals geared to traditional operations; with speed improvements mainly focused on how to reduce seek time and rotational latency. When the same mechanism is applied to multimedia systems, overheads in disk I/O can result in dramatic deterioration in system performance. In this paper, we present a mathematical model to evaluate the performance of constant-density recording disks, and use this model to analyze quantitatively the performance of multimedia data request streams. We show that high disk throughput may be achieved by suitably adjusting the relevant parameters. In addition to demonstrating quantitatively that constant-density recording disks perform significantly better than traditional disks for multimedia data storage, a novel disk-partitioning scheme which places data according to their bandwidths is presented.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008001/00080047.pdf", } @ARTICLE{Wija0001:Egular, AUTHOR="Ravi Wijayaratne and A. Reddy", TITLE="Providing {QOS} guarantees for disk {I/O}", JOURNAL=mms, VOLUME=8, NUMBER=1, PAGES="57-68", YEAR=2000, KEYWORDS="Disk scheduling;VBR streams;QOS;Multiple QOS goals;Seek optimization", ABSTRACT="In this paper, we address the problem of providing different levels of performance guarantees or quality of service for disk I/O. We classify disk requests into three categories based on the provided level of service. We propose an integrated scheme that provides different levels of performance guarantees in a single system. We propose and evaluate a mechanism for providing deterministic service for variable-bit-rate streams at the disk. We will show that, through proper admission control and bandwidth allocation, requests in different categories can be ensured of performance guarantees without getting impacted by requests in other categories. We evaluate the impact of scheduling policy decisions on the provided service. We also quantify the improvements in stream throughput possible by using statistical guarantees instead of deterministic guarantees in the context of the proposed approach.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008001/00080057.pdf", } @ARTICLE{Lien0001:Automatic, AUTHOR="Rainer Lienhart and Wolfgang Effelsberg", TITLE="Automatic text segmentation and text recognition for video indexing", JOURNAL=mms, VOLUME=8, NUMBER=1, PAGES="69-81", YEAR=2000, KEYWORDS="Video processing;Character segmentation;Text recognition;OCR;Video ndexing;Video content analysis", ABSTRACT="Efficient indexing and retrieval of digital video is an important function of video databases. One powerful index for retrieval is the text appearing in them. It enables content-based browsing. We present our new methods for automatic segmentation of text in digital videos. The algorithms we propose make use of typical characteristics of text in videos in order to enable and enhance segmentation performance. The unique features of our approach are the tracking of characters and words over their complete duration of occurrence in a video and the integration of the multiple bitmaps of a character over time into a single bitmap. The output of the text segmentation step is then directly passed to a standard OCR software package in order to translate the segmented text into ASCII. Also, a straightforward indexing and retrieval scheme is introduced. It is used in the experiments to demonstrate that the proposed text segmentation algorithms together with existing text recognition algorithms are suitable for indexing and retrieval of relevant video sequences in and from a video database. Our experimental results are very encouraging and suggest that these algorithms can be used in video retrieval applications as well as to recognize higher level semantics in videos.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008001/00080069.pdf", } @ARTICLE{Chen0002:Dynamic, AUTHOR="Sheng-Tzong Cheng and Chi-Ming Chen and Ing-Ray Chen", TITLE="Dynamic quota-based admission control with sub-rating in multimedia servers", JOURNAL=mms, VOLUME=8, NUMBER=2, PAGES="83-91", YEAR=2000, ABSTRACT="An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the Quality of Service (QoS) requirements of the existing requests in the system. A novel quota-based admission control algorithm with sub-rating for two priority classes of requests is proposed in this study. The server capacity is divided into three partitions based on the quota values: one for each class of requests and one common pool shared by two classes of requests. Reward and penalty are adopted in the proposed system model. High-priority requests are associated with higher values of reward as well as penalty than low-priority ones. Given the characteristics of the system workload, the proposed algorithm finds the best partitions, optimizing the system performance based on the objective function of the total reward minus the total penalty. The sub-rating mechanism will reduce the QoS requirements of several low- priority clients, by cutting out a small fraction of the assigned server capacity, to accept a new high- priority client and to achieve a higher net earning value. A stochastic Petri-Net model is used to find the optimal quota values and two approximation approaches are developed to find sub-optimal settings. The experiment results show that the proposed algorithm performs better than one without sub-rating mechanism, and that the sub-optimal solutions found by the proposed approximation approaches are very close to optimal ones. The approximation approaches enable the algorithm to dynamically adjust the quota values, based on the characteristics of the system workload, to achieve higher system performance.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008002/00080083.pdf", } @ARTICLE{Vass0002:Video, AUTHOR="Constantinos Vassilakis and Michael Paterakis and Peter Triantafillou", TITLE="Video placement and configuration of distributed video servers on cable {TV} networks", JOURNAL=mms, VOLUME=8, NUMBER=2, PAGES="92-104", YEAR=2000, KEYWORDS="Distributed VOD systems;Program placement;HFC distribution networks", ABSTRACT="A large-scale, distributed video-on-demand (VOD) system allows geographically dispersed residential and business users to access video services, such as movies and other multimedia programs or documents on demand from video servers on a high-speed network. In this paper, we first demonstrate through analysis and simulation the need for a hierarchical architecture for the VOD distribution network.We then assume a hierarchical architecture, which fits the existing tree topology used in today's cable TV (CATV) hybrid fiber/coaxial (HFC) distribution networks. We develop a model for the video program placement, configuration, and performance evaluation of such systems. Our approach takes into account the user behavior, the fact that the user requests are transmitted over a shared channel before reaching the video server containing the requested program, the fact that the input/output (I/O) capacity of the video servers is the costlier resource, and finally the communication cost. In addition, our model employs batching of user requests at the video servers. We study the effect of batching on the performance of the video servers and on the quality of service (QoS) delivered to the user, and we contribute dynamic batching policies which improve server utilization, user QoS, and lower the servers' cost. The evaluation is based on an extensive analytical and simulation study.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008002/00080092.pdf", } @ARTICLE{Won0002:Minimizing, AUTHOR="Youjip Won and Jaideep Srivastava", TITLE="Minimizing buffer requirements for continuous media servers", JOURNAL=mms, VOLUME=8, NUMBER=2, PAGES="105-117", YEAR=2000, KEYWORDS="Multimedia;Disk scheduling;Data retrieval;Buffer management;Synchronization", ABSTRACT="Excessive buffer requirement to handle continuous-media playbacks is an impediment to cost- effective provisioning for on-line video retrieval. Given the skewed distribution of video popularity, it is expected that often there are concurrent playbacks of the same video file within a short time interval. This creates an opportunity to batch multiple requests and to service them with a single stream from the disk without violating the on-demand constraint. However, there is a need to keep data in memory between successive uses to do this. This leads to a buffer space trade-off between servicing a request in memory mode vs. servicing it in disk-mode. In this work, we develop a novel algorithm to minimize the buffer requirement to support a set of concurrent playbacks. One of the beauties of the proposed scheme is that it enables the server to dynamically adapt to the changing workload while minimizing the total buffer space requirement. Our algorithm makes a significant contribution in decreasing the total buffer requirement, especially when the user access pattern is biased in favor of a small set of files. The idea of the proposed scheme is modeled in detail using an analytical formulation, and optimality of the algorithm is proved. An analytical framework is developed so that the proposed scheme can be used in combination with various existing disk-scheduling strategies. Our simulation results confirm that under certain circumstances, it is much more resource efficient to support some of the playbacks in memory mode and subsequently the proposed scheme enables the server to minimize the overall buffer space requirement.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008002/00080105.pdf", } @ARTICLE{Soar0002:Modeling, AUTHOR="Luiz Soares and Rogério F. Rodrigues and Débora C. Muchaluat Saade", TITLE="Modeling, authoring and formatting hypermedia documents in the HyperProp system", JOURNAL=mms, VOLUME=8, NUMBER=2, PAGES="118-134", YEAR=2000, KEYWORDS="Nested context model;HyperProp system;Multimedia/hypermedia formatting;Document logical structuring;Spatio-temporal synchronization", ABSTRACT="This paper discusses multimedia and hypermedia modeling, authoring and formatting tools, presenting the proposals of the HyperProp system and comparing them to related work. It also highlights several research challenges that still need to be addressed. Moreover, it stresses the importance of document logical structuring and considers the use of compositions in order to represent context relations, synchronization relations, derivation relations and task relations in hypermedia systems. It discusses temporal and spatial synchronization among multimedia objects and briefly presents the HyperProp graphical authoring and formatting tools. Integration between the proposed system and the WWW is also addressed.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008002/00080118.pdf", } @ARTICLE{Kozu0002:Experimental, AUTHOR="Michael Kozuch and Wayne Wolf and Andrew Wolfe", TITLE="An experimental analysis of digital video library servers", JOURNAL=mms, VOLUME=8, NUMBER=2, PAGES="135-145", YEAR=2000, KEYWORDS="Video server;Non-linear video;Video library;Video walk-through;Performance analysis", ABSTRACT="Much work on video servers has concentrated on movies on demand, in which a relatively small number of titles are viewed and users are given basic VCR-style controls. This paper concentrates on analyzing video server performance for non-linear access applications. In particular, we study two non-linear video applications: video libraries, in which users select from a large collection of videos and may be interested in viewing only a small part of the title; and video walk-throughs, in which users can move through an image-mapped representation of a space. We present a characterization of the workloads of these applications. Our simulation studies show that video server architectures developed for movies on demand can be adapted to video library usage, though caching is less effective and the server can support a smaller user population for non-linear video applications. We also show that video walk-throughs require extremely large amounts of RAM buffering to provide adequate performance for even a small number of users.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008002/00080135.pdf", } @ARTICLE{Bai0002:Retrieval, AUTHOR="Ping Bai and Balakrishnan Prabhakaran and Aravind Srinivasan", TITLE="Retrieval scheduling for collaborative multimedia presentations", JOURNAL=mms, VOLUME=8, NUMBER=2, PAGES="146-155", YEAR=2000, KEYWORDS="Scalable and highly available web servers;Multimedia presentations;Multimedia information retrieval schedule;Buffer utilization and optimization", ABSTRACT="The single-system approach is no longer sufficient to handle the load on popular Internet servers, especially for those offering extensive multimedia content. Such services have to be replicated to enhance their availability, performance, and reliability. In a highly replicated and available environment, server selection is an important issue. In this paper, we propose an application-layer broker (ALB) for this purpose. ALB employs a content-based, client-centric approach to negotiate with the servers and to identify the best server for the requested objects. ALB aims to maximize client buffer utilization in order to efficiently handle dynamic user interactions such as skip, reverse presentation, go back in time. We also present details of a collaborative multimedia presentation platform that we have developed based on ALB.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008002/00080146.pdf", } @ARTICLE{Born0003:Ultimedia, AUTHOR="Alan Borning and Richard Kuang-Hsu Lin and Kim Marriott", TITLE="Multimedia authoring and presentation techniques: Constraint-based document layout for the Web", JOURNAL=mms, VOLUME=8, NUMBER=3, PAGES="177-189", YEAR=2000, ABSTRACT="Constraints can be used to specify declaratively the desired layout of a Web document. We present a system architecture in which both the author and the viewer can impose page layout constraints, some required and some preferential. The final appearance of the Web page is thus the result of negotiation between author and viewer, where this negotiation is carried out by solving the set of required and preferential constraints imposed by both parties. We identify two plausible system architectures, based on different ways of dividing the work of constraint solving between Web server and Web client. We describe a prototype constraint-based Web authoring system and viewing tool that provides linear arithmetic constraints for specifying the layout of the document as well as finite-domain constraints for specifying font size relationships. Finally, we provide an empirical evaluation of the prototype.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008003/00080177.pdf", } @ARTICLE{Rour0003:Multimedia, AUTHOR="David DeRoure and Steven G. Blackburn", TITLE="Multimedia authoring and presentation techniques: Content-based navigation of music using melodic pitch contours", JOURNAL=mms, VOLUME=8, NUMBER=3, PAGES="190-200", YEAR=2000, KEYWORDS="Content-based retrieval;Content-based navigation;Open hypermedia;Melodic pitch contours;Music", ABSTRACT="We describe a system which supports dynamic user interaction with multimedia information using content-based hypermedia navigation techniques, specialising in a technique for navigation of musical content. The model combines the principles of open hypermedia, whereby hypermedia link information is maintained by a link service, with content-based retrieval techniques in which a database is queried based on a feature of the multimedia content; our approach could be described as `content-based retrieval of hypermedia links'. The experimental system focuses on temporal media and consists of a set of component-based navigational hypermedia tools. We propose the use of melodic pitch contours in this context and we present techniques for storing and querying contours, together with experimental results. Techniques for integrating the contour database with open hypermedia systems are also discussed.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008003/00080190.pdf", } @ARTICLE{Chiu0003:Special, AUTHOR="Tzi-cker Chiueh and Tulika Mitra and Anindya Neogi and Chuan-Kai Yang", TITLE="Zodiac: A history-based interactive video authoring system", JOURNAL=mms, VOLUME=8, NUMBER=3, PAGES="201-211", YEAR=2000, KEYWORDS="Video editor;Shot/scene detection;Object tracking;Video annotation;Multimedia file system", ABSTRACT="Easy-to-use audio/video authoring tools play a crucial role in moving multimedia software from research curiosity to mainstream applications. However, research in multimedia authoring systems has rarely been documented in the literature. This paper describes the design and implementation of an interactive video authoring system called Zodiac, which employs an innovative edit history abstraction to support several unique editing features not found in existing commercial and research video editing systems. Zodiac provides users a conceptually clean and semantically powerful branching history model of edit operations to organize the authoring process, and to navigate among versions of authored documents. In addition, by analyzing the edit history, Zodiac is able to reliably detect a composed video stream's shot and scene boundaries, which facilitates interactive video browsing. Zodiac also features a video object annotation capability that allows users to associate annotations to moving objects in a video sequence. The annotations themselves could be text, image, audio, or video. Zodiac is built on top of MMFS, a file system specifically designed for interactive multimedia development environments, and implements an internal buffer manager that supports transparent lossless compression/decompression. Shot/scene detection, video object annotation, and buffer management all exploit the edit history information for performance optimization.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008003/00080201.pdf", } @ARTICLE{Adal0003:Multimedia, AUTHOR="S. Adali and M. L. Sapino and V. S. Subrahmanian", TITLE="An algebra for creating and querying multimedia presentations", JOURNAL=mms, VOLUME=8, NUMBER=3, PAGES="212-230", YEAR=2000, KEYWORDS="Multimedia databases;Multimedia presentations", ABSTRACT="Over the last few years, there has been a tremendous increase in the number of interactive multimedia presentations prepared by different individuals and organizations. In this paper, we present an algebra for creating and querying interactive multimedia presentation databases. This algebra operates on trees whose branches reflect different possible playouts of a set of presentations. The algebra not only extends all the classical relational operators to such databases, but also introduces a variety of novel operators for combining multiple presentations. As our algebra supports merging parts or all of existing presentations, this algebra can also be used as an authoring tool for creating multimedia presentations. We prove a host of equivalence results for queries in this algebra, which may be used to build query optimizers for interactive presentation databases.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008003/00080212.pdf", } @ARTICLE{Shua0003:Dejittering, AUTHOR="Khaled Shuaib and Tarek Saadawi and Myung Lee and Bert Basch", TITLE="Dejittering in the transport of {MPEG-2} and {MPEG-4} video", JOURNAL=mms, VOLUME=8, NUMBER=3, PAGES="231-239", YEAR=2000, KEYWORDS="Delay jitter;MPEG video;Asynchronous transfer mode (ATM);Video transmission;Multimedia", ABSTRACT="When multimedia information is transported over a packet-switched network, the quality of presentation can be degraded due to network delay variation or jitter. This paper presents a dejittering scheme that can be used in the transport of MPEG-4 and MPEG-2 video to absorb any introduced network jitter, thus preserving the presentation quality of transported media streams. The dejittering scheme is based on the statistical approximation of delay variation in the arrival times of video packets carrying encoded clock reference values and a filtering and re-stamping mechanism. In addition, a brief overview of the MPEG-4 system is presented.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008003/00080231.pdf", } @ARTICLE{Chim0003:MPEG, AUTHOR="Antonio Chimienti and Marco Conti and Enrico Gregori and Maurizio Lucenteforte and R. Picco", TITLE="{MPEG-2} sources: exploiting source scalability for an efficient bandwidth allocation", JOURNAL=mms, VOLUME=8, NUMBER=3, PAGES="240-255", YEAR=2000, ABSTRACT="The paper investigates efficient bandwidth allocation schemes for the transmission of MPEG-2 video traffic on high-speed networks. To this end we performed an extensive analysis of the traffic generated by an MPEG-2 encoder. Specifically, we encoded", } @ARTICLE{Mlle0002:Multimedia, AUTHOR="R. Müller and T. Ottmann", TITLE="Multimedia authoring and presentation techniques: The ``Authoring on the Fly'' system for automated recording and replay of (tele)presentations", JOURNAL=mms, VOLUME=8, NUMBER=2, PAGES="158-176", YEAR=2000, KEYWORDS="Multimedia authoring; electronic note-taking; real-time random access; stream synchronization; educational software", ABSTRACT="We discuss the problem of capturing media streams which occur during a live lecture in class or during a telepresentation. Instead of presenting yet another method or system for capturing the classroom experience, we introduce some informal guidelines and show their importance for such a system. We derive from these guidelines a formal framework for sets of data streams and an application model to handle these sets so that a real-time replay becomes possible. The Authoring on the Fly system is a possible realization of a framework which follows these guidelines. It allows the capture and real-time replay of data streams captured during a (tele)presentation, including audio, video, and whiteboard action streams. This article gives an overview of the different AoF system components for the various phases of the teaching and learning cycle. It comprises an integrated text and graphics editor for the preparation of pages to be loaded by the whiteboard during the presentation phase. The recording component of the system captures various data streams of the live presentation. They are postprocessed by the system so that they become instances of the class of media for whose replay the general application model was developed. From a global point of view, the Authoring on the Fly system allows one to merge three apparently distinct tasks;teaching in class, telepresentation, and multimedia authoring;into one single activity. The system has been used routinely for recording telepresentations over the MBone net and has already led to a large number of multimedia documents which have been integrated automatically into Web-based teaching and learning environments.", URL="http://www.link.springer.de/link/service/journals/00530/papers/0008003/00080158.pdf", } @TECHREPORT{McGa00:International, AUTHOR="Terrence P. McGarty and Lee McKnight", TITLE="International {IP} Telephony", INSTITUTION="Zephyr", YEAR=2000, KEYWORDS="VoIP; performance requirements; telephony", URL="http://www.zephyrtele.com/mit\_pres.asp", } @ARTICLE{Kiyo0001:SeamlessDesign, AUTHOR="Kiyoshi Kiyokawa and Haruo Takemura and Naokazu Yokoya", TITLE="SeamlessDesign for {3D} Object Creation", JOURNAL=ieeemm, VOLUME=7, NUMBER=1, MONTH="January--March", YEAR=2000, ABSTRACT="SeamlessDesign is a novel collaborative workspace for rapid creation of 3D objects with constraints. Its seamless design supports both shape and behavioral designs of 3D objects in a unified and intuitive manner. Virtual and augmented setups support both multiple perspectives for parallel activity and face-to-face interaction for rich awareness.", URL="http://www.computer.org/multimedia/mu2000/u1toc.htm", } @ARTICLE{Vale0001:Face, AUTHOR="Stéphane Valente and Jean-Luc Dugelay", TITLE="Face Tracking and Realistic Animations for Telecommunicant Clones", JOURNAL=ieeemm, VOLUME=7, NUMBER=1, MONTH="January--March", YEAR=2000, ABSTRACT="Using realistic face models and photometric modeling techniques, we present a visual feedback loop that tracks a face-without any marker or controlled lighting-throughout a video sequence and precisely recovers the face position and orientation. We also propose animation techniques to embed realistic expressions in our 3D clones. Such face models permit automatic construction of appearance models.", URL="http://www.computer.org/multimedia/mu2000/u1toc.htm", } @ARTICLE{Pach0001:Combinatorial, AUTHOR="François Pachet and Pierre Roy and Daniel Cazaly", TITLE="A Combinatorial Approach to Content-Based Music Selection", JOURNAL=ieeemm, VOLUME=7, NUMBER=1, MONTH="January--March", YEAR=2000, ABSTRACT="Accessing large digital music catalogues raises a problem for both users and content providers. We propose a novel approach to music selection called RecitalComposer, which is based on computing coherent sequences of music titles. This amounts to solving a combinatorial pattern generation problem by using constraint satisfaction techniques.", URL="http://www.computer.org/multimedia/mu2000/u1toc.htm", } @ARTICLE{Assf0001:Querying, AUTHOR="Jürgen Assfalg and Pietro Pala", TITLE="Querying by Photographs: A {VR} Metaphor for Image Retrieval", JOURNAL=ieeemm, VOLUME=7, NUMBER=1, MONTH="January--March", YEAR=2000, ABSTRACT="Interaction paradigms based on 3D interfaces and virtual reality offer new possibilities to overcome the limitations of query by example. We present a system that lets users navigate a 3D world where they can take photographs to query a database of images by content. Furthermore, users can interactively customize the virtual world by adding objects to the scene and editing object properties such as colors and textures.", URL="http://www.computer.org/multimedia/mu2000/u1toc.htm", } @ARTICLE{Chri0001:Interactive, AUTHOR="Michael G. Christel and Andreas M. Olligschlaeger and Chang Huang", TITLE="Interactive Maps for a Digital Video Library", JOURNAL=ieeemm, VOLUME=7, NUMBER=1, MONTH="January--March", YEAR=2000, ABSTRACT="To improve library access, the Informedia Digital Video Library uses automatic processing to derive descriptors for video. A new extension to the video processing extracts geographic references from these descriptors. The operational library interface shows the geographic entities addressed in a given story, highlighting the regions discussed in the video through a map display synchronized with the video playback. The map can also serve as a query mechanism, allowing users to search the terabyte library for stories taking place in a selected area of interest.", URL="http://www.computer.org/multimedia/mu2000/u1toc.htm", } @ARTICLE{Refs0004:Guest, AUTHOR="Scot Thrane Refsland and Takeo Ojika and Alonzo C. Addison and Robert Stone", TITLE="Guest Editors' Introduction: Virtual Heritage--Breathing New Life into Our Ancient Past", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="This special issue on virtual heritage features a survey on emerging trends in the field, articles on tools for building virtual heritage, applications of interpretive environments, and a look at what's next in virtual heritage.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Addi0004:Emerging, AUTHOR="Alonzo C. Addison", TITLE="Emerging Trends in Virtual Heritage", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="The author discusses trends such as the documentation, representation, and presentation and dissemination of virtual heritage environments.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Addi0004:Virtualized, AUTHOR="Alonzo C. Addison and Marco Gaiani", TITLE="Virtualized Architectural Heritage: New Tools and Techniques", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="New tools and techniques have emerged that combine the two kinds of data required for virtualized architectural environments-current, real-world conditions and virtual or theorized historical interpretations.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Zhen0004:Virtual, AUTHOR="Jiang Yu Zheng", TITLE="Virtual Recovery and Exhibition of Heritage", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, KEYWORDS="digitization; virtual recovery; computer vision; 3D range finder; graphics; virtual reality; machine interface; multimedia; virtual museum; internet; virtual heritage", ABSTRACT="The Museum of the Terra Cotta Warriors and Horses in China combines art and culture with computer technology to bring world heritage into cyberspace.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Barn0004:Image, AUTHOR="Mauro BARNI and Franco Bartolini and Vito Cappellini", TITLE="Image Processing for Virtual Restoration of Artworks", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="Researchers in the Department of Electronic Engineering at the University of Florence developed new tools for cultural heritage applications to preserve and restore paintings.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Li0004:Color, AUTHOR="Xiang-Yang Li and Dongming Lu and Yunhe Pan", TITLE="Color Restoration and Image Retrieval for Dunhuang Fresco Preservation", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="The authors discuss the color restoration and retrieval techniques they used for preserving the Dunhuang frescoes in Gansu, China.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Kana0004:Three, AUTHOR="Ichiroh Kanaya and Qian Chen and Yuko Kanemoto and Kunihiro Chihara", TITLE="Three-Dimensional Modeling for Virtual Relic Restoration", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="A new method of 3D modeling of a relic shard achieves sufficient accuracy and efficiency to preserve archaeological properties.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Plet0004:Virtual, AUTHOR="Daniel Pletinckx and Dirk Callebaut and Ann E. Killebrew and Neil A. Silberman", TITLE="Virtual-Reality Heritage Presentation at Ename", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="Ename uses several approaches to bring archaeological remains, standing monuments, and elements of the historical landscape to life through scientifically verifiable virtual reality reconstructions.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Enni0004:VRML, AUTHOR="Gareth Ennis and Malcolm Lindsay", TITLE="{VRML} Possibilities: The Evolution of the Glasgow Model", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="The authors discuss how the Glasgow Model-representing the city of Glasgow-from the mid-1980s evolved into the Internet-based Glasgow Directory, an application that lets users search for information about the city or participate in a virtual tour.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Hava0004:Three, AUTHOR="Nikhilesh Haval", TITLE="Three-Dimensional Documentation of Complex Heritage Structures", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="This article describes the advantages and development of methods for 3D documentation of the heritage structure Fatehpur Sikri, in India, for reference and archiving.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Ks0004:City, AUTHOR="JoséRipper Kós and Adriana Simeone Barbosa and Carlos Krykhtine and Erivelton Muniz da Silva and Rodrigo Cury Paraizo", TITLE="The City that Doesn't Exist: Multimedia Reconstruction of Latin American Cities", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="Based on historical 3D models of Havana, Cuba and Rio de Janeiro, Brazil, the authors collected and restored the urban structures of these cities in different historical periods to facilitate the understanding and analysis of the evolution of each city's identity.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Hira0004:Constructing, AUTHOR="Hidekazu Hirayu and Takeo Ojika and Ryugo Kijima", TITLE="Constructing the Historic Villages of Shirakawa-go in Virtual Reality", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="The authors examined the necessary procedures and techniques to digitize external views and cultural aspects of the heritage site Shirakawa-go in Gifu, Japan, by using virtual reality technology and reconstructed the site in 3D.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Refs0004:Living, AUTHOR="Scot Thrane Refsland and Takeo Ojika and Robert Berry", TITLE="The Living Virtual Kinka Kuji Temple: A Dynamic Environment", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="The authors used emergent properties and chaos found in live data streams to bring a ``living'' element (fireflies) into a model of the Golden Temple (Kinka Kuji) in Kyoto, Japan.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{DeLe0004:Bringing, AUTHOR="Victor DeLeon and Robert Berry", TITLE="Bringing {VR} to the Desktop: Are You Game?", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="The authors used 3D video-game engine technologies to generate high-resolution, real-time 3D imagery of photorealistic walk-throughs of the Florida Everglades and the Notre Dame Cathedral in Paris.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Ston0004:Virtual, AUTHOR="Robert Stone and Takeo Ojika", TITLE="Virtual Heritage: What Next?", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="This article takes a look at what's ahead in virtual heritage, including an increased interest in the use of virtual reality to record and recreate examples of industrial archaeology.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Pier0004:Interactive, AUTHOR="Laura Pierucci and Enrico Del Re", TITLE="An Interactive Multimedia Satellite Telemedicine Service", JOURNAL=ieeemm, VOLUME=7, NUMBER=2, MONTH="April--June", YEAR=2000, ABSTRACT="The authors present a telemedicine application that provides remote medical care services while taking advantage of the broadcast and multicast capabilities and the wide-band capacity of satellite systems.", URL="http://www.computer.org/multimedia/mu2000/u2toc.htm", } @ARTICLE{Sant0007:Integrated, AUTHOR="Simone Santini and Ramesh Jain", TITLE="Integrated Browsing and Querying for Image Databases", JOURNAL=ieeemm, VOLUME=7, NUMBER=3, MONTH="July-September", YEAR=2000, ABSTRACT="The image database system El Niño uses a new interaction model that aims to overcome the problem of the semantic gap where the meaning that the user has in mind for an image is at a higher semantic level than the features on which the database operates. To solve this problem, we replaced the usual query paradigm with a more active exploration process and developed an interface based on these premises.", URL="http://www.computer.org/multimedia/mu2000/u3toc.htm", } @ARTICLE{Schr0007:Using, AUTHOR="Sissel Guttormsen Schär and Helmut Krueger", TITLE="Using New Learning Technologies with Multimedia", JOURNAL=ieeemm, VOLUME=7, NUMBER=3, MONTH="July-September", YEAR=2000, ABSTRACT="The potential of computer-aided learning (CAL) rests in its ability to present information in different ways according to the characteristics of the learning material and the students' needs. We present five major factors for developing CAL tools-theories for learning, multimedia didactic, learning technologies, information modes in human-computer interaction, and user acceptance.", URL="http://www.computer.org/multimedia/mu2000/u3toc.htm", } @ARTICLE{Goos0007:Microcosm, AUTHOR="Stuart Goose and Wendy Hall and Siegfried Reich", TITLE="Microcosm {TNG:} A Framework", JOURNAL=ieeemm, VOLUME=7, NUMBER=3, MONTH="July-Septemberember", YEAR=2000, ABSTRACT="Increased amounts of information combined with the users' rising demands for advanced link services pose strong challenges to distributed hypermedia systems. Novel presentation facilities, nontextual digital media, personalization of content and structures, and many more techniques often require complex processing and thus imply new interaction styles. Microcosm TNG offers new mechanisms for desktop and Internet integration. It also promotes an innovative modular approach to authoring hypermedia resources.", URL="http://www.computer.org/multimedia/mu2000/u3toc.htm", } @ARTICLE{Srih0007:Show, AUTHOR="Rohini K. Srihari and Zhongfei Zhag", TITLE="Show\&Tell: A Semi-Automated Image Annotation System", JOURNAL=ieeemm, VOLUME=7, NUMBER=3, MONTH="July-September", YEAR=2000, ABSTRACT="A multimedia system for semi-automated image annotation, Show\&Tell combines advances in speech recognition, natural language processing, and image understanding. Show\&Tell differs from map annotation systems and has tremendous implications for situations where visual data must be coreferenced with text descriptions, such as medical image annotation and consumer photo annotation.", URL="http://www.computer.org/multimedia/mu2000/u3toc.htm", } @ARTICLE{Gonz0007:Disciplining, AUTHOR="Ruben Gonzalez", TITLE="Disciplining Multimedia", JOURNAL=ieeemm, VOLUME=7, NUMBER=3, MONTH="July-September", YEAR=2000, ABSTRACT="The word multimedia conjures up many emotions and responses--it often refers to anything that uses visual and acoustic data. As a result, some may brush multimedia off as just a marketing slogan. However, many universities have recently introduced degree courses in multimedia. This article attempts to define the scope and basis for a multimedia discipline.", URL="http://www.computer.org/multimedia/mu2000/u3toc.htm", } @ARTICLE{Gemm0010:Gaze, AUTHOR="Jim Gemmell and Kentaro Toyama and C. Lawrence Zitnick and Thomas Kang and Steven Seitz", TITLE="Gaze Awareness for {Videoconferencing:A} Software Approach", JOURNAL=ieeemm, VOLUME=7, NUMBER=4, MONTH="October--December", YEAR=2000, ABSTRACT="Previous attempts at bringing gaze awareness to desktop videoconferencing have relied on hardware solutions. Here, the authors describe their software approach, which tracks participants' head and eye movements using vision techniques, then uses this information to graphically place the head and eyes in a 3D environment.", URL="http://www.computer.org/multimedia/mu2000/u4toc.htm", } @ARTICLE{Taka0010:Hypermedia, AUTHOR="Kenji Takahashi and Eiji Yana", TITLE="A Hypermedia Environment for Global Collaboration", JOURNAL=ieeemm, VOLUME=7, NUMBER=4, MONTH="October--December", YEAR=2000, ABSTRACT="We developed a hypermedia environment for global collaboration by knowledge workers, which consists of InterPOD and TeamSmart. InterPOD creates a meeting ``room'' environment for participants to access and share multimedia information from various sources. The TeamSmart hypermedia tool supports collaboration on document production by globally dispersed teams.", URL="http://www.computer.org/multimedia/mu2000/u4toc.htm", } @ARTICLE{Chiu0010:Room, AUTHOR="Patrick Chiu and Ashutosh Kapuskar and Sarah Reitmeier and Lynn Wilcox", TITLE="Room with a Rear View: Meeting Capture in a Multimedia Conference Room", JOURNAL=ieeemm, VOLUME=7, NUMBER=4, MONTH="October--December", YEAR=2000, ABSTRACT="Using advances in audio and video technology, capturing meetings can be much more than recording slide presentations and videotaping speakers. The FX Palo Alto Laboratory combined note-taking software and behind-the-scenes network hardware to create an unobtrusive multimedia conference room capable of capturing a range of presentation styles.", URL="http://www.computer.org/multimedia/mu2000/u4toc.htm", } @ARTICLE{Li0010:Operation, AUTHOR="Du Li and Chengzheng Sun and Limin Zhou and Richard Muntz", TITLE="Operation Propagation in Real-Time Group Editors", JOURNAL=ieeemm, VOLUME=7, NUMBER=4, MONTH="October--December", YEAR=2000, ABSTRACT="Operation propagation refers to the mechanisms and policies used in group editors for the participants to notify each other of their individual editing activities. The timing and granularity of propagation depend on different requirements such as network bandwidth, session scale, computational power of involved sites, and preferences of each user. Here, we draw on some common design principles in two group editors we have implemented.", URL="http://www.computer.org/multimedia/mu2000/u4toc.htm", } @ARTICLE{Ludw0010:VEC, AUTHOR="Heiko Ludwig and Keith Whittingham", TITLE="{VEC:} Gateways for Cross-Organizational Document Flow", JOURNAL=ieeemm, VOLUME=7, NUMBER=4, MONTH="October--December", YEAR=2000, ABSTRACT="To ensure the interconnection of business processes, outsourcing services require a rich flow of information between the service-providing and service-requesting organizations. Using the Virtual Enterprise Coordinator (VEC) and the Internet, organizations can outsource projects to external partners in a controlled way, while retaining the freedom to change the internal process definitions and document structures.", URL="http://www.computer.org/multimedia/mu2000/u4toc.htm", } @ARTICLE{Rose0002:Signaling, AUTHOR="Robert D. Rosenberry and Deepinder Sidhu", TITLE="Signaling network architectures in {B-ISDN} environments", JOURNAL=jhsn, VOLUME=9, NUMBER=2, PAGES="57-66", YEAR=2000, ABSTRACT="Telecommunications networks are evolving from rigid, hierarchical time division multiplexed networks into Broadband-ISDN networks based upon Asynchronous Transfer Mode infrastructures. As the transport networks change, the signaling network architectures must also progress. Currently, signaling network architectures are optimized for operation over point-to-point circuit switched networks. In this paper, we examine the current hierarchical signaling network architecture and propose two alternatives for use in B-ISDN environments---a flat model and a hybrid model combining features from the other two models. Analysis of the network architectures is performed using a discrete event simulator for ATM networks with additional components modeling the operation of telecommunications networks.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Kida0002:Dynamic, AUTHOR="Jayakrishna Kidambi and Dipak Ghosal and Biswanath Mukherjee", TITLE="Dynamic token bucket {(DTB):} a fair bandwidth allocation algorithm for high-speed networks", JOURNAL=jhsn, VOLUME=9, NUMBER=2, PAGES="67-87", YEAR=2000, ABSTRACT="Fair allocation of available bandwidth to competing flows is a simple form of quality of service(QoS)that can be provided to customers in public networks. A number of packet-scheduling and buffer-management techniques have been proposed in the literature to achieve this goal efficiently. However, the complexity of the existing algorithms prevents a high-speed implementation with the current state of router technology. We propose a computationally simpler mechanism based on token-bucket policing to achieve almost equal bandwidth allocation for a set of competing flows. The proposed method adjusts the token-bucket threshold dynamically and measures the instantaneous arrival rate of flows. It uses this information to decide whether or not to admit a packet arriving at the network edge. With minor modifications, our framework can be used in a variety of practical network environments ranging from the Internet to virtual private networks(VPNs)over Frame Relay. We present a detailed simulation study that evaluates the performance of our algorithm. The simulation results indicate that DTB is fair, efficient, and robust.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Bisw0002:Call, AUTHOR="Subir Biswas and Bhaskar Sengupta", TITLE="Call admissibility for multirate traffic in wireless {ATM} networks", JOURNAL=jhsn, VOLUME=9, NUMBER=2, PAGES="89-99", YEAR=2000, ABSTRACT="For multirate wireless ATM traffic, the first part of the call admission process is to determine whether to admit calls as long as bandwidth is available or to deny admission to a call of a particular class even if there is enough bandwidth available, in the hope of admitting calls of some other class later. A second part of the process is to determine if the quality of service requested by the call can be met. A scenario in which the first part is particularly important is when the blocking probability requirements for different classes is different. In this paper, we consider four policies to determine the circumstances under which calls of different types are admissible. For each of these policies, we show how to compute the blocking probabilities. For three of these policies, the blocking probabilities can be found by using results from product form networks. For the fourth, we provide an approximation which works extremely well in practice. We also formulate a non-linear programming problem which attempts to determine the parameters of the admissibility policies in such a way to maximize the call arrival rates while keeping the blocking probabilities under specified bounds. We provide an algorithm for solving the non-linear programming problem and use this as a basis for comparing the policies. We show that under some circumstances, it is possible to improve the system throughput by as much as 35\% by a suitable use of the admissibility policies. This improvement in throughput is particularly important in wireless ATM networks, supporting high rate multimedia traffic because of the inherent limitations in bandwidth availability.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Goud0002:Alert, AUTHOR="Mohamed Gouda and Tommy M. McGuire", TITLE="Alert communication primitives above {TCP}", JOURNAL=jhsn, VOLUME=9, NUMBER=2, PAGES="139-150", YEAR=2000, KEYWORDS="Distributed applications; fault tolerance; Internet; interprocess communication; reliability; Transmission Control Protocol", ABSTRACT="We consider communication primitives that can be executed by an application process to exchange messages with another application process over a TCP/IP network. A communication primitive is called alert iff it satisfies two conditions. First, if during any execution of the primitive no failure occurs, then the execution completes successfully. Second, if during any execution of the primitive some failure occurs, then the execution is aborted and the process that initiated the execution is informed of the failure. Clearly alert communication primitives are useful in designing reliable distributed applications. We argue that the send primitive over TCP is alert, but the receive primitive over TCP is not. Then, we propose three new receive primitives over TCP and show that each of them is alert. We also discuss how to implement these three primitives and compare their performance.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Gior0002:Class, AUTHOR="Silvia Giordano", TITLE="On a class of time varying shapers with application to the renegotiable variable bit rate service", JOURNAL=jhsn, VOLUME=9, NUMBER=2, PAGES="101-138", YEAR=2000, ABSTRACT="A shaper is a system that stores incoming bits in a buffer and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper is time invariant if the traffic constraint is defined by a fixed arrival curve; it is time varying if the condition on the output is given by a time varying traffic contract. This occurs, for example, with renegotiable variable bit rate(RVBR)services. We focus on the class of time varying shapers called time varying leaky bucket shapers; such shapers are defined by a fixed numbers of leaky buckets, whose parameters(rate and bucket size)are changed at specific transition moments. We assume that the bucket levels are kept unchanged at those transition moments('no reset'assumption). Our main finding is an input-output characterisation for this class of time varying shapers. Then we apply it to the tradeoff in optimising the RVBR service, assuming that a perfect prediction of future traffic can be made. We provide two algorithms that solve the problem of finding, at any renegotiation, the parameters for a RVBR service, respectively when the knowledge of the input traffic is limited to the next interval(local optimisation problem)and when we dispose of the complete input traffic description(global optimisation problem). We compare, by means of simulation, the two resulting algorithms to study the validity of the local approach. We illustrate the impact of the'no-reset'assumption by analyzing on some examples the losses that occur when the source chooses the opposite approach, namely, the'reset'approach. Furthermore we simulate the RVBR service versus the renegotiable constant bit rate(RCBR)service and illustrate that the RVBR approach can provide substantial benefits. Finally, we discuss the impact of the size of the renegotiation interval on the efficiency of the RVBR service.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Brun0003:Management, AUTHOR="Marcus Brunner and Rolf Stadler", TITLE="Management in telecom environments that are based on active networks", JOURNAL=jhsn, VOLUME=9, NUMBER="3,4", PAGES="213-230", YEAR=2000, ABSTRACT="The paper addresses the question how the benefits of active networking, such as customized packet processing in the data path and flexible service management, can be achieved in a telecom environment. More precisely, we ask: How can a network provider, whose infrastructure is based on active networking technology, support a large number of customers, all of which independently install, run, and manage their own active services in the provider's domain? We propose a framework that defines the interactions between customer and network provider for the purpose of service provisioning and service management. The key concept in this framework is a generic active service, called the Virtual Active Network(VAN)service, which is offered by the provider to its customers. The goal of the paper is to demonstrate that our framework can be realized in an active telecom environment with considerable benefits for both customers and providers. To prove this point, we discuss the realization of a VAN provisioning and management architecture on ANET, an active networking platform we have developed, and we show how a customer installs and manages active services on this platform.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Iraq0003:Resource, AUTHOR="and Raouf Boutaba", TITLE="Resource management issues in future wireless multimedia networks", JOURNAL=jhsn, VOLUME=9, NUMBER="3,4", PAGES="231-260", YEAR=2000, ABSTRACT="Broadband multimedia services and wireless services are becoming very popular. They are presently the two major drivers in the telecommunication industry. It is expected that wireless mobile users'demands for multimedia mobile services will rapidly increase in the future. The paper starts by presenting the evolution of wireless networks to support future integrated multimedia wireless personal services and highlight the need for efficient resource management. The limited resources in wireless systems, such as spectrum resource and transmitter power also stress the need for efficient resource management. Emphasis is given in the paper to the discussion of the channel allocation, mobility management, and bandwidth distribution problems. A review of some approaches proposed in the literature to solve these problems is presented. Finally, the paper discusses some of the key resource management issues that need to be addressed in the context of future wireless mobile networks that support multimedia communications while ensuring quality of service guarantees.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Kous0003:Hybrid, AUTHOR="Maan Kousa", TITLE="A hybrid {ARQ/FEC} scheme for noisy {ATM} network links", JOURNAL=jhsn, VOLUME=9, NUMBER="3,4", PAGES="261-272", YEAR=2000, ABSTRACT="ATM is accepted to be the transport technique for B-ISDN. ATM networks suffer from cell loss due to buffer overflow and/or corruption of the cell header because of channel errors. Originally, ATM networks were designed to work over fiber links that have extremely low bit error rates(BER). For noisy ATM links, such as wireless links, the probability of cell loss due to errors in the header increases significantly. Most applications require the lost cells to be retransmitted using some ARQ protocol, thus causing the system throughput to fall down. This paper proposes and analyzes a hybrid ARQ/FEC scheme for noisy ATM links. The proposed FEC code is a two-dimensional single-parity check(2D-SPC)code. This code is simple to encode and decode. A tight upper bound on the performance of the code is derived. For ARQ, a selective-repeat protocol with two retransmission strategies, all-cell retransmission and lost-cell retransmission, is implemented. Results of the analysis show that the proposed hybrid scheme with either retransmission strategies helps maintaining a high throughput efficiency at the range of bit error rates, which significantly benefits multimedia applications.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Li0003:Hierarchical, AUTHOR="Baochun Li and William Kalter and Klara Nahrstedt", TITLE="A hierarchical Quality of Service control architecture for configurable multimedia applications", JOURNAL=jhsn, VOLUME=9, NUMBER="3,4", PAGES="153-174", YEAR=2000, ABSTRACT="In order to achieve the best application-level Quality-of-Service (QoS), multimedia applications need to be dynamically tuned and reconfigured to adapt to fluctuating computing and communication environments. QoS-sensitive adaptations are critical when applications run in general\‐purpose systems, with no mechanisms provided for supporting resource reservations and real-time guarantees. Such adaptations are triggered by resource availability variations caused by best\‐effort resource allocations in unpredictable open environments. In this paper, we argue that adaptations are most effective to achieve a better QoS when performed within applications, where they may be optimized towards the best performance tradeoffs across various application parameters with different semantics. However, we believe that decisions about when and how adaptations should occur need to be coordinated, and formalized as a generic algorithm to be applied to a wide range of applications. For this purpose, we first identify an application model to focus on a set of application-specific tuning 'knobs' and critical parameters, then propose a polynomial-complexity QoS probing algorithm to quantitatively capture the run-time relationships between the two sets of parameters. Finally, we present a hierarchical adaptive QoS control architecture to bridge the gap between original 'triggers' of adaptation and actual tuning 'knobs' to be invoked. To prove the validity of our architecture and algorithms, we present Agilos, a middleware implementation of our hierarchical architecture. Under its control, we show that a configurable multimedia tracking application is able to deliver optimal performance even when operating in unpredictable open environments.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Sara0003:Supporting, AUTHOR="Kamil Saraç and Kevin Almeroth", TITLE="Supporting multicast deployment efforts: a survey of tools for multicast monitoring", JOURNAL=jhsn, VOLUME=9, NUMBER="3,4", PAGES="191-211", YEAR=2000, ABSTRACT="As the Internet is expected to better support multimedia applications, new services will need to be deployed. An example of one of these next-generation services is multicast communication, the one-to-many delivery of data. Over the last ten years, multicast research as well as deployment efforts have both been major areas of interest. In order to bridge the gap between the initial deployment experiments and the availability of multicast as a robust network service, there needs to be a full complement of multicast monitoring tools. In this paper we first survey the debugging, modeling, and management tools that have evolved along side the Internet's multicast infrastructure. Through this survey, we have observed important generalizations in three areas:(1)the challenges unique to monitoring multicast,(2)a methodology common to many multicast monitoring tools/systems, and(3)a set of considerations important to the development of new tools/systems. Using these generalizations we present two of our efforts to evaluate multicast reachability in the Internet. We also use these generalizations to evaluate some of the more recent efforts to develop large-scale management platforms.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Zhen0003:Interactive, AUTHOR="Bing Zheng and Mohammed Atiquzzaman", TITLE="Interactive video on demand over high speed networks", JOURNAL=jhsn, VOLUME=9, NUMBER="3,4", PAGES="175-190", YEAR=2000, LANGUAGE="English", ABSTRACT="Interactive Video on Demand with Instantaneous Access(IVoD-i)can offer users with VCR like functions by sending requests to video servers. Earlier work has shown that the Available Bit Rate Service of ATM networks can be effectively used for interactive video on demand. However, non optimal values of the connection setup parameters can affect the Quality of Service(QoS)at the user. This is because the ABR service only provides minimum bandwidth guarantee for a connection. The objective of this paper is to provide QoS to IVoD-i over the ABR service of ATM. To achieve this objective, we have developed an analytical framework to determine the ABR connection parameters to guarantee QoS to IVoD-i users. Our proposed framework has been tested with real life MPEG video traces. Results show that our framework can provide QoS to IVoD-i users. Moreover, our framework outperforms previous schemes in terms of startup delay, user buffer requirement, and jitter.", URL="http://www.cs.ou.edu/~atiq", } @ARTICLE{Fan0001:Connectivity, AUTHOR="Yifan Yu and Kyung Hwang and Michael Gill and H. Huang", TITLE="Some connectivity and security issues of {NGI} in medical imaging applications", JOURNAL=jhsn, VOLUME=9, NUMBER=1, PAGES="3-13", YEAR=2000, KEYWORDS="Internet; Internet2; Next Generation Internet(NGI); medical imaging; telemedicine; teleradiology; data security", ABSTRACT="The next generation internet(NGI)or Internet2 is an initiative for the integration of higher speed backbone communication networks as a means to replace the current inadequate Internet for many applications including medical imaging. This paper first reviews the current status of the Internet2 and reasons why telemedicine and teleradiology require its service. A case study is given using the private ATM OC-3 network at the Laboratory for Radiological Informatics, UCSF as an example for connecting a local site to the Internet2. Network security and data integrity are discussed in both the global and the local network level. Some preliminary results on Internet2 performance in the regional and the national level, as well as comparing with other WAN technologies are given.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Lo0001:Mammography, AUTHOR="Chien-Shun Lo and Ching-Wen Yang and Pau-Choo Chung and Yen-Chieh Ouyang and San-Kan Lee and Ping-Sung Liao", TITLE="A mammography tele-consultation pilot system in Taiwan", JOURNAL=jhsn, VOLUME=9, NUMBER=1, PAGES="31-46", YEAR=2000, ABSTRACT="A pilot system for a mammography tele-consultation in TaiChung Veterans General Hospital(TCVGH), Taiwan is proposed in this paper. It is developed and designed based on a distributed system and implemented in a top-down high speed network hierarchy with communication security. It is also integrated with specific diagnostic tools and collaboration awareness tools currently available in TCVGH and linked with the external internet, Taiwan Academic Network(TANet)that will be upgraded into the next generation, TANet2 in the next five years. The distributed system is designed using a JAVA-based remote method invoking system. It allows the transport of images through a firewall combined with peripheral applications that include a Digital Imaging and Communications in Medicine(DICOM)server for image transmission, Picture Archiving and Communication System(PACS), Hospital Information System(HIS)and computer-aided diagnostic systems via a Java native interface. The communication security is implemented using ElGamal's public-key cryptosystem for identifications of authorization. Finally the specific mammography diagnostic tools and collaboration awareness tools demonstrated in the proposed system are developed in accordance with the Breast Imaging Reporting And Data System(BI-RADS)suggested by the American College of Radiology.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Lee0001:Telemedicine, AUTHOR="Sang-goo Lee and Seong K. Mun and Prakash Jha and Betty A. Levine and Duk-Woo Ro", TITLE="Telemedicine: challenges and opportunities", JOURNAL=jhsn, VOLUME=9, NUMBER=1, PAGES="15-30", YEAR=2000, ABSTRACT="Telemedicine is many things to many people. Only until a few years ago, telemedicine was equated to video teleconferencing between physicians, while nowadays, perhaps the most active area in telemedicine is the store-and-forward model. There is a big shift from private and dedicated modes of communications to connectivity through the Internet. Presented is a collection of applications that provide snapshots of this diversity. The key technical challenges identified from these experiences are connectivity and integration. Also, at issue are the evolution process through which a telemedicine application evolves and the ability to choose the right set of technology for the diverse type of telemedicine applications. With the projected improvements in speed and quality of the Internet, wireless communication, and personal computational devices, it is expected that various concepts of telemedicine will develop into standard practices in tomorrow's health care.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Xiao0001:Real, AUTHOR="Yan Xiao and David Gagliano and Marian LaMonte and Peter Hu and Wade Gaasch and Ruwani Gunawadane and Colin Mackenzie", TITLE="Design and evaluation of a real-time mobile telemedicine system for ambulance transport", JOURNAL=jhsn, VOLUME=9, NUMBER=1, PAGES="47-56", YEAR=2000, ABSTRACT="A mobile telemedicine system was designed, implemented, and tested for real-time diagnosis during ambulance transport. The system uses multiple public wireless cellular phones to transmit video and patient biosignals from a moving ambulance to a hospital and delivers to the desktop computer of the receiving physician. The mobile unit on the ambulance is turn-key operated and has an image selection controller for paramedics to send images at specific times and to capture images at high frame rates. The mobile telemedicine system was installed on two ambulances and was successfully used in diagnosing acute ischemic stroke during the transport of six patients. Using the system, stroke specialists were able to remotely conduct neurological examinations which required evaluation of facial expressions and movement of arms and legs. Questionnaires completed by four users(two paramedics and two stroke specialists)of the mobile telemedicine system indicated that(1)the system did not intrude into the privacy of the patient or the paramedics,(2)it was easy to use,(3)it was adequate for conducting clinical examinations, and(4)it conveyed critical clinical information.", URL="http://www.iospress.nl/site/html/09266801.html", } @ARTICLE{Here0007:Introduction, AUTHOR="M. Hereld and I. Judson and Rick Stevens", TITLE="Introduction to Building Projection-based Tiled Display Systems", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=20, NUMBER=4, PAGES="22-28", MONTH="July/August", YEAR=2000, } @ARTICLE{Li0007:Building, AUTHOR="Keqin Li and Huamin Chen and Yu-Jen Chen and D. D. Clark and Peter Cook and S. Damianakis and G. Essl and A. Finkelstein", TITLE="Building and Using a Scalable Display Wall System", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=20, NUMBER=4, PAGES="29-37", MONTH="July/August", YEAR=2000, } @ARTICLE{Schi0007:High, AUTHOR="D. Schikore and Robert F.H. Fischer and R. Frank and R. Gaunt and J. Hobson and B. Whitlock", TITLE="High-Resolution Multiprojector Display Walls", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=20, NUMBER=4, PAGES="38-44", MONTH="July/August", YEAR=2000, } @ARTICLE{Frie0007:Remote, AUTHOR="J. Friesen and Thomas D. Tarman", TITLE="Remote High-Performance Visualization and Collaboration", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=20, NUMBER=4, PAGES="45-49", MONTH="July/August", YEAR=2000, } @ARTICLE{Wei0007:Visualization, AUTHOR="B. Wei and C. Silva and Eleftherios Koutsofios and Santosh Krishnan and Stephen C. North", TITLE="Visualization Research with Large Displays", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=20, NUMBER=4, PAGES="50-54", MONTH="July/August", YEAR=2000, } @ARTICLE{Bish0007:Working, AUTHOR="G. Bishop and G. Welch", TITLE="Working in the Office of ``Real Soon Now''", JOURNAL="IEEE Computer Graphics and Applications", VOLUME=20, NUMBER=4, PAGES="76-78", MONTH="July/August", YEAR=2000, } @ARTICLE{Reed0012:Constraint, AUTHOR="Michael K. Reed and Peter K. Allen", TITLE="Constraint Based Sensor Planning", JOURNAL=ieeepami, VOLUME=22, NUMBER=12, PAGES="1460-1467", YEAR=2000, } @INPROCEEDINGS{Rao00:Making, AUTHOR="Jun Rao and Kenneth A. Ross", TITLE="Making B$^+$-Trees Cache Conscious in Main Memory", BOOKTITLE=sigmod, PAGES="475-486", YEAR=2000, } @INPROCEEDINGS{Ross00:Serving, AUTHOR="Keith W. Ross and K. A. Zaman", TITLE="Serving Datacube Tuples from Main Memory", BOOKTITLE="12th International Conference on Scientific and Statistical Database Management", PAGES="182-195", YEAR=2000, } @INPROCEEDINGS{Ross00:Optimizing, AUTHOR="Keith W. Ross and K. A. Zaman", TITLE="Optimizing Selections over Datacubes", BOOKTITLE="12th International Conference on Scientific and Statistical Database Management", PAGES="139-152", YEAR=2000, } @INPROCEEDINGS{Naya00:360, AUTHOR="Shree K. Nayar and A. Karmarkar", TITLE="360 x 360 Mosaics", BOOKTITLE="IEEE Conference on Computer Vision and Pattern Recognition", YEAR=2000, } @INPROCEEDINGS{Naya00:High, AUTHOR="Shree K. Nayar and T. Mitsunaga", TITLE="High Dynamic Range Imaging", BOOKTITLE="IEEE Conference on Computer Vision and Pattern Recognition", YEAR=2000, } @TECHREPORT{Bras00:Enhancing, AUTHOR="Jack Brassil and Henning Schulzrinne", TITLE="Enhancing {Internet} Streaming Media with Cueing Protocols", TYPE="Technical Report", INSTITUTION="HP Labs", NUMBER="HPL-2000-173", YEAR=2000, KEYWORDS="Real-Time Transport Protocol; multimedia signaling; content delivery networks", ABSTRACT="We propose a new, media-independent protocol for including program timing, structure and identity information in internet media streams. The protocol uses signaling messages called cues to indicate events whose timing is significant to receivers, such as the start or stop time of a media program. We describe the implementation and operation of a prototype internet radio station which transmits program cues in audio broadcasts using the Real-Time Transport Protocol. A collection of simple yet powerful stream processing applications we implemented demonstrate how application creation is greatly eased when media streams are enriched with program cues.", URL="http://www.hpl.hp.com/techreports/2000/HPL-2000-173.html", } @INPROCEEDINGS{Rode00:Talking, AUTHOR="Roy Rodenstein and Judith S. Donath", TITLE="Talking In Circles: A Spatially-Grounded Multimodal Chat Environment", BOOKTITLE="CHI", YEAR=2000, KEYWORDS="Computer-mediated communication; chat; multimodal interaction; audioconferencing; multicast; social navigation; drawing; affective communication", ABSTRACT="This paper presents Talking in Circles, a multimodal chat environment which emphasizes spatial grounding to support natural group interaction behaviors. Participants communicate primarily by speech and are represented as colored circles in a two-dimensional space. Behaviors such as subgroup conversations and social navigation are supported through circle mobility as mediated by the environment and the crowd and distance-based spatialization of the audio. The circles serve as platforms for the display of presence and activity: graphics are synchronized to participants’ speech to aid in speech-source identification and participants can sketch in their circle, allowing a pictorial and gestural channel to complement the audio. The system is implemented using the internet’s multicast backbone. We note design challenges inherent in creating a rich environment for computer-mediated communication, including network infrastructure and human perceptual issues, and how we have approached them as our system has evolved.", URL="http://smg.media.mit.edu/papers/Rodenstein/TIC\_CHI2000/", } @BOOK{Bell00:Digital, AUTHOR="John Bellamy", TITLE="Digital Telephony", EDITION="3rd", PUBLISHER="John Wiley \\\\\& Sons, Inc.", ADDRESS="New York", YEAR=2000, LANGUAGE="English", } @INPROCEEDINGS{Jeba00:Tracking, AUTHOR="Tony Jebara and Yuri Ivanov and Ali Rahimi and Alex Pentland", TITLE="Tracking Conversational Context for Machine Mediation of Human Discourse", BOOKTITLE="AAAI Fall 2000 Symposium", ORGANIZATION="AAAI", NOTE="Socially Intelligent Agents", YEAR=2000, LANGUAGE="English", KEYWORDS="Socially Intelligent Agents", } @INPROCEEDINGS{Fran00:Jabberwocky, AUTHOR="D J Franklin and S. Bradshaw and K. Hammond", TITLE="Jabberwocky: You don''t have to be a rocket scientist to change slides for a hydrogen combustion lecture", BOOKTITLE="Intelligent User Interfaces", YEAR=2000, LANGUAGE="English", } @ARTICLE{Niga00:Text, AUTHOR="Kamal Nigam and Andrew McCallum and Sebastian Thrun and Tom Mitchell", TITLE="Text Classification from Labeled and Unlabeled Documents using {EM}", JOURNAL="Machine Learning", VOLUME=39, NUMBER=2, PAGES="103-134", YEAR=2000, LANGUAGE="English", } @INPROCEEDINGS{Jeba00:Feature, AUTHOR="Tony Jebara and Tommi Jaakkola", TITLE="Feature Selection and Dualities in Maximum Entropy Discrimination", BOOKTITLE="Uncertainty in Artificial Intelligence", YEAR=2000, LANGUAGE="English", } @INPROCEEDINGS{Ilve00:Behavior, AUTHOR="Mika Ilvesmäki and Jouni Karvo", TITLE="On the Behavior of the Candidate Table of the Per-Flow Packet Count Flow Classifier", BOOKTITLE="8th IFIP Workshop on the Performance Modelling and Evaluation of ATM \& IP Networks", YEAR=2000, LANGUAGE="English", ABSTRACT="1. We study the behavior of the flow candidate table of the packet count flow classifier. Use of the packet count flow classifier has been suggested for several technical implementations of flow classification. The previous studies have concentrated e.g. on observing workload reduction of packet forwarding in an Internet router. We will observe the consequences of implementing a packet count classifier. To realize a packet count classifier, an additional candidate table is needed, where information on flow candidates is kept. More specifically, we will observe the temporal and distributional behavior of the flow candidate table size using actual traffic traces and point out the requirements for the actual implementation of the flow classifier. The results show that the size of the candidate table varies significantly depending on the network and classifier parameters. Also, the candidate table size changes constantly, and fast entry creation and deletion are needed.", } @INPROCEEDINGS{Bels00:Delivering, AUTHOR="Meletis A. Belsis and Nick Godwin and Leon Smalov", TITLE="{DELIVERING} {SECURE} {MANUFACTURING} {IT} {SYSTEMS} {WITHIN} {THE} {CORBA} {SECURITY} {FRAMEWORK}", BOOKTITLE="14th International Conference on Systems Engineering (ICSE)", YEAR=2000, LANGUAGE="English", REFERENCES=10, KEYWORDS="CORBA Security Model, Manufacturing IT Systems, Distributed Internet Applications", ABSTRACT="Computer technology has developed to help in the implementation of large- scale applications that can be distributed across different computer systems or even geographical locations. In the last decade a new distributed model has evolved to avoid many common problems. The CORBA model provides flexibility in update and maintenance. More recently the CORBA security specification has been added to the set of structures in the CORBA model. This specification provides a framework for the design of security systems for particular distributed applications. This paper provides a brief overview of the CORBA model and its security proposals. The paper shows how these proposals can be used as the basis of a design for a secure system. The description is illustrated by an example related to a general manufacturing supply chain. The conclusion is that the CORBA security proposal offers sound basis for design of security aspects of a distributed system and CORBA implementations can provide a direct route to realising these designs.", } @ARTICLE{Cao00:Distributed, AUTHOR="Guohong Cao", TITLE="Distributed Fault-Tolerant Channel Allocation for Cellular Networks", JOURNAL=ieeejsac, VOLUME=18, NUMBER=7, PAGES="1326-1337", YEAR=2000, LANGUAGE="English", ABSTRACT="A channel allocation algorithm includes a channel acquisition algorithm and a channel selection algorithm. Most of the previous work concentrates on the channel selection algorithm since early channel acquisition algorithms are centralized and rely on a {\em mobile switching center (MSC)} to accomplish channel acquisition. Recently, distributed channel acquisition algorithms have received considerable attention due to their high reliability and scalability. However, in these algorithms, a borrower needs to consult with its interference neighbors in order to borrow a channel. Thus, the borrower fails to borrow channels when it cannot communicate with any interference neighbor. In real-life networks, under heavy traffic load, a cell has a large probability to experience an intermittent network congestion or even a communication link failure. In existing distributed algorithms, since a cell has to consult with a large number of interference neighbors to borrow a channel, the failure rate will be much higher under heavy traffic load. Therefore, previous distributed channel allocation algorithms are not suitable for real-life networks. In this paper, we first propose a fault-tolerant channel acquisition algorithm which tolerates communication link failures and node (MH or MSS) failures. Then, we present a channel selection algorithm and integrate it into the distributed acquisition algorithm. Detailed simulation experiments are carried out in order to evaluate our proposed methodology. Simulation results show that our algorithm significantly reduces the failure rate under network congestion, communication link failures, and node failures compared to non-fault-tolerant channel allocation algorithms. Moreover, our algorithm has low message overhead compared to known distributed channel allocation algorithms, and outperforms them in terms of failure rate under uniform as well as non-uniform traffic distribution.", URL="http://www.cse.psu.edu/~gcao", } @INPROCEEDINGS{Cao00:Scalable, AUTHOR="Guohong Cao", TITLE="A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments", BOOKTITLE=mobicom, YEAR=2000, LANGUAGE="English", KEYWORDS="cache; invalidation; mobile networks", ABSTRACT="Caching frequently accessed data items on the client side is an effective technique to improve performance in a mobile environment. Classical cache invalidation strategies are not suitable for mobile environments due to the disconnection and mobility of the mobile clients. One attractive cache invalidation technique is based on invalidation reports (IRs). However, the IR-based cache invalidation solution has two major drawbacks, which have not been addressed in previous research. First, there is a long query latency associated with this solution since a client cannot answer the query until the next IR interval. Second, when the server updates a hot data item, all clients have to query the server and get the data from the server separately, which wastes a large amount of bandwidth. In this paper, we propose an IR-based cache invalidation algorithm which can significantly reduce the query latency and efficiently utilize the broadcast bandwidth. Detailed simulation experiments are carried out to evaluate the proposed methodology. Compared to previous IR-based schemes, our scheme can significantly improve the throughput and reduce the query latency, the number of uplink request, and the broadcast bandwidth requirements.", URL="http://www.cse.psu.edu/~gcao", } @MISC{grou00:CMU, AUTHOR="{CMU Sphinx group}", TITLE="{CMU} Sphinx open source speech recognition engines", NOTE="http://www.speech.cs.cmu.edu/sphinx/index.html", YEAR=2000, LANGUAGE="English", ABSTRACT="CMU Sphinx is a set of speech recognition development libraries and tools that can be linked in to speech-enable applications. The libraries and sample code can be used for both research and commercial purposes; for instance, Sphinx2 can be used as a telephone-based recognizer, which can be used in a dialog system. Sphinx3 is a slower, more accurate decoder.", URL="http://www.speech.cs.cmu.edu/sphinx/index.html", } @INPROCEEDINGS{Abr:globecom00, AUTHOR="Henrik Abrahamsson and Bengt Ahlgren", TITLE="Using Empirical Distributions to Characterize Web Client Traffic and to Generate Synthetic Traffic", BOOKTITLE="of IEEE Globecom: Global Internet", ADDRESS="San Francisco, USA", MONTH="NOV", YEAR=2000, ABSTRACT="We model a web client using empirical probability distributions for user clicks and transferred data sizes. By using a heuristic threshold value to distinguish user clicks in a packet trace we get a simple method for analyzing large packet traces in order to get information about user OFF times and amount of data transferred due to a user click. We derive the empirical probability distributions from the analysis of the packet trace. The heuristic is not perfect, but we believe it is good enough to produce a useful web client model. We use the empirical model to implement a web client traffic generator. The characteristics of the generated traffic is very close to the original packet trace, including self-similar properties.", URL="http://www.sics.se/~henrik/globecom00-web.ps", } @INPROCEEDINGS{Albe00:Using, AUTHOR="Lars Albertsson and Peter S. Magnusson", TITLE="Using Complete System Simulation for Temporal Debugging of General Purpose Operating Systems and Worklods", BOOKTITLE="of MASCOTS 2000", ORGANIZATION="IEEE Computer Society", PUBLISHER="IEEE Computer Society Press", MONTH="AUG", YEAR=2000, ABSTRACT="Digital convergence is precipitating the addition of soft real-time applications to mainstream desktop and server operating environments. Most traditional debuggers for mainstream systems lack a notion of temporal correctness, making them unsuitable for real-time system design and analysis. We propose leveraging complete system simulation to build a temporal debugger capable of analyzing mixed real-world workloads. Traditional real-time system debuggers based on simulation utilize slow, but accurate, simulators. Complete system simulators accept an approximate model of time in exchange for higher performance. The higher performance allows these simulators to analyze high-end commercial operating systems and applications. We describe a temporal debugger design based on complete system simulation and report on some early experiences in analyzing a simple workload. The tool offers a non-intrusive, predictable environment for debugging complex workloads with partial real-time constraints. The simulator foundation allows for interactive debugging of time-critical sequences while preserving a model of execution time flow.", URL="http://www.sics.se/~lalle/publications/debugger.pdf", } @INPROCEEDINGS{Albe00:Simulation, AUTHOR="Lars Albertsson and Peter S. Magnusson", TITLE="Simulation-Based Temporal Debugging of Linux", BOOKTITLE="Second Real-Time Linux Workshop", MONTH="DEC", YEAR=2000, ABSTRACT="We present a temporal debugger, capable of examining temporal behaviour of operating systems. The debugger is based on a simulator modelling an entire workstation at the instruction level. Unlike traditional debuggers, which need to interfere with program execution, a simulation-based debugger can operate without disturbing time flow of the simulated system. This allows non-intrusive and reproducible debugging of general-purpose operating systems, such as Linux. We demonstrate the utility of the temporal debugger by analysing two time sensitive parts of Linux, scheduling and interrupt handling. We show how our tool allows a user to identify and isolate temporally unsatisfactory behaviour, and examine short sequences in detail.", URL="http://www.sics.se/~lalle/publications/debugger\_rtlinux.pdf", } @TECHREPORT{Ande00:Capacity, AUTHOR="Anders Andersson", TITLE="Capacity Study of Statistical Multiplexing for {IP} Telephony", INSTITUTION="SICS -- Swedish Institute of Computer Science", NUMBER="T2000:03", MONTH="JAN", YEAR=2000, ABSTRACT="Transmitting telephone calls over the Internet causes problems not present in current telephone technology such as packet loss and delay due to queueing in routers. In this undergraduate thesis we study how a Markov modulated Poisson process is applied as an arrival process to a multiplexer and we study the performance in terms of loss probability. The input consists of the superposition of independent voice sources. The predictions of the model is compared with results obtained with simulations of the multiplexer made with a network simulator. The buffer occupancy distribution is also studied and we see how this distribution changes as the load increases.", URL="http://www.sics.se/cna/publications/aa-thesis-tr2000-03.ps", } @INPROCEEDINGS{Voi:eunice, AUTHOR="Thiemo Voigt and Renu Tewari and Ashish Mehra", TITLE="In-Kernel Mechanisms for Adaptive Control of Overloaded Web Servers", BOOKTITLE="Eunice European Summer School", ADDRESS="Twente, Holland", MONTH="SEP", YEAR=2000, ABSTRACT="In this paper we present a kernbased architecture that protects Internet servers against overload by controlling the amount and rate of work entering the system. Our basic control algorithm limits the incoming TCP SYN requests based on connection attributes. By dropping non-compliant connection requests, the server can provide continuous service to preferred clients even under overload. We present a second mechanism that reorders the listen queue of a server socket based on the priorities of the incoming connection requests. Our experiments show that both mechanisms enable service differentiation during overload. We describe an adaptive architecture that uses these mechanisms to dynamically protect web servers from overload.", URL="http://www.sics.se/~thiemo/eunice.ps", } @TECHREPORT{Ost:tcp-adhoc, AUTHOR="Mattias Östergren", TITLE="{TCP} Performance in Ad Hoc Networks", INSTITUTION="SICS -- Swedish Institute of Computer Science", NUMBER="T2000:14", NOTE="MSc thesis", MONTH="NOV", YEAR=2000, ABSTRACT="Ad hoc networks are mobile wireless networks which do not have any kind of fixed infrastructure. The routing layer in an ad hoc network ties the network together into a seamless entity and provide transparent services to higher layer protocols. This thesis examines the interactions of two routing protocols, AODV and DSR and how the mobile ad hoc network environment affect TCP performance. The results presented here are as follows: the path length and the presence of competing traÆc are the main factors of TCP throughput performance. The size of TCP window affects the loss rate, but the loss rate is not strongly correlated to throughput performance. Using TCP selective acknowledgment option does not improve throughput. Finally, there is hardly any difference in TCP throughput when using DSR and AODV. These conclusions are supported by extensive simulation experiments.", URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--2000-14--SE.ps.Z", } @INPROCEEDINGS{Cam00:Reduced, AUTHOR="John Lusth Cam and Jeff Matocha", TITLE="Reduced Cell Switching in a Mobile Computing Environment", BOOKTITLE="Sixth Annual International Conference on Mobile Computing and Networking, MOBICOM 2000", PAGES="143-154", YEAR=2000, } @INPROCEEDINGS{Snoe00:End, AUTHOR="Alex C. Snoeren and Hari Balakrishnan", TITLE="An End-to-End Approach to Host Mobility", BOOKTITLE="Sixth Annual International Conference on Mobile Computing and Networking, MOBICOM 2000", PAGES="155-166", YEAR=2000, } @INPROCEEDINGS{Inze00:SIMPLE, AUTHOR="Tiziano Inzerilli", TITLE="{SIMPLE,} a Scalable Intra-domain Mobility Protocol using Local Encapsulation for Mobile {IPv6} and Mobile {IP}", BOOKTITLE="IST Mobile Summit", ADDRESS="Galway, Ireland", YEAR=2000, } @INPROCEEDINGS{Rich00:Mobile, AUTHOR="C.-J. Richard and Chang-Joi Chung", TITLE="A Mobile Multicast Protocol with Error Control for {IP} Networks", BOOKTITLE="IEEE Global Telecommunications Conference, GLOBECOM '00", VOLUME=3, PAGES="1687-1691", YEAR=2000, } @INPROCEEDINGS{Liao00:Reliable, AUTHOR="Wanjiun Liao and Chien-An Ke and Jiunn-Ru Lai", TITLE="Reliable Multicast with Host Mobility", BOOKTITLE="IEEE Global Telecommunications Conference, GLOBECOM '00", VOLUME=3, PAGES="1692-1696", YEAR=2000, } @INPROCEEDINGS{Lin00:Mobile, AUTHOR="Chun-Hung Richard Lin and Chang-Jai Chung", TITLE="Mobile Reliable Multicast Support in {IP} Networks", BOOKTITLE="2000 IEEE International Conference on Communications, ICC 200", VOLUME=3, PAGES="1421-1425", YEAR=2000, } @INPROCEEDINGS{Ke00:Reliable, AUTHOR="Chien-An Ke and Wanjiun Liao", TITLE="Reliable Mobile Multicast Protocol {[RMMP]:} a Reliable Multicast Protocol for Mobile {IP} Networks", BOOKTITLE="2000 IEEE Wireless Communications and Networking Conference, WCNC 2000", VOLUME=3, PAGES="1488-1491", YEAR=2000, } @TECHREPORT{Cors00:Approach, AUTHOR="M. Scott Corson and Alan William O'Neill", TITLE="An Approach to Fixed/Mobile Converged Routing", TYPE="Technical Report", INSTITUTION="Institute for Systems Research Technical Report", NUMBER="TR-2000-5", NOTE="{http://www.isr.umd.edu/TechReports/ISR/2000/TR\\_2000-5/TR\\_2000-5.phtml Accessed July 2001}", YEAR=2000, } @INPROCEEDINGS{Jabb00:Label, AUTHOR="Bijan Jabbari and Rajiv Papneja and Esmael Dinan", TITLE="Label Switched Packet Transfer for Wireless Cellular Networks", BOOKTITLE="IEEE Wireless Communications and Networking Conference", YEAR=2000, } @INPROCEEDINGS{Hart00:Seamless, AUTHOR="Hannes Hartenstein and Karl Jonas and R. Schmitz", TITLE="Seamless Inter-Domain Handoff via Simultaneous Bindings", BOOKTITLE="European Wireless 2000 together with 7th European Conference on Fixed Radio Systems and Networks ECRR 2000", ADDRESS="Dresden, Germany", MONTH="September 12-14", YEAR=2000, } @INPROCEEDINGS{Jons00:MIPMANET, AUTHOR="Ulf Jonsson and Fredrik Alriksson and Tony Larsson and Per Johansson and Maguire, Jr., Gerald Q.", TITLE="{MIPMANET} - Mobile {IP} for Mobile Ad Hoc Networks", BOOKTITLE="2000 First Annual Workshop on Mobile and and Ad Hoc Networking and Computing, MobiHoc", PAGES="75-85", YEAR=2000, } @INPROCEEDINGS{Hu00:Caching, AUTHOR="Yih-Chun Hu and David B. Johnson", TITLE="Caching Strategies in On-Demand Routing Protocols for Wireless Ad Hoc Networks", BOOKTITLE="Sixth Annual International Conference on Mobile Computing and Networking, MOBICOM 2000", ADDRESS="Boston, Massachusetts", YEAR=2000, } @ARTICLE{Pei00:Mobility, AUTHOR="Guangyu Pei and Mario Gerla", TITLE="Mobility Management for Hierarchical Wireless Networks", JOURNAL="ACM/Baltzer Mobile Networks and Applications", YEAR=2000, } @INPROCEEDINGS{Su00:Mobility, AUTHOR="Weilian Su and Sung Lee and Mario Gerla", TITLE="Mobility Prediction and Routing in Ad Hoc Wireless Networks", BOOKTITLE="International Journal of Network Management", EDITOR="Joe M. Wiley and Sons", YEAR=2000, } @ARTICLE{Lee00:Multicast, AUTHOR="Sung Lee and Weilian Su and Mario Gerla", TITLE="On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks", JOURNAL="ACM/Baltzer Mobile Networks and Applications", YEAR=2000, } @ARTICLE{Lee00:Wireless, AUTHOR="Sung Lee and Weilian Su and Mario Gerla", TITLE="Wireless Ad hoc Multicast Routing with Mobility Prediction", JOURNAL="ACM/Baltzer Mobile Networks and Applications", YEAR=2000, } @PHDTHESIS{Lee00:Routing, AUTHOR="Sung-Ju Lee", TITLE="Routing and Multicasting Strategies in Wireless Mobile Ad Hoc Networks", SCHOOL="University of California Los Angeles", YEAR=2000, } @PHDTHESIS{Kwon00:Energy, AUTHOR="Taek Jin Kwon", TITLE="Energy Efficient Clustering in Ad Hoc Networks", SCHOOL="University of California Los Angeles", YEAR=2000, } @PHDTHESIS{Pei00:Scalable, AUTHOR="Guangyu Pei", TITLE="Scalable Routing Strategies for Large Ad Hoc Wireless Networks", SCHOOL="University of California Los Angeles", YEAR=2000, } @PHDTHESIS{Su00:Motion, AUTHOR="Weilian Su", TITLE="Motion Prediction in Mobile/Wireless Networks", SCHOOL="University of California Los Angeles", YEAR=2000, } @INPROCEEDINGS{Das00:Performance, AUTHOR="Sajal Das and Charles E. Perkins and Elizabeth M. Royer", TITLE="Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks", BOOKTITLE="IEEE Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2000", VOLUME=1, PAGES="3-12", YEAR=2000, } @INPROCEEDINGS{Chan00:Energy, AUTHOR="Jae-Hwan Chang and L. Tassiluas", TITLE="Energy Conserving Routing in Wireless Ad-Hoc Networks", BOOKTITLE="IEEE Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2000", VOLUME=1, PAGES="22-31", YEAR=2000, } @ARTICLE{Tan00:Mobicast, AUTHOR="Chen Lin Tan and Stephan Pink", TITLE="Mobicast: A Multicast Scheme for Wireless Networks", JOURNAL="Mobile Networks and Applications (MONET)", VOLUME=5, NUMBER=4, YEAR=2000, } @INPROCEEDINGS{Lin00:Mobile, AUTHOR="Chun-Hung Richard Lin and Kai-Min Wang", TITLE="Mobile Multicast Support in {IP} Networks", BOOKTITLE="IEEE Nineteenth Annual Joint conference of the IEEE Computer and Communications Societies", VOLUME=3, PAGES="1664-1672", YEAR=2000, } @INPROCEEDINGS{Wu00:Agent, AUTHOR="Jiang Wu and Gerald (Chip) Maguire", TITLE="Agent Based Seamless {IP} Multicast Receiver Handover", BOOKTITLE="IFIP Conference on Personal Wireless Communications, PWC'2000", YEAR=2000, } @INPROCEEDINGS{Ihar00:Mobile, AUTHOR="Takeshi Ihara and Hiroyuki Ohnishi and Y. Takagi", TITLE="Mobile {IP} Route Optimization Method for a Carrier-scale {IP} Network", BOOKTITLE="Sixth IEEE International Conference on Engineering of Complex Computer Systems", PAGES="120-121", YEAR=2000, } @INPROCEEDINGS{Toh00:ABAM, AUTHOR="Ck Toh and G. Guichal and Santithorn Bunchua", TITLE="{ABAM:} On-Demand Associativity-based Multicast Routing for Ad Hoc Mobile Networks", BOOKTITLE="52nd Vehicular Technology Conference, IEEE-VTS Fall VTC 2000", VOLUME=3, PAGES="987-993", YEAR=2000, } @ARTICLE{Brus00:Secure, AUTHOR="Danilo Bruschi and Emilia Rosti", TITLE="Secure Multicast in Wireless Networks of Mobile Hosts: Protocols and Issue", JOURNAL="ACM-Baltzer MONET Journal, special issue on Multipoint Communication in Wireless Mobile Networks", YEAR=2000, } @INPROCEEDINGS{Fors00:Increasing, AUTHOR="D. Forsberg and J. Malinen and J. Malinen and H. H. Kari", TITLE="Increasing Communication Availability with Signal-based Mobile Controlled Handoffs", BOOKTITLE="IP based Cellular Networks, IPCN 2000", ADDRESS="Paris, France", YEAR=2000, } @INPROCEEDINGS{Nika00:Designing, AUTHOR="Navid Nikaein and Shiyi Wu and Christian Bonnet and Houda Labiod", TITLE="Designing Routing Protocol for Mobile Ad Hoc Networks", BOOKTITLE="14th Conference of New Architectures for Communications, DNAC", ADDRESS="Paris, France", YEAR=2000, } @INPROCEEDINGS{Nika00:DDR, AUTHOR="Navid Nikaein and Houda Labiod and Christian Bonnet", TITLE="{DDR} - Distributed Dynamic Routing Algorithm for Mobile Ad Hoc Networks", BOOKTITLE="First Annual Workshop on Mobile Ad Hoce Networking and Computing, MobiHoc", ADDRESS="Boston, USA", YEAR=2000, } @INPROCEEDINGS{Mart00:Mitigating, AUTHOR="Sergio Marti and T.J. Giuli and Kevin Lai and Mary G. Baker", TITLE="Mitigating Routing Misbehavior in Mobile Ad Hoc Networks", BOOKTITLE="Sixth Annual Internatinal Conference on Mobile Computing and Networking, MOBICOM", YEAR=2000, } @TECHREPORT{Bole00:Efficient, AUTHOR="Jeff Boleng", TITLE="Efficient Network Layer Addressing for Mobile Ad Hoc Networks", TYPE="Technical Report", INSTITUTION="The Colorado School of Mines", NUMBER="MCS-00-09", YEAR=2000, } @INPROCEEDINGS{Brie00:Role, AUTHOR="Linda Briesemeister and Guenter Hommel", TITLE="Role-based Multicast in Highly Mobile but Sparsely Connected Ad Hoc Networks", BOOKTITLE="2000 ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc", YEAR=2000, } @ARTICLE{Liao00:Geogrid, AUTHOR="Wei-Kuo Liao and Yu-Chee Tseng and Kwok-tung Lo and Jang-Ping Sheu", TITLE="Geogrid: a Geocasting Protocol for Mobile Ad Hoc Networks based on Grid", JOURNAL="Journal of Internet Technology", VOLUME=1, PAGES="23-32", YEAR=2000, } @INBOOK{Perk00:Ad, AUTHOR="Charles E. Perkins and Elizabeth M. Royer", TITLE="Ad hoc Networking", EDITOR="Charles E. Perkins", CHAPTER="The Ad hoc On-Demand Distance Vector Protocol", PUBLISHER="Addison-Wesley", PAGES="173-219", YEAR=2000, } @ARTICLE{Maha00:Architecture, AUTHOR="Indu Mahadevan and Krishna M. Sivalingam", TITLE="Architecture and Experimental Results for Quality of Service in Mobile Networks Using {RSVP} and {CBQ}", JOURNAL=wln, VOLUME=6, NUMBER="x", PAGES="221-234", YEAR=2000, } @INPROCEEDINGS{Rama00:Techniques, AUTHOR="Ranga S. Ramanujan and Atiq Ahamad and J. Banney and R. Hagelstrom and K. Thruber", TITLE="Techniques for Intrusion-resistant Ad Hoc Routing Algorithms {(TIARA)}", BOOKTITLE="21st Century Military Communications Conference Proceedings, MILCOM 2000", VOLUME=2, PAGES="660-664", YEAR=2000, } @INPROCEEDINGS{Venk00:Authentication, AUTHOR="Lakshmi Venkatraman and Dakshi Agrawal", TITLE="Authentication in Ad Hoc Networks", BOOKTITLE="2nd IEEE Wireless Communications and Networking Conference", YEAR=2000, } @INPROCEEDINGS{Nika00:Authentication, AUTHOR="Pekka Nikander", TITLE="Authentication, Authorization, and Accounting in Ad Hoc Networks", BOOKTITLE="Helsinki University of Technology Seminar on Internetworking", YEAR=2000, } @INCOLLECTION{Elli00:Optical, AUTHOR="Georgios Ellinas and Krishna Bala and Chansu Yu", TITLE="Optical {WDM} Networks: Principles and Practice", PUBLISHER="Kluwer Academic Publishers", YEAR=2000, LANGUAGE="English", } @TECHREPORT{Niem00:Authentication, AUTHOR="Aki Niemi", TITLE="Authentication of {SIP} calls", INSTITUTION="HUT (Helsinki University of Technology)", ADDRESS="Helsinki, Finland", NUMBER="Tik-110.501", NOTE="HUT TML 2000", YEAR=2000, LANGUAGE="English", REFERENCES=19, KEYWORDS="SIP; authentication; authorization", ABSTRACT="This paper discusses the security of SIP (Session Initiation Protocol), concentrating on the authentication of SIP calls. SIP is an application layer signalling protocol for creating, modifying, and terminating user sessions. These user sessions can be between two or more users, using multicast or a mesh of unicast sessions. SIP is used for Internet multimedia, conferencing, telephony, instant messaging and gaming. SIP security properties are drawn mostly from HTTP, but it also supports modern, strong public key cryptography. SIP authentication is used in two types of scenarios: access authentication and end-to-end authentication. End-to-end authentication can use Digest, Basic, PGP or other schemes, e.g., MIME PGP, which uses a multipart/signed message type. SIP can reuse most of the authentication schemes used in modern access authentication, e.g., RADIUS/DIAMETER backends. Also, it is possible to extend the protocol to use GPRS/USIM or other types of secret key authentication schemes.", URL="http://citeseer.nj.nec.com/401488.html", } @INPROCEEDINGS{Yene0003:Smart, AUTHOR="Bülent Yener", TITLE="Smart Box Architecture", BOOKTITLE="Special Workshop on Intelligence at the Network Edge", ADDRESS="San Francisco, California, USA", DAYS=20, MONTH="Mar", YEAR=2000, REFERENCES=27, ABSTRACT="Fuandametnally the IP-based networking is designed for delivering data traffic with best-effort service, thus it is not capable of providing end-to-end QoS. Several architectures have been proposed for providing QoS in the Internet: The integrated services (Intserv) model is based on reservations and can provide QoS, however; it is not scalable. The differentiated services (Diffserv) approach is scalable but falls short of ensuring deterministic guarantees - in particular for the services that belong to the same class. Finally, the multi protocol label switching (MPLS) architecture provides mechanisms for QoS-based routing but does not have the necessary resource management and scheduling support to ensure it. This work proposes a hybrid solution which combines the best of these technologies. First, at the network boundary Diffserv like Service Level Agreements (SLA) are provided to users by intelligent edge routers called the SBoX servers. An SBoX server uses Class Based Queuing (CBQ) with a hierarchy of flow aggregation. At the top a commodity-flow is defined for the aggregate flow between a pair of egress points. The packets of the same commodity-flow are marked by an MPLS label, which is globally unique within an Autonomous System (AS). Each commodity flow is partitioned to a set of macro-flows which are offered to users as SLAs. An SBoX server manges macro-flows and commodity flows only, and leaves the management of each macro-flow (at the micro-flow level based on some policies) to the enterprise/ users which signed the SLA. Second, the commodity-flows are managed and supported inside the network by an add-on Label Switching Router (LSR) called the SBoX router which performs MPLS of commodity-flows with CBQ. The main reason for an add on solution is the lack of end-to-end deployment of LSRs, and the vertically integrated architecture of the legacy routers. This paper explains the SBoX architecture and reports experimental results obtained on a prototype network", URL="http://www.usenix.org/publications/library/proceedings/ine2000/yener.html", } @INPROCEEDINGS{Jaeg0003:Integrating, AUTHOR="Robert Jaeger and Samrat Bhattacharjee and J. K. Hollingsworth and Rob Duncan and Tal Lavian and Franco Travostino", TITLE="Integrating Active Networking and Commerical-Grade Routing Platforms", BOOKTITLE="Special Workshop on Intelligence at the Network Edge", ADDRESS="San Francisco, California, USA", DAYS=20, MONTH="Mar", YEAR=2000, REFERENCES=18, ABSTRACT="Current network nodes enable connectivity between end- systems by supporting a static and well-defined set of protocols. The forwarding service provided by these network nodes is fixed, simple, and increasingly being implemented in hardware. Active network nodes, on the other hand, enable the unattended, dynamic instantiation of custom programs into the network node, allowing for the introduction of new protocols and services at runtime. Current prototype implementations of active network nodes achieve this flexibility by injecting a significant amount of software into the forwarding path. This paper describes an Active Network platform that is ideally suited for integration into modern, commercial-grade network nodes, such as router and switches with silicon-based forwarding paths. This Active Network platform supports the dynamic introduction of application services that can alter packet processing; it comprises the Oplet Runtime Environment (ORE) and the Java Forwarding (JFWD) API. The ORE is the substrate that provides for the secure downloading, installation, and safe execution of network services. The JFWD API is a uniform, plaform-independent portal through which software services can control the forwarding path of heterogeneous network nodes. We describe how existing active networking environments can be ported onto this Active Network platform and present performance results for dynamically loaded network services on the Accelar Gigabit Ethernet Routing Switch product.", URL="http://www.usenix.org/publications/library/proceedings/ine2000/jaeger.html", } @INPROCEEDINGS{Bore0003:RSIP, AUTHOR="Michael S. Borella and Gabriel Montenegro", TITLE="{RSIP:} Address Sharing with End-to-End Security", BOOKTITLE="Special Workshop on Intelligence at the Network Edge", ADDRESS="San Francisco, California, USA", DAYS=20, MONTH="Mar", YEAR=2000, REFERENCES=15, ABSTRACT="Realm Specific IP (RSIP) is a new architecture under consideration in the Internet Engineering Task Force (IETF) that can potentially alleviate some of the problems associated with partitioning of the Internet address space due to, for example, the shortage of IPv4 addresses. It is being positioned as a replacement for Network Address Translation (NAT), because, among other things, it can support end-to-end security via IPsec, which NAT cannot. This paper introduces the motivation behind RSIP, the RSIP architecture, and provides a basic overview of the RSIP protocol.", URL="http://www.usenix.org/publications/library/proceedings/ine2000/borella.html", } @INPROCEEDINGS{Orma0003:Platform, AUTHOR="Hilarie Orman", TITLE="Towards a Platform for Intelligent Activity at the Edge", BOOKTITLE="Special Workshop on Intelligence at the Network Edge", ADDRESS="San Francisco, California, USA", DAYS=20, MONTH="Mar", YEAR=2000, REFERENCES=10, ABSTRACT="Proxy caches for content on the Internet are high- performance platforms with complex software services. Because they understand application semantics, and because they have a great deal of memory, they are the natural place for new services that are tailored closely to site or user preferences and requirements. The engineering aspects of caches and how they contribute to a new network infrastructure for highly capable or intelligent services are examined in this paper.", URL="http://www.usenix.org/publications/library/proceedings/ine2000/orman.html", } @INPROCEEDINGS{Vice0003:QoS, AUTHOR="John Vicente", TITLE="{QoS} Provisioning at the Network Edge", BOOKTITLE="Special Workshop on Intelligence at the Network Edge", ADDRESS="San Francisco, California, USA", DAYS=20, MONTH="Mar", YEAR=2000, URL="http://www.usenix.org/publications/library/proceedings/ine2000/vicente\_slides.html/", } @INPROCEEDINGS{Orma0003:Active, AUTHOR="Hilarie Orman", TITLE="Active Networking Fast Path to {QoS}", BOOKTITLE="Special Workshop on Intelligence at the Network Edge", ADDRESS="San Francisco, California, USA", DAYS=20, MONTH="Mar", YEAR=2000, URL="http://www.usenix.org/publications/library/proceedings/ine2000/orman.p\_slides.html/", } @INPROCEEDINGS{Cher0003:TRIAD, AUTHOR="Dave Cheriton", TITLE="{TRIAD} and {Internet} Addressing at the Edge", BOOKTITLE="Special Workshop on Intelligence at the Network Edge", ADDRESS="San Francisco, California, USA", DAYS=20, MONTH="Mar", YEAR=2000, URL="http://www.usenix.org/publications/library/proceedings/ine2000/cheriton\_slides.html", } @INPROCEEDINGS{Deer0003:IPv6, AUTHOR="Steve Deering", TITLE="{IPv6} for the Network Edge", BOOKTITLE="Special Workshop on Intelligence at the Network Edge", ADDRESS="San Francisco, California, USA", DAYS=20, MONTH="Mar", YEAR=2000, URL="http://www.usenix.org/publications/library/proceedings/ine2000/deering\_slides.html", } @INPROCEEDINGS{Schu0003:Supernetworking, AUTHOR="Christoph Schuba", TITLE="Supernetworking: Virtual Address Resolution at the Edge", BOOKTITLE="Special Workshop on Intelligence at the Network Edge", ADDRESS="San Francisco, California, USA", DAYS=20, MONTH="Mar", YEAR=2000, URL="http://www.usenix.org/publications/library/proceedings/ine2000/schuba\_slides.pdf", } @INPROCEEDINGS{Ness0003:Open, AUTHOR="Dan M. Nessett", TITLE="Open Session on Intelligence at the Network Edge", BOOKTITLE="Special Workshop on Intelligence at the Network Edge", ADDRESS="San Francisco, California, USA", DAYS=20, MONTH="Mar", YEAR=2000, URL="http://www.usenix.org/publications/library/proceedings/ine2000/nessett\_slides.html", } @INPROCEEDINGS{Albe0002:Based, AUTHOR="Miguel Mira da Silva Alberto Rodrigues da Silva", TITLE="Based Agent Applications: User Interfaces and Mobile Agents", BOOKTITLE="Telecommunications and IT Convergence Towards Service E-volution, 7th International Conference on Intelligence in Services and Networks, IS\&N", INSTITUTION="University of Evora", ADDRESS="Athens, Greece", DAYS=23, MONTH="Feb", YEAR=2000, ABSTRACT="The process of developing agent-based applications requires at least tasks that are usually tackled separately by programmers. On one hand, rammers need to develop business rules and other support tasks for agents. the other hand, programmers need to develop user interfaces (UI) for agents order to enable end-users (not only owners but also other third parties) to interact directly with them. This paper focuses on this second task (developing 'user interfaces) and describes the solutions offered by the AgentSpace mobile agent system. Basically, we show and discuss two complementary ways to gather user-interfaces with mobile agents. On one hand, mobile agents don't provide any LJIs. This situation promotes the separation of the UI and the backend (i.e., the agent) which allows flexibility and reuse. On the other hand, mobile agents provide by default UI components, which consequently promotes agents as better units of development and management. This situation can be very suitable in the context of dynamic and large-scale applications such as those found in electronic commerce domains. This paper also shows the relationship between the application of these mechanisms and the model-view- controller architecture used currently to build user interfaces in modem object- oriented frameworks. Finally, this paper presents some concrete examples with source code based on the AgentSpace system in order to validate and clarify the discussed mechanisms.", } @INPROCEEDINGS{Kurt0002:Multi, AUTHOR="Kurt Verschaeve and Bart Wydaeghe and Frans Westerhuis", TITLE="Multi-level Component Oriented Methodology for Service Creation", BOOKTITLE="Telecommunications and IT Convergence Towards Service E-volution, 7th International Conference on Intelligence in Services and Networks, IS\&N", INSTITUTION="Alcatel", DAYS=23, MONTH="Feb", YEAR=2000, ABSTRACT="This paper presents the COSEC methodology, a component oriented methodology for service creation. Important are the different abstraction levels, targeting a wide range of users, going from software engineers to high-end users, On a low level we create reusable developer components that groups consistent fragments of UML, SDL and Java. These developer components are composed and augmented with user-interface aspects, documentation and customization parameters to form a customer component. On a higher level, these customer components are customized and composed within a customer framework, yielding in an executable service. This combination turn-is an answer to the challenge of organizational and technological problems in the creation oftelecom services.", } @INPROCEEDINGS{Stev0002:XML, AUTHOR="Steven Vermeulen