NODE CONTROL IN A DISTRIBUTED PEER-TO-PEER NETWORK

• US 20150120826A1
• Filed: 10/28/2013
• Published: 04/30/2015
• Est. Priority Date: 10/28/2013
• Status: Abandoned Application

• Current Assignee: Echelon Corporation (Renesas Electronics Corporation)
• Original Assignee: Echelon Corporation (Renesas Electronics Corporation)
• Inventors: Gauweiler, Bernd, Blomseth, Richard A.
• Application Number:
  US14/065,176
• Publication Number:
  US 20150120826A1
• Time in Patent Office: Days
• US Class Current: 709/204
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/12 specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
• CPC Class Codes: H04L 67/303 Terminal profiles
• CPC Class Codes: H04L 67/561 Adding application-functional data or data for application control, e.g. adding metadata

Abstract

Embodiments of the invention include a method and system for improved node control in a distributed peer-to-peer network. The invention provides a framework component which automatically converts and conditions incoming data from other nodes, regardless of their type. The data is converted from a network compatible format to an application compatible format based upon stored data type definitions. The data is further conditioned based on stored data property rules. Thus, once the data reaches the application, it is already properly formatted. The application component which runs on the device hardware is greatly simplified through the use of this framework component.

Claims

1. A method comprising:

receiving input data from the network at a first node;

converting the input data to an application compatible data based on data type definitions stored in the first node;

conditioning the application compatible data to be compatible with an application of the first node using meta data rules stored in the first node;

sending the conditioned application compatible data to the application of the first node for processing; and

sending an event notification to the application of the first node to indicate that conditioned application compatible data is available for processing.

2. The method of claim 1, further comprising:

queuing the input data into a raw data queue before converting the input data.

3. The method of claim 1, wherein the conditioned application compatible data requires no additional conversion by the application.

4. The method of claim 1, wherein the conditioned application compatible data is encapsulated into a data object prior to sending the conditioned application compatible data to the application of the first node for processing.

5. The method of claim 4, wherein the data type definitions and meta data rules are derived from a profile.

6. The method of claim 5, wherein the meta data rules defines a plurality of rules for interpreting the application compatible data.

7. The method of claim 5, wherein the profile is instantiated into a list of at least one data blocks.

8. The method of claim 7, wherein a node object is automatically instantiated in the list of data blocks to provide maintenance and housekeeping operations.

9. The method of claim 1, where the method is implemented in Python programming language.

10. The method of claim 1, further comprising:

receiving an output from the application of the first node, wherein the output data is an output request;

conditioning output data received from the application based on the meta data rules stored in the first node;

converting the output data to a network compatible data based on the data type definitions; and

sending the network compatible data to the network compatible data to all contracted subscribers.

11. The method of claim 1, further comprising:

receiving an output from the application of the first node, wherein the output is a poll transaction request; and

requesting a poll transaction from the network.

12. The method of claim 1, further comprising:

receiving an output from the application of the first node, wherein the output is a value synchronization request;

conditioning data based on the meta data rules stored in the first node, wherein the data is input data previously modified by the application;

converting the data to a network compatible data based on the data type definitions; and

storing the data on a network layer of the first node.

13. A first node comprising:

a processor; and

memory to store an application and a data alteration framework, wherein when the data alteration framework is executed by the processor, the processor performs operations comprising;

receiving input data from a second node at a first node;

converting the input data to an application compatible data based on data type definitions stored in the first node;

conditioning the application compatible data to be compatible with an application of the first node using meta data rules stored in the first node;

sending the conditioned application compatible data to the application of the first node for processing; and

sending an event notification to the application of the first node to indicate that conditioned application compatible data is available for processing.

14. The first node of claim 13, wherein the conditioned application compatible data requires no additional conversion by the application.

15. The first node of claim 13, wherein the conditioned application compatible data is encapsulated into a data object prior to sending the conditioned application compatible data to the application of the first node for processing.

16. The first node of claim 15, wherein the data type definitions and meta data rules are derived from a profile.

17. The first node of claim 16, wherein the meta data rules define a plurality of rules for interpreting the application compatible data.

18. The first node of claim 17, wherein the profile is instantiated into a list of at least one data blocks, wherein the instantiation occurs within the data alteration framework.

19. The first node of claim 18, wherein a node object is automatically instantiated in the list of data blocks to provide maintenance and housekeeping operations fully and transparently for the application.

20. The first node of claim 13, the data alteration framework is implemented in Python programming language.