Web caching with request reordering
SODA(2002)
摘要
Current web caching algorithms process requests in the order of the arrival. While such restriction is inevitable in system paging due to the sequential nature of a program, the HTTP requests are (essentially) independent at a high volume proxy server. This gives a proxy server the flexibility to reorder requests, provided no request is inordinately delayed. The expectation is that reordering requests may lead to better performance. We formulate an online k-reordering problem that captures such phenomenon for unit caches. We give a dynamic programming algorithm to solve the offline case. We give O(1) upper and lower bound on the competitive ratio of the online algorithms. We also generalize this problem to any metric space.
更多查看译文
关键词
current web,high volume proxy server,competitive ratio,online algorithm,metric space,algorithms process request,proxy server,online k-reordering problem,request reordering,better performance,dynamic programming algorithm,upper and lower bounds
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络