USE OF A PREFIX HASH TABLE (PHT) FOR LOCATING SERVICES WITHIN A PEER-TO-PEER COMMUNICATION NETWORK
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
Dec 11, 2008
app pub date -
Jun 5, 2008
filing date -
Jun 8, 2007
priority date (Note) -
Abandoned
status (Latency Note)
Importance
Abstract
A communication network (NET) including a distributed hash table (DHT) whose nodes (X.sub.1, X.sub.2, X.sub.3 . . . X.sub.N) provide services that may be accessed by network elements (T), and which has: means for receiving a service location request (R) containing at least one service identifier (ID), and search means for searching the hash table for at least one piece of location information. The invention is characterized in that the hash table is organized so that the location information is associated with keys which contain at least one service identifier and which correspond to leaves on a PHT binary tree whose node labels are distributed within the hash table; and in that the search means are adapted to search for location information in all or some of the leaves whose label prefixes the service identifier contained within the service request.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully