The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Mar. 10, 2015
Filed:
Apr. 03, 2012
Todd R. Manion, Bellevue, WA (US);
Kevin C. Ransom, Duvall, WA (US);
Jeremy L. Dewey, Redmond, WA (US);
Scott A. Senkeresty, Duvall, WA (US);
Travis C. Luke, Woodinville, WA (US);
Upshur W. Parks, Bothell, WA (US);
Brian R. Lieuallen, Redmond, WA (US);
Pritam DE, Redmond, WA (US);
Pallavi Choudhury, Redmond, WA (US);
Todd R. Manion, Bellevue, WA (US);
Kevin C. Ransom, Duvall, WA (US);
Jeremy L. Dewey, Redmond, WA (US);
Scott A. Senkeresty, Duvall, WA (US);
Travis C. Luke, Woodinville, WA (US);
Upshur W. Parks, Bothell, WA (US);
Brian R. Lieuallen, Redmond, WA (US);
Pritam De, Redmond, WA (US);
Pallavi Choudhury, Redmond, WA (US);
Microsoft Corporation, Redmond, WA (US);
Abstract
Application programming interface (API) for starting and accessing distributed routing table (DRT) functionality. The API facilitates bootstrapping into the DRT by one or more devices of a group of devices (a mesh) seeking to collaborate over a serverless connection, establishing a node of the DRT, where each node is an instance of an application that is participating in the mesh, and node participation by allowing the application to search for keys published by other nodes in the mesh, or by becoming part of the mesh by publishing a key. The API facilitates optimization of the routing table for quickly finding a root of a specific key in the mesh by finding the key directly in a cache or by asking a root node of the key that is in the local routing table that is closest numerically to the key being searched.