分布式交互应用中服务器放置问题的启发式算法.pdfVIP

第 42 卷第7 期 计算机科学 Vol. 42 No.7 2015 年 7 月 Computer Science July 2015 分布式交互应用中服务器放置问题的启发式算法 郑晶晶张晶武继刚 〈天津工业大学计算机科学与软件学院 天津 300387) 摘 要 分布式交互应用是允许分散在不同地点的多个参与者能实时进行交互的网络系统，它的交互质量在很大程 度上取决于网络延边，而通过对服务s位置的合理布局可以降低网络延迟.因此，服务s放直是影响分布式交互应用 的交互性能的关键因素。针对分布式交互应用中服务s放亘问题，提出了模拟退火算法和蒙忌搜余算法， 并与已有的 遗传算法进行了比校.通过实事金可以看出，尽管在求得较好串的速度方面，遗传算法占据优势，但在求得解的质量方 面，提出的模拟退火算法和袋忌旋余算法均优于遗传算法，在服务sjt量相同的条件下，延迟平均降低了 15.5%和 15.2%. 更加有效地提高了交互质量. 关键词 分布式交互应用， 服务a放豆.遗传算法，模拟退火算法，禁忌搜余算法 中固法分类号 TP391 文就标识码 A 四)1 10. 11896/j. issn. 1002- 137X. 2015. 7. 020 H euristic AJ伊rithm for Server Pla臼ment in Distributed Interactive Appliωtions ZHENG Jing-ji咱 ZHANG Jing WU Ji-gang (Sch∞I of Computer Science . Software Engineering. Tianjin Polyt配hnic University. Tianjin 300387.China) Abs仕act Distributed interactive applicationsCDIAs) are networked systems that allow multiple participants at different locations to interact with each other in real tim已 The interaction quality heavily depends on network latencies which can be reduced by reasonable distribution of location where the servers of the DIAs are placed. Thus. the placement of ser- vers is a key faclor to the interactivity performance of DIAs. The simulated annealing algorithm and tabu search algo- rithm were used to solve the server placement problem in this paper. Then these two algorithms were ∞mpared with ge- netic algorithrn. The experiment results show that the genetic algorithm is much faster in the speed of obtaining a better solut ion. but simulated annealing algorithm and tabu search algorithm outperform genetic algorithm in the quality of the solution and obtain average latency reducti