Iterative key based routing for web services addressing and discovery

As the nodes and the resources in a structured peer-to-peer network are indexed with unique identifiers, and as the identifiers are assigned to nodes whose nodeld (i.e., the identifier of the peer) is closest (by some metrics) to the identifier, at an application level it is an issue to know the unique identifier a resource is indexed with, to route a message to the node that is responsible for the identifier and thus to retrieve the resource itself. We are studying a way to exploit the features of structured peer-to-peer networks in web services addressing and discovery.