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”

Local Search Heuristics for Media Streams Planning Problem

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Local Search Heuristics for Media Streams Planning Problem

  • Original language description

    The high quality video-mediated communication uses data streams with high bitrates, often comparable to capacity of network links, while demanding the latency to be as low as possible. The problem of finding the optimal solution to multipoint data distribution on application level while minimizing distribution latency is NP-complete and this paper presents a novel approach to solving the problem using local search methods. Experimental evaluation within the CoUniverse framework shows that the proposed algorithm is capable of solving problems an order of magnitude larger than previously available approaches, while maintaining high quality of the solutions. The proposed approach also makes initial attempts towards system dynamics handling and minimizingimpact on already participating users.

  • 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

    Proceedings of the 7th IEEE International Conference on Advanced Information Networking and Applications

  • ISBN

    9780769549538

  • ISSN

    1550-445X

  • e-ISSN

  • Number of pages

    9

  • Pages from-to

    945-953

  • Publisher name

    IEEE Computer Society

  • Place of publication

    Washington

  • Event location

    Barcelona

  • Event date

    Jan 1, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000324398900125