Scheduling File Transfers in Fully Connected Networks

ISCAS OpenIR

	Scheduling File Transfers in Fully Connected Networks
	PedroI. Rivera-Vega; Ravi Varadarajan; Shamkant B. Navathe
	2006
发表期刊	Networks
卷号	22 期号:6 页码:563 - 588
摘要	We consider the problem of transferring a set of files from their given locations in a fully connected network to their respective target locations in minimum time. We show that this problem is NP-hard even with the restriction that no file uses more than two edges in its route. We present an efficient algorithm to solve this problem in the case when there is only one source and one or more destinations. For the general case, we propose a two-phase approach to find two-edge schedules that are optimal or close-to-optimal. In Phase I, two-edge routes are assigned to files; in Phase II, a schedule is determined for the use of the links in these routes. For Phase I, we present an exact solution that is based on integer programming formulation and also give theoretical bounds for approximate solution. We also propose a route assignment algorithm that attempts to assign routes of minimum congestion. For Phase II, we present an efficient algorithm that constructs a schedule from the solution obtained in the first phase.
收录类别	其他
合作性质	其它
语种	英语
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/1289
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	PedroI. Rivera-Vega,Ravi Varadarajan,Shamkant B. Navathe. Scheduling File Transfers in Fully Connected Networks[J]. Networks,2006,22(6):563 - 588.
APA	PedroI. Rivera-Vega,Ravi Varadarajan,&Shamkant B. Navathe.(2006).Scheduling File Transfers in Fully Connected Networks.Networks,22(6),563 - 588.
MLA	PedroI. Rivera-Vega,et al."Scheduling File Transfers in Fully Connected Networks".Networks 22.6(2006):563 - 588.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
bj01125276.pdf（1259KB）			开放获取	使用许可	请求全文