Bandwidth Requirement of Links in a Hierarchical Caching Network: A Graph-Based Formulation, An Algorithm and Its Performance Evaluation-Reference-Cited by-同舟云学术

Bandwidth Requirement of Links in a Hierarchical Caching Network: A Graph-Based Formulation, An Algorithm and Its Performance Evaluation

Published:2007-01 Issue:1 Volume:29 Page:70-78
ISSN:1206-212X
Container-title:International Journal of Computers and Applications
language:en
Short-container-title:International Journal of Computers and Applications

Author:

Sarkar D.¹,Sarkar U.K.²,Peng G.³

Affiliation:

1. Computer Science Department of the University of Miami, Coral Gables, FL 33124;

2. Management Information Systems Department of the Indian Institute of Management, Calcutta, India;

3. Department of Computer Science, University of Miami, Coral Gables, FL, USA;

Publisher

Informa UK Limited

Subject

Computer Graphics and Computer-Aided Design,Computer Science Applications,Hardware and Architecture,Software

Link

https://www.tandfonline.com/doi/pdf/10.1080/1206212X.2007.11441834

Reference13 articles.

1. R. Mukhopadhayay, F. Wang, & K. Kong,A new demand-driven data diffusion algorithm for hierarchical caching, Technical Report CSE-2000-13, Department of Computer Science, University of California at Davis, Davis, CA 95616, 2000.

2. M. Abrams, C. Standridge, G. Abdulla, S. Williams, & E.A. Fox, Caching proxies: limitations and potentials,World Wide Web Journal, 1, 1995, 119–133.

3. A. Chankhunthod, P.B. Danzig, C. Neerdaels, M.F. Schwartz, & K. Worrel, A hierarchical internet object cache,Proc. of the 1996 USENIX Technical Conf., San Diego, CA, January 1996.

4. A. Luotonen & K. Altis, World-Wide Web Proxies,Computer Networks and ISDN Systems, 27 1994, 147–154.

5. A. Luotonen,Web Proxy Servers(Englewood Cliffs, NJ: Prentice Hall, 1997).

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs;Constraints;2019-12-20