USE OF A PREFIX HASHING TREE (PHT) FOR LOCATING SERVICE IN A STATION-TO-STATION COMMUNICATION NETWORK

摘要

The invention relates to a communication network (NET) including a distributed hashing table in which the nodes (X1, X2, X3... XN) provide services accessible for network members (T) and comprising: means for receiving a service location request (R) containing at least one service identifier (ID) and searching means for searching in the hashing table at least one piece of location information. The invention is characterised in that the hashing table is organised so that the location information is associated with keys containing at least one service identifier and corresponding with the leaves of a binary tree of the PHT type in which the node labels are distributed in the hashing table, and in that the search means are adapted for searching location information in a portion of or all the leaves whose label is the prefix of the service identifier contained in the service request.