将Ｃａｃｈｅ 技术与主动网络技术结合， 提出了一种新颖的具有有限半径的分布自组织Ｃａｃｈｅ 系统．首次提出了相邻Ｃａｃｈｅ树的概念及其生成算法， 分析了相邻Ｃａｃｈｅ树增加的最大最小存储代价， 对内存分配和响应时延之间的关系进行了理论计算， 证明了内存分配的最佳平衡点的存在性， 并给出了一般的求解方法 Combining Cache technology and active network technology, a novel distributed self-organizing Cache system with limited radius is proposed. For the first time, the conception of neighbor cache tree and its generating algorithm are proposed. The maximum and minimum storage cost of adjacent cache tree is analyzed. The relationship between memory allocation and response delay is theoretically calculated, which proves that the best memory allocation The existence of the equilibrium point, and gives the general solution