Quality of Service Controlled Multimedia Transport Protocol

PhDThis research looks at the design of an open transport protocol that supports a range of services including multimedia over low data-rate networks. Low data-rate multimedia applications require a system that provides quality of service (QoS) assurance and flexibility. One promising field is the area of content-based coding. Content-based systems use an array of protocols to select the optimum set of coding algorithms. A content-based transport protocol integrates a content-based application to a transmission network. General transport protocols form a bottleneck in low data-rate multimedia communicationbsy limiting throughpuot r by not maintainingt iming requirementsT. his work presents an original model of a transport protocol that eliminates the bottleneck by introducing a flexible yet efficient algorithm that uses an open approach to flexibility and holistic architectureto promoteQ oS.T he flexibility andt ransparenccyo mesi n the form of a fixed syntaxt hat providesa seto f transportp rotocols emanticsT. he mediaQ oSi s maintained by defining a generic descriptor. Overall, the structure of the protocol is based on a single adaptablea lgorithm that supportsa pplication independencen, etwork independencea nd quality of service. The transportp rotocol was evaluatedth rougha set of assessmentos:f f-line; off-line for a specific application; and on-line for a specific application. Application contexts used MPEG-4 test material where the on-line assessmenuts eda modified MPEG-4 pl; yer. The performanceo f the QoSc ontrolledt ransportp rotocoli s often bettert hano thers chemews hen appropriateQ oS controlledm anagemenatl gorithmsa re selectedT. his is shownf irst for an off-line assessmenwt here the performancei s compared between the QoS controlled multiplexer,a n emulatedM PEG-4F lexMux multiplexers chemea, ndt he targetr equirements. The performanceis also shownt o be better in a real environmentw hen the QoS controlled multiplexeri s comparedw ith the real MPEG-4F lexMux scheme

Bi & tri dimensional scene description and composition in the MPEG-4 standard

MPEG-4 is a new ISO/IEC standard being developed by MPEG (Moving Picture Experts Group). The standard is to be released in November 1998 and version 1 will be an International Standard in January 1999 The MPEG-4 standard addresses the new demands that arise in a world in which more and more audio-visual material is exchanged in digital form MPEG-4 addresses the coding of objects of various types. Not only traditional video and audio frames, but also natural video and audio objects as well as textures, text, 2- and 3-dimensional graphic primitives, and synthetic music and sound effects. Using MPEG-4 to reconstruct an audio-visual scene at a terminal, it is hence no longer sufficient to encode the raw audio-visual data and transmit it, as MPEG-2 does m order to synchronize video and audio. In MPEG-4, all objects are multiplexed together at the encoder and transported to the terminal Once de-multiplexed, these objects are composed at the terminal to construct and present to the end user a meaningful audio-visual scene. The placement of these elementary audio-visual objects in space and time is described in the scene description of a scene. While the action of putting these objects together in the same representation space is the composition of audio-visual objects. My research was concerned with the scene description and composition of the audio-visual objects that are defined in an audio-visual scene Scene descriptions are coded independently irom sticams related to primitive audio-visual objects. The set of parameters belonging to the scene description are differentiated from the parameters that are used to improve the coding efficiency of an object. While the independent coding of different objects may achieve a higher compression rate, it also brings the ability to manipulate content at the terminal. This allows the modification of the scene description parameters without having to decode the primitive audio-visual objects themselves. This approach allows the development of a syntax that describes the spatio-temporal relationships of audio-visual scene objects. The behaviours of objects and their response to user inputs can thus also be represented in the scene description, allowing richer audio-visual content to be delivered as an MPEG-4 stream

Multimedia in mobile networks: Streaming techniques, optimization and User Experience

1.UMTS overview and User Experience 2.Streaming Service & Streaming Platform 3.Quality of Service 4.Mpeg-4 5.Test Methodology & testing architecture 6.Conclusion

Renegotiable VBR service

In this work we address the problem of supporting the QoS requirements for applications while efficiently allocating the network resources. We analyse this problem at the source node where the traffic profile is negotiated with the network and the traffic is shaped according to the contract. We advocate VBR renegotiation as an efficient mechanism to accommodate traffic fluctuations over the burst time-scale. This is in line with the Integrated Service of the IETF with the Resource reSerVation Protocol (RSVP), where the negotiated contract may be modified periodically. In this thesis, we analyse the fundamental elements needed for solving the VBR renegotiation. A source periodically estimates the needs based on: (1) its future traffic, (2) cost objective, (3) information from the past. The issues of this estimation are twofold: future traffic prediction given a prediction, the optimal change. In the case of a CBR specification the optimisation problem is trivial. But with a VBR specification this problem is complex because of the multidimensionality of the VBR traffic descriptor and the non zero condition of the system at the times where the parameter set is changed. We, therefore, focus on the problem of finding the optimal change for sources with pre-recorded or classified traffic. The prediction of the future traffic is out of the scope of this thesis. Traditional existing models are not suitable for modelling this dynamic situation because they do not take into account the non-zero conditions at the transient moments. To address the shortfalls of the traditional approaches, a new class of shapers, the time varying leaky bucket shaper class, has been introduced and characterised by network calculus. To our knowledge, this is the first model that takes into account non-zero conditions at the transient time. This innovative result forms the basis of Renegotiable VBR Service (RVBR). The application of our RVBR mathematical model to the initial problem of supporting the applications' QoS requirements while efficiently allocating the network resources results in simple, efficient algorithms. Through simulation, we first compare RVBR service versus VBR service and versus renegotiable CBR service. We show that RVBR service provides significant advantages in terms of resource costs and resource utilisation. Then, we illustrate that when the service assumes zero conditions at the transient time, the source could potentially experience losses in the case of policing because of the mismatch between the assumed bucket and buffer level and the policed bucket and buffer level. As an example of RVBR service usage, we describe the simulation of RVBR service in a scenario where a sender transmits a MPEG2 video over a network using RSVP reservation protocol with Controlled-Load service. We also describe the implementation design of a Video on Demand application, which is the first example of an RVBR-enabled application. The simulation and experimentation results lead us to believe that RVBR service provides an adequate service (in terms of QoS guaranteed and of efficient resource allocation) to sources with pre-recorded or classified traffic

Quantum ESPRESSO: One Further Step toward the Exascale

We review the status of the Quantum ESPRESSO software suite for electronic-structure calculations based on plane waves, pseudopotentials, and density-functional theory. We highlight the recent developments in the porting to GPUs of the main codes, using an approach based on OpenACC and CUDA Fortran offloading. We describe, in particular, the results achieved on linear-response codes, which are one of the distinctive features of the Quantum ESPRESSO suite. We also present extensive performance benchmarks on different GPU-accelerated architectures for the main codes of the suite

Automated Scenario Generation Environment

Report describes IST\u27s investigation into the feasibility of automating the process of planning and scenario generation for large scale (joint level) simulation exercises and development of an architecture for that purpose

Quantum ESPRESSO: One Further Step toward the Exascale

We review the statusof the Quantum ESPRESSO softwaresuite for electronic-structure calculations based on plane waves,pseudopotentials, and density-functional theory. We highlight therecent developments in the porting to GPUs of the main codes, usingan approach based on OpenACC and CUDA Fortran offloading.We describe, in particular, the results achieved on linear-responsecodes, which are one of the distinctive features of the QuantumESPRESSO suite. We also present extensive performance benchmarkson different GPU-accelerated architectures for the main codes of thesuite

Caching of Interactive Branching Video in MPEG-4

The goal is to investigate the minimum amount of knowledge needed by a proxy server for consistent caching of interactive multimedia scenes encoded in MPEG-4 systems. We limit the interactive multimedia scenes to be of the type branching video. The caching scheme proposed is a specialization of partial caching. The extent of a branching video is the number of alternative branches available to the user at a branching point. The proposed caching scheme is extent domain caching. It works by limiting the number of alternative branches stored in the cache. Cache misses are served from the source server to provide a service transparent for the users. An implementation with test runs is provided. In the implementation the interactivity is limited to building blocks of complete ES. For content with several alternative scenes within a single ES, a different approach is needed. The proxy have to construct ad hoc objects from the AUs that constitute the alternative scenes. These ad hoc objects should be identifiable and have defined boundaries. Caching replacement decisions are then made on the ad hoc objects, and not on the complete ES. Identities can be constructed from the sequence number of the AUs and the ES id. The boundaries can be found by analysing where the users shift playback point