OASIcs.MEMICS.2010.116.pdf
- Filesize: 433 kB
- 8 pages
Document
Integer Programming for Media Streams Planning Problem
Authors
-
Part of:
Volume:
Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'10) -- Selected Papers (MEMICS 2010)
Series: Open Access Series in Informatics (OASIcs) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-03-11
Cite AsGet BibTex
Pavel Troubil and Hana Rudova. Integer Programming for Media Streams Planning Problem. In Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'10) -- Selected Papers. Open Access Series in Informatics (OASIcs), Volume 16, pp. 116-123, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/OASIcs.MEMICS.2010.116
https://doi.org/10.4230/OASIcs.MEMICS.2010.116
Abstract
Continually increasing demands for high-quality videoconferencing have brought a problem of fully automated environment setup. A media streams planning problem forms an important part of this issue. As the multimedia streams are extremely bandwidth-demanding, their transmission has to be planned with respect to available capacities of network links and the plan also needs to be optimal in terms of data transfer latencies. This paper presents an integer programming solution of the problem and its implementation. The implementation achieved very promising results in performance-evaluating measurements. Compared to previous constraint-based solver, it is capable of finding optimal solution significantly faster, allowing for real-time planning of larger problem instances.
Keywords
- Media streams planning
- integer programming
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads