Ad-hoc proxy for discovery and retrieval of dynamic data such as a list of active devices

• US 20070250590A1
• Filed: 04/21/2006
• Published: 10/25/2007
• Est. Priority Date: 04/21/2006
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Singhal, Sandeep, Flannery, Eliot, Parks, Upshur, Sanders, Henry, Manion, Todd
• Application Number:
  US11/409,100
• Publication Number:
  US 20070250590A1
• Time in Patent Office: Days
• US Class Current: 709/217
• CPC Class Codes: H04L 12/66 Arrangements for connecting between networks having differing types of switching systems, e.g. gateways

Abstract

The claimed method and system describes a dynamic construction of a virtual proxy using a set of virtual proxy hosts. The virtual proxy hosts may maintain a shared data store that contains a record of discovered services on a network. The virtual proxy hosts may work together to respond to discovery requests using the shared data store. Clients on a network having a virtual proxy host may be limited to unicast discovery requests with the virtual proxy host, thereby reducing broadcast traffic.

Claims

1. A method of providing a discovery proxy service for a network of devices comprising:

creating a sharable data store, wherein the sharable data store contains a record of discovered services;

associating the sharable data store with a first host;

responding to a client probe at the first host with a first probe match indicating that the first host is a discovery proxy; and

resolving a resolution request at the first host based on the sharable data store.

2. The method of claim 1, further comprising periodically determining whether a WS-Discovery proxy is available and foregoing responding to a client probe and resolving a resolution request by the first host when a WS-Discovery proxy is available.

3. The method of claim 1, further comprising receiving at the first host a second probe match from a second host associated with the sharable data store and responding to a client probe at the first host with a first probe match after a delay period from receiving the second probe match.

4. The method of claim 1, further comprising receiving at the first host a second probe match from a second host associated with the sharable data store and foregoing responding to a client probe at the first host with a first probe match upon receiving the second probe match.

5. The method of claim 1, further comprising determining by a second host whether the first host is associated with a sharable data store and associating a second host with the sharable data store if the first host is associated with the sharable data store.

6. The method of claim 5, wherein determining whether the first host is associated with a sharable data store comprises interrogating the first host by the second host upon receiving one of a hello message and a probe match from the first host.

7. The method of claim 5, wherein determining whether the first host is associated with a sharable data store comprises checking a probe match for an indication that the first host is associated with a sharable data store.

8. The method of claim 5, wherein determining whether the first host is associated with a sharable data store comprises initiating a peer name resolution protocol resolve process by the second host on the first host.

9. The method of claim 5, wherein responding to a client probe and resolving a resolution request is performed via a discovery protocol and creating a sharable data store and associating one of the first and second host with the sharable data store is performed via a second protocol different from the discovery protocol.

10. The method of claim 5, further comprising designating one of the first and second host entities to respond to a client probe with a probe match.

11. The method of claim 5, wherein the sharable data store is one of a distributed data store and a replicated data store.

12. The method of claim 11, further comprising designating one of the first and second host entities to resolve a resolution request based on a distribution of the data store.

13. A computer-readable medium having computer-executable instructions for performing operations comprising:

determining whether a first host is associated with a sharable data store and. associating a second host with the sharable data store if the first host is associated with a sharable data store, wherein the sharable data store contains a record of discovered services;

designating one of the first and second host to respond to one of a probe and resolve request; and

determining, periodically, whether a WS-Discovery proxy is available and foregoing responding to one of the probe and resolve requests by the first and second host when a WS-Discovery proxy is available.

14. The computer-readable medium of claim 13, wherein the sharable data store is a distributed hash table and designating one of the first and second host to respond to one of a probe and resolve request is based on a hash of the record of discovered services.

15. The computer-readable medium of claim 13, wherein the distributed hash table is operated via a peer-to-peer network.

16. A system comprising:

a network of devices communicating over a discovery protocol;

a client device that broadcasts one of a probe and resolve message to the network;

a sharable data store containing a record of discovered services on the network;

a first host device that stores a portion of the sharable data store and a second host device that stores a second portion of the sharable data store, and wherein one of the first host and second host responds to one of the probe and resolve messages via the discovery protocol.

17. The system of claim 16, further comprising a third host that is a WS-Discovery proxy and wherein the first host ceases to service client probes and resolution requests upon determining that the third host is a WS-Discovery proxy.

18. The system of claim 16, wherein the first host communicates with the second host via a second protocol separate from the discovery protocol to coordinate responses to probe and resolve messages.

19. The system of claim 16, wherein the first and second portions are determined by a hash function.

20. The system of claim 19, wherein one of the first host and second host responds to one of the probe and resolve messages based on the hash function.