Efficient cooperative caching using hints
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
A methodology for workload characterization of E-commerce sites
Proceedings of the 1st ACM conference on Electronic commerce
Insights and analyses of online auctions
Communications of the ACM
Web caching and replication
Operating Systems Theory
IEEE Transactions on Computers
The design and evaluation of web prefetching and caching techniques
The design and evaluation of web prefetching and caching techniques
Performance by Design: Computer Capacity Planning By Example
Performance by Design: Computer Capacity Planning By Example
Improving the Performance of Online Auction Sites through Closing Time Rescheduling
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Web content caching and distribution: proceedings of the 8th international workshop
Web content caching and distribution: proceedings of the 8th international workshop
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Two-level workload characterization of online auctions
Electronic Commerce Research and Applications
Performance comparison of middleware architectures for generating dynamic web content
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
A new cache document replacement policy considering the contribution to sales
Electronic Commerce Research and Applications
| Hi-index | 0.00 |
Online auction sites have very specific workloads and user behavior characteristics. Previous studies on workload characterization conducted by the authors showed that (1) bidding activity on auctions increases considerably after 90% of an auction's life time has elapsed, (2) 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, (3) 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. The performance characteristics of the best policies were then evaluated through experiments conducted on a benchmark online auction system.