You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format. However, this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the Department of Computer Science of the University of Maryland at College Park under terms that include this permission. All other rights are reserved by the author(s).
Data Dissemination on the Web: Speculative and Unobtrusive. Vincenzo Liberatore. Brian D. Davison. May 1999.
The Web rapid growth results in heavier loads on servers/network and in increased latency experienced while retrieving Web documents. Internet traffic is further complicated by its burtiness, which complicates the design and allocation of network components. Bursty traffic alternates peak periods with lulls. The paper presents a framework that exploits idle periods in data traffic to satisfy future HTTP requests speculatively, opportunistically, and unobtrusively. Our proposal differs from previous schemes in that it is server-initiated and it is explicitly aware of current traffic loads (unobtrusive). This paper highlights several design trade-offs and details two issues: (1) server arbitration among several candidate documents, and (2) client/proxy caching. We present a theoretical analysis of arbitration, and we propose an integrated caching strategy for both requested and disseminated documents. Our approach is validated by extensive simulation on server logs, and substantial performance improvements are observed over pure on-demand strategies. (Also cross-referenced as UMIACS-TR-99-23) University of Maryland Institute for Advanced Computer Studies, Department of Computer Science, University of Maryland,
Last Generated Fri Aug 11 04:01:01 EDT 2000