|
Publication
|
Research Title |
A Novel Web Caching Scheme using Hybrid Least Frequently Used and Support Vector Machine
|
Date of Distribution |
15 July 2016 |
Conference |
Title of the Conference |
2016 The 13'th International Joint Conference on Computer Science and Software Engineering |
Organiser |
Department of Computer Science, Faculty of Science, Khon Kaen University |
Conference Place |
Pullman Khon Kaen Raja Orchid |
Province/State |
Khon Kaen |
Conference Date |
13 July 2016 |
To |
15 July 2016 |
Proceeding Paper |
Volume |
2016 |
Issue |
1 |
Page |
11 |
Editors/edition/publisher |
|
Abstract |
The gargantuan uses of web access in various types of
applications, such as text, image, audio, and video, across the globe
have caused the limitation for service providers to optimally make
use of Internet infrastructure. The advance of web proxy/caching
has recently been in place to mitigate this phenomenon using the
concept of locality and proximity. There exist some traditional
caching schemes, such as FIFO, LFU, LRU, and Size, but with key
limitations on the precision. On the other hands, soft computing
has recently been investigated due to its advantage of high
precision. Thus, this paper proposes a novel caching method by
integrating these twos. SVM was first used for classification, to
divide the caching probability - to be replaced or else. Then, LFU
was applied for the actual replacement given new web objects (if
cache full); and these are Hybrid LFU-SVM. Its performance is
practically confirmed from our intensive evaluation against SVMLRU
and its traditional schemes like LFU and LRU in order of
14% to 52.3% and 18% to 63.2%, for hit and byte hit rate,
respectively, using a standard NLANR dataset. |
Author |
|
Peer Review Status |
มีผู้ประเมินอิสระ |
Level of Conference |
นานาชาติ |
Type of Proceeding |
Full paper |
Type of Presentation |
Oral |
Part of thesis |
true |
Presentation awarding |
false |
Attach file |
|
Citation |
0
|
|
|
|
|
|
|