MAREK, Jiří, Petr HOLUB and 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, p. 945-953. ISBN 978-0-7695-4953-8. Available from: https://dx.doi.org/10.1109/AINA.2013.132.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Local Search Heuristics for Media Streams Planning Problem
Authors MAREK, Jiří (203 Czech Republic, belonging to the institution), Petr HOLUB (203 Czech Republic, belonging to the institution) and Hana RUDOVÁ (203 Czech Republic, guarantor, belonging to the institution).
Edition Washington, Proceedings of the 7th IEEE International Conference on Advanced Information Networking and Applications, p. 945-953, 9 pp. 2013.
Publisher IEEE Computer Society
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Spain
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
RIV identification code RIV/00216224:14330/13:00065958
Organization unit Faculty of Informatics
ISBN 978-0-7695-4953-8
ISSN 1550-445X
Doi http://dx.doi.org/10.1109/AINA.2013.132
UT WoS 000324398900125
Keywords in English Data transfer planning; Local search; Collaborative environments; Data networks
Tags firank_B
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 24/4/2014 17:31.
Abstract
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.
Links
GAP202/12/0306, research and development projectName: Dyschnet - Dynamické plánování a rozvrhování výpočetních a síťových zdrojů (Acronym: Dyschnet)
Investor: Czech Science Foundation
MUNI/A/0760/2012, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace II. (Acronym: FI MAV II.)
Investor: Masaryk University, Category A
PrintDisplayed: 25/4/2024 06:37