INTEGER LINEAR PROGRAMMING MODELS FOR MEDIA STREAMS PLANNING

 

Pavel Troubil, Hana Rudová

 

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.

 

Lecture Notes in Management Science (2011) Vol. 3: 509-522

3rd International Conference on Applied Operational Research, Proceedings

© Tadbir Operational Research Group Ltd. All rights reserved.

www.tadbir.ca

 

ISSN 2008-0050 (Print)

ISSN 1927-0097 (Online)

 

ARTICLE OUTLINE

 

·         Introduction

·         Elements Of The Problem And Terminology

·         Core Constraints

·         Cycle Constraints

·         Immediate Avoidance

·         Delayed Elimination

·         Flow Constraints

·         Evaluation And Results

·         Data Sets And Experimental Setup

·         Performance Measurements

·         Conclusions

·         References

 

Full Text PDF