Skip to main content
Springer Nature Link
Log in

Server-Side Caching Strategies for Online Auction Sites

  • Conference paper
Web Information Systems Engineering – WISE 2005 (WISE 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3806))

Included in the following conference series:

  • 1237 Accesses

Abstract

Online auction sites have very specific workloads and user behavior characteristics. Previous studies on workload characterization conducted by the authors showed that i) bidding activity on auctions increases considerably after 90% of an auction’s life time has elapsed, ii) a very large percentage of auctions have a relatively low number of bids and bidders and a very small percentage of auctions have a high number of bids and bidders, iii) prices rise very fast after an auction has lasted more than 90% of its life time. Thus, if bidders are not able to successfully bid at the very last moments of an auction because of site overload, the final price may not be as high as it could be and sellers, and consequently the auction site, may lose revenue. In this paper, we propose server-side caching strategies in which cache placement and replacement policies are based on auction-related parameters such as number of bids placed or percent remaining time till closing time. A main-memory auction cache at the application server can be used to reduce accesses to the back-end database server. Trace-based simulations were used to evaluate these caching strategies in terms of cache hit ratio and cache efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Akula, V., Menascé, D.A.: An analysis of bidding activity in online auctions. In: Bauknecht, K., Bichler, M., Pröll, B. (eds.) EC-Web 2004. LNCS, vol. 3182, pp. 206–217. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Bapna, R., Goes, P., Gupta, A.: Online auctions: insights and analysis. Comm. ACM. 44(11), 42–50 (2001)

    Article  Google Scholar 

  3. Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web Caching and Zipf-like Distributions: Evidence and Implications. In: INFOCOM (1), pp. 126–134 (1999)

    Google Scholar 

  4. Coffman Jr., E.G., Denning, P.J.: Operating Systems Theory. Prentice Hall, Upper Saddle River (1973)

    Google Scholar 

  5. Davison, B.D.: The Design and Evaluation of Web Prefetching and Caching Techniques PhD Dissertation, Rutgers University (October 2002), http://citeseer.ist.psu.edu/davison02design.html

  6. Douglis, F., Davison, B.D. (eds.): Web Content Caching and Distribution Proc. 8th International Workshop. Kluwer, Dordrecht (2004)

    Google Scholar 

  7. hardwarezone.com: 10,000 Ebay Enthusiasts to Gather For 10TH Anniversary Celebration, May 26 (2005), http://www.hardwarezone.com/news/view.php?id=1576&cid=5

  8. Kleinrock, L.: Queuing Systems: Theory, vol. I. John Wiley & Sons, Chichester (1975)

    Google Scholar 

  9. Lee, D., Choi, J., Kim, J., Noh, S., Min, S.L., Cho, Y., Kim, C.: LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies. IEEE Trans. Computers 50(12), 1352–1361 (2001)

    Article  MathSciNet  Google Scholar 

  10. Menascé, D.A., Akula, V.: Towards workload characterization of auction sites. In: Proc. IEEE 6th Annual Workshop on Workload Characterization (WWC-6), Austin, TX, October 27 (2003)

    Google Scholar 

  11. Menascé, D.A., Akula, V.: Improving the performance of online auction sites through closing time rescheduling. In: 1st Intl. Conf Quantitative Evaluation of SysTems (QEST 2004), Enschede, the Netherlands, September 27-30 (2004)

    Google Scholar 

  12. Menascé, D.A., Almeida, V.A., Fonseca, R., Mendes, M.: A methodology for workload characterization for e-commerce servers. In: ACM Conf. Electronic Commerce, Denver, CO, November 3-5, pp. 119–128 (1999)

    Google Scholar 

  13. Pierre, G.: A Web caching bibliography (June 2000), citeseer.ist.psu.edu/pierre00web.html

  14. Yagoub, K., Florescu, D., Issarny, V., Valduriez, P.: Caching Strategies for Data-Intensive Web Sites. The VLDB Journal, 188–199, citeseer.ist.psu.edu/yagoub00caching.html (2000)

  15. Yahoo!Japan: Monthly Disclosure - March-April 8 (2005), http://ir.yahoo.co.jp/en/monthly/200503.html

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, George Mason University, Fairfax, VA, 22030, USA

    Daniel A. Menascé

  2. School of Information Technology & Engineering, George Mason University, Fairfax, VA, 22030, USA

    Vasudeva Akula

Authors
  1. Daniel A. Menascé
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vasudeva Akula
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Texas State University, San Marcos, TX,  

    Anne H. H. Ngu

  2. Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, 153-8505, Tokyo, Japan

    Masaru Kitsuregawa

  3. University of Vienna, Vienna, Austria

    Erich J. Neuhold

  4. IBM Research Division, Thomas J. Watson Research Center, P.O. Box 218, 10598, New York, Yorktown Heights, USA

    Jen-Yao Chung

  5. School of Computer Science and Engineering, University of New South Wales, NSW 2052, Sydney, Australia

    Quan Z. Sheng

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Menascé, D.A., Akula, V. (2005). Server-Side Caching Strategies for Online Auction Sites. In: Ngu, A.H.H., Kitsuregawa, M., Neuhold, E.J., Chung, JY., Sheng, Q.Z. (eds) Web Information Systems Engineering – WISE 2005. WISE 2005. Lecture Notes in Computer Science, vol 3806. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11581062_18

Download citation

  • DOI: https://doi.org/10.1007/11581062_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30017-5

  • Online ISBN: 978-3-540-32286-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics