Issue No. 09 - September (2000 vol. 49)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.869329
<p><b>Abstract</b>—The problem of allocating high-volume multimedia files on a virtual circuit network with the objective of maximizing channel throughput (and minimizing data transmission time) is addressed. The problem is formulated as a multicommodity flow problem. We present both the optimal and suboptimal solutions to the problem using novel approaches.</p>
File allocation, virtual circuit, cut, maximum flow, linear programming, branch and bound.
K. M. Kavi, D. Chen and P. Chang, "Multimedia File Allocation on VC Networks Using Multipath Routing," in IEEE Transactions on Computers, vol. 49, no. , pp. 971-977, 2000.