BANDWIDTH REQUIREMENT OF LINKS IN A HIERARCHICAL CACHING NETWORK: A GRAPH-BASED FORMULATION, AN ALGORITHM AND ITS PERFORMANCE EVALUATION

D. Sarkar, U.K. Sarkar, and G. Peng

References

  1. [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. [2] V. Cardellini, M. Colajanni, & P.S. Yu, Request redirection algorithms for distributed web systems, IEEE Trans. on Paralleland Distributed Systems, 14(4) 2003, 355–368. doi:10.1109/TPDS.2003.1195408
  3. [3] V. Kanodia & E.W. Knightly, Ensuring latency targets inmulticlass web servers, IEEE Trans. on Parallel and DistributedSystems, 14(1), 2003, 84–93. doi:10.1109/TPDS.2003.1167373
  4. [4] T.F. Abdelzaher, K.G. Shin, & N. Bhatti, Performance guarantees for web server end systems: a control-theoretical approach,IEEE Trans. on Parallel and Distributed Systems, 13(1) 2002,80–96. doi:10.1109/71.980028
  5. [5] M. Abrams, C. Standridge, G. Abdulla, S. Williams, & E.A.Fox, Caching proxies: limitations and potentials, World WideWeb Journal, 1, 1995, 119–133.
  6. [6] A. Chankhunthod, P.B. Danzig, C. Neerdaels, M.F. Schwartz,& K. Worrel, A hierarchical internet object cache, Proc. of the1996 USENIX Technical Conf., San Diego, CA, January 1996.
  7. [7] A. Luotonen & K. Altis, World-Wide Web Proxies, ComputerNetworks and ISDN Systems, 27 1994, 147–154. doi:10.1016/0169-7552(94)90128-7
  8. [8] A. Luotonen, Web Proxy Servers (Englewood Cliffs, NJ: Prentice Hall, 1997).
  9. [9] R. Tewari, M. Dahlin, H. Vin, & J. Kay, Design Considerationsfor Distributed Caching on the Internet, The 19th IEEE Int.Conf. on Distributed Computing Systems (ICDCS), May 1999,273–284.
  10. [10] J. Wang, A survey of web caching schemes for the Internet,ACM SIGCOMM Computer Communication Review, 29(5),pp. 36–46, October 1999.
  11. [11] P. Rodriguez, C. Spanner, & E.W. Biersack, Analysis of webcaching architectures: hierarchical and distributed caching,IEEE/ACM Trans. on Networking, 9(4) 2001, 404–418. doi:10.1109/90.944339
  12. [12] A. Wolman, M. Voelker, N. Sharma , N. Cardwell, A. Karlin,& H.M. Levy, On the scale and performance of cooperativeWeb proxy caching, ACM SIGOPS Operating Systems Review,Proc. of the 17th ACM Symp. on Operating Systems Principles,33(5), pp. 16–31, December 1999.
  13. [13] M.R. Korupolu, C.G. Plaxton, & R. Rajaraman, Placementalgorithms for hierarchical cooperative caching, Journal ofAlgorithms, 38, 2001, 260–302. doi:10.1006/jagm.2000.1129
  14. [14] R. Alonso & M. Blaze, Dynamic hierarchical caching for large-scale distributed file systems, Proc. of the 12th Int. Conf. onDistributed Computing Systems, June 1992, 521–528.
  15. [15] C.M. Bowman, P.B. Danzig, D.R. Hardy, U. Manber, & M.F.Schwartz, Harvest: A scalable, customizable discovery andaccess system, Technical Report CU-CS-732-94, University ofColorado, Boulder, 1994.
  16. [16] P.B. Danzig, NetCache architecture and deployment, ComputerNetworks and ISDN systems, 30, 1998, 2081–2091.
  17. [17] S. Gadde, J. Chase, & M. Rabinovich, A taste of crispy squid,in Proc. of the Workshop on Internet Service Performance(WISP ’98), June 1998.
  18. [18] Internet Cache Protocol—RFC2186, URL: http://www.faqs.org/rfcs/rfc2186.html
  19. [19] Application of Internet Cache Protocol—RFC2187, URL:http://www.faqs.org/rfcs/rfc2186.html
  20. [20] J. Escorcia, D. Ghosal, & D. Sarkar, A novel cache distributionheuristic algorithm for a mesh of caches and its performanceevaluation, Computer Communications, 25, 2002, 329–340. doi:10.1016/S0140-3664(01)00364-4
  21. [21] The LEDA Home Page URL: http://www.mpi-sb.mpg.de/LEDA/leda.html
  22. [22] M.F. Arlitt & C.L. Williamson, Web server workload characterization: the search for invariants, 1996 ACM SIGMET-RICS Int. Conf. on Measurement and Modeling of ComputerSystems, Philadelphia, PA, USA, 24, 1:126-37, 1996.

Important Links:

Go Back