中国科学院重庆绿色智能技术研究院机构知识库

QQ客服 官方微博 反馈留言

	An Approximation Method Of Optimal Scheduling For Multicommodity Flows In Cloud-Service Scenarios
	Huang, Dong1,2; Yang, Yong2; Tang, Lun1; Zhang, Ju2; Wang, Xiang2
	2016-01-02
摘要	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.
关键词	Cloud computing Multicommodity flows Communication network Optimal approximation method
DOI	10.1080/10798587.2015.1048967
发表期刊	INTELLIGENT AUTOMATION AND SOFT COMPUTING
ISSN	1079-8587
卷号	22期号:1页码:143-152
通讯作者	Yang, Y (reprint author), Chinese Acad Sci, Chongqing Inst Green & Intelligent Technol, Chongqing, Peoples R China.
收录类别	SCI
WOS记录号	WOS:000371678800002
语种	英语