Estimating and eliminating redundant data transfers over the Web: a fragment based approach

被引:3
作者
Bouras, C [1 ]
Konidaris, A
机构
[1] Univ Patras, Dept Comp Engn & Informat, GR-26500 Patras, Greece
[2] CTI, GR-26221 Patras, Greece
关键词
Web components; Web cash and proxy; redundant data transfers; performance; Web fragment;
D O I
10.1002/dac.692
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 [电气工程]; 0809 [电子科学与技术];
摘要
Redundant data transfers over the Web, can be mainly attributed to the repeated transfers of unchanged data. Web caches and Web proxies are some of the solutions that have been proposed, to deal with the issue of redundant data transfers. In this paper we focus on the efficient estimation and reduction of redundant data transfers over the Web. We first prove that a vast amount of redundant data is transferred in Web pages that are considered to carry fresh data. We show this by following an approach based on Web page fragmentation and manipulation. Web pages are broken down to fragments, based on specific criteria. We then deal with these fragments as independent constructors of the Web page and study their change patterns independently and in the context of the whole Web page. After the fragmentation process, we propose solutions for dealing with redundant data transfers. This paper has been based on our previous work on 'Web Components' but also on related work by other researchers. It utilises a proxy based, client/server architecture, and imposes changes to the algorithms executed on the Proxy server and on clients. We show that our proposed solution can considerably reduce the amount of redundant data transferred on the Web. Copyright (C) 2004 John Wiley Sons, Ltd.
引用
收藏
页码:119 / 142
页数:24
相关论文
共 19 条
[1]
ARLITT M, HPL9897R1 HP
[2]
BOURAS C, 2001, 2 INT C INT COMP IC2
[3]
BOURAS C, 2001, 8 INT C DAT THEOR LO, P1
[4]
Keeping up with the changing Web [J].
Brewington, BE ;
Cybenko, G .
COMPUTER, 2000, 33 (05) :52-+
[5]
BREWINGTON BE, 2000, P 9 WORLD WID WEB C
[6]
CHALLENGER J, 1999, P IEEE INFOCOM 99 NE
[7]
CHALLENGER J, WEB ENG
[8]
CHALLENGER J, 2000, INFOCOM 2000
[9]
CHO J, 20010922 STANF DAT G
[10]
CHO J, 2000, P 2000 ACM SIGMOD IN