Integer Linear Programming Models and Cycle Avoidance Methods for Media Streams Planning

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00052464" target="_blank" >RIV/00216224:14330/11:00052464 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Integer Linear Programming Models and Cycle Avoidance Methods for Media Streams Planning

Popis výsledku v původním jazyce

High-end collaborative tools simultaneously transmit multiple multimedia streams, each in an 1:n scheme. Bandwidth required by the streams is close to capacities of current links, and collaboration requires low latency. The Media Streams Planning Problemis a problem of routing streams in these tools. For each data source, a distribution tree is placed in the network. We optimize overall latency of all streams. Due to requests for quick call establishment, solver of the MSPP has to respond within seconds. Our aim is to improve its performance. We linearized the original CP formulation of the problem and proposed binary ILP solver to improve performance. We noticed that negative influence comes from cycle avoidance constraints. We proposed strategies which solve the problem without cycle avoidance methods, and eliminate only cycles appearing in the solutions. We also combined binary formulation with network flows constraints. This method avoids cycles and improves performance.

Název v anglickém jazyce

Integer Linear Programming Models and Cycle Avoidance Methods for Media Streams Planning

Popis výsledku anglicky

High-end collaborative tools simultaneously transmit multiple multimedia streams, each in an 1:n scheme. Bandwidth required by the streams is close to capacities of current links, and collaboration requires low latency. The Media Streams Planning Problemis a problem of routing streams in these tools. For each data source, a distribution tree is placed in the network. We optimize overall latency of all streams. Due to requests for quick call establishment, solver of the MSPP has to respond within seconds. Our aim is to improve its performance. We linearized the original CP formulation of the problem and proposed binary ILP solver to improve performance. We noticed that negative influence comes from cycle avoidance constraints. We proposed strategies which solve the problem without cycle avoidance methods, and eliminate only cycles appearing in the solutions. We also combined binary formulation with network flows constraints. This method avoids cycles and improves performance.

Druh

O - Ostatní výsledky

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

Kód důvěrnosti údajů

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