Abstract: Adaptation is usually restricted to defensive, reactive media adaptation (often called stream-level adaptation). We argue that offensive, proactive, system-level adaptation deserves not less attention. If a distributed multimedia system cares for overall, end-to-end quality of service then it should provide a meaningful combination of both. We introduce an adaptive multimedia server (ADMS) and a supporting middleware which implement offensive adaptation based on a lean, flexible architecture. The measured costs and benefits of the offensive adaptation process are presented. We introduce an intelligent video proxy (QBIX), which implements defensive adaptation. The cost/benefit measurements of QBIX are presented elsewhere \citeSchojer03. We show the benefits of the integration of QBIX in ADMS. Offensive adaptation is used to find an optimal, user-friendly configuration dynamically for ADMS, and defensive adaptation is added to take usage environment (network and terminal) constraints into account.

Abstract: Due to the heterogeneity of the current terminal and network infrastructures, multimedia content needs to be adapted to specific capabilities of these terminals and network devices. Furthermore, user preferences and user environment characteristics must also be taken into consideration. The problem becomes even more complex by the diversity of multimedia content types and encoding formats. In order to meet this heterogeneity and to be applicable to different coding formats, the adaptation must be performed in a generic and interoperable way. As a response to this problem and in the context of MPEG-21, we present an approach which uses XML to describe the high-level structure of a multimedia resource in a generic way, i.e., how the multimedia content is organized, for instance in layers, frames, or scenes. For this purpose, a schema for XML-based bitstream syntax descriptions (generic Bitstream Syntax Descriptions or gBSDs) has been developed. A gBSD can describe the high-level structure of a multimedia resource in a coding format independent way. Adaptation of the resource is based on elementary transformation instructions formulated with respect to the gBSDs. These instructions have been separated from the gBSDs in order to use the same descriptions for different adaptations, e.g., temporal scaling, SNR scaling, or semantic adaptations. In the MPEG-21 framework, those adaptations can be steered for instance by the network characteristics and the user preferences. As a result, it becomes possible for coding format agnostic adaptation engines to transform media bitstreams and associated descriptions to meet the requirements imposed by the network conditions, device capabilities, and user preferences.

Abstract: Due to the increasing availability and use of digital video data on the Web, video caching will be an important performance factor in the future WWW. We propose an architecture of a video proxy cache that integrates modern multimedia and communication standards. Especially we describe features of the MPEG-4 and MPEG-7 multimedia standards that can be helpful for a video proxy cache. QBIX supports real-time adaptation in the compressed and in the decompressed domain. It uses adaptation to improve the cache replacement strategies in the proxy, but also to realize media gateway functionality driven by the clients' terminal capabilities.

Abstract: In this paper, a generic method is described to allow the adaptation of different multimedia resources by a single, media resource-agnostic processor. This method is based on an XML description of the media resource’s bitstream syntax, which can be transformed to reflect the desired adaptation and then be used to generate an adapted version of the bitstream. Based on this concept, two complementary technologies, BSDL and gBS Schema, are presented. The two technologies provide solutions for parsing a bitstream to generate its XML description, for the generic structuring of this description, and the generation of an adapted bitstream using its transformed description. The two technologies can be used as stand-alone tools; however, a joint approach has been developed in order to harmonise the two solutions and exploit their strengths. Since BSDL has been presented in previous publications, this paper is focusing more on the gBS Schema and the joint BSDL/gBS Schema approach.

Abstract: Multimedia streaming is becoming ever more popular. However, the Internet does not support streaming with its high bandwidth and low latency requirements very well. The problem is that QoS guarantees cannot be given. Hence, communication partners have to deal with rapidly changing connection parameters. This requires sophisticated streaming concepts that can handle these varying conditions using adaptation techniques. Adaptation methods can be dropping layers, dropping access units or transcoding the contents. But this places specific requirements on the underlying protocol. This paper identifies and discusses these requirements and analyzes how existing protocols can meet them. Unfortunately, none of the known protocols can meet all requirements. Hence, we propose a new adaptation-aware multimedia streaming protocol that can operate as required in the given Internet environment. Furthermore, we show how this protocol can be used to carry MPEG-4 audio-visual contents.

Abstract: Multimedia streaming is becoming more and more popular. Seamless video streaming in heterogeneous networks like the Internet turns out as almost impossible due to varying network conditions - streams must be adapted to the current network QoS. Temporal scalability is one of the most reasonable adaptation techniques because it is fast and easy to perform. Today's approaches simply drop frames out of a video without spending much effort on finding an intelligent dropping behavior. This usually leads to good adaptation results in terms of bandwidth consumption but also to suboptimal video quality within the given bounds. Our approach offers analysis of video streams to achieve the qualitatively best temporal scalability. For this reason, we introduce a data structure called modification lattice which represents all frame dropping combinations within a sequence of frames. On the basis of the modification lattice, qualityestimations on frame sequences can be performed. Moreover, a heuristic for fast and efficient quality computation in a modification lattice is presented. Experimental results illustrate that temporal video adaptation based on QCTVA information leads to a better video quality compared to "usual" frame dropping approaches. Furthermore, QCTVA offers frame priority lists for videos. Based on these priorities, numerous adaptation techniques can increase their overall performance when using QCTVA.

Abstract: Euro-Par is the annual series of international conferences dedicated to the promotion and advancement of all aspects of parallel and distributed computing. The conference normally attracts more than 300 participants coming from universities, research centres and industry.

Abstract: The ADMITS project (Adaptation in Distributed Multimedia IT Systems) is building an experimental distributed multimedia system for investigations into adaptation, which we consider is an increasingly important tool for multimedia systems. A number of possible adaptation entities (server, proxy, clients, routers) are being explored, different algorithms for media, component and application-level adaptations are being implemented and evaluated, and experimental data are being derived to gain insight into when, where and how to adapt, and how individual, distributed adaptation steps interoperate and interact with each other. In this paper the "adaptation-chain" of (MPEG-conforming) metadata based adaptation is described: from the creation stage at the server side, through its usage in the network (actually in a proxy), up to the consumption at the client. The metadata are used to steer the adaptation processes. MPEG-conformant metadata, the so-called variation descriptions, are introduced; an example of a complete MPEG-7 document describing temporal scaling of an MPEG-4 video is given. The meta-database designed to store the metadata is briefly discussed. We describe how the metadata can be extracted from MPEG-4 visual elementary streams and initial results from the temporal video scaling experiment are given. We further present how the metadata can be utilized by enhanced cache replacement algorithms in a proxy server in order to realize quality-based caching; experimental results using these algorithms are also given. Finally, an adaptive query and presentation interface to the meta-.

Abstract: Multimedia is gaining ever more importance on the Internet. This increases the need for intelligent and efficient video caches. Typical Web proxies were not designed to efficiently support the caching of videos. A promising approach to improve caching efficiency is to adapt videos. With the availability of MPEG-4 it is possible to develop a standard compliant proxy that allows fast and efficient adaptation. We propose a modular design for an adaptive MPEG-4 video proxy that supports efficient full and partial video caching in combination with filtering options that are driven by the terminal capabilities of the client. We use the native scalability operations provided by MPEG-4 and use the emerging MPEG-7 standard to describe the scalability options for a video. The proxy parses the MPEG-7 description and decides, based on this description and the terminal capabilities of the client, which adaptation step to choose. Simple MPEG-4 audio-visual streams are supported by filter operations in the compressed domain that realize several temporal scaling algorithms and color reduction. In this paper, we will restrict ourselves to full video caching. The combination of adaptation with MPEG-4, MPEG-7 and client terminal capabilities is to the best of our knowledge unique and will increase the quality of service for end users.

Abstract: Multimedia streaming becomes ever more popular. The multimedia standard MPEG-4 has been designed to support scenes of different levels of complexity and applications with low bandwidth requirements up to very high bandwidth requirements. One protocol suitable to transfer this kind of data over IP networks is the real-time transport protocol (RTP). This report describes standardized and proposed payload formats that support the transport of MPEG-4 elementary streams over RTP connections. These RTP packetization formats are compared w.r.t. their suitability for the adaptation (scaling) of the media data within the network, i.e., by advanced routers or proxy caches. This adaptation process is governed by metadata that need to be transferred and inspected in conjunction with the media streams.

Abstract: The virtual interface (VI) architecture standard was developed to satisfy the need for a high throughput, low latency communication system required for cluster computing. VI architecture aims to close the performance gap between the bandwidths and latencies provided by the communication hardware and visible to the application, respectively, by minimizing the software overhead on the critical path of the communication. This paper presents the results of a performance study of one VI architecture hardware implementation, the Giganet cLAN (cluster LAN). The focus of the study is to assess and compare the performance of different VI architecture data transfer modes and specific features that are available to higher-level communication software like MPI in order to aid the implementor to decide which VI architecture options to employ for various communication scenarios. Examples of such options include the use of send/receive vs. RDMA data transfers, polling vs. blocking to check completion of communication operations, multiple VIs, completion queues and scatter capabilities of VI architecture.

Abstract: In this paper we present the design, architecture and implementation of the A2QM3 System. It provides programmers re-usable QoS-aware Control Objects to enable building a complete middleware for adaptive applications over active networks. We introduce the programming model, the system architecture, and show the parts that make this system a full-featured middleware supporting QoS-aware reliable stream-oriented communication, communication using the request/reply-based CORBA model and real-time streaming for continuous multimedia contents.

Abstract: Adaptation is becoming an increasingly important tool for resource and media management in distributed multimedia systems. Best-effort scheduling and worst-case reservation of resources are two extreme cases, none of them well suited to cope with large-scale, dynamic multimedia systems. The middle course can be met by a system which dynamically adapts its data, resource requirements, and processing components to achieve user satisfaction. Nevertheless, there is no agreement about the questions, where, when, what and who should adapt. A number of papers have been published in recent years, where adaptation is a central issue, however, in most different interpretations and generally in a somehow limited scope; e.g.,[1, 2, 8, 9, 10, 12]. A distributed multimedia system comprises several types of components, such as media servers, meta-databases, proxies, routers, clients. Also, a large number of adaptation possibilities exist, from simple frame dropping up to virtual server systems which dynamically allocate new resources on demand. The main question is, which kind of component can be best used for what kind of adaptation. In the ADMITS project (Adaptation in Distributed Multimedia IT Systems), we are seeking for answers to exactly this basic question, and to a number of related questions.

Abstract: This paper presents an inexpensive cluster-based QoS networking testbed that can be employed to \emulate" different networks for multimedia communication ex-periments. Such a network can be built using standard PC and Ethernet hardware and open-source software components, e.g., IP routing and traÆc control avail- able in recent Linux kernels as well as a Differentiated Services package built atop these building blocks. The testbed can exibly be configured to model various link bandwidths as well as IP routers capable of classifying, queuing (with various disciplines), forward-ing and/or dropping packets and shaping traÆc. The QoS components and facilities of the testbed are in-troduced and initial performance analysis experiments and results are reported. A simple video streaming application under QoS control is presented to show the usefulness of the testbed.

Abstract: Current superscalar microprocessors are able to operate at a peak performance of up to 1 GFlop/sec. However, current main memory technology does not provide the data needed fast enough to keep the CPU busy. To minimize idle times of the CPU, caches are used to speed up accesses to frequently used data. To exploit caches, the software must be aware of them and reuse data in the cache before it is being replaced. Unfortunately, all conventional multigrid codes are not cache-aware and hence exploit less than 10 percent of the peak performance of cache based machines. Our studies with linear PDEs with constant coefficients show that it is possible to speed up the execution of our multigrid method by a large factor and hence solve a Poisson’s equation with one million unknowns in less than 3 seconds. The optimized reuse of data in the cache allows us to exploit 30 percent of the peak performance of the CPU, in contrast to mgd9v for instance, which achieves less than 5 percent on the same machine. To achieve this, we used several techniques like loop unrolling and loop fusion to better exploit the memory hierarchy and the superscalar CPU. We study the effects of these techniques on the runtime performance in detail. We also study several tools which guide the optimizations and help to restructure the code.

Abstract: This paper describes an unconventional way to apply a performance analysis tool for parallel programs (Vampir) to understand and tune the performance of the real-time voice and data communication software running on top of Frequentis’ V4 switch. The execution schedule of the strictly time-triggered V4 switching software is computed off-line; analyzing the schedule to identify e.g. performance bottlenecks used to be a complex and time-consuming process. We present our approach to transform the V4 software schedule’s information into Vampir trace files and use this tool’s facilities to provide a visualization of the schedule. A case study illustrates the benefits of this approach.

Abstract: The Virtual Interface (VI) Architecture standard was developed to satisfy the need for a high-throughput, low-latency communication system required for cluster computing. This paper presents the results of a performance study of one VI Architecture hardware implementation, the Giganet cLAN (Cluster LAN). The focus of the study is to assess and compare the performance of different VI Architecture data transfer modes and specific features that are available to higher-level communication software like MPI, in order to aid the implementor to decide which VI Architecture options to employ for various communication scenarios. Examples of such options include the use of send/receive vs. RDMA data transfers, polling vs. blocking to check completion of communication operations, multiple VIs, completion queues, and scatter capabilities of VI Architecture.

Abstract: Workstation and PC clusters interconnected by SCI (Scalable Coherent Interface) are very promising technologies for high performance cluster computing. Using commercial SBus to SCI interface cards and early system software and drivers, a two-workstation cluster has been constructed for initial testing and evaluation. The PVM system has been adapted to operate on this cluster using raw device access to the SCI interconnect, and preliminary communications performance tests have been carried out. Our preliminary results indicate that communications throughput in the range of 3.5 MBytes/s, and latencies Research supported by the Applied Mathematical Sciences program, Office of Basic Energy Sciences, U. S. Department of Energy, under Grant No. DE-FG05-91ER25105, the National Science Foundation, under Award Nos. ASC-9527186 and ASC-9214149, and the German Science Foundation SFB342. of 620 ¯s can be achieved on SCI clusters. These figures are significantly better (by a factor of 3 to 4) ...

Abstract: Architecture and Software for High-Performance Compute Clusters.