캐시 네트워크의 이론적 분석 연구 동향

  • 발행 : 2013.09.16

초록

키워드

참고문헌

  1. T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K. H. Kim, S. Shenker, and I. Stoica, "A data-oriented (and beyond) network architecture," in Proc. ACM SIGCOMM, 2007.
  2. L. Zhang, D. Estrin, J. Burke, V. Jacobson, J. D. Thornton, D. K. Smetters, B. Zhang, G. Tsudik, D. Massey, C. Papadopoulos et al.,"Named data networking(NDN) project," Relat'orio T'ecnico NDN-0001, Xerox Palo Alto Research Center-PARC, 2010.
  3. V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard, "Networking named content," in Proc. ACM CoNext, 2009.
  4. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web caching and zipf-like distributions: Evidence and implications," in Proc. IEEE Infocom, 1999.
  5. M. Cha, H. Kwak, P. Rodriguez, Y. Ahn, and S. Moon, "I tube, you tube, everybody tubes," Sigcomm, 2007.
  6. M. Zink, K. Suh, Y. Gu, and J. Kurose, "Characteristics of youtubenetwork traffic at a campus network-measurements, models, and implications," Computer Networks, 53(4):501-514, 2009. https://doi.org/10.1016/j.comnet.2008.09.022
  7. S. Acharya, B. Smith, and P. Parnes, "Characterizing user access to videos on the world wide web," Electronic Imaging, Vol. 3969, p130-141, 2000.
  8. S. Podlipnig and L. Böszörmenyi, "A survey of web cache replacement strategies," ACM Comput. Surv., 35 (4):374-398, Dec. 2003. https://doi.org/10.1145/954339.954341
  9. P. Jelenkovic, "Asymptotic approximation of the moveto- front search cost distribution and least-recently-used caching fault probabilities," The Annals of Applied Probability, Vol. 9, No. 2, pp. 430-464, 1999. https://doi.org/10.1214/aoap/1029962750
  10. P. R. Jelenkovic, X. Kang, and A. Radovanovic, "Near optimality of the discrete persistent access caching algorithm," in Proc. International Conference on Analysis of Algorithms, 2005.
  11. A. Dan and D. Towsley, "An approximate analysis of the LRU and FIFO buffer replacement schemes," Performance Evaluation Review, Vol. 18, No. 1, pp. 143- 152, 1990. https://doi.org/10.1145/98460.98525
  12. H. Che, Z. Wang, and Y. Tung, "Analysis and design of hierarchical Web caching systems," in Proc. Infocom, 2001.
  13. H. Che, Y. Tung, and Z. Wang, "Hierarchical Web caching systems: modeling, design and experimental results," IEEE Journal on Selected Areas in Communications, Vol. 20, No. 7, pp. 1305-1314, 2002. https://doi.org/10.1109/JSAC.2002.801752
  14. C. Fricker, P. Robert, and J. Roberts, "A versatile and accurate approximation for LRU cache performance," in Proc. ITC, 2012.
  15. P. Rodriguez, C. Spanner, and E. W. Biersack, "Analysis of Web caching architectures: hierarchical and distributed caching," IEEE Transactions on Networking, Vol. 9, No. 4, pp. 404-418, 2001. https://doi.org/10.1109/90.944339
  16. E. Rosensweig, J. Kurose, and D. Towsley, "Approximate models for general cache networks," in Proc. Infocom, 2010.
  17. G. Garcia, A. Beben, F. J. Ramon, A. Maeso, I. Psaras, G. Pavlou, N. Wang, J. Sliwinski, S. Spirou, S. Soursos, and E. Hadjioannou, "COMET: content mediator architecture for content-aware networks," in Proc. Future Network and Mobile Summit, 2011.
  18. M. Gallo, B. Kauffmann, L. Muscariello, A. Simonian, and C. Tanguy, "Performance evaluation of the random replacement policy for networks of caches," in Proc. ACM SIGMETRICS, 2012.
  19. E.J. Rosensweig, J. Kurose, "Breadcrumbs: Efficient, best-effort content location in cache networks," in Proc. IEEE Infocom, 2009.
  20. R. Kleinberg, "Geographic routing using hyperbolic space," in Proc. IEEE Infocom, 2007.
  21. M. Boguna, F. Papadopoulos, D. Krioukov, "Sustaining the Internet with hyperbolic mapping," Nature Commun, Vol. 1, p62, 2010.
  22. S. Gitzenis, G. S. Paschos, and L. Tassiulas, "Asymptotic laws for content replication and delivery in wireless networks," in Proc. Infocom, 2012.
  23. B. Azimdoost, C. Westphal, and H. R. Sadjadpour, "On the throughput capacity of information-centric networks," arXiv preprint arXiv:1210.1185, 2012.