An O(nh) Algorithm for Dual-Server Coordinated En-Route Caching in Tree Networks

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Shihong Xu Articles by Hong Shen

Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06)

Taipei, Taiwan

December 04-December 07

ISBN: 0-7695-2736-1

	ASCII Text	x
	Shihong Xu, Hong Shen, "An O(nh) Algorithm for Dual-Server Coordinated En-Route Caching in Tree Networks," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 399-404, Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06), 2006.

	BibTex	x
	@article{ 10.1109/PDCAT.2006.34, author = {Shihong Xu and Hong Shen}, title = {An O(nh) Algorithm for Dual-Server Coordinated En-Route Caching in Tree Networks}, journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on}, volume = {0}, year = {2006}, isbn = {0-7695-2736-1}, pages = {399-404}, doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2006.34}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel and Distributed Computing Applications and Technologies, International Conference on TI - An O(nh) Algorithm for Dual-Server Coordinated En-Route Caching in Tree Networks SN - 0-7695-2736-1 SP399 EP404 A1 - Shihong Xu, A1 - Hong Shen, PY - 2006 KW - null VL - 0 JA - Parallel and Distributed Computing Applications and Technologies, International Conference on ER -

Shihong Xu, Japan Advanced Institute of Science and Technology, Japan

Hong Shen, The University of Adelaide, Australia

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2006.34

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).

Citation:

Shihong Xu, Hong Shen, "An O(nh) Algorithm for Dual-Server Coordinated En-Route Caching in Tree Networks," pdcat, pp.399-404, Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06), 2006

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.