本文在分析ＡＴＭ网络自愈恢复搜索基础上，提出一种减少无用搜索消息范围的椭圆搜索算法。并对自愈恢复过程进行计算机模拟，结果表明：椭圆搜索比单向搜索和双向搜索的无用搜索消息范围小，影响的节点数少，范围大小可以合理设置。所花费的代价是：必须在每个节点中建立一个最小搜索范围表。 Based on the analysis of self-healing recovery search in ATM networks, this paper proposes an elliptic search algorithm to reduce the range of useless search messages. The computer simulation of the process of self-healing and recovery shows that the range of useless search messages of elliptic search is less than that of one-way search and two-way search, and the number of nodes affected is small and the range size can be set reasonably. The cost of doing this is that you have to create a minimum search scope table in each node.