Abstract: Integrating cache techniques and active networks, this paper provide a novel distributed and self-organizing wide-area network caches with limited radius. Theconcept of neighbor cache tree and its algorithm is proposed. The max. and themin. storage cost is also analyzed, with the study on the relationship between the partition of memory and the round trip delay, it is proved that there is an optimal cache partitioning point, an average method to find it is discussed in detail.

Key words: active networks, cache, self-organize, wide-area network