# US 2004/0081201 A1 · Systems and methods for providing automatic network optimization with application variables

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0081201 A1
- Document ID: US20040081201A1
- Status: Published application
- Kind: A1
- Application number: 10/251,457
- Filed: 2002-09-19
- Published: 2004-04-29
- Earliest claimed: 2002-09-19
- Assignees: Microsoft Corporation
- Inventors: Guillaume Simonnet; Harry S. Pyle; Richard L. Hasha
- Web page: https://patentgrep.com/patent/US20040081201A1

## CPC

- H04L 9/40: Network security protocols
- H04L 12/2803: {Home automation networks}
- H04L 69/03: {Protocol definition or specification (protocol conformance testing H04L1/244)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Systems and methods for automatic network optimization with application variables are provided. Operation of a protocol stack, such as an SCP stack, relies upon a number of persistent variables, which are remembered over power and reset cycles, used in connection with controlling protocol timing and behavior. These application variables are handled at the network layer of the protocol and may be assigned values by an address space arbitrator, which is an entity responsible for managing the logical network. Each node member of a logical network maintains a set of values for its application variables. This set can be handled by the protocol's network layer, and can be saved in persisted storage. Since the variable values may be modified asynchronously, they are treated as volatile and thus, when a variable is used, its value is obtained through an application interface exposed by a network layer, e.g., through polling. An exception to this procedure is a data link layer, which obtains some operating parameters on every call by the network layer. Optimization of application variables enables reliable operation of a logical network operating under low bandwidth network conditions, etc.

## Claims

### Claim 1

A method for automatically tuning a network having an associated protocol and a plurality of nodes forming a logical network, comprising:
receiving at least one value of at least one application variable; and
based upon said at least one value, altering at least one of protocol timing and network behavior relating to at least one node of said plurality of nodes in said network.

### Claim 2 (depends on 1)

A method according to claim 1, wherein said at least one application variable includes at least one of (A) a variable corresponding to a data link layer of the protocol, (B) a variable corresponding to network time synchronization of the logical network, (C) a variable corresponding to a network layer of the protocol and (D) a variable corresponding to a transport layer of the protocol.

### Claim 3 (depends on 2)

A method according to claim 2, wherein a node of the network is in one of three time synchronization modes including a master mode, a subordinate mode and an unlocked mode, wherein the master mode uses a network time reference for other nodes, the subordinate mode locks onto a master node for a network time and the unlocked mode is not synchronized.

### Claim 4 (depends on 2)

A method according to claim 2, wherein a node synchronizes its network time to a time provided in any network time assert message received for its associated network.

### Claim 5 (depends on 2)

A method according to claim 2, wherein said at least one application variable includes at least one variable corresponding to network time synchronization in order to detect and ignore replay messages.

### Claim 6 (depends on 2)

A method according to claim 2, wherein a variable corresponding to network time synchronization includes at least one of a variable for (A) Poll Holdoff Delay, (B) Master Holdoff Delay, (C) Query Poll Time, (D) Master Declaration Wait, (E) Subordinate Declaration Wait, (F) Declaration Poll Time, (G) Master Response Wait and (H) Maximum Message Skew.

### Claim 7 (depends on 2)

A method according to claim 2, wherein a variable corresponding to the network layer includes at least one of a variable for (A) Slow Node Presence Base Id, (B) Fast Node Presence Refresh, (C) Fast Node Presence Timeout, (D) Slow Node Presence Refresh and (E) Slow Node Presence Timeout.

### Claim 8 (depends on 2)

A method according to claim 2, wherein a variable corresponding to the network layer includes at least one of a variable for (A) Message Assembly Timeout and (B) Network Control Protocol Transmit Holdoff Delay.

### Claim 9 (depends on 2)

A method according to claim 2, wherein a variable corresponding to the transport layer includes at least one of a variable for (A) Max Request Retry Count, (B) Reply Wait Timeout, (C) Max Reply Retry Count and (D) Reply Acknowledgment Wait Timeout.

### Claim 10 (depends on 2)

A method according to claim 2, wherein a variable corresponding to the transport layer determines at least one of (A) time out conditions after dropping a message and (B) how long to wait before re-sending at least one of a request, reply and reply acknowledgement.

### Claim 11 (depends on 2)

A method according to claim 2, wherein a variable corresponding to the data link layer determines at least one of (A) backoff timeout, (B) acknowledgment retry count and (C) broadcast burst count.

### Claim 12 (depends on 1)

A method according to claim 1, wherein said at least one application variable includes at least one of (A) a variable corresponding to a data link layer, (B) a variable corresponding to a network layer and (C) a variable corresponding to a transport layer.

### Claim 13 (depends on 12)

A method according to claim 12, wherein said at least one variable corresponding to a network layer includes at least one variable corresponding to (A) a variable corresponding to time and (B) a variable corresponding to presence.

### Claim 14 (depends on 1)

A method according to claim 1, wherein each node tracks the presence of all other nodes in the network by way of at least one variable corresponding to the network layer.

### Claim 15 (depends on 1)

A method according to claim 1, wherein said at least one application variable is persistently stored.

### Claim 16 (depends on 1)

A method according to claim 1, wherein the at least one application variable is handled at a network layer of the protocol.

### Claim 17 (depends on 1)

A method according to claim 1, further comprising:
assigning values by an Address Space Arbitrator (ASA), wherein the ASA is an entity responsible for managing the network.

### Claim 18 (depends on 17)

A method according to claim 17, further comprising handling the servicing of at least one application variable by a network control protocol handler, a component of a network layer, wherein said handling includes at least one of (A) handling by the network control protocol handler the persistence of a value of an application variable in storage, (B) providing by the network control protocol handler the value of a variable to a protocol layer other than the network layer through an application interface, (C) accepting by the network control protocol handler a new value of an application variable at the time a device is assigned to a logical network by an ASA, (D) accepting and acknowledging by the network control protocol handler a value of a new variable when instructed by the ASA and (E) providing a value of an application variable when asked by the ASA.

### Claim 19 (depends on 17)

A method according to claim 17, wherein the ASA updates the at least one application variable when a node is assigned to its logical network.

### Claim 20 (depends on 17)

A method according to claim 17, wherein the ASA broadcasts the at least one application variable to all nodes on the logical network through a Write message and each node acknowledges the message.

### Claim 21 (depends on 17)

A method according to claim 17, wherein the ASA unicasts Read and Write variable messages to verify and update a node.

### Claim 22 (depends on 1)

A method according to claim 1, wherein said altering is transparent to a layer other than a network layer of the protocol.

### Claim 23 (depends on 1)

A method according to claim 1, wherein said altering includes dynamically tuning and optimizing the protocol based upon a determination that a specific operating condition exists in the network.

### Claim 24 (depends on 23)

A method according to claim 23, wherein said specific operating condition includes at least one of (A) low bandwidth operation of the physical medium of the network, (B) potential noise (C) a dynamic determination that there is a weak transmitter node (D) a dynamic determination that there is a weak receptor node, (E) degraded signal quality on a communications path, (F) amount of activity on the network and (G) a specific combination of number and kinds of nodes.

### Claim 25 (depends on 24)

A method according to claim 24, wherein said at least one application variable includes at least one of (A) an adaptive back off parameter, (B) a timing window for network communications and (C) a threshold for a determination that there is at least one of said specific operating conditions.

### Claim 26 (depends on 1)

A method according to claim 1, wherein said altering includes cross-correlating with respect to the node segments of the network which node paths are of good quality and which node paths are of poor quality.

### Claim 27 (depends on 26)

A method according to claim 26, wherein said cross-correlating includes taking into account the rate of network traffic.

### Claim 28 (depends on 1)

A method according to claim 1, wherein each node member of the logical network maintains a set of at least one value for at least one application variable associated with the node member.

### Claim 29 (depends on 28)

A method according to claim 28, wherein the set of values is handled by a network layer of the protocol, and saved in persisted storage.

### Claim 30 (depends on 28)

A method according to claim 28, wherein the at least one value of the application variables is one of (A) specific to the physical network, (B) specific to the logical network and (C) specific to a node on the logical network.

### Claim 31 (depends on 1)

A method according to claim 1, wherein the at least one value is modified asynchronously.

### Claim 32 (depends on 1)

A method according to claim 1, wherein said receiving the at least one value includes receiving said at least one value through an application interface exposed by a network layer of the protocol.

### Claim 33 (depends on 32)

A method according to claim 32, wherein with respect to a data link layer of said protocol, said receiving includes receiving at least one value of an application variable on every call to the application interface.

### Claim 34 (depends on 1)

A method according to claim 1, wherein the protocol is one of SCP, x10 and CEBus®.

### Claim 35 (depends on 1)

A method according to claim 1, wherein a physical network underlying the logical network is one of a power line carrier network, a radio frequency network and an infrared transmission network.

### Claim 36 (depends on 1)

A method according to claim 1, wherein when application variables are altered, further comprising ensuring that the values are consistent across all nodes in the network.

### Claim 37 (depends on 1)

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

### Claim 38 (depends on 37)

A method according to claim 37, wherein when said at least one application variable is set by default into a one of a device and object, a subset of said at least one application variable is left blank.

### Claim 39 (depends on 1)

A method according to claim 1, wherein the at least one application variable comprises a variable length table maintained by the network layer.

### Claim 40 (depends on 1)

A method according to claim 1, wherein the at least one application variable is at least one of (A) logical network specific, (B) specific to a particular physical network underlying the logical network and (C) node specific.

### Claim 41 (depends on 1)

A method according to claim 1, wherein said at least one application variable is at least one protocol variable.

### Claim 42 (depends on 41)

A method according to claim 41, further comprising receiving a network control protocol read variables request message requesting reading of at least one protocol variable.

### Claim 43 (depends on 42)

A method according to claim 42, wherein fields of the network control protocol read variables request message include at least one of (A) Network time, (B) Protocol variables requested, (C) Node ID of target device, (D) Request counter, and (E) Message authentication code.

### Claim 44 (depends on 42)

A method according to claim 42, further comprising receiving a network control protocol read variables response message responding to a network control protocol read variables request message.

### Claim 45 (depends on 44)

A method according to claim 44, wherein fields of the network control protocol read variables response message include at least one of (A) Network time, (B) Protocol variables requested, (C) Node ID of replying device, (D) Request counter, (E) Protocol variables values stream, and (F) Message authentication code.

### Claim 46 (depends on 41)

A method according to claim 41, further comprising receiving a network control protocol write variables request message requesting writing of at least one protocol variable.

### Claim 47 (depends on 46)

A method according to claim 46, wherein fields of the network control protocol write variables request message include at least one of (A) Network time, (B) Protocol variables requested, (C) Node ID of target device, (D) Request counter, (E) Protocol variables values stream and (F) Message authentication code.

### Claim 48 (depends on 46)

A method according to claim 46, further comprising receiving a network control protocol write variables response message responding to a network control protocol write variables request message.

### Claim 49 (depends on 48)

A method according to claim 48, wherein fields of the network control protocol write variables response message include at least one of (A) Network time, (B) Protocol variables requested, (C) Node ID of replying device, (D) Request counter and (E) Message authentication code.

### Claim 50 (depends on 41)

A method according to claim 41, further comprising receiving a broadcast request message, whereby in response, replying nodes back off their reply up to a delay amount, defined by a delay application variable.

### Claim 51 (depends on 41)

A method according to claim 41, wherein said at least one protocol variable is used with at least one default value including a network time poll holdoff delay, a network time master holdoff delay, a network time query poll time, a network time master declaration wait, a network time subordinate declaration wait, a network time declaration poll time, a network time master response wait and a network time maximum message skew.

### Claim 52 (depends on 1)

A method according to claim 1, wherein said altering includes ignoring a message if there is a threshold difference in time between a send time for the message and a receive time for the message.

### Claim 53 (depends on 1)

A method according to claim 1, further comprising assigning a network time by a time master to a message, wherein the network time is a unique number that is reset frequently to prevent replay attack.

### Claim 54 (depends on 1)

A method according to claim 1, wherein based on windowing, spoofing is protected against by jamming an imposter message.

### Claim 55 (depends on 1)

A method according to claim 1, further comprising tracking the presence of all other nodes on the network in accordance with said at least one application variable.

### Claim 56 (depends on 1)

At least one of an operating system, driver code, an application programming interface, a tool kit and a processing device for providing the automatic tuning of claim 1.

### Claim 57 (depends on 1)

A modulated data signal carrying computer executable instructions for performing the method of claim 1.

### Claim 58 (depends on 1)

A computing device comprising means for performing the method of claim 1.

### Claim 59

A computer readable medium for automatically tuning a network having an associated protocol and a plurality of nodes forming a logical network having stored thereon at least one computer-executable module comprising computer executable instructions for performing a method, the method comprising:
receiving at least one value of at least one application variable; and
based upon said at least one value, altering at least one of protocol timing and network behavior relating to at least one node of said plurality of nodes in said network.

### Claim 60 (depends on 59)

A computer readable medium according to claim 59, wherein said at least one application variable includes at least one of (A) a variable corresponding to a data link layer, (B) a variable corresponding to a network layer and (C) a variable corresponding to a transport layer.

### Claim 61 (depends on 60)

A computer readable medium according to claim 60, wherein said at least one variable corresponding to the network layer includes at least one of (A) a variable corresponding to time and (B) a variable corresponding to presence.

### Claim 62 (depends on 60)

A computer readable medium according to claim 60, wherein a variable corresponding to the transport layer determines at least one of (A) time out conditions for dropping a message and (B) how long to wait before re-sending at least one of a request, reply and reply acknowledgement.

### Claim 63 (depends on 60)

A computer readable medium according to claim 60, wherein a variable corresponding to the data link layer determines at least one of (A) backoff timeout, (B) acknowledgment retry count and (C) broadcast burst count.

### Claim 64 (depends on 60)

A computer readable medium according to claim 60, wherein each node tracks the presence of all other nodes in the logical network by way of at least one variable corresponding to the network layer.

### Claim 65 (depends on 59)

A computer readable medium according to claim 59, wherein said at least one application variable is persistently stored.

### Claim 66 (depends on 59)

A computer readable medium according to claim 59, wherein the at least one application variable is handled at a network layer of the protocol.

### Claim 67 (depends on 59)

A computer readable medium according to claim 59, further comprising:
assigning values by an Address Space Arbitrator (ASA), wherein the ASA is an entity responsible for managing the network.

### Claim 68 (depends on 67)

A computer readable medium according to claim 67, further comprising handling the servicing of at least one application variable by a network control protocol handler, a component of a network layer, wherein said handling includes at least one of (A) handling by the network control protocol handler the persistence of a value of an application variable in storage, (B) providing by the network control protocol handler the value of a variable to a protocol layer other than the network layer through an application interface, (C) accepting by the network control protocol handler a new value of an application variable at the time a device is assigned to a logical network by an ASA, (D) accepting and acknowledging by the network control protocol handler a value of a new variable when instructed by the ASA and (E) providing a value of an application variable when asked by the ASA.

### Claim 69 (depends on 67)

A computer readable medium according to claim 67, wherein the ASA updates the at least one application variable when a node is assigned to its logical network.

### Claim 70 (depends on 67)

A computer readable medium according to claim 67, wherein the ASA broadcasts the at least one application variable to all nodes on the logical network through a Write message and each node acknowledges the message.

### Claim 71 (depends on 67)

A computer readable medium according to claim 67, wherein the ASA unicasts Read and Write variable messages to verify and update a node that has missed a broadcast update.

### Claim 72 (depends on 59)

A computer readable medium according to claim 59, wherein said altering is transparent to a layer other than a network layer of the protocol.

### Claim 73 (depends on 59)

A computer readable medium according to claim 59, wherein said altering includes dynamically tuning and optimizing the protocol based upon a determination that a specific operating condition exists in the network.

### Claim 74 (depends on 73)

A computer readable medium according to claim 73, wherein said specific operating condition includes at least one of (A) low bandwidth operation of the physical medium of the network, (B) potential noise (C) a dynamic determination that there is a weak transmitter node (D) a dynamic determination that there is a weak receptor node, (E) degraded signal quality on a communications path, (F) amount of activity on the network and (G) a specific combination of number and kinds of nodes.

### Claim 75 (depends on 74)

A computer readable medium according to claim 74, wherein said at least one application variable includes at least one of (A) an adaptive back off parameter, (B) a timing window for network communications and (C) a threshold for a determination that there is at least one of said specific operating conditions.

### Claim 76 (depends on 59)

A computer readable medium according to claim 59, wherein said altering includes cross-correlating with respect to the node segments of the network which node paths are of good quality and which node paths are of poor quality.

### Claim 77 (depends on 76)

A computer readable medium according to claim 76, wherein said cross-correlating includes taking into account the rate of network traffic.

### Claim 78 (depends on 59)

A computer readable medium according to claim 59, wherein each node member of the logical network maintains a set of at least one value for at least one application variable associated with the node member.

### Claim 79 (depends on 78)

A computer readable medium according to claim 78, wherein the set of values is handled by a network layer of the protocol, and saved in persisted storage.

### Claim 80 (depends on 59)

A computer readable medium according to claim 59, wherein the at least one value is modified asynchronously.

### Claim 81 (depends on 59)

A computer readable medium according to claim 59, wherein said receiving the at least one value includes receiving said at least one value through an application interface exposed by a network layer of the protocol.

### Claim 82 (depends on 81)

A computer readable medium according to claim 81, wherein with respect to a data link layer of said protocol, said receiving includes receiving at least one value of an application variable on every call to the application interface.

### Claim 83 (depends on 59)

A computer readable medium according to claim 59, wherein the protocol is one of SCP, x10 and CEBus®.

### Claim 84 (depends on 59)

A computer readable medium according to claim 59, wherein a physical network underlying the logical network is one of a power line carrier network, a radio frequency network and an infrared transmission network.

### Claim 85 (depends on 59)

A computer readable medium according to claim 59, wherein when application variables are altered, further comprising ensuring that the values are consistent across all nodes in the network.

### Claim 86 (depends on 59)

A computer readable medium according to claim 59, wherein said at least one application variable at least one of (A) is set during a node acquisition step, (B) is set by default into one of a device and object and (C) is changed during optimization of the network dynamically.

### Claim 87 (depends on 59)

A computer readable medium according to claim 59, wherein the at least one application variable comprises a variable length table maintained by the network layer.

### Claim 88 (depends on 59)

A computer readable medium according to claim 59, wherein the at least one application variable is at least one of (A) logical network specific, (B) specific to a particular physical network underlying the logical network and (C) specific to a node of the logical network.

### Claim 89 (depends on 59)

A computer readable medium according to claim 59, wherein said at least one application variable is at least one protocol variable.

### Claim 90 (depends on 89)

A computer readable medium according to claim 89, further comprising receiving a network control protocol read variables request message requesting reading of at least one protocol variable.

### Claim 91 (depends on 90)

A computer readable medium according to claim 90, further comprising receiving a network control protocol read variables response message responding to a network control protocol read variables request message.

### Claim 92 (depends on 89)

A computer readable medium according to claim 89, further comprising receiving a network control protocol write variables request message requesting writing of at least one protocol variable.

### Claim 93 (depends on 92)

A computer readable medium according to claim 92, further comprising receiving a network control protocol write variables response message responding to a network control protocol write variables request message.

### Claim 94 (depends on 89)

A computer readable medium according to claim 89, further comprising receiving a broadcast request message, whereby in response, replying nodes back off their reply up to a delay amount, defined by a delay application variable.

### Claim 95 (depends on 59)

A computer readable medium according to claim 59, wherein said altering includes ignoring a message if there is a threshold difference in time between a send time for the message and a receive time for the message.

### Claim 96 (depends on 59)

A computer readable medium according to claim 59, further comprising further comprising assigning a network time by a time master to a message, wherein the network time is a unique number that is reset frequently to prevent replay attack.

### Claim 97 (depends on 96)

A computer readable medium according to claim 96, wherein based on windowing, spoofing is protected against by jamming an imposter message.

### Claim 98 (depends on 59)

A computer readable medium according to claim 59, further comprising tracking the presence of all other nodes on the network in accordance with said at least one application variable.

### Claim 99 (depends on 59)

At least one computer readable medium according to claim 59, wherein said modules are included in at least one of an application programming interface (API), driver code, an operating system and an application.

### Claim 100

A distributed computing system capable of automatically tuning a network having an associated protocol and a plurality of nodes forming a logical network, comprising:
at least one application variable corresponding to each of the plurality of nodes, at least one value of the at least one application variable retrievable and updatable by the system;
wherein based upon said at least one value, at least one of protocol timing and network behavior relating to at least one node of said plurality of nodes in said network is altered.

### Claim 101 (depends on 100)

A distributed computing system according to claim 100, wherein said at least one application variable includes at least one of (A) a variable corresponding to a data link layer, (B) a variable corresponding to a network layer and (C) a variable corresponding to a transport layer.

### Claim 102 (depends on 101)

A distributed computing system according to claim 101, wherein said at least one application variable corresponding to the network layer includes at least one of (A) a variable corresponding to network time and (B) a variable corresponding to presence.

### Claim 103 (depends on 101)

A distributed computing system according to claim 101, wherein a variable corresponding to the transport layer determines at least one of (A) time out conditions after dropping a message and (B) how long to wait before re-sending at least one of a request, reply and reply acknowledgement.

### Claim 104 (depends on 101)

A distributed computing system according to claim 101, wherein a variable corresponding to the data link layer determines at least one of (A) backoff timeout, (B) acknowledgment retry count and (C) broadcast burst count.

### Claim 105 (depends on 101)

A distributed computing system according to claim 101, wherein each node tracks the presence of all other nodes in the network by way of at least one variable corresponding to the network layer.

### Claim 106 (depends on 100)

A distributed computing system according to claim 100, wherein said at least one application variable is persistently stored.

### Claim 107 (depends on 100)

A distributed computing system according to claim 100, wherein the at least one application variable is handled at a network layer of the protocol.

### Claim 108 (depends on 100)

A distributed computing system according to claim 100, further comprising:
an Address Space Arbitrator (ASA), an entity responsible for managing the network, wherein the ASA assigns values to said at least one application variable.

### Claim 109 (depends on 108)

A distributed computing system according to claim 108, further comprising:
a network control protocol handler, a component of a network layer of the protocol, wherein the network control protocol handler handles the servicing of at least one application variable by at least one of (A) handling by the network control protocol handler the persistence of a value of an application variable in storage, (B) providing by the network control protocol handler the value of a variable to a protocol layer other than the network layer through an application interface, (C) accepting by the network control protocol handler a new value of an application variable at the time a device is assigned to a logical network by an ASA, (D) accepting and acknowledging by the network control protocol handler a value of a new variable when instructed by the ASA and (E) providing a value of an application variable when asked by the ASA.

### Claim 110 (depends on 108)

A distributed computing system according to claim 108, wherein the ASA updates the at least one application variable when a node is assigned to its logical network.

### Claim 111 (depends on 108)

A distributed computing system according to claim 108, wherein the ASA broadcasts the at least one application variable to all nodes on the logical network through a Write message and each node acknowledges the message.

### Claim 112 (depends on 104)

A distributed computing system according to claim 104, wherein the ASA unicasts Read and Write variable messages to verify and update a node.

### Claim 113 (depends on 100)

A distributed computing system according to claim 100, wherein the altering of said at least one application variable is transparent to a layer other than a network layer of the protocol.

### Claim 114 (depends on 100)

A distributed computing system according to claim 100, wherein said distributed system dynamically tunes and optimizes the protocol based upon a determination that a specific operating condition exists in the network.

### Claim 115 (depends on 114)

A distributed computing system according to claim 114, wherein said specific operating condition includes at least one of (A) low bandwidth operation of the physical medium of the network, (B) potential noise (C) a dynamic determination that there is a weak transmitter node (D) a dynamic determination that there is a weak receptor node, (E) degraded signal quality on a communications path, (F) amount of activity on the network and (G) a specific combination of number and kinds of nodes.

### Claim 116 (depends on 115)

A distributed computing system according to claim 115, wherein said at least one application variable includes at least one of (A) an adaptive back off parameter, (B) a timing window for network communications and (C) a threshold for a determination that there is at least one of said specific operating conditions.

### Claim 117 (depends on 100)

A distributed computing system according to claim 100, wherein said distributed system cross-correlates with respect to the node segments of the network to determine which node paths are of good quality and which node paths are of poor quality.

### Claim 118 (depends on 117)

A distributed computing system according to claim 117, wherein said cross-correlating includes taking into account the rate of network traffic.

### Claim 119 (depends on 100)

A distributed computing system according to claim 100, wherein each node member of the logical network maintains a set of at least one value for at least one application variable associated with the node member.

### Claim 120 (depends on 119)

A distributed computing system according to claim 119, wherein the set of values is handled by a network layer of the protocol, and saved in persisted storage.

### Claim 121 (depends on 100)

A distributed computing system according to claim 100, wherein the at least one value is modified asynchronously.

### Claim 122 (depends on 100)

A distributed computing system according to claim 100, wherein when at least one value of the at least one application variable is received, said at least one value is received through an application interface exposed by a network layer of the protocol.

### Claim 123 (depends on 122)

A distributed computing system according to claim 122, wherein when at least one value of the at least one application variable is received with respect to a data link layer of said protocol, said at least one value of an application variable is received on every call to the application interface.

### Claim 124 (depends on 100)

A distributed computing system according to claim 100, wherein the protocol is one of SCP, x10 and CEBus®.

### Claim 125 (depends on 100)

A distributed computing system according to claim 100, wherein a physical network underlying the logical network is one of a power line carrier network, a radio frequency network and an infrared transmission network.

### Claim 126 (depends on 100)

A distributed computing system according to claim 100, wherein when application variables are altered, the distributed system ensures that the values are consistent across all nodes in the network.

### Claim 127 (depends on 100)

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

### Claim 128 (depends on 100)

A distributed computing system according to claim 100, wherein the at least one application variable comprises a variable length table maintained by the network layer.

### Claim 129 (depends on 100)

A distributed computing system according to claim 100, wherein the at least one application variable is at least one of (A) logical network specific, (B) specific to a particular physical network underlying the logical network and (C) node specific.

### Claim 130 (depends on 100)

A distributed computing system according to claim 100, wherein said at least one application variable is at least one protocol variable.

### Claim 131 (depends on 130)

A distributed computing system according to claim 130, wherein at least one component of the distributed system sends a network control protocol read variables request message requesting reading of at least one protocol variable.

### Claim 132 (depends on 131)

A distributed computing system according to claim 131, wherein at least one component of the distributed system sends a network control protocol read variables response message responding to a network control protocol read variables request message.

### Claim 133 (depends on 130)

A distributed computing system according to claim 130, wherein at least one component of the distributed system sends a network control protocol write variables request message requesting writing of at least one protocol variable.

### Claim 134 (depends on 133)

A distributed computing system according to claim 133, wherein at least one component of the distributed system sends a network control protocol write variables response message responding to a network control protocol write variables request message.

### Claim 135 (depends on 130)

A distributed computing system according to claim 130, wherein at least one component of the distributed system receives a broadcast request message, whereby in response, replying nodes back off their reply up to a delay amount, defined by a delay application variable.

### Claim 136 (depends on 100)

A distributed computing system according to claim 100, wherein a message is ignored if there is a threshold difference in time between a send time for the message and a receive time for the message.

### Claim 137 (depends on 100)

A distributed computing system according to claim 100, further comprising: a time master for assigning a network time to a message, wherein the network time is a unique number that is reset frequently to prevent replay attack.

### Claim 138 (depends on 137)

A distributed computing system according to claim 137, wherein based on windowing, spoofing is protected against by jamming an imposter message.

### Claim 139 (depends on 100)

A distributed computing system according to claim 100, wherein the presence of all other nodes on the network is tracked in accordance with said at least one application variable.

### Claim 140

A computer readable medium for automatically tuning a network having an associated protocol and a plurality of nodes forming a logical network having stored thereon at least one computer-executable module comprising computer executable instructions for performing a method, the method comprising:
means for receiving at least one value of at least one application variable; and
means for altering at least one of protocol timing and network behavior relating to at least one node of said plurality of nodes in said network based upon said at least one value.

### Claim 141

A distributed computing system capable of automatically tuning a network having an associated protocol and a plurality of nodes forming a logical network, comprising:
means for receiving at least one value of at least one application variable; and
means for altering at least one of protocol timing and network behavior relating to at least one node of said plurality of nodes in said network based upon said at least one value.
