All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Media Streams Planning with Transcoding

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00066216" target="_blank" >RIV/00216224:14330/13:00066216 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/NCA.2013.46" target="_blank" >http://dx.doi.org/10.1109/NCA.2013.46</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/NCA.2013.46" target="_blank" >10.1109/NCA.2013.46</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Media Streams Planning with Transcoding

  • Original language description

    High-quality video, both uncompressed and compressed with relatively low compression ratio, is used in interactive environments, where minimum end-to-end latency is required. The media streams planning solves multi-point data routing for such applications even when bitrate of streams is comparable to capacity of network links. Recent advances in acceleration of high-throughput low-latency video processing enable on-the-fly video transcoding even for 4K and 8K video streams, thus allowing individual adaptation of data stream for each recipient without affecting the others. Stimulated by these advances, we present a novel media streams planning with transcoding on network nodes, and a mixed integer programming approach to solve the problem optimally. Ourapproach also enhances traditional end-to-end network model of the whole system with known topology of certain network regions. Our solution was implemented in the CoUniverse, which is middleware for orchestration of collaborative enviro

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F12%2F0306" target="_blank" >GAP202/12/0306: Dyschnet - Dynamic planning and scheduling of computational and network resources</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2013

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    12th IEEE International Symposium on Network Computing and Applications (NCA 2013)

  • ISBN

    9780768550436

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    41-48

  • Publisher name

    IEEE

  • Place of publication

    USA

  • Event location

    Cambridge, Massachusetts, USA

  • Event date

    Aug 22, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article