This disclosure relates generally to industrial process control and automation systems. More specifically, this disclosure relates to a method and apparatus for distributed control system (DCS) process data cloning and migration through a secured file system.
Industrial process control and automation systems, including distributed control systems (DCSs), are often used to automate large and complex industrial processes. These types of systems routinely include sensors, actuators, and controllers. The controllers typically receive measurements from the sensors and generate control signals for the actuators.
Many existing DCS systems are platform- and release-dependent. That is, these DCS systems are based on plant processes that can be replicated based on process and instrumentation requirements. Many existing DCS migration processes are release- and operating system-dependent, while the associated customer control system strategies and displays are release- and platform-independent such that they can be deployed in any system across multiple releases. Typically, any migration involves activities such as backup of system configurations, installation of software/firmware, and restoration of system configurations with the new software/firmware. These operations are repeated for each node of a DCS system, which consumes a significant amount of time. Currently, there is no adequate mechanism to provide a deployable and recreatable file structure that is independent of platform and release for rapid DCS system deployment.
In addition, existing approaches are not capable of making use of effective sharing models such as cloud-based, web-based, or virtual networking models. Many nodes in secured networks may not have any access or connectivity to external networks, such as the Internet. In some instances, even if a node has connectivity to one or more external networks, security settings may prevent sharing migration data with an external network.
This disclosure provides a method and apparatus for distributed control system (DCS) process data cloning and migration through a secured file system.
In a first embodiment, a method includes generating a migration image file for a software migration based on configuration parameters associated with a first node of an industrial process control and automation system. The method also includes, after a new software version is installed at the first node, restoring information associated with the first node using the migration image file. The method further includes adapting a portion of the migration image file based on configuration parameters associated with a second node of the control and automation system. In addition, the method includes, after the new software version is installed at the second node, restoring information associated with the second node using the adapted migration image file.
In a second embodiment, an apparatus includes at least one processing device configured to generate a migration image file for a software migration based on configuration parameters associated with a first node of an industrial process control and automation system. The at least one processing device is also configured to, after a new software version is installed at the first node, restore information associated with the first node using the migration image file. The at least one processing device is further configured to adapt a portion of the migration image file based on configuration parameters associated with a second node of the control and automation system. In addition, the at least one processing device is configured to, after the new software version is installed at the second node, restore information associated with the second node using the adapted migration image file.
In a third embodiment, a non-transitory computer readable medium embodies a computer program. The computer program includes computer readable program code for generating a migration image file for a software migration based on configuration parameters associated with a first node of an industrial process control and automation system. The computer program also includes computer readable program code for, after a new software version is installed at the first node, restoring information associated with the first node using the migration image file. The computer program further includes computer readable program code for adapting a portion of the migration image file based on configuration parameters associated with a second node of the control and automation system. In addition, the computer program includes computer readable program code for, after the new software version is installed at the second node, restoring information associated with the second node using the adapted migration image file.
Other technical features may be readily apparent to one skilled in the art from the following figures, descriptions, and claims.
For a more complete understanding of this disclosure, reference is now made to the following description, taken in conjunction with the accompanying drawings, in which:
In
At least one network 104 is coupled to the sensors 102a and actuators 102b. The network 104 facilitates interaction with the sensors 102a and actuators 102b. For example, the network 104 could transport measurement data from the sensors 102a and provide control signals to the actuators 102b. The network 104 could represent any suitable network or combination of networks. As particular examples, the network 104 could represent an Ethernet network, an electrical signal network (such as a HART or FOUNDATION FIELDBUS network), a pneumatic control signal network, or any other or additional type(s) of network(s).
In the Purdue model, “Level 1” may include one or more controllers 106, which are coupled to the network 104. Among other things, each controller 106 may use the measurements from one or more sensors 102a to control the operation of one or more actuators 102b. For example, a controller 106 could receive measurement data from one or more sensors 102a and use the measurement data to generate control signals for one or more actuators 102b. Each controller 106 includes any suitable structure for interacting with one or more sensors 102a and controlling one or more actuators 102b. Each controller 106 could, for example, represent a multivariable controller, such as an EXPERION C300 controller by HONEYWELL INTERNATIONAL INC. As a particular example, each controller 106 could represent a computing device running a real-time operating system.
Two networks 108 are coupled to the controllers 106. The networks 108 facilitate interaction with the controllers 106, such as by transporting data to and from the controllers 106. The networks 108 could represent any suitable networks or combination of networks. As particular examples, the networks 108 could represent a pair of Ethernet networks or a redundant pair of Ethernet networks, such as a FAULT TOLERANT ETHERNET (FTE) network from HONEYWELL INTERNATIONAL INC.
At least one switch/firewall 110 couples the networks 108 to two networks 112. The switch/firewall 110 may transport traffic from one network to another. The switch/firewall 110 may also block traffic on one network from reaching another network. The switch/firewall 110 includes any suitable structure for providing communication between networks, such as a HONEYWELL CONTROL FIREWALL (CF9) device. The networks 112 could represent any suitable networks, such as a pair of Ethernet networks or an FTE network.
In the Purdue model, “Level 2” may include one or more machine-level controllers 114 coupled to the networks 112. The machine-level controllers 114 perform various functions to support the operation and control of the controllers 106, sensors 102a, and actuators 102b, which could be associated with a particular piece of industrial equipment (such as a boiler or other machine). For example, the machine-level controllers 114 could log information collected or generated by the controllers 106, such as measurement data from the sensors 102a or control signals for the actuators 102b. The machine-level controllers 114 could also execute applications that control the operation of the controllers 106, thereby controlling the operation of the actuators 102b. In addition, the machine-level controllers 114 could provide secure access to the controllers 106. Each of the machine-level controllers 114 includes any suitable structure for providing access to, control of, or operations related to a machine or other individual piece of equipment. Each of the machine-level controllers 114 could, for example, represent a server computing device running a MICROSOFT WINDOWS operating system. Although not shown, different machine-level controllers 114 could be used to control different pieces of equipment in a process system (where each piece of equipment is associated with one or more controllers 106, sensors 102a, and actuators 102b).
One or more operator stations 116 are coupled to the networks 112. The operator stations 116 represent computing or communication devices providing user access to the machine-level controllers 114, which could then provide user access to the controllers 106 (and possibly the sensors 102a and actuators 102b). As particular examples, the operator stations 116 could allow users to review the operational history of the sensors 102a and actuators 102b using information collected by the controllers 106 and/or the machine-level controllers 114. The operator stations 116 could also allow the users to adjust the operation of the sensors 102a, actuators 102b, controllers 106, or machine-level controllers 114. In addition, the operator stations 116 could receive and display warnings, alerts, or other messages or displays generated by the controllers 106 or the machine-level controllers 114. Each of the operator stations 116 includes any suitable structure for supporting user access and control of one or more components in the system 100. Each of the operator stations 116 could, for example, represent a computing device running a MICROSOFT WINDOWS operating system.
At least one router/firewall 118 couples the networks 112 to two networks 120. The router/firewall 118 includes any suitable structure for providing communication between networks, such as a secure router or combination router/firewall. The networks 120 could represent any suitable networks, such as a pair of Ethernet networks or an FTE network.
In the Purdue model, “Level 3” may include one or more unit-level controllers 122 coupled to the networks 120. Each unit-level controller 122 is typically associated with a unit in a process system, which represents a collection of different machines operating together to implement at least part of a process. The unit-level controllers 122 perform various functions to support the operation and control of components in the lower levels. For example, the unit-level controllers 122 could log information collected or generated by the components in the lower levels, execute applications that control the components in the lower levels, and provide secure access to the components in the lower levels. Each of the unit-level controllers 122 includes any suitable structure for providing access to, control of; or operations related to one or more machines or other pieces of equipment in a process unit. Each of the unit-level controllers 122 could, for example, represent a server computing device running a MICROSOFT WINDOWS operating system. Although not shown, different unit-level controllers 122 could be used to control different units in a process system (where each unit is associated with one or more machine-level controllers 114, controllers 106, sensors 102a, and actuators 102b).
Access to the unit-level controllers 122 may be provided by one or more operator stations 124. Each of the operator stations 124 includes any suitable structure for supporting user access and control of one or more components in the system 100. Each of the operator stations 124 could, for example, represent a computing device running a MICROSOFT WINDOWS operating system.
At least one router/firewall 126 couples the networks 120 to two networks 128. The router/firewall 126 includes any suitable structure for providing communication between networks, such as a secure router or combination router/firewall. The networks 128 could represent any suitable networks, such as a pair of Ethernet networks or an FTE network.
In the Purdue model, “Level 4” may include one or more plant-level controllers 130 coupled to the networks 128. Each plant-level controller 130 is typically associated with one of the plants 101a-101n, which may include one or more process units that implement the same, similar, or different processes. The plant-level controllers 130 perform various functions to support the operation and control of components in the lower levels. As particular examples, the plant-level controller 130 could execute one or more manufacturing execution system (MES) applications, scheduling applications, or other or additional plant or process control applications. Each of the plant-level controllers 130 includes any suitable structure for providing access to, control of, or operations related to one or more process units in a process plant. Each of the plant-level controllers 130 could, for example, represent a server computing device running a MICROSOFT WINDOWS operating system.
Access to the plant-level controllers 130 may be provided by one or more operator stations 132. Each of the operator stations 132 includes any suitable structure for supporting user access and control of one or more components in the system 100. Each of the operator stations 132 could, for example, represent a computing device running a MICROSOFT WINDOWS operating system.
At least one router/firewall 134 couples the networks 128 to one or more networks 136. The router/firewall 134 includes any suitable structure for providing communication between networks, such as a secure router or combination router/firewall. The network 136 could represent any suitable network, such as an enterprise-wide Ethernet or other network or all or a portion of a larger network (such as the Internet).
In the Purdue model, “Level 5” may include one or more enterprise-level controllers 138 coupled to the network 136. Each enterprise-level controller 138 is typically able to perform planning operations for multiple plants 101a-101n and to control various aspects of the plants 101a-101n. The enterprise-level controllers 138 can also perform various functions to support the operation and control of components in the plants 101a-101n. As particular examples, the enterprise-level controller 138 could execute one or more order processing applications, enterprise resource planning (ERP) applications, advanced planning and scheduling (APS) applications, or any other or additional enterprise control applications. Each of the enterprise-level controllers 138 includes any suitable structure for providing access to, control of, or operations related to the control of one or more plants. Each of the enterprise-level controllers 138 could, for example, represent a server computing device running a MICROSOFT WINDOWS operating system. In this document, the term “enterprise” refers to an organization having one or more plants or other processing facilities to be managed. Note that if a single plant 101a is to be managed, the functionality of the enterprise-level controller 138 could be incorporated into the plant-level controller 130.
Access to the enterprise-level controllers 138 may be provided by one or more operator stations 140. Each of the operator stations 140 includes any suitable structure for supporting user access and control of one or more components in the system 100. Each of the operator stations 140 could, for example, represent a computing device running a MICROSOFT WINDOWS operating system.
Various levels of the Purdue model can include other components, such as one or more databases. The database(s) associated with each level could store any suitable information associated with that level or one or more other levels of the system 100. For example, a historian 141 can be coupled to the network 136. The historian 141 could represent a component that stores various information about the system 100. The historian 141 could, for instance, store information used during production scheduling and optimization. The historian 141 represents any suitable structure for storing and facilitating retrieval of information. Although shown as a single centralized component coupled to the network 136, the historian 141 could be located elsewhere in the system 100, or multiple historians could be distributed in different locations in the system 100.
In particular embodiments, the various controllers and operator stations in
In some embodiments, the system 100 may represent all or portions of a distributed control system (DCS), and the various controllers and operator stations in
The migration of each node includes multiple operations that are performed sequentially for each node. For Node A, operations 201a-204a are performed in sequence. Operation 201a involves determining a set of parameters associated with the configuration of Node A. The complete set of parameters can differ somewhat from node to node. However, most nodes include a common set of parameters, such as machine name, IP address, registry path, and the like. Operation 202a represents a backup operation in which content associated with Node A is saved or copied to a backup storage location. The content can include the parameters determined in operation 201a. The backup storage location could include an existing memory, database, or other suitable data storage, or the backup storage location could include a backup storage that is configured specifically for the migration process. Operation 203a involves installing a new version of software or firmware for Node A. This may include one or more installation operations performed by a user, one or more automated installation operations performed by a processing device, or a combination thereof. Operation 204a involves restoring the backed-up content in a manner that makes the content compatible with the new version of software or firmware. This may include executing one or more data migration scripts or processes to convert the backed-up content to be compatible with the new version of software or firmware.
Operations 201a-204a are performed sequentially for the migration of Node A. Operations analogous to the operations 201a-204a are also performed for each of the other nodes. For example, operations 201b-204b are performed for Node B, and operations 201n-204n are performed for Node N. Thus, it can be seen from
Returning to
The PIM tool 154 includes any suitable structure supporting data cloning and migration operations for use with devices in an industrial process control and automation system. The PIM tool 154 could, for example, represent a computing device having at least one processor, at least one memory, and at least one network interface. The PIM tool 154 could represent a stand-alone component (such as a computing device designated solely for this purpose) or be integrated into another component (such as a computing device implementing control functionality on some level of the system 100). The logic of the PIM tool 154 could be implemented using hardware components only or using hardware components and software/firmware instructions. Additional details regarding specific implementations of the PIM tool 154 are provided below.
Although
As shown in
The memory 312 and a persistent storage 314 are examples of storage devices 306, which represent any structure(s) capable of storing and facilitating retrieval of information (such as data, program code, and/or other suitable information on a temporary or permanent basis). The memory 312 may represent a random access memory or any other suitable volatile or non-volatile storage device(s). The persistent storage 314 may contain one or more components or devices supporting longer-term storage of data, such as a ready only memory, hard drive, Flash memory, or optical disc.
The communications unit 308 supports communications with other systems or devices. For example, the communications unit 308 could include a network interface card that facilitates communications over at least one Ethernet network. The communications unit 308 could also include a wireless transceiver facilitating communications over at least one wireless network. The communications unit 308 may support communications through any suitable physical or wireless communication link(s).
The I/O unit 310 allows for input and output of data. For example, the I/O unit 310 may provide a connection for user input through a keyboard, mouse, keypad, touchscreen, or other suitable input device. The I/O unit 310 may also send output to a display, printer, or other suitable output device.
Although
To summarize the operations shown in
Customization of a backup data file allows for use of the backup data file across different nodes/clusters with different configurations. For example, some parameters are consistent across nodes in a cluster, while other parameters differ between nodes. As particular examples, the Internet Protocol (IP) or other network address and machine name may be different for each node. Thus, customization can be used to change the network address and machine name in cloned backup data for each node.
It is assumed for the example shown in
As shown in
At operation 402, the PIM tool 154 creates a PIM file as a backup of Node A or the nodes in Cluster A. In some embodiments, the PIM file includes a secured data set that is proprietary to the migration provider, although a standardized or non-proprietary data set could also be supported. The PIM tool 154 creates the PIM file using the variable and consistent parameters of Node A/Cluster A described above. With minimal or no customization, the PIM file is capable of being deployed irrespective of platform, release, and cluster across geographical locations.
At operation 403a, the PIM tool 154 ensures that any prerequisites are met for the migration of Node A or the nodes of Cluster A, and the PIM file is deployed in preparation for the migration of Node A or the nodes of Cluster A. At operation 404a, a new version of software is installed for Node A or the nodes of Cluster A. This may include one or more installation operations performed by a user, one or more automated installation operations performed by a processing device, or a combination thereof. At operation 405a, the backed-up content from the PIM file is restored in a manner that makes the content compatible with the new version of the software. This may include executing one or more data migration scripts or processes to convert the backed-up content to be compatible with the new version of software. At this point, Node A or the nodes of Cluster A have been successfully migrated to the new software.
To migrate an additional node or cluster (such as node/cluster B through N), no backup of the nodes or clusters may be needed. Instead, the PIM file generated earlier is cloned, updated with information specified to the additional node or cluster, and deployed to the additional node or cluster. The cloned and modified PIM file is then used to migrate the additional node or cluster. For example, with respect to Node B or the nodes in Cluster B, a cloned PIM file is presented to the user at operation 403b, and the user can update one or more of the variable parameters for Node B or the nodes in Cluster B as described above. The updated values are saved in the cloned PIM file, and consistent parameters do not need to be updated for Node B or the nodes in Cluster B. The PIM file's content can be reviewed, validated, and verified for any migration anomalies (such as encryption/decryption errors) before it is deployed, and the PIM file is deployed in preparation for the migration of Node B or the nodes in Cluster B. The new version of the software is installed for Node B or the nodes in Cluster B at operation 404b, and the backed-up content for Node B or the nodes in Cluster B is restored at operation 405b. Similar operations can be performed for each remaining node or cluster, such as operations 403n-405n for Node N or the nodes in Cluster N.
As can be seen from
In some embodiments, the number of consistent parameters (which are the same between multiple nodes being migrated) can be substantially larger than the number of variable parameters (which can be different from node to node). Thus, significant time savings can be realized by using the same cloned data for each node migration and only customizing the variable data for each node. Hence, this migration approach provides a shorter and more effective upgrade migration compared to existing migration strategies.
As a descriptive example, consider a production plant that includes multiple fluid tracking processes in the petroleum industry. In the production plant, two tracking units have the same (or substantially the same) production process. Accordingly, the control systems that control these two tracking units can be the same. In some embodiments, only the names of the two tracking units may be different. Since the controls and processes for the two tracking units are the same and only the names are different, substantial portions of the data associated with each tracking unit can be reused during a migration. For example, it may be possible to reuse all of the data except for the name of each tracking unit. This concept of reusability of data can be scaled up for larger plant systems. For instance, instead of two tracking units in a single plant, backed-up data could be used and reused across multiple plants in multiple geographical locations. This can be useful for companies that have multiple plants or plant locations across different geographical locations, including different countries.
Although
At step 501, one or more configuration parameters associated with a first node of an industrial process control and automation system are determined for a migration image file. This may include, for example, the PIM tool 154 determining the configuration parameters of a controller, operator station, client, server, or other node. At step 503, the migration image file is generated based on the configuration parameters. This may include, for example, the PIM tool 154 creating a PIM file as a backup of the first node. The migration image file includes variable parameters that may differ between nodes involved in a migration and consistent parameters that are the same for the nodes involved in the migration.
At step 505, a new software version is installed at the first node, and information associated with the first node is restored using the migration image file. This may include, for example, the PIM tool 154 executing one or more data migration scripts or processes to convert the backed-up content to be compatible with the new version of the software.
At step 507, a portion of the migration image file is adapted based on configuration parameters associated with a second node of the industrial process control and automation system. This may include, for example, the PIM tool 154 displaying the variable parameters of the second node on a display and receiving an indication of a change to one or more of the variable parameters from a user.
At step 509, the new software version is installed at the second node, and information associated with the second node is restored using the adapted migration image file. This may include, for example, the PIM tool 154 executing one or more data migration scripts or processes to convert the backed-up content to be compatible with the new version of software.
At step 511, a determination is made whether any additional nodes are to be migrated in the migration process. If so, the method 500 returns to step 507, and the iterations may be repeated for each node involved in the software migration. Otherwise, the method 500 ends.
Although
In some embodiments, various functions described in this patent document are implemented or supported by a computer program that is formed from computer readable program code and that is embodied in a computer readable medium. The phrase “computer readable program code” includes any type of computer code, including source code, object code, and executable code. The phrase “computer readable medium” includes any type of medium capable of being accessed by a computer, such as read only memory (ROM), random access memory (RAM), a hard disk drive, a compact disc (CD), a digital video disc (DVD), or any other type of memory. A “non-transitory” computer readable medium excludes wired, wireless, optical, or other communication links that transport transitory electrical or other signals. A non-transitory computer readable medium includes media where data can be permanently stored and media where data can be stored and later overwritten, such as a rewritable optical disc or an erasable memory device.
It may be advantageous to set forth definitions of certain words and phrases used throughout this patent document. The terms “application” and “program” refer to one or more computer programs, software components, sets of instructions, procedures, functions, objects, classes, instances, related data, or a portion thereof adapted for implementation in a suitable computer code (including source code, object code, or executable code). The term “communicate,” as well as derivatives thereof, encompasses both direct and indirect communication. The terms “include” and “comprise,” as well as derivatives thereof, mean inclusion without limitation. The term “or” is inclusive, meaning and/or. The phrase “associated with,” as well as derivatives thereof, may mean to include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicable with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, have a relationship to or with, or the like. The phrase “at least one of,” when used with a list of items, means that different combinations of one or more of the listed items may be used, and only one item in the list may be needed. For example, “at least one of A, B, and C” includes any of the following combinations: A, B, C, A and B, A and C, B and C, and A and B and C.
While this disclosure has described certain embodiments and generally associated methods, alterations and permutations of these embodiments and methods will be apparent to those skilled in the art. Accordingly, the above description of example embodiments does not define or constrain this disclosure. Other changes, substitutions, and alterations are also possible without departing from the spirit and scope of this disclosure, as defined by the following claims.
Number | Name | Date | Kind |
---|---|---|---|
4679189 | Olson et al. | Jul 1987 | A |
5537414 | Takiyasu et al. | Jul 1996 | A |
5566356 | Taketsugu | Oct 1996 | A |
5664195 | Chatterji | Sep 1997 | A |
5749053 | Kusaki et al. | May 1998 | A |
5898826 | Pierce et al. | Apr 1999 | A |
6141769 | Petivan et al. | Oct 2000 | A |
6192232 | Iseyama | Feb 2001 | B1 |
6256297 | Haferbeck et al. | Jul 2001 | B1 |
6292905 | Wallach et al. | Sep 2001 | B1 |
6374352 | Goldman et al. | Apr 2002 | B1 |
6427071 | Adams et al. | Jul 2002 | B1 |
6437692 | Petite et al. | Aug 2002 | B1 |
6631416 | Bendinelli et al. | Oct 2003 | B2 |
6694447 | Leach et al. | Feb 2004 | B1 |
6701453 | Chrabaszcz | Mar 2004 | B2 |
6751219 | Lipp et al. | Jun 2004 | B1 |
6763458 | Watanabe | Jul 2004 | B1 |
6847316 | Keller | Jan 2005 | B1 |
6850486 | Saleh et al. | Feb 2005 | B2 |
6917584 | Kuwabara | Jul 2005 | B2 |
6963781 | Fehrer et al. | Nov 2005 | B2 |
7031308 | Garcia-Luna-Aceves et al. | Apr 2006 | B2 |
7035937 | Haas et al. | Apr 2006 | B2 |
7058848 | Sicola et al. | Jun 2006 | B2 |
7190961 | Burr | Mar 2007 | B2 |
7203743 | Shah-Heydari | Apr 2007 | B2 |
7236987 | Faulkner et al. | Jun 2007 | B1 |
7240188 | Takata et al. | Jul 2007 | B2 |
7275157 | Cam Winget | Sep 2007 | B2 |
7366114 | Park et al. | Apr 2008 | B2 |
7440735 | Karschnia et al. | Oct 2008 | B2 |
7460865 | Nixon et al. | Dec 2008 | B2 |
7620409 | Budampati et al. | Nov 2009 | B2 |
7688802 | Gonia et al. | Mar 2010 | B2 |
7802016 | Eimers-Klose et al. | Sep 2010 | B2 |
8108853 | Bale et al. | Jan 2012 | B2 |
8498201 | Budampati et al. | Jul 2013 | B2 |
8756412 | Pulini et al. | Jun 2014 | B2 |
20020072329 | Bandeira et al. | Jun 2002 | A1 |
20020120671 | Daffner et al. | Aug 2002 | A1 |
20020122230 | Izadpanah et al. | Sep 2002 | A1 |
20020176396 | Hammel et al. | Nov 2002 | A1 |
20030003912 | Melpignano et al. | Jan 2003 | A1 |
20030005149 | Haas et al. | Jan 2003 | A1 |
20030177150 | Fung et al. | Sep 2003 | A1 |
20030212768 | Sullivan | Nov 2003 | A1 |
20040010694 | Collens et al. | Jan 2004 | A1 |
20040028023 | Mandhyan et al. | Feb 2004 | A1 |
20040029553 | Cain | Feb 2004 | A1 |
20040083833 | Hitt et al. | May 2004 | A1 |
20040174829 | Ayyagari | Sep 2004 | A1 |
20040230899 | Pagnano et al. | Nov 2004 | A1 |
20040259533 | Nixon et al. | Dec 2004 | A1 |
20050059379 | Sovio et al. | Mar 2005 | A1 |
20050071708 | Bartfai et al. | Mar 2005 | A1 |
20050102562 | Shinohara et al. | May 2005 | A1 |
20050141553 | Kim et al. | Jun 2005 | A1 |
20050201349 | Budampati | Sep 2005 | A1 |
20050228509 | James | Oct 2005 | A1 |
20050254653 | Potashnik et al. | Nov 2005 | A1 |
20050281215 | Budampati et al. | Dec 2005 | A1 |
20050289553 | Miki | Dec 2005 | A1 |
20060002368 | Budampati et al. | Jan 2006 | A1 |
20060015641 | Ocko et al. | Jan 2006 | A1 |
20060039347 | Nakamura et al. | Feb 2006 | A1 |
20060083200 | Emeott et al. | Apr 2006 | A1 |
20060104301 | Beyer et al. | May 2006 | A1 |
20060128349 | Yoon | Jun 2006 | A1 |
20060171344 | Subramanian et al. | Aug 2006 | A1 |
20060171346 | Kolavennu et al. | Aug 2006 | A1 |
20060227729 | Budampati et al. | Oct 2006 | A1 |
20060256740 | Koski | Nov 2006 | A1 |
20060271814 | Fung et al. | Nov 2006 | A1 |
20060274644 | Budampati et al. | Dec 2006 | A1 |
20060274671 | Budampati et al. | Dec 2006 | A1 |
20060282498 | Muro | Dec 2006 | A1 |
20060287001 | Budampati et al. | Dec 2006 | A1 |
20070022317 | Chen et al. | Jan 2007 | A1 |
20070030816 | Kolavennu | Feb 2007 | A1 |
20070030832 | Gonia et al. | Feb 2007 | A1 |
20070067458 | Chand | Mar 2007 | A1 |
20070073861 | Amanuddin et al. | Mar 2007 | A1 |
20070076638 | Kore et al. | Apr 2007 | A1 |
20070077941 | Gonia et al. | Apr 2007 | A1 |
20070087763 | Budampati et al. | Apr 2007 | A1 |
20070091824 | Budampati et al. | Apr 2007 | A1 |
20070091825 | Budampati et al. | Apr 2007 | A1 |
20070103303 | Shoarinejad | May 2007 | A1 |
20070147294 | Bose et al. | Jun 2007 | A1 |
20070153677 | McLaughlin et al. | Jul 2007 | A1 |
20070153789 | Barker, Jr. et al. | Jul 2007 | A1 |
20070155423 | Carmody et al. | Jul 2007 | A1 |
20070237137 | McLaughlin | Oct 2007 | A1 |
20070261052 | Bale et al. | Nov 2007 | A1 |
20070280178 | Hodson et al. | Dec 2007 | A1 |
20080043637 | Rahman | Feb 2008 | A1 |
20080134164 | Stich et al. | Jun 2008 | A1 |
20080140844 | Halpern | Jun 2008 | A1 |
20080267259 | Budampati et al. | Oct 2008 | A1 |
20080273547 | Phinney | Nov 2008 | A1 |
20090022121 | Budampati et al. | Jan 2009 | A1 |
20090034441 | Budampati et al. | Feb 2009 | A1 |
20090060192 | Budampati et al. | Mar 2009 | A1 |
20090086692 | Chen | Apr 2009 | A1 |
20090109889 | Budampati et al. | Apr 2009 | A1 |
20090138541 | Wing et al. | May 2009 | A1 |
20090222466 | Allison | Sep 2009 | A1 |
20100042869 | Szabo et al. | Feb 2010 | A1 |
20100128699 | Yang et al. | May 2010 | A1 |
20100287548 | Zhou et al. | Nov 2010 | A1 |
20110305206 | Junell et al. | Dec 2011 | A1 |
20120017031 | Mashtizadeh et al. | Jan 2012 | A1 |
20120101663 | Fervel et al. | Apr 2012 | A1 |
20120117416 | McLaughlin | May 2012 | A1 |
20130219161 | Fontignie et al. | Aug 2013 | A1 |
20150066163 | Sunderam | Mar 2015 | A1 |
Number | Date | Country |
---|---|---|
101819545 | Sep 2010 | CN |
103605561 | Feb 2014 | CN |
4134207 | Apr 1993 | DE |
103 14 721 | Nov 2004 | DE |
1 081 895 | Mar 2001 | EP |
1 401 171 | Mar 2004 | EP |
1 439 667 | Jul 2004 | EP |
2 427 329 | Dec 2006 | GB |
WO 0077585 | Dec 2000 | WO |
WO 0135190 | May 2001 | WO |
WO 03079616 | Sep 2003 | WO |
WO 2004047385 | Jun 2004 | WO |
WO 2004114621 | Dec 2004 | WO |
WO 2006017994 | Feb 2006 | WO |
WO 2006053041 | May 2006 | WO |
WO 2012131074 | Oct 2012 | WO |
Entry |
---|
Extended European Search Report dated Aug. 9, 2016 in connection with European Application No. 16163463.9, 9 pages. |
Salman Taherian, et al., “Event Dissemination in Mobile Wireless Sensor Networks”, 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, p. 573-575. |
Dongyan Chen et al., “Dependability Enhancement for IEEE 802.11 Wireless LAN with Redundancy Techniques,” Proceedings of the 2003 International Conference on Dependable Systems and Networks, 2003, 8 pages. |
Dr. Soumitri Kolavennu, Presentation, “WNSIA MAC Layer”, ISA SP100 meeting, Feb. 14, 2007, 24 pages, see esp. p. 17. |
Ying Zhang, et al., “A Learning-based Adaptive Routing Tree for Wireless Sensor Networks”, Journal of Communications, vol. 1, No. 2, May 2006, p. 12-21. |
Yau-Ming Sun, et al., “An Efficient Deadlock-Free Tree-Based Routing Algorithm for Irregular Wormhole-Routed Networks Based on the Turn Model”, Proceedings of the 2004 International Conference on Parallel Processing (ICPP'04), 10 pages. |
Sejun Song, “Fault Recovery Port-based Fast Spanning Tree Algorithm (FRP-FAST) for the Fault-Tolerant Ethernet on the Arbitrary Switched Network Topology”, 2001 IEEE, p. 325-332. |
“XYR 5000 Wireless Transmitters, Honeywell Solutions for Wireless Data Acquisiton and Monitoring,” www.acs.honeywell.com, Feb. 2006, 6 pages. |
Communication pursuant to Article 94(3) EPC dated Apr. 2, 2009 in connection with European Patent Application No. 07 761 784.3, 9 pgs. |
A. Aiello et al., “Wireless Distributed Measurement System by Using Mobile Devices,” IEEE Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, Sep. 5-7, 2005, Sofia, Bulgaria, pp. 316-319. |
International Search Report and Written Opinion of the International Searching Authority in PCT Application No. PCT/US2007/069717 dated Dec. 10, 2007, 10 pgs. |
International Search Report and Written Opinion of the International Searching Authority in PCT Application No. PCT/US2007/069614 dated Nov. 22, 2007, 9 pgs. |
International Search Report and Written Opinion of the International Searching Authority in PCT Application No. PCT/US2007/069710 dated Nov. 27, 2007, 10 pgs. |
International Search Report and Written Opinion of the International Searching Authority in PCT Application No. PCT/US2007/069705 dated Apr. 15, 2008, 9 pgs. |
Pereira, J.M. Dias, “A Fieldbus Prototype for Educational Purposes”, IEEE Instrumentation & Measurement Magazine, New York, NY vol. 7, No. 1, Mar. 2004, p. 24-31. |
International Search Report and Written Opinion of the International Searching Authority in PCT Application No. PCT/US2006/048334 dated Jul. 5, 2007, 10 pgs. |
European Search Report dated Oct. 6, 2008 in connection with European Patent Application No. 08 16 1387.9, 3 pgs. |
Strilich, et al.; “Gateway Offering Logical Model Mapped to Independent Underlying Networks”; U.S. Appl. No. 14/269,903, filed May 5, 2014; 49 pages. |
David E. Lowell, et al., “Devirtualizable Virtual Machines Enabling General, Single-Node, Online Maintenance”, ASPLOS'04, Oct. 9-13, 2004, p. 211-223. |
Olivier Crameri, et al., “Staged Deployment in Mirage, an Integrated Software Upgrade Testing and Distribution System”, SOSP'07, Oct. 14-17, 2007, 16 pages. |
Ramakrishna S. Budampati, et al., “Apparatus and Method for Improving the Reliability of Industrial Wireless Networks That Experience Outages in Backbone Connectivity”, U.S. Appl. No. 12/869,557, filed Aug. 26, 2010, 27 pgs. |
Christopher Pulini, et al. “Gateway Supporting Transparent Redundancy in Process Control Systems and Other Systems and Related Method”, U.S. Appl. No. 12/762,215, filed Apr. 16, 2010, 56 pgs. |
Paul F. McLaughlin et al., “On-Process Migration From One Type of “Level 1” Process Controller to a Different Type of “Level 1” Process Controller”, U.S. Appl. No. 62/145,371, filed Apr. 9, 2015, 22 pgs. |
John M. Prall et al., “Apparatus and Method for On-Process Migration of Industrial Control and Automation System Across Disparate Network Types”, U.S. Appl. No. 14/476,355, filed Sep. 3, 2014, 39 pgs. |
Prakash Mani et al., “Method and Apparatus for an On-Process Migration in a Virtual Environment Within an Industrial Process Control and Automation System”, U.S. Appl. No. 14/871,898, filed Sep. 30, 2015, 45 pgs. |
Paul F. McLaughlin, Method and System for Process Control Network Migration, U.S. Appl. No. 12/942,177, filed Nov. 9, 2010, 39 pgs. |
Number | Date | Country | |
---|---|---|---|
20160299909 A1 | Oct 2016 | US |