1 / 20

Hint-based Acceleration of Web Proxy Cache

Hint-based Acceleration of Web Proxy Cache. Daniela Rosu Arun Iyengar Daniel Dias IBM T.J.Watson Research Center Unversity of Yuan Ze,Syslab Mike Tien mike@syslab.cse.yzu.edu.tw. Outline. 1. Accelerated Web Proxy

moses-marquez
Download Presentation

Hint-based Acceleration of Web Proxy Cache

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Hint-based Acceleration of Web Proxy Cache Daniela Rosu Arun Iyengar Daniel Dias IBM T.J.Watson Research Center Unversity of Yuan Ze,Syslab Mike Tien mike@syslab.cse.yzu.edu.tw

  2. Outline • 1.Accelerated Web Proxy • 2.Hint Representation • 3.Hint Consistency • 4.Comparison • 5.Proxy Accelerator Cache • 6.Throughput Improvements • 7.Impact of Hint Management • 8.Summary • 8.Conclusion

  3. 1.Accelerated Web Proxy • To speed up proxy caches by reducing their cache-miss overhead. • Extended content-based router called a proxy accelerator(PA). • With embedded O.S optimized for communication.

  4. Accelerated Web Proxy(cont.)

  5. Accelerated Web Proxy(cont.)

  6. 2.Hint Representation • Accurate–information directory scheme (Hash Table) • Approximate-information based on Bloom Filters --bitmap(hint space) PA(entries,hash table) WP(collision counter)

  7. Hint Representation(cont.) --independently & interleaved

  8. 3.Hint Consistency • Protocol ensure that the information at the PA site reflects the content of the WP • Protocol choices --entity that identifies the updates --protocol initiator --rate of update messages --exchanged information • Previously proposed --WP-only update --eager hint register

  9. 4.Comparison

  10. 5.Proxy Accelerator Cache • PA should maximize the hit ratio --size , GDS(1) • WP should minimize the Network-related costs

  11. 6.Throughput Improvements(PA improve WP throughput)

  12. Throughput Improvements(cont.)(PA cpu speed affect improvement)

  13. Throughput Improvements(cont.)(PA-level cache improve throughput)

  14. 7.Impact of Hint Management

  15. Impact of Hint Management(cont.)

  16. Impact of Hint Management(cont.)

  17. Impact of Hint Management(cont.)

  18. Impact of Hint Management(cont.)

  19. 8.Summary • Bloom Filter-based scheme exhibits lower computation and communication overhead • WP meta-data may reduce its memory hit ratio • Hint look-up overheads are small with respect to the typical request processing overhead • Eagar hint registration reduces update-related overheads and prevents hit ratio reductions caused by update delay • False hit ratio is more significantly affected by hint representation than by update period

  20. 9.Conclusion • This miss ratios at proxy caches are often relatively high,we have developed a method to improve the performance of a cluster-based Web proxy by shifting some of its cache miss-related functionality to be executed on a proxy accelerator • Eagar registration is a “must” and that the Bloom Filter-based scheme is more appropriate than the directory scheme for large WP clusters or when PA and WP nodes have comparable power

More Related