The Community for Technology Leaders
Green Image
<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.
Krishna M. Kavi, Deng-Jyi Chen, Pao-Yuan Chang, "Multimedia File Allocation on VC Networks Using Multipath Routing", IEEE Transactions on Computers, vol. 49, no. , pp. 971-977, September 2000, doi:10.1109/12.869329
88 ms
(Ver 3.3 (11022016))