Greedy heuristic placement algorithms in distributed cooperative proxy system

被引：0

作者：

Guo, CJ ^{[1
]}

Xiang, Z ^{[1
]}

Zhun, Z ^{[1
]}

Zhong, YZ ^{[1
]}

机构：

[1] Tsinghua Univ, Dept Comp, Inst Media, Beijing 100084, Peoples R China

来源：

VISUAL COMMUNICATIONS AND IMAGE PROCESSING 2002, PTS 1 AND 2 | 2002年 / 4671卷

关键词：

distributed cooperative proxies; near-optimal; heuristic algorithm; placement;

D O I：

10.1117/12.453064

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In this paper, we investigate the object placement problem in distributed cooperative proxy systems and build a mathematics model. We prove that the problem is a NP-Hard problem and two novel greedy heuristic placement algorithms MWLC and MWGB are proposed to get the near-optimal answer in a polynomial complexity. We perform simulation and the results reported in this paper show that these two algorithms could achieve better performance than the traditional MFU algorithm (about 13.05% and 14.13% respectively). By the analysis of the experiment results, we find that the two algorithms can efficiently reduce the average request cost and balance the load of proxies. In general, the technologies proposed in this paper could be used to develop effective distributed cooperative proxy systems such as CDSP and digital library and so on.

引用

页码：251 / 259

页数：9

共 15 条

[1] *AK CORP, 2000, SEL CONT DEL SERV ST
[2] FAN L, 1998, P ACM SIGCOMM, P254
[3] GADDE S, 1997, P WORKSH HOT TOP OP
[4] GIBSON GA, 1996, ACM WORKSH STRAT DIR
[5] *INKT CORP, 1999, STREAM MED CACH WHIT
[6] KANGASHARJU J, 2001, INFOCOM 2001 P, V3, P1791
[7] KORUPOLU MR, 1999, IEEE WORKSH INT APPL, P62
[8] KORUPOLU MR, 1999, P 10 ANN ACM SIAM S
[9] Utility of co-operating Web proxy caches
Krishnan, P
Sugla, B
[J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7): : 195 - 203
[10] MEDINA A, 2001, BRITE BOSTON U REPRE

← 1 2 →