Paper
4 January 2002 Greedy heuristic placement algorithms in distributed cooperative proxy system
Changjie Guo, Zhe Xiang, Zhun Zhong, Yuzhuo Zhong
Author Affiliations +
Proceedings Volume 4671, Visual Communications and Image Processing 2002; (2002) https://doi.org/10.1117/12.453064
Event: Electronic Imaging, 2002, San Jose, California, United States
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.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Changjie Guo, Zhe Xiang, Zhun Zhong, and Yuzhuo Zhong "Greedy heuristic placement algorithms in distributed cooperative proxy system", Proc. SPIE 4671, Visual Communications and Image Processing 2002, (4 January 2002); https://doi.org/10.1117/12.453064
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Distributed computing

Computer simulations

Algorithms

Internet

Mathematical modeling

Mathematics

Digital libraries

Back to Top