Comparison of CP and IP Techniques for Data Transfer Planning
Authors | |
---|---|
Year of publication | 2010 |
Type | Conference abstract |
MU Faculty or unit | |
Citation | |
Description | Planning of data transfers becomes an interesting problem when bandwidth of a requested traffic is comparable to a capacity of available networks. This type of problem is solved within CoUniverse framework supporting interactive high-quality media distribution for collaborative environments.The CoUniverse contains two alternative planning modules which comparison is the subject of this work. While a constraint programming solver was improved over the years, a new integer programming solver has been introduced recently. Current intent is a parallel development of both solvers and their improvement based on experiences with both methodologies. |
Related projects: |