TY - GEN
T1 - An O(nh) algorithm for dual-server coordinated en-route caching in tree networks
AU - Xu, Shihong
AU - Shen, Hong
PY - 2006
Y1 - 2006
N2 - Dual-server coordinated en-route caching is important because of its basic features as multi-server en-route caching. In this paper, multi-server coordinated en-route caching is formulated as an optimization problem of minimizing total access cost, including transmission cost for all access demands and caching cost of all caches. We first discuss an algorithm for single-server en-route caching in tree networks and then show that this is a special case of another algorithm for dual-server en-route caching in tree networks whose time complexity is O(nh).
AB - Dual-server coordinated en-route caching is important because of its basic features as multi-server en-route caching. In this paper, multi-server coordinated en-route caching is formulated as an optimization problem of minimizing total access cost, including transmission cost for all access demands and caching cost of all caches. We first discuss an algorithm for single-server en-route caching in tree networks and then show that this is a special case of another algorithm for dual-server en-route caching in tree networks whose time complexity is O(nh).
UR - http://www.scopus.com/inward/record.url?scp=38949191594&partnerID=8YFLogxK
U2 - 10.1109/PDCAT.2006.34
DO - 10.1109/PDCAT.2006.34
M3 - Conference contribution
AN - SCOPUS:38949191594
SN - 0769527361
SN - 9780769527369
T3 - Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings
SP - 399
EP - 404
BT - Proceedings - Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006
T2 - 7th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006
Y2 - 4 December 2006 through 7 December 2006
ER -