An Approximation Method Of Optimal Scheduling For Multicommodity Flows In Cloud-Service Scenarios

doi:10.1080/10798587.2015.1048967

CORC > 重庆绿色智能技术研究院 > 中国科学院重庆绿色智能技术研究院 > 高性能计算应用研究中心

	An Approximation Method Of Optimal Scheduling For Multicommodity Flows In Cloud-Service Scenarios
	Huang, Dong 1,2; Yang, Yong2 ; Tang, Lun 1; Zhang, Ju2 ; Wang, Xiang2
刊名	INTELLIGENT AUTOMATION AND SOFT COMPUTING
	2016-01-02
卷号	22 期号:1 页码:143-152
关键词	Cloud computing Multicommodity flows Communication network Optimal approximation method
ISSN号	1079-8587
DOI	10.1080/10798587.2015.1048967
通讯作者	Yang, Y (reprint author), Chinese Acad Sci, Chongqing Inst Green & Intelligent Technol, Chongqing, Peoples R China.
英文摘要	With limited physical and virtual resources in cloud computing systems, it is not feasible to successively expand network infrastructure to adequately support the rapid growth in service. So the pervasive boundary in communication networks is that of allocating bandwidth to satisfy a given collection of service requests is hard to reach. In situations where there is limited network capacity but plethory of requests, the current optimal methodology of the choice of which requests to satisfy, thereby resulting in congestion and low utilization rate. It is imperative to develop new efficient scheduling methods. In this paper, we demonstrate these concepts through a case test study of scheduling for multicommodity flows in cloud-service environment by successive heuristics algorithms, and the heuristic solutions are then compared with the related network performance metrics obtained using the presented model. The effectiveness of the new technique was evaluated by comparison to the differentiated cost utilization and the comparison indicates that substantial improvements are possible. Then the lower cost of deployment on the cloud-computing systems can be justified. Moreover, developing an approximation optimization model can be beneficial to the communication network planning.
资助项目	863 high-tech program of China[2014AA01A701] ; NSFC[61171111]
WOS研究方向	Automation & Control Systems ; Computer Science
语种	英语
出版者	TAYLOR & FRANCIS INC
WOS记录号	WOS:000371678800002
内容类型	期刊论文
源URL	[http://119.78.100.138/handle/2HOD01W0/2331]
专题	高性能计算应用研究中心
通讯作者	Yang, Yong
作者单位	1.Chongqing Univ Posts & Telecommun, Chongqing, Peoples R China 2.Chinese Acad Sci, Chongqing Inst Green & Intelligent Technol, Chongqing, Peoples R China
推荐引用方式 GB/T 7714	Huang, Dong,Yang, Yong,Tang, Lun,et al. An Approximation Method Of Optimal Scheduling For Multicommodity Flows In Cloud-Service Scenarios[J]. INTELLIGENT AUTOMATION AND SOFT COMPUTING,2016,22(1):143-152.
APA	Huang, Dong,Yang, Yong,Tang, Lun,Zhang, Ju,&Wang, Xiang.(2016).An Approximation Method Of Optimal Scheduling For Multicommodity Flows In Cloud-Service Scenarios.INTELLIGENT AUTOMATION AND SOFT COMPUTING,22(1),143-152.
MLA	Huang, Dong,et al."An Approximation Method Of Optimal Scheduling For Multicommodity Flows In Cloud-Service Scenarios".INTELLIGENT AUTOMATION AND SOFT COMPUTING 22.1(2016):143-152.