CAJ | 학술논문

针对服务代理采用的现有数据中心选择算法存在系统性能低和总体成本高等问题，提出一种基于优先级的轮询服务代理算法。该算法对数据中心的优先级进行定义，并根据数据中心的优先级选择数据中心。通过基于C loudSim 仿真器的实验，结果证明该算法比现有数据中心选择算法拥有更好的性能。
침대복무대리채용적현유수거중심선택산법존재계통성능저화총체성본고등문제，제출일충기우우선급적륜순복무대리산법。해산법대수거중심적우선급진행정의，병근거수거중심적우선급선택수거중심。통과기우C loudSim 방진기적실험，결과증명해산법비현유수거중심선택산법옹유경호적성능。
A ccording to the issues in current data center selection algorithm s used in the service broker such as low system perform ance and high overall cost, this paper proposes a round robin algorithm based on priority for service broker. T he proposed algorithm defines the priority for data centers and selects the data center w ith priority. A series of experim ents w as conducted on the C loudSim . E xperim ental results show that the proposed algorithm perform s better than current data center selection algorithm s.