Media Streams Planning
Autoři | |
---|---|
Rok publikování | 2011 |
Druh | Konferenční abstrakty |
Fakulta / Pracoviště MU | |
Citace | |
Popis | Media streams planning introduces a problem where placement of latency-sensitive streams over network is processed. In contrast to other classical path placement problems, each stream represents a communication tree with the root at producer and leafs at consumers. Our work introduces an alternative to the constraint programming approach included in an application middleware CoUniverse. Three types of integer linear programming solutions are introduced leading to significant improvements in the solver performance. |
Související projekty: |