Relocation of Media Objects in a Cluster of Servers(Multimedia Systems)

概要

論文の詳細を見る
To provide multimedia services, a server system can use a cluster of servers to serve many users concurrently. In the literature, several assignment algorithms have been proposed to assign the media objects to these servers. The popularities of the media objects may change with time, and the service provider may add new objects or delete obsolete objects. In these cases, it is necessary to execute an assignment algorithm to find a new assignment. To realize the new assignment from the current one, it is necessary to relocate some objects. In this paper, we formulate and solve this relocation problem, and our objective is to minimize the relocation time for minimal service interruption. We propose a two-stage algorithm to solve this relocation problem. In the first stage, we introduce the concept of server relabelling, and apply the Hungarian method to find the largest common assignment between the new and current assignments. In the second stage, we propose a chain relocation schedule by which every object is directly relocated from its original server to the new server without dead-lock. We use computer simulation to demonstrate the effectiveness of the optimal relocation method.
社団法人電子情報通信学会の論文
2004-08-01