Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: An O(nh) algorithm for dual-server coordinated en-route caching in tree networks
Author: Xu, S.
Shen, H.
Citation: Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies : PDCAT 2006 : 4-7 December 2006, Taipei, Taiwan : proceedings / sponsored by IEEE Computer Society ... [et al.], pp. 399-404
Publisher: IEEE
Publisher Place: USA
Issue Date: 2006
ISBN: 0769527361
Conference Name: International Conference on Parallel and Distributed Computing, Applications and Technologies (7th : 2006 : Taipei, Taiwan)
Statement of
Shihong Xu, Hong Shen
Abstract: 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).
Rights: ©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
RMID: 0020062662
DOI: 10.1109/PDCAT.2006.34
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
hdl_36001.pdf618.8 kBPublisher's PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.