Rendezvousing resource requests with corresponding resources
US8014321B2 · kind B2 · utility
13Cited by
46References
34Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Sep 7, 2005 |
| Grant date | Sep 6, 2011 |
| Priority date | — |
| Expiry date | Nov 20, 2029 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/54
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
The present invention extends to methods, systems, and computer program products for rendezvousing resource requests with corresponding resources. Doubly linked sorted lists are traversed using modulo arithmetic in both directions. Sorted lists can be partitioned based on a multiple proximity metrics. Node routing tables provide a logarithmic index to nodes within the ID space of the federation infrastructure to facilitate more efficient routing. Messages can be routed to nodes within a ring and proximally routed to nodes in other partitioned rings.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.