1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorChang, PYen_US
dc.contributor.authorChen, DJen_US
dc.contributor.authorKavi, KMen_US
dc.date.accessioned2014-12-08T15:44:50Z-
dc.date.available2014-12-08T15:44:50Z-
dc.date.issued2000-09-01en_US
dc.identifier.issn0018-9340en_US
dc.identifier.urihttp://hdl.handle.net/11536/30266-
dc.description.abstractThe 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.language.isoen_USen_US
dc.subjectfile allocationen_US
dc.subjectvirtual circuiten_US
dc.subjectcuten_US
dc.subjectmaximum flowen_US
dc.subjectlinear programmingen_US
dc.subjectbranch and bounden_US
dc.titleMultimedia file allocation on VC networks using multipath routingen_US
dc.typeArticleen_US
dc.identifier.journalIEEE TRANSACTIONS ON COMPUTERSen_US
dc.citation.volume49en_US
dc.citation.issue9en_US
dc.citation.spage971en_US
dc.citation.epage977en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000089459600011-
dc.citation.woscount2-
Appears in Collections:Articles


Files in This Item:

  1. 000089459600011.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...