Abstract: Because of good expansibility, P2P overlay network suits to Internet that is expanding fast. Service discovery is its fundamental question. This paper presents a new distributed service lookup based on segment. On the basis of distributed routing structure based on segment designed in earlier stage, it presents the corresponding deployment and lookup strategy for service keys. The feature of this paper is that given a key,the lookup algorithm can find the overlay node on which the key is deployed in a limited hops. Furthermore, the maximal lookup hops have no relationship with the size of the P2P overlay network

Key words: Service discovery; P2P overlay; Segment routing; Key deployment

摘要： P2P 网络由于其良好的可扩展性非常适合于规模日渐扩大的互联网，服务查找成为它的基本问题。该文提出一种基于分段的分布式的服务查找方法，主要特点是给定了一个关键字，可以在有限的跳数范围内，找到部署有这个关键字的overlay 节点，得到查询结果，并且最大的查找跳数与网络大小无关。

关键词: 服务发现；P2P overlay；分段路由；关键字部署