Local Search Heuristics for Media Streams Planning Problem

D 2013

Local Search Heuristics for Media Streams Planning Problem

MAREK, Jiří, Petr HOLUB a Hana RUDOVÁ

Základní údaje

Originální název

Local Search Heuristics for Media Streams Planning Problem

Autoři

MAREK, Jiří (203 Česká republika, domácí), Petr HOLUB (203 Česká republika, domácí) a Hana RUDOVÁ (203 Česká republika, garant, domácí)

Vydání

Washington, Proceedings of the 7th IEEE International Conference on Advanced Information Networking and Applications, od s. 945-953, 9 s. 2013

Nakladatel

IEEE Computer Society

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Španělsko

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

tištěná verze "print"

Kód RIV

RIV/00216224:14330/13:00065958

Organizační jednotka

Fakulta informatiky

ISBN

978-0-7695-4953-8

ISSN

DOI

http://dx.doi.org/10.1109/AINA.2013.132

UT WoS

000324398900125

Klíčová slova anglicky

Data transfer planning; Local search; Collaborative environments; Data networks

Štítky

core_B, firank_B

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 24. 4. 2014 17:31, RNDr. Pavel Šmerk, Ph.D.

Anotace

V originále

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 minimizing impact on already participating users.

Návaznosti

GAP202/12/0306, projekt VaV

Název: Dyschnet - Dynamické plánování a rozvrhování výpočetních a síťových zdrojů (Akronym: Dyschnet)

Investor: Grantová agentura ČR, Dyschnet - Dynamické plánování a rozvrhování výpočetních a síťových zdrojů

MUNI/A/0760/2012, interní kód MU

Název: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace II. (Akronym: FI MAV II.)

Investor: Masarykova univerzita, Rozsáhlé výpočetní systémy: modely, aplikace a verifikace II., DO R. 2020_Kategorie A - Specifický výzkum - Studentské výzkumné projekty

Citovat

MAREK, Jiří, Petr HOLUB a Hana RUDOVÁ. Local Search Heuristics for Media Streams Planning Problem. In Leonard Barolli, Fatos Xhafa, Makoto Takizawa, Tomoya Enokido, Hui-Huang Hsu. Proceedings of the 7th IEEE International Conference on Advanced Information Networking and Applications. Washington: IEEE Computer Society, 2013, s. 945-953. ISBN 978-0-7695-4953-8. Dostupné z: https://dx.doi.org/10.1109/AINA.2013.132.

@inproceedings{1076440,
   author = {Marek, Jiří and Holub, Petr and Rudová, Hana},
   address = {Washington},
   booktitle = {Proceedings of the 7th IEEE International Conference on Advanced Information Networking and Applications},
   doi = {http://dx.doi.org/10.1109/AINA.2013.132},
   editor = {Leonard Barolli, Fatos Xhafa, Makoto Takizawa, Tomoya Enokido, Hui-Huang Hsu},
   keywords = {Data transfer planning; Local search; Collaborative environments; Data networks},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Washington},
   isbn = {978-0-7695-4953-8},
   pages = {945-953},
   publisher = {IEEE Computer Society},
   title = {Local Search Heuristics for Media Streams Planning Problem},
   year = {2013}
}

TY  - JOUR
ID  - 1076440
AU  - Marek, Jiří - Holub, Petr - Rudová, Hana
PY  - 2013
TI  - Local Search Heuristics for Media Streams Planning Problem
PB  - IEEE Computer Society
CY  - Washington
SN  - 9780769549538
KW  - Data transfer planning
KW  - Local search
KW  - Collaborative environments
KW  - Data networks
N2  - 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 minimizing impact on already participating users.
ER  -

MAREK, Jiří, Petr HOLUB a Hana RUDOVÁ. Local Search Heuristics for Media Streams Planning Problem. In Leonard Barolli, Fatos Xhafa, Makoto Takizawa, Tomoya Enokido, Hui-Huang Hsu. \textit{Proceedings of the 7th IEEE International Conference on Advanced Information Networking and Applications}. Washington: IEEE Computer Society, 2013, s.~945-953. ISBN~978-0-7695-4953-8. Dostupné z: https://dx.doi.org/10.1109/AINA.2013.132.

Podrobný výpis o publikaci