Modeling data transfer in content-centric networking

Proceedings of the 2011 23rd International Teletraffic Congress, ITC 2011

Volumn , Issue , 2011, Pages 111-118

  Carofiglio, Giovanna ^a   Gallo, Massimo ^b   Muscariello, Luca ^b   Perino, Diego ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b ORANGE LABS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTICAL MODEL; ANALYTICAL RESULTS; BUILDING BLOCKES; CLOSED-FORM EXPRESSION; COMMUNICATION MODELS; CONTENT DISSEMINATION; DATA STORAGE; INTERNET USAGE; MODELING DATA;

DATA TRANSFER; INFORMATION THEORY; INTERNET PROTOCOLS; MATHEMATICAL MODELS; NETWORK LAYERS;

NETWORK ARCHITECTURE;

EID: 80054983897     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. V. Jacobson, D. Smetters, J. Thornton, M. Plass, N. Briggs, and R. Braynard, "Networking named content," in Proc. of ACM CoNEXT '09.
2. T. Koponen, M. Chawla, B. Chun, A. Ermolinskiy, K. Kim, S. Shenker, and I. Stoica, "A data-oriented (and beyond) network architecture," in Proc. of ACM SIGCOMM, 2007.
3. K. Park and V. S. Pai, "Scale and performance in the coblitz large-file distribution service," in Proc. of Usenix NSDI'06.
4. Z. Al-Qudah, S. Lee, M. Rabinovich, O. Spatscheck, and J. Van der Merwe, "Anycast-aware transport for content delivery networks," in Proc. of WWW '09.
5. S. Arianfar, P. Nikander, and J. Ott, "On content-centric router design and implications," in Proc. of ACM ReArch, 2010.
6. U. Lee, I. Rimac, and V. Hilt, "Greening the internet with content-centric networking," in Proc. of ACM E-Energy, 2010.
7. G. Carofiglio, V. Gehlen, and D. Perino, "Experimental evaluation of storage management in conten-centric networking," in Proc. of IEEE ICC, 2011.
8. W. King, "Analysis of paging algorithms," in Proc. of IFIP, 1971.
9. P. Flajolet, D. Gardy, and L. Thimonier, "Birthday paradox, coupon collectors, caching algorithms and self-organizing search," Discrete Appl. Math., vol. 39, no. 3, pp. 207-229, 1992.
10. D. Starobinski and D. Tse, "Probabilistic methods for web caching," Perform. Eval., vol. 46, no. 2-3, pp. 125-137, 2001.
11. E. Coffman and P. Jelenković, "Performance of the move-to-front algorithm with markov-modulated request sequences," Oper. Res. Lett., pp. 109-118, 1999.
12. P. R. Jelenković, "Asymptotic approximation of the move-to-front search cost distribution and least-recently-used caching fault probabilities," The Annals of Applied Probability, vol. 9, no. 2, pp. 430-464, 1999.
13. P. R. Jelenković and X. Kang, "Characterizing the miss sequence of the lru cache," in in Proc. of ACM SIGMETRICS, MAMA Workshop, 2008.
14. T. E. Stern and A. I. Elwalid, "Analysis of separable markov-modulated rate models for information-handling systems," Advances in Applied Probability, vol. 23, no. 1, pp. 105-139, 1991.
15. G. Carofiglio, M. Gallo, L. Muscariello, and D. Perino, "Modeling data transfer in conten-centric networking (extended version)," in Research report, available at http://perso.rd.francetelecom.fr/muscariello, 2011.
16. E. Chlebus and J. Brazier, "Nonstationary poisson modeling of web browsing session arrivals," Information Processing Letters, vol. 102, no. 5, pp. 187 - 190, 2007.
17. A. Carzaniga, M. Rutherford, and A. Wolf, "A routing scheme for content-based networking," in Proc. of INFOCOM 2004.
18. L. Cherkasova and M. Gupta, "Characterizing locality, evolution, and life span of accesses in en7terprise media server workloads," in Proc. of ACM NOSSDAV, 2002.