Transfer of MPEG-2 Transport Stream over MPLS

This study examines how MPEG-2 Transport Stream, used in DVB-T video transmission, can be reliably and efficiently transferred to remote locations over an MPLS network. All the relevant technologies used in this scenario are also discussed in the study. This study was done for Digita Oy, which is a major radio and television content distributor in Finland. The theoretical part of the study begins with the introduction to MPLS technology and continues with explanation of IP Multicast and its components. The fourth section discusses MPEG-2 and the formation and content of MPEG-2 Transport Stream. These technologies were studied in relevant literature and RFC documentation. After the theoretical part of the study, the test setup and the test cases are presented. The results of the test cases, and the conclusions that can be drawn based on them, are discussed in the last section of the study. The tests showed that it is possible to transfer digital video quite reliably over an MPLS network using IP Multicast. By configuring the equipment correctly, the recovery time of the network in case of a failure can be shortened remarkably. Also, the unwanted effect of other traffic on the critical video traffic can be eliminated by defining the Quality of Service parameters correctly. There are, however, some issues that need to be tested further before this setup can be used in broadcast networks. Reliable operation of IP Multicast and proper error correction are the main subjects for future testing.

DVB-T-testilähetyksen lähettäminen Stadian radiolaboratorion laitteistolla

Tämä insinöörityö tehtiin Helsingin ammattikorkeakoululle. Työssä käsitellään DVB-Tstandardiin perustuvan lähetyslaitteiston kokoonpanoa ja testaamista. Työ perustuu standardeihin, opetusmateriaaliin ja käytännön kokemuksiin. Työ suoritettiin käytännön tutkimuksena. Työssä käsitellään DVB-T-standardia, digitaalisissa tv-lähetyksissä käytettävää MPEG-2 standardia ja siihen liittyen MPEG-2-transport streamia: transport streamin koostumusta, multipleksaamista ja psi/si-taulujen rakennetta. Työssä käydään myös läpi digisovittimen rakennetta ja toimintaperiaatetta, ASIrajapintaa, digitaalisen lähetinyksikön rakennetta ja esitellään Stadian Multimedia Communications- laboratoriossa oleva lähetinyksikkö. Työssä esitetään kuinka moduuleista koostuvalla lähetinlaitteistolla on mahdollista lähettää DVB-T-standardin mukaista testilähetystä. Työn lopputuloksena Stadian laboratorion lähetyslaitteistolla kyettiin lähettämään onnistuneesti testimateriaalia, joka vastaanotettiin kaupallisella digisovittimella.

Multimedian elementit aikuiskoulutuksen kehittämisessä

Tämän työn teoreettisen sisällön tavoitteena on esitellä multimedian eri elementit ja Moving Picture Experts Groupin kehittämä MPEG-formaattiperhe, joka yhdistää kattavimmin eri elementit multimediaesityksiksi. Työssä esitellään videon ja audion pakkausformaatit MPEG-1 ja MPEG-2, interaktiivisen median jakelun verkoissa mahdollistava MPEG-4, multimediasisällön kuvausstandardi MPEG-7 sekä multimedian toimitusketjun hallinnan verkoissa määrittävä MPEG-21. Edellisten lisäksi teoreettisessa osassa esitellään multimediaohjelmistoista SMIL-teknologia ja selostetaan yksityiskohtaisesti, kuinka sillä luodaan multimediaesityksiä. Empiirisessä osassa laaditaan Helsingin yliopiston Maaseudun tutkimus- ja koulutuskeskukselle kehittämissuunnitelma, jossa multimedian elementtejä käytetään mahdollisimman monipuolisesti kehittämään aikuiskoulutusta. Suunnitelman perustaksi tehtiin koulutushenkilökunnalle osaamiskartoitus ja kartoitettiin yksikön tekninen valmius hyödyntää multimediaa. Suunnitelman mielekästä jäsentämistä varten yksikön aikuiskoulutus jaettiin neljään osaan: varsinaiseen koulutukseen, sitä tukevaan tutkimus- ja kehittämistoimintaan, opetusmateriaaleja tuottavaan julkaisu- ja tietopalvelutoimintaan sekä edellisiä avustaviin tukitoimintoihin.

Scheduling dynamic dataflow graphs with model checking

With the shift towards many-core computer architectures, dataflow programming has been proposed as one potential solution for producing software that scales to a varying number of processor cores. Programming for parallel architectures is considered difficult as the current popular programming languages are inherently sequential and introducing parallelism is typically up to the programmer. Dataflow, however, is inherently parallel, describing an application as a directed graph, where nodes represent calculations and edges represent a data dependency in form of a queue. These queues are the only allowed communication between the nodes, making the dependencies between the nodes explicit and thereby also the parallelism. Once a node have the su cient inputs available, the node can, independently of any other node, perform calculations, consume inputs, and produce outputs. Data ow models have existed for several decades and have become popular for describing signal processing applications as the graph representation is a very natural representation within this eld. Digital lters are typically described with boxes and arrows also in textbooks. Data ow is also becoming more interesting in other domains, and in principle, any application working on an information stream ts the dataflow paradigm. Such applications are, among others, network protocols, cryptography, and multimedia applications. As an example, the MPEG group standardized a dataflow language called RVC-CAL to be use within reconfigurable video coding. Describing a video coder as a data ow network instead of with conventional programming languages, makes the coder more readable as it describes how the video dataflows through the different coding tools. While dataflow provides an intuitive representation for many applications, it also introduces some new problems that need to be solved in order for data ow to be more widely used. The explicit parallelism of a dataflow program is descriptive and enables an improved utilization of available processing units, however, the independent nodes also implies that some kind of scheduling is required. The need for efficient scheduling becomes even more evident when the number of nodes is larger than the number of processing units and several nodes are running concurrently on one processor core. There exist several data ow models of computation, with different trade-offs between expressiveness and analyzability. These vary from rather restricted but statically schedulable, with minimal scheduling overhead, to dynamic where each ring requires a ring rule to evaluated. The model used in this work, namely RVC-CAL, is a very expressive language, and in the general case it requires dynamic scheduling, however, the strong encapsulation of dataflow nodes enables analysis and the scheduling overhead can be reduced by using quasi-static, or piecewise static, scheduling techniques. The scheduling problem is concerned with nding the few scheduling decisions that must be run-time, while most decisions are pre-calculated. The result is then an, as small as possible, set of static schedules that are dynamically scheduled. To identify these dynamic decisions and to find the concrete schedules, this thesis shows how quasi-static scheduling can be represented as a model checking problem. This involves identifying the relevant information to generate a minimal but complete model to be used for model checking. The model must describe everything that may affect scheduling of the application while omitting everything else in order to avoid state space explosion. This kind of simplification is necessary to make the state space analysis feasible. For the model checker to nd the actual schedules, a set of scheduling strategies are de ned which are able to produce quasi-static schedulers for a wide range of applications. The results of this work show that actor composition with quasi-static scheduling can be used to transform data ow programs to t many different computer architecture with different type and number of cores. This in turn, enables dataflow to provide a more platform independent representation as one application can be fitted to a specific processor architecture without changing the actual program representation. Instead, the program representation is in the context of design space exploration optimized by the development tools to fit the target platform. This work focuses on representing the dataflow scheduling problem as a model checking problem and is implemented as part of a compiler infrastructure. The thesis also presents experimental results as evidence of the usefulness of the approach.