摘要
该文考虑网络数据更新,需要控制代理服务器与目标服务器的距离时,树状网络上代理服务器的放置问题。利用二叉树结构和动态规划方法,得到了一个时间复杂度O(nhk)为多项式时间算法,其中n为网络结点数,k为代理服务器要放置的个数,h为树高。
The paper discusses the Web proxy location problem with consideration of read and update operations on the internet and controlling the distance between the Web proxies and the server.An algorithm with time complexity O(nhk) is got which uses binary tree and the dynamic programming,where n is the number of nodes in the net,k is the number of the placed web proxies and h is the height of the binary tree.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第13期140-142,共3页
Computer Engineering and Applications
基金
国家自然科学基金(the National Natural Science Foundation of China under Grant No.10371028)
浙江省教育厅资助科研课题(the Research Project of Department of Education of Zhejiang Province
China under Grant No.20050494)。
关键词
二叉树
动态规划
代理服务器
时延约束
binary tree
dynamic programming
Web proxy
delay restraint