Sulaiman, Sarina and Shamsuddin, Siti Mariyam and Abraham, Ajith (2009) Rough web caching. Studies in Computational Intelligence, 174 . pp. 187-211. ISSN 1860-949X (Print) 1860-9503 (Online)
PDF
Restricted to Repository staff only 581kB |
Official URL: http://dx.doi.org/10.1007/978-3-540-89921-1_7
Abstract
The demand for Internet content rose dramatically in recent years. Servers became more and more powerful and the bandwidth of end user connections and backbones grew constantly during the last decade. Nevertheless users often experience poor performance when they access web sites or download files. Reasons for such problems are often performance problems, which occur directly on the servers (e.g. poor performance of server-side applications or during flash crowds) and problems concerning the network infrastructure (e.g. long geographical distances, network overloads, etc.). Web caching and prefetching have been recognized as the effective schemes to alleviate the service bottleneck and to minimize the user access latency and reduce the network traffic. In this chapter, we model the uncertainty in Web caching using the granularity of rough set (RS) and inductive learning. The proposed framework is illustrated using the trace-based experiments from Boston University Web trace data set.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | we caching, rough set (RS), inductive learning, network traffic |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Divisions: | Computer Science and Information System |
ID Code: | 7763 |
Deposited By: | Maznira Sylvia Azra Mansor |
Deposited On: | 21 Jan 2009 01:20 |
Last Modified: | 02 Jun 2010 01:47 |
Repository Staff Only: item control page