Multimedia file allocation on VC networks using multipath routing
| dc.citation.epage | 977 | en_US |
| dc.citation.issue | 9 | en_US |
| dc.citation.spage | 971 | en_US |
| dc.citation.volume | 49 | en_US |
| dc.citation.woscount | 2 | |
| dc.contributor.author | Chang, PY | en_US |
| dc.contributor.author | Chen, DJ | en_US |
| dc.contributor.author | Kavi, KM | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:44:50Z | |
| dc.date.available | 2014-12-08T15:44:50Z | |
| dc.date.issued | 2000-09-01 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.identifier.issn | 0018-9340 | en_US |
| dc.identifier.journal | IEEE TRANSACTIONS ON COMPUTERS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/30266 | |
| dc.identifier.wosnumber | WOS:000089459600011 | |
| dc.language.iso | en_US | en_US |
| dc.subject | file allocation | en_US |
| dc.subject | virtual circuit | en_US |
| dc.subject | cut | en_US |
| dc.subject | maximum flow | en_US |
| dc.subject | linear programming | en_US |
| dc.subject | branch and bound | en_US |
| dc.title | Multimedia file allocation on VC networks using multipath routing | en_US |
| dc.type | Article | en_US |