Systems and methods for providing automatic network optimization with application variables

• US 20040081201A1
• Filed: 09/19/2002
• Published: 04/29/2004
• Est. Priority Date: 09/19/2002
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Pyle, Harry S., Simonnet, Guillaume, Hasha, Richard L.
• Granted Patent: US 7,453,906 B2
• Time in Patent Office: Days
• US Class Current: 370/469
• CPC Class Codes: H04L 12/2803 Home automation networks
• CPC Class Codes: H04L 41/08 Configuration management of networks or network elements address allocation H04L61/50
• CPC Class Codes: H04L 69/03 Protocol definition or specification protocol conformance testing H04L1/244
• CPC Class Codes: H04L 9/40 Network security protocols

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

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.

2. 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.

3. 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.

4. 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.

5. 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.

6. 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.

7. 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.

8. 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.

9. 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.

10. 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.

11. 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.

12. 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.

13. 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.

14. 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.

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

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

17. 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.

18. 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.

19. 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.

20. 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.

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

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

23. 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.

24. 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.

25. 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.

26. 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.

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

28. 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.

29. 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.

30. 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.

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

32. 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.

33. 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.

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

.

35. 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.

36. 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.

37. 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.

38. 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.

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

40. 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.

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

42. 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.

43. 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.

44. 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.

45. 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.

46. 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.

47. 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.

48. 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.

49. 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.

50. 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.

51. 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.

52. 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.

53. 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.

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

55. 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.

56. 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.

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

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

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.

60. 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.

61. 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.

62. 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.

63. 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.

64. 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.

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

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

67. 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.

68. 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.

69. 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.

70. 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.

71. 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.

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

73. 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.

74. 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.

75. 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.

76. 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.

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

78. 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.

79. 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.

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

81. 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.

82. 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.

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

.

84. 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.

85. 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.

86. 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.

87. 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.

88. 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.

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

90. 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.

91. 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.

92. 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.

93. 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.

94. 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.

95. 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.

96. 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.

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

98. 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.

99. 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.

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.

101. 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.

102. 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.

103. 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.

104. 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.

105. 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.

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

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

108. 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.

109. 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.

110. 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.

111. 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.

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

113. 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.

114. 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.

115. 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.

116. 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.

117. 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.

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

119. 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.

120. 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.

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

122. 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.

123. 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.

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

.

125. 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.

126. 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.

127. 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.

128. 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.

129. 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.

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

131. 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.

132. 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.

133. 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.

134. 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.

135. 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.

136. 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.

137. 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.

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

139. 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.

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.

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.