Share Email Print

Proceedings Paper

Greedy heuristic placement algorithms in distributed cooperative proxy system
Author(s): Changjie Guo; Zhe Xiang; Zhun Zhong; Yuzhuo Zhong
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 4 January 2002
PDF: 9 pages
Proc. SPIE 4671, Visual Communications and Image Processing 2002, (4 January 2002); doi: 10.1117/12.453064
Show Author Affiliations
Changjie Guo, Tsinghua Univ. (China)
Zhe Xiang, Tsinghua Univ. (China)
Zhun Zhong, Philips Research USA (United States)
Yuzhuo Zhong, Tsinghua Univ. (China)

Published in SPIE Proceedings Vol. 4671:
Visual Communications and Image Processing 2002
C.-C. Jay Kuo, Editor(s)

© SPIE. Terms of Use
Back to Top