Integer Linear Programming Models for Media Streams Planning

TROUBIL, Pavel and Hana RUDOVÁ. Integer Linear Programming Models for Media Streams Planning. Online. Lecture Notes in Management Science. Istanbul: Bahcesehir University, Istanbul, 2011, vol. 2011, No 3, p. 509-522. ISSN 2008-0050. [citováno 2024-04-24]

Basic information

• Original name: Integer Linear Programming Models for Media Streams Planning
• Authors: TROUBIL, Pavel (203 Czech Republic, guarantor, belonging to the institution) and Hana RUDOVÁ (203 Czech Republic, belonging to the institution)
• Edition: Lecture Notes in Management Science, Istanbul, Bahcesehir University, Istanbul, 2011, 2008-0050.

Other information

• Original language: English
• Type of outcome: Article in a journal
• Field of Study: 10201 Computer sciences, information science, bioinformatics
• Country of publisher: Turkey
• Confidentiality degree: is not subject to a state or trade secret
• RIV identification code: RIV/00216224:14330/11:00052463
• Organization unit: Faculty of Informatics
• Keywords in English: media streams planning; integer programming; cycle avoidance
• Tags: best3
• Tags: International impact, Reviewed

Abstract

Advanced collaborative environments frequently need to transfer highly demanding multimedia data streams with minimum possible latency. Since bandwidths of the streams are close to capacities of currently available links, routing of data transfers therefore requires planning with respect to link capacities and latency optimization. This paper describes integer linear programming techniques for optimal solution of the multimedia streams planning problem. Several methods for cycle avoidance in transmission graphs and network flows formulation are proposed. Performance of the methods was evaluated to identify their efficiency for real-time planning and to compare it against an earlier constraint programming approach applied in an application middleware called CoUniverse. According to the results, network flows formulation appears to be the most promising.

Abstract (in Czech)

Advanced collaborative environments frequently need to transfer highly demanding multimedia data streams with minimum possible latency. Since bandwidths of the streams are close to capacities of currently available links, routing of data transfers therefore requires planning with respect to link capacities and latency optimization. This paper describes integer linear programming techniques for optimal solution of the multimedia streams planning problem. Several methods for cycle avoidance in transmission graphs and network flows formulation are proposed. Performance of the methods was evaluated to identify their efficiency for real-time planning and to compare it against an earlier constraint programming approach applied in an application middleware called CoUniverse. According to the results, network flows formulation appears to be the most promising.

Links

• MSM0021622419, plan (intention): Name: Vysoce paralelní a distribuované výpočetní systémy

Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems

• MUNI/A/0914/2009, interní kód MU: Name: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace (Acronym: SV-FI MAV)

Investor: Masaryk University, Category A