Systems and methods for providing presence tracking in a distributed computing system

• US 7,257,644 B2
• Filed: 09/19/2002
• Issued: 08/14/2007
• Est. Priority Date: 09/19/2002
• Status: Expired due to Fees

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Pyle, Harry S., Simonnet, Guillaume
• Primary Examiner(s): Dharia; Rupal
• Assistant Examiner(s): Ford; Grant M.
• Application Number:
  US10/251,370
• Publication Number:
  US 20040059963A1
• Time in Patent Office: 1,790 Days
• Field of Search: 709/204, 709/238, 340/825, 710/38
• US Class Current: 709/238
• CPC Class Codes: H04B 2203/5408 using protocols
• CPC Class Codes: H04B 2203/5445 Local network
• CPC Class Codes: H04B 3/542 the information being in digital form

Abstract

Providing presence tracking of nodes of a logical network in a distributed computing system. Each node in a logical network tracks the presence of all other nodes on the network. This presence information is used by the protocol to optimize bandwidth utilization of the shared physical media, by not attempting to communicate with a device that does not appear to be or is unlikely to be present. In one embodiment, the presence tracking is applied to a power line carrier (PLC) physical media because of PLC'"'"'s low-bandwidth characteristics, low baud rate characteristics and the widespread usage of plugged-in devices, the presence of which on the network is generally more transient by nature.

Claims

1. A method for providing presence tracking of nodes of a logical network having an underlying physical network medium in a distributed computing system, comprising:

tracking by each node in the logical network the presence state of at least one other node; and

optimizing bandwidth utilization of the physical network medium based upon the presence state of at least one node in the logical network,

wherein each part is assigned different values for sending and sampling keep alive messages, wherein the logical network has a node identification (node ID) address space for identifying each node and its associated values for sending and sampling keep alive messages,

wherein a first group of node IDs are assigned to fast presence devices, while a second group of node IDs part are assigned to slow presence devices,

wherein the node ID address space is split into two parts, and

wherein said optimizing includes optimizing at least five application variables including (A) a PresenceSlowBaseld variable that designates the node ID where the logical split between fast presence devices and slow presence devices occurs;

(B) a PresenceFastRefresh variable that designates the PresenceRefresh value to be used to track devices with a node ID less than the value specified by the PresenceSlowBaseld variable, (C) a PresenceFastTimeout variable that designates the PresenceTimeout value to be used to track devices with a node ID less than the value specified by the PresenceSlowBaseld variable, (D) a PresenceSlowRefresh variable that designates the PresenceRefresh value to be used to track devices with a node ID that is at least the value specified by the PresenceSlowBaseld variable and (E) a PresenceSlowTimeout variable that designates the PresenceTimeout value to be used to track devices with a node ID that is at least the value specified by the PresenceSlowBaseld variable.

2. A method according to claim 1, further including:

modifying said at least five application variables asynchronously.

3. A method according to claim 2, wherein said tracking includes polling the value of the at least five application variables periodically.

4. A method according to claim 1, wherein said tracking includes sending a keep alive message if PresenceRefresh time has gone by since a last keep alive message was sent, wherein the PresenceRefresh time is one of PresenceFastRefresh and PresenceSlowRefresh.

5. A method according to claim 1, wherein said tracking includes declaring as absent any node in the was present state or presumed present state for which a keep alive message has not been received for PresenceTimeout time, wherein the PresenceTimeout time is one of PresenceFastTimeout and PresenceSlowTimeout and declaring as was present any node in the present state after PresenceTimeout time.

6. A method according to claim 1, wherein said at least five application variables at least one of (A) are set during a node acquisition step, (B) are set by default into one of a device and object and (C) are changed during optimization of the network dynamically.

7. A computer readable storage medium for automatically tuning a network having an associated protocol and a plurality of nodes forming a logical network having an underlying physical network medium having stored thereon at least one computer-executable module comprising computer executable instructions for performing a method, the method comprising:

tracking by each node in the logical network the presence state of at least one other node; and

optimizing bandwidth utilization of the physical network medium based upon the presence state of at least one node in the logical network,

wherein the logical network has a node identification (node ID) address space for identifying each node and its associated values for sending and sampling keep alive messages,

wherein the node ID address space is split into two parts, wherein each part is assigned different values for sending and sampling keen alive messages,

wherein a first group of node IDs are assigned to fast presence devices, while a second group of node IDs part are assigned to slow presence devices, and

wherein said optimizing includes optimizing at least five application variables including (A) a PresenceSlowBaseld variable that designates the node ID where the logical split between fast presence devices and slow presence devices occurs;

(B) a PresenceFastRefresh variable that designates the PresenceRefresh value to be used to track devices with a node ID less than the value specified by the PresenceSlowBaseld variable, (C) a PresenceFastTimeout variable that designates the PresenceTimeout value to be used to track devices with a node ID less than the value specified by the PresenceSlowBaseld variable;

(D) a PresenceSlowRefresh variable that designates the PresenceRefresh value to be used to track devices with a node ID that is at least the value specified by the PresenceSlowBaseld variable and (E) a PresenceSlowTimeout variable that designates the PresenceTimeout value to be used to track devices with a node ID that is at least the value specified by the PresenceSlowBaseld variable.

8. A computer readable storage medium according to claim 7, further including:

modifying said at least five application variables asynchronously.

9. A computer readable storage medium according to claim 8, wherein said tracking includes polling the value of the at least five application variables periodically.

10. A computer readable storage medium according to claim 7, wherein said tracking includes sending a keep alive message if PresenceRefresh time has gone by since a last keep alive message was sent, wherein the PresenceRefresh time is one of PresenceFastRefresh and PresenceSlowRefresh.

11. A computer readable storage medium according to claim 7, wherein said tracking includes declaring as absent any node in the was present state or presumed present state for which a keep alive message has not been received for PresenceTimeout time, wherein the PresenceTimeout time is one of PresenceFastTimeout and PresenceSlowTimeout and declaring as was present any node in the present state after PresenceTimeout time.

12. A computer readable storage medium according to claim 7, wherein said at least five application variables at least one of (A) are set during a node acquisition step, (B) are burned by default into one of a device and object and (C) are changed during optimization of the network dynamically.

13. A distributed computing system capable of automatically tuning a logical network having an associated protocol and an underlying physical network medium, comprising:

a plurality of nodes, wherein each node in the logical network includes a presence tracking component that tracks the presence state of at least one other node; and

a tracking table including the presence state of the at least one other node;

wherein bandwidth utilization of the physical network medium is optimized based upon the presence state of the plurality of nodes in the logical network,

wherein the tracking table has a node identification (node ID) for identifying each node and its associated values for sending and sampling keep alive messages,

wherein the network is optimized according to network tuning parameters relating to how often a node sends and samples keep alive messages, and

wherein at least five application variables are optimized, the at least five variables including (A) a PresenceSlowBaseId variable that designates the node ID where the logical split between fast presence devices and slow presence devices occurs;

(B) a PresenceFastRefresh variable that designates the PresenceRefresh value to be used to track devices with a node ID less than the value specified by the PresenceSlowBaseld variable, (C) a PresenceFastTimeout variable that designates the PresenceTimeout value to be used to track devices with a node ID less than the value specified by the PresenceSlowBaseld variable, (D) a PresenceSlowRefresh variable that designates the PresenceRefresh value to be used to track devices with a node ID that is at least the value specified by the PresenceSlowBaseld variable and (E) a PresenceSlowTimeout variable that designates the PresenceTimeout value to be used to track devices with a node ID that is at least the value specified by the PresenceSlowBaseld variable.

14. A distributed computing system according to claim 13, wherein said at least five application variables are modified asynchronously.

15. A distributed computing system according to claim 14, wherein each node polls for the value of the at least five application variables periodically.

16. A distributed computing system according to claim 13, wherein each node sends a keep alive message if PresenceRefresh time has gone by since a last keep alive message was sent, wherein the PresenceRefresh time is one of PresenceFastRefresh and PresenceSlowRefresh.

17. A distributed computing system according to claim 13, wherein each node in the was present state or presumed present state for which a keep alive message has not been received for PresenceTimeout time, wherein the PresenceTimeout time is one of PresenceFastTimeout and PresenceSlowTimeout, is declared absent and each node in the present state is declared as was present after PresenceTimeout time.

18. A distributed computing system according to claim 13, wherein said at least five application variables at least one of (A) are set during a node acquisition step, (B) are burned by default into one of a device and object and (C) are changed during optimization of the network dynamically.