@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 and Bart Bauwens and Frans Westerhuis", TITLE="{XML} and {CORBA,} Synergistic or Competitive?", 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="The extensible Markup Language (XML) is gaming a lot of attention in the Internet world and is adopted by major companies (IBM, Microsoft, Oracle). XML, the open-standards child of SGML, promises to provide platform- and language neutral data encapsulation and separates application logic from application data, Meanwhile, various object-oriented technologies and standards such as Java and CORBA have also progressed rapidly in the past few years. Java is being presented as the perfect partner for XML. Java supports ihe development of Web-aware, platform-neutral applications, and XML is a platfonn-neutral document description meta-language. But doesn't CORBA promise exactly Ihe same? This paper describes the XML and CORBA 'approaches', and the synergies and/or competition between these technologies, taking into account the 'philosophy' of each approach. Different criteria are identified where comparison is possible and relevant, such as: specification (e.g. expressive power), deployment (parsing, marshalling, scalability), and tools. XML is the next step in Web-protocols (after IP, HTML). It is concluded that XML can in conjunction with a multitude of other protocols provide the same functionality as CORBA, but will only replace CORBA in those cases where using CORBA is undesirable.", } @INPROCEEDINGS{Dion0002:Supporting, AUTHOR="Prof. George Pavlou Dionisis X. Adamopoulos'", TITLE="Supporting Advanced Multimedia Telecommunications Services Using the Distributed Component Object Model", BOOKTITLE="Telecommunications and IT Convergence Towards Service E-volution, 7th International Conference on Intelligence in Services and Networks, IS\&N", INSTITUTION="Centre for Communication Systems Research, University of Surrey, UK", DAYS=23, MONTH="Feb", YEAR=2000, ABSTRACT="The demand for a great variety of sophisticated telecommunications services with multimedia characteristics is increasing. This trend highlights the need for the efficient creation of distributed programs with multimedia data exchanges over distributed processing environments. Therefore, it is necessary to support the object-oriented development of distributed multimedia applications in a flexible manner. This paper recognises Microsoft's Distributed Component Object Model (DCOM) as a key potential technology in the area of service engineering and examines a structured approach to enhance it for the handling of continuous media streams through the design and implementation of a collection of suitable multimedia support services. The proposed approach focuses on the modelling of continuous media communications in DCOM and is validated through the design and implementation of a multimedia conferencing service.", } @INPROCEEDINGS{WCha0002:Mobile, AUTHOR="Ming-Feng Chang", TITLE="Towards Mobile Agent Based Provision of Voice over {IP} Services", BOOKTITLE="Telecommunications and IT Convergence Towards Service E-volution, 7th International Conference on Intelligence in Services and Networks, IS\&N", INSTITUTION="GMD FOKUS", DAYS=23, MONTH="Feb", YEAR=2000, ABSTRACT="Mobile Agent technology form'i today the basis for the realisation of many innovative and flexible telecommunication architectures. After its emerging application in telecommunications management, intelligent networking and mobile communications, the increasing adoption of internet technologies in the telco environment suggests a new promising application domain: Voice over IP environments. This paper presents a mobile agent based VoIP service provision architecture. This architecture is based on the integration of the Grasshopper agent platform, a slate of the art mobile agent platform which has been developed for the implementation of advanced telecommunication service environments, and an 1ETF based VoIP protocol suite, i.e., the Session Initiation Protocol (SIP) and related 1ETF protocols. The outlined architecture, in which most of the SIP entities are realised by mobile agents enables a more flexible and distributed realisation of VoIP services providing better load balancing, and particularly user mobility.", } @INPROCEEDINGS{Jaya0002:Agent, AUTHOR="Chandrasekaran V. Jaya Shankar P.", TITLE="An Agent Based Service Inter-working Architecture for the Virtual Home Environment", BOOKTITLE="Telecommunications and IT Convergence Towards Service E-volution, 7th International Conference on Intelligence in Services and Networks, IS\&N", INSTITUTION="Centre for Wireless Communications, Singapore", DAYS=23, MONTH="Feb", YEAR=2000, ABSTRACT="One of the major efforts for standardising of service capabilities rather than standardising the services in UMTS is to achieve service differentiation and system continuity. While pre-UMTS systems thrived on the ability to access services in a same manner when user roamed, these new deregulation efforts of services will pose some problems in provisioning of services across networks. The concept of the virtual home environment (VHE) addresses problems like this but does not rigidly specify how services can be deployed. This contribution will discuss how agent technology can be applied for designing a service provisioning architecture based on the VHE concept. More importantly, the paper will focus on the importance of service inter- working for supplementing service functionality and discuss how agent communication based on FIPA2 ACL standard can be used to overcome this issue. Finally, the paper will discuss the design and implementation of a middleware known as a common communication module (CCM) used by service components on the network and the mobile nodes to perform ACL communication.", } @INPROCEEDINGS{Finn0003:Personal, AUTHOR="Gregory G. Finn and Joe Touch", TITLE="The Personal Node {(PN)}", BOOKTITLE="Workshop on Embedded Systems", ADDRESS="Cambridge, Massachusetts, USA", DAYS=29, MONTH="Mar", YEAR=2000, REFERENCES=24, ABSTRACT="A Personal Node (PN) is a small, wallet-sized device that integrates people into the Internet. A PN incorporates wireless communication, limited user I/O, and local environmental telemetry to catalyze the coordination of other smart space (SS) and network devices for the user's benefit. By themselves SSs are not aware of the people in them and people are not aware of what is in a SS. The PN allows the SS to interact continuously with a person, and a person to interact continuously with the space, mediating the interaction with the help of other devices throughout the system. A PN is an individual's networking focal point. As the user roams about, a PN persistently maintains user presence on the internetwork. This represents the final and missing link in SSs, bringing the user in as a system resource and participant.", URL="http://www.usenix.org/publications/library/proceedings/es99/finn.html", } @INPROCEEDINGS{Arno0003:Discourse, AUTHOR="David B. Arnold and Bill Segall and Julian Boot and Andy Bond and Melfyn Lloyd and Simon Kaplan", TITLE="Discourse with Disposable Computers: How and Why You Will Talk to Your Tomatoes", BOOKTITLE="Workshop on Embedded Systems", ADDRESS="Cambridge, Massachusetts, USA", DAYS=29, MONTH="Mar", YEAR=2000, REFERENCES=36, ABSTRACT="Beyond ubiquitous computing, is the advent of disposable computing, occurring when the price of an embedded computer becomes insignificant compared to the cost of goods. Current software and network architectures and their associated programming paradigms will not scale to this new world. The necessity of catering for the constant change in number and type of devices of interest to a user, as well as their sheer quantity, dictates new approaches to construction of software systems based on more flexible models. We propose that distributed event notification forms a fundamental requirement for systems of this scale, and discuss the advantages of undirected communication over current interaction models. Our experience with Elvin, a prototype notification system motivates the discussion and serves as illustration of its possibilities.", URL="http://www.usenix.org/publications/library/proceedings/es99/arnold.html", } @INPROCEEDINGS{Akyo0003:Smart, AUTHOR="Bora Akyol and Matt Fredette and Alden Jackson and Rajesh Krishnan and David Mankins and Craig Partridge and Nicholas Shectman and Gregory D. Troxel", TITLE="Smart Office Spaces", BOOKTITLE="Workshop on Embedded Systems", ADDRESS="Cambridge, Massachusetts, USA", DAYS=29, MONTH="Mar", YEAR=2000, REFERENCES=7, ABSTRACT="Imagine a world in which every device has an embedded processor and a high-speed wireless link. Any two devices can talk to each other and you link devices together as needed to get your work done. Devices with embedded processors and wireless links are coming soon. This paper looks at some of the problems we have to overcome to make it possible to link devices together and get work done (rather than cause frustration).", URL="http://www.usenix.org/publications/library/proceedings/es99/akyol.html", } @INPROCEEDINGS{Mill0003:AirJava, AUTHOR="Kevin Mills", TITLE="AirJava: Networking for Smart Spaces", BOOKTITLE="Workshop on Embedded Systems", ADDRESS="Cambridge, Massachusetts, USA", DAYS=29, MONTH="Mar", YEAR=2000, REFERENCES=40, ABSTRACT="Increasingly people work and live on the move. To support this mobile lifestyle, especially as work becomes more intensely information- based, companies are producing various portable and embedded information devices. Concurrently, some interesting pico-cellular wireless technologies promise to outfit these portable and embedded devices with high bandwidth, localized, wireless communication capabilities that can also reach the globally wired Internet. An impressionist painting emerges of small, specialized devices roaming among islands of wireless connectivity within a global ocean of wired networks. Each wireless island becomes a", } @INPROCEEDINGS{Howa0003:Bringing, AUTHOR="Michael Howard and Christopher S. Sontag", TITLE="Bringing the {Internet} to All Electronic Devices", BOOKTITLE="Workshop on Embedded Systems", ADDRESS="Cambridge, Massachusetts, USA", DAYS=29, MONTH="Mar", YEAR=2000, ABSTRACT="In order to develop appropriate solutions for embedded device networking, we must understand the benefits offered to the end user of the device as well as the costs involved with delivering a solution. As proponents of networking technology, it is tempting to overestimate the perceived value of connectivity, while at the same time overlook the hidden costs in implementation. It is important to remember that companies adopting technology for embedded device networking are manufacturers who tend to be very conservative due to narrow margins and fierce competition. A prerequisite to wide adoption of this networking technology is a convincing case for a strong return on investment. Therefor, all optimism must temporarily be put aside for a critical cost/benefits analysis that will provide criteria for judging the suitability of proposed solutions. Since there are so many embedded applications, it is not surprising that quite a few applications are 'no-brainers' which require little deliberation as to value or implementation method. Administration of networking hardware, for example, is increasingly accomplished through Internet-based device interfaces. Internet standards and associated technologies provide a remarkable set of opportunities for enhancing the value of existing and new embedded products. These Internet technologies have been available to millions of large, 32- and 64-bit systems for some time. The key challenge we have undertaken is to establish a distributed device-networking platform that provides appropriate solutions for all embedded devices. Our goal is to make connectivity practical even for systems that do not have convenient networking already available and are severely constrained by economic pressures.", URL="http://www.usenix.org/publications/library/proceedings/es99/howard.html", } @INPROCEEDINGS{Chiu0003:RETHER, AUTHOR="Tzi-cker Chiueh", TITLE="{RETHER:} A Software-Only Real-Time Ethernet for {PLC} Networks", BOOKTITLE="Workshop on Embedded Systems", ADDRESS="Cambridge, Massachusetts, USA", DAYS=29, MONTH="Mar", YEAR=2000, REFERENCES=10, ABSTRACT="The networking technologies used in industrial automation are required to support real-time performance guarantees to ensure that sensor/command data reach target nodes within a delay bound. With the continuing popularity and thus the accompanied price drop of the Ethernet technology, replacing the typically closed and proprietary automation networks with Ethernet is emerging as a very attractive solution, because of the cost-effectiveness and its compatibility with the trend of moving industrial control systems to PC-based hardware. Due to its contention-based media access control protocol, Ethernet theoretically can not bound the network access delay without additional traffic control mechanisms. In this work, we present the design, implementation, and programming interface of a software-based traffic control protocol called RETHER , which turns off-the-shelf Ethernets into real-time networks without any hardware modifications. RETHER works both in a single-segment as well as a multi-segment environment. This paper reports the performance measurements and implementation experiences with the RETHER prototype, which has been fully operational for over 12 months.", URL="http://www.usenix.org/publications/library/proceedings/es99/chiueh.html", } @INPROCEEDINGS{Brun0003:Pebble, AUTHOR="John Bruno and José Carlos Brustoloni and Eran Gabber and Avi Silberschatz and Christopher Small", TITLE="Pebble: A Component-Based Operating System for Embedded Applications", BOOKTITLE="Workshop on Embedded Systems", ADDRESS="Cambridge, Massachusetts, USA", DAYS=29, MONTH="Mar", YEAR=2000, REFERENCES=12, ABSTRACT="Like desktop applications, complex embedded applications benefit from the support of an underlying operating system. However, the requirements of an embedded operating system differ considerably from those of a desktop operating system. The Pebble operating system provides two features that we see as critical for complex embedded applications: (1) safe extensibility, so that the system can be constructed from untrusted components and reconfigured while running, and (2) low interrupt latency, which ensures that the system can react quickly to external events. In this paper we discuss Pebble's architecture and the underlying technology used by Pebble, and include microbenchmark performance results that demonstrate that Pebble is a good platform for complex embedded applications.", URL="http://www.usenix.org/publications/library/proceedings/es99/bruno.html", } @INPROCEEDINGS{Ness0003:Massively, AUTHOR="Dan M. Nessett", TITLE="Massively Distributed Systems: Design Issues and Challenges", BOOKTITLE="Workshop on Embedded Systems", ADDRESS="Cambridge, Massachusetts, USA", DAYS=29, MONTH="Mar", YEAR=2000, REFERENCES=14, ABSTRACT="The forty year trend in the computing industry is away from centralized, high unit cost, low unit volume products toward distributed, low unit cost, high unit volume products. The next step in this process is the emergence of massively distributed systems. These systems will penetrate even more deeply into the fabric of society and become the information power grids of the 21st century. They will be ubiquitous. Most will operate outside the normal cognizance of the people they serve and most will be based on embedded systems that present non-traditional computing interfaces to their users. They will be engineered to operate as distributed utilities, much like the energy, water, transportation and media broadcast businesses do today. The first deployment of massively distributed systems is likely to occur as support structures for these industries. Massively distributed systems will differ from existing distributed systems in important ways. Such systems eventually will interconnect billions of nodes. This will necessitate changes in the way nodes interact with one another. One-to-many communications will be the norm, rather than one-to-one. The size of on-line application communities will necessitate the use of statistically correct rather than deterministic algorithms for resource accounting, fault detection and correction, and system management. These communities will coalesce and dissolve rapidly in order to host events that are of interest to groups formed specifically for this purpose. This will require new approaches to naming, routing, security and privacy, resource management and synchronization. Heterogeneity will be even more of a factor in the design, implementation and operation of massively distributed systems. This paper explores the nature and characteristics of massively distributed systems by proposing some examples and then using them to characterize nine major design issues. Seven of these are drawn from seminal work in the area of distributed systems. Two others are based on experience in distributed system design and implementation subsequent to that work.", URL="http://www.usenix.org/publications/library/proceedings/es99/nessett.html", } @INPROCEEDINGS{Lee0003:Learning, AUTHOR="Daniel Lee and H. Sebastian Seung", TITLE="Learning in Intelligent Embedded Systems", BOOKTITLE="Workshop on Embedded Systems", ADDRESS="Cambridge, Massachusetts, USA", DAYS=29, MONTH="Mar", YEAR=2000, REFERENCES=28, ABSTRACT="Information processing capabilities of embedded systems presently lack the robustness and rich complexity found in biological systems. Endowing artificial systems with the ability to adapt to changing conditions requires algorithms that can rapidly learn from examples. We demonstrate the application of one such learning algorithm on an inexpensive robot constructed to perform simple sensorimotor tasks. The robot learns to track a particular object by discovering the salient visual and auditory cues unique to that object. The system uses a convolutional neural network to combine color, luminance, motion, and auditory information. The weights of the networks are adjusted using feedback from a teacher to reflect the reliability of the various input channels in the surrounding environment. We also discuss how unsupervised learning can discover features in data without external interaction. An unsupervised algorithm based upon nonnegative matrix factorization is able to automatically learn the different parts of objects. Such a parts-based representation of data is crucial for robust object recognition.", URL="http://www.usenix.org/publications/library/proceedings/es99/lee.html", } @INPROCEEDINGS{Kang0003:Using, AUTHOR="Kari Kangas and Juha Röning", TITLE="Using Mobile Code Interfaces to Control Ubiquitous Embedded Systems", BOOKTITLE="Workshop on Embedded Systems", ADDRESS="Cambridge, Massachusetts, USA", DAYS=29, MONTH="Mar", YEAR=2000, REFERENCES=21, ABSTRACT="Devices controlled by embedded computers are becoming an integral part of our everyday life, as processor and memory capacities continue to increase while their cost decreases. In some embedded systems, however, the limited input and output capacities are beginning to restrict the design of complex functionality. Furthermore, as wireless communication devices are becoming commonplace even in embedded systems, the communication and interoperation between different systems will be increasingly important in the future. This paper describes a flexible, yet powerful concept that explains how a mobile code can be conveniently utilized by mobile users to control ubiquitous and diverse embedded systems in different environments. Apart from providing flexibility, the concept also aims to keep the embedded systems as simple as possible. We will illustrate the concept by presenting as an example a virtual user interface for a videocassette recorder. We will also discuss the possible benefits and drawbacks of the system. The concept described here can be extended to allow the mobile code to be used as interconnecting", URL="http://www.usenix.org/publications/library/proceedings/es99/kangas.html", } @INPROCEEDINGS{Selt0003:Challenges, AUTHOR="Margo Seltzer and Michael A. Olson", TITLE="Challenges in Embedded Database System Administration", BOOKTITLE="Workshop on Embedded Systems", ADDRESS="Cambridge, Massachusetts, USA", DAYS=29, MONTH="Mar", YEAR=2000, REFERENCES=10, ABSTRACT="Database configuration and maintenance have historically been complex tasks, often requiring expert knowledge of database design and application behavior. In an embedded environment, it is not possible to require such expertise or to perform ongoing database maintenance. This paper discusses the database administration challenges posed by embedded systems and describes how Sleepycat Software's Berkeley DB architecture addresses these challenges.", URL="http://www.usenix.org/publications/library/proceedings/es99/seltzer.html", } @INPROCEEDINGS{Wang0007:Adaptive, AUTHOR="Xin Wang and Henning Schulzrinne", TITLE="Adaptive Reservation: A New Framework for Multimedia Adaptation", BOOKTITLE="IEEE International Conference on Multimedia and Expo (ICME)", INSTITUTION="Columbia University", ADDRESS="New York", DAYS=30, MONTH="July/August", YEAR=2000, KEYWORDS="resource reservation; adaptive services; pricing; billing; RNAP; RSVP", ABSTRACT="Research on multimedia adaptation usually assumes undifferentiated, best-effort service from the network, and relies on signaling mechanisms such as packet loss rates for feedback. These methods result in unfairness to adaptive applications in the presence of aggressive, non-adaptive applications. A network with enhancements for QoS support, and usage and QoS dependent pricing, can use pricing as a natural incentive to drive adaptive behavior by applications. In this work, we present a framework for the adaptation of multimedia application sending rate and/or choice of network services in response to dynamic network pricing and changes in application requirements. The adaptation is based on the (monetary) value of a service as perceived by the user, relative to the price charged by the network. Experimental results show that perceived-value-based adaptation allows bandwidth to be shared fairly among competing users. When network resources are scarce, bandwidth is shown to be distributed among competing applications (and among media streams belonging to a single multimedia system) according to their relative elasticity of demand, indicated by the sensitivity of the perceived value to the bandwidth.", URL="http://www.cs.columbia.edu/~hgs/papers/Wang0007\_Adaptive.pdf", } @ARTICLE{Li0001:Measurement, AUTHOR="Jung-Shian Li", TITLE="Measurement and in-service monitoring for {QoS} violations and spare capacity estimations in {ATM} network", JOURNAL=comcom, VOLUME=23, NUMBER=2, PAGES="162-170", MONTH=jan, YEAR=2000, KEYWORDS="In-service monitoring; Long-range dependence; ATM", ABSTRACT="In this paper, we investigate the traffic behaviour of a local ATM network. The major loading application in this network is network file system (NFS). The cell data are collected between switches. The results show that the traces present two different kinds of properties: long-range dependence (LRD) or short-range dependence (SRD). Then we propose a new method for in-service QoS violations and spare capacity estimations. For a typical ATM network, a large number of cells must be observed before we can get a statistically meaningful cell loss probability (CLP) result but these results may be too obsolete for effective network management. On the contrary, it is difficult to choose a suitable representative analytical model for many applications in ATM networks that exhibit varied statistical properties. Besides, finding analytical models may be complex and slow to fit. For both SRD and LRD processes, there exists a relationship between the logarithm of the CLP and the buffer size. The relationship for SRD processes is often linear while it is polynomial for LRD processes. If we can know the traffic presents LRD or SRD, the above relationships help us estimate the CLP of the queuing behaviour. The proposed method in this paper uses a simple regression test to select the suitable model: LRD or SRD. Then it employs the relationships between log(CLP) and buffer size of the selected model. With observations of cell loss for several small-buffer pseudo-queues and the selected regression model, the scheme can estimate the QoS and the spare capacity of the actual system. It requires only a short observation period and it does not need analytical models describing the statistics of traffic. The collected data are used for the basis of the simulation sources and the results of the simulations show the effectiveness of the method for both LRD and SRD trace data.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/28/30/abstract.html", } @INPROCEEDINGS{Yuks001:Workload, AUTHOR="Murat Yuksel and Biplab Sikdar and Kenneth Vastola and Boleslaw Szymanski", TITLE="Workload Generation in ns Simulations of Wide Area Networks and the {Internet}", BOOKTITLE="Communication Networks and Distributed Systems Simulation Conference", ADDRESS="Chicago, IL, USA", MONTH=jan, YEAR=2000, REFERENCES=16, KEYWORDS="simulation; ns; traffic generation", ABSTRACT="Extreme complexity of wide area networks and the Internet make the development of analytic models very difficult and under such circumstances, simulation models are a viable alternative to understand the behavior of these networks. We use ns as the simulation platform for this paper largely because of its wide acceptance in the networking community and its open design suitable for modification. A major drawback of ns is its failure to generate workloads and traffic patterns for networks which require taking into account the temporal and spatial correlation between the sources and the traffic that they generate. Also, a realistic traffic generator must maintain the proper composition of the composite traffic which results from the contributions of various protocols and applications in the network. In this paper we propose methodologies to address these issues and describe their implementation in ns. In addition, to address the issue of generating long-range dependent traffic in ns, we have implemented two self-similar traffic sources based on Fractional Renewal Processes and Markov Modulated Poisson Process. We also validate the proposed techniques and traffic generators using extensive simulations and present the simulation results.", URL="networks.ecse.rpi.edu/~bsikdar", } @TECHREPORT{Cnod0001:Effect, AUTHOR="Stefaan De Cnodder and Omar Elloumi and Kenny Pauwels", TITLE="Effect of different packet sizes on {RED} performance", TYPE="arXiv technical report", INSTITUTION="Alcatel, Belgium", NUMBER="cs/0001005", NOTE="Submitted to IEEE Communication Letters", MONTH=jan, YEAR=2000, KEYWORDS="RED; scheduling", ABSTRACT="We consider the adaptation of random early detection (RED) as an active queue management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTUs) are used. We studied the two existing RED variants and point out a weakness in both. The first variant where the drop probability is independent from the packet size discriminates connections with smaller MTUs. The second variant results in a very high Packet Loss Ratio (PLR), and as a consequence low goodput, for connections with higher MTUs. We show that fairness in terms of loss and goodput can be supplied through an appropriate setting of the RED algorithm.", URL="http://arXiv.org/abs/cs/0001005", } @TECHREPORT{Cnod0001:RED, AUTHOR="Stefaan De Cnodder and Omar Elloumi and Kenny Pauwels", TITLE="{RED} behavior with different packet sizes", TYPE="arXiv technical report", INSTITUTION="Alcatel, Belgium", NUMBER="cs/0001007", NOTE="submitted to IEEE Symposium on Computer Communications (ISCC)", MONTH=jan, YEAR=2000, KEYWORDS="RED; scheduling; MTU", ABSTRACT="We consider the adaptation of random early detection (RED) as a buffer management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTUs) are used. We studied the two RED variants described elsewhere and point out a weakness in both. The first variant where drop probability is independent from the packet size discriminates connections with smaller MTUs. The second variant results in a very high packet loss ratio (PLR), and as a consequence low goodput, for connections with higher MTUs. We show that fairness in terms of loss and goodput can be supplied through an appropriate setting of the RED algorithm.", URL="http://arXiv.org/abs/cs/0001007", } @ARTICLE{Simo0001:Web, AUTHOR="Clea Simon", TITLE="The Web Catches and Reshapes Radio", JOURNAL=nyt, MONTH=jan, YEAR=2000, KEYWORDS="Internet radio", URL="http://www.nytimes.com/yr/mo/day/artleisure/web-radio.html", } @ARTICLE{Modi0001:Traffic, AUTHOR="Eytan Modiano and Angela Chiu", TITLE="Traffic Grooming Algorithms for Reducing Electronic Multiplexing Costs in {WDM} Ring Networks", JOURNAL=ieeejlt, MONTH=jan, YEAR=2000, KEYWORDS="Wavelength Division Multiplexing; SONET rings; SONET add/drop multiplexers (ADMS); optical Network design", ABSTRACT="We develop traffic grooming algorithms for unidirectional SONET/WDM ring networks. The objective is to assign calls to wavelengths in a way that minimizes the total cost of electronic equipment (e.g., the number of SONET Add/Drop Multiplexers (ADMs)). We show that the general traffic grooming problem is NP-complete. However, for some special cases we obtain algorithms that result in a significant reduction in the number of ADMs. When the traffic from all nodes is destined to a single node, and all traffic rates are the same, we obtain a solution that minimizes the number of ADMs. In the more general case of all-to-all uniform traffic we obtain a lower bound on the number of ADMs required, and provide a heuristic algorithm that performs closely to that bound. To account for more realistic traffic scenarios, we also consider distance dependent traffic, where the traffic load between two nodes is inversely proportional to the distance between them, and again provide a nearly-optimal heuristic algorithm that results in substantial ADM savings. Finally, we consider the use of a hub node, where traffic can be switched between different wavelength, and obtain an optimal algorithm which minimizes the number of ADMs by efficiently multiplexing and switching the traffic at the hub. Moreover, we show that any solution not using a hub can be transformed into a solution with a hub using fewer or the same number of ADMs.", } @ARTICLE{Sloa0001:Fiber, AUTHOR="Thomas H. Sloane and Mickey Miller and Don Sorenson", TITLE="Fiber finances", JOURNAL="Telephony", VOLUME=238, NUMBER=4, PAGES="PTN16-PTN20", MONTH=jan, YEAR=2000, KEYWORDS="power; fiber", ABSTRACT="When considering the many variables of deploying fiber in the loop, service providers shouldn't forget to evaluate their power architecture options.", ANNOTE="``For example, between rural and urban locations, trenching costs can vary from less than \$1 per foot to more than \$150 per foot. .. This case study examines aerial and underground deployments with a trenching cost of \$50 per foot. The cabling cost, which includes the fiber and copper pairs, is assumed at \$1 per foot. With aerial plant, trenching costs are replaced by pole-access costs, which are assumed at $1 per foot.''", URL="http://www.internettelephony.com/asp/Supp\_Display.asp?SuppStoryID=474\&SuppTypeid=4", } @INPROCEEDINGS{Kirs0001:Secure, AUTHOR="Peter Kirstein and Ian Brown and Edmund Whelan", TITLE="Secure multicast conferencing", BOOKTITLE="DARPA Information Survivability Conference", ADDRESS="Hilton Head Island, South Carolina, USA", MONTH=jan, YEAR=2000, REFERENCES=27, KEYWORDS="secure conferencing; group key distribution; conferencing standards", ABSTRACT="This paper outlines the architectural principles of secured multicast conferencing. It discusses the general principles of the unsecured activity, giving details of tools, methods of announcing conferences, and relaying between multicast and unicast. It then considers how to secure these activities using techniques being standardised by the Internet Engineering Task Force.", URL="http://www-mice.cs.ucl.ac.uk/multimedia/projects/pimms/secure-conf.ps", } @ARTICLE{Babi0001:Novel, AUTHOR="Fulvio Babich and Marko Vitez", TITLE="A Novel Wide-Band Audio Transmission Scheme over the {Internet} with a Smooth Quality Degradation", JOURNAL=ccr, VOLUME=30, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=18, ABSTRACT="Real-time delivery of multimedia information over the Internet is finding increasing interest. This paper considers wide-band audio transmission utilizing a priority scheme. The proposed scheme complies with both the new Internet Protocol Version 6 (IPv6) and the current Internet Protocol Version 4 (IPv4), providing that, in the latter case, routers are set to manage priority. A new queueing algorithm, namely Priority Weighted Fair Queueing (PWFQ), is defined and evaluated. A scalable audio encoder is adopted to perform audio transmissions over an emulated network. Background traffic is emulated, employing a traffic generator that adops a self-similar model. Objective and subjective quality tests are performed, using a set of musical excerpts. Quality is evaluated as a function of Internet traffic. In the paper it is shown that, by adopting an encoding technique with scalable bit-rate, and a prioritized transmission algorithm, a smooth degradation of quality may be obtained during network congestion periods. This technique shows better performance than feedback-based algorithms, in which the delayed responses cause the core stage packets to be lost in low-to-high traffic transitions and the enhancement packets not to be transmitted in high- to-low traffic transmissions.", URL="http://www.acm.org/sigcomm/ccr/archive/2000/jan00/ccr-200001-babich.ps", } @ARTICLE{Bele0001:Errors, AUTHOR="Stanislav Belenki and Sven Tafvelin", TITLE="Analysis of Errors in Network Load Measurements", JOURNAL=ccr, VOLUME=30, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=15, ABSTRACT="The paper identifies elements in network monitoring systems that cause errors in the load measurements found in recent reports on network statistics from an academic backbone network. Two types of network monitors are investigated: counter-based and packet capturing. The paper explains how to assign an accuracy term to the load values in case of packet capturing monitors. The paper also suggests an MIB to reduce the counter-based measurement error.", URL="http://www.acm.org/sigcomm/ccr/archive/2000/jan00/ccr-200001-belenki.ps", } @ARTICLE{Egge0001:Effects, AUTHOR="Lars Rene Eggert and John Heidemann and Joe Touch", TITLE="Effects of {Ensemble-TCP}", JOURNAL=ccr, VOLUME=30, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=35, ABSTRACT="TCP currently recalculates the state of each connection from a fixed set of initial parameters; this recalculation occurs over several round trips, during which the connection can be less than efficient. TCP control block sharing is a technique for reusing inforamtion among connections in series and aggregating it among connections in parallel. This paper explores the design space of a modified TCP stack that utilizes these two ideas, and one possible design (E-TCP) is presented in detail. E-TCP has been designed so that the network the network transmission behavior of group of parallel E-TCP connections closely resembles that of a single TCP/ Reno connection. Simulated web accesses using HTTP/1.0 over E-TCP show a significant perforamance improvement compared to TCP/Reno connection bundles. This paper is first to evaluate performance using four different intra-ensemble schedulers for different workloads. In one scenario simulating a common case, E-TCP is 4-75\% faster than Reno for transmitting the HTML parts of various pages, and 17-61\% faster transmitting the whole pages. In the same scenario, reusing cached state speeds up repeated E-TCP page accesses by 17-53\% for the HTML parts and 10-28\% for the whole pages, compared to the initial access. E-TCP can also be integrated with other proposed TCP extensions (such as TCP/Vegas or TCP/SACK), to further improve performance.", URL="http://www.acm.org/sigcomm/ccr/archive/2000/jan00/ccr-200001-eggert.ps", } @ARTICLE{Ludw0001:Eifel, AUTHOR="Reiner Ludwig and Randy H. Katz", TITLE="The Eifel Algorithm: Making {TCP} Robust Against Spurious Retransmissions", JOURNAL=ccr, VOLUME=30, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=26, ABSTRACT="We propose an enhancement to TCP's error recovery scheme, which we call the Eifel algorithm. It eliminates the retransmission ambiguity, thereby solving the problems caused by spurious timeouts and spurious fast retransmits. It can be incrementally deployed as it is backwards compatible and does not change TCP's congestion control semantics. In environments where spurious retransmissions occur frequently, the algorithm can improve the end-to-end throughput by several tens of percent. An exact quantification is, however, highly dependent on the path characteristics over time. The Eifel algorithm finally makes TCP truly wireless-capable without the need for proxies between the end points. Another key novelty is that the Eifel algorithm provides for the implementation of a more optimistic retransmission timer because it reduces the penalty of a spurious timeout to a single (in the common case) spurious retransmission.", URL="http://www.acm.org/sigcomm/ccr/archive/2000/jan00/ccr-200001-ludwig.ps", } @ARTICLE{Kara0001:TCP, AUTHOR="Shrikrishna Karandikar and Shivkumar Kalyanaraman and Prasad Bagal and Bob Packer", TITLE="{TCP} Rate Control", JOURNAL=ccr, VOLUME=30, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=29, ABSTRACT="This paper presents TCP rate control, a new technique for transparently augmenting end-to-end TCP performance by controlling the sending rate of a TCP source. The sending rate of a TCP source is determined by its window size, the round trip time and rate of acknowledgments. TCP rate control affects these aspects by modifying the ack number and receiver window fields in acknowledgments and by modulating the acknowledgment rate. From a performance viewpoint a key benefit of TCP rate control is to avoid adverse performance effects due to packet losses such as reduced goodput and unfairness or large spread in per-user goodputs. Further, TCP rate control positively affects performance even if the bottleneck is non-local and the end-host TCP implementations are non-conforming. These aspects are demonstrated through a comparative study of TCP rate control, RED and TCP-ECN. The TCP rate control approach has been implemented and patented by Packeteer Inc.", URL="http://www.acm.org/sigcomm/ccr/archive/2000/jan00/ccr-200001-kara.ps", } @ARTICLE{Zwic0001:Stochastic, AUTHOR="Thomas Zwick and Christian Fischer and Dirk Didascalou and Werner Wiesbeck", TITLE="A Stochastic Spatial Channel Model Based on Wave-Propagation Modeling", JOURNAL=ieeejsac, VOLUME=18, NUMBER=1, PAGES="6-14", MONTH=jan, YEAR=2000, REFERENCES=28, KEYWORDS="Direction of arrival; indoor radio communication; multipath channel; poisson processes; propagation delay; radio propagation; stochastic channel modeling", ABSTRACT="In this paper, a novel stochastic spatial propagation channel model for wide-band spread spectrum applications is presented. THe model is set up for indoor scenarios, although in principle it can be extended easily to urban environments. Deterministic ray-tracing results are used to produce the huge data sets required for the statistical evaluation of the parameters of the proposed model. The approach for the stochastic model is based on physical wave propagation, where the channel is described by multipath components including angles of arrival at the receiver and angles of transmission at the transmitter. In each modeling step, path properties change according to the movement of the radio stations (RS's). The appearance and disappearance of multipath componenets is modeled by a genetic process. Especially, changing delay times of propagation paths yield a realistic Doppler behavior of the channel. A new approach to model the directions of multipath components in three dimensions has been developed. By relating the angles of arrival (or transmission) to the direct line between the transmitter and receiver, a universal modeling approach, which is independent of the actual geometry, becomes possible. the novel stochastic spatial channel model allows the simulation of complex systmes including arbitrary antenna configurations and patterns. A detailed description of the overall model is presented together with some initial simulation results", } @ARTICLE{Glis0001:Advanced, AUTHOR="Savo Glisic and Zorica Nikolic and Nenad Milosevic and Ari Pouttu", TITLE="Advanced Frequency Hopping Modulation for Spread Spectrum {WLAN}", JOURNAL=ieeejsac, VOLUME=18, NUMBER=1, PAGES="16-28", MONTH=jan, YEAR=2000, REFERENCES=26, KEYWORDS="am multiple frequency shift keying (amMFSK); frequency hopping (FH); wireless LAN (WLAN)", ABSTRACT="A wireless LAN standard developed by IEEE committee P802.11 operates in the unlicensed 2.4 GHz ISM band. This band is a very hostile environment due to many unpredictable interference sources, such as microwave ovens, utilizing the same frequency bands. At the same time the allowed signal power density that can be used is limited in order to minimize interference to other users in the same band. In order to avoid these interference and keep low signal power density the standard supports both direct sequence (DS) and frequency hopping (FH) modulation for these applications. The new test beds for multimedia wireless (WLAN's) also use FH modulation. In this paper, we analyze the performance of a modification of the FH multiple frequency shift keying (MFSK) system that includes a multitone multiamplitude MFSK signal which will be designated as amMFSK modulation. In this case, in order to meet the transwmitted power density limits imposed in ISM band, the signal energy is split into m separate tones. This makes the system more vulnerable to noise and fading, but still the overall flow of useful information will be increased. The results demonstrate that under the large range of the signal, channel and interference parameters this system offers better performance.", } @ARTICLE{Gama0001:Iterative, AUTHOR="Hesham {El Gamal} and Evaggelos Geraniotis", TITLE="Iterative Multiuser Detection for Coded {CDMA} Signals in {AWGN} and Fading Channels", JOURNAL=ieeejsac, VOLUME=18, NUMBER=1, PAGES="30-41", MONTH=jan, YEAR=2000, REFERENCES=14, KEYWORDS="Fading channels; iterative decoding; multiuser detection; wireless communications", ABSTRACT="In this paper, a new iterative receiver for joint detection and decoding of code division multiple access (CDMA) signals is presented. the new scheme is based on a combination of the minimum mean square error (MMSE) criterion and the turbo processing principle by Hagenauer. The complexity of the new scheme is of polynomial order in the number of users. The new scheme is applicable to two situations: a) when the receiver is capable of decoding the signals from all users and b) when the receiver is only capable of decoding the signals from a subset of users. In the first scenario, we establish that the proposed receiver achieves superior performance to the iterative soft interference cancellation technique (by Alexander et al.) under certain conditions. On the other hand, in the second scenario, we argue that the proposed receiver outperforms both the iterative soft interference canceler and the iterative maximum a posteriori (MAP) receiver (by Reed et al.) because of its superior near-far resistance. for operation over fading channels, the estimation of the complex fading parameters for all users becomes an important ingredient in any multiuser detector. In our scheme, the soft information provided by the decoders is used to enhance this estimation process. Two iterative soft-input channel estimation algorithms are presented: the first is based on the MMSE criterion, and the second is a lower-complexity approximation of the first. The proposed multiuser detection algorithm(s) are suitable for both terrestrial and satellite applications of CDMA.", } @ARTICLE{Corr0001:Frequency, AUTHOR="Américo Correia and António J. Rodrigues and Francisco Cercas", TITLE="Frequency-Hopping Versus Interference Cancellation for {TD-CDMA}", JOURNAL=ieeejsac, VOLUME=18, NUMBER=1, PAGES="42-51", MONTH=jan, YEAR=2000, REFERENCES=20, KEYWORDS="Code division multiple access (CDMA); diversity; frequency-hopping (FH); interference; interference cancellation; time division multiple access (TDMA); universal mobile telecommunication system (UMTS)", ABSTRACT="This work considers ansynchronous time division code division multiple access (TD-CDMA) systems with Rake receivers and one stage of parallel interference cancellation (PIC) or serial interference cancellation (SIC). A general method based on the concept of spherically symmetric signals is presented for the evaluation of the average probability of error of uncoded TD-CDMA systems. Slow frequency-hopping (SFH) with frequency overlap (FO) between adjacent carriers and interference cancellation are also included in the analysis, which considers the multipath Rayleigh fading channel (which models indoor and outdoor vehicular radio propagation). We analyze quadrature phase shift keying (QPSK) modulation with coherent demodulation and multipath (frequency) diversity with maximal ratio combining (MRC). Power control, adaptive SFH, and interference cancellation are employed for improving the bit-error rate (BER) performance. It is found that the scheme with SFH, in spite of the FO, always improves performance substantially, and interference cancellation, in general, provides the highest BER improvement.", } @ARTICLE{Woo0001:Optimal, AUTHOR="Tai-Kuo Woo", TITLE="Optimal Time-Hopping Scheme for {CDMA} Air Interface in Broad-Band Wireless Systems", JOURNAL=ieeejsac, VOLUME=18, NUMBER=1, PAGES="53-60", MONTH=jan, YEAR=2000, REFERENCES=15, KEYWORDS="Spread spectrum communications; time hopping; wideband code division multiple access (WCDMA)", ABSTRACT="Time-hopping techniques have been applied in direct sequence code division multiple access (DS-CDMA) to reduce the harmful effects of a sudden power surge in the received signals. The conventional approaches may result in either nonuniform distribution of transmitting users among time slots or uneven interference from the dominant interferers. For both cases, the bit-error rate (BER) increases significantly for the users suffering the worst case condition. In this paper, we propose an optimal time-hopping scheme based on the theory of finite projective planes for direct sequence code division multiple access to distribute interference evenly among participating users. The performance evaluation is divided into four parts. We demonstrate that both the average BER, probability of outage, and bandwidth efficiency can be improved by using the proposed time hopping scheme in comparison to other time-hopping schemes, such as the fixed allocation scheme and random selection scheme for various modulation methods including frequency shift keying-coherent demodulation (FSK-CD), differential phase shift keying (DPSK), binary phase shift keying (BPSK), and FSK with noncoherent demodulation (FSK-NCD). We compare the proposed time hopping scheme with nontime-hopping direct sequence code division multiple access (DS-CDMA) with identiacal signal bandwidth. We then prove that the proposed scheme is optimal in minimizing interference.", } @ARTICLE{Iina0001:Threshold, AUTHOR="Jari Iinatti", TITLE="On the Threshold Setting Principles in Code Acquisition of {DS-SS} Signals", JOURNAL=ieeejsac, VOLUME=18, NUMBER=1, PAGES="62-72", MONTH=jan, YEAR=2000, REFERENCES=12, KEYWORDS="Constant false alarm rate (CFAR); initial synchronization; maximum selection; optimal threshold", ABSTRACT="This paper compares the meaning of different threshold setting principles in the codes acquistion process of a direct sequence (DS) spread spectrum (SS) receiver. The consideration is made mainly in one-path additive white Gaussian noise (AWGN) channel. A brief consideration to a final fixed multipath channel is given to see its effect on the results. Also, a brief consideration for a certain type of fading is given in a case where the signal power is assumed to be considerably lower, i.e., faded, part of the time. For the possible performance measures of code acquisition, the main interest is in the mean acquisition time T\_MA . The probability of the acquisition in a given observation interval P\_acq is also considered to see if different measures have different demands. A matched filter (MF) acquisition is used with and without verification mode using an active integration. In the comparisons, fixed thresholds, thresholds based on constant false alarm rate (CFAR) criteria, and optimal thresholds in the sense to give either the minimum T\_MA or the maximum P\_acq are used. The results, which are obtained by using a method of selecting the maximum value at the output of the MF, are compared to the threshold cases. The results can be summarized as follows: when the performance measure is T\_MA , the best results are obtained by using CFAR-based threshold comparison. By a proper selection of the probability of a false alarm, the same performance is obtained as by using the optimal thresholds. When the performance measure P\_acq , the maximum-selection method is the best choice.", } @ARTICLE{Katz0001:Modeling, AUTHOR="Marcos Katz and Savo Glisic", TITLE="Modeling of Code Acquisition Process in {CDMA} Networks--Asynchronous Systems", JOURNAL=ieeejsac, VOLUME=18, NUMBER=1, PAGES="73-85", MONTH=jan, YEAR=2000, REFERENCES=13, KEYWORDS="Code acquisition; code division multiple access (CDMA); synchronization", ABSTRACT="In this paper, we discuss modeling of serial code acquisition process in a code division multiple access (CDMA) network. Due to multiple access interference (MAI), the process is characterized by a different proability of signal detection P\_D and proabability of a false alarm P\_FA in each cell of the code delay uncertainty region. We derive exact expressions for average code acquisition time and its variance. In addition to this, we also present several useful approximations, which enable easy engineering use of these results for practical applications in future universal mobile telecommunications system (UMTS) solutions. Numerical results based on this analysis are used for decision threshold optimization in code acquisition process for asynchronous CDMA networks.", } @ARTICLE{Chan0001:Joint, AUTHOR="Cha'o-Ming Chang and Kwang-Cheng Chen", TITLE="Joint Linear Timing and Carrier Phase Estimation of {DS-CDMA} Multiuser Communications", JOURNAL=ieeejsac, VOLUME=18, NUMBER=1, PAGES="87-97", MONTH=jan, YEAR=2000, REFERENCES=15, KEYWORDS="Direct sequence code division multiple access (DS-CDMA); multiuser communication; multiuser detection; multiuser synchronization", ABSTRACT="Previous work on multiuser synchronization assumed that either timing recovery or carrier phase recovery schemes were available. Threrefore, a generalized joint linear timing and carrier-phase estimation scheme to effectively estimate both the received timings and carrier phases at the same time is of paramount interest. Based on the idea to linearly combine the sufficient statistics of timings and carrier phases, we introduce the generalized joint linear timing and carrier phase estimation scheme with comensurate complexity of the generalized linear timing estimator. To avoid the difficulty of the design by minimizing the mean-square error (MSE), a simple and novel design criterion for this generalized joint linear estimation is proposed. With a discrete timing assumption, we not only mathematically prove that the MSE of the proposed estimator converges to zero as noise vanishes for an arbitrary number of users, but also conduct simulations to verify it. On the other hand, for the general case with a continuous timing assumption, arguments and simulations are provided to confirm the effectiveness of our proposed estimator for an arbitrary number of users. We further show that such an efficient linear-complexity joint estimation scheme is effective in the near-far environment. Consequently, the nonplynomial (NP) hard multiuser synchronization over additive white Gaussian noise (AWGN) channel is successfully solved.", } @ARTICLE{Chan0001:Spread, AUTHOR="Po-Rong Chang and Chin-Feng Lin", TITLE="Design of Spread Spectrum Multicode {CDMA} Transport Architecture for Multimedia Services", JOURNAL=ieeejsac, VOLUME=18, NUMBER=1, PAGES="99-110", MONTH=jan, YEAR=2000, REFERENCES=15, KEYWORDS="Multicode code division multiple access (CDMA); multimedia; object-composition Petri-net (OCPN)", ABSTRACT="In this paper, we investigate a new application of the well-known spread spectrum code division multiple access (SS-CDMA) techniques to multimedia services related to the development of the next-generation wireless mobile networks interconnecting with a wireline ATM-based broadband network. Such services allow users to share novel multimedia applications without any geographical restrictions. However, since the mobile radio channel has a fixed limited bandwidth, the traditional SS-CDMA system may not be sufficient to accommodate the variable bit rate (VBR) multimedia services requested by multiple mobile users simultaneously. Moreover, the traffic load at the base station can change dynamically due to the time-varying throughput requirement of these requested multimedia services. To tackle this difficulty, a multicode CDMA (MC-CDMA) technique is proposed to provide multirate multimedia services by varying the number of spreading codes assigned to each user in order to meet its throughput requirement. In MC-CDMA, a spreading code can be used to transmit information at a basic bit rate. Users (video or data) who need higher transmission rates can use multiple codes in parallel. Meanwhile, the maximum available number of codes in the MC-CDMA system is still limited. Hence, a cost-effective dynamic code allocation scheme has then been proposed to dynamically assign appropriate number of codes to each user for achieving the maximum resource utilization for multiuser multimedia services via the mobile radio channel. Finally, a number of real multimedia titles generated from the well-known MacroMind Director are conducted to evaluate the performance of the proposed wireless multimedia CDMA system.", } @ARTICLE{Coma0001:Delta, AUTHOR="Cristina Comaniciu and Narayan Mandayam", TITLE="Delta Modulation Based Prediction for Access Control in Integrated Voice/Data {CDMA} Systems", JOURNAL=ieeejsac, VOLUME=18, NUMBER=1, PAGES="112-121", MONTH=jan, YEAR=2000, REFERENCES=14, KEYWORDS="Access control; delta modulation; power control; voice/data code division multiple access (CDMA)", ABSTRACT="In this paper, we propose access control protocols for integrated voice/data code division multiple access (CDMA) systems that are based on estimating the residual capacity available for data users. The data model considered in the analysis is suitable for nontransparent services (e.g., e-mail, file transfer, store-and-forward facsimile, etc.). The residual capacity is derived from the feasibility condition for power control using an adaptive prediction technique based on delta modulation. The analysis is extended for the case of imperfect power control. Two access control protocols are considered: modified delta modulation with scheduled access (MDM-S) and modified delta modulation with random access (MDM-R). Comparisons with earlier proposed protocols reveal a better performance in terms of average throughput for data for a given system capacity and outage probability.", } @ARTICLE{Gonz0001:Spread, AUTHOR="Osvaldo A. González and Ryuji Kohno", TITLE="A Spread Slotted {CDMA/ALOHA} System with Hybrid {ARQ} for Satellite Multiple Access", JOURNAL=ieeejsac, VOLUME=18, NUMBER=1, PAGES="123-131", MONTH=jan, YEAR=2000, REFERENCES=17, KEYWORDS="Code division multiple access (CDMA); coding gain; forward error correction (FEC); hybrid automatic repeat request (ARQ); processing gain; spread slotted (SS)-CDMA/ALOHA", ABSTRACT="In the present paper, we propose and investigate a new type of satellite multiple access protocol that combines the characteristics of the spread slotted (SS)-ALOHA protocol, code division multiple access (CDMA), and the hybrid automatic repeat request (ARQ) error controlling and retransmission scheme, in order to increase the throughput by reducing the number of retransmissions and to keep the bit error rate (BER) of the satellite link low when the channel experiences heavy traffic. The main feature of our proposed system is the utilization of two different fields in the analysis of the satellite multiple access problem. Since the hub now possesses the forward error correction (FEC) capability to correct errors that appear after the CDMA despreading of the packets, the satellite does not need to ask so often for the retransmission of erroneous packets and will ask for retransmission only when the FEC error correcting capability is exceeded. This paper also presents the adaptive optimization of the balance between the CDMA processing gain and the FEC coding gain in order to obtain a better throughput for the SS-CDMA/ALOHA with hybrid ARQ protocol for Satellite Multiple Access. The optimization is made with the constraint of keeping the bandwidth of the transmitted packets constant during all times. According to this, the effective throughput of the protocol (information bits over total transmitted bits ratio) is improved by adaptively changing the CDMA and FEC codes used in the transmission. This adaptive optimization is done by observing the channel status or load and increasing or decreasing both coding schemes' gains. Computer simulations show the performance of the proposed multiple access scheme.", } @ARTICLE{Strm0001:Maximum, AUTHOR="Erik Ström and Fredrik Malmsten", TITLE="A Maximum Likelihood Approach for Estimating {DS-CDMA} Multipath Fading Channels", JOURNAL=ieeejsac, VOLUME=18, NUMBER=1, PAGES="132-140", MONTH=jan, YEAR=2000, REFERENCES=8, KEYWORDS="Code division multiple access (CDMA); Cramér-Rao bound; delay estimation; maximum likelihood estimation; multiuser channels", ABSTRACT="In this paper, we propose a maximum likeliehood approach for near-far robust synchronization of asynchronous direct sequence code division multiple access (DS-CDMA) systems operating over multipath channels. The algorithm is suitable for use in, for instance, a slotted system where each user transmits a short data burst with an embedded training sequence. The algorithm is shown to outperform the standard sliding correlator estimator. The Cramér-Rao bound is derived and is used to indicate the best performance that can be achieved by an unbiased estimator.", } @INPROCEEDINGS{McKn0001:Internet, AUTHOR="Lee McKnight", TITLE="{Internet} Telephony Markets: 2000 -- 3001", BOOKTITLE="Carrier Class IP Telephony", ADDRESS="San Diego, California", MONTH=jan, YEAR=2000, LANGUAGE="English", KEYWORDS="IP telephony; VoIP", ABSTRACT="Describes players and projections for IP telephony equipment. ``True costs of telephony are 0.1 to 0.2 cents/minute. Voice traffic will be 2--10\% of total traffic by 2007.'' Gives statistics for AT\\&T and MCI POPs. Plots Mbone usage (or lack thereof).", URL="http://www.cs.columbia.edu/IRT/papers/others/McKn0001\_Internet.ppt.gz", } @UNPUBLISHED{Nort0001:Comparison, AUTHOR="Nortel Networks", TITLE="A comparison of H.323v4 and {SIP}", NOTE="3GPP contribution", MONTH=jan, YEAR=2000, KEYWORDS="SIP; H.323; H.323v4", ABSTRACT="This contribution compares and contrasts SIP to H.323v4 to help aid operators and vendors in the selection of a single least common denominator control protocol for the ps ``domain'' or perhaps more appropriately ``plane'' of UMTS Release 2000. The format anticipates the concerns, in the form of questions, which may arise from 3GPP members.", URL="http://www.cs.columbia.edu/~hgs/sip/drafts/sip\_h323v4.doc", } @ARTICLE{Bae0001:Design, AUTHOR="Sang Bae and Sung-Ju Lee and William Su and Mario Gerla", TITLE="The Design, Implementation, and Performance Evaluation of On-Demand Multicast Routing Protocol in Multihop Wireless Networks", JOURNAL=ieeenet, VOLUME=14, NUMBER=1, PAGES="70-77", MONTH=jan, YEAR=2000, REFERENCES=32, KEYWORDS="multicasting; wireless networks; mobile computing; ad hoc networks; protocol implementation", ABSTRACT="Multicasting has emerged as one of the most focused areas in the field of networking. As the technology and popularity of Internet grow, applications, such as video conferencing, that require multicast feature are becoming more widespread. Another interesting recent development has been the emergence of dynamically reconfigurable wireless ad hoc networks to interconnect mobile users for applications ranging from disaster recovery to distributed collaborative computing. In this article we describe the On-Demand Multicast Routing Protocol (ODMRP) for mobile ad hoc networks. ODMRP is a mesh-based, rather than a conventional tree-based, multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain multicast group membership. We also describe our implementation of the protocol in a real laptop testbed.", URL="http://www.cs.ucla.edu/NRL/wireless/PAPER/sbae-inm.ps.gz", } @INPROCEEDINGS{Sann0001:Framework, AUTHOR="Henning Sanneck and Georg Carle and Rajeev Koodli", TITLE="A Framework Model for Packet Loss Metrics Based on Loss Runlengths", BOOKTITLE="SPIE/ACM SIGMM Multimedia Computing and Networking Conference", MONTH=jan, YEAR=2000, } @INPROCEEDINGS{Sann0001:Speech, AUTHOR="Henning Sanneck and Nguyen H. Le", TITLE="Speech Property-Based {FEC} for {Internet} Telephony Applications", BOOKTITLE="SPIE/ACM SIGMM Multimedia Computing and Networking Conference (MMCN)", ADDRESS="San Jose, California", PAGES="38-51", MONTH=jan, YEAR=2000, ABSTRACT="Recently we have seen research efforts on how to protect a real-time speech signal when transmitting over an unreliable packet-switched network like the Internet by open-loop error control. Research has covered the type of Foward Error Correction (generic or voice-specific), the protocol support needed and adaptivity to the current network congestion state. However, the sender does not take into account that some segments of the signal are essential to the speech quality, while others can be extrapolated at the receiver from data received earlier in the event of a packet loss. This is especially true for modern frame-based codecs like the G.729 and G.723.1 which contain an internal loss concealment algorithm. Thus, the sender consumes additional bandwidth and aggravates the congestion in the Internet by sending unnecessary redundancy. In this paper we first analyze the concealment performance of the G.729 decoder. We find that the loss of unvoiced frames can be concealed well. Also, the loss of voiced frames is concealed well once the decoder has obtained sufficient information on them. However the decoder fails to conceal the loss of voiced frames at an unvoiced/voiced transition because it extrapolates internal state (filter coefficients and excitation) for an unvoiced sound. Moreover, once the encoder has failed to build the appropriate linear prediction synthesis filter, it takes a long time for the decoder to resynchronize with the encoder. Using this result, we then develop a new FEC scheme to support frame-based codecs, which adjusts the amount of added redundancy adaptively to the properties of the speech signal. Objective quality measures (ITU P.861A and EMBSD) show that our speech property-based FEC (SPB-FEC) scheme achieves almost the same speech quality as current FEC schemes while approximately halving the amount of necessary redundant data to adequately protect the voice flow.", ANNOTE="We have characterized the behaviour of a particular speech codec (G.729) under packet loss in terms of the packet-level metrics of Gilbert model linked to objective speech quality metrics (P.861A and EMBSD). While the decoder is relatively insensitive to bursty losses (as described by the conditional loss probability of the Gilbert model), the perceived quality breaks down for losses within unvoiced/voiced transitions within the speech signal. We have concluded that the effect of loss distribution on perceived quality is significant, it is codec-dependent and it cannot necessarily be fully described building just on simple metrics like those of the Gilbert model.", URL="ftp://ftp.fokus.gmd.de/pub/glone/papers/Sann0001:Speech-FEC.ps.gz", } @ARTICLE{Cela0001:MPEG, AUTHOR="Nedo Celandroni and Erina Ferro and Invalid Invalid", TITLE="{MPEG-2} coded video traces transmitted over a satellite link: scalable and non-scalable solutions in rain fading conditions", JOURNAL="Multimedia Tools and Applications", VOLUME=10, NUMBER=1, PAGES="73-97", MONTH=jan, YEAR=2000, KEYWORDS="MPEG video; scalability; quality factor; satellite; fading", ABSTRACT="The literature is poor in the analyses of the effects produced by corrupted bits in compressed video bitstreams. This paper presents the results of a transmission experiment of MPEG­2 coded video data over a satellite link affected by noise, in order to investigate under which conditions this type of transmission is economically feasible. The signal­to­noise ratio scalability feature of the MPEG­2 encoder was used to produce different bitstreams of the same movie sequence. The scope of the study was to verify which are the best combinations of video and channel codings in the presence of attenuation on the satellite link, in order to optimize the bandwidth utilisation for a requested image quality. The results obtained give indications about the data channel codings to be used to counter the rain fade on the transmission link, which is a non negligible problem especially when satellite transmissions are in the Ka band. Moreover, the results highlight the flexibility of the scalable video coding in the examined scenario.", URL="mailto:F.Potorti@cnuce.cnr.it", } @ARTICLE{Mars0001:Cellular, AUTHOR="Marco {Ajmone Marsan} and S. Maranoa and Carlo Mastroianni and Michela Meo", TITLE="Performance analysis of cellular mobile communication networks supporting multimedia services", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=3, PAGES="167-177", MONTH=jan, YEAR=2000, ABSTRACT="This paper illustrates the development of an analytical model for a communication network providing integrated services to a population of mobile users, and presents performance results to both validate the analytical approach, and assess the quality of the services offered to the end users. The analytical model is based on continuous-time multidimensional birth--death processes, and is focused on just one of the cells in the network. The cellular system is assumed to provide three classes of service: the basic voice service, a data service with bit rate higher than the voice service, and a multimedia service with one voice and one data component. In order to improve the overall network performance, some channels can be reserved to handovers, and multimedia calls that cannot complete a handover are decoupled, by transferring to the target cell only the voice component and suspending the data connection until a sufficient number of channels become free. Numerical results demonstrate the accuracy of the approximate model, as well as the effectiveness of the newly proposed multimedia call decoupling approach.", URL="http://www.baltzer.nl/monet/contents/2000/5-3.html#mnt142", } @ARTICLE{Das0001:Simulation, AUTHOR="Samir Das and Robert Castañeda and Jiangtao Yan", TITLE="Simulation-based performance evaluation of routing protocols for mobile ad hoc networks", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=3, PAGES="179-189", MONTH=jan, YEAR=2000, ABSTRACT="In this paper we evaluate several routing protocols for mobile, wireless, ad hoc networks via packet-level simulations. The ad hoc networks are multi-hop wireless networks with dynamically changing network connectivity owing to mobility. The protocol suite includes several routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector, used for dynamic networks. Performance is evaluated with respect to fraction of packets delivered, end-to-end delay, and routing load for a given traffic and mobility model. Both small (30 nodes) and medium sized (60 nodes) networks are used. It is observed that the new generation of on-demand routing protocols use much lower routing load, especially with small number of peer-to-peer conversations. However, the traditional link state and distance vector protocols provide, in general, better packet delivery and end-to-end delay performance.", URL="http://www.baltzer.nl/monet/contents/2000/5-3.html#mnt143", } @ARTICLE{Haas0001:Demand, AUTHOR="Zygmunt J. Haas and Yi-Bing Lin", TITLE="Demand re-registration for {PCS} database restoration", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=3, PAGES="191-198", MONTH=jan, YEAR=2000, ABSTRACT="In a Personal Communications Services (PCS) network, mobility databases such as Home Location Register (HLR) and Visitor Location Register (VLR) are utilized to support mobility management for Mobile Stations (MSs). If the location databases fail, the location information loss or corruption will seriously degrade the service offered to the subscribers. In this paper, we propose a new VLR failure recovery scheme called demand re-registration. In this scheme, the VLR broadcasts a re-registration request to all MSs after the VLR failure. When an MS receives the re-registration request, it sends a registration message to the VLR to recover the location record. Since all MSs will re-register after receiving the broadcasting request, traffic jam (and thus collisions) may occur. If a collision occurs, then the involved MSs must re-send the registration messages. This paper studies the performance of demand re-registration by investigating how effectively the re-registration can recover the location record for an MS before the first MS call termination occurs. Our results indicate that demand re-registration can effectively recover VLR failure.", URL="http://www.baltzer.nl/monet/contents/2000/5-3.html#mnt144", } @ARTICLE{Kell0001:Scalable, AUTHOR="O. E. Kelly and Jian-Jou Lai and N. B. Mandayam and Andy Ogielski and J. Panchal and Roy Yates", TITLE="Scalable parallel simulations of wireless networks with WiPPET: Modeling of radio propagation, mobility and protocols", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=3, PAGES="199-208", MONTH=jan, YEAR=2000, ABSTRACT="We review the design, selected applications and performance of WiPPET (Wireless Propagation and Protocol Evaluation Testbed), a general parallel simulation testbed for various types of wireless networks. WiPPET has been written in TeD/C++, an object-oriented modeling framework that isolates network modeling from the underlying parallel discrete event simulator. We describe the techniques for modeling radio propagation (long and short-scale fading and interference) and protocols that promote scalability of parallel simulations at session and packet time-scales. We outline two selected applications of WiPPET: integrated radio resource management in a mobile wireless network; and packet losses due to mobility and short-scale fading over a radio link. We illustrate the efficiency of the simulator under two partitioning schemes with parallel performance data obtained using the Georgia Time Warp optimistic simulator.", URL="http://www.baltzer.nl/monet/contents/2000/5-3.html#mnt145", } @ARTICLE{Alle0001:Parallel, AUTHOR="Peter Alleyne and Carl Tropper", TITLE="On the parallel simulation of fixed channel allocation algorithms", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=3, PAGES="209-218", MONTH=jan, YEAR=2000, ABSTRACT="We present, in this paper, several channel allocation algorithms for use in cellular communications networks or mobile networks. The channel allocation algorithms make use of fixed allocation of channels and channel reorganization. The channel reorganization algorithms are used to free channels within a neighborhood of the cell in which the requesting call originates. The performance of these algorithms was evaluated via distributed simulation, making use of the Chandy--Misra--Bryant NULL message algorithm, on a BBN Butterfly multiprocessor. In addition to evaluating the performance of the channel allocation algorithms, we examine the efficiency of the NULL message algorithm as a tool for our simulations. The reason for making use of parallel simulation was to avoid the long simulation times and large memory consumption characteristic of sequential (uniprocessor) simulations. Our results indicate that our channel allocation algorithms performed efficiently. Upwards of 20\% of the calls which were not initially connected by the borrowing schemes were connected after channel reorganization. The NULL message approach proved to be efficient when the message traffic was not extremely low.", URL="http://www.baltzer.nl/monet/contents/2000/5-3.html#mnt146", } @ARTICLE{Badr0001:Conceptual, AUTHOR="Badri Nath and Armando Fox and Leonard Kleinrock and Gerald Popek and Peter Reiher and M. Satyanarayanan", TITLE="A conceptual framework for network and client adaptation", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=4, PAGES="221-231", MONTH=jan, YEAR=2000, ABSTRACT="Modern networks are extremely complex, varying both statically and dynamically. This complexity and dynamism are greatly increased when the network contains mobile elements. A number of researchers have proposed solutions to these problems based on dynamic adaptation to changing network conditions and application requirements. This paper summarizes the results of several such projects and extracts several important general lessons learned about adapting data flows over difficult network conditions. These lessons are then formulated into a conceptual framework that demonstrates how a few simple and powerful ideas can describe a wide variety of different software adaptation systems. This paper describes an Adaptation Framework in the context of the several successful adaptation systems and suggests how the framework can help researchers think about the problems of adaptivity in networks.", URL="http://www.baltzer.nl/monet/contents/2000/5-4.html#mnt152", } @ARTICLE{Josh0001:Proxy, AUTHOR="Anupam Joshi", TITLE="On proxy agents, mobility, and web access", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=4, PAGES="233-241", MONTH=jan, YEAR=2000, ABSTRACT="With the emerging need for ubiquitous access to information, web access from mobile clients is gaining increasing importance. Unfortunately, the underlying protocols of the web are not designed to support operations from a resource poor platform in a low bandwidth, disconnection prone environment. Efforts to create systems to support mobile browsing have typically been proxy-based. However, such solutions have recently been criticized due to their non-scalability. Developments in ad hoc networking also threaten the viability of proxy-based approaches. In this paper, we critically examine the proxy-based approach and its place in mobile access to the web in particular, and networked multimedia information in general. We argue for a hybrid approach that uses both proxy-based and end--end techniques as appropriate, suggest when each is more appropriate, and present a preliminary implementation.", URL="http://www.baltzer.nl/monet/contents/2000/5-4.html#mnt153", } @ARTICLE{Flyn0001:Satchel, AUTHOR="Mike Flynn and David Pendlebury and Christopher Richard Jones and Marge Eldridge and Mik Lamming", TITLE="The Satchel system architecture: Mobile access to documents and services", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=4, PAGES="243-258", MONTH=jan, YEAR=2000, ABSTRACT="Mobile professionals require access to documents and document-related services, such as printing, wherever they may be. They may also wish to give documents to colleagues electronically, as easily as with paper, face-to-face, and with similar security characteristics. The Satchel system provides such capabilities in the form of a mobile browser, implemented on a device that professional people would be likely to carry anyway, such as a pager or mobile phone. Printing may be performed on any Satchel-enabled printer, or any fax machine. Scanning, too, may be accomplished at any Satchel-enabled scanner. Access rights to individual documents may be safely distributed, without regard to document formats. Access to document services is greatly simplified by the use of context sensitivity. The system has been extensively tested and evaluated. This paper describes the architecture of the Satchel system.", URL="http://www.baltzer.nl/monet/contents/2000/5-4.html#mnt154", } @ARTICLE{Tan0001:MobiCast, AUTHOR="Cheng Lin Tan and Stephen Pink", TITLE="MobiCast: A multicast scheme for wireless networks", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=4, PAGES="259-271", MONTH=jan, YEAR=2000, ABSTRACT="In this paper, we propose a multicast scheme known as MobiCast that is suitable for mobile hosts in an internetwork environment with small wireless cells. Our scheme adopts a hierarchical mobility management approach to isolate the mobility of the mobile hosts from the main multicast delivery tree. Each foreign domain has a domain foreign agent. We have simulated our scheme using the Network Simulator and the measurements show that our multicast scheme is effective in minimizing disruptions to a multicast session due to the handoffs of the mobile group member, as well as reducing packet loss when a mobile host crosses cell boundaries during a multicast session.", URL="http://www.baltzer.nl/monet/contents/2000/5-4.html#mnt155", } @ARTICLE{Shek0001:Intelligent, AUTHOR="Eddie C. Shek and Son Dao and Yongguang Zhang and Darrel J. Van Buer and Giovanni Giuffrida", TITLE="Intelligent information dissemination services in hybrid satellite-wireless networks", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=4, PAGES="273-284", MONTH=jan, YEAR=2000, ABSTRACT="The need for rapid deployment and user mobility suggest the use of a hybrid satellite-wireless network infrastructure for important situation awareness and emergency response applications. An Intelligent Information Dissemination Service (IIDS) has been developed to support the dissemination and maintenance of extended situation awareness throughout such a network information infrastructure in a seamless manner. One of the goals of IIDS is to transparently handle the mismatches in characteristics of satellite and terrestrial wireless networks, allow effective utilization of available bandwidth, and support timely delivery of highly relevant information. IIDS achieves the above by implementing user profile aggregation that incrementally aggregates users into communities sharing common interests to enable multicast-based information dissemination. Based on the user grouping, semantic profile matching customizes information streams based on matching user group interest profiles. By taking into account expected changes in user profiles, profile-oriented data dissemination achieves predictive push and caching that anticipates future user needs and minimizes latency of data request by making data available before they are explicitly requested. Finally, bandwidth-aware filtering adapts information streams to resource bandwidth availability to gracefully hide the bandwidth mismatch between the satellite and wireless links in the hybrid network infrastructure. The IIDS software has been deployed on the Digital Wireless Battlefield Network (DWBN) that integrates commercial off-the-shelf satellite and wireless products into a heterogeneous satellite/wireless hybrid network for supporting wireless mobile multimedia services.", URL="http://www.baltzer.nl/monet/contents/2000/5-4.html#mnt156", } @ARTICLE{Helm0001:Adaptive, AUTHOR="David P. Helmbold and Darrell Long and Tracey L. Sconyers and Bruce Sherrod", TITLE="Adaptive disk spin-down for mobile computers", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=4, PAGES="285-297", MONTH=jan, YEAR=2000, ABSTRACT="We address the problem of deciding when to spin down the disk of a mobile computer in order to extend battery life. One of the most critical resources in mobile computing environments is battery life, and good energy conservation methods increase the utility of mobile systems. We use a simple and efficient algorithm based on machine learning techniques that has excellent performance. Using trace data, the algorithm outperforms several methods that are theoretically optimal under various worst-case assumptions, as well as the best fixed time-out strategy. In particular, the algorithm reduces the power consumption of the disk to about half of the energy consumed by a one minute fixed time-out policy. Furthermore, the algorithm uses as little as 88\% of the energy consumed by the best fixed time-out computed in retrospect.", URL="http://www.baltzer.nl/monet/contents/2000/5-4.html#mnt157", } @ARTICLE{Kele0001:Consistency, AUTHOR="Peter J. Keleher and Ugur Cetintemel", TITLE="Consistency management in Deno", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=4, PAGES="299-309", MONTH=jan, YEAR=2000, ABSTRACT="We describe a new replicated-object protocol designed for use in mobile and weakly-connected environments. The protocol differs from previous protocols in combining epidemic information propagation with voting, and in using fixed per-object currencies for voting. The advantage of epidemic protocols is that data movement only requires pair-wise communication. Hence, there is no need for a majority quorum to be available and simultaneously connected at any single time. The protocols increase availability by using voting, rather than primary-copy or primary-commit schemes. Finally, the use of per-object currencies allows voting to take place in an entirely decentralized fashion, without any server having complete knowledge of group membership. We show that currency allocation can be used to implement diverse policies. For example, uniform currency distributions emulate traditional voting schemes, while allocating all currency to a single server emulates a primary-copy scheme. We present simulation results showing both schemes, as well as the performance advantages of using currency proxies to temporarily reallocate currency during planned disconnections. Furthermore, we discuss an initial design of the underlying replicated-object system and present a basic API.", URL="http://www.baltzer.nl/monet/contents/2000/5-4.html#mnt158", } @ARTICLE{Dirc0001:Pre, AUTHOR="Ravi A. Dirckze and Le Gruenwald", TITLE="A pre-serialization transaction management technique for mobile multidatabases", JOURNAL="Mobile Networks and Applications", VOLUME=5, NUMBER=4, PAGES="311-321", MONTH=jan, YEAR=2000, ABSTRACT="Rapid advances in hardware and wireless communication technology have made the concept of mobile computing a reality. Thus, evolving database technology needs to address the requirements of the future mobile user. The frequent disconnection and migration of the mobile user violate underlying presumptions about connectivity that exist in wired database systems and introduce new issues that affect transaction management. In this paper, we present the Pre-Serialization (PS) transaction management technique for the mobile multidatabase environment. This technique addresses disconnection and migration and enforces a range of atomicity and isolation criteria. We also develop an analytical model to compare the performance of the PS technique to that of the Kangaroo model.", URL="http://www.baltzer.nl/monet/contents/2000/5-4.html#mnt159", } @ARTICLE{Vara0001:Persistent, AUTHOR="Kannan Varadhan and Ramesh Govindan and Deborah Estrin", TITLE="Persistent route oscillations in inter-domain routing", JOURNAL=cn, VOLUME=32, NUMBER=1, PAGES="1-16", MONTH=jan, YEAR=2000, KEYWORDS="routing; policy; inter-domain; BGP; IDRP; non-convergence", ABSTRACT={Hop-by-hop inter-domain routing protocols, such as border gateway protocol (BGP) and inter-domain routing protocol (IDRP), use independent route selection to realize domains' local policies. A domain chooses its routes based on path attributes present in a route. It is widely believed that these inter-domain routing protocols always converge. We show that there exist domain policies that cause BGP/IDRP to exhibit persistent oscillations. In these oscillations, each domain repeatedly chooses a sequence of routes to a destination. Complex oscillation patterns can occur even in very simple topologies. We analyze the conditions for persistent route oscillations in a simple class of inter-domain topologies and policies. Using this analysis, we evaluate ways to prevent or avoid persistent oscillations in general topologies. We conclude that if a hop-by-hop inter-domain routing protocol allows unconstrained route selection at a domain, the protocol may be susceptible to route oscillations. Constraining route selection to a provably "safe"procedure (such as shortest path) can reduce the number of realizable policies. Alternatively, a routing policy registry can help detect unsafe policies.}, URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Yagh0001:Intelligent, AUTHOR="Mohamad Hossien Yaghmaee and Mostafa Safavi and Mohamad Bagher Menhaj", TITLE="An intelligent usage parameter controller based on dynamic rate leaky bucket for {ATM} networks", JOURNAL=cn, VOLUME=32, NUMBER=1, PAGES="17-34", MONTH=jan, YEAR=2000, KEYWORDS="ATM networks; fuzzy traffic control; traffic management; usage parameter control", ABSTRACT="In this paper we present a high performance intelligent traffic controller based on dynamic rate leaky bucket algorithm. In our proposed model, by using a fuzzy controller, the leaky rate is dynamically tuned according to the state of traffic source. Control actions are taken based on real time estimation of actual mean cell rate. Simulation results show that the proposed traffic controller has a high selectivity, good dynamic behavior and has also a null false alarm probability. To achieve the benefits of statistical multiplexing gain, the proposed traffic controller employs a network congestion feedback to take a decision to discard or tag the input violating cells. It is seen that the proposed fuzzy traffic controller protects the QoS of well-behavior connections far better than any traditional traffic controller does.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Agga0001:Flexible, AUTHOR="Sudhir Aggarwal and Sanjoy Paul and Daniel Massey and Daniela Caldararu", TITLE="A flexible multicast routing protocol for group communication", JOURNAL=cn, VOLUME=32, NUMBER=1, PAGES="35-60", MONTH=jan, YEAR=2000, KEYWORDS="multicast routing; conference; steiner tree; shared tree; shortest path tree; mobile multicast; inter-domain multicast; switching tree", ABSTRACT="Multicast routing, once dominated by a single routing protocol, is becoming increasingly diverse. It is generally agreed that at least three routing protocols, PIM, DVMRP, and CBT will be widely deployed and must interoperate. This signals a shift from the Mbone as one large domain to a collection of administrative domains where each domain selects its own multicast routing protocol. This paper proposes another multicast routing protocol, Conference Steiner Multicast (CSM), that is suited for domains that implement OSPF as the unicast routing protocol. CSM is targeted towards (sparse) multicast conferencing and online discussion groups. Characteristics of such discussion groups include any member being a speaker or listener and dynamic changes in the group membership. CSM is futhermore well suited for domains with mobile hosts because its basic architecture can support a mobile environment. CSM is based on the use of a shared, heuristic Steiner minimal tree for interconnecting group members. A key component of the design is that it dynamically and reliably shifts to a different tree as changes warrant. CSM supports rudimentary entry control for security and permits application assistance over routing decisions (termed Application Assisted Routing). This paper describes the architecture of CSM as well as a prototype implementation. Several CSM routers have been interconnected to form a Multicast Steiner Backbone (Msbone). Standard applications such as vat, vic, and wb [V. Jacobson, Multimedia Conferencing on the Internet, Tutorial 4, ACM SIG-COMM 94, August 1994] have been modified to run on Msbone. CSM is designed to connect to the Mbone via interoperation with DVMRP, and as interoperation standards develop it should be capable of implementing these standards.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Ng0001:Connection, AUTHOR="Nelson Ng and Chen Khong Tham", TITLE="Connection admission control of {ATM} network using integrated {MLP} and fuzzy controllers", JOURNAL=cn, VOLUME=32, NUMBER=1, PAGES="61-79", MONTH=jan, YEAR=2000, LANGUAGE="English", KEYWORDS="ATM; call admission control; neural network; fuzzy control", ABSTRACT="This paper presents a new approach to the problem of call admission control (CAC) of variable bit rate (VBR) traffic in an asynchronous transfer mode (ATM) network. Our approach employs an integrated neural network and fuzzy controller to implement the CAC controller. This scheme capitalizes on the learning ability of a neural network and the robustness of a fuzzy controller. Experiments show that this scheme is able to achieve high throughput and low cell loss while achieving fairness among different classes of VBR traffic. For comparison, we have also implemented four other CAC schemes: (1) peak bandwidth method, (2) equivalent bandwidth method, (3) average bandwidth method and (4) neural network quality of service (QoS) predictor. Results of these experiments are presented in this paper.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Sist0001:Using, AUTHOR="Riccardo Sisto", TITLE="Using binary decision diagrams for representation and analysis of communication protocols", JOURNAL=cn, VOLUME=32, NUMBER=1, PAGES="81-98", MONTH=jan, YEAR=2000, KEYWORDS="protocol engineering; symbolic model checking; lotos; binary decision diagrams", ABSTRACT="A symbolic representation of a state/transition system based on binary decision diagrams (BDDs) is generally more compact than an explicit representation like a state/transition table. This is due to regular and repetitive patterns occurring in state/transition systems. By exploiting this property, huge state spaces can be represented, and the resulting BDDs can be profitably used for activities such as symbolic model checking and sequential circuit synthesis. This paper shows how such techniques can be applied to communication protocols by presenting a systematic method to build BDD representations from protocol specifications expressed in the ISO standard protocol specification language LOTOS. The method exploits the compositionality of the process algebra of LOTOS to avoid the enumeration of all the states and transitions, takes also data into account, enables building the BDDs in the more convenient disjunctive partitioned form, and can handle any LOTOS specification characterized by a finite LTS. The method consists in partitioning the set of process definitions according to their mutual recursion relationships, building an LTS for each set of mutually recursive process definitions, encoding these LTSs as BDDs which in turn are combined together, according to the process algebraic operators, to obtain the overall BDD representation. An example is used throughout the paper to illustrate the method.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Zhan0001:Hop, AUTHOR="Hongyi Zhang and Oliver Yang and Hussein Mouftah", TITLE="A hop-by-hop flow controller for a virtual path", JOURNAL=cn, VOLUME=32, NUMBER=1, PAGES="99-119", MONTH=jan, YEAR=2000, KEYWORDS="congestion control; hop-by-hop control; stability and fairness", ABSTRACT="In this paper, we propose a hop-by-hop robust controller for the flow regulation of the best-effort (ABR) traffic along a virtual path (VP) in high-speed networks. The local controller at each VP switch can regulate the transmission rate of virtual connections (VCs) based on the knowledge of the buffer occupancy in downstream VP switches. The fluid-flow model is used to design the hop-by-hop congestion controller, and used to study dynamic and steady behaviors of the network. A condition for the network's stability is derived. It is shown that with this controller applied, the network is asymptotically stable without oscillation. It is also shown that the proposed controller can achieve fairness and high utilization, and reduce the overhead traffic.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Bara0001:TCP, AUTHOR="Chadi Barakat and Eitan Altman and Walid Dabbous", TITLE="On {TCP} Performance in a Heterogeneous Network: A Survey", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=15, ABSTRACT="Transmission media carrying Internet traffic present a wide range of characteristics, some of which, such as transmission errors, long end-to-end delay, and bandwidth asymmetry, may cause a degradation of TCP performance. Many works have studied the performance of TCP over these media, most of which focus on a particular network type. In this work we study TCP performance independent of the type of network by considering the different possible characteristics of the connection path. We present the problems and the different proposed solutions. This study permits us to understand the limitations of the actual solutions and the required modifications to let TCP cope with a heterogeneous Internet on an end-to-end basis.", URL="http://www.comsoc.org/ci/private/2000/jan/Barakat.html", } @ARTICLE{Jia0001:Integrated, AUTHOR="Weijia Jia and Dong Xuan and Wei Zhao", TITLE="Integrated Routing Algorithms for Anycast Messages", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=10, ABSTRACT="Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same path for anycast packets from a source, while multipath routing splits anycast traffic into several different paths. The former is simple and easy to implement, while the latter may potentially reduce congestion, improving delay and throughput performance. However, multipath routing may require additional cost to maintain multipath information. To take advantage of both approaches and overcome their shortcomings, we develop a set of integrated routing algorithms that can adaptively select a subset of routers in the network to carry out multipath routing for anycast messages. We demonstrate that systems using our integrated routing algorithms perform substantially better than those where either the single-path or multipath approach is used alone.", URL="http://www.comsoc.org/ci/private/2000/jan/Zhao.html", } @ARTICLE{Nand0001:Adaptation, AUTHOR="Sanjiv Nanda and Krishna Balachandran and Sarath Kumar", TITLE="Adaptation Techniques in Wireless Packet Data Services", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=14, ABSTRACT="Today's cellular systems are designed to achieve 90–95 percent coverage for voice users (i.e., the ratio of signal to interference plus noise must be above a design target over 90 to 95 percent of the cell area). This ensures that the desired data rate which achieves good voice quality can be provided ``everywhere.'' As a result, SINRs that are much larger than the target are achieved over a large portion of the cellular coverage area. For packet data service, the larger SINR can be used to provide higher data rates by reducing coding or spreading and/or increasing the constellation density. It is straightforward to see that cellular spectral efficiency (in terms of b/s/Hz/sector) can be increased by a factor of two or more if users with better links are served at higher data rates. Procedures that exploit this are already in place for all the major cellular standards in the world. In this article, we describe data rate adaptation procedures for CDMA (IS-95), wideband CDMA (cdma2000 and UMTS WCDMA), TDMA (IS-136), and GSM (GPRS and EDGE).", URL="http://www.comsoc.org/ci/private/2000/jan/Kumar.html", } @ARTICLE{Kuzn0001:Optical, AUTHOR="Mark Kuznetsov and Nan M. Froberg and Scott R. Henion and Hemonth G. Rao and Jeff Korn and Kristin A. Rauschenbach", TITLE="A Next-Generation Optical Regional Access Network", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=6, ABSTRACT="We describe an optical regional access network which combines electronic IP routing with intelligent networking functionality of the optical WDM layer. The optical WDM layer provides such networking functions as network logical topology reconfiguration, optical flow switching to offload traffic and bypass IP routers, wavelength routing of signals, protection switching and restoration in the optical domain, and flexible network service provisioning by reconfigurable wavelength connectivity. We discuss key enabling technologies for the WDM layer and describe their limitations. The symbiosis of electronic and optical WDM networking functions also allows support for heterogeneous format traffic and will enable efficient gigabit-per-second user access in next-generation Internet networks.", URL="http://www.comsoc.org/ci/private/2000/jan/Kuznetsov.html", } @ARTICLE{Sari0001:Extending, AUTHOR="Hikmet Sari and Frederik Vanhaverbeke and Marc Moeneclaey", TITLE="Extending the Capacity of Multiple Access Channels", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=17, ABSTRACT="Multiple access techniques which allow a communication medium to be shared between different users represent one of the most challenging topics in digital communications. In terms of the number of users that can be accommodated on a given channel, there are two distinct classes of multiple access techniques. The first class includes the well-known FDMA, TDMA, and OCDMA. On a channel whose bandwidth is N times the bandwidth of the individual user signals, these techniques can accommodate N users without any mutual interference, but not a single additional user can be supported beyond this limiting number. The second class includes CDMA with pseudo-noise spreading sequences (which we refer to as PN-CDMA) and some other related schemes. PN-CDMA does not have a hard limit on the number of users that can be accommodated, but is subject to multi-user interference which grows linearly with the number of users. In this article, after reviewing the capacity limits of existing multiple access techniques, we describe some newly introduced concepts which allow us to accommodate N users without any interference while also accommodating additional users at the expense of some SNR penalty.", URL="http://www.comsoc.org/ci/private/2000/jan/Sari.html", } @ARTICLE{Keij0001:JAIN, AUTHOR="John de Keijzer and Douglas Tait and Rob Goedman", TITLE="{JAIN:} A New Approach to Services in Communication Networks", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=11, ABSTRACT="JAIN™, a set of integrated network APIs for the Java(TM) platform, provides a framework to build and integrate solutions (or``services'') that span across packet (e.g., IP or ATM), wireless, and PSTN networks. The objective of JAIN is to provide service portability, convergence, and secure access (by services residing outside of the network) to such integrated networks. JAIN is defined and specified by a large number of participating communication companies (the JAIN Community), and according to a well-documented process (the Java Community Process or JCP). The objective of the JAIN Community is to create an open market for services across integrated networks using Java technology. This article is the first of a series in this issue of IEEE Communications Magazine and serves as an introduction to the other articles. The next section provides the JAIN business case. The article then summarizes how the JAIN Community works, and briefly introduces how the JAIN Community is organized. The next two sections are of a more technical nature and explain how separate JAIN work items fit together. In particular, we provide the rationale for the currently supported levels of abstraction (in terms of session/call signaling models) in JAIN. We look at possible implementation scenarios. Conclusions are contained in the last section. For more details on several of the JAIN Community work items, please refer to the other JAIN-related articles [1 3] in this issue of IEEE Communications Magazine.", URL="http://www.comsoc.org/ci/private/2000/jan/Dekeijzer.html", } @ARTICLE{Bhat0001:JAIN, AUTHOR="Ravi Raj Bhat and Rajeev Gupta", TITLE="{JAIN} Protocol {APIs}", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=6, ABSTRACT="JAIN envisions the creation of a number of Java APIs that abstract the details of networks and protocol implementations, and allow for the development of portable applications. The JAIN Protocol Experts Group will focus on developing Java APIs for protocols used in telephony, INs, wireless networks, and the Internet. PEG is organized into an SS7 subgroup and an IP subgroup. The first section provides an introduction to PEG. The next section describes the JAIN SS7 APIs. We then describe the JAIN IP APIs. The article explains how JAIN SS7 and IP APIs can be leveraged for the converged SS7-IP networks of the future. We then describe the JAIN PEG roadmap and provide references.", URL="http://www.comsoc.org/ci/private/2000/jan/Bhat.html", } @ARTICLE{Jain0001:Java, AUTHOR="Ravi Jain and Farooq Anjum and Paolo Missier and Subramanya Shastry", TITLE="Java Call Control, Coordination, and Transactions", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=13, ABSTRACT="Future telecommunications networks will consist of integrated packet-switched (IP and/or ATM), circuit-switched (PSTN), and wireless networks. Service providers will offer a wide portfolio of innovative applications over these integrated networks. Doing so rapidly and efficiently requires open network APIs, with a key API being that for call control, as well as for coordination and transactions. The JAIN community is defining an API for Java Call Control and Java Coordination and Transactions. The JCC API defines the interface for applications to initiate and manipulate calls, while JCAT defines the facilities for applications to be invoked and return results before or during calls. Note that in this context a call refers to a multimedia, multiparty, multiprotocol communications session. The JCC/JCAT Edit Group of JAIN is in the process of defining the first version of the JCC/JCAT API specification, which is expected to be released in early 2000. This introductory article describes the background of and motivation for the design of the JCC/JCAT API. We briefly describe the AIN and JTAPI call models on which the JCC/JCAT API is based. We then describe the scope of JCC/JCAT and its relationship to other JAIN Edit Groups defining facilities for enabling service creation. Finally, we describe the requirements and example service drivers for JCC/JCAT, as well as the initial proposed design and structure for JCC and JCAT.", URL="http://www.comsoc.org/ci/private/2000/jan/Jain.html", } @ARTICLE{Lee0001:Enabling, AUTHOR="Jae-Oh Lee", TITLE="Enabling Network Management Using Java Technologies", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=13, ABSTRACT="The increasing integration of telecommunications networks creates possibilities for interoperability among their respective management systems, using common management interfaces for CMIP, SNMP, CORBA, and Java RMI. Many Java technologies related to network management have been developed; therefore, it is desirable to create a development environment using Java technologies. In this article we explore a TMN-based management platform model and the applicable Java technologies. We demonstrate that the management platform can support certain candidate management interfaces as service components in a distributed computing environment. And lastly, we show that using Java technologies to provide network management indicates the feasibility of this management platform.", URL="http://www.comsoc.org/ci/private/2000/jan/Lee.html", } @ARTICLE{Armi0001:MPLS, AUTHOR="Grenville Armitage", TITLE="{MPLS:} The Magic Behind the Myths", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=15, ABSTRACT="This article reviews the key differences between traditional IP routing and the emerging MPLS approach, and identifies where MPLS adds value to IP networking. In various corners of the industry MPLS has been held up as the solution to IP QoS, gigabit forwarding, network scaling, and traffic engineering. Each of these expectations is critically considered in the light of developments in conventional gigabit IP routers. It is shown that MPLS adds the ability to forward packets over arbitrary non-shortest paths, and emulate high-speed``tunnel'' between IP-only domains -- capabilities critical to service providers who need to better manage resources around their backbones, or who are planning IP VPN services. However, it is also argued that the technology required to support IP QoS and gigabit forwarding is not unique to MPLS. A network of gigabit IP routers or switches may be entirely sufficient for QoS and performance if traffic engineering is not a requirement.", URL="http://www.comsoc.org/ci/private/2000/jan/Armitage.html", } @ARTICLE{Eich0001:Implementing, AUTHOR="Gerald Eichler and Heinrich Hussmann and George Mamais and Iakovos S. Venieris and Christian Prehofer and Stefano Salsano", TITLE="Implementing Integrated and Differentiated Services for the {Internet} with {ATM} Networks: A Practical Approach", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=10, ABSTRACT="This article reports on design, implementation, and preliminary experimentation of a network architecture that supports quality of service for Internet applications. It gives an overview of the various approaches toward communication networks that support application-specific degrees of QoS. Special emphasis is put on the integrated and differentiated services approaches and on combinations of them. A new architecture is described which aims to bring these concepts closer to practical realization in wide-area networks. The new architecture supports the integrated as well as differentiated services approaches in a smoothly integrated way, and uses the capabilities of an underlying ATM network to realize QoS. The enhancements to the existing network infrastructure are deliberately limited to the integration of a single new type of network element called an edge device. The potential benefits of such an architecture for various stakeholders are explained, and how the new architecture could be introduced smoothly in existing networks by small migration steps, also covering networks based on technologies other than ATM. It is shown that the approach can be scaled up to a very large QoS-aware overlay network for the Internet.", URL="http://www.comsoc.org/ci/private/2000/jan/Salsano.html", } @ARTICLE{Seve0001:Trends, AUTHOR="Jan Sevenhans and Bart Verstraeten and Silvio Taraborrelli", TITLE="Trends in Silicon Radio Large Scale Integration: Zero {IF} Receiver! Zero I \& Q Transmitter! Zero Discrete Passives!", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=5, ABSTRACT="After 10 years of advances in silicon RF integration, what used to be an art is becoming a``normal practice.'' Historically, RF-design was the art of s-parameters, shielding, impedance matching, and standing wave ratios. Modern silicon RFICs are designed using the same SPICE-like tools as in low-frequency analog ICs with the addition of important software for system-level simulation and mixer circuit noise analysis. New RF design practices away from the 50 ohm culture, novel chip architectures, and powerful technological advances will drive radio integration toward the ultimate single-chip phone. The obstacles in this quest are high system requirements on noise figure, substrate cross talk, and parasitic coupling, not the silicon IC technology.", URL="http://www.comsoc.org/ci/private/2000/jan/Sevenhans.html", } @ARTICLE{Sher0001:Standardization, AUTHOR="M. H. Sherif", TITLE="Standardization and Innovation in Information Technology", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, URL="http://www.comsoc.org/ci/private/2000/jan/Sherif.html", } @ARTICLE{Gath0001:DSP, AUTHOR="Alan Gatherer and Trudy Stetzler and Mike McMahan and Edgar Auslander", TITLE="{DSP-Based} Architectures for Mobile Communications: Past, Present and Future", JOURNAL=ieeecm, VOLUME=38, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=13, ABSTRACT="Programmable DSPs are pervasive in the wireless handset market for digital cellular telephony. We present the argument that DSPs will continue to play a dominant, and in fact increasing, role in wireless communications devices by looking at the history of DSP use in digital telephony, examining the DSP-based solution options for today's standards, and looking at future trends in low-power DSPs.", URL="http://www.comsoc.org/ci/private/2000/jan/Gatherer.html", } @ARTICLE{Zead0001:Impact, AUTHOR="S Zeadally", TITLE="Impact of {ATM} switch architectures on {CBR} video performance", JOURNAL=comcom, VOLUME=23, NUMBER=1, PAGES="1-12", MONTH=jan, YEAR=2000, KEYWORDS="Asynchronous transfer mode; Jitter; Performance; Switch; Video", ABSTRACT="Asynchronous Transfer Mode (ATM) has become one of the leading high-speed networking technologies in the local and wide area environments. ATM offers great promise to meet the real-time requirements of emerging multimedia applications. In the last few years, many ATM networks have been deployed and use different types of ATM switches, many of which differ in their implementations. In this paper, we explore the impact of two ATM switches, namely DEC GIGAswitch/ATM and IBM 8265 on the performance delivery of real-time digital video over native ATM connections. We also demonstrate experimentally the effects of different types of cross-traffic (delivered over both UDP/IP and native ATM) network loads on end-user application performance using QoS metrics such as jitter and packet loss.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/23/23/abstract.html", } @ARTICLE{Tach0001:Causality, AUTHOR="T. Tachikawa and Hiroaki Higaki and M. Takizawa", TITLE="-Causality and -delivery for wide-area group communications", JOURNAL=comcom, VOLUME=23, NUMBER=1, PAGES="13-21", MONTH=jan, YEAR=2000, KEYWORDS="Group communication protocol; Causally ordering; -Causality; -Delivery; Wide-area group", ABSTRACT="In distributed applications, a group of multiple processes cooperate by exchanging messages. It is critical to support the group of application processes with enough quality of service (QoS) including the ordered delivery of messages. The delay time and the message loss ratio are significant QoS parameters. In Internet applications, the delay time and the loss ratio are significantly different in different communication channels. We define a novel causality named *-causality among the messages to hold in the world-wide environment. We discuss how to transmit messages to the destination processes and how to resolve message loss and delay supporting the *-causality, given the requirements of delay time and message loss ratio.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/23/24/abstract.html", } @ARTICLE{Poo0001:Measuring, AUTHOR="Gee-Swee Poo and Jun Tang", TITLE="Measuring the performance of OrbixTalk: a reliable multicast messaging system", JOURNAL=comcom, VOLUME=23, NUMBER=1, PAGES="22-31", MONTH=jan, YEAR=2000, KEYWORDS="OrbixTalk; Reliable multicast; Performance measurement", ABSTRACT="This paper presents a performance study on IONA's OrbixTalk, a software system that provides a decoupled, asynchronous and reliable multicast messaging using UDP-based IP multicast. Two programming interfaces are examined: one for Orbix (C++) applications and another for OrbixWeb (Java) applications. Performance measurements were conducted using various message sizes and varying number of receivers. The software system works fine for both types of applications. Nonetheless, the performance characteristics of the two are different. The Java applications require longer set-up time, more than two times that of C++ applications. However, for the actual multicasting of messages, the Java approach yields lower delay and higher throughput, much better than the C++ approach, particularly for large number of receivers. Consequently, the OrbixWeb design of OrbixTalk turns out to be more suitable for large group multicast.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/23/25/abstract.html", } @ARTICLE{Jan0001:Cell, AUTHOR="Rong-Hong Jan and Kuo-Ruey Wu", TITLE="A cell-numbering plan for seamless handoff in a wireless {ATM} network", JOURNAL=comcom, VOLUME=23, NUMBER=1, PAGES="32-38", MONTH=jan, YEAR=2000, KEYWORDS="Handoff; Wireless networks; Asynchronous transfer mode; Rerouting", ABSTRACT="This paper proposes a cell-numbering plan for mobile stations to handoff seamlessly to the cells in a wireless Asynchronous Transfer Mode (ATM) network. It also proposes a minimum-hop rerouting (MHR) method to perform the rerouting of user connections during the handoff. The cell-numbering plan assigns each cell an integer from 1 to 5, ensuring that neighboring cells will have different numbers. Any mobile station that performs a handoff beween any two cells can easily calculate if a reroute is needed. Furthermore, by using the MHR, the path between the originating and terminating mobile stations will be the shortest whenever either of them moves. The signaling bandwidth used for this kind of rerouting is believed to be the smallest among the methods reported to date.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/23/26/abstract.html", } @ARTICLE{Elka0001:Study, AUTHOR="A. Elkateeb and M. Elbeshti", TITLE="A study using a {RISC} core for {ATM} network interfaces design", JOURNAL=comcom, VOLUME=23, NUMBER=1, PAGES="39-44", MONTH=jan, YEAR=2000, KEYWORDS="Network interfaces; Reduced instruction set computer core; Transmission line speed", ABSTRACT="The use of a general purpose processing core in the design of high-speed network interfaces can be very useful in providing some important features to these interfaces, such as simplicity, shorter developing cycle time, low development cost, and flexibility. However, it is not clear whether such a core can efficiently provide the processing power required by these high-speed interfaces without significantly increasing the clock rate of the processing core. Such an increase will make the cost of the core very high and not practical to be used with Asynchronous Transfer Mode (ATM) interfaces. In this paper, we have demonstrated that a general purpose processing core, such as an 80MHz Reduced Instruction Set Computer (RISC), can be used in ATM network interfaces for a wide range of transmission line speeds, up to 1.2Gb/s. Also, we have discussed some of the design issues related to the RISC core based network interfaces.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/23/27/abstract.html", } @ARTICLE{Chen0001:Bounded, AUTHOR="Yen-Jen Chen and Sung Lee", TITLE="Bounded tag fair queueing for broadband packet switching networks", JOURNAL=comcom, VOLUME=23, NUMBER=1, PAGES="45-61", MONTH=jan, YEAR=2000, KEYWORDS="Packet scheduling; Fair queueing; Fairness; Bounded delay; Efficiency", ABSTRACT="Fair Queueing (FQ) is an attractive packet scheduling mechanism, which can establish firewall among packet flows. Thus, the quality of service (QoS) of each flow can be guaranteed. To implement the mechanism, three important performance issues are concerned: fairness, bounded delay, and efficiency. We propose a scheme, named BTFQ, which satisfies the three criteria. The scheme BTFQ+ is also proposed to improve the fairness property of BTFQ and is designed to combine with a low-cost, high-speed hardware for reducing computation time. For comparison, we classify some well-known packet scheduling schemes into six classes according to their fairness properties. BTFQ and BTFQ+ are excellent in bounded delay and efficiency. Their fairness properties, although a little bit weak, are but still very good if the traffic load is under 95\%, according to the simulation results. Because of the tradeoff among the performance issues, BTFQ and BTFQ+ provide another good choices.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/23/28/abstract.html", } @ARTICLE{Chir0001:VBR, AUTHOR="Girish Chiruvolu and R. Sankar and N. Ranganathan", TITLE="{VBR} video traffic management using a predictor-based architecture", JOURNAL=comcom, VOLUME=23, NUMBER=1, PAGES="62-70", MONTH=jan, YEAR=2000, KEYWORDS="Traffic management; VBR-video; Long-range dependence models; Short-range dependence models", ABSTRACT="The efficient transportation of real-time Variable Bit Rate (VBR) video traffic in the high-speed networks has been an area of active research. An important issue is the simplicity with which the bandwidth allocation and scheduling schemes can be executed online with real-time constraints in the future high-speed networks. The correlation properties of the VBR video traffic make the predictor-based online traffic adaptation techniques attractive. We developed a novel predictor-based dynamic bandwidth allocation (PDBA) scheme for short-term resource management and studied its queuing performance. In order to reduce the effects of the prediction errors on the queuing system and hence the underutilization of reserved bandwidth, a novel short-term controller (STC) that works at the cell-level has been introduced and the system has been called the PDBA-STC system. This online VBR video traffic prediction-based traffic management scheme has low complexity and is suitable for implementation in high-speed networks Ranganathan et al. [N. Ranganathan, R. Anand, G. Chiruvolu, A VLSI ATM architecture for VBR traffic, Proc. IEEE International Conference on VLSI Design, 1998, pp. 420-427] and has been demonstrated to provide better performance than other existing simple schemes. This paper also investigates the predictability of VBR video traffic that exhibits long-range dependence (LRD) based on a fractional ARIMA (1,d,0) model. The short-range dependent (SRD) Auto Regressive (AR) model for prediction of VBR video traffic has also been considered for evaluation of the proposed dynamic bandwidth allocation scheme and the performance has been compared to that of LRD-based prediction. Finally, a summary and future research have been discussed.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/23/29/abstract.html", } @ARTICLE{Long0001:Fair, AUTHOR="Y. H. Long and T. K. Ho and A. B. Rad", TITLE="Fair flow control of {ABR} service by {per-VC} virtual queuing", JOURNAL=comcom, VOLUME=23, NUMBER=1, PAGES="71-83", MONTH=jan, YEAR=2000, KEYWORDS="ABR service; Per-VC virtual queuing; Weighted round-robin", ABSTRACT="In this paper, a rate-based flow control scheme based upon per-VC virtual queuing is proposed for the Available Bit Rate (ABR) service in ATM. In this scheme, each VC in a shared buffer is assigned a virtual queue, which is a counter. To achieve a specific kind of fairness, an appropriate scheduler is applied to the virtual queues. Each VC's bottleneck rate (fair share) is derived from its virtual cell departure rate. This approach of deriving a VC's fair share is simple and accurate. By controlling each VC with respect to its virtual queue and queue build-up in the shared buffer, network congestion is avoided. The principle of the control scheme is first illustrated by max-min flow control, which is realised by scheduling the virtual queues in round-robin. Further application of the control scheme is demonstrated with the achievement of weighted fairness through weighted round robin scheduling. Simulation results show that with a simple computation, the proposed scheme achieves the desired fairness exactly and controls network congestion effectively.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/23/30/abstract.html", } @ARTICLE{Chiu0001:Reduction, AUTHOR="Chin-Ching Chiu and Yi-Shiung Yeh and Ruey-Shun Chen", TITLE="Reduction of the total execution time to achieve the optimal k-node reliability of distributed computing systems using a novel heuristic algorithm", JOURNAL=comcom, VOLUME=23, NUMBER=1, PAGES="84-91", MONTH=jan, YEAR=2000, KEYWORDS="Distributed computing systems (DCS); Reliability optimization; k-Node reliability (KNR)", ABSTRACT="A distributed computing system is a collection of processor-memory pairs connected by communication links. A k-node set is a subset of total nodes in a distributed computing system. A k-node set with capacity constraint is a k-node set that possesses sufficient node capacity. Because computing the reliability of a distributed computing system is generally an NP-hard problem, an adequate k-node set with a given capacity constraint must be determined by an effective algorithm with an approximate reliability. Relatively few investigations, namely an exact method and a k-tree reduction method, have examined k-node reliability optimization with capacity constraint. Such investigations either spent an exponential time or rarely obtained an optimal solution. Therefore, in this work, we present a novel heuristic algorithm to reduce the computational time and deviation from an exact solution. The proposed algorithm has simple independent steps, including selection of k-node sets according to a node's weight or a link's weight. The number of selected k-node sets is either one or two, thereby spending less time to compute the reliability of k-node sets. Computational results demonstrate that the proposed algorithm is more effective and provides a better solution for a large distributed computing system than those in previous investigations.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/23/31/abstract.html", } @ARTICLE{Fuji0001:Routing, AUTHOR="Hiroshi Fujinoki and K. J. Christensen", TITLE="A routing algorithm for dynamic multicast trees with end-to-end path length control", JOURNAL=comcom, VOLUME=23, NUMBER=2, PAGES="101-114", MONTH=jan, YEAR=2000, KEYWORDS="Multicast; Dynamic multicast; Routing algorithm; Path length control", ABSTRACT="The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum path length bounds for each receiver. The PLC algorithm can be implemented as a distributed algorithm, can tradeoff end-to-end delay and bandwidth consumption, and can be implemented for polynomial time execution. Analysis and simulation show that (a) the PLC algorithm generates multicast trees which consume less bandwidth than those generated by the SPT algorithm while guaranteeing the same shortest path length and (b) consume less bandwidth than trees generated by the Greedy algorithm with only a moderate increase in path length. The PLC algorithm is more flexible and has a lower cost than a combined SPT and Greedy algorithm.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/28/25/abstract.html", } @ARTICLE{Weng0001:Modified, AUTHOR="Cheng-Ming Weng and Pei-Wei Huang", TITLE="Modified group method for mobility management", JOURNAL=comcom, VOLUME=23, NUMBER=1, PAGES="115-122", MONTH=jan, YEAR=2000, KEYWORDS="Personal communication service; Mobile cellular networks; Mobility management", ABSTRACT="The Group Method as identified in IS-41 standard was modified in this study to be dual group system to identify the optimal group size and to cope with the location tracking problem of the wireless system. The Group Method can effectively reduce the loading of the network caused by tracking mobile users in a mobile cellular system because it joins several cells to form a group. Instead of performing registration and deregistration for each individual in cell, the Group Method performs these tasks on a group scale. Moreover, the Dual Group Method saves network resources because it eliminates unnecessary location updates due to its fewer group boundary passes. This study also evaluates the cost ratios between the Basic Method and the Group Method. The effectiveness of this scheme is illustrated in the following two examples. First, the Group Method offers a saving about 40\% of network resources (a reducing rate of 0.589) when the Call-to-Mobility Ratio (CMR) (R. Jain, Y.-B. Lin, C. Lo, S. Mohan, Proc. INFOCOM'95, (1995) 481-489; IEEE J. Select. Areas Communication, 12(8), (1994)), and the cost of message transmission/cost of database transaction (TDCR) is equal to 0.2. Second, about 15\% of system resources are saved (a reducing rate is 0.847); when the CMR is equal to 0.5 and the TDCR is equal to 0.4. Results in this study demonstrate that the Group Method yields significant benefits in terms of reducing rate and that the Dual Group system is more beneficial.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/28/26/abstract.html", } @ARTICLE{Le0001:Pareto, AUTHOR="Tho Le-Ngoc and Sushila Subramanian", TITLE="A Pareto-modulated Poisson process {(PMPP)} model for long-range dependent traffic", JOURNAL=comcom, VOLUME=23, NUMBER=2, PAGES="123-132", MONTH=jan, YEAR=2000, ABSTRACT="A new model for long-range dependent traffic is presented. This model is based on a switched Poisson process with two states and the sojourn time in each state follows an independent and identical Pareto distribution. It is versatile in capturing the self-similar characteristics of traffic found in the recent measurements. Its Index of Dispersion for Counts (IDC) is derived. It is shown that the IDC increases monotonically and the", } @ARTICLE{Zhan0001:Novel, AUTHOR="Liang Zhang and Huirong Fu", TITLE="A novel scheme of transporting pre-stored {MPEG} video to support video-on-demand (VoD) services", JOURNAL=comcom, VOLUME=23, NUMBER=2, PAGES="133-148", MONTH=jan, YEAR=2000, KEYWORDS="Multimedia networking; Quality of service; Network bandwidth allocation; Network multiplexing gain; Video-on-demand", ABSTRACT="This paper focuses on the optimization of network bandwidth allocation and buffer dimensioning to transport pre-stored MPEG video data from source to playback destination across ATM networks. This is one of the most important issues in the support of video-on-demand (VoD) service. This paper provides a novel scheme in the dynamic allocation of bandwidth to segments of video using ABR mode. The dynamic bandwidth allocation is based on a new concept, called playback tunnel which is obtained from the traffic characteristics of the pre-stored MPEG video trace to determine the optimum of transmission bandwidth as well as the buffer capacity to ensure that the playback buffer neither underflows nor overflows. The proposed scheme is tested with real-life MPEG video traces. The obtained results have shown its significant performance improvement in terms of the capacity of playback buffer, the start-up playback delay, the size of video segment and the network multiplexing gain.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/28/28/abstract.html", } @ARTICLE{Vand0001:General, AUTHOR="Bobby Vandalore and Sonia Fahmy and Rahul Jain and Rohit Goyal and Mukul Goyal", TITLE="General weighted fairness and its support in explicit rate switch algorithms", JOURNAL=comcom, VOLUME=23, NUMBER=2, PAGES="149-161", MONTH=jan, YEAR=2000, KEYWORDS="ATM switch algorithms; Pricing policy; ABR service; Traffic management", ABSTRACT="This paper gives a new definition of general weighted (GW) fairness and shows how this can achieve various fairness definitions, such as those mentioned in the ATM Forum TM 4.0 specifications. The GW fairness can be achieved by calculating the ExcessFairshare (weighted fairshare of the left over bandwidth) for each VC. We show how a switch algorithm can be modified to support the GW fairness by using the ExcessFairshare term. We use ERICA+ as an example switch algorithm and show how it can be modified to achieve the GW fairness. For simulations, the weight parameters of the GW fairness are chosen to map a typical pricing policy. Simulation results are presented to demonstrate that, the modified switch algorithm achieves GW fairness. An analytical proof for convergence of the modified ERICA+ algorithm is given in the appendix.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/28/29/abstract.html", } @ARTICLE{Layu0001:Routing, AUTHOR="Li Layuan and L. Chunlin", TITLE="A routing protocol for dynamic and large computer networks with clustering topology", JOURNAL=comcom, VOLUME=23, NUMBER=2, PAGES="171-176", MONTH=jan, YEAR=2000, KEYWORDS="Dynamic and large computer networks; Routing protocol; Clustering topology; Discrete dynamic programming principle", ABSTRACT="The routing decision is one of the important research issues in the network fields. With the rapid development of high-speed networks, multimedia communication networks and mobile computer networks, the hierarchical routing techniques for the dynamic and large networks or high-speed networks have triggered interests among many people worldwide. This paper proposes a hierarchical dynamic routing protocol (HDRP), which can adapt to dynamic and large computer networks (DLCN) with clustering topology. It also gives the main procedures for realizing routing update and routing decision, and the proof of correctness and complexity analysis of the protocol. The performance measures of HDRP, including throughput and average message delay, are evaluated using simulation. The study shows that HDRP provides a new available approach to routing decision for DLCN with clustering topology.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/28/31/abstract.html", } @ARTICLE{Huan0001:PPP, AUTHOR="C.M. Huang and Julian Hsu", TITLE="{PPP} {(P3):} an Estelle-based probabilistic partial protocol verification system", JOURNAL=comcom, VOLUME=23, NUMBER=2, PAGES="177-192", MONTH=jan, YEAR=2000, KEYWORDS="Estelle-based probabilistic partial protocol; Communicating finite state machine; SUN SPARC workstations", ABSTRACT="Protocol verification is a process for checking the correctness of communication protocols. However, verifying practical and complicated protocols always encounters the state explosion problem using global state reachability analysis. In this paper, we propose a probabilistic partial protocol verification scheme to verify communication protocols that are specified in the extended state transition model, i.e. the Extended Communicating Finite State Machine (ECFSM) model. Based on our probabilistic verification scheme, the occurrence probability of each global state is derived using the occurrence rates of communicating entities' transitions and the occurrence probabilities of channel entities' transitions. Then, only those global states whose occurrence probabilities are greater than a given threshold need to be explored. As a result, probabilistic partial protocol verification can be achieved. In order to calculate more reasonable communicating transitions' occurrence rates and channel transitions' occurrence probabilities, we analyze protocol operations to derive transitions' probabilities relationships. Based on these relations, a reasonable value can be assigned to each transition's probability, which can be used to delimit partial probabilistic protocol verification. Using our probabilistic partial protocol verification scheme and derivation of transitions probabilities relationships, an Estelle-based Probabilistic Partial Protocol verification system, which is called PPP (P3), is developed on SUN SPARC workstations. This way, protocol designers can use P3 to design and partially verify the Estelle-based protocol specifications.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/28/32/abstract.html", } @ARTICLE{Wang0001:Multicast, AUTHOR="Bin Wang and Jennifer Hou", TITLE="Multicast Routing and Its {QoS} Extension: Problems, Algorithms, and Protocols", JOURNAL=ieeenet, VOLUME=14, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=89, ABSTRACT="Multicast services have been increasingly used by various continuous media applications. The QoS requirements of these continuous media applications prompt the necessity for QoS-driven, constraint-based multicast routing. This article provides a comprehensive overview of existing multicast routing algorithms, protocols, and their QoS extension. In particular, we classify multicast routing problems according to their optimization functions and performance constraints, present basic routing algorithms in each problem class, and discuss their strengths and weaknesses. We also categorize existing multicast routing protocols, outline the issues and challenges in providing QoS in multicast routing, and point out possible future research directions.", URL="http://www.comsoc.org/~ni/public/2000/jan/index.html", } @ARTICLE{Kase0001:Scalable, AUTHOR="Sneha Kumar Kasera and Supratik Bhattacharyya and Mark Keaton and Diane Kiwior and Steve Zabele and Jim Kurose and Don Towsley", TITLE="Scalable Fair Reliable Multicast Using Active Services", JOURNAL=ieeenet, VOLUME=14, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=22, ABSTRACT="Scalability is of paramount importance in the design of reliable multicast transport protocols, and requires careful consideration of a number of problems such as feedback implosion, retransmission scoping, distributed loss recovery, and congestion control. In this article, we present a reliable multicast architecture that invokes active services at strategic locations inside the network to comprehensively address these challenges. Active services provide the ability to quickly and efficiently recover from loss at the point of loss. They also exploit the physical hierarchy for feedback aggregation and effective retransmission scoping with minimal router support. We present two protocols, one for packet loss recovery and another for congestion control, and describe an experimental testbed where these have been implemented. Analytical and experimental results are used to demonstrate that the active services architecture improves resource usage, reduces latency for loss recovery, and provides TCP-friendly congestion control.", URL="http://www.comsoc.org/~ni/public/2000/jan/index.html", } @ARTICLE{Cort0001:Multimedia, AUTHOR="Aurelio La Corte and Alfio Lombardo and Sergio Palazzo", TITLE="Performance Analysis of a Multimedia Synchronization Mechanism Based on Buffer Compensation in a Mobile Environment", JOURNAL=mc2r, VOLUME=4, NUMBER=1, PAGES="34-47", MONTH=jan, YEAR=2000, ABSTRACT="In a mobile communication system network performance varies considerably when handovers occur. This occurrence strongly impacts the design of the buffer compensation based techniques usually used in the fixed communication environments for minimizing probability of asynchronism between the different media composing a multimedia session. This paper provides an analytical paradigm for dimensioning synchronization buffers at the interface node between the wired and the wireless networks when network delay varies during a multimedia session due to the user mobility. For this purpose, the factors related to terminal mobility which have to be taken into account in the design of a synchronization mechanism are briefly introduced and appropriate user-perceived Quality of Service parameters referring to the synchronization of multimedia services are also introduced.", URL="http://www.acm.org/sigmobile/MC2R/vol4\_toc.html#v4n1", } @ARTICLE{Cast0001:HMIPv6, AUTHOR="Claude Castelluccia", TITLE="{HMIPv6:} A Hierarchical Mobile {IPv6} Proposal", JOURNAL=mc2r, VOLUME=4, NUMBER=1, PAGES="48-59", MONTH=jan, YEAR=2000, ABSTRACT="The IETF Mobile IPv6 protocol has been developped to manage global (macro) mobility. It is not adapted to local (micro) mobility since it does not support any kind of hierarchy. This paper presents a hierarchical protocol, built on top of Mobile IPv6, that separates local mobility (within a site) from global mobility (across sites) management. Local handoffs are managed locally and transparently to a mobile node'correspondent hosts while global mobility is managed with Mobile IPv6. Our scheme is flexible (several levels of hierarchy can be used), scalable, interworks with Mobile IPv6 and can be deployed gradually.", URL="http://www.acm.org/sigmobile/MC2R/vol4\_toc.html#v4n1", } @ARTICLE{Alme0001:Evolution, AUTHOR="Kevin Almeroth", TITLE="The Evolution of Multicast: From the {MBone} to Interdomain Multicast to Internet2 Deployment", JOURNAL=ieeenet, VOLUME=14, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=36, ABSTRACT="Multicast communication -- the one-to-many or many-to-many delivery of data -- is a hot topic. It is of interest in the research community, among standards groups, and to network service providers. For all the attention multicast has received, there are still issues that have not been completely resolved. One result is that protocols are still evolving, and some standards are not yet finished. From a deployment perspective, the lack of standards has slowed progress, but efforts to deploy multicast as an experimental service are in fact gaining momentum. The question now is how long it will be before multicast becomes a true Internet service. The goal of this article is to describe the past, present, and future of multicast. Starting with the Multicast Backbone (MBone), we describe how the emphasis has been on developing and refining intradomain multicast routing protocols. Starting in the middle to late 1990s, particular emphasis has been placed on developing interdomain multicast routing protocols. We provide a functional overview of the currently deployed solution. The future of multicast may hinge on several research efforts that are working to make the provision of multicast less complex by fundamentally changing the multicast model. We briefly survey these efforts. Finally, attempts are being made to deploy native multicast routing in both Internet2 networks and the commodity Internet. We examine how multicast is being deployed in these networks.", URL="http://www.comsoc.org/~ni/public/2000/jan/index.html", } @ARTICLE{Whet0001:Overview, AUTHOR="Brian Whetten and Gursel Taskale", TITLE="An Overview of Reliable Multicast Transport Protocol {II}", JOURNAL=ieeenet, VOLUME=14, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=30, ABSTRACT="This document provides an overview of the Reliable Multicast Transport Protocol II, RMTP-II. RMTP-II is a reliable multicast protocol, designed to reliably and efficiently send data from a few senders to large groups of simultaneous recipients. It works over both symmetric networks and asymmetrical network topologies such as those provided by satellite, cable modem, or ADSL carriers. Before sending, each sender must connect with a trusted top node to receive permission and control parameters for its data stream. The top node provides network managers with a single point of control for the senders, allowing them to monitor and control the traffic being sent. RMTP-II builds on a rich field of existing work, and adds to it the following novel contributions. It differentiates the roles of the nodes in the protocol, provides algorithms for smoothing and control of the return (TRACK) traffic, and provides explicit support for highly asymmetrical networks. It provides explicit network management controls through a centralized point of control, a fully distributed membership protocol that enables positive confirmation of data delivery, and fault recovery algorithms which are integrated to the reliability semantics of the protocol. It includes a novel reliability level called time bounded reliability, and offers a unique combination of TRACKs, NACKs, and FEC for increased scalability and real-time performance. Finally, it integrates distributed algorithms for RTT calculation to each receiver, and provides automatic configuration of receiver nodes.", URL="http://www.comsoc.org/~ni/public/2000/jan/index.html", } @ARTICLE{Gemm0001:Fcast, AUTHOR="Jim Gemmell and Jim Gray and Eve Schooler", TITLE="Fcast Multicast File Distribution", JOURNAL=ieeenet, VOLUME=14, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=10, ABSTRACT={Reliable data multicast is problematic. ACK/NACK schemes do not scale to large audiences, and simple data replication wastes network bandwidth. Fcast, "file multicasting," combines multicast with forward error correction to address both these problems. Like classic multicast, Fcast scales to large audiences, and like other FEC schemes, it uses bandwidth very efficiently. Some of the benefits of this combination were known previously, but Fcast contributes new caching methods that improve disk throughput, and new optimizations for small file transfers. This article describes Fcast's design, implementation, and API.}, URL="http://www.comsoc.org/~ni/public/2000/jan/index.html", } @ARTICLE{Bae0001:Multicast, AUTHOR="Sang Bae and Sung Lee and Weilian Su and Mario Gerla", TITLE="The Design, Implementation, and Performance Evaluation of the On-Demand Multicast Routing Protocol in Multihop Wireless Networks", JOURNAL=ieeenet, VOLUME=14, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=32, ABSTRACT="Multicasting has emerged as one of the most focused areas in the field of networking. As the technology and popularity of the Internet grow, applications such as video conferencing that require the multicast feature are becoming more widespread. Another interesting recent development has been the emergence of dynamically reconfigurable wireless ad hoc networks to interconnect mobile users for applications ranging from disaster recovery to distributed collaborative computing. In this article we describe the On-Demand Multicast Routing Protocol for mobile ad hoc networks. ODMRP is a mesh-based, rather than conventional tree-based, multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain multicast group membership. We also describe our implementation of the protocol in a real laptop testbed.", URL="http://www.comsoc.org/~ni/public/2000/jan/index.html", } @ARTICLE{Diot0001:Deployment, AUTHOR="Christophe Diot and Brian N Levine and Bryan Lyles and Hassan Kassem and Doug Balensiefen", TITLE="Deployment Issues for the {IP} Multicast Service and Architecture", JOURNAL=ieeenet, VOLUME=14, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=41, ABSTRACT="IP multicast offers the scalable point-to-multipoint delivery necessary for using group communication applications on the Internet. However, the IP multicast service has seen slow commercial deployment by ISPs and carriers. The original service model was designed without a clear understanding of commercial requirements or a robust implementation strategy. The very limited number of applications and the complexity of the architectural design -- which we believe is a consequence of the open service model -- have deterred widespread deployment as well. We examine the issues that have limited the commercial deployment of IP multicast from the viewpoint of carriers. We analyze where the model fails and what it does not offer, and we discuss requirements for successful deployment of multicast services.", URL="http://www.comsoc.org/~ni/public/2000/jan/index.html", } @ARTICLE{Saha0001:Multicast, AUTHOR="Laxman Sahasrabuddhe and Biswanath Mukherjee", TITLE="Multicast Routing Algorithms and Protocols: A Tutorial", JOURNAL=ieeenet, VOLUME=14, NUMBER=1, MONTH=jan, YEAR=2000, REFERENCES=46, ABSTRACT="Multicasting is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locations. Recently, there has been an explosion of research literature on multicast communication. This work presents a tutorial-cum-survey of the various multicast routing algorithms and their relationship with multicast routing protocols for packet-switched wide-area networks. Our contribution should be of particular benefit to the generic networking audience (and, to a lesser extent, to the expert on this subject).", URL="http://www.comsoc.org/~ni/public/2000/jan/index.html", } @INPROCEEDINGS{Kend0001:Structure, AUTHOR="John Kender", TITLE="On the Structure and Analysis of Home Video", BOOKTITLE="Asian Conference on Computer Vision on Computer Vision and Pattern Recognition (ACCV)", MONTH=jan, YEAR=2000, LANGUAGE="English", } @ARTICLE{Mink0012:Combined, AUTHOR="Cyriel Minkenberg and Ton Engbersen", TITLE="A Combined Input and Output Queued Packet-Switched System Based on {PRIZMA} Switch-on-a-Chip Technology", JOURNAL=ieeecm, VOLUME=38, NUMBER=12, MONTH=jan, YEAR=2000, REFERENCES=16, ABSTRACT="A packet-switched system architecture based on the combination of a single-chip output-buffered switch element and input queues that sort arriving packets on a per-output-port basis is proposed. Scheduling is performed in a distributed two-stage approach. Independent arbiters at each of the inputs resolve input contention, whereas the output-buffered switch element resolves output contention. As a result of this distribution of functionality, complexity of the input arbiters is only linearly proportional to the number of output ports N, thus offering better scalability than purely input-buffered approaches that require complex centralized schedulers. Since the input queues are used as the main buffering mechanism, only a relatively small amount of memory (on the order of N2 packet locations) is required in the shared-memory switch, allowing high-throughput implementations. We present simulation results to demonstrate the high performance and robustness under bursty traffic achieved with the proposed system architecture. A practical implementation in the form of the PRIZMA family of switch chips is outlined, with emphasis on its versatility in scaling in terms of both port speed and number of ports, and its support for quality-of-service mechanisms.", URL="http://www.comsoc.org/ci1/private/2000/dec/minkenberg.html", } @TECHREPORT{Vica0001:Dependence, AUTHOR="Norbert Vicari and Stefan Köhler and Joachim Charzinski", TITLE="The Dependence of {Internet} User Traffic Characteristics on Access Speed", TYPE="Research Report", INSTITUTION="University of Würzburg, Institute of Computer Science", ADDRESS="Würzburg, Germany", NUMBER=246, MONTH=jan, YEAR=2000, KEYWORDS="traffic model; modem pool", ABSTRACT="A variety of Internet traffic characterization and source models already exist. Since the origin of the analyzed data differs, a comparison of the reported traffic characteristics is difficult. In this paper, we analyze an IP packet trace and relate the trace data to the user access speed recorded at the same time. The obtained characteristics are contrasted with a second data set measured within an ADSL field trial. This second data set represents a limit in Internet usage, since, the high speed access was provided free of charge. This comparison leads to some interesting insights showing whether and how the access speed influences the Internet user behavior and thus the generated source traffic. The derived Internet traffic characterization is a first step to a generalized parametric Internet traffic model.", URL="http://www-info3.informatik.uni-wuerzburg.de/TR/tr246.pdf", } @INPROCEEDINGS{Hend0001:Protocol, AUTHOR="Tristan Henderson and Saleem Bhatti", TITLE="Protocol-independent multicast pricing", BOOKTITLE=nossdav, ADDRESS="Chapel Hill, North Carolina, USA", PAGES="11-17", MONTH=jan, YEAR=2000, REFERENCES=32, ABSTRACT="Current multicast pricing proposals are dependent on specific routing protocols or require changes to the existing IP multicast model. Given that multicast has only seen limited deployment thus far, such schemes may become redundant if the multicast service model changes. We believe that instead of altering multicast delivery methods to suit particular pricing schemes, a multicast pricing scheme should be designed around the generic concept of multipoint communication, without depending on the underlying transmission methods. We highlight limitations of existing work in this area and present a work-in-progress; a framework that enables this separation between transmission and pricing.", URL="http://www.cs.ucl.ac.uk/staff/s.bhatti/papers/2000/nossdav2000/hb2000.pdf", } @BOOK{Will0001:Developing, AUTHOR="Beau Williamson", TITLE="Developing {IP} Multicast Networks: The definitive {GUide} to Designing and Deploying {CISCO} {IP} Multicast Networks", PUBLISHER="Cisco Press", ADDRESS="San Francisco", VOLUME="Volume 1", MONTH=jan, YEAR=2000, LANGUAGE="English", } @TECHREPORT{Euro0001:Universal, AUTHOR="{European Telecommunications Standards Institute}", TITLE="Universal Mobile Telecommunications System {{(UMTS)},} General {{UMTS}} Architecture", TYPE="3G TS", INSTITUTION="{European Telecommunications Standards Institute}", ADDRESS="Sophia Antipolis, France", NUMBER="23.101 version 3.0.1", MONTH=jan, YEAR=2000, LANGUAGE="English", KEYWORDS="3GPP; wireless; UMTS", } @INPROCEEDINGS{Cama0001:Novel, AUTHOR="Daniel Camara and Alfredo F. Loureiro", TITLE="A Novel Routing Algorithm for Ad Hoc Networks", BOOKTITLE="Thirty third Hawaii International Conference on System Sciences, HICSS-33", ADDRESS="Maui, Hawaii, USA", PAGES="4-7", NOTE="http://www.siam.dcc.ufmg.br/gedoc/papers/gpsalHICCS00.ps.gz", MONTH=jan, YEAR=2000, } @ARTICLE{Perk0001:Mobile, AUTHOR="Charles E. Perkins", TITLE="Mobile {IP} and the {IETF}", JOURNAL=mc2r, VOLUME=4, NUMBER=1, PAGES="7-12", MONTH=jan, YEAR=2000, LANGUAGE="English", } @ARTICLE{Mack0001:Mobile, AUTHOR="Joseph P. Macker and M. S. Corson", TITLE="Mobile Ad Hoc networking and the {IETF}", JOURNAL=mc2r, VOLUME=4, NUMBER=1, PAGES="13-16", MONTH=jan, YEAR=2000, LANGUAGE="English", } @ARTICLE{Lin0001:Health, AUTHOR="James Lin", TITLE="Health aspects of wireless communication: a real and present wireless danger", JOURNAL=mc2r, VOLUME=4, NUMBER=1, PAGES="17-18", MONTH=jan, YEAR=2000, LANGUAGE="English", } @ARTICLE{Bahl0001:Report, AUTHOR="Victor Bahl", TITLE="A report on the {IEEE} 802 plenary meeting Kauai, {HI,} {USA}", JOURNAL=mc2r, VOLUME=4, NUMBER=1, PAGES="20-25", MONTH=jan, YEAR=2000, LANGUAGE="English", } @ARTICLE{Bral0001:Wireless, AUTHOR="Richard C. Braley and Ian C. Gifford and Robert F. Heile", TITLE="Wireless personal area networks: an overview of the {IEEE} {P802.15} working group", JOURNAL=mc2r, VOLUME=4, NUMBER=1, PAGES="26-33", MONTH=jan, YEAR=2000, LANGUAGE="English", } @MISC{Parl00:Parlay, AUTHOR="The Parlay Group", TITLE="Parlay {API} Business Benefits White Paper", NOTE="Available at {http://www.parlay.org/20event/White\\_paperv2.01.doc}", DAYS=12, MONTH=jan, YEAR=2000, KEYWORDS="network;API;IN", ABSTRACT="The purpose of this document is to provide an introduction to the business benefits of the Parlay Application Programming Interface (API).", URL="http://www.parlay.org/20event/White\_paperv2.01.doc", } @INPROCEEDINGS{Hatf0001:Role, AUTHOR="Dale Hatfield", TITLE="The Role of Regulatory Issues in the {IP} Telephony Marketplace", BOOKTITLE="Carrier Class IP Telephony", INSTITUTION="Federal Communications Commission", ADDRESS="San Diego, California", DAYS=18, MONTH=jan, YEAR=2000, KEYWORDS="universal access; reciprocal compensation; communications assistance to law enforcement (CALEA)", } @INPROCEEDINGS{Plon0001:QoS, AUTHOR="Jonathon Plonka", TITLE="{QoS} on and off the network", BOOKTITLE="Carrier Class IP Telephony", INSTITUTION="Global Crossing Communications", ADDRESS="San Diego, California", DAYS=18, MONTH=jan, YEAR=2000, KEYWORDS="quality of service", ABSTRACT="Describes different combinations of diff-serv and int-serv.", } @INPROCEEDINGS{Lock0001:One, AUTHOR="Clayton Lockhart", TITLE="One Size Does Not Fit All: Migrating to an {IP-based} Network", BOOKTITLE="Carrier Class IP Telephony", INSTITUTION="AT\\&T Packet Operations Planning", ADDRESS="San Diego, California", DAYS=18, MONTH=jan, YEAR=2000, KEYWORDS="network architecture; voice quality; packet loss; reliability; restoration", ABSTRACT="Shows curve of MOS as a function of packet loss for G.711 and G.729. Network engineered not to exceed 2\% packet loss.", } @INPROCEEDINGS{Grad0001:Examining, AUTHOR="Steve Grady", TITLE="Examining solutions for {ATM/IP/SONET} interoperability", BOOKTITLE="Carrier Class IP Telephony", INSTITUTION="Marconi", ADDRESS="San Diego, California", DAYS=18, MONTH=jan, YEAR=2000, KEYWORDS="ATM; MPLS; SONET", } @INPROCEEDINGS{Stac0001:PacketCable, AUTHOR="Ronald J. Wocjik", TITLE="PacketCable Network Architecture", BOOKTITLE="Carrier Class IP Telephony", INSTITUTION="PacketCable", ADDRESS="San Diego, California", DAYS=18, MONTH=jan, YEAR=2000, KEYWORDS="packet cable; VoIP; Internet telephony", } @INPROCEEDINGS{Ravi0001:Carrier, AUTHOR="Ravi Ravishankar", TITLE="Carrier Class {IP} Telephony", BOOKTITLE="Carrier Class IP Telephony", INSTITUTION="Tekelec", ADDRESS="San Diego, California", DAYS=18, MONTH=jan, YEAR=2000, KEYWORDS="signaling network; Internet telephony; TALI; SCTP; SS7", } @INPROCEEDINGS{Kear0001:Building, AUTHOR="Paul Kerney", TITLE="Building the New Public Network", BOOKTITLE="Carrier Class IP Telephony", INSTITUTION="BT Telecommunicaciones", ADDRESS="San Diego, California", DAYS=18, MONTH=jan, YEAR=2000, KEYWORDS="Internet telephony", ABSTRACT="Describes Spanish trial VoIP network architecture.", } @INPROCEEDINGS{Gorg0001:Implications, AUTHOR="Ivan Gorgeon", TITLE="Implications of {VoIP} on the New Carrier Market", BOOKTITLE="Carrier Class IP Telephony", INSTITUTION="Networks Telephony Corporation", ADDRESS="San Diego, California", DAYS=18, MONTH=jan, YEAR=2000, KEYWORDS="Internet telephony", ABSTRACT="Graphs packet-switched voice minutes as fraction of total voice traffic. Claims 44,972 million voice minutes for 1999, growing to 219431 million in 2005, with packet-switched growing from 1,124 million to 83,384 million minutes.", } @INPROCEEDINGS{Bouc0001:Case, AUTHOR="Anja Bouch and M. Angela Sasse", TITLE="The case for predictable network service", BOOKTITLE="MMCN", INSTITUTION="UCL", ADDRESS="San Jose, California", PAGES="188-195", DAYS=24, MONTH=jan, YEAR=2000, REFERENCES=23, KEYWORDS="Quality of service; predictability", ABSTRACT="Shared networks are now able to support a wide range of applications, including real-time multimedia. This has led the networking community to consider a wider range of network Quality of Service (QoS) guarantees and pricing schemes. To date, the QoS required by networked multimedia applications has been described in terms of technical parameters. We argue that, in order to maximize the realized quality of any network, the QoS requirements of networked multimedia applications should be based on the value that users ascribe to the media quality they receive in the context of a particular task. This argument is supported with results from a set of studies in which users' perceptions of media quality was investigated for a listening task. We found that users' expectancies of quality directly influenced their ratings: low expectancies produce higher ratings for the same level of objective quality - provided that quality is predictable. In conclusion, we outline the implications of our studies for the design of networked multimedia applications and the network services that support them.", URL="http://www.cs.ucl.ac.uk/staff/A.Bouch/mmcn.ps", } @INPROCEEDINGS{Pluk0001:User, AUTHOR="Mike Pluke", TITLE="User identification solutions in converging networks", BOOKTITLE="Report of IP-Telecoms Interworking Workshop (Numbering, Naming, Addressing and Routing)", INSTITUTION="Castle Consulting", ADDRESS="Geneva, Switzerland", PAGES="IPW-10", DAYS=25, MONTH=jan, YEAR=2000, KEYWORDS="naming; numbering; E.164", ABSTRACT="Describes naming mechanisms for Internet telephony.", URL="http://www.itu.int/ITU-T/ip-telecoms/presentations/ipw-10.ppt", } @TECHREPORT{Zave0001:DFC, AUTHOR="Pamela Zave and Michael Jackson", TITLE="{DFC} modifications I (Version 2): Routing extensions", INSTITUTION="AT\\&T Research Lab", NOTE="At http://www.research.att.com/\~{}pamela/x1.ps", DAYS=28, MONTH=jan, YEAR=2000, ABSTRACT="Distributed Feature Composition (DFC) is a virtual architecture for the description of telecommunication services. It was designed for feature modularity, structured feature composition, analysis of feature interactions, and separation of service and transmission layers. This memorandum describes the extensions to DFC routing needed to accommodate open telecommunication systems, mobile telecommunication users, multimedia telecommunication services, and unified messaging. We give examples of these and other popular services, described within the DFC architecture.", URL="http://www.research.att.com/~pamela/x1.ps", } @ARTICLE{Gafs0002:Modeling, AUTHOR="Jamel Gafsi and Ernst Biersack", TITLE="Modeling and Performance Comparison of Reliability Strategies for Distributed Video Servers", JOURNAL=ieeepds, MONTH=feb, YEAR=2000, KEYWORDS="large scale video servers; reliability modeling; cost; performance", ABSTRACT="Large scale video servers are typically based on disk arrays that comprise multiple nodes and many hard disks. Due to the large number of components, disk arrays are susceptible to disk and node failures that can affect the server reliability. Therefore, fault-tolerance must be already addressed in the design of the video server. For fault-tolerance, we consider parity-based as well as mirroring-based techniques with various distribution granularities of the redundant data. We identify several reliability schemes and compare them in terms of the server reliability and per stream cost. To compute the server reliability, we use continuous time Markov chains that are evaluated using the SHARPE software package. Our study covers independent disk failures and dependent component failures. We propose a new mirroring scheme called Grouped One-to-One scheme that achieves the highest reliability among all schemes considered. The results of this paper indicate that dividing the server into independent groups achieves the best compromise between the server reliability and the cost per stream. We further find that the smaller the group size, the better the trade-off between a high server reliability and a low per stream cost.", URL="http://www.eurecom.fr/~btroup/BPublished/", } @TECHREPORT{Maxe0002:Internet, AUTHOR="N. F. Maxemchuk and D. H. Shur", TITLE="An {Internet} Multicast System for the Stock Market", INSTITUTION="AT\\&T Labs", ADDRESS="Florham Park, New Jersey", NUMBER="cs.NI/0002011", MONTH=feb, YEAR=2000, KEYWORDS="Networking and Internet Architecture; multicast applications", ABSTRACT="We are moving toward a distributed, international, twenty-four hour, electronic stock exchange. The exchange will use the global Internet, or internet technology. This system is a natural application of multicast because there are a large number of receivers that should receive the same information simultaneously. The data requirements for the stock exchange are discussed. The current multicast protocols lack the reliability, fairness, and scalability needed in this application. We describe a distributed architecture together with a reliable multicast protocol, a modification of the RMP protocol, that has characteristics appropriate for this application. The architecture is used in three applications: In the first, we construct a unified stock ticker of the transactions that are being conducted on the various physical and electronic exchanges. Our objective is to deliver the same combined ticker reliably and simultaneously to all receivers, anywhere in the world. In the second, we construct a unified sequence of buy and sell offers that are delivered to a single exchange or a collection of exchanges. Our objective is to give all traders the same fair access to an exchange independent of their relative distances to the exchange or the loss characteristics of the international network. In the third, we construct a distributed, electronic trading floor that can replace the current exchanges. This application uses the innovations from the first two applications to combine their fairness attributes.", URL="http://arXiv.org/abs/cs/0002011", } @TECHREPORT{Zhao0002:Internet, AUTHOR="Weibin Zhao and David Olshefski and Henning Schulzrinne", TITLE="{Internet} Quality of Service: an Overview", TYPE="Technical Report", INSTITUTION="Columbia University", ADDRESS="New York, New York", NUMBER="CUCS-003-00", MONTH=feb, YEAR=2000, REFERENCES=36, ABSTRACT="This paper presents an overview of Internet QoS, covering motivation and considerations for adding QoS to Internet, the definition of Internet QoS, traffic and service specifications, IntServ and DiffServ frameworks, data path operations including packet classification, shaping and policing, basic router mechanisms for supporting QoS, including queue management and scheduling, control path mechanisms such as admission control, policy control and bandwidth brokers, the merging of routing and QoS, traffic engineering, constraint-based routing and multiprotocol label switching (MPLS), as well as end host support for QoS. We identify some important design principles and open issues for Internet QoS.", URL="http://www.cs.columbia.edu/~library/TR-repository/reports/reports-2000/cucs-003-00.ps.gz", } @ARTICLE{Cram0002:Video, AUTHOR="Christopher Cramer and Erol Gelenbe", TITLE="Video Quality and Traffic {QoS} in Learning-Based Subsampled and Receiver-Interpolated Video Sequences", JOURNAL=ieeejsac, VOLUME=18, NUMBER=2, PAGES="150-166", MONTH=feb, YEAR=2000, REFERENCES=56, KEYWORDS="Neural networks; receiver-based interpolation; subsampling; video compression", ABSTRACT="Sources of real-time traffic are generally highly unpredictable with respect to the instantaneous and average load which they create. Yet such sources will provide a significant portion of traffic in future networks, and will significantly affect the overall performance of and quality of service. Clearly high levels of compression are desirable as long as video quality remains satisfactory, and our research addresses this key issue with a novel learning-based approach. We propose the use of neural networks (NN's) as post-processors for any existing video compression scheme. The apporoach is to interpolate video sequences and compensate for frames which may have been lost or deliberately dropped. We show that deliberately dropping frames will significantly reduce the amount of offered traffic in the network, and hence the cell loss probability and network congestion, while the NN post-processor will preserve most of the desired video quality. Dropping frames at the sender or in the network is also a fast way to react to network overload and reduce congestion. Our interpolation techniques at the receiver, including neural network-based algorithms, provide output frame rates which are identical to (or possibly higher than) the original video sequence's frame rate. The resulting video quality is essentially equivalent to the sequence without frame drops, despite the loss of a significant fraction of the frames. Experimental evaluation using real video sequences is provided for interpolation with a connexionist NN using the backpropagation learning algorithm, the random NN (RNN) in a feed-forward configuration with its associated learning algorithm, and cubic spline interpolation. The experiments show that when more frames are being dropped or lost, the RNN performs generally better than the other techniques in terms of resulting video quality and overall performance. When the fraction of dropped frames is small, cubic splines offer better performance. Experimental data shows that this receiver-reconstructed subsampling technique significantly reduces the cell loss rates in an asynchronous transfer mode switch for different buffer sizes and service rates.", } @ARTICLE{Ali0002:Media, AUTHOR="Zafar Ali and Arif Ghafoor and C.-H. Lee", TITLE="Media Synchronization in Multimedia Web Using a Neuro-Fuzzy Framework", JOURNAL=ieeejsac, VOLUME=18, NUMBER=2, PAGES="168-182", MONTH=feb, YEAR=2000, REFERENCES=16, KEYWORDS="Dynamic scheduling; fuzzy logic; multimedia synchronization; multimedia web; neuro-fuzzy scheduler (NFS); resource control; workload characterization", ABSTRACT="In this paper, we consider the problem of multimedia synchronization in a Web environment. The workload generated by the multimedia server during a Web session exhibits variations that are quite different from the traffic fluctuation offered by a single media stream, e.g., a variable bit rate (VBR) video. We propose a set of parameters that can be used to characterize the workload generated by the multimedia server in a Web-type browsing environment. The workload characterization scheme is subsequently used in designing a server-based synchronization scheme. The problem of scheduling multimedia information to ensure media synchronization in a Web environment is identified as a multicriteria scheduling problem, which is NP-hard. The ability of fuzzy control to deal with multivariables makes it a good alternative for the multicriteria scheduling problem considered in this paper. Consequently, we propose a neuro-fuzzy scheduler (NFS) that makes an intelligent compromise among multicriteria by properly combining some scheduling heuristics. Perfomrance of the NFS is compared with several known heuristics and a branch and bound algorithm. The results show that the proposed NFS can dynamically adjust to the varying workload quite well.", } @ARTICLE{Ren0002:Real, AUTHOR="Qiang Ren and Gopalakrishnan Ramamurthy", TITLE="A Real-Time Dynamic Connection Admission Controller Based On Traffic Modeling, Measurement, and Fuzzy Logic Control", JOURNAL=ieeejsac, VOLUME=18, NUMBER=2, PAGES="184-195", MONTH=feb, YEAR=2000, REFERENCES=31, KEYWORDS="Connection admission-control; fuzzy logic control; traffic measurements; QoS maintenance", ABSTRACT="Broad-band networks based on asynchronous transfer mode (ATM) have to support traffic with widely different traffic characteristics and quality of service requirement. In this paper, we extend our earlier work in and develop adynamic connection admission controller (CAC) that supports cell loss requirements. The CAC algorithm explicitly computes the equivalent bandwidth required to support each class of connections based on on-line observations of aggregate traffic statistics as well as the declared parameters. We use Gaussian and diffusion approximations to characterize the aggragate traffic stream, and use fuzzy control strategy to combine model and measurement results to derive simple closed-form formulas to estimate the equivalent bandwidth in real time. We validate the proposed algorithms for various variable bit-rate traffic profiles and show that the system utilization can be substantially improved by appropriately tuning the fuzzy logic controller to combine traffic characteristics deduced from the declared parameters and traffic measurements.", } @ARTICLE{Marb0002:Call, AUTHOR="Peter Marbach and Oliver Mihatsch and John N. Tsitsiklis", TITLE="Call Admission Control and Routing in Integrated Services Networks Using Neuro-Dynamic Programming", JOURNAL=ieeejsac, VOLUME=18, NUMBER=2, PAGES="197-207", MONTH=feb, YEAR=2000, REFERENCES=27, KEYWORDS="ART neural networks; communication system control; communication system routing; dynamic programming; Markov processes", ABSTRACT="We consider the problem of call admission control (CAC) and routing in an integrated services network that handles several classes of calls of different value and with different resource requirements. The problem of maximizing the average value of admitted calls per unit time (or of revenue maximization) is naturally formulated as a dynamic programming problem, but is too complex to allow for an exact solution. We use methods of neuro-dynamic programming (NDP) [reinforcement learning (RL)], together with a decomposition approach, to construct dynamic (state-dependent) call admission control and routing policies. These policies are based on state-dependent link costs, and a simulation-based learning method is employed to tune the parameters that define these link costs. A broad set of experiments shows the robustness of our policy and compares its performance with a commonly used heuristic.", } @ARTICLE{Tong0002:Adaptive, AUTHOR="Hui Tong and Timothy Brown", TITLE="Adaptive Call Admission Control Under Quality of Service Constraints: A Reinforcement Learning Solution", JOURNAL=ieeejsac, VOLUME=18, NUMBER=2, PAGES="209-220", MONTH=feb, YEAR=2000, REFERENCES=26, KEYWORDS="Broad-band communication; call admission control (CAC); communication system control; communication system routing; networks; quality of service (QoS); reinforcement learning; semi-Markov decision process; traffic control (communication)", ABSTRACT="In this paper, we solve the adaptive call admission control (CAC) problem in multimedia networks via reinforcement learning (RL). The problem requires that network revenue be maximized while simultaneously meeting qualityofservice (QoS) constraints that forbid entry into certain states and use of certain actions. We show that RL provides a solution to this constrained semi-Markov decision problem and is able to earn significantly higher revenues than alternative heuristics. Unlike other model-based algorithms, RL does not require the explicit state transition models to solve the decision problems. This feature is very important if one considers large integrated service networks supporting a number of different service types, where the number of states is so large that model-based optimization algorithms are infeasible. Both packet-level and call-level QoS constraints are addressed, and both conservative and aggressive approaches to the QoS constraints are considered. Results are demonstrated on a single link and extended to routing on a multilink network.", } @ARTICLE{Davo0002:Two, AUTHOR="Franco R Davoli and Piergiulio Maryni", TITLE="A Two-Level Stochastic Approximation for Admission Control and Bandwidth Allocation", JOURNAL=ieeejsac, VOLUME=18, NUMBER=2, PAGES="222-233", MONTH=feb, YEAR=2000, REFERENCES=32, KEYWORDS="Access control; broad-band communication; communication system control; multimedia communication; multiplexing; neural networks; resource management", ABSTRACT="In an access node to a multiservice network, e.g., a base station in an integrated services cellular wireless netowrk, or the optical line terminal (OLT) in a broad-band passive optical network (PON), the output link bandwidth is adaptively assigned to different users and dynamically shared between isochronous (guaranteed bandwidth) and asynchronous traffic types. The bandwidth allocation is effected by an admission controller, whose goal is to minimize the refusal rate of connection requests as well as the loss probability of cells queued in a finite buffer. Optimal admission control strategies are approximated by means of backpropagation feedforward neural networks, acting on the embedded Markov chain of the connection dynamics; the neural networks operate in conjunction with a higher level bandwidth allocation controller, which performs a stochastic optimization algorithm. The case of unknown, slowly varying input rates is explicitly considered. Numerical results are presented that evaluate the approximation and the ability to adapt to parameter variations", } @ARTICLE{Kass0002:Hybrid, AUTHOR="Ioannis E. Kassotakis and Maria E. Markaki and Athanasios Vasilakos", TITLE="A Hybrid Genetic Approach for Channel Reuse in Multiple Access Telecommunications Networks", JOURNAL=ieeejsac, VOLUME=18, NUMBER=2, PAGES="234-242", MONTH=feb, YEAR=2000, REFERENCES=24, KEYWORDS="Channel reuse; hybrid genetic algorithm; NP-complete; isochronous service", ABSTRACT="The evolving broadband integrated services digital network is reinforcing the demand for high-speed and high-performance multiple access networks. The number of channels available to support the isochronous traffic in these networks is limited by technology, due to implementation costs. We introduce a method using channel sharing/reusing in an effort to provide efficient management of isochronous traffic under this limitation. The proposed method is based on a hybrid genetic algorithm and aims to accomplish the establishment of a maximal number of connections with the minimal number of isochronous channels. Experimental results are provided and they are compared with those for a deterministic graph coloring algorithm. The performance of the proposed algorithm in all simulation runs reveals the robustness, the flexibility and the efficiency of using evolutionary approaches to complex real-world problems.", } @ARTICLE{Bian0002:Programmable, AUTHOR="Giuseppe Bianchi and Andrew T Campbell", TITLE="A Programmable {MAC} Framework for Utility-Based Adaptive Quality of Service Support", JOURNAL=ieeejsac, VOLUME=18, NUMBER=2, PAGES="244-255", MONTH=feb, YEAR=2000, REFERENCES=23, KEYWORDS="Medium access control; programmable networks; quality of service", ABSTRACT="We describe the design and evaluation of a programmable medium access control framework which is based on a hybrid centralized/distributed data link controller. The programmable framework and its associated algorithms are capable of supporting adaptive real-time applications over time-varying and bandwidth limited networks (e.g., wireless networks) in a fair and efficient manner taking into account application-specific adaptation needs. The framework is flexible, extensible and supports the dynamic introduction of new adaptive services on-demand. As part of the service creation process, applications interact with a set of distributed adaptation handlers to program services without the need to upgrade the centralized adaptation controller. This approach is in contrast to existing techniques that offer a fixed set of ''hard-wired`` services at the data link from which applications select. We present a framework where a centralized adaptation controller responsible for the fair allocation of available bandwidth among adaptive applications is driven by application specific bandwidth utility curves. A set of distributed adaptation handlers execute at edge devices interacting with a central controller allowing applications to program their adaptation needs in terms of utility curves, adaptation time scales and adaptation policy. The central controller offers a set of simple meta-services called ''profiles`` that distributed handlers use to build sophisticated adaptive real-time services.", } @ARTICLE{Meer0002:Programmable, AUTHOR="Hermann de Meer and Aurelio La Corte and Antonio Puliafito and Orazio Tomarchio", TITLE="Programmable Agent for Flexible {QoS} Management in {IP} Networks", JOURNAL=ieeejsac, VOLUME=18, NUMBER=2, PAGES="256-266", MONTH=feb, YEAR=2000, REFERENCES=31, KEYWORDS="Adaptation; customer policies; quality-of-service (QoS); RSVP; software agents; underreservation", ABSTRACT="Network programmability seems to be a promising solution to network management and quality of service (QoS) control. Software mobile-agents technology is boosting the evolution toward application-level control of network functionalities. Code may be deployed in the network dynamically and on demand for the benefit of applications or application classes. Agents support a dynamic distribution of control and management functions across networks, thus increasing flexibility and efficiency. We propose to use mobile-agent technology to overcome some of the problems inherent in current Internet technology. We focus our attention to QoS monitoring, being locally significant in network subdomains, and realize a QoS managment strategy in response to variations of user, customer of application requirements, and of the network state. We describe our experience and the results obtained from our testbed, where software agents are instantiated, executed, migrated, and suspended in order to implement flexible QoS management in IP networks.", } @ARTICLE{Sher0002:Adaptive, AUTHOR="Mahmoud Sherif and Ibrahim Habib and Mahmoud Nagshineh and Parviz Kermani", TITLE="Adaptive Allocation of Resources and Call Admission Control for Wireless {ATM} Using Genetic Algorithms", JOURNAL=ieeejsac, VOLUME=18, NUMBER=2, PAGES="268-281", MONTH=feb, YEAR=2000, REFERENCES=29, KEYWORDS="ATM; bandwidth allocation; genetic algorithms; multimedia streams; quality of service; traffic management; wireless networks", ABSTRACT="In wireless ATM-based networks, admission control is required to reserve resources in advance for calls requiring guaranteed services. In the case of a multimedia call, each of its substreams (i.e., video, audio, and data) has its own distinct quality of service (QoS) requirements (e.g., cell loss rate, delay, jitter, etc.). The network attempts to deliver the required QoS by allocating an appropriate amount of resources (e.g., bandwidth, buffers). The negotiated QoS requirements constitute a certain QoS level that remains fixed during the call (static allocation approach). Accordingly, the corresponding allocated resources also remain unchanged. In this paper, we present and analyze an adaptive allocation of resources algorithm based on genetic algorithms. In contrast to the static approach, each substream declares a preset range of acceptable QoS levels (e.g., high, medium, low) instead of just a single one. As the availability of resources in the wireless network varies, the algorithm selects the best possible QoS level that each substream can obtain. In case of congestion, the algorithm attempts to free up some resources by degrading the QoS levels of the existing calls to lesser ones. This is done, however, under the constraint of achieving maximum utilization of the resources while simultaneously distributing them fairly among the calls. The degradation is limited to a minimum value predefined in a user-defined profile (UDP). Genetic algorithms have been used to solve the optimization problem. From the user perspective, the perception of the QoS degradation is very graceful and happens only during overload periods. The network services on the other hand, are greatly enhanced due to the fact that the call blocking probability is significantly decreased. Simulation results demonstrate that the proposed algorithm performs well in terms of increasing the number of admitted calls while utilizing the available bandwidth fairly and effectively.", } @ARTICLE{Chan0002:Fuzzy, AUTHOR="Chung-Ju Chang and Bo-Wei Chen and Terng-Yuan Liu and Fang-Ching Ren", TITLE="Fuzzy/Neural Congestion Control for Integrated Voice and Data {DS-CDMA/FRMA} Cellular Networks", JOURNAL=ieeejsac, VOLUME=18, NUMBER=2, PAGES="283-292", MONTH=feb, YEAR=2000, REFERENCES=12, KEYWORDS="Congestion control; direct sequence-code division multiple access/frame reservation multiple access (DS-CDMA/FRMA); cellular networks; fuzzy/neural techniques", ABSTRACT="The paper proposes congestion control using fuzzy/neural techniques for integrated voice and data direct-sequence code division multiple access/frame reservation multiple access (DS-CDMA/FRMA) cellular networks. The fuzzy/neural congestion controller is constituted by a pipeline recurrent neural network (PRNN) interference predictor, a fuzzy performance indicator, and a fuzzy/neural access probability controller. It regulates traffic input to the integrated voice and data DS-CDMA/FRMA cellular system by determining proper access probabilities for users so that congestion can be avoided and throughput can be maximized. Simulation results show that the DS-CDMA/FRMA fuzzy/neural congestion controllers perform better than conventional DS-CDMA/PRMA with channel access function in voice packet dropping ratio, corruption ratio, and utilization. In addition, the neural congestion controller outperforms the fuzzy congestion controller.", } @TECHREPORT{Odly0002:Util, AUTHOR="Andrew Odlyzko", TITLE="The {Internet} and other networks: Utilization rates and their implications", TYPE="Technical Report", INSTITUTION="AT\\&T Labs", ADDRESS="Florham Park, NJ", MONTH=feb, YEAR=2000, KEYWORDS="Internet; utilization", ABSTRACT="Costs of communications networks are determined by the maximal capacities of those networks. On the other hand, the traffic those networks carry depends on how heavily those networks are used. Hence utilization rates and utilization patterns determine the costs of providing services, and therefore are crucial in understanding the economics of communications networks. A comparison of utilization rates and costs of various networks helps disprove many popular myths about the Internet. Although packet networks are often extolled for the efficiency of their transport, it often costs more to send data over internal corporate networks than using modems on the switched voice network. Packet networks are growing explosively not because they utilize underlying transport capacity more efficiently, but because they provide much greater flexibility in offering new services. Study of utilization patterns shows there are large opportunities for increasing the efficiency of data transport and making the Internet less expensive and more useful. On the other hand, many popular techniques, such as some Quality of Service measures and ATM, are likely to be of limited usefulness.", URL="http://www.research.att.com/~amo/doc/complete.html", } @ARTICLE{Bald0002:Adaptive, AUTHOR="Mario Baldi and Yoram Ofek and Bülent Yener", TITLE="Adaptive group multicast with time-driven priority", JOURNAL=ieanep, VOLUME=8, NUMBER=1, PAGES="31-43", MONTH=feb, YEAR=2000, REFERENCES=14, ABSTRACT="This paper shows how to provide an adaptive real-time group multicast (many-to-many) communication service. Adaptive means that the number of nodes that transmit to the multicast group is continuously changing. In order to meet deterministic quality-of-service (QoS) requirements of a real-time group multicast, some communication resources are reserved. In this work we show 1) how bandwidth is reserved for each multicast group and 2) how an active source can dynamically share the bandwidth allocated to this multicast group with other active group members. Quality-of-service support for a real-time multicast group is based on time-driven priority [9]. In this scheme the time is divided into time frames of fixed duration, and all the time frames are aligned by using a common global time reference, which can be obtained from the global positioning system. Bandwidth is allocated to a multicast group as a whole, rather than individually to each user. The allocation is done by reserving time intervals within time frames in a periodic fashion. This type of allocation raises two problems that are studied in this paper: 1) scheduling: how time intervals are reserved to each multicast group and 2) adaptive sharing: how the active (transmitting) participants can dynamically share the time intervals that have been reserved for their multicast group. The proposed approach is based on the embedding of multiple virtual rings, on for each multicast group. By using the virtual rings, it is simple to route messages to all the participants while minimizing the bound on the buffer sizes and queueing delays. The finalpart of this paper introduces a scalable growth of the multicast group by adding multiple subtrees to the virtual ring.", URL="http://www.acm.org/pubs/articles/journals/ton/2000-8-1/p31-baldi/p31-baldi.pdf, http://www.polito.it/~baldi/publications/ToN98b.ps.gz", } @INPROCEEDINGS{Xu0002:MeGaDiP, AUTHOR="Dongyan Xu and Klara Nahrstedt and D. Wichadakul", TITLE="MeGaDiP: a wide-area media gateway discovery protocol", BOOKTITLE="IEEE IPCCC", MONTH=feb, YEAR=2000, } @ARTICLE{Want0002:Remembering, AUTHOR="Roy Want", TITLE="Remembering Mark Weiser: Chief Technologist, Xerox {PARC}", JOURNAL=ieeepcm, VOLUME=7, NUMBER=1, MONTH=feb, YEAR=2000, REFERENCES=19, KEYWORDS="mobile networks", ABSTRACT="In the twenty-first century the technology revolution will move into the everyday, the small and the invisible. The impact of technology will increase ten-fold as it is imbedded in the fabric of everyday life. As technology becomes more imbedded and invisible, it calms our lives by removing annoyances while keeping us connected with what is truly important. This imbedding, this invisibility, this radical ease-of-use requires radical innovations in our connectivity infrastructure. This article describes the interplay and dependencies between invisibly calming technology and the new pervasive connectivity infrastructure.", URL="http://www.comsoc.org/pci/private/2000/feb/Want.html", } @ARTICLE{Will0002:IrDA, AUTHOR="Stuart Williams", TITLE="IrDA: Past, Present and Future", JOURNAL=ieeepcm, VOLUME=7, NUMBER=1, MONTH=feb, YEAR=2000, REFERENCES=20, KEYWORDS="mobile networks", ABSTRACT="The core Internet technologies were in the hands of the research community 10 or more years before the World Wide Web happened and popularized the Internet as a place to find information, access service, and trade. The Infrared Data Association has been in existence for over six years. Products embedding the communication technology IrDA defines have been around for over five years, starting with printers and portable PCs. IrDA is cheap to embed, uses unregulated spectrum, and is increasingly pervasive in a wide range of devices. From its roots in portable PCs and printers, IrDA technology is present in virtually all new PDAs, it is emerging in mobile phones, pagers, digital cameras, and image capture devices. We are sitting on the cusp of the information appliance age, and IrDA is playing a significant role in enabling the interaction between information appliances, between information appliances and the information infrastructure, and between appliances communicating across the information infrastructure. This article discusses IrDA's communications model. It charts the evolution of the IrDA-Data (1.x) platform architecture, and the early applications and application services now in common use. It considers the present day and the explosion in device categories embedding the IrDA platform. It broadens its horizons to consider other emerging appliances technologies and to consider communications models that might arise from a blend of IrDA short-range wireless communications and mobile object technologies. Finally, it briefly considers future directions for the IrDA platform itself.", URL="http://www.comsoc.org/pci/private/2000/feb/Williams.html", } @ARTICLE{Negu0002:HomeRF, AUTHOR="Kevin J. Negus and Adrian Stephens and Jim Lansford", TITLE="HomeRF: Wireless Networking for the Connected Home", JOURNAL=ieeepcm, VOLUME=7, NUMBER=1, MONTH=feb, YEAR=2000, ABSTRACT="The SWAP specification for wireless voice and data networking within the home will enable a new class of mobile consumer devices that draw from the power and content of the Internet and the home PC. If cable modems and xDSL represent the", } @ARTICLE{Haar0002:Bluetooth, AUTHOR="Jaap Haartsen", TITLE="The Bluetooth Radio System", JOURNAL=ieeepcm, VOLUME=7, NUMBER=1, MONTH=feb, YEAR=2000, REFERENCES=9, KEYWORDS="mobile networks", ABSTRACT="A few years ago it was recognized that the vision of a truly low-cost, low-power radio-based cable replacement was feasible. Such a ubiquitous link would provide the basis for portable devices to communicate together in an ad hoc fashion by creating personal area networks which have similar advantages to their office environment counterpart, the local area network. Bluetooth(TM) is an effort by a consortium of companies to design a royalty-free technology specification enabling this vision. This article describes the radio system behind the Bluetooth concept. Designing an ad hoc radio system for worldwide usage poses several challenges. The article describes the critical system characteristics and motivates the design choices that have been made.", URL="http://www.comsoc.org/pci/private/2000/feb/Haartsen.html", } @ARTICLE{Siep0002:Paving, AUTHOR="Thomas M. Siep and Ian C. Gifford and Richard C. Braley and Robert F. Heile", TITLE="Paving the Way for Personal Area Network Standards: An Overview of the {IEEE} {P802.15} Working Group for Wireless Personal Area Networks", JOURNAL=ieeepcm, VOLUME=7, NUMBER=1, MONTH=feb, YEAR=2000, REFERENCES=2, KEYWORDS="mobile networks", ABSTRACT="The process of creating international standards is a mystery to most people, even to the technologists who use them every day. This article describes the origins and processes of the IEEE Project 802.15 Working Group for Wireless Personal Area Networks and their effort to bring standardization to the Bluetooth Specification. The committee of experts that comprises P802.15 is chartered with codifying the physical characteristics and protocols used to construct small, low-power, ad hoc networks used to wirelessly interconnect personal electronic devices.", URL="http://www.comsoc.org/pci/private/2000/feb/Gifford.html", } @ARTICLE{Nobl0002:System, AUTHOR="Brian Noble", TITLE="System Support for Mobile, Adaptive Applications", JOURNAL=ieeepcm, VOLUME=7, NUMBER=1, MONTH=feb, YEAR=2000, REFERENCES=14, KEYWORDS="mobile networks", ABSTRACT="Imagine that, while on a business trip to Paris, you decide to take a few extra days to sample the city's museums. When you buy your museum pass, you are given a virtual tour guide device -- a small PDA that can deliver information about specific pieces in the museum system as well as general information about the city. This device communicates via wireless networks. In or near a museum, the device has access to a high-speed micro-cellular network; in the rest of the city, it makes use of the GSM infrastructure. The user can ask this device to elaborate on specific sites or pieces, display related information, or perform geographically-based queries. These requests are satisfied by applications such as a customized Web browser and a video playback application. When within range of a museum's high-quality network, the displayed information is of excellent quality: images are at high resolution and color, and video is delivered in full motion. However, when the user strays away from the high-bandwidth network, each application degrades the quality of the data it delivers so that it arrives in a timely fashion.", URL="http://www.comsoc.org/pci/private/2000/feb/Noble.html", } @ARTICLE{Lau0002:Sojourn, AUTHOR="Wing Cheong Lau and Sanqi Li", TITLE="Sojourn-time analysis on nodal congestion in broadband networks", JOURNAL=cn, VOLUME=32, NUMBER=2, PAGES="125-147", MONTH=feb, YEAR=2000, KEYWORDS="sojourn-time analysis; nodal congestion; overload control; QoS specifications", ABSTRACT="In this paper, we study the sojourn-time statistics and the temporal behavior of nodal congestion in integrated broadband networks. The node is modeled as a finite quasi-birth-death (QBD) process with level-dependent transitions. By formulating the problem as one which is amenable to the generalized folding algorithm (GFA), we are, for the first time, able to analyze realistic systems with large buffer and complex input traffic. The dynamics of the system under realistic traffic environment and different operating regimes are studied. The effects of various modeling artifacts such as fluid-flow and infinite-buffer approximations are also investigated. The potential of statistical multiplexing in reducing bursty cell loss is demonstrated. The trade-offs between different system design alternatives, e.g., buffering vs. statistical multiplexing, are discussed. We also investigate the controlling effect of preemptive cell discarding on steady-state and transient system performance. Both single-level and two-level overload control with hysteresial-switching mechanisms are considered. The use of sojourn-time based QoS metrics to supplement long-term steady-state metrics is also discussed.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Choi0002:Priority, AUTHOR="Bong Dae Choi and Sung Ho Choi and Bara Kim and Dan Keun Sung", TITLE="Analysis of priority queueing system based on thresholds and its application to signaling system no. 7 with congestion control", JOURNAL=cn, VOLUME=32, NUMBER=2, PAGES="149-170", MONTH=feb, YEAR=2000, KEYWORDS="congestion control; SS7 network; MAP; generalized folding algorithm; QBD process; loss probability; mean delay", ABSTRACT="We analyze a priority queueing system with congestion control based on thresholds. A priority queue with a triple of thresholds consisting of an abatement threshold, an onset threshold and a discard threshold was investigated by San-qi Li. We extend Li's model to a priority queue with N triples of thresholds and obtain the stationary probabilities of queue length by using the Embedded Markov chain method. We obtain the loss probability and the mean delay of packet of each class. We apply our result to signaling system no. 7 network with a congestion control based on thresholds.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Krai0002:Stacked, AUTHOR="Belka Kraimeche", TITLE="Design and analysis of the Stacked-Banyan {ATM} switch fabric", JOURNAL=cn, VOLUME=32, NUMBER=2, PAGES="171-184", MONTH=feb, YEAR=2000, KEYWORDS="ATM switch; banyan fabric; output queuing; channel allocation", ABSTRACT="ATM switches in future broadband networks will be required to support multigigabits/sec port speeds. At such high switching speeds, space-division switch architectures are more competitive than currently implemented shared-memory switch architectures. In this paper, we present the design and analysis of a new switch architecture, named Stacked-Banyan (SB), which utilizes parallel Banyan planes and supports K QoS levels with output queuing. The Banyans are composed of 2Ú4 switching elements (SEs). The SE is implemented by 0.35´CMOS logic gates. Circuit simulations of the SE show satisfactory performance at 1 Gbps. The non-blocking behavior of the SB fabric is verified by VHDL. The proposed fabric uses output queuing to resolve contention. In general, the output buffer handles K QoS levels by K virtual queues. Focusing on the case K=2, we propose a buffer management and channel allocation strategy that can be adjusted to meet the delay and loss requirements of the two types of traffic. The output buffer is managed as two virtual queues, each handling a different traffic type. To meet the delay QoS of one traffic type, the channel is allocated to the respective queue with a probability that depends on the congestion level in that queue. We present a model and analysis of the output queues and calculate the waiting time and loss performance under two specific allocation strategies. The results indicate that the proposed channel allocation strategy is quite effective in maintaining a balance between the QoS objectives of the two traffic types.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Hou0002:Differentiated, AUTHOR="Yiwei Thomas Hou and Dapeng Oliver Wu and Bo Li and Takeo Hamada and Ishfaq Ahmad and Hung-Po Chao", TITLE="A differentiated services architecture for multimedia streaming in next generation {Internet}", JOURNAL=cn, VOLUME=32, NUMBER=2, PAGES="185-209", MONTH=feb, YEAR=2000, KEYWORDS="differentiated services; per hop behavior; scalability; best effort service; buffer management; multimedia streaming; next generation Internet", ABSTRACT="This paper presents a Differentiated Services (Diffserv or DS) architecture for multimedia streaming applications. Specifically, we define two types of services in the context of Assured Forwarding (AF) per hop behavior (PHB) that are differentiated in terms of reliability of packet delivery: the High Reliable (HR) service and the Less Assured (LA) service. We propose a novel node mechanism called Selective Pushout with Random Early Detection (SPRED) that is capable of simultaneously achieving the following four objectives: (1) a core router does not maintain any state information for each flow (i.e., core-stateless); (2) the packet sequence within each flow is not re-ordered at a node; (3) packets from HR service are delivered more reliably than packets from LA service at a node during congestion; and (4) packets from TCP traffic are dropped randomly to avoid global synchronization during congestion. We show that SPRED is a generalized buffer management algorithm of both tail-dropping and Random Early Detection (RED), and combines the best features of pushout (PO), RED and RED with In/Out (RIO) mechanisms. Simulation results demonstrate that under the same link speed and network topology, network nodes employing our Diffserv architecture have substantial performance improvement over the current Best Effort (BE) Internet architecture for multimedia streaming applications.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Siva0002:Reservation, AUTHOR="Vijay Sivaraman and George Rouskas", TITLE="A reservation protocol for broadcast {WDM} networks and stability analysis", JOURNAL=cn, VOLUME=32, NUMBER=2, PAGES="211-227", MONTH=feb, YEAR=2000, KEYWORDS="single-hop optical networks; wavelength division multiplexing (WDM); reservation protocols; markov modulated bernoulli process (MMBP)", ABSTRACT="We consider the problem of coordinating access to the various channels of a single-hop wavelength division multiplexing (WDM) network. We present a high performance reservation (HiPeR-) protocol specifically designed to overcome the potential inefficiencies of operating in environments with non-negligible processing, tuning, and propagation delays. HiPeR- differs from previous reservation protocols in that each control packet makes reservations for all data packets waiting in a node's queues, thus significantly reducing control overhead. Packets are scheduled for transmission using algorithms that can effectively mask the tuning times. HiPeR- also uses pipelining to mask processing times and propagation delays; parameter of the protocol is used to control the degree of pipelining. We use Markov chain theory to obtain a sufficient condition for the stability of the protocol. The stability condition provides insight into the factors affecting the operation of the protocol, such as the degree of load balancing across the various channels, and the quality of the scheduling algorithms. The analysis is fairly general, as it holds for MMBP-like arrival processes with any number of states, and for non-uniform destinations.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Ando0002:Maintenance, AUTHOR="Toshihiko Ando and Kaoru Takahashi and Yasushi Kato and Norio Shiratori", TITLE="Maintenance of mobile system ambients using a process calculus", JOURNAL=cn, VOLUME=32, NUMBER=2, PAGES="229-256", MONTH=feb, YEAR=2000, KEYWORDS="mobility; locality; -calculus; maintenance of mobile systems; intelligent transport systems", ABSTRACT="We propose a formal method to maintain mobile systems placed on dynamically changing environments in this paper. Recently about 200 million people use mobile phones and mobile terminals, and mobile systems have been very popular. Remarkable features of mobile systems like mobile telephone systems and intelligent transport systems (ITSs) are dynamical linking and effects of environments to behavior of systems. To formally specify these systems, -calculus is extended using the notion of a field, which is a formalization of constraints on communication among processes. Our goal is to find recovering damaged environments for preservation of connectivity among processes using this extension even if accidents occur.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Elmi0002:Technologies, AUTHOR="Jaafar Elmirghani and Hussein Mouftah", TITLE="Technologies and Architectures for Scalable Dynamic Dense {WDM} Networks", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=13, ABSTRACT="Wavelength-division multiplexing has been recognized for a number of years as a promising and applied technology that can be used to increase the aggregate system bit rate. Recently, more attention has been given to devices and technologies that can be exploited to enable WDM to move from being a pure transmission technology into a state where it can be applied in transparent all-optical networks. In particular, devices and technologies such as wavelength routing switches, switched sources, tunable sources, tunable filters, and wavelength converters have all been developed and demonstrated. This article gives a description of the technologies, subsystems, and network architectures that rely on multiple wavelengths to achieve full transparent all-optical connectivity joined, in many instances, with features like scalability, modularity, and survivability. Brief exposure is also given to most of the current WDM demonstrators.", URL="http://www.comsoc.org/ci/private/2000/feb/Elmirghani.html", } @ARTICLE{Golm0002:Differentiated, AUTHOR="Nada Golmie and Thomas D. Ndousse and David Su", TITLE="A Differentiated Optical Services Model for {WDM} Networks", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=12, ABSTRACT="This article addresses the issues of scalable end-to-end QoS in Metropolitan DWDM networks serving as transit networks for IP access networks. DWDM offering a few wavelengths has been deployed in the past in backbone networks to upgrade point-to-point transmission where sharing is based on coarse granularity. This type of DWDM backbone network, offering a few lightpaths, provides no support for QoS services traversing the network. As DWDM networks with larger numbers of wavelengths penetrate the datacentric metro environment, specific IP service requirements such as priority restoration, scalability, dynamic provisioning of capacity and routes, and support for coarse-grain QoS capabilities will have to be addressed in the optical domain in order to achieve end-to-end QoS over a DWDM network. We propose a QoS service model in the optical domain called differentiated optical services (DoS) based on a set of optical parameters that captures the quality and reliability of the optical lightpath.", URL="http://www.comsoc.org/ci/private/2000/feb/Golmie.html", } @ARTICLE{Voor0002:Superpon, AUTHOR="I. de Voorde and C. Dianne Martin and J. Vandewege and Xia-ping Qiu", TITLE="The {SuperPON} Demonstrator: An Exploration of Possible Evolution Paths for Optical Access Networks", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=10, ABSTRACT="Recently, an optical broadband access network called APON (ATM-based Passive Optical Network) has been standardized and its commercial deployment started. This article discusses possible evolution scenarios for the APON system with respect to bit rate, range, and splitting factor, leading to the SuperPON concept. Technical challenges encountered during the realization of the SuperPON demonstrator within the European ACTS project PLANET are discussed in detail. In addition, to illustrate when these technologies will become commercially viable, the major results of an economic-feasibility study are presented. Finally, the SuperPON integration in the pan-European trial of the ACTS PELICAN project is described.", URL="http://www.comsoc.org/ci/private/2000/feb/Vandevoorde.html", } @ARTICLE{Yao0002:Advances, AUTHOR="Shun Yao and Biswanath Mukherjee and Sudhir Dixit", TITLE="Advances in Photonic Packet Switching: An Overview", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=17, ABSTRACT="The current fast-growing Internet traffic is demanding more and more network capacity every day. The concept of wavelength-division multiplexing has provided us an opportunity to multiply network capacity. Current optical switching technologies allow us to rapidly deliver the enormous bandwidth of WDM networks. Photonic packet switching offers high-speed, data rate/format transparency, and configurability, which are some of the important characteristics needed in future networks supporting different forms of data. In this article we present some of the critical issues involved in designing and implementing all-optical packet-switched networks.", URL="http://www.comsoc.org/ci/private/2000/feb/Yao.html", } @ARTICLE{Bern0002:Complementary, AUTHOR="Yoram Bernet", TITLE="The Complementary Roles of {RSVP} and Differentiated Services in the Full-Service {QoS} Network", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=3, ABSTRACT="With the growth of the Internet and intranets, QoS technology that has been developed over a span of several years is quickly becoming more relevant. This article first defines QoS and introduces a taxonomy for QoS mechanisms. The evolution of several major QoS mechanisms is described with a special focus on RSVP and differentiated services. Special attention is paid to the role of the IETF in developing QoS mechanisms. We describe a QoS network that combines RSVP and differentiated services in a manner that realizes the benefits of each. We show that, in general, the adoption of increasingly sophisticated QoS mechanisms can enhance the ability of a network to offer high-quality service guarantees while simultaneously making efficient use of raw network resources. These mechanisms carry a cost in the form of increased overhead, which must be weighed against the benefits of the mechanism.", URL="http://www.comsoc.org/ci/private/2000/feb/Bernet.html", } @ARTICLE{Khan0002:Approaches, AUTHOR="Vimal Khanna", TITLE="Approaches to Improving Performance of {STREAMS-Based} Protocol Stacks", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=10, ABSTRACT="STREAMS kernel mechanisms are being used to implement networking protocols in a number of operating systems, like UNIX, Windows, and pSOS. STREAMS provides a number of desirable features for modular protocol stack implementation by defining a high degree of standardization for implementing protocol layer modules and for message transfer between the modules. But this strict layered and modular approach prevents flexibility in implementing techniques that can result in high performance. The original STREAMS-based stacks have shown very poor protocol performance. A number of improved techniques for implementing STREAMS-based protocol stacks have been suggested in the literature in the past few years. These techniques have resulted in high-performance STREAMS-based stacks that match the performance of BSD UNIX-based stacks. This article makes a study of these new approaches and discusses the performance gains achieved by them. These approaches can be used for implementing high-performance protocol stacks in the STREAMS kernel, over both uniprocessor and multiprocessor systems.", URL="http://www.comsoc.org/ci/private/2000/feb/Khanna.html", } @ARTICLE{Begu0002:Croatian, AUTHOR="Dinko Begusic and Gottfried Luderer and Algirdas Pakstas and Nikola Rozic", TITLE="The Croatian Way to the Next Millennium Telecommunications", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, URL="http://www.comsoc.org/ci/private/2000/feb/Gstedrozic.html", } @ARTICLE{Brli0002:Croatian, AUTHOR="Vladimir Brlic and Vlasta Zuric-Hudek and Juraj Buzolic and Nikola Rozic and Dinko Begusic", TITLE="The Croatian Telecommunications Way Toward the Communications Era", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=10, ABSTRACT="Recent years have brought interesting developments in the field of telecommunications all over the world. Countries in transition have experienced it in their own way. Croatia is an interesting example of such a country. After gaining independence in 1991 and setting course toward the open market economy, the development of telecommunications was particularly fast. Recent related legislative changes as well as changes in the ownership structure of Croatian telecom will surely have a significant impact on the future development of telecommunications in Croatia, which will be based on our own experiences as well as the experiences of other countries in transition and developed countries. The planning methodology will include the techno-economic evaluation of minimum-risk introductory routes for new services as defined within the European Union Projects. In this article an overview of the development of Croatian telecommunications during the '90s as well as plans for future development are presented. A comparison with other countries in development as well as with developed countries is given, too. In the second part of the article a survey of the development of telecommunications within the County of Split and Dalmatia, including economic aspects, is given. At the end of the article a brief overview of research and development activities is also given.", URL="http://www.comsoc.org/ci/private/2000/feb/Rozic.html", } @ARTICLE{Cari0002:New, AUTHOR="Antun Caric and Kristian Toivo", TITLE="New Generation Network Architecture and Software Design", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=8, ABSTRACT="This article deals with new telecommunications networks, the reasons for changes, and the options telecommunications are facing today. The new generation of network architecture is discussed, and two network evolution case studies are presented as well as the new role of powerful applications in the future development of networks. Special emphasis is on software research and development supporting this ``new telecom world.''", URL="http://www.comsoc.org/ci/private/2000/feb/Caric.html", } @ARTICLE{Vrdo0002:Fixed, AUTHOR="Marija Vrdoljak and Sasa Ivan Vrdoljak and Goran Skugor", TITLE="Fixed-Mobile Convergence Strategy: Technologies and Market Opportunities", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=10, ABSTRACT="Competition in the telecommunications market is growing rapidly. Therefore, network operators and service providers have to reform their marketing and service delivery strategies in order to be competitive in the broadband service market. A convergence strategy for fixed and mobile services via a standards-based IN platform may provide a step in the right direction. This article deals with evolutionary steps for convergence services and their benefits to network operators and customers. It presents possible migration paths from the existing GSM to UMTS. The article also provides a comparative analysis of the wireless technologies involved in this evolution.", URL="http://www.comsoc.org/ci/private/2000/feb/Vrdoljak.html", } @ARTICLE{Fran0002:EMA, AUTHOR="Domagoj Frank and Hrvoje Lucic and Miljenko Opsenica and Juraj Puksec and Mihaela Zic and Stanislav Brajkovic and Vlatka Maricic", TITLE="The {EMA} System: A {CTI-Based} E-Mail Alerting Service", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=10, ABSTRACT="The integration of Internet services and telephony services is a new area for the development of telecommunications services. One example is an e-mail alerting service that uses the telephony network for e-mail notification. The EMA System is a computer telephony integration (CTI) application that checks a user's mailbox on the mail server and informs him/her over the phone when new e-mail arrives, eliminating the need for permanent Internet connection. The EMA System has a Web-based interface, enabling the user to configure service parameters. The EMA System is developed as a distributed and concurrent application. It consists of seven modules: the console, Web interface, Web handler, controller, voice machine, database, and mail checker, using communication solutions based on COM technology. This article describes the structure of the EMA System, its implementation, and advantages for users.", URL="http://www.comsoc.org/ci/private/2000/feb/Puksec.html", } @ARTICLE{Vojn0002:Multimedia, AUTHOR="Milan Vojnovic and Nikola Rozic and Dinko Begusic and Jurica Ursic and Hrvoje Dujmic", TITLE="Multimedia Dictionary Network Application: Design and Implementation", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=12, ABSTRACT="Proficiency in foreign languages is essential for professionals from countries in transition. A multimedia dictionary Internet application may offer needed help in everyday activities as well as in distance-learning systems. A multimedia dictionary is considered as both a conventional dictionary tool and a distance-learning network application. In this article we analyze the architecture and implementation issues arising in the design and implementation of a multimedia dictionary network application. The application is considered multimedia since it is designed to support textual, visual, and audio information content. Practical implementation is shown to be feasible with current technology, but a lack of available multimedia standards has been recognized. This is why we have considered the existing standards as well as the standards in development. The application is developed in Java1 language, and may be run as either a standalone application or an applet. The latter entails accessibility in a ubiquitous manner to a large number of users. The application is intended for both non-native English users and professionals exposed to specific technical terminology.", URL="http://www.comsoc.org/ci/private/2000/feb/Ursic.html", } @ARTICLE{Srik0002:Soft, AUTHOR="Srikathyayani Srikanteswara and Jeffrey Reed and Peter M. Athanas and Robert Boyle", TITLE="A Soft Radio Architecture for Reconfigurable Platforms", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=10, ABSTRACT="While many soft/software radio architectures have been suggested and implemented, there remains a lack of a formal design methodology that can be used to design and implement these radios. This article presents a unified architecture for the design of soft radios on a reconfigurable platform called the layered radio architecture. The layered architecture makes it possible to incorporate all of the features of a software radio while minimizing complexity issues. The layered architecture also enables a methodology for incorporating changes and updates into the system. An example implementation of the layered architecture on actual hardware is presented in the article.", URL="http://www.comsoc.org/ci/private/2000/feb/Srikant.html", } @ARTICLE{Muro0002:Real, AUTHOR="David Murotake and John Oates and Alden Fuchs", TITLE="Real-Time Implementation of a Reconfigurable {IMT-2000} Base Station Channel Modem", JOURNAL=ieeecm, VOLUME=38, NUMBER=2, MONTH=feb, YEAR=2000, REFERENCES=15, ABSTRACT="Research suggests that joint methods combining smart antennas, RAKE reception, multi-user detection or other adaptive methods may be practically implemented for IMT-2000 channel modems using computationally simplified algorithms. Using software-defined radio methods, these modems can be employed in a new generation of adaptive multimode base stations which permit software reconfiguration from second- to third-generation air interfaces. Practical implementation is made possible by corresponding advances in hardware technology, including new processors and high-bandwidth I/O fabrics which replace traditional computer buses with their inherent limitations in bandwidth and scalability. In this article recent adaptive processing research is reviewed, implementation requirements for second- and third-generation base stations are considered, and the capabilities of selected new monolithic silicon devices are examined. A possible implementation approach for a reconfigurable multimode base station channel modem using SDR design methods is proposed.", URL="http://www.comsoc.org/ci/private/2000/feb/Murotake.html", } @ARTICLE{Enso0002:Accommodating, AUTHOR="J. R. Ensor and G. U. Carraro and John T. Edmark", TITLE="Accommodating performance limitations in distributed virtual reality systems", JOURNAL=comcom, VOLUME=23, NUMBER=3, PAGES="199-204", MONTH=feb, YEAR=2000, KEYWORDS="Simulation; Virtual reality systems; Performance limitations", ABSTRACT="The paper briefly describes a sports simulator called Peloton. Simulation participants exercise or compete within virtual reality environments that represent the roadways along which they appear to bicycle, run, or walk. The visual display of each racecourse is a composition of multiple three-dimensional sub-spaces, which are called regions. Some regions of a virtual world are made up of graphical objects, and other regions are made up of still images or video streams. The paper also describes ways of dealing with limited computation and communication resources in distributed virtual reality systems. The discussion focuses on systems that represent their virtual worlds as multiple regions. It introduces means of altering the visual representations of three-dimensional spaces according to the computing and communication resources available during a simulation. The size, placement and graphical complexity of the regions of a virtual world may be tailored according to static as well as dynamic configurations of system components. Finally, the paper presents ways in which a given view of a virtual worlda scenecan be used for extended periods during a simulation. This technique is useful when scene updates are delayed or missing.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/27/26/abstract.html", } @ARTICLE{Chan0002:Maximizing, AUTHOR="Edward Chang", TITLE="Maximizing {QoS} for interactive {DTV} clients", JOURNAL=comcom, VOLUME=23, NUMBER=3, PAGES="205-218", MONTH=feb, YEAR=2000, KEYWORDS="Digital TV; Error concealment; Disk scheduling; Memory management", ABSTRACT="In this study we present a client-based architecture that supports interactive DTV features (i.e. pause, replay and fast-forward) using the client's local disk and an Internet back-channel, together with the broadcast channels. Our study focuses on devising effective techniques for managing the client's local resources to maximize QoS. For individual video streams, we present an error concealment scheme that reconstructs video key frames suffering from channel errors. For the client as a whole, we propose a resource-scheduling policy that maximizes the client's QoS adaptively based on the viewer's preference under local resource constraints. We show that many interactive DTV applications can be supported under this client-based architecture more effectively than by the traditional server-based approaches.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/27/27/abstract.html", } @ARTICLE{Ingv0002:Determining, AUTHOR="T. Ingvaldsen and E. Klovning and M T Wilkins", TITLE="Determining the causes of end-to-end delay in {CSCW} applications", JOURNAL=comcom, VOLUME=23, NUMBER=3, PAGES="219-232", MONTH=feb, YEAR=2000, KEYWORDS="Delay measurement; Collaborative multimedia applic", ABSTRACT="Collaborative multimedia applications are becoming mainstream business tools. Useful work can only be performed if the subjective quality of the application is adequate. This is influenced by many factors including the end-system and network performance. End-to-end delay has been identified as a significant parameter affecting the user's satisfaction with the application. Earlier work has determined acceptable delay bounds for undertaking real tasks. This paper describes an investigation of the system components that contribute to this delay. The components contributing to the delay of audio and video have been measured and the major sources identified.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/27/28/abstract.html", } @ARTICLE{Geye0002:Security, AUTHOR="Werner Geyer and Rüdiger Weis", TITLE="The design and the security concept of a collaborative whiteboard", JOURNAL=comcom, VOLUME=23, NUMBER=3, PAGES="233-241", MONTH=feb, YEAR=2000, KEYWORDS="Video conferencing; Whiteboard; Cyptography; Open PGP; CSCW; Teleteaching", ABSTRACT="This paper presents the design and the security concept of the digital lecture board, an enhanced whiteboard tailored to the specific needs of collaborative types of work, for instance, in computer-based distance education. The development of the digital lecture board emerged from our experiences with synchronous, computer-based distance education in the TeleTeaching projects of the University of Mannheim. For almost four years, we have been using video conferencing tools for transmitting lectures and seminars. These tools prove to be far from optimal for this purpose since they are not powerful enough to support team work, not flexible enough for the use of media, and somewhat difficult to handle for non-experts. Security issues such as authentication, secure key exchange, and fast symmetric encryption are almost completely neglected, even though security is extremely important to allow for confidential, private sessions, and billing. We discuss shortcomings of existing video conferencing tools and describe features we had in mind while designing the digital lecture board. We then present our security concept that is a user-oriented approach that takes into account the specific security requirements of different user groups. We also cover implementation issues of the current prototype.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/27/29/abstract.html", } @ARTICLE{Mark0002:WWW, AUTHOR="Th. Markousis and D. Tsirikos and M. Vazirgiannis and Y. Stavrakas", TITLE="{WWW-enabled} delivery of interactive multimedia documents", JOURNAL=comcom, VOLUME=23, NUMBER=3, PAGES="242-252", MONTH=feb, YEAR=2000, KEYWORDS="Interactive multimedia; WWW; Distributed systems; Multimedia synchronization; Java", ABSTRACT="The structure and delivery of Interactive Multimedia Documents (IMDs) has been an issue of intensive research in the last few years. In this paper, we propose a scenario based structure for IMDs and a mechanism for WWW-enabled delivery of such IMDs. The structure for the IMDs, is based on the concept of scenarios, which define the flow of the presentation and the possible user interactions with the IMD. The delivery mechanism consists of a client/server system, which supports the remote presentation of IMDs. The whole framework has been implemented in Java using the Remote Method Invocation (RMI) client server communication protocol and the Java Media Framework (JMF) for handing multimedia objects. The system presents a promising approach for distributed interactive multimedia on the Internet and Intranets.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/27/30/abstract.html", } @ARTICLE{Garc0002:Efficient, AUTHOR="A. Garca-Martnez and J. Fernßndez-Conde and Â. Vi±a", TITLE="Efficient memory management in video on demand servers", JOURNAL=comcom, VOLUME=23, NUMBER=3, PAGES="253-266", MONTH=feb, YEAR=2000, KEYWORDS="Memory management; Video on demand server; Variable bit rate streams; Ideal deterministic admission control; Disk scheduling", ABSTRACT="In this article we present, analyse and evaluate a new memory management technique for video-on-demand servers. Our proposal, Memory Reservation Per Storage Device (MRPSD), relies on the allocation of a fixed, small number of memory buffers per storage device. Selecting adequate scheduling algorithms, information storage strategies and admission control mechanisms, we demonstrate that MRPSD is suited for the deterministic service of variable bit rate streams to intolerant clients. MRPSD allows large memory savings compared to traditional memory management techniques, based on the allocation of a certain amount of memory per client served, without a significant performance penalty.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/27/31/abstract.html", } @ARTICLE{Plag0002:Operating, AUTHOR="Thomas Plagemann and Vera Goebel and Pål Halvorsen and O. Anshus", TITLE="Operating system support for multimedia systems", JOURNAL=comcom, VOLUME=23, NUMBER=3, PAGES="267-289", MONTH=feb, YEAR=2000, KEYWORDS="Operating systems; Multimedia; Quality of service; Real-time", ABSTRACT="Distributed multimedia applications will be an important part of tomorrow's application mix and require appropriate operating system (OS) support. Neither hard real-time solutions nor best-effort solutions are directly well suited for this support. One reason is the co-existence of real-time and best effort requirements in future systems. Another reason is that the requirements of multimedia applications are not easily predictable, like variable bit rate coded video data and user interactivity. In this article, we present a survey of new developments in OS support for (distributed) multimedia systems, which include: (1) development of new CPU and disk scheduling mechanisms that combine real-time and best effort in integrated solutions; (2) provision of mechanisms to dynamically adapt resource reservations to current needs; (3) establishment of new system abstractions for resource ownership to account more accurate resource consumption; (4) development of new file system structures; (5) introduction of memory management mechanisms that utilize knowledge about application behavior; (6) reduction of major performance bottlenecks, like copy operations in I/O subsystems; and (7) user-level control of resources including communication.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/27/32/abstract.html", } @ARTICLE{Kars0002:Charging, AUTHOR="Martin Karsten and Jens Schmitt and Burkhard Stiller and Lars Wolf", TITLE="Charging for packet-switched network communicationmotivation and overview", JOURNAL=comcom, VOLUME=23, NUMBER=3, PAGES="290-302", MONTH=feb, YEAR=2000, KEYWORDS="Packet-switched networks; Quality of service; Pricing; Charging", ABSTRACT="Packet-switched network technology is expected to form the integration layer for future multi-service networks. The trend to integrate voice and data traffic can already be observed in the Internet and is expected to carry on until the full integration of all media types is achieved. At the same time it becomes obvious that the business model employed for current Internet usage is probably not sustainable for the creation of an infrastructure suitable to support a diverse and ever-increasing range of application services. Currently, the Internet provides only a single class of best-effort service and prices are mainly built on flat-fee, access-based schemes. However, the large and increasing differentiation of demand for quality of transmission services creates the necessity to differentiate service provision and, consequently, charging for network communications. In this article, we survey relevant service models and motivate the need for appropriate charging mechanisms. We give an overview on requirements for a charging system, its technical components, and issues for future business models that might by employed by service providers.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/27/33/abstract.html", } @ARTICLE{Trec0002:Delay, AUTHOR="Vittorio Trecordi and G. Vertica", TITLE="Per-flow delay performance in a {FIFO} scheduler fed by policed {UDP} sources", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="309-316", MONTH=feb, YEAR=2000, KEYWORDS="IP-over-ATM; Packet-over-sonet; Integrated services", ABSTRACT="We consider a FIFO multiplexer fed by UDP sources policed by a token bucket and investigate whether aggregate treatment instead of per-flow queuing determines unfair bandwidth allocation or not. Our main result is the development of a procedure for the upper bounding of per-flow delay probability distributions both in the homogeneous source problem and the heterogeneous case. We also report extensive simulation results and conclude that, for time scales higher than packet transmission time, delay probability distribution is equal for every multiplexed source.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/29/25/abstract.html", } @ARTICLE{Pier0002:Integrating, AUTHOR="Samuel Pierre and R. Beaubrun", TITLE="Integrating routing and survivability in fault-tolerant computer network design", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="317-327", MONTH=feb, YEAR=2000, KEYWORDS="Computer network design; Flow assignment; Quality of service; Reliability; Routing strategy; Survivability", ABSTRACT="In the context of computer networks, most conventional algorithms are designed to work under no-failure conditions for dealing with the routing problem. This paper investigates a more realistic situation where the flow assignment takes into account the possibility of a link failure. The method proposed to deal with this problem guarantees the survivability and allows analyzing the network behavior after a link failure. Further, it can be applicable to networks during their design phase as well as during the operational phase. Result analysis reveals the capacity of this method to design networks which satisfy the survivability constraints and to largely improve the delay obtained by other methods.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/29/26/abstract.html", } @ARTICLE{Loi0002:Voice, AUTHOR="V. D. Loi", TITLE="Voice and data integration in {ATM-based} {LANs}", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="328-332", MONTH=feb, YEAR=2000, KEYWORDS="ATM-based local area networks; Corporate networks; Voice and data integration; Multifunctional network interconnection systems", ABSTRACT="In this paper a case study of voice and data integration in ATM-based LANs using the Cell Oriented SYstem COSY, a product family of HiLAN company in Technology Park of Karlsruhe, Germany as well as one of its practical realizations is presented. Only the data path, not the signaling, is considered in-depth. Other implementation alternatives are also discussed. Our implementation results and the first gathered practical experiences are summarized as well as improvement steps in our future works are outlined", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/29/27/abstract.html", } @ARTICLE{Choi0002:Scalable, AUTHOR="Yoon-Hwa Choi and Pong-Gyou L", TITLE="A scalable and reconfigurable priority queue architecture for {ATM} switches", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="333-340", MONTH=feb, YEAR=2000, KEYWORDS="Priority queues; Scalable; Fault; Error detection; Reconfiguration", ABSTRACT="Applications with real-time traffic, such as video and voice, require quality-of-service (QoS) guarantees, such as bounded end-to-end delays and bounded cell loss probabilities. In order to provide the QoS guarantees for each connection in ATM networks, link scheduling to prioritize the transmission of queued cells is desirable. A hardware priority queue is then necessary since fast cell switching is hard to be realized in software. In addition, the queue has to be scalable with respect to the number of cells and the number of priority levels. A failure in the priority queue, however, will jeopardize the QoS guarantees for time-critical cells. Moreover, the errors occurred in the queue are unlikely to be detected at the destination. In this paper, we present a fast and scalable priority queue architecture for ATM switches. The queue can reconfigure itself once an error is detected, and thus it will continue normal operation even in the event of a failure.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/29/28/abstract.html", } @ARTICLE{Cuom0002:Prototypal, AUTHOR="Francesca Cuomo and Marco Listanti", TITLE="Performance analysis of a prototypal multimedia service in an intelligent broadband network", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="341-361", MONTH=feb, YEAR=2000, KEYWORDS="B-ISDN signalling; Multimedia services; Intelligent networks; Performance evaluation", ABSTRACT="Advanced multimedia multiparty services call for sophisticated signalling systems able to manage multiple parties and media in broadband environments. In this paper we dealt with the support of multimedia applications in an Intelligent Broadband Network (IBN), where the Intelligent Network, in a closed interaction with the B-ISDN, furnishes control functionality to handle complex service configuration. Some different options for an IN/B-ISDN interaction are discussed starting from the results of the INSIGNIA project (carried out in the framework of the European Union ACTS program) where a prototypal IBN system has been specified and developed in a field trial. Two main architectural solutions are discussed and a generic modelling methodology for the performance analysis of the control plane is presented. The objective of this modelling methodology is to provide insights into the behaviour of the system under dynamic conditions and to capture the influence of alternative functional settings. The proposed model is applied to the evaluation of the support of the Broadband Video Conference service in the prototypal system as well as to compare the performance of alternative architectural solutions for the IBN.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/29/29/abstract.html", } @ARTICLE{Feng0002:Bifurcated, AUTHOR="Gang Feng and Tak Shing P. Yum", TITLE="{Bifurcated-M} routing for multi-point videoconferencing", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="362-370", MONTH=feb, YEAR=2000, ABSTRACT="Dynamic routing, if properly designed, can increase the throughput of a network. In this paper, we formulate a traffic model for multi-point videoconferencing in a VP-based ATM network and derive the link level and the conference level blocking probabilities for Fixed Routing.", } @ARTICLE{Ahn0002:Shifting, AUTHOR="Heejune Ahn and Jae-kyoon Kim", TITLE="Shifting-level process as a {LRD} video traffic model and related queuing results", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="371-378", MONTH=feb, YEAR=2000, KEYWORDS="VBR video traffic model; Shifting-level process; Compound correlation; Long-range dependence; Short-range dependence; Queuing behavior", ABSTRACT="Recently it has been reported that variable bit rate (VBR) video traffic exhibits long-range dependence (LRD). Various processes have been proposed for modeling traffic with LRD and analyzing its effects on network performance. However, in the previous models it is not possible to identify the effects of short- and long-term correlation of video traffic on queuing performance, and thus many seemingly contradictory arguments on the importance of LRD in VBR video traffic can be found in the literature. In this paper, we present a video traffic model based on the shifting-level (SL) process. We observe that the autocorrelation function (ACF) of an empirical video trace is accurately captured by a shifting-level process with compound correlation (SLCC): an exponential decay for small lags and a hyperbolic one for large lags. Especially, we present a parameter matching algorithm for video traffic. The continuous-time first-order discrete auto-regressive (C-DAR(1)) model, which is a short-range dependent (SRD) video traffic model, can be considered a kind of SLCC process with an exponential correlation term only. Thus, comparing the queuing performances of the C-DAR(1) model and the SLCC with that of a real video trace, it is possible to identify the effects of SRD and LRD in VBR video traffic on queuing performance. From simulation results, we find that LRD may have a significant effect on queuing behavior under heavy traffic loads and large buffer conditions.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/29/31/abstract.html", } @ARTICLE{Br0002:Virtual, AUTHOR="K. B’r and Cem Ersoy", TITLE="A virtual path routing algorithm for {ATM} networks based on the equivalent bandwidth concep", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="379-394", MONTH=feb, YEAR=2000, KEYWORDS="Asynchronous Transfer Mode (ATM); Equivalent bandwidth; Network link utilization; Virtual circuit (VC); Virtual path (VP)", ABSTRACT="The coexistence of a wide range of services with different quality of service (QoS) requirements in today's networks makes the efficient use of resources a major issue. It is desirable to improve network efficiency by adaptively assigning resources to services that have different bandwidth demands. Implementing Broadband Integrated Services Digital Networks (B-ISDN) therefore requires a network control scheme that can handle bursty traffic with unexpected fluctuations. The Asynchronous Transfer Mode (ATM) technology provides this flexibility by virtualizing network resources through the use of the virtual path (VP) concept. In this study, a method for designing a VP-based ATM network is proposed. The developed heuristic design algorithm applies VP routing and separation techniques to minimize the maximum link utilization under processing delay constraints. Each link is assigned a weight that reflects its current utilization. Using these weights, the VPs on highly utilized links are rerouted to less congested physical paths. The algorithm makes use of the equivalent bandwidth concept, which provides an efficient method to estimate capacity requirements of connection requests such that QoS requirements are met. The quality of the solutions achieved by the proposed method is compared to several competitors under varying network topologies and traffic conditions. The observations on the algorithm performance show that the developed method is able to facilitate an efficient use of network resources through the introduction of VPs.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/29/32/abstract.html", } @ARTICLE{Swam0002:DIDA, AUTHOR="N. Swaminathan and S. V. Raghavan", TITLE="{DIDA:} a Distributed, Dynamic and Adaptive {VP} bandwidth management scheme for {ATM} networks", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="395-402", MONTH=feb, YEAR=2000, KEYWORDS="ATM networks; VP bandwidth management; Adaptive traffic estimation", ABSTRACT="Virtual Path (VP) provisioning has gained wide acceptance as an effective resource management technique for improving transmission efficiency in ATM networks. VP bandwidth management in particular could absorb short-term fluctuations in traffic and improve call-blocking probability. In this paper, we propose a distributed and dynamic VP bandwidth management scheme called DIDA, which absorbs medium scale traffic fluctuations and improves the call blocking probability. The proposed scheme incorporates an adaptive traffic estimator that is suitable even for VPs carrying heterogeneous traffic. Simulation studies conducted on DIDA show that the adaptive estimator of DIDA improves the call blocking probability in an ATM network, with VPs carrying heterogeneous traffic while maintaining fairness among different call types at the same time.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/29/33/abstract.html", } @ARTICLE{Bore0002:Source, AUTHOR="Michael S. Borella", TITLE="Source models of network game traffic", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="403-410", MONTH=feb, YEAR=2000, KEYWORDS="Analytical models; Multi-player network game; Internet gaming", ABSTRACT="We study the traffic generated by sessions of a popular multi-player network game. Our analysis indicates that empirical game traffic can be characterized well by certain analytical models. While clients and servers as well as hosts with different configurations, produce different models, all models from the game are well modeled by the same families of distributions. We find that some data sets are best modeled with split distributions; that is, one portion of the data is well modeled with one particular distribution, and the rest of the data with another. We describe how our models can be simulated and discuss how host processing speed influences packet interarrival processes, which in turn influence playability. The latter is a clear indication that end user quality of service is more than just a network issuehost characteristics must be considered as well. These are empirical results that have been rarely incorporated into theoretical analyses of network traffic. As Internet gaming becomes more popular, we expect that our models will be useful for testing hardware and protocols that support gaming.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/29/34/abstract.html", } @ARTICLE{Jin0002:Distributed, AUTHOR="J. S. Jin and R. Kurniawati", TITLE="Design and analysis of distributed object collection for web indexing", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="411-417", MONTH=feb, YEAR=2000, KEYWORDS="www spiders/robots; Distributed execution; Multimedia/image databases", ABSTRACT="We propose a scheme for mobile and distributed objects collection over the World Wide Web. Using the approach, we can deploy a collector easily on the site being indexed. This and the availability of Java virtual machines virtually everywhere make finer grained task distribution possible compared to other approaches. We then develop a mathematical model for data transfer time using HTTP. We conclude that the proposed collector will do better in terms of total transfer time compared to a centralized collector, provided that we have a reasonable compression ratio (less than 80\%) and the round-trip time is relatively big (above 100ms).", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/29/35/abstract.html", } @ARTICLE{Lau0002:Distance, AUTHOR="F. C. M. Lau and Guihai Chen and Hao Huang and Li Xie", TITLE="A distance-vector routing protocol for networks with unidirectional links", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="418-424", MONTH=feb, YEAR=2000, ABSTRACT="We propose a simple distance-vector protocol for routing in networks having unidirectional links. The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol. The protocol comprises two main algorithms, one for collecting", } @ARTICLE{Fan0002:Date, AUTHOR="Chun Fan and Wen-Jen Chen and Y.-S. Yeh", TITLE="Date attachable electronic cash", JOURNAL=comcom, VOLUME=23, NUMBER=4, PAGES="425-428", MONTH=feb, YEAR=2000, KEYWORDS="Untraceable electronic cash; Blind signatures; Cryptography", ABSTRACT="In this paper we propose a new untraceable electronic cash scheme which makes it possible for a payer to attach the desired date to his electronic cash during a transaction. With the aid of the date attachability property, the date on which an electronic cash is deposited in the bank cannot be forged in an electronic cash scheme. It is conducive to the unforgeability of the number of days for which the cash has been stored in the bank for some necessary purposes such as interest calculation. Our scheme not only keeps the attached date from being forged but also avoids two or more different dates being attached to the same electronic cash. Furthermore, the date attachment does not affect the untraceability property of electronic cash. Comparing with typical electronic cash schemes, the extra computation required for date attachment is just hashing.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/29/37/abstract.html", } @ARTICLE{Deca0002:Router, AUTHOR="Dan Decasper and Zubin Dittia and Guru Parulkar and Bernhard Plattner", TITLE="Router plugins: a software architecture for next-generation routers", JOURNAL=ieanep, VOLUME=8, NUMBER=1, PAGES="2-15", MONTH=feb, YEAR=2000, REFERENCES=44, ABSTRACT="Present-day Internet protocol routers typically employ monolithic operating systems that are not easily upgradable and extensible. With the rapid rate of protocol development it is becoming increasingly important to dynamically upgrade router software in an incremental fashion. We have designed and implemented a high-performance, modular, extended services router software architecture in the Net BSD operating system kernel. This architecture allows code modules, called plugins, to be dynamically added and configured at run time. One of the novel features of our design is the ability to bind different plugins to individual flows; this allows for distinct plugin implementations to seamlessly coexist in the same runtime environment. We achieve high performance through a carefully designed modular architecture, an innovative packet classification algorithm that is highly efficient, and by caching that exploits the flow-like characteristics of Internet traffic. Compared to a monolithic best effort kernel, our implementation requires an average increase in packet processing overhead of only 8\%, or 600 cycles per shortcutting the forward loop based on the per-flow state we establish, we can forward packets up to three times faster than the best effort kernel.", URL="http://www.acm.org/pubs/articles/journals/ton/2000-8-1/p2-decasper/p2-decasper.pdf", } @ARTICLE{Wong0002:Secure, AUTHOR="Chung Kei Wong and Mohamed Gouda and Simon Lam", TITLE="Secure group communications using key graphs", JOURNAL=ieanep, VOLUME=8, NUMBER=1, PAGES="16-30", MONTH=feb, YEAR=2000, REFERENCES=28, ABSTRACT="Many emerging network applications (e.g., teleconference, information services, distributed interactive simulation, and collaborative work) are based upon a group communications model. AS a result, securing group communications, i.e., providing confidentiality, authenticity, and integrity of messages delivered between group members, will become a critical networking issue. We present, in this paper, a novel solution to the scalability problem of group/multicast key management. We formalize the notion of a secure group as a triple (U, K, R) where U denotes a set of users, K a set of keys held by the users, and R a user-key relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely distributing rekey messages after a join/leave and specify protocols for joining and leaving secure group. The rekeying strategies and join/leave protocols are implemented in a prototype key server we have built. We present measurement results from experiments and discuss performance comparisons. We show that our group key management service, using any of the three rekeying strategies, is scalable to large groups with frequent joins and leave. In particular, the average measured processing time per join/leave increases linearly with the logarithm of group size.", URL="http://www.acm.org/pubs/articles/journals/ton/2000-8-1/p16-wong/p16-wong.pdf", } @ARTICLE{Choi0002:Unified, AUTHOR="Sunghyun Choi and Kang G. Shin", TITLE="A unified wireless {LAN} architecture for real-time and non-real-time communication services", JOURNAL=ieanep, VOLUME=8, NUMBER=1, PAGES="44-59", MONTH=feb, YEAR=2000, REFERENCES=30, ABSTRACT="This paper addresses how to support both real-time and non-real-time communication services in a wireless LAN with dynamic time-division duplexed (D-TDD) transmission. With D-TDD, a frequency channel is time-sharing for both downlink and uplink transmissions under the dynamic access control of the base station. The base station 1) handles uplink transmissions by polling mobiles in certain order determined on a per-connection (per-message) basis for transmitting real-time (non-real-time) traffic from mobiles and 2) schedules the transmission of downlink packets. To handle location-dependent, time-varying, and bursty errors, we adopt the channel-state prediction, transmission deferment, and retransmission. We consider the problems of scheduling and multiplexing downlink packet transmissions, and polling mobiles for uplink transmissions depending on the channel state. We also establish conditions necessary to admit each new real-time connection by checking if the connection's delivery-delay bound can be guaranteed as long as the channel stays in good condition without compromising any of the existing guarantees. Last, the performance of the proposed protocol is evaluated to demonstrate how the protocol works and to study the effects of various parameters of the protocol.", URL="http://www.acm.org/pubs/articles/journals/ton/2000-8-1/p44-choi/p44-choi.pdf", } @ARTICLE{Iatr0002:Dynamic, AUTHOR="Steve Iatrou and Ioannis Stavrakakis", TITLE="A dynamic regulation and scheduling scheme for real-time traffic management", JOURNAL=ieanep, VOLUME=8, NUMBER=1, PAGES="60-70", MONTH=feb, YEAR=2000, REFERENCES=12, ABSTRACT="Typical rate-based traffic management schemes for real-time applications attempt to allocate resources by controlling the packet delivery to the resource arbitrator (scheduler). This control is typically based only on the characteristics of the particular (tagged) traffic stream and would fail to optimally adjust to non-nominal network conditions such as overload. In this paper, a dynamic regulation and scheduling (dynamic - R\&S) scheme is proposed whose regulation function is modulated by both the tagged stream's characteristics and information capturing the state of the coexisting applications as provided by the scheduler. The performance of the proposed sheme - versus an equivalent static one - is investigated under both underload and overload traffic conditions. The substantially better throughput/jitter characteristics of the dynamic - R\&S scheme are establish.", URL="http://www.acm.org/pubs/articles/journals/ton/2000-8-1/p60-iatrou/p60-iatrou.pdf", } @ARTICLE{Ghan0002:Enhanced, AUTHOR="Nasir Ghani and Jon Mark", TITLE="Enhanced distributed explicit rate allocation for {ABR} services in {ATM} networks", JOURNAL=ieanep, VOLUME=8, NUMBER=1, PAGES="71-86", MONTH=feb, YEAR=2000, REFERENCES=21, ABSTRACT="Rate allocation for available bit-rate (ABR) services in ATM networks has received a considerable amount of attention recently, but important issues such as bandwidth fairness, MCR rate guarantees, and queue control still require further investigation. In light of these concerns, an enhanced rate allocation algorithm is proposed for congestion management using explicit rate feedback control. The algorithm uses fast, exact rate computations and is capable of achieving a variety of MCR-related fairness criteria. The scheme handles transient effects and can function in heterogeneous networks carrying higher priority real-time traffic. Simulation results for a a wide range of network scenarios demonstrate that the algorithm effectively controls queue buildups and achieves good fairness. Performance scalability to large networks under challenging conditions is also shown for a given control parameter set.", URL="http://www.acm.org/pubs/articles/journals/ton/2000-8-1/p71-ghani/p71-ghani.pdf", } @ARTICLE{Kaly0002:ERICA, AUTHOR="Shivkumar Kalyanaraman and Raj Jain and Sonia Fahmy and Rohit Goyal and Bobby Vandalore", TITLE="The {ERICA} switch algorithm for {ABR} traffic management in {ATM} networks", JOURNAL=ieanep, VOLUME=8, NUMBER=1, PAGES="87-98", MONTH=feb, YEAR=2000, ABSTRACT="This paper describes the", } @ARTICLE{Su0002:Statistical, AUTHOR="Ching-Fong Su and Gustavo de Veciana", TITLE="Statistical multiplexing and mix-dependent alternative routing in multiservice {VP} networks", JOURNAL=ieanep, VOLUME=8, NUMBER=1, PAGES="99-108", MONTH=feb, YEAR=2000, REFERENCES=23, ABSTRACT="We consider problems in traffic integration and routing for virtual path (VP)-based multiservice networks. The objective is to exploit statistical multiplexing among various traffic types in order to improve system utilization. Difficulties arise due to statistical multiplexing since a connection's bandwidth requirement depends on the characteristics of the interfering traffic. We first consider whether segregating heterogeneous traffic with different quality of service (QoS) requirements on separate VP's is desirable. Next we consider routing heterogeneous permanent connections given a predefined traffic type mix onto multiple VP's between a source destination pair. We show that it is not necessarily advantageous to have each VP carry every traffic type. In fact, perhaps surprisingly, an optimum solution to this problem suggests that only a small number of traffic types, or even homogeneous traffic, need be present on each VP. Based on this observation, we propose a simple alternative routing algorithm with routing sequences depending on the traffic mix.", URL="http://www.acm.org/pubs/articles/journals/ton/2000-8-1/p99-su/p99-su.pdf", } @ARTICLE{Byun0002:UniMIN, AUTHOR="Sung Hyuk Byun and Dan Keun Sung", TITLE="The {UniMIN} switch architecture for large-scale {ATM} switches", JOURNAL=ieanep, VOLUME=8, NUMBER=1, PAGES="109-120", MONTH=feb, YEAR=2000, ABSTRACT="A general expansion architecture is proposed that can be used in building large-scale switches using any type of asynchronous transfer mode (ATM) switch. The proposed universal multistage interconnection network (UniMIN) switch is composed of a buffered distribution network (DN) and a column of output switch modules (OSM's), which can be any type of ATM switch. ATM cells are routed to their destination using a two-level routing strategy. The DN provides each incoming cell with a self-routing path to the destined OSM, which is the switch module containing the destination output port. Further routing to the destined output port is performed by the destination OSM. Use of the channel grouping technique yields excellent delay/througput performance in the DN, and the virtual FIFO concept is used for implementing the output buffers of the distribution module without internal speedup. We also propose a", } @ARTICLE{Boud0002:Comments, AUTHOR="Jean-Yves Le Boudec and Gérard Hébuterne", TITLE="Comments on ``a deterministic approach to the end-to-end analysis of packet flows in connection oriented networks''", JOURNAL=ieanep, VOLUME=8, NUMBER=1, PAGES="121-124", MONTH=feb, YEAR=2000, REFERENCES=7, ABSTRACT="We proved that the buffer bound in the above paper, can be improved by using a modification of the proofs in the original paper together with so-called network calculus bounds. We also show that the delay bound in the above papers, is the sum of worst-case queueing delays at all nodes along the path of a connection.", URL="http://www.acm.org/pubs/articles/journals/ton/2000-8-1/p121-le\_boudec/p121-le\_boudec.pdf", } @ARTICLE{Puig0002:Modelling, AUTHOR="Ramon Puigjaner", TITLE="Modelling techniques and tools for performance evaluation", JOURNAL=pe, VOLUME=39, NUMBER=1, PAGES="1-3", MONTH=feb, YEAR=2000, URL="http://www.elsevier.nl/gej-ng/10/35/22/42/23/23/article.pdf", } @ARTICLE{Herm0002:Compositional, AUTHOR="H. Hermanns and U. Herzog and V. Mertsiotakis and M. Siegle", TITLE="Compositional performance modelling with the {TIPPtool}", JOURNAL=pe, VOLUME=39, NUMBER=1, PAGES="5-35", MONTH=feb, YEAR=2000, KEYWORDS="Stochastic process algebra; Performance analysis; Markov chain; Bisimulation aggregation; Tool support", ABSTRACT="Stochastic process algebras have been proposed as compositional specification formalisms for performance models. In this paper, we describe a tool which aims at realising all beneficial aspects of compositional performance modelling, the TIPPtool. It incorporates methods for compositional specification as well as solution, based on state-of-the-art techniques, and wrapped in a user-friendly graphical front end. Apart from highlighting the general benefits of the tool, we also discuss some lessons learned during development and application of the TIPPtool. A non-trivial model of a real life communication system serves as a case study to illustrate benefits and limitations.", URL="http://www.elsevier.nl/gej-ng/10/35/22/42/23/24/article.pdf", } @ARTICLE{Rama0002:SREPT, AUTHOR="Srinivasan Ramani and Swapna S. Gokhale and Kishor Trivedi", TITLE="{SREPT:} software reliability estimation and prediction tool", JOURNAL=pe, VOLUME=39, NUMBER=1, PAGES="37-60", MONTH=feb, YEAR=2000, KEYWORDS="Software reliability; Architecture-based approach; Debugging policies; Simulation", ABSTRACT="Several tools have been developed for the estimation of software reliability. However, they are highly specialized in the approaches they implement and the particular phase of the software life-cycle in which they are applicable. There is an increasing need for a tool that can be used to track the quality of a software product during the software life-cycle, right from the architectural phase all the way up to the operational phase of the software. Also the conventional techniques for software reliability evaluation, which treat the software as a monolithic entity, are inadequate to assess the reliability of heterogeneous systems, which consist of a large number of globally distributed components. Architecture-based approaches are essential to assess the reliability and performance of such systems. This paper presents the high-level design of a software reliability estimation and prediction tool (SREPT), that offers a unified framework consisting of techniques (including the architecture-based approach) to assist in the evaluation of software reliability during all phases of the software life-cycle.", URL="http://www.elsevier.nl/gej-ng/10/35/22/42/23/25/article.pdf", } @ARTICLE{Schu0002:Multicast, AUTHOR="Marko Schuba and Boudewijn R. Haverkort and Gaby Schneider", TITLE="Performance evaluation of multicast communication in packet-switched networks", JOURNAL=pe, VOLUME=39, NUMBER=1, PAGES="61-80", MONTH=feb, YEAR=2000, KEYWORDS="Multicast protocols; Queueing network models; Performance tools", ABSTRACT="In this paper we describe the theoretical background and practical application of QNA-MC (queueing network analyser supporting multicast), a tool for the analytical evaluation of multicast protocols. QNA-MC is based on the QNA method, which (approximately) analyses open networks of GI|G|m queues. In contrast to standard QNA, QNA-MC allows for the specification and evaluation of multicast routes. As in real multicast communication, packets leaving a particular node can be copied and deterministically routed to several other nodes. In order to analyse such queueing networks, QNA-MC converts the multicast routes to a suitable input for standard QNA. From the results delivered by QNA, QNA-MC then derives several performance measures for multicast streams in the network. A validation of QNA-MC, via a comparison to simulation results, shows that QNA-MC yields very good results. Finally, we give a detailed application example by evaluating different multicast routing algorithms for a realistic video conferencing scenario in the European MBONE.", URL="http://www.elsevier.nl/gej-ng/10/35/22/42/23/26/article.pdf", } @ARTICLE{JGar0002:Model, AUTHOR="J. García and F. J. Suárez and D. F. García", TITLE="Model-driven monitoring support for the multi-view performance analysis of parallel embedded applications", JOURNAL=pe, VOLUME=39, NUMBER=1, PAGES="81-98", MONTH=feb, YEAR=2000, KEYWORDS="Performance measurement; Performance visualization; Parallel embedded systems; Software instrumentation", ABSTRACT="This paper describes an approach to carry out performance analysis of parallel embedded applications. The approach is based on measurement, but in addition, the idea of driving the measurement process (application instrumentation and monitoring) by a behavioral model is introduced. Using this model, highly comprehensible performance information can be collected. The whole approach is based on this behavioral model, one instrumentation method and two tools, one for monitoring and the other for visualization and analysis. Each of these is briefly described, and the steps to carry out performance analysis using them are clearly defined. They are explained by means of a case study. Finally, one method to evaluate the intrusiveness of the monitoring approach is proposed, and the intrusiveness results for the case study are presented.", URL="http://www.elsevier.nl/gej-ng/10/35/22/42/23/27/article.pdf", } @ARTICLE{Su0002:Numerical, AUTHOR="Víctor Suñé and José L. Domingo and Juan Carrasco", TITLE="Numerical iterative methods for Markovian dependability and performability models: new results and a comparison", JOURNAL=pe, VOLUME=39, NUMBER=1, PAGES="99-125", MONTH=feb, YEAR=2000, KEYWORDS="Continuous-time Markov chains; Dependability; Performability; Iterative numerical methods", ABSTRACT="In this paper we deal with iterative numerical methods to solve linear systems arising in continuous-time Markov chain (CTMC) models. We develop an algorithm to dynamically tune the relaxation parameter of the successive over-relaxation method. We give a sufficient condition for the Gauss-Seidel method to converge when computing the steady-state probability vector of a finite irreducible CTMC, and a sufficient condition for the generalized minimal residual projection method not to converge to the trivial solution 0 when computing that vector. Finally, we compare several splitting-based iterative methods and a variant of the generalized minimal residual projection method.", URL="http://www.elsevier.nl/gej-ng/10/35/22/42/23/28/article.pdf", } @ARTICLE{Knot0002:Probabilistic, AUTHOR="William Knottenbelt and P. G. Harrison and M. A. Mestern and P. S. Kritzinger", TITLE="A probabilistic dynamic technique for the distributed generation of very large state spaces", JOURNAL=pe, VOLUME=39, NUMBER=1, PAGES="127-148", MONTH=feb, YEAR=2000, KEYWORDS="We derive a performance model of this new algorithm in order to quantify its benefits in terms of distributed run-time; speedup and efficiency. We implement our technique on a distributed-memory parallel computer and demonstrate results which compare favourably with the performance model. Finally; we discuss suitable choices for the three hash functions upon which our algorithm is based.", ABSTRACT="Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have developed a new dynamic probabilistic state exploration algorithm which addresses this problem for general, structurally unrestricted state spaces. Our method has a low state omission probability and low memory usage that is independent of the length of the state vector. In addition, the algorithm can be easily parallelised. This combination of probability and parallelism enables us to rapidly explore state spaces that are an order of magnitude larger than those obtainable using conventional exhaustive techniques. We derive a performance model of this new algorithm in order to quantify its benefits in terms of distributed run-time, speedup and efficiency. We implement our technique on a distributed-memory parallel computer and demonstrate results which compare favourably with the performance model. Finally, we discuss suitable choices for the three hash functions upon which our algorithm is based.", URL="http://www.elsevier.nl/gej-ng/10/35/22/42/23/29/article.pdf", } @ARTICLE{Arli0002:Web, AUTHOR="Martin Arlitt and Rich Friedrich and Tai Jin", TITLE="Performance evaluation of Web proxy cache replacement policies", JOURNAL=pe, VOLUME=39, NUMBER=1, PAGES="149-164", MONTH=feb, YEAR=2000, KEYWORDS="World-Wide Web; Performance evaluation; Proxy caching; Replacement policies; Trace-driven simulation", ABSTRACT="The continued growth of the World-Wide Web and the emergence of new end-user technologies such as cable modems necessitate the use of proxy caches to reduce latency, network traffic and Web server loads. In this paper we analyze the importance of different Web proxy workload characteristics in making good cache replacement decisions. We evaluate workload characteristics such as object size, recency of reference, frequency of reference, and turnover in the active set of objects. Trace-driven simulation is used to evaluate the effectiveness of various replacement policies for Web proxy caches. The extended duration of the trace (117 million requests collected over 5 months) allows long term side effects of replacement policies to be identified and quantified. Our results indicate that higher cache hit rates are achieved using size-based replacement policies. These policies store a large number of small objects in the cache, thus increasing the probability of an object being in the cache when requested. To achieve higher byte hit rates a few larger files must be retained in the cache. We found frequency-based policies to work best for this metric, as they keep the most popular files, regardless of size, in the cache. With either approach it is important that inactive objects be removed from the cache to prevent performance degradation due to pollution.", URL="http://www.elsevier.nl/gej-ng/10/35/22/42/23/30/article.pdf", } @ARTICLE{Germ0002:Markov, AUTHOR="Reinhard German", TITLE="Markov regenerative stochastic Petri nets with general execution policies: supplementary variable analysis and a prototype tool", JOURNAL=pe, VOLUME=39, NUMBER=1, PAGES="165-188", MONTH=feb, YEAR=2000, KEYWORDS="Stochastic Petri nets; General execution policies; Supplementary variables; Tools", ABSTRACT="Stochastic Petri nets (SPNs) with general firing time distributions are considered. Generally timed transitions can have general execution policies: the preemption policy may be preemptive repeat different (prd) or preemptive resume (prs) and the firing time distribution can be marking-dependent. A stationary analysis method covering all possible combinations is presented by means of supplementary variables. The method is implemented in a prototype tool SPNica which is based on Mathematica. The use of the general execution policies is illustrated by a WWW server model.", URL="http://www.elsevier.nl/gej-ng/10/35/22/42/23/31/article.pdf", } @ARTICLE{Wang0002:Experiments, AUTHOR="Hai Wang and Kenneth Sevcik", TITLE="Experiments with improved approximate mean value analysis algorithms", JOURNAL=pe, VOLUME=39, NUMBER=1, PAGES="189-206", MONTH=feb, YEAR=2000, KEYWORDS="Queueing network models; Mean value analysis; Approximate solution techniques", ABSTRACT="Approximate mean value analysis (MVA) is a popular technique for analyzing queueing networks because of the efficiency and accuracy that it affords. In this paper, we present a new software package, called the improved approximate mean value analysis library (IAMVAL), which can be easily integrated into existing commercial and research queueing network analysis packages. The IAMVAL packages include two new approximate MVA algorithms, the queue line (QL) algorithm and the fraction line (FL) algorithm, for analyzing multiple class separable queueing networks. The QL algorithm is always more accurate than, and yet has approximately the same computational efficiency as, the Bard-Schweitzer proportional estimation (PE) algorithm, which is currently the most widely used approximate MVA algorithm. The FL algorithm has the same computational cost and, in noncongested separable queueing networks where queue lengths are quite small, yields more accurate solutions than both the QL and PE algorithms.", URL="http://www.elsevier.nl/gej-ng/10/35/22/42/23/32/article.pdf", } @ARTICLE{Savi0002:Predicting, AUTHOR="N. N. Savino-Vázquez and others", TITLE="Predicting the behaviour of three-tiered applications: dealing with distributed-object technology and databases", JOURNAL=pe, VOLUME=39, NUMBER=1, PAGES="207-233", MONTH=feb, YEAR=2000, KEYWORDS="Three-tiered architectures; Queuing-network models; Simulation models; Distributed-object architectures; Databases", ABSTRACT="Today's applications are both object-oriented and based on a new type of three-tiered client-server architecture with clients, processing servers, and data servers as cornerstones. By recognising these trends, industry and researchers have been engaged in defining standards and technologies for communicating the components of Distributed Information Systems and for providing compatible mechanisms to access databases, but a key problem with these complex architectures is still their performance. This paper presents a tool for predicting the performance of systems based on CORBA and DCOM as distributed-object architectures, and OLE-DB and PL/SQL as data-access architectures. The tool is an extension of SMART, a workbench that exploits analytical and simulation performance models to predict the performance of database applications.", URL="http://www.elsevier.nl/gej-ng/10/35/22/42/23/33/article.pdf", } @TECHREPORT{Euro0002:Digital, AUTHOR="{European Telecommunications Standards Institute}", TITLE="Digital cellular telecommunications system, Network architecture", TYPE="GSM", INSTITUTION="{European Telecommunications Standards Institute}", ADDRESS="Sophia Antipolis, France", NUMBER="03.02 version 7.1.0", MONTH=feb, YEAR=2000, LANGUAGE="English", } @TECHREPORT{High0002:Spoton, AUTHOR="Jeffrey Hightower and Gaetano Borriello and Roy Want", TITLE="SpotON: An Indoor {3D} Location Sensing Technology Based on {RF} Signal Strength", TYPE="Technical Report", INSTITUTION="University of Washington", ADDRESS="Seattle, WA", NUMBER="2000-02-02", MONTH=feb, YEAR=2000, LANGUAGE="English", REFERENCES=13, KEYWORDS="active badge; indoor location; location sensing", ABSTRACT="Providing a reliable technology and architecture for determining the location of real world objects and people will undoubtedly enable applications, customization, and inference not currently possible. This paper documents the creation of SpotON, a new tagging technology for three dimensional location sensing based on radio signal strength analysis. Although there are many aspects to the topic of location sensing and several of them will be briefly discussed, this paper is primarily concerned with the hardware and embedded system development of such a system.", URL="http://www.cs.washington.edu/homes/jeffro/pubs/hightower2000indoor/hightower2000indoor.pdf", } @INPROCEEDINGS{Padh0002:New, AUTHOR="Chainmay Padhye and Ken Christensen and Wilfrido Moreno", TITLE="A New Adaptive {{FEC}} Loss Control Algorithm for Voice Over {{IP}} Applications", BOOKTITLE="International Conference on Performance, Computing, and Communications", ORGANIZATION="IEEE", MONTH=feb, YEAR=2000, LANGUAGE="English", ABSTRACT={Packet loss causes degradation in the quality of Voice Over IP (VOIP) applications. Forward Error Correction (FEC) methods which add redundant information to voice packets can be used to minimize the effects of packet loss. While these methods can reduce the effects of packet loss, they increase the amount of bandwidth used by a voice stream. This paper builds on existing work in adaptive FEC control algorithms to better control the amount of redundancy. The new adaptive FEC "USF algorithm" considers the history of packet losses in the network before changing the amount of redundancy and also does not react to burst losses. The performance of the USF algorithm is studied using a simulation model. The USF algorithm is able to maintain a loss rate one-half to onethird the loss rate maintained by the current algorithm for Internet traces and for network loss rates between 7\% and 20\% for synthetic traces.}, } @TECHREPORT{Quay0002:Multipoint, AUTHOR="A. Quayyum and Laurent Viennot and A. Laouiti", TITLE="Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks", TYPE="Research Report", INSTITUTION="INRIA", NUMBER="RR-3898", MONTH=feb, YEAR=2000, } @INPROCEEDINGS{Kent0002:Secure, AUTHOR="Stephen T. Kent and Charles Lynn and Joanne Mikkelson and Karen Seo", TITLE="Secure Border Gateway Protocol {(S-BGP)} -- Real World Performance and Deployment Issues", BOOKTITLE="Network and Distributed System Security Symposium", INSTITUTION="BBN", ADDRESS="San Diego, California", DAYS=3, MONTH=feb, YEAR=2000, REFERENCES=5, KEYWORDS="BGP; routing; security", ABSTRACT="The Border Gateway Protocol (BGP), which is used to distribute routing information between autonomous systems, is an important component of the Internets routing infrastructure. Secure BGP (S-BGP) addresses critical BGP vulnerabilities by providing a scalable means of verifying the authenticity and authorization of BGP control traffic. To facilitate widespread adoption, S-BGP must avoid introducing undue overhead (processing, bandwidth, storage) and must be incrementally deployable, i.e., interoperable with BGP. To provide a proof of concept demonstration, we developed a prototype implementation of S-BGP and deployed it in DARPA's CAIRN testbed. Real Internet BGP traffic was fed to the testbed routers via replay of a recorded BGP peering session with an ISP's BGP router. This document describes the results of these experiments examining interoperability, the efficacy of the S-BGP countermeasures in securing BGP control traffic, and their impact on BGP performance, and thus evaluating the feasibility of deployment in the Internet.", URL="http://www.isoc.org/ndss2000/proceedings/045.pdf", } @INPROCEEDINGS{Bell0002:Distributed, AUTHOR="Steven M. Bellovin", TITLE="Distributed Denial of Service Attacks", BOOKTITLE="NANOG 18", INSTITUTION="AT\\&T Research", ADDRESS="San Jose, California", DAYS=6, MONTH=feb, YEAR=2000, KEYWORDS="denial of service; attacks; flooding", ABSTRACT="Describes TFN, TFN2K, Trinoo, Stacheldraht and counter measures such as ICMP traceback.", URL="http://www.research.att.com/~smb/talks/nanog-dos/index.htm", } @INPROCEEDINGS{Choh0002:IP, AUTHOR="Harpal Chohan and Russell Morrison", TITLE="{IP} telephony at Ohio State ``and beyond''", BOOKTITLE="Net@EDU Annual Member Meeting", INSTITUTION="Ohio State University", ADDRESS="Tempe, Arizona", DAYS=6, MONTH=feb, YEAR=2000, KEYWORDS="IP telephony; VoIP; dialing plan; H.323; gatekeeper", ABSTRACT="Describes dialing plan for OSU IP telephony deployment.", URL="http://www.educause.edu/netatedu/groups/voip/osu-tempe.ppt", } @INPROCEEDINGS{Domi0002:VoIP, AUTHOR="José A. Domínguez", TITLE="{VoIP} Technology Developments", BOOKTITLE="Net@EDU Annual Member Meeting", INSTITUTION="University of Oregon", ADDRESS="Tempe, Arizona", DAYS=6, MONTH=feb, YEAR=2000, KEYWORDS="IP telephony; VoIP; dialing plan; H.323; SIP; gatekeeper", ABSTRACT="Lists technical issues and describes OSU network and telephone infrastructure.", URL="http://www.educause.edu/netatedu/groups/voip/dominguez.ppt", } @INPROCEEDINGS{Bart0002:VoIP, AUTHOR="Dave Barta", TITLE="{VoIP} at the University of Oregon -- The View from the Telephone Side", BOOKTITLE="Net@EDU Annual Member Meeting", INSTITUTION="University of Oregon", ADDRESS="Tempe, Arizona", DAYS=6, MONTH=feb, YEAR=2000, KEYWORDS="IP telephony; VoIP; dialing plan; H.323; SIP; gatekeeper", ABSTRACT="Describes implementation of VoIP at OSU, including remote locations, as well as experience with vendor products.", URL="http://www.educause.edu/netatedu/groups/voip/barta.ppt", } @INPROCEEDINGS{Sund0002:Internet, AUTHOR="John Sundstrom and Eric Aupperle", TITLE="{Internet} Telephony {GVSU} to {WMU}", BOOKTITLE="Net@EDU Annual Member Meeting", INSTITUTION="Great Valley State University, MERIT", ADDRESS="Tempe, Arizona", DAYS=6, MONTH=feb, YEAR=2000, KEYWORDS="IP telephony; VoIP", ABSTRACT="11\% of telephone traffic goes to other universities. Uses trunk connection to MERIT network, costing \$19,000.", URL="http://www.educause.edu/netatedu/groups/voip/aupperle-sundstrom.ppt", } @INPROCEEDINGS{Rose0003:Integrating, AUTHOR="Jonathan Rosenberg and Lili Qiu and Henning Schulzrinne", TITLE="Integrating Packet {FEC} into Adaptive Voice Playout Buffer Algorithms on the {Internet}", BOOKTITLE=infocom, ADDRESS="Tel Aviv, Israel", MONTH=mar, YEAR=2000, KEYWORDS="FEC; packet loss; playout delay", ABSTRACT="Transport of real time voice traffic on the Internet is difficult for two reasons - network loss and network jitter. There has been substantial research in developing protocols and algorithms to combat these problems. Network loss is handled primarily through a variety of different forward error correction (FEC) algorithms and local repair operations at the receiver. Jitter has been compensated for by means of adaptive playout buffer algorithms at the receiver. Traditionally, these two mechanisms have been investigated in isolation. In this paper, we show the interactions between adaptive playout buffer algorithms and FEC, and demonstrate the need for coupling. We propose a number of novel playout buffer algorithms which provide this coupling, and demonstrate their effectiveness through simulations based on both network models and real network traces.", URL="http://www.cs.columbia.edu/~hgs/papers/Rose0003\_Integrating.pdf", } @INPROCEEDINGS{Bhat0003:Policy, AUTHOR="Randeep Bhatia and Jorge Lobo and Madhur Kohli", TITLE="Policy Evaluation for Network Management", BOOKTITLE=infocom, ADDRESS="Tel Aviv, Israel", MONTH=mar, YEAR=2000, LANGUAGE="English", KEYWORDS="Network management and control; Network architectures (protocols; algorithms; intelligent networks; reliability); Scheduling", ABSTRACT={Policies are increasingly being used to manage complex communication networks. In this paper we present our work on a "policy server" which is being used to provide centralized administration of packet voice gateways and "soft switches" in next generation circuit and packet telephony networks. The policies running in the policy server are specified using a domain independent policy description language PDL. This paper is motivated by the problem of evaluating policies specified in PDL. We present an algorithm for evaluating policies and study both its theoretical and empirical behavior. We show that the problem of evaluating policies is quite intractable. However we note that the hard instances of the policy evaluation problem are quite rare in real world networks. Under some very realistic assumptions we are able to show that our policy evaluation algorithm is quite efficient and well suited for enforcing policies in real networks. These results constitute the first attempt to develop a formal framework to study the informal concepts of policy based network management.}, URL="http://www.ieee-infocom.org/2000/papers/669.ps", } @TECHREPORT{Kise0003:Network, AUTHOR="Oleg Kiselyov", TITLE="A network file system over {HTTP:} remote access and modification of files and ``files''", TYPE="technical report", INSTITUTION="arXiv", NUMBER="cs.OS/0003064", NOTE="This present document combines a paper and a Freenix Track talk presented at a 1999 USENIX Annual Technical Conference, June 6-11, 1999; Monterey, CA, USA. The paper alone appeared in Proc. FREENIX Track: 1999 USENIX Annual Technical Conference, June 6-11,1999; Monterey, CA, USA, pp. 75-80.", MONTH=mar, YEAR=2000, KEYWORDS="network file system; HTTP", ABSTRACT="The goal of the present HTTPFS project is to enable access to remote files, directories, and other containers through an HTTP pipe. HTTPFS system permits retrieval, creation and modification of these resources as if they were regular files and directories on a local filesystem. The remote host can be any UNIX or Win9x/WinNT box that is capable of running a Perl CGI script and accessible either directly or via a web proxy or a gateway. HTTPFS runs entirely in user space. The current implementation fully supports reading as well as creating, writing, appending, and truncating of files on a remote HTTP host. HTTPFS provides an isolation level for concurrent file access stronger than the one mandated by POSIX file system semantics, closer to that of AFS. Both an API with familiar open(), read(), write(), close(), etc. calls, and an interactive interface, via the popular Midnight Commander file browser, are provided.", URL="http://arXiv.org/abs/cs/0003064", } @ARTICLE{Deos0003:Low, AUTHOR="A. A. Deosthali and S. R. McCaslin and Brian Evans", TITLE="A Low-Complexity {ITU-Compliant} Dual Tone Multiple Frequency Detector", JOURNAL=ieeesp, PAGES="911-916", MONTH=mar, YEAR=2000, REFERENCES=10, KEYWORDS="DTMF; tone detection", ABSTRACT="We present the first dual tone multiple frequency (DTMF) signal detector that meets the International Telecommunications Union (ITU) Q.24 DTMF standard when implemented on an 8-bit microcontroller. Key innovations include the use of adaptive notch filters and sophisticated decision logic. The DTMF detector is also well-suited for a multi-channel digital signal processor implementation.", URL="http://www.ece.utexas.edu/~bevans/papers/2000/dtmf/index.html", } @TECHREPORT{Dalg0003:True, AUTHOR="Ismail Dalgic and Michael S. Borella and Rick Dean and Jacek Grabiec and Jerry Mahler and Guido Schuster and Ikhlaq Sidhu", TITLE="True Number Portability and Advanced Call Screening in a {SIP-Based} {IP} Telephony System", TYPE="White Paper", INSTITUTION="3Com", ADDRESS="Santa Clara, California", MONTH=mar, YEAR=2000, KEYWORDS="Voice over IP; packet voice", ABSTRACT="Custom local area signaling service (CLASS) features offered in the public switched telephone network (PSTN) have certain limitations due to the closed nature of PSTN network signaling. The adoption of telephony over Internet Protocol (IP telephony) will enable a new paradigm of services and features that are not possible to implement in today's PSTN. This is especially the case for services that make use of personal, trusted information, which can be provided by a user's personal digital assistant (PDA). This paper demonstrates how personal information can be coupled with an IP telephony service to provide user-customized call handling by the network. It describes a demonstration architecture that includes Ethernet-attached phones running the Session Initiation Protocol (SIP), with an interface to synchronize with PDAs that supply personal information. The proposed architecture is quite flexible; it can support enhanced versions of current PSTN and private branch exchange (PBX) services, in addition to many new features and services. The paper discusses true number portability and advanced call screening as examples of new services in a hybrid PSTN/IP telephony environment.", URL="http://www.3com.com/technology/tech\_net/white\_papers/503054.html", } @TECHREPORT{Hamd0003:Voice, AUTHOR="Maher Hamdi and Olivier Verscheure and I. Dalgiç and Jean-Pierre Hubaux and Ping Wang", TITLE="Voice Service Interworking for {PSTN} and {IP} Networks", TYPE="White Paper", INSTITUTION="3Com", ADDRESS="Santa Clara, California", MONTH=mar, YEAR=2000, KEYWORDS="packet voice; voice over IP; H.323", ABSTRACT="In recent years, the Internet has proven its ability to carry real-time data, including voice. Today, a small amount of voice traffic has already been diverted from the public switched telephone network (PSTN) to the Internet. If it expands, this phenomenon could completely change the rules of the game for telecommunications. This paper presents an overview of the main technical problems to be addressed for the provision of interoperable services between IP telephony and the PSTN. The pivotal element of the solution resides in an interworking function (IWF). This function is typically implemented in a gateway whose requirements and behavior are here analyzed in terms of signaling and control protocols (control plane), user data transfer (user plane), and management features (management plane). The presentation is structured around these three planes. The control plane defines the set of signaling protocols to be used in each networking context and the translation between them. Detailed scenarios illustrate the signal translation in the gateway allowing for the establishment of a hybrid phone call. The user plane is responsible for adapting the user data to the properties of each network channel and determines the Quality of Service (QoS) of the voice call in terms of delay and speech quality. In the management plane, the issues of network, service, security, and policy management are discussed.", URL="http://www.3com.com/technology/tech\_net/white\_papers/503055.html", } @TECHREPORT{FCC0003:Trends, AUTHOR="Common Carrier Bureau", TITLE="Trends in Telephone Service", INSTITUTION="Federal Communications Commission", ADDRESS="Washington, D.C.", MONTH=mar, YEAR=2000, KEYWORDS="telephone system; statistics", URL="http://www.fcc.gov/Bureaus/Common\_Carrier/Reports/FCC-State\_Link/trends.html", } @ARTICLE{Azco0003:Iniciativas, AUTHOR="Arturo Azcorra", TITLE="Iniciativas para la nueva {Internet} en el mundo", JOURNAL="El Nuevo Lunes", MONTH=mar, YEAR=2000, URL="http://www.it.uc3m.es/entry/index.html", } @ARTICLE{Zhan0003:Efficient, AUTHOR="Yongbing Zhang and Sajal Das", TITLE="An efficient load-balancing algorithm based on a two-threshold cell selection scheme in mobile cellular networks", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="452-461", MONTH=mar, YEAR=2000, KEYWORDS="Mobile cellular networks; Channel assignment; Channel borrowing; Load balancing; Performance evaluation", ABSTRACT="In this paper, we design and analyze an efficient load-balancing algorithm for channel assignment in mobile cellular networks. Based on a two-threshold cell selection scheme, our algorithm employs a fixed channel assignment as an underlying strategy and attempts, at run-time, to balance dynamically the available channels between the cells. Two thresholds, light and heavy, are introduced to classify the cells in the system into three categorieslight, moderate, and heavy cellsaccording to the number of available channels in a cell. Whenever there exist any heavy cells, the load-balancing algorithm is activated by the MSC in order to borrow free channels from light cells to satisfy the demands of the heavy cells. When making a borrowing decision, the algorithm takes into account not only the state of a potential lender cell but also the states of the co-channel cells of the lender. The performance of our algorithm is evaluated and compared with other existing schemes.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/27/abstract.html", } @ARTICLE{Chan0003:Adaptive, AUTHOR="Da-Wei Chang and Hao-Ren Ke and Ruei-Chuan Chang", TITLE="Adaptive-level memory caches on World Wide Web servers", JOURNAL=cn, VOLUME=32, NUMBER=3, MONTH=mar, YEAR=2000, KEYWORDS="web server; memory cache; cache management policy; adaptive-level policy", ABSTRACT="Owing to the fast growth of World Wide Web (WWW), web traffic has become a major component of Internet traffics. Consequently, the reduction of document retrieval latency on WWW becomes more and more important. The latency can be reduced in two ways: reduction of network delay and improvement of web servers' throughput. Our research aims at improving a web server's throughput by keeping a memory cache in a web server's address space. In this paper, we focus on the design and implementation of a memory cache scheme. We propose a novel web cache management policy named the adaptive-level policy that either caches the whole file content or only a portion of it, according to the file size. The experimental results show three things. First, our memory cache is beneficial since, under our experimental workloads, the throughput improvement can achieve 32.7\%. Second, our cache management policy is suitable for current web traffic. Third, with the increasing popularity of multimedia files, our policy will outperform others currently used in WWW.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Afek0003:Phantom, AUTHOR="Yehuda Afek and Yishay Mansour and Zvi Ostfeld", TITLE="Phantom: a simple and effective flow control scheme", JOURNAL=cn, VOLUME=32, NUMBER=3, PAGES="277-305", MONTH=mar, YEAR=2000, KEYWORDS="flow control; congestion control; TCP flow control; ABR flow control", ABSTRACT="This paper presents Phantom, a simple constant space algorithm for rate-based flow control. As shown by our simulations, it converges fast to a fair rate allocation while generating a moderate queue length. While our approach can be easily implemented in ATM switches for managing available bit rate (ABR) traffic, it is also suitable for flow control in TCP router-based networks. Both the introduced overhead and the required modifications in TCP flow control systems are minimal. The implementation of this approach in TCP guarantees fairness and provides a unifying interconnection between TCP routers and ATM networks. The new algorithm easily inter-operates with current TCP flow control mechanisms and thus can be gradually introduced into installed-based TCP networks.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Ello0003:Simulation, AUTHOR="Omar Elloumi and Nada Golmie and Hossam Afifi and David Su", TITLE="A simulation-based study of {TCP} dynamics over {HFC} networks", JOURNAL=cn, VOLUME=32, NUMBER=3, PAGES="307-323", MONTH=mar, YEAR=2000, KEYWORDS="congestion avoidance; TCP; ATM; ACK compression; HFC", ABSTRACT="New broadband access technologies such as hybrid fiber coaxial (HFC) are likely to provide fast and cost effective support to a variety of applications including video on demand (VoD), inter-active computer games, and Internet-type applications such as Web browsing, ftp, e-mail, and telephony. Since most of these applications use TCP as the transport layer protocol, the key to their efficiency largely depends on TCP protocol performance. We investigate the performance of TCP in terms of effective throughput in an HFC network environment using different load conditions and network buffer sizes. We find that TCP experiences low throughput as a result of the well-known problem of ACK compression. An algorithm that controls ACK spacing is introduced to improve TCP performance.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Dole0003:Bounded, AUTHOR="Shlomi Dolev and Alexander Kesselman", TITLE="Bounded latency scheduling scheme for {ATM} cells", JOURNAL=cn, VOLUME=32, NUMBER=3, PAGES="325-331", MONTH=mar, YEAR=2000, KEYWORDS="scheduling; switch; bipartite matching", ABSTRACT="Scheduling ATM cell schemes for an (optical) ATM switch can dramatically influence the performance of the ATM communication network. In this work, we present an efficient scheduling algorithm that is based on perfect bipartite matching. The algorithm ensures fairness, providing a guaranteed latency bound for each arriving cell.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Peha0003:Dynamic, AUTHOR="Jon M. Peha", TITLE="Dynamic pricing and congestion control for best-effort {ATM} services", JOURNAL=cn, VOLUME=32, NUMBER=3, PAGES="333-345", MONTH=mar, YEAR=2000, KEYWORDS="ATM; best-effort traffic; congestion control; integrated services networks; pricing; smart market", ABSTRACT="Several researchers have recently advocated dynamic pricing mechanisms such as the smart market. This paper explores how dynamic state-dependent pricing and explicit congestion control can both be used to avoid and alleviate congestion. Dynamic pricing has significant advantages for heterogeneous traffic, although this paper demonstrates that this approach reduces raw throughput. It is shown that when propagation delay is non-trivial, as is the case in wide-area networks, a slow-reacting version of dynamic pricing is preferable. This paper also advocates the use of novel stream-oriented best-effort ATM services with which a stream's arrival process is declared to the network before transmission begins and then policed, although there are no performance guarantees and none of these best-effort streams are ever blocked. With this approach, it is possible to provide price incentives for applications to decrease traffic burstiness, and to reveal important information about their packet streams, making mechanisms like slow-reacting dynamic pricing more practical.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Kang0003:Interoperability, AUTHOR="Sungwon Kang and Jaehwi Shin and Myungchul Kim", TITLE="Interoperability test suite derivation for communication protocols", JOURNAL=cn, VOLUME=32, NUMBER=3, PAGES="347-364", MONTH=mar, YEAR=2000, KEYWORDS="communication protocol testing; interoperability testing; automatic test generation; TTCN; ATM", ABSTRACT="This paper addresses the problem of interoperability testing for communication protocols. We develop a coherent framework of interoperability testing in which the notions of interoperability, interoperability testing, interoperability test case and interoperability test architecture are interrelated and a systematic interoperability test suite derivation method based on the framework. The approach to interoperability testing is illustrated with the example of the ATM Signaling Protocol. To demonstrate practicality of the approach, we implemented executable test suites derived by the method on a commercial ATM test platform, applied them for interoperability testing of various ATM equipment and analyzed the testing results.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Pull0003:Network, AUTHOR="J. Mark Pullen", TITLE="The Network Workbench: network simulation software for academic investigation of {Internet} concepts", JOURNAL=cn, VOLUME=32, NUMBER=3, PAGES="365-378", MONTH=mar, YEAR=2000, KEYWORDS="network protocols; simulation; education projects", ABSTRACT="Simulation offers significant advantages as a basis for academic projects in computer networking. Because many unimportant details can be abstracted away, and also because simulations can be completely repeatable, it is possible to address the same concepts more quickly than is possible with actual networks. At the same time, students who program a protocol for a network simulator come to understand the protocol much better than if they learn only from reading and lectures. This paper reports on a new network simulator, the Network Workbench, which is intended for use in the academic environment. It is based on discrete event simulation and structured around a five-layer stack abstracted from the Internet protocols (TCP/IP family). While the Workbench is less powerful than some tools used for investigation of larger networks or more complex protocols, it has compensating advantages. Its use can be learned quickly and it is sufficiently powerful, comprehensive, and extensible to allow investigation of a considerable range of problems. The Workbench, which is available to the academic community under no-cost license, includes a set of protocol programming exercises for introductory networking courses and it also has proved usable for more advanced student research projects. This paper describes the philosophy behind the Workbench, gives a brief outline of its history, explains its internal structure, and describes its use in computer network teaching and research.", URL="http://www.elsevier.com/locate/comnet", } @ARTICLE{Dixi0003:WDM, AUTHOR="Sudhir Dixit and Antti Ylä-Jääski", TITLE="{WDM} Optical Networks: A Reality Check", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, URL="http://www.comsoc.org/ci1/private/2000/mar/Gsteddixit.html", } @ARTICLE{Bone0003:Optical, AUTHOR="Paul Bonenfant and Antonio Rodriguez-Moral", TITLE="Optical Data Networking", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=16, ABSTRACT="We challenge current thinking about IP over WDM by outlining a path to optical data networking that includes multiple data networking protocols coupled with a protocol-neutral optical networking infrastructure. Included is a discussion of the diversity of data networking protocols and network architectures for optical data networking.", URL="http://www.comsoc.org/ci1/private/2000/mar/Bonenfant.html", } @ARTICLE{Ghan0003:IP, AUTHOR="Nasir Ghani and Sudhir Dixit and Ti-Shiang Wang", TITLE="On {IP-over-WDM} Integration", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=19, ABSTRACT="Expanding Internet-based services are driving the need for evermore bandwidth in the network backbone. These needs will grow further as new real-time multimedia applications become more feasible and pervasive. Currently, there is no other technology on the horizon that can effectively meet such a demand for bandwidth in the transport infrastructure other than WDM technology. This technology enables incremental and quick provisioning up to and beyond two orders of magnitude of today's fiber bandwidth levels. This precludes the need to deploy additional cabling and having to contend with right-of-way issues, a key advantage. Hence, it is only natural that over time optical/WDM technology will migrate closer to the end users, from core to regional, metropolitan, and ultimately access networks. At present, WDM deployment is mostly point-to-point and uses SONET/SDH as the standard layer for interfacing to the higher layers of the protocol stack. However, large-scale efforts are underway to develop standards and products that will eliminate one or more of these intermediate layers (e.g., SONET/SDH, ATM) and run IP directly over the WDM layer. IP over WDM has been envisioned as the winning combination due to the ability of the IP to be the common revenue-generating convergence sublayer and WDM as a bandwidth-rich transport sublayer. Various important concerns still need to be addressed regarding IP-WDM integration. These include lightpath routing coupled with tighter interworkings with IP routing and resource management protocols, survivability provisioning, framing/monitoring solutions, and others.", URL="http://www.comsoc.org/ci1/private/2000/mar/Ghani.html", } @ARTICLE{Elmi0003:Wavelength, AUTHOR="Jaafar Elmirghani and Hussein Mouftah", TITLE="All-Optical Wavelength Conversion: Technologies and Applications in {DWDM} Networks", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=9, ABSTRACT="Dense WDM technologies make effective use of the vast fiber bandwidth and offer an added dimension to all-optical networks. Wavelength conversion at key network nodes is emerging as a fundamental functionality that can allow transparent interoperability, contention resolution, wavelength routing, and, in general, better utilization of the network resources under dynamic traffic patterns. In this contribution we offer an overview of the enabling technologies and extend the treatment to the network application of these converters. Attention is given to semiconductor optical amplifiers and their use in wavelength converters. Converters based on four-wave mixing as well as those based on nonlinear optical loop mirrors are evaluated, paying special attention to signal integrity and architectural as well as performance issues. The use of wavelength converters in wavelength routing networks is explored together with the application of these devices in contention resolution and in the routing wavelength assignment problem. Future directions are outlined at the system as well as network levels.", URL="http://www.comsoc.org/ci1/private/2000/mar/Elmirghani.html", } @ARTICLE{Okam0003:Robust, AUTHOR="Satoru Okamoto and Masafumi Koga and Hiro Suzuki and Kenji Kawai", TITLE="Robust Photonic Transport Network Implementation with Optical Cross-Connect Systems", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=10, ABSTRACT="We adopt the optical path concept to develop a photonic transport network. Because robustness is critical in a nationwide backbone network, we implement, as a first step, digital frame-based optical path network systems. NTT has developed several types of photonic transport systems. They are an optical path cross-connect system which has little quality of service monitoring large-scale integration circuitfor each wavelength; a photonic transport payload assembler-disassembler, which accommodates client signals into optical path payloads and vice versa; and a repeater. The implementation of a PTS is depicted. A network-element-level operating system and an optical-network-level operating system are required to operate the WDM photonic transport network. We introduce a TMN-based network operating system. Finally, an overview of NTT's photonic transport network trial is presented.", URL="http://www.comsoc.org/ci1/private/2000/mar/Okamoto.html", } @ARTICLE{Gers0003:Optical, AUTHOR="Ornan Gerstel and Rajiv Ramaswami", TITLE="Optical Layer Survivability: A Services Perspective", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=12, ABSTRACT="This article provides a perspective on optical layer protection and restoration based on the services offered by carriers using the optical layer. This is different from other viewpoints that provide a taxonomy of protection techniques in a more abstract fashion for the purposes of standardization. The latter viewpoints are mostly based on the classification adopted in the SONET/SDH standards. In contrast, taking a services-based view provides a way to distinguish between protection schemes based on implementation costs and the associated services enabled by the protection scheme.", URL="http://www.comsoc.org/ci1/private/2000/mar/Ramaswami.html", } @ARTICLE{Stru0003:Application, AUTHOR="Kris Struyve and Nico Wauters and Pedro Falcao and Peter Arijs and Didier Colle and Piet Demeester and Paul Lagasse", TITLE="Application, Design, and Evolution of {WDM} in {GTS's} Pan-European Transport Network", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=10, ABSTRACT="A pan-European transport network must cope with enormous traffic inflation by introducing appropriate network solutions. WDM technology is the solution adopted by GTS, driven by capacity requirements, infrastructure availability, flexibility, and cost. The deployment of this new technology presents specific technical issues, but more important, it lays the foundation of future optical networking. In this article we describe the motives underlying the deployment of WDM technology in the long-haul and short-haul areas of GTS's operational transport network. Next, after presenting the use of WDM as the multiservice platform for SDH and IP overlay networks as well as native WDM services, we focus on the design of SDH-over-WDM and IP-over-WDM networks. Finally, we discuss future WDM networking and management requirements to better serve the needs of a pan-European carrier such as GTS.", URL="http://www.comsoc.org/ci1/private/2000/mar/Struyve.html", } @ARTICLE{Chen0003:Evolution, AUTHOR="Thomas Chen", TITLE="Evolution to the Programmable {Internet}", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=13, ABSTRACT="This article explores possible transitional steps to add programmability into the Internet: label switching for flexible packet forwarding, open programming interfaces, active packets for dynamic service control, and mobile agents. With a programmable Internet, service providers and users will be able to gain a degree of flexible control over their network services and take advantage of the full potential of the Internet.", URL="http://www.comsoc.org/ci1/private/2000/mar/Chen.html", } @ARTICLE{Kulk0003:Composing, AUTHOR="Amit Kulkarni and Gary Minden", TITLE="Composing Protocol Frameworks for Active Wireless Networks", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=10, ABSTRACT="This article describes a new model for a composible protocol framework that is suitable for the rapid development of any application-specific service and its deployment in the network. The class-hierarchy model described here enables users to compose their own custom, flexible frameworks from either predefined or custom protocol components tailored to an application's needs. We validate experimentally that application-specific frameworks implementing custom protocols can be developed to improve performance of applications over wireless networks.", URL="http://www.comsoc.org/ci1/private/2000/mar/Kulkarni.html", } @ARTICLE{Raz0003:Active, AUTHOR="Danny Raz and Yuval Shavitt", TITLE="Active Networks for Efficient Distributed Network Management", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=14, ABSTRACT="The emerging next generation of routers exhibit both high performance and rich functionality, such as support for virtual private networks and QoS. To achieve this, per-flow queuing and fast IP filtering are incorporated into the router hardware. The management of a network comprising such devices and efficient use of the new functionality introduce new challenges. A truly distributed network management system is an attractive candidate to address these challenges. In this article we describe how active network techniques can be used to allow fast and easy deployment of distributed network management applications in IP networks. We describe a prototype system where legacy routers are enhanced with an adjunct active engine, which enables the safe execution and rapid deployment of new distributed management applications in the network layer. This system can gradually be integrated in today's IP network, and allows smooth migration from IP to programmable networks. This is done with an emphasis on efficient use of network resources, which is somewhat obscure by many of today's high-level solutions.", URL="http://www.comsoc.org/ci1/private/2000/mar/Shavitt.html", } @ARTICLE{Brun0003:Service, AUTHOR="Marcus Brunner and Rolf Stadler", TITLE="Service Management in Multiparty Active Networks", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=6, ABSTRACT="Active networking is an expanding field of research. It includes the ability to easily install and modify customized network services and to process packets within the network in a customized way. This article addresses the question of how the benefits of active networking can be exploited in an environment where a large number of customers must share a common network infrastructure. We introduce a management framework for active networks that allows customers to deploy and manage their own active services in a provider domain. The key concept in our framework is the Virtual Active Network. From the customer perspective, the VAN represents an environment in which the customer can install, run, and manage active services without interaction with the VAN provider. From the VAN provider perspective, the VAN represents the object of resource partitioning and customer isolation. Active networking combined with the VAN concept allows for new business models in the telecom industry.", URL="http://www.comsoc.org/ci1/private/2000/mar/Brunner.html", } @ARTICLE{Gao0003:Programmable, AUTHOR="Jun Gao and Peter Steenkiste and Eduardo Takahashi and Allan Fisher", TITLE="A Programmable Router Architecture Supporting Control Plane Extensibility", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=10, ABSTRACT="The Internet is evolving from an infrastructure that provides basic communication services into a more sophisticated infrastructure that supports a wide range of electronic services such as virtual reality games and rich multimedia retrieval services. However, this evolution is happening only slowly, in part because the communication infrastructure is too rigid. In this article we present a programmable router architecture in which the control plane functionality of the router can be extended dynamically through the use of delegates. Delegates can control the behavior of the router through a well-defined control interface, allowing service providers and third-party software vendors to implement customized traffic control policies or protocols. We describe Darwin, a system that implements such an architecture. We emphasize the runtime environment the system provides for delegate execution and the programming interface the system exports to support delegates. We demonstrate the advantages of using this system with two delegate examples.", URL="http://www.comsoc.org/ci1/private/2000/mar/Gao.html", } @ARTICLE{Putz0003:Phoenix, AUTHOR="David Putzolu and Sanjay Bakshi and Satyendra Yadav and Raj Yavatkar", TITLE="The Phoenix Framework: A Practical Architecture for Programmable Networks", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=6, ABSTRACT="Programmable networks allow third parties to dynamically reprogram switches and routers in order to extend their functionality [1]. This approach facilitates new capabilities such as dynamic reallocation of resources, automated healing from malfunctions and failures, customized information processing, and easier service creation. These capabilities enable rapid customization of the network by providing mechanisms to adapt to new applications such as multimedia, multicast, intrusion detection, and intranet firewalls. In this article we describe Intel's framework for programmable networks, known as Phoenix. The objective of the Phoenix framework is to make it easier to deploy new network services that leverage the emerging trend toward use of reprogrammable network processors. To accomplish this goal the Phoenix framework defines an extensible mobile agent system and a set of device functionality abstractions for utilizing and extending network capabilities. We also discuss how the open interfaces provided by the Phoenix framework can be utilized to deploy new network services.", URL="http://www.comsoc.org/ci1/private/2000/mar/Putzolu.html", } @ARTICLE{Gors0003:Broadband, AUTHOR="Steve Gorshe and Zdzislaw Papir", TITLE="Topics in Broadband: Last Mile Solutions", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, URL="http://www.comsoc.org/ci1/private/2000/mar/Gstedpapir.html", } @ARTICLE{Cler0003:Mitigation, AUTHOR="Luc de Clercq and Miguel Peeters and Sigurd Schelstraete and Thierry Pollet", TITLE="Mitigation of Radio Interference in {xDSL} Transmission", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=10, ABSTRACT="The twisted pair copper access network was originally intended as a transmission medium for low-bandwidth analog voice signals. Unlike voiceband modems that operate in this frequency band, emerging high-speed digital transmission systems like ADSL and VDSL use a much larger spectrum. Because VDSL signals contain frequencies up to several megahertz, these broadband signals are susceptible to more hostile noise conditions. This article identifies the different noise impairments and shows how their effect can be mitigated in multicarrier-based VDSL systems.", URL="http://www.comsoc.org/ci1/private/2000/mar/Pollet.html", } @ARTICLE{Coop0003:ATM, AUTHOR="Ian R. Cooper and Mick A. Bramhall", TITLE="{ATM} Passive Optical Networks and Integrated {VDSL}", JOURNAL=ieeecm, VOLUME=38, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=10, ABSTRACT="VDSL offers a cost effective solution for the provision of a full-service broadband access network. Standards are emerging that will define the line code, duplexing method, and spectrum requirements for VDSL. VDSL chipsets and modules are becoming available that allow the technology to be evaluated in the field. This article describes the architecture and hardware integration that has been performed in integrating VDSL technology into an ATM PON system.", URL="http://www.comsoc.org/ci1/private/2000/mar/Cooper.html", } @ARTICLE{Valk0003:Efficiency, AUTHOR="A. G. Valk and Andrew T Campbell", TITLE="An efficiency limit of cellular mobile systems", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="441-451", MONTH=mar, YEAR=2000, KEYWORDS="Cellular system; Mobile communication; Performance analysis", ABSTRACT="In order to limit handoff blocking probability, in cellular systems admission control can be applied to new call requests and resources reserved for future handoff attempts. Such resource reservation strategies have been widely studied in the literature. The denial of new call attempts, however, impacts system throughput creating a trade-off with handoff performance. The contribution of this paper is an analytical investigation of this trade-off. In particular, we study the impact of handoff on a cellular system's efficiency which we define as the system's throughput normalized by the theoretically optimal throughput at zero user mobility. As a reference case, we first determine the efficiency of a hypothetical system with deterministic advance reservation. Next, we consider systems with statistical reservation and calculate the maximum achievable efficiency, under the set of possible local admission control strategies subject to a hard constraint on the probability of call failure due to handoff blocking. Local admission control strategies are investigated because they represent efficient, yet simple strategies that lend themselves to easy implementation. We note that trunk reservation is a special case of local policies. We relate the calculated efficiency bound to call and mobility characteristics and show that the achievable efficiency decreases with decreasing cell size and with the increasing proportion of multimedia calls, both of which are recognized trends today.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/26/abstract.html", } @ARTICLE{Mark0003:Optimal, AUTHOR="J. G. Markoulidakis and J. E. Dermitzakis and G. L. Lyberopoulos and M. E. Theologou", TITLE="Optimal system capacity in handover prioritised schemes in cellular mobile telecommunication systems", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="462-475", MONTH=mar, YEAR=2000, KEYWORDS="Cutoff priority scheme; Radio resource management; QoS", ABSTRACT="This paper investigates the issue of capacity maximisation in the presence of new call and handover requests in cellular mobile telecommunication systems. Initially, both non-prioritised and prioritised handover schemes are analysed leading to the identification of the optimal configuration (e.g. number of reserved channels, queue length) in order to maximise the system capacity. The `guard channels' prioritised scheme is analysed in the sequel and it is proved that it does not maximise the system capacity, however, it approximates the optimal configuration. Finally, a new handover prioritised scheme, which achieves the maximum system capacity, is proposed and analysed. This scheme is based on a new resource management scheme: the `unequally shared channels', which are allocated to new calls and handovers with a different priority determined by a single control parameter.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/28/abstract.html", } @ARTICLE{Lin0003:Channel, AUTHOR="Philip Lin and Yu-Dar Lin", TITLE="Channel assignment for {GSM} half-rate and full-rate traffic", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="476-482", MONTH=mar, YEAR=2000, KEYWORDS="Global system for mobile communications; Full-rate; Half-rate", ABSTRACT="Global System for Mobile Communications (GSM) supports full-rate and half-rate calls. In this paper, we propose analytical and simulation models to study the performance of four channel assignment schemes for GSM half-rate and full-rate traffic. Our study indicates that among the four schemes, the repacking scheme has the best performance for mixing half-rate and full-rate traffic. We also observe that good performance is expected if the standard derivation of the cell residence time for a mobile station is large.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/29/abstract.html", } @ARTICLE{Lim0003:Message, AUTHOR="Kong-Seng Lim and Mohan Kumar and Sajal Das", TITLE="Message ring-based channel reallocation for cellular wireless networks", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="483-498", MONTH=mar, YEAR=2000, KEYWORDS="Wireless communication; Channel allocation; Bandwidth; Channel borrowing; Performance study", ABSTRACT="Wireless communication suffers from many restrictions due to the inherent limitations of wireless media and existing wireless communication protocols. Limited radio frequency spectrum (or bandwidth) is one of the major issues in wireless communication. Wireless multiple access techniques were first developed to enhance channel bandwidth utilisation under limited frequency. Different channel allocation (or channel assignment) schemes have been developed to further increase the utilisation of limited frequency. In this paper we propose a frequency reallocation scheme, message ring-based channel reallocation (MRCR) to improve channel utilisation in wireless communication systems. MRCR uses software agents (known as BS ring agents) to circulate and maintain a message ring that carries bandwidth information. The ring agent is also responsible for borrowing channels and locking the co-channels to avoid interference. MRCR uses channel re-arrangement techniques to improve performance. We present results of simulation studies to demonstrate the effectiveness of the MRCR scheme. Simulation experiments were carried out to evaluate the performance of the MRCR scheme under different mobility environments, namely: (i) high; (ii) medium; and (iii) low. Tests were also conducted under normal and heavy traffic environments to compare the MRCR scheme with other existing schemes. Results show that the MRCR scheme performs better than other schemes under varying mobility and traffic load environments.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/30/abstract.html", } @ARTICLE{Zhan0003:Admission, AUTHOR="Liren Zhang and Xun Cheng and K. R. Subramanian", TITLE="The admission control for integrated video-conferencing/voice/data services in broadband {CDMA} networks", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="499-510", MONTH=mar, YEAR=2000, KEYWORDS="CDMA; Admission control; Integrated services; QoS; Network utilization", ABSTRACT="We examine the performance of admission control for the integrated video-conferencing, voice and data services in broadband CDMA networks using analytical methods. The traffic access is based on the Packet Reservation Multiple Access (PRMA) protocol. For the admission control of video-conferencing and voice calls, firstly, we investigate a scheme by introducing a threshold which limits the active subscribers in the network, so that the quality of service (QoS) can be guaranteed. Secondly, we investigate another scheme which uses a Markovian decision process to optimize the performance of voice and video conferencing traffic. The performance of these admission control schemes is evaluated in terms of call blocking probability and idle-slot probability. For data transfer applications, the admission control is investigated under two different schemes: threshold control scheme and graceful degradation control scheme. Their performance is evaluated in terms of throughput, average delay and data packet loss probability.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/31/abstract.html", } @ARTICLE{Pan0003:Broadcast, AUTHOR="Kuang-Hung Pan and Hsiao-Kuang Wu and Rung-Ji Shang and Feipei Lai", TITLE="Performance analysis of broadcast in mobile ad hoc networks with synchronized and non-synchronized reception", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="511-524", MONTH=mar, YEAR=2000, KEYWORDS="Network protocols; Performance analysis; Mobile ad hoc networks; Distributed broadcast algorithms", ABSTRACT="Analyzing the performance of broadcast in mobile ad hoc networks is necessary because of the importance of broadcast in multiuser communications and the characteristic difference between wireless communications and wired communications. If the time lag between collided packets is small on the order of a symbol, the reception is synchronized; otherwise, the reception is non-synchronized. We find that there is a time complexity gap exponential with the degree of the network between the performance of synchronized and non-synchronized reception. Besides, we also take into account the possibility that a processor is busy with other tasks, and we find that allowing the processors to be temporarily busy with other tasks will not degrade the performance significantly.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/32/abstract.html", } @ARTICLE{Lomb0003:Soft, AUTHOR="Steven Lombardi and Weihua Zhuang", TITLE="Soft handoff in a {CDMA} wireless {ATM} environment", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="525-532", MONTH=mar, YEAR=2000, KEYWORDS="Handoff; Wireless multimedia communications; Code-division multiple access; Packet loss", ABSTRACT="Future wireless asynchronous transfer mode (ATM) networks present a number of mobility related challenges. Handoffs due to user mobility require network signaling to maintain the communication link and may result in packet loss due to packet misrouting and/or misordering. This paper proposes a handoff solution for an ATM-based code division multiple access (CDMA) packet switched wireless environment. The proposed solution combines soft handoff and the modified nearest common node rerouting (NCNR) to meet the challenges of wireless ATM. It is shown that, compared with the hard handoff approach, the proposed solution reduces the number of control signals required for handoff and the volume of buffered information packets during handoff, mitigates the problem of packet misrouting and misordering, and significantly improves the radio link transmission accuracy.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/33/abstract.html", } @ARTICLE{Kalo0003:Location, AUTHOR="Alexandros Kaloxylos and Evangelos Zervas and Lazaros Merakos", TITLE="Location management in wireless {ATM} customer premises networks", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="533-549", MONTH=mar, YEAR=2000, KEYWORDS="Wireless ATM; Location management; PNNI", ABSTRACT="This paper introduces a new location management protocol, called LAMPS (Location Agents and Mobile PNNI Scheme), that is suitable for wireless ATM customer premises networks. LAMPS takes advantage of the PNNI routing functionality to advertise the movement of mobile terminals within pre-defined areas. Furthermore, it uses specialized entities to store and retrieve the current location area of the mobile terminals. These entities are located within mobility enhanced switches, that provide to mobile terminals connectivity with the rest of the network and supervise the execution of all mobility related procedures. In this paper, we compare LAMPS with similar mechanisms and we present the advantages that arise from its application. The efficiency of the protocol is demonstrated by the results of an analytical model.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/34/abstract.html", } @ARTICLE{Suh0003:Hierarchical, AUTHOR="Bong-sue Suh and Jin-seek Choi and Jae-kyoon Kim", TITLE="Design and performance analysis of hierarchical location management strategies for wireless mobile communication systems", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="550-560", MONTH=mar, YEAR=2000, KEYWORDS="Location management; Hierarchical scheme; Wireless mobile systems", ABSTRACT="In this paper, we propose three hierarchical location management strategies for wireless mobile communication systems. The first one is home server first (HSF) scheme in which callee's location is queried at callee's home location server first. Next, we propose least-common-ancestor server first (LSF) scheme in which a search starts at the least-common-ancestor server of caller's current location and callee's home server. Finally, we propose distributed LSF in which the location management is made on 2-layered distributed structure. We evaluate the performance of the proposed schemes and compare it with that of another hierarchical scheme proposed by Wang (J.Z. Wang, A fully distributed location registration strategy for universal personal communication systems, IEEE J. Select. Areas Communication, 11(6) (1993) 850-860) and IS-41-based scheme. It is shown that the proposed schemes have reduced location management cost and that the cost is less affected by the increment of communication cost than the compared schemes.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/35/abstract.html", } @ARTICLE{Kris0003:Fast, AUTHOR="Govind Krishnamurthi and Stefano Chessa and A. K. Somani", TITLE="Fast recovery from database/link failures in mobile networks", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="561-574", MONTH=mar, YEAR=2000, KEYWORDS="PCS networks; Database failures; Recovery protocol; Location management; Distributed database recovery", ABSTRACT="An important issue in the design of future Personal Communication Services (PCS) networks is the efficient management of location information. The current IS-41 standard PCS architecture uses a centralized database, the Home Location Register (HLR), to store service and location information of each mobile registered in the PCS network. If the HLR fails, all incoming calls to a mobile from hosts which are not in the same location area as the mobile are lost. Location updates from mobiles to the HLR are also lost. Once the HLR is functional it cannot direct calls to mobiles immediately as mobiles could have changed their location during the HLR's failure. Fast recovery from a failure of the HLR is hence important. A link failure in the network could partition the network resulting in a loss of location updates from mobiles affected by the failed link. We present a new protocol for fast recovery of the HLR after a HLR failure or an intermediate link failure. The protocol does not require use of wireless bandwidth during the recovery process, has a bounded recovery period and is simple to implement making it an appealing choice in the design of future mobile networks. We analyze the protocol in order to find a medium between protocol cost and the recovery interval. We use the protocol to recover from VLR failures. We then use the protocol to recover from database failures in a distributed database architecture.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/36/abstract.html", } @ARTICLE{Boyd0003:Key, AUTHOR="C. Boyd and Anish Mathuria", TITLE="Key establishment protocols for secure mobile communications: a critical survey", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="575-587", MONTH=mar, YEAR=2000, KEYWORDS="Key management; Mobile communications; Communications security", ABSTRACT="We analyse several well-known key establishment protocols for mobile communications. The protocols are examined with respect to their security and suitability in mobile environments. In a number of cases weaknesses are pointed out, and in many cases refinements are suggested, either to improve the efficiency or to allow simplified security analysis.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/37/abstract.html", } @ARTICLE{Ganz0003:Security, AUTHOR="Aura Ganz and Sung-Woo Park and Zvi Ganz", TITLE="Security broker for multimedia wireless {LANs}", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="588-594", MONTH=mar, YEAR=2000, KEYWORDS="Multimedia; Wireless LANs; Security broker", ABSTRACT="To secure interactive multimedia applications in wireless LANs (WLANs), it is pertinent to implement a number of security services such as authentication, key exchange and real-time encryption/decryption. WLANs, though, present a complex and challenging environment for implementing such security services since these services may deplete the limited network resources and increase the burden of supporting quality of service for multimedia applications. Consequently, a broker is needed to mediate proper security considering inputs such as user security requirements, user security literacy, available network resources, and security routines performance. In this paper we introduce a Security Broker that we have designed to fulfill these complex mediation needs. This broker is implemented in software and tested in a wireless LAN testbed. The reported security broker design and implementation considers the wireless LAN environment as well as the multimedia applications' Quality of Service requirements such as delay and throughput. We also introduce an Inline encryption/decryption software that encrypts/decrypts traffic on the fly.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/38/abstract.html", } @ARTICLE{Pill0003:Distributed, AUTHOR="R. Radhakrishna Pillai and M. Rangnath and Rajeev Agrawal and W. Wang", TITLE="Distributed control of wireless {ATM} networks using {CORBA}", JOURNAL=comcom, VOLUME=23, NUMBER=5, PAGES="595-604", MONTH=mar, YEAR=2000, KEYWORDS="Wireless ATM; Open signalling; CORBA; Mobility management", ABSTRACT="This paper reports the design, implementation, and performance evaluation of a CORBA based distributed control architecture for signalling and mobility management in the Wireless ATM Research project (WARP). The distributed control architecture makes use of open signalling to manipulate the various network resources to realise network services such as call control, multicast, and mobility management. Open signalling provides the flexibility and ease in creating new network services as opposed to standard signalling approaches such as the ATM Forum signalling. The network control architecture provides inter-working with the ATM Forum UNI signalling. The open signalling is found to be more flexible compared to the UNI-PNNI based signalling and yields comparable delay performance.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/30/39/abstract.html", } @ARTICLE{Ural0003:Test, AUTHOR="Hasan Ural and K. Saleh and A. C. Williams", TITLE="Test generation based on control and data dependencies within system specifications in {SDL}", JOURNAL=comcom, VOLUME=23, NUMBER=7, PAGES="609-627", MONTH=mar, YEAR=2000, KEYWORDS="Specification and description language; Software testing; Data flow oriented test generation and test selection", ABSTRACT="In Specification and Description Language (SDL), a distributed system is viewed as a collection of communicating processes and its behavior is specified in terms of definitions of these processes. In particular, the desired control and data dependencies that must be established by a potential implementation of the system are expressed in SDL in terms of Extended Finite State Machine representations of communicating processes. To test the control and data flow aspects of the system, such dependencies in a system specification must be identified and utilized for the construction of tests. Based on a model which exposes the control and data dependencies within a specification of a distributed system given in SDL, this paper investigates the generation of tests for the data flow aspects of a system implementation, through the application of data flow oriented test selection criteria which have been originally proposed for testing programs written in procedural languages.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/31/25/abstract.html", } @ARTICLE{Shie0003:HIPa, AUTHOR="Clay Shields and J. J. Garcia-Luna-Aceves", TITLE="{HIPa} protocol for hierarchical multicast routing", JOURNAL=comcom, VOLUME=23, NUMBER=7, PAGES="628-641", MONTH=mar, YEAR=2000, ABSTRACT="This paper presents a new, flexible approach to inter-domain multicast routing. The HIP protocol introduces the idea of", } @ARTICLE{Kone0003:Test, AUTHOR="O. Koné and R. Castanet", TITLE="Test generation for interworking systems", JOURNAL=comcom, VOLUME=23, NUMBER=7, PAGES="642-652", MONTH=mar, YEAR=2000, KEYWORDS="Protocol engineering; Automatic test generation; Conformance; Interoperability; On the fly approach", ABSTRACT="Testing is an experimental method aimed at checking the correctness of a system implementation. Industrial companies are paying enormously for test development, as the presence of faults in distributed systems is not always tolerable. The interest for interworking systems testing is growing as these systems are more and more involved in the design of new communication standards. But testing interworking systems faces state space explosion problem due to concurrency. This paper proposes an on the fly technique to avoid combinatory explosion. The proposed method automatically computes tests sequences from interworking subsystem specifications. A case study with the B-ISDN ATM is provided to illustrate the results.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/31/27/abstract.html", } @ARTICLE{Huan0003:Group, AUTHOR="Yu-Ching Huang and Philip McKinley", TITLE="Group leader election under link-state routing", JOURNAL=comcom, VOLUME=23, NUMBER=7, PAGES="653-666", MONTH=mar, YEAR=2000, ABSTRACT="In this work, we place a long-established distributed computing problem in a new context. Specifically, the group leader election problem is studied", } @ARTICLE{Neve0003:TAMCRA, AUTHOR="H. De Neve and Piet Van Mieghem", TITLE="{TAMCRA:} a tunable accuracy multiple constraints routing algorithm", JOURNAL=comcom, VOLUME=23, NUMBER=7, PAGES="667-679", MONTH=mar, YEAR=2000, KEYWORDS="Routing; Quality of service; NP-complete", ABSTRACT="Routing with more than one additive constraint is known to be an NP-complete problem, and hence considered as intractable. We present a new QoS routing algorithm, called the Tunable Accuracy Multiple Constraints Routing Algorithm (TAMCRA), which can solve multiple constraints problems with a finite but small probability of missing a path that satisfies all constraints while the probability of missing such a path is tunable with a single parameter k. We demonstrate that this algorithm scales very well as the size of the graph increases or as the number of constraints increases.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/31/29/abstract.html", } @ARTICLE{Lai0003:Reducing, AUTHOR="Wai-Sum Lai and Kwin-Yee Lin", TITLE="Reducing the protocol overheads of {LANE} in the {MPOA} protocol", JOURNAL=comcom, VOLUME=23, NUMBER=7, PAGES="680-694", MONTH=mar, YEAR=2000, KEYWORDS="Mpoa; lane; ipoa; iasg", ABSTRACT="The ATM networks have been widely adopted as the backbone networks. LAN Emulation (LANE) is adopted by the Multi-Protocol over ATM (MPOA) protocol for intra-Internet Address Sub Groups (IASG) communication. In LANE, the edge devices have become performance bottlenecks. The ATM-attached hosts and the dual-stack hosts, which run the LAN emulation protocol on them, have also encountered performance bottlenecks. In this paper, we will focus on how to improve the intra-IASG communication. We propose a modified MPOA protocol. The details of changes and flows are explained. The modified MPOA protocol improves the performance of the intra-IASG communication, simplifies the process of establishing a connection, eases the loads of both the LES and the BUS, increases the efficiency of the edge devices and the dual-stack hosts and allows the ATM-attached hosts which run the IPOA protocol to be part of the MPOA protocol.", URL="http://www.elsevier.nl/gej-ng/10/15/19/39/31/30/abstract.html", } @ARTICLE{Lai0003:Control, AUTHOR="Wai Sum Lai and Robert Cooper", TITLE="Performance and control of network systems", JOURNAL=pe, VOLUME=40, NUMBER=1, PAGES=1, MONTH=mar, YEAR=2000, URL="http://www.elsevier.nl/gej-ng/10/35/22/43/23/23/article.pdf", } @ARTICLE{Hali0003:Waiting, AUTHOR="Gerhard Haßlinger", TITLE="Waiting time, busy periods and output models of a server analyzed via Wiener-Hopf factorization", JOURNAL=pe, VOLUME=40, NUMBER=1, PAGES="3-26", MONTH=mar, YEAR=2000, KEYWORDS="Semi-Markov process (SMP); Discrete time SMP/GI/1 analysis; Waiting and idle time distribution; Busy period; Departure process; Autoregressive process", ABSTRACT="Non-renewal processes are relevant in queueing analysis to include various types of traffic arising in integrated services communication networks. We consider a workload based approach to the single server queue in discrete time domain with semi-Markov arrivals (SMP/GI/1). By dividing the busy periods into phases, we generalize a computationally attractive algorithm for the discrete time GI/GI/1 queue. The stationary distributions of the waiting and idle time as well as the moments of the busy period are computed. Performance results are given for deterministic servers with autoregressive input. The output process of a server is modeled by adapting a SMP with a few states to information obtained from busy and idle period analysis.", URL="http://www.elsevier.nl/gej-ng/10/35/22/43/23/24/article.pdf", } @ARTICLE{Chan0003:Novel, AUTHOR="Rocky Chang and Sum Lam", TITLE="A novel approach to queue stability analysis of polling models", JOURNAL=pe, VOLUME=40, NUMBER=1, PAGES="27-46", MONTH=mar, YEAR=2000, KEYWORDS="Queue stability analysis; Queue stability ordering; Loynes' theorem; Dominant systems; Polling models; Reservation schemes; State-dependent walk time and set-up time", ABSTRACT="Previous work in the stability analysis of polling models concentrated mainly on stability of the whole system. This system stability analysis, however, fails to model many real-world systems for which some queues may continue to operate under an unstable system. In this paper we address this problem by considering queue stability problem that concerns stability of an individual queue in a polling model. We present a novel approach to the problem which is based on a new concept of queue stability orderings, dominant systems, and Loynes' theorem. The polling model under consideration employs an m-limited service policy, with or without prior service reservation; moreover, it admits state-dependent set-up time and walk time. Our stability results generalize many previous results of system stability. Furthermore, we show that stabilities of any two queues in the system can be compared solely based on their (/m)'s, where is the customer arrival rate to a queue.", URL="http://www.elsevier.nl/gej-ng/10/35/22/43/23/25/article.pdf", } @ARTICLE{Heym0003:Implications, AUTHOR="Daniel P. Heyman", TITLE="Performance implications of very large service-time variances", JOURNAL=pe, VOLUME=40, NUMBER=1, PAGES="47-70", MONTH=mar, YEAR=2000, KEYWORDS="M/G/1 queue; Fat-tailed distributions; Pareto distribution; Numerical Laplace transform inversion", ABSTRACT="Measurements of file sizes transported on the World-Wide-Web have led some researchers to propose describing them by probability distributions with infinite variance. The M/G/1 queue often arises as a performance model for components of the WWW, and the service times correspond to file sizes; the infinite variance of the file sizes becomes the variance of the service times. In this paper the effects of very large service-time variances on some performance measures for the M/G/1 queue are explored via numerical examples and analytic arguments. The first main conclusion is that it is the form of the service-time distribution over a wide finite range that controls the steady-state queueing performance, so distributions with very large finite variances can yield the same behavior as distributions with infinite variances. The second main conclusion is that very large service-time variances cause the rate of approach to steady-state performance to be so slow that steady-state performance measures are not likely to be of engineering interest. A third conclusion is that a common device of using the probability that the work in an infinite queue exceeds the level b to approximate the probability that a finite buffer of size b overflows may be very inaccurate. The approximation works better for the fat-tailed distributions studied than for the others. The most important engineering implication of these results is that when service times have a very large variance (such as file transfers on the WWW), performance criteria other than steady-state measures have to be used.", URL="http://www.elsevier.nl/gej-ng/10/35/22/43/23/26/article.pdf", } @ARTICLE{Gall0003:Use, AUTHOR="José R. Gallardo and Dimitrios Makrakis and Luis Orozco-Barbosa", TITLE="Use of -stable self-similar stochastic processes for modeling traffic in broadband networks", JOURNAL=pe, VOLUME=40, NUMBER=1, PAGES="71-98", MONTH=mar, YEAR=2000, KEYWORDS="Traffic modeling; -stable distributions; Self-similar processes; Long-range dependence", ABSTRACT="In this article, we propose a new model for aggregate network traffic. This model, besides reflecting self-similarity and long-range dependence, is able to capture the appropriate level of burstiness of different types of traffic by selecting the proper parameters. Different types of self-similar traffic traces (LAN/WAN, WWW, VBR video) are analysed by estimating their self-similarity coefficient H, as well as the parameters of their marginal distributions. When comparing the real traces with our artificial traces, the agreement, which was evaluated both qualitatively (visually) and quantitatively (by means of the marginal CDF and the periodogram), is better than that achieved with previously proposed models. By analysing different types of traffic traces, the model is shown to be flexible enough to be applied to a variety of communications scenarios. A queue with our proposed traffic as input is analysed. A proof of convergence of aggregate traffic to -stable processes is also included, as well as the conditions under which the Gaussian assumption is appropriate.", URL="http://www.elsevier.nl/gej-ng/10/35/22/43/23/27/article.pdf", } @ARTICLE{Lee0003:Modeling, AUTHOR="Yeonwoo Lee and Appie de Liefvoort and V. L. Wallace", TITLE="Modeling correlated traffic with a generalized {IPP}", JOURNAL=pe, VOLUME=40, NUMBER=1, PAGES="99-114", MONTH=mar, YEAR=2000, KEYWORDS="Correlated traffic models; Interrupted Poisson process; Linear algebraic queueing theory; Matrix-exponential distribution", ABSTRACT="Modelers of telecommunication and computer network traffic have been increasingly concerned with the need for good analytical models which allow easy inclusion of correlated traffic in analytical queueing models, or in simulations of such models. This work shows that the generalized interrupted Poisson process (GIPP) and the generalized interrupted Bernoulli process (GIBP) have attractive properties for the modeling of correlated teletraffic, and are susceptible to analytic solution. In particular, they possess an invariance property which allows convenient matching of empirical and hypothetical behavior. Matrix algebraic solutions for stationary marginal distributions, and for covariance structures, of the interdeparture stream are derived for both models using generally distributed on-and off-times. The invariance of the covariance to all but the mean of the off-time marginal distribution is proved and exploited. The model is exercised showing the lag-times and marginals for certain on/off distributions, and demonstrating a practical ability to match empirical data to the parameters of the models.", URL="http://www.elsevier.nl/gej-ng/10/35/22/43/23/28/article.pdf", } @ARTICLE{Sahu0003:Traffic, AUTHOR="Sambit Sahu and Victor Firoiu and Don Towsley and Jim Kurose", TITLE="Traffic models and admission control for variable bit rate continuous media transmission with deterministic service", JOURNAL=pe, VOLUME=40, NUMBER=1, PAGES="115-133", MONTH=mar, YEAR=2000, KEYWORDS="Traffic models; Deterministic service; EDF; Call admission; Continuous media", ABSTRACT="In this paper we address the problem of call admission based on general descriptions of stored continuous media (CM) flows. We show that such an approach to call admission can result in a very high resource utilization that can be significantly higher than that produced when using time-invariant flow descriptions. We present the admissibility conditions for flows, where packets are scheduled according to the earliest-deadline-first (EDF) scheduling policy. We further present an algorithm for testing for admissibility of a new flow whose computational complexity is linear in the number of flows and in the linear segments used for flow description. Last, we present an algorithm for producing a parsimonious flow description which produces most of the benefit of the best general description while requiring a small number of linear segments. Simulation shows that this improves the network resource utilization as much as 200-250\% over the best possible utilization achieved using any time-invariant workload function. A significant improvement results even when the workload is smoothed.", URL="http://www.elsevier.nl/gej-ng/10/35/22/43/23/29/article.pdf", } @ARTICLE{Albu0003:Credit, AUTHOR="Célio Albuquerque and Brett Vickers and Tatsuya Suda", TITLE="Credit-based source-adaptive multilayered video multicast", JOURNAL=pe, VOLUME=40, NUMBER=1, PAGES="135-159", MONTH=mar, YEAR=2000, KEYWORDS="Video multicast; Multilayered video encoding; Credit-based flow control", ABSTRACT="Spatial and temporal variations in network bandwidth constraints constitute serious challenges to the multicast distribution of real-time video content. This paper presents a video multicast algorithm that combines multilayered video encoding with feedback-based source adaptation in order to address varying bandwidth constraints in a multicast tree. The proposed algorithm uses a novel credit-based, hop-by-hop multicast flow control mechanism in conjunction with explicit rate congestion feedback. It achieves nearly optimal network utilization at the expense of packet losses that are isolated to low priority video content. The responsiveness, bandwidth utilization, scalability, video quality and fairness of the proposed mechanism are evaluated through simulations, and results suggest that the proposed mechanism is capable of providing a high quality video service in the presence of varying bandwidth constraints.", URL="http://www.elsevier.nl/gej-ng/10/35/22/43/23/30/article.pdf", } @ARTICLE{Moh0003:Multicasting, AUTHOR="W. M. Moh and Yin Chen", TITLE="Multicasting flow control for hybrid wired/wireless {ATM} networks", JOURNAL=pe, VOLUME=40, NUMBER=1, PAGES="161-194", MONTH=mar, YEAR=2000, ABSTRACT="Multipoint communication has been an increasingly focused topic in computer communication networks, including the Internet, the ATM, and the wireless/mobile networks. The major challenges of designing multicast flow control protocols for a combined wired/wireless network are the varying transmission characteristics (bandwidth, error, reliability, and propagation delay) of the wireless and wired media, and the irregular, different, possibly conflicting flow control requests from multiple receivers in the point-to-multipoint (branching) setting, or from multiple senders in the multipoint-to-point (merging) setting. To address these issues, in this paper we design, analyze, and evaluate both branch-point and merge-point algorithms; we also provide a comparison on the major issues and solutions of the two multicasting scenarios. On point-to-multipoint ABR flow control, we examine an existing max-min fair branch-point algorithm proposed by Siu and Tzeng, and formally analyze its maximum cell loss. A new algorithm is then proposed. Both the maximum cell loss and max-min fairness of new algorithm are analyzed. With extensive simulation, we compare three branch-point algorithms (including a third one proposed by Fahmy, Jain et al.). On multipoint-to-point flow control, we extend the", } @ARTICLE{Awdu0003:Multiprotocol, AUTHOR="Daniel O. Awduche and Yakov Rekhter", TITLE="Multiprotocol Lambda Switching: Combining {MPLS} Traffic Engineering Control with Optical Crossconnects", JOURNAL=ieeecm, VOLUME=39, NUMBER=3, MONTH=mar, YEAR=2000, REFERENCES=8, ABSTRACT="This article describes an approach to the design of control planes for optical crossconnects which leverages existing control plane techniques developed for MPLS traffic engineering. The proposed approach combines recent advances in MPLS traffic engineering control plane constructs with OXC technology to provide a framework for real-time provisioning of optical channels, foster development and deployment of a new class of OXCs, and allow the use of uniform semantics for network management and operations control in hybrid networks consisting of OXCs and label switching routers. The proposed approach is particularly advantageous for OXCs intended for data-centric optical internetworking systems.", URL="http://www.comsoc.org/livepubs/ci1/public/2001/mar/index.html", } @ARTICLE{Feld0003:NetScope, AUTHOR="Anja Feldmann and Albert Greenberg and Carsten Lund and Nick Reingold and Jennifer Rexford", TITLE="NetScope: Traffic Engineering for {IP} Networks", JOURNAL=ieeenet, VOLUME=14, NUMBER=2, MONTH=mar, YEAR=2000, REFERENCES=8, ABSTRACT="Managing large IP networks requires an understanding of the current traffic flows, routing policies, and network configuration. However, the state of the art for managing IP networks involves manual configuration of each IP router, and traffic engineering based on limited measurements. The networking industry is sorely lacking in software systems that a large Internet service provider can use to support traffic measurement and network modeling, the underpinnings of effective traffic engineering. This article describes the AT\&T Labs NetScope, a unified set of software tools for managing the performance of IP backbone networks. The key idea behind NetScope is to generate global views of the network on the basis of configuration and usage data associated with the individual network elements. Having created an appropriate global view, we are able to infer and visualize the networkwide implications of local changes in traffic, configuration, and control. Using NetScope, a network provider can experiment with changes in network configuration in a simulated environment rather than the operational network. In addition, the tool provides a sound framework for additional modules for network optimization and performance debugging. We demonstrate the capabilities of the tool through an example traffic engineering exercise of locating a heavily loaded link, identifying which traffic demands flow on the link, and changing the configuration of intradomain routing to reduce the congestion.", URL="http://www.comsoc.org/~ni/public/2000/mar/index.html", } @ARTICLE{Mish0003:Capacity, AUTHOR="Partho Mishra and Huzur Saran", TITLE="Capacity Management and Routing Policies for Voice over {IP} Traffic", JOURNAL=ieeenet, VOLUME=14, NUMBER=2, MONTH=mar, YEAR=2000, REFERENCES=7, ABSTRACT="This article addresses the problem of designing capacity management and routing mechanisms to support telephony over an IP network. For this service, we propose two distinct architectural models. The first relies on enhancements to the basic IP infrastructure to support integrated service transport and QoS routing. The second assumes that the IP network can support an overlay virtual private network with dedicated capacity for the VoIP service, thereby allowing standard capacity management and routing mechanisms from circuit-switched networks to be reused. We evaluate the performance of these two architectural models and their associated policies via simulations using configuration and usage data derived from operational networks.", URL="http://www.comsoc.org/~ni/public/2000/mar/index.html", } @ARTICLE{Xiao0003:Traffic, AUTHOR="XiPeng Xiao and Alan Hannan and Brook Bailey and Lionel Ni", TITLE="Traffic Engineering with {MPLS} in the {Internet}", JOURNAL=ieeenet, VOLUME=14, NUMBER=2, MONTH=mar, YEAR=2000, REFERENCES=12, ABSTRACT="This article discusses traffic engineering with MPLS in an Internet service provider's network. In this article we first briefly review MPLS, constraint-based routing, and enhanced link state interior gateway protocols to provide a background for traffic engineering. We then discuss the general issues of designing an MPLS system for traffic engineering. The design of GlobalCenter's MPLS system is presented. Based on our experiences, a generic procedure for deploying an MPLS system is proposed. We also discuss how to provide QoS in a network with MPLS. Putting these together, we present to readers the practical issues of traffic engineering and a working solution for traffic engineering with MPLS in the Internet.", URL="http://www.comsoc.org/~ni/public/2000/mar/index.html", } @ARTICLE{Auki0003:RATES, AUTHOR="Petri Aukia and Murali Kodialam and Pramod Koppol and T. V. Lakshman and Helena Sarin and Bernhard Suter", TITLE="{RATES:} A Server for {MPLS} Traffic Engineering", JOURNAL=ieeenet, VOLUME=14, NUMBER=2, MONTH=mar, YEAR=2000, REFERENCES=21, ABSTRACT="It has been suggested that one of the most significant reasons for MPLS network deployment is network traffic engineering. The goal of traffic engineering is to make the best use of the network infrastructure, and this is facilitated by the explicit routing feature of MPLS, which allows many of the shortcomings associated with current IP routing schemes to be addressed. This article describes a software system called Routing and Traffic Engineering Server (RATES) developed for MPLS traffic engineering. It also describes some new routing ideas incorporated in RATES for MPLS explicit path selection. The RATES implementation consists of a policy and flow database, a browser-based interface for policy definition and entering resource provisioning requests, and a Common Open Policy Service protocol server-client implementation for communicating paths and resource information to edge routers. RATES also uses the OSPF topology database for dynamically obtaining link state information. RATES can set up bandwidth-guaranteed label-switched paths (LSPs) between specified ingress-egress pairs. The path selection for LSPs is based on a new minimum-interference routing algorithm aimed at making the best use of network infrastructure in an o-line environment where LSP requests arrive one by one with no a priori information about future requests. Although developed for an MPLS application, the RATES implementation has many similarities in components to an intradomain differentiated services bandwidth broker.", URL="http://www.comsoc.org/~ni/public/2000/mar/index.html", } @ARTICLE{Kuma0003:Mobile, AUTHOR="Prabhat Kumar and Leandros Tassiulas", TITLE="Mobile Multi-User {ATM} Platforms: Architectures, Design Issues, and Challenges", JOURNAL=ieeenet, VOLUME=14, NUMBER=2, MONTH=mar, YEAR=2000, REFERENCES=11, ABSTRACT="Rapid growth in use of the Internet at and away from the workplace has spurred tremendous interest in the provision of anytime-anywhere network connectivity to mobile users. Commonly studied mobility scenarios involve users equipped with portable data terminals roaming around at slow to moderate speeds within a coverage area. MobileIP and wireless ATM are examples of protocols designed for providing network connectivity to such mobiles in IP and ATM networks. A different application involving mobile multi-user platforms equipped with onboard private ATM networks is discussed in this article. Examples of such mobile platforms include airplanes, trains, and ships. The presence of an onboard network, multiple users, and potentially high speeds of travel presents unique challenges in provision of internetwork connectivity to these MMUPs. Specific characteristics of MMUPs, architectural issues in design of the underlying cellular network, subnetwork mobility within ATM internetworks, location management of MMUPs, and multi-user connection handoffs on MMUP moves are the main issues addressed in the article. Network architectures and protocols developed for terminal mobility scenarios are evaluated for applicability in the present context, and new solutions are presented for problems unique to the MMUP application scenario.", URL="http://www.comsoc.org/~ni/public/2000/mar/index.html", } @ARTICLE{Heat0003:High, AUTHOR="John R. Heath and Peter J. Yakutis", TITLE="High-Speed Storage Area Networks Using a Fibre Channel Arbitrated Loop Interconnect", JOURNAL=ieeenet, VOLUME=14, NUMBER=2, MONTH=mar, YEAR=2000, REFERENCES=13, ABSTRACT="Fibre Channel arbitrated loops offer a new approach to realizing high-speed storage interconnection networks. In this article we describe an FC-AL topology and FC-AL protocols for storage networks. In particular, we describe channel arbitration, signaling and transmission protocols, and the Fibre Channel mapping protocol for SCSI. A simulation model of FC-AL storage networks is described. Performance results derived from the model are presented and are used to investigate FC-AL storage network performance.", URL="http://www.comsoc.org/~ni/public/2000/mar/index.html", } @ARTICLE{Will0003:Cdma2000, AUTHOR="Serge Willenegger", TITLE="cdma2000 Physical Layer: An Overview", JOURNAL=jcn, VOLUME=2, NUMBER=1, PAGES="5-17", MONTH=mar, YEAR=2000, REFERENCES=10, KEYWORDS="3G; IMT-2000; radio interface; CDMA; CDMA-MC; cdma2000; IS-95", ABSTRACT="cdma2000 offers several enhancements as compared to TIA/EIA-95, although it remains fully compatible with TIA/EIA-95 systems and allows for a smooth migration from one to the other. Major new capability include: 1) connectivity to GSM-MAP in ad-dition to IP and IS-41 networks; 2) new layering with new LAC and MAC architectures for improved service multiplexing and QoS management and efficient use of radio resource; 3) new bands and bandwidths of operation in support of various operator needs and constraints, as well as desire for a smooth and progressive migra-tion to cdma2000; and 4) flexible channel structure in support of multiple services with various QoS and variable transmission rates at up to 1 Mbps per channel and 2 Mbps per user. Given the phenomenal success of wireless services and desire for higher rate wireless services, improved spectrum efficiency was a major design goal in the elaboration of cdma2000. Major capacity enhancing features include: 1) turbo coding for data transmission; 2) fast forward link power control; 3) forward link transmit di-versity; 4) support of directive antenna transmission techniques; 5) coherent reverse link structure; and 6) enhanced access channel operation. As users increasingly rely on their cell phone at work and at home for voice and data exchange, the stand-by time and operation-time are essential parameters that can influence customer satisfaction and service utilization. Another major goal of cdma2000 was therefore to enable manufacturers to further opti-mize power utilization in the terminal. Major battery life enhanc-ing features include: 1) improved reverse link performance (i.e., re-duced transmit power per information bit); 2) new common chan-nel structure and operation; 3) quick paging channel operation; 4) reverse link gated transmission; and 5) new MAC states for effi-cient and ubiquitous idle time operation. This article provides additional details on those enhancements. The intent is not to duplicate the detailed cdma2000 radio access network specification, but rather to provide some background on the new features of cdma2000 and on the qualitative improvements as compared to the TIA/EIA-95 based systems. The article is fo-cused on the physical layer structure and associated procedures. It therefore does not cover the MAC, LAC, radio resource manage-ment [1], or any other signaling protocols in any detail. We assume some familiarity with the basic CDMA concepts used in TIA/EIA-95.", URL="http://jcn.or.kr/library/frame\_library.html", } @ARTICLE{Colo0003:Network, AUTHOR="Giovanni Colombo and Nicola Magnani and Giuseppe Minerva and Enrico Scarrone", TITLE="Network Engineering Issues in the {UMTS} Development Perspective", JOURNAL=jcn, VOLUME=2, NUMBER=1, PAGES="18-34", MONTH=mar, YEAR=2000, REFERENCES=21, ABSTRACT="The evolution of mobile communications is inducing sev-eral new issues belonging to the system engineering disciplines. This paper tries to underline some of the most important problems starting from the novel requirements and the application charac-teristics expected for Third Generation Mobile System. Based on these new service peculiarities, the radio resource control and the architectural solutions to be chosen for the Mobile Core Network are becoming key issues to be investigated for the forthcoming con-figurations. Particularly, the service acceptance control and the perspective of integration with the IP (Internet Protocol) context are of great importance for the definition of the radio control func-tions and the specification of the switching and mobility control fea-tures respectively. The paper presents some basic considerations on the cellular planning issues arising in W-CDMA (Wideband-Code Division Multiple Access) systems, by underlying the most signifi-cant innovative elements that are to be introduced in the planning process from the mobile operator viewpoint.", URL="http://jcn.or.kr/library/frame\_library.html", } @ARTICLE{Pich0003:Wireless, AUTHOR="Roman Pichna and Tero Ojanpera and Harri Posti and Jouni Karppinen", TITLE="Wireless {Internet} - {IMT-2000/Wireless} {LAN} Interworking", JOURNAL=jcn, VOLUME=2, NUMBER=1, PAGES="46-57", MONTH=mar, YEAR=2000, REFERENCES=22, KEYWORDS="WLAN; IEEE802.11; HIPERLAN/2; IMT-2000; UMTS; 2G; 3G; GSM; GPRS; IP; M-IP; BLUETOOTH; cellular networks; interworking; wireless", ABSTRACT="Ongoing standardization effort on 3G cellular systems in 3GPP (UMTS) is based on GPRS core network and promises a global standard for systems capable of offering ubiquitous access to Internet for mobile users. Considered radio access systems (FDD CDMA, TDD CDMA, and EDGE) are optimized for robust mobile use. However, there are alternative relatively high-rate radio in-terfaces being standardized for WLAN (IEEE 802.11 and HIPER-LAN/ 2) which are capable of delivering significantly higher data rates to static or semi-static terminals with much less overhead. Also WPANs (BLUETOOTH, IEEE 802.15), which will be present in virtually every mobile handset in the near future, are offering low cost and considerable access data rate and thus are very at-tractive for interworking scenarios. The prospect of using these interfaces as alternative RANs in the modular UMTS architecture is very promising. Additionally, the recent inclusion of M-IP in the UMTS R99 standard opens the way for IP-level interfacing to the core network. This article offers an overview into WLAN-Cellular interwork-ing. A brief overview of GPRS, UMTS cellular architectures and relevant WLAN standards is given. Possible interworking archi-tectures are presented.", URL="http://jcn.or.kr/library/frame\_library.html", } @ARTICLE{Kim0003:Application, AUTHOR="Byoung-Hoon Kim and Byeong-Kook Jeong and Byeong Gi lee", TITLE="Application of Correlation-Aided {DSA(CDSA)} Technique to Fast Cell Search in {IMT-2000} {W-CDMA} Systems", JOURNAL=jcn, VOLUME=2, NUMBER=1, PAGES="58-68", MONTH=mar, YEAR=2000, REFERENCES=21, KEYWORDS="correlation-related distributed sample acquisition; state symbol correlation process; comparison-correction based synchronization process; primary synchronization mode (PSC); igniter code; 3GPP 3-step synchronization approach", ABSTRACT="In this paper, we introduce the correlation-aided dis-tributed sample acquisition (CDSA) scheme for fast cell search in IMT-2000 W-CDMA cellular systems. The proposed scheme incor-porates the state symbol correlation process into the comparison-correction based synchronization process of the original DSA scheme to enable fast acquisition even under very poor channel environment. For its realization, each mobile station (MS) has to store in its memory a set of state sample sequences, which are de-termined by the long-period scrambling sequences used in the sys-tem and the sampling interval of the state samples. CDSA based cell search is carried out in two stages: First, the MS first acquires the slot timing by using the primary synch code (PSC) and then identifies the igniter code which conveys the state samples of the current cell. Secondly, the MS identifies the scrambling code and frame timing by taking the comparison-correction based synchro-nization approach and, if the identification is not done satisfactorily within preset time, it initiates the state symbol correlation process which correlates the received symbol sequence with the pre-stored state sample sequences for a successful identification. As the state symbol SNR is relatively high, the state symbol correlation process enables reliable synchronization even in very low chip-SNR envi-ronment. Simulation results show that the proposed CDSA scheme outperforms the 3GPP 3-step approach, requiring the signal power of about 7 dB less for achieving the same acquisition time perfor-mance in low-SNR environment. Furthermore, it turns out very robust in the typical synchronization environment where large fre-quency offset exists.", URL="http://jcn.or.kr/library/frame\_library.html", } @ARTICLE{Song0003:Frame, AUTHOR="Young-Joon Song", TITLE="Frame Synchronization Confirmation Technique Using Pilot Pattern", JOURNAL=jcn, VOLUME=2, NUMBER=1, PAGES="69-75", MONTH=mar, YEAR=2000, REFERENCES=8, KEYWORDS="W-CDMA; pilot pattern; frame synchronization confirmation; side lobe; autocorrelation function", ABSTRACT="A new frame synchronization confirmation technique us-ing a pilot pattern for both uplink and downlink channels is pro-posed for W-CDMA (Wideband Code Division Multiple Access) system. It is shown that by using this technique, we can cancel the side lobe for autocorrelation functions of the frame synchro-nization words of pilot pattern except at middle shift. All the frame synchronization words of the pilot pattern have the maximum out-of- phase autocorrelation value 4 with two peak values equal in magnitude and opposite in polarity at zero and middle shifts. Due to this side lobe cancellation effect, therefore, the autocorrelation function of the frame synchronization words becomes ideal for the frame synchronization confirmation since double maximum corre-lation values equal in magnitude and opposite polarity at zero and middle shifts can be achieved. This property can be used to double-check frame synchronization timing and thus, improve the frame synchronization confirmation performance.", URL="http://jcn.or.kr/library/frame\_library.html", } @ARTICLE{Yi0003:Softest, AUTHOR="Byung Yi and Sang Wu Kim and Raymond L. Pickholtz", TITLE="The Softest Handoff Design Using Iterative Decoding (Turbo Coding)", JOURNAL=jcn, VOLUME=2, NUMBER=1, PAGES="76-84", MONTH=mar, YEAR=2000, REFERENCES=15, KEYWORDS="CDMA; soft handoff; turbo code; iterative decoding; code combining; packet combining; UTRA; IMT-2000; CDMA 2000", ABSTRACT="Communication systems, including cell-based mobile communication systems, multiple satellite communication systems or multi-beam satellite systems, require reliable handoff methods between cell-to-cell, satellite-to-satellite or beam-to-beam, respec-tively. Recent measurement of a CDMA cellular system indicates that the system is in handoff at about 35\% to 70\% of an average call period. Therefore, system reliability during handoff is one of the major system performance parameters and eventually becomes a factor in the overall system capacity. This paper presents novel and improved techniques for handoff in cellular communications, multi-beam and multi-satellite systems that require handoff dur-ing a session. This new handoff system combines the soft handoff mechanism currently implemented in the IS-95 CDMA with code and packet diversity combining techniques and an iterative de-coding algorithm (Turbo Coding). The Turbo code introduced by Berrou et al. has been demonstrated its remarkable performance achieving the near Shannon channel capacity [1]. Recently, Turbo codes have been adapted as the coding scheme for the data trans-mission of the third generation international cellular communica-tion standards: UTRA and CDMA 2000. Our proposed encoder and decoder schemes modified from the original Turbo code is suit-able for the code and packet diversity combining techniques. This proposed system provides not only an unprecedented coding gain from the Turbo code and its iterative decoding, but also gain in-duced by the code and packet diversity combining technique which is similar to the hybrid Type II ARQ. We demonstrate performance improvements in AWGN channel and Rayleigh fading channel with perfect channel state information (CSI) through simulations for at low signal to noise ratio and analyses using exact upper bounding techniques for medium to high signal to noise ratio.", URL="http://jcn.or.kr/library/frame\_library.html", } @ARTICLE{Li0003:Mobile, AUTHOR="Jun Li and Roy Yates and Dipankar Raychaudhuri", TITLE="Mobile {ATM:} A Generic and Flexible Network Infrastructure for {3G} Mobile Services", JOURNAL=jcn, VOLUME=2, NUMBER=1, PAGES="35-45", MONTH=mar, YEAR=2000, REFERENCES=27, KEYWORDS="third generation mobile; mobile ATM; mobility management", ABSTRACT="This paper presents the concept of mobile ATM,a pro-posal for third-generation (3G) mobile communication network infrastructure capable of supporting flexible evolution of radio technologies from todays cellular and data services towards future wireless multimedia services. Mobile ATMprovides generic mobil-ity management and QoS-based transport capabilities suitable for integration of multiple radio access technologies including cellular voice, wireless data, and future broadband wireless services. The architecture of a mobile ATM network is outlined in terms of the newly-defined W-UNI interface at the radio link and W-UNI and W-NNI interfaces within the fixed network. The concept of a proxy-UNI interface which supports unified access for WATM and non-ATM mobile terminals through corresponding interworking functions (IWF) is explained, leading to an understanding of how different radio access technologies are supported by the same ATM-based core network infrastructure. Generic mechanisms for handoff and location management within the core mobile network are discussed, and related protocol extensions over the W-UNI and W-UNI/NNI interfaces are proposed. The issue of cross-over switch (COS) selection in mobile ATM is considered, and a unified handoff signaling syntax which supports flexibility in COS selection is described. Typical signaling sequences for call connec-tion and handoff using the proposed protocols are outlined. Ex-perimental results from a proof-of-concept mobile ATM network prototype are presented in conclusion.", URL="http://jcn.or.kr/library/frame\_library.html", } @ARTICLE{Carp0003:Connecting, AUTHOR="Brian E. Carpenter and Keith Moore and Bob Fink", TITLE="Connecting {IPv6} Routing Domains Over the {IPv4} {Internet}", JOURNAL=ipj, VOLUME=3, NUMBER=1, PAGES="2-10", MONTH=mar, YEAR=2000, REFERENCES=10, ABSTRACT={A next-generation Internet Protocol, known first as IPng and then as IPv6, has been under development by the Internet Engineering Task Force (IETF) for several years to replace the current Internet Protocol known as IPv4. The reasons behind the need for IPv6 are not covered here, but interested readers are encouraged to read "The Case for IPv6" for this background. Of major importance during the development of IPv6 has been how to do the transition away from IPv4, and towards IPv6. The work on transition strategies, tools, and mechanisms has been part of the basic IPv6 design effort from the beginning. The current transition efforts, taking place at the IETF IPng Transition Working Group (ngtrans), will continue until it is clear that the transition will be successful. These transition design efforts resulted in a basic Transition Mechanisms specification for IPv6 hosts and routers that specifies the use of a Dual IP layer providing complete support for both IPv4 and IPv6 in hosts and routers, and IPv6-over-IPv4 tunneling, encapsulating IPv6 packets within IPv4 headers to carry them over IPv4 routing infrastructures. These concepts are heavily relied on for transition from the traditional IPv4-based Internet as we know it today, to an IPv6-based Internet. It is expected that IPv4 and IPv6 will coexist for many years during this transition. Of great concern to transition strategy planners is how to provide connectivity between IPv6-enabled end-user sites (also known as routing domains) when they do not yet have a reasonable (or any) choice of Internet Service Provider (ISP) that provides native IPv6 transport services. One way to provide IPv6 connectivity between end-user sites (when native IPv6 service does not exist) is to use IPv6-over-IPv4 encapsulation (tunneling) between them, similar to the technique currently used in the 6bone IPv6 testbed network. This requires complexity for both end-user sites, and the networks providing the tunneling service (for instance, the 6bone backbone ISPs), in creating, managing, and operating manually configured tunnels. The "6to4" transition mechanism, "Connection of IPv6 Domains via IPv4 Clouds without Explicit Tunnels", provides a solution to the complexity problem of using manually configured tunnels by specifying a unique routing prefix for each end-user site that carries an IPv4 tunnel endpoint address. It should also be noted that each end-user site with as little as a single IPv4 address has a unique, routable, IPv6 site routing prefix thanks to the 6to4 transition mechanism.}, URL="http://www.cisco.com/warp/public/759/ipj\_3-1/ipj\_3-1\_routing.html", } @ARTICLE{Stal0003:IP, AUTHOR="William Stallings", TITLE="{IP} Security", JOURNAL=ipj, VOLUME=3, NUMBER=1, PAGES="11-26", MONTH=mar, YEAR=2000, ABSTRACT={In 1994, the Internet Architecture Board (IAB) issued a report entitled "Security in the Internet Architecture" (RFC 1636). The report stated the general consensus that the Internet needs more and better security, and it identified key areas for security mechanisms. Among these were the need to secure the network infrastructure from unauthorized monitoring and control of network traffic and the need to secure end-user-to-end-user traffic using authentication and encryption mechanisms. These concerns are fully justified. As confirmation, the 1998 annual report from the Computer Emergency Response Team (CERT) lists over 1,300 reported security incidents affecting nearly 20,000 sites. The most serious types of attacks included IP spoofing, in which intruders create packets with false IP addresses and exploit applications that use authentication based on IP address; and various forms of eavesdropping and packet sniffing, in which attackers read transmitted information, including logon information and database contents. In response to these issues, the IAB included authentication and encryption as necessary security features in the next-generation IP, which has been issued as IPv6. Fortunately, these security capabilities were designed to be usable both with the current IP (IPv4) and IPv6, meaning that vendors can begin offering these features now, and many vendors do now have some IP Security Protocol (IPSec) capability in their products.}, URL="http://www.cisco.com/warp/public/759/ipj\_3-1/ipj\_3-1\_ip.html", } @ARTICLE{Hust0003:Quality, AUTHOR="Geoff Huston", TITLE="Quality of Service-Fact or Fiction?", JOURNAL=ipj, VOLUME=3, NUMBER=1, PAGES="27-34", MONTH=mar, YEAR=2000, REFERENCES=8, ABSTRACT="Much has been written about the potential of Quality of Service (QoS) and the Internet. However, much of the material is strong on promise, but falls short in critical analysis. In an effort to balance the picture, we present here a brief status report on the QoS effort, exposing some of the weaknesses in the current QoS architectures.", URL="http://www.cisco.com/warp/public/759/ipj\_3-1/ipj\_3-1\_qos.html", } @INPROCEEDINGS{Yap0003:Novel, AUTHOR="C. Yap and M. Kraner and Srba Cvetkovic", TITLE="Novel and Enhanced Mobile {Internet} Protocol for Third Generation Cellular Environments Compared to {MIP} and {MIP-LR}", BOOKTITLE="First International Conference on 3G Mobile Communications Technologies", PAGES="143-147", MONTH=mar, YEAR=2000, } @INPROCEEDINGS{Lee0003:Performance, AUTHOR="Sung Lee and Weilian Su and Julian Hsu and Mario Gerla and Rajive Bagrodia", TITLE="A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols", BOOKTITLE="of IEEE INFOCOM 2000", ADDRESS="Tel Aviv, Israel", MONTH=mar, YEAR=2000, } @MASTERSTHESIS{Fors0003:Communication, AUTHOR="Dan Forsberg", TITLE="Communication Availability with Mobile {IP} in Wireless {LANs}", TYPE="Master's Thesis", SCHOOL="Helsinki University of Technology", MONTH=mar, YEAR=2000, } @MASTERSTHESIS{Mali0003:Using, AUTHOR="Jouni K. Malinen", TITLE="Using Private Addresses with Hierarchical Mobile {IPv4}", TYPE="Master's Thesis", SCHOOL="Helsinki University of Technology", MONTH=mar, YEAR=2000, } @TECHREPORT{Ko0003:Protocol, AUTHOR="Young-bae Ko and Nitin Vaidya", TITLE="A Protocol for Geocasting in Mobile Ad Hoc Networks (GeoTORA)", TYPE="Technical Report", INSTITUTION="Department of Computer Science, Texas A and M University", NUMBER="00-010", MONTH=mar, YEAR=2000, } @INPROCEEDINGS{Elli0003:Protection, AUTHOR="Georgios Ellinas and S. Rong and Aklilu Hailemariam and Thomas Stern", TITLE="Protection Cycle Covers in Optical Networks With Arbitrary Mesh Topologies", BOOKTITLE="Optical Fiber Communications (OFC) Conference", ORGANIZATION="OSA", MONTH=mar, YEAR=2000, LANGUAGE="English", } @INPROCEEDINGS{Zhan0003:Middle, AUTHOR="Lixia Zhang", TITLE="Middle Boxes", BOOKTITLE="Sprint Research Symposium", ADDRESS="Kansas City, Missouri", DAYS=8, MONTH=mar, YEAR=2000, KEYWORDS="routing; end-to-end model; transparency", ABSTRACT="Describes middle boxes for enhancing Internet end-to-end model, but is against transparent proxies.", URL="http://www.tisl.ukans.edu/workshops/spartan/2000/LixiaZhang.ppt", } @INPROCEEDINGS{StAr0003:CANARIE, AUTHOR="Bill St. Arnaud", TITLE="{CANARIE} -- {CA*net} 3 -- The Customer Empowered Networking Revolution", BOOKTITLE="1st Australian Advanced and Innovative Internet Workshop", ADDRESS="Adelaide, Australia", DAYS=11, MONTH=mar, YEAR=2000, ABSTRACT="The rough costs on actual cable installation and fiber expense.", URL="http://www.aarnet.edu.au/projects/2000/internetworkshop/bsta.shtml", } @INPROCEEDINGS{Crow0003:Integrated, AUTHOR="Jon Crowcroft", TITLE="Integrated Services", BOOKTITLE=infocom, ADDRESS="Tel Aviv, Israel", NOTE="Tutorial", DAYS=26, MONTH=mar, YEAR=2000, KEYWORDS="QoS; integrated services; quality of service; resource reservation", URL="ftp://cs.ucl.ac.uk/darpa/infocom00-tutorial.ppt.gz", } @INPROCEEDINGS{Eckh0003:Effort, AUTHOR="David Eckhardt and Peter Steenkiste", TITLE="Effort-limited Fair {(ELF)} Scheduling for Wireless Networks", BOOKTITLE=infocom, ADDRESS="Tel Aviv, Israel", DAYS=28, MONTH=mar, YEAR=2000, KEYWORDS="Wireless networks (PCS; QoS; protocols; routing); Quality of service (general); Scheduling", ABSTRACT="While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wireless media can exhibit substantial rates of link errors, resulting in significant and unpredictable loss of link capacity. This capacity loss results in a special challenge for wireless schedulers. For example, a Weighted Fair Queue (WFQ) scheduler assumes an error-free link and specifies how flows should share the link capacity. However, this specification is not sufficient to determine the correct outcome when link capacity is sharply reduced, because flows which have been allocated the weights may differ greatly in their ability to tolerate throughput loss. In this paper, we propose a novel notion of fairness for wireless links, effort-limited fairness (ELF), which extends WFQ via dynamic weight adjustements. ELF guarantees that all flows experiencing an error rate below a per-flow threshold receive their expected service, defined as a specified rate for reserved flows or a specified share of best-effort capacity for best-effort flows. After motivating and defining ELF, we present a practical approximation algorithm, which we evaluate through simulation and experimentation on a prototype wireless radio network based on the WaveLAN physical layer.", URL="http://www.ieee-infocom.org/2000/papers/266.ps", } @INPROCEEDINGS{McDa0003:Windowed, AUTHOR="Patrick McDaniel and Sugih Jamin", TITLE="Windowed Certificate Revocation", BOOKTITLE=infocom, ADDRESS="Tel Aviv, Israel", DAYS=28, MONTH=mar, YEAR=2000, KEYWORDS="Security and privacy; Protocol design; analysis and performance; Network architectures (protocols; algorithms; intelligent networks; reliability)", ABSTRACT="The advent of electronic commerce and personal communications on the Internet heightens concerns over the lack of privacy and security. Network services providing a wide range of security related guarantees are increasingly based on public key certificates. A fundamental problem inhibiting the wide acceptance of existing certificate distribution services is the lack of a scalable certificate revocation mechanism. We argue in this paper that the resource requirements of extant revocation mechanisms place significant burden on certificate servers and network resources. We propose a novel mechanism called windowed revocation that satisfies the security policies and requirements of existing mechanisms and, at the same time, reduces the burden on certificate servers and network resources. We include a proof of correctness of windowed revocation and analyze worst case performance scenarios.", URL="http://www.ieee-infocom.org/2000/papers/392.ps", } @INPROCEEDINGS{Kang0003:Replicated, AUTHOR="Jussi Kangasharju and Keith W. Ross", TITLE="A Replicated Architecture for the Domain Name System", BOOKTITLE=infocom, ADDRESS="Tel Aviv, Israel", DAYS=28, MONTH=mar, YEAR=2000, KEYWORDS="Internet and web applications; Network architectures (protocols; algorithms; intelligent networks; reliability); Communication protocols implementation and software", ABSTRACT="We propose a new design for the Domain Name System (DNS) that takes advantage of recent advances in disk storage and multicast distribution technology. In essence, our design consists of geographically distributed servers, called replicated servers, each of which having a complete and up-to-date copy of the entire DNS database. To keep the replicated servers up-to-date, they distribute new resource records over a satellite channel or over terrestrial multicast. The design allows Web sites to dynamically wander and replicate themselves without having to change their URLs. The design can also significantly improve the Web surfing experience since it significantly reduces the DNS lookup delay.", URL="http://www.ieee-infocom.org/2000/papers/92.ps", } @INPROCEEDINGS{Fei0003:Receiver, AUTHOR="Aiguo Fei and Mario Gerla", TITLE="Receiver-Initiated Multicasting with Multiple {QoS} Constraints", BOOKTITLE=infocom, ADDRESS="Tel Aviv, Israel", DAYS=28, MONTH=mar, YEAR=2000, KEYWORDS="Quality of service (general); Multicast (congestion/resource control; routing; reliable); Network architectures (protocols; algorithms; intelligent networks; reliability)", ABSTRACT="To support QoS for multicast with dynamic and distributed member joining, in this paper we present a receiver-initiated QoS multicast protocol (RIQM). Assuming link-state information and QoS unicast routing protocol are available, we let the receiver compute a path to join the multicast tree rooted at the source. A receiver then could send join request along the path it computed to join the group. Our protocol specifies how the new member could be accepted into the group without affecting the QoS of other members and how to adjust the existing tree if necessary. It tries to minimize the cost of the tree by allowing a node to join the tree via a low-cost path first and switch to a higher-cost but more QoS strict path later only when necessary. The proposed scheme allows fully distributed operation. It greatly reduces number of messages and simplifies message processing to join members compared with other approaches. RIQM also works with any arbitrary number of QoS metrics and requirements. Simulation results show that it has good performance in terms of cost of trees built.", URL="http://www.ieee-infocom.org/2000/papers/722.pdf", } @INPROCEEDINGS{Wang0003:QoS, AUTHOR="Bin Wang and Jennifer Hou", TITLE="QoS-Based Multicast Routing for Distributing Layered Video to Heterogeneous Receivers in Rate-based Networks", BOOKTITLE=infocom, ADDRESS="Tel Aviv, Israel", DAYS=28, MONTH=mar, YEAR=2000, KEYWORDS="Multicast (congestion/resource control; routing; reliable); Quality of service (general); Multimedia (protocols; terminals and systems; traffic control; video networking)", ABSTRACT="We design an effective multicast routing algorithm for distributing layered multicast video to heterogeneous receivers in networks with rate-based message schedulers. The multicast tree constructed by the algorithm fulfills the QoS requirements imposed by heterogeneous receivers both in terms of bandwidth and delay, and at the same time, consumes as little network resource as possible. For the purpose of scalability, the proposed multicast routing algorithm is decentralized and can adapt to network and membership change. To facilitate construction of such a multicast tree in a distributed manner, we equip each node with an auxiliary routing table, and propose procedures for updating/maintaining the auxiliary routing table. Simulation results indicate that the multicast tree constructed by the proposed algorithm is more resource efficient than those constructed by other existing algorithms, especially when there exist multiple alternative paths to multicast receivers in the network.", URL="http://www.ieee-infocom.org/2000/papers/397.ps", } @INPROCEEDINGS{Kodi0003:Minimum, AUTHOR="Murali Kodialam and T. V. Lakshman", TITLE="Minimum Interference Routing with Applications to {MPLS} Traffic Engineering", BOOKTITLE=infocom, ADDRESS="Tel Aviv, Israel", DAYS=28, MONTH=mar, YEAR=2000, KEYWORDS="Quality of service (general); Traffic management and control; Unicast routing and routing protocols", ABSTRACT="This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding future requests. This problem is motivated by service provider needs for fast deployment of bandwidth guaranteed services and the consequent need in backbone networks for fast provisioning of bandwidth guaranteed paths. Offline routing algorithms cannot be used since they require a priori knowledge of all tunnel requests that are to be routed. Instead, on-line algorithms that handle requests arriving one-by-one and that satisfy as many potential future demands as possible are needed. The newly developed algorithm is an on-line algorithm and is based on the idea that a newly routed tunnel must follow a route that does not ``interfere too much'' with a route that may be critical to satisfy a future demand. We show that this problem is NP-hard. We then develop a path selection heuristic that is based on the idea of deferred loading of certain ``critical'' links. These critical links are identified by the algorithm as links that, if heavily loaded, would make it impossible to satisfy future demands between certain ingress-egress pairs. Like min-hop routing, the presented algorithm uses link-state information and some auxilliary capacity information for path selection. Unlike previous algorithms, the proposed algorithm exploits any available knowledge of the network ingress-egress points of potential future demands even though the demands themselves are unknown. If all nodes are ingress-egress nodes the algorithm can still be used, particularly to reduce the rejection rate of requests between a specified subset of important ingress-egress pairs. The algorithm performs well in comparison to minimum hop and widest-shortest path routing on several metrics like the number of rejected demands and successful re-routing of demands upon link failure.", URL="http://www.ieee-infocom.org/2000/papers/459.ps", } @INPROCEEDINGS{Nela0003:Adaptive, AUTHOR="Srihari Nelakuditi and Zhi-Li Zhang and Rose Tsang", TITLE="Adaptive Proportional Routing: A Localized {QoS} Routing Approach", BOOKTITLE=infocom, ADDRESS="Tel Aviv, Israel", DAYS=28, MONTH=mar, YEAR=2000, KEYWORDS="Unicast routing and routing protocols; Quality of service (general); Traffic management and control", ABSTRACT="Most of the QoS routing schemes proposed so far require periodic exchange of QoS state information among routers, imposing both communication overhead on the network and processing overhead on core routers. Furthermore, stale QoS state information causes the performance of these QoS routing schemes to degrade drastically. In order to circumvent these problems, we focus on QoS routing schemes where the edge routers make routing decisions using only ``local'' information and thus reducing the overhead at core routers. We first describe (vcr), a theoretical scheme based on the notion of virtual capacity of a route. We then propose proportional sticky routing (psr), an easily realizable approximation of vcr and analyze its performance. We demonstrate through extensive simulations that adaptive proportional routing is indeed a viable alternative to global QoS routing approach.", URL="http://www.ieee-infocom.org/2000/papers/461.ps", } @INPROCEEDINGS{Kurc0003:Joint, AUTHOR="Ragip Kurceren and James Modestino", TITLE="A Joint Source-Channel Coding Approach to Network Transport of Digital Video", BOOKTITLE=infocom, ADDRESS="Tel Aviv, Israel", DAYS=28, MONTH=mar, YEAR=2000, KEYWORDS="Quality of service (general); Multimedia (protocols; terminals and systems; traffic control; video networking); BISDN and ATM", ABSTRACT="The use of forward error-control (FEC) coding, possibly in conjunction with passive-error recovery techniques, has emerged as a promising approach for real-time video transport over ATM networks for cell-loss recovery and/or bit error correction, such as might be required for wireless links. Although FEC provides cell-loss recovery capabilities it also introduces transmission overhead which can possibly cause additional cell losses. A joint source-channel coding methodology is described to maximize the number of video sources multiplexed at a given quality of service (QoS), measured in terms of overall reproduced video quality. The transport channel is modeled as a block interference channel (BIC) and the multiplexer as a single server, deterministic service, finite buffer supporting $N$ users. Based upon an information-theoretic characterization of the BIC and large deviation bounds on the buffer overflow probability, the described methodology provides theoretically achievable upper limits on the number of sources multiplexed at a given level of performance. Performance of a specific coding technique using an MPEG-2 source enc