• DocumentCode
    3252266
  • Title

    Cooperative caching: The case for P2P traffic

  • Author

    Hefeeda, Mohamed ; Noorizadeh, Behrooz

  • Author_Institution
    Sch. of Comput. Sci., Simon Fraser Univ., Surrey, BC
  • fYear
    2008
  • fDate
    14-17 Oct. 2008
  • Firstpage
    12
  • Lastpage
    19
  • Abstract
    This paper analyzes the potential of cooperative proxy caching for peer-to-peer (P2P) traffic as a means to ease the burden imposed by P2P traffic on Internet service providers (ISPs). In particular, we propose two models for cooperative caching of P2P traffic. The first model enables cooperation among caches that belong to different autonomous systems (ASes), while the second considers cooperation among caches deployed within the same AS.We analyze the potential gain of cooperative caching in these two models. To perform this analysis, we conduct an eight-month measurement study on a popular P2P system to collect actual traffic traces for multiple caches. Then, we perform an extensive trace-based simulation study to analyze different angles of cooperative caching schemes. Our results demonstrate that: (i) significant improvement in byte hit rate can be achieved using cooperative caching, (ii) simple object replacement policies are sufficient to achieve that gain, and (iii) the overhead imposed by cooperative caching is negligible.
  • Keywords
    Internet; groupware; peer-to-peer computing; telecommunication traffic; Internet service providers; P2P traffic; autonomous systems; byte hit rate; cooperative proxy caching; object replacement policies; peer-to-peer traffic; trace-based simulation study; Analytical models; Cooperative caching; Peer to peer computing; Performance analysis; Performance evaluation; Protocols; Switches; Telecommunication traffic; Traffic control; Web and internet services;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Local Computer Networks, 2008. LCN 2008. 33rd IEEE Conference on
  • Conference_Location
    Montreal, Que
  • Print_ISBN
    978-1-4244-2412-2
  • Electronic_ISBN
    978-1-4244-2413-9
  • Type

    conf

  • DOI
    10.1109/LCN.2008.4664146
  • Filename
    4664146