Patent application number | Description | Published |
20090006888 | Fast primary cluster recovery - A cluster recovery process is implemented across a set of distributed archives, where each individual archive is a storage cluster of preferably symmetric nodes. Each node of a cluster typically executes an instance of an application that provides object-based storage of fixed content data and associated metadata. According to the storage method, an association or “link” between a first cluster and a second cluster is first established to facilitate replication. The first cluster is sometimes referred to as a “primary” whereas the “second” cluster is sometimes referred to as a “replica.” Once the link is made, the first cluster's fixed content data and metadata are then replicated from the first cluster to the second cluster, preferably in a continuous manner. Upon a failure of the first cluster, however, a failover operation occurs, and clients of the first cluster are redirected to the second cluster. Upon repair or replacement of the first cluster (a “restore”), the repaired or replaced first cluster resumes authority for servicing the clients of the first cluster. This restore operation preferably occurs in two stages: a “fast recovery” stage that involves preferably “bulk” transfer of the first cluster metadata, following by a “fail back” stage that involves the transfer of the fixed content data. Upon receipt of the metadata from the second cluster, the repaired or replaced first cluster resumes authority for the clients irrespective of whether the fail back stage has completed or even begun. | 01-01-2009 |
20100191774 | Method and system for versioned file system using structured data representations - A versioned file system comprises a set of structured data representations, such as XML. In a representative embodiment, at a first time, the interface creates and exports to the data store a first structured data representation corresponding to a first version of the local file system. The first structured data representation is an XML tree having a root element, one or more directory elements associated with the root element, and one or more file elements associated with a given directory element. Upon a change within the file system (e.g., file creation, file deletion, file modification, directory creation, directory deletion and directory modification), the interface creates and exports a second structured data representation corresponding to a second version of the file system. The second structured data representation differs from the first structured data representation up to and including the root element of the second structured data representation. The interface continues to generate and export the structured data representations to the data store, preferably at given “snapshot” times when changes within the file system have occurred. The data store preferably comprises one or more cloud storage service providers. As necessary, a given structured data representation is then used to retrieve an associated version of the file system. In this manner, the versioned file system only requires write-once behavior from the data store to preserve its complete state at any point-in-time. | 07-29-2010 |
20110035629 | Automated software testing framework - A generic testing framework to automatically allocate, install and verify a given version of a system under test, to exercise the system against a series of tests in a “hands-off” objective manner, and then to export information about the tests to one or more developer repositories (such as a query-able database, an email list, a developer web server, a source code version control system, a defect tracking system, or the like). The framework does not “care” or concern itself with the particular implementation language of the test as long as the test can issue directives via a command line or configuration file. During the automated testing of a given test suite having multiple tests, and after a particular test is run, the framework preferably generates an “image” of the system under test and makes that information available to developers, even while additional tests in the suite are being carried out. In this manner, the framework preserves the system “state” to facilitate concurrent or after-the-fact debugging. The framework also will re-install and verify a given version of the system between tests, which may be necessary in the event a given test is destructive or otherwise places the system in an unacceptable condition. | 02-10-2011 |
20110178983 | Fast primary cluster recovery - A cluster recovery process is implemented across a set of distributed archives, where each individual archive is a storage cluster of preferably symmetric nodes. Each node of a cluster typically executes an instance of an application that provides object-based storage of fixed content data and associated metadata. According to the storage method, an association or “link” between a first cluster and a second cluster is first established to facilitate replication. The first cluster is sometimes referred to as a “primary” whereas the “second” cluster is sometimes referred to as a “replica.” Once the link is made, the first cluster's fixed content data and metadata are then replicated from the first cluster to the second cluster, preferably in a continuous manner. Upon a failure of the first cluster, however, a failover operation occurs, and clients of the first cluster are redirected to the second cluster. Upon repair or replacement of the first cluster (a “restore”), the repaired or replaced first cluster resumes authority for servicing the clients of the first cluster. This restore operation preferably occurs in two stages: a “fast recovery” stage that involves preferably “bulk” transfer of the first cluster metadata, following by a “fail back” stage that involves the transfer of the fixed content data. Upon receipt of the metadata from the second cluster, the repaired or replaced first cluster resumes authority for the clients irrespective of whether the fail back stage has completed or even begun. | 07-21-2011 |
20120030261 | Versioned file system with pruning - A versioned file system comprises a set of structured data representations, such as XML. Each structured data representation corresponds to a “version,” and each version comprises a tree of write-once objects rooted at a root directory manifest. Each version in the versioned file system has associated therewith a “borrow window.” When it is desired to reconstruct the file system to a point in time (or, more generally, a given state), i.e., to perform a “restore,” it is only required to walk (use) a single structured data representation (a tree). During a restore, metadata is pulled back from the cloud first, so users can see the existence of needed files immediately. The remainder of the data is then pulled back from the cloud if/when the user goes to open the file. As a result, the entire file system (or any portion thereof) can be restored to a previous time nearly instantaneously. A “fast” restore is performed if an object being restored exists within a “borrow window” of the version from which the system is restoring. A version is pruned from the versioned file system by deleting all objects in the tree (associated with the version) that, at the time of pruning: (i) are not being lent to any other version within the borrow window of the version being pruned, and (ii) are not referenced in any other version whose borrow window is sufficiently large enough such that an object in the version could have been restored from that other version. | 02-02-2012 |
20120089569 | Versioned file system with sharing - A method of data sharing among multiple entities is provided. Each entity exports to a data store a structured data representation comprising a versioned file system local to that entity. The method begins by forming a sharing group that includes two or more entities. Sharing of the structured data representations by members of the sharing group is enabled. The filers use a single distributed lock to protect each version of the file system. This lock is managed to allow each filer access to the shared file system volume to create its new version. To share a fully-versioned file system, asynchronous updates at each of the filers is permitted, and each node is then allowed to “push” its individual changes to the store to form the next version of the file system. A mechanism also may be used to reduce the period during which filers in the group operate under lock. | 04-12-2012 |
20140237008 | Versioned file system using structured data representations - A versioned file system comprises a set of structured data representations. At a first time, an interface creates and exports to a cloud data store a first structured data representation corresponding to a first version of the local file system. The first structured data representation is an XML tree having a root element, one or more directory elements associated with the root element, and one or more file elements associated with a given directory element. Upon a change within the file system, the interface creates and exports a second structured data representation corresponding to a second version of the file system. The second structured data representation differs from the first structured data representation up to and including the root element of the second structured data representation. The interface continues to generate and export the structured data representations to the data store. | 08-21-2014 |
20140324929 | Versioned file system with sharing - A method of data sharing among multiple entities is provided. Each entity exports to a data store a structured data representation comprising a versioned file system local to that entity. The method begins by forming a sharing group that includes two or more entities. Sharing of the structured data representations by members of the sharing group is enabled. | 10-30-2014 |
20150052111 | Method and system for interfacing to cloud storage - An interface between an existing local file system and a data store generates and exports to the data store a versioned file system. The state of the local file system at a given point in time can be determined using the versioned file system. In operation, the interface creates and exports to the data store structured data representations, which correspond to versions of the local file system, as well as actual file system data that these structured data representations represent. A cache associated with the interface stores recently used data and metadata, as well as all write data and metadata waiting to be transferred to the data store. Prior to transfer, one or more data transformations may be applied to the data and metadata. In one embodiment, the data store comprises one or more cloud storage service providers. A content control system is used to configure and manage the interface. | 02-19-2015 |
20150120675 | Versioned file system with fast restore - A versioned file system comprises a set of structured data representations. Each structured data representation corresponds to a version, and each version comprises a tree of write-once objects. Each version in the versioned file system has associated therewith a borrow window. When it is desired to reconstruct the file system to a point in time, i.e., to perform a “restore,” it is only required to walk a single structured data representation. During a restore, metadata is pulled back from the cloud first, so users can see the existence of needed files immediately. The remainder of the data is pulled back from the cloud when the user goes to open the file. As a result, the entire file system is restored to a previous time nearly instantaneously. A fast restore is performed if an object being restored exists within a borrow window of the version from which the system is restoring. | 04-30-2015 |
Patent application number | Description | Published |
20090167291 | Method And Apparatus For Monitoring Voltage In A Meter Network - Methods and systems are provided for monitoring input voltages to meters that are in a wireless metering network. A plurality of entries can be created that include voltage-related information, such as a maximum input voltage or a minimum input voltage. Each meter can further determine whether the input voltage is beyond a predetermined threshold voltage for a duration that might indicate a voltage irregularity in the network. Each meter in the network can be monitored by a collector, which can communicate information to a data collection server. | 07-02-2009 |
20090167558 | OPTIMIZED DATA COLLECTION IN A WIRELESS FIXED NETWORK METERING SYSTEM - Methods and systems regarding an electricity meter in a wireless network are disclosed. The network may comprise a collector and a plurality of electricity meters that measure consumption of electricity and that bi-directionally communicate wirelessly with the collector. The electricity meter may have an established association with at least one battery-powered meter that measures consumption of a commodity other than electricity. The electricity meter may receive information about measured consumption of the other commodity from the battery-powered meter and store the received information. The electricity meter may transmit both information about consumption of electricity measured by the electricity meter and the information about consumption of the other commodity received from the associated battery-powered meter to the collector via the wireless network and also to a remotely located display associated with the electricity meter. | 07-02-2009 |
20090168307 | MECHANICAL PACKAGING APPARATUS AND METHODS FOR AN ELECTRICAL ENERGY METER - An electric meter comprises an electronics housing and a meter base. The electronics housing defines a front panel and includes a first plurality of option board guides. A main meter board is disposed substantially parallel to the front panel. The meter base defines a rear panel of the electric meter. The meter base includes a plurality of housing guides for receiving the electronics housing and a second plurality of option board guides disposed substantially perpendicularly to the rear panel. The second plurality of option board guides are adapted to receive an option board and to position the option board substantially perpendicularly to the main meter board of the electronics housing during assembly of the electronics housing to the meter base. The housing guides in combination with the first and second pluralities of option board guides enable blind assembly of the electronics housing to the meter base. | 07-02-2009 |
20090309756 | Techniques For Limiting Demand From An electricity Meter With An Installed Relay - An electricity meter capable of performing a method for limiting an electricity load in communication with the electricity meter is disclosed. The electricity meter includes at least one load control and the electricity meter has one or more predetermined time-of-use tiers. Each of the one or more predetermined time-of-use tiers has a corresponding time-of-use demand threshold. The method comprises determining a present time-of-use tier; determining a present time-of-use demand for the electricity load in the present time-of-use tier; comparing the present time-of-use demand to the time-of-use demand threshold corresponding to the present time-of-use tier; and setting the at least one load control to a de-energize mode when a de-energize condition is satisfied. The de-energize condition may include sub-conditions such as the present time-of-use demand exceeding the time-of-use demand threshold corresponding to the present time-of-use tier. | 12-17-2009 |
20100195574 | Other Protocol Message Routing Over a Wireless Network of Metering Devices - Methods and apparatus are provided for routing DNP (or other) protocol messages over a network of an advanced metering infrastructure (AMI) system that employs a different communications protocol. | 08-05-2010 |
20110188444 | HIGH PRIORITY DATA READS FOR ACQUISITION OF REAL-TIME DATA IN WIRELESS MESH NETWORK - A wireless mesh network, method, and processor-readable storage medium for operating a network that has a control node that communicates with a plurality of communication nodes are disclosed herein. The control node schedules time-limited sample windows and only collects data that is designated as having a priority, such as voltage data, during those scheduled sample windows. Because the sample window has a defined end point time, the reading software that executes at the head end and that reads data from the collector can follow a known schedule because, by definition, the collector will already be finished collecting priority data when the sample window expires. | 08-04-2011 |
20110188445 | CLEARING REDUNDANT DATA IN WIRELESS MESH NETWORK - A wireless mesh network, method, and processor-readable storage medium for operating a network that has a control node that communicates with a plurality of communication nodes are disclosed. When the control node receives a broadcast message, the control node broadcasts a “clear” message that causes other communication nodes to clear their copies of the broadcast message from their message queues. By clearing redundant copies of the original broadcast message, the network can conserve bandwidth for other network traffic. | 08-04-2011 |
20110188452 | MESH INFRASTRUCTURE UTILIZING ALTERNATIVE COMMUNICATION PATHS - A wireless mesh network, method, and processor-readable storage medium for maintaining both a primary communication path and an alternative communication path for a communication node are disclosed herein. A control node determines an alternative communication path for each node in communication with the control node and stores, for each node, primary communication path information and alternative communication path information. By maintaining both primary and alternative communication path information, the control node can switch from the primary path to the alternative path when a failure in the primary path is detected. Because the control node determines and stores information relating to the alternative path before the failure occurs, switching from the primary path to the alternative path involves little, if any, delay. | 08-04-2011 |
20110188516 | WIRELESS COMMUNICATIONS PROVIDING INTEROPERABILITY BETWEEN DEVICES CAPABLE OF COMMUNICATING AT DIFFERENT DATA RATES - A method, wireless mesh network and processor-readable storage medium for providing interoperability between devices that are capable of communicating at different data rates are disclosed herein. A start-of-frame delimiter token value in a synchronization header is used to indicate a data rate at which a device is capable of communicating. In certain embodiments, samples are collected around a bit transition and are used to adjust a bit timing of a receiving device to match a bit timing of a transmitting device using a coarse adjustment process and, in some embodiments, a fine adjustment process. In this way, compatibility can be maintained between new devices that can communicate at a relatively fast data rate and legacy devices that communicate at a lower data rate. | 08-04-2011 |
20120188093 | TEST MODE SUPPORT FOR METERING ACCURACY TESTS - A metering device may be configured to communicate with other devices on a plurality of metering communication networks. To enable such communications across various networks, the metering communication device may use an active utility identifier corresponding to the metering network in which it is actively communicating. The active utility identifier may be changed to a valid utility identifier corresponding to another metering network and which may be associated with the metering communication device itself. The metering communication device may use the changed active utility identifier to communicate with other devices on the other metering network having the valid utility identifier. For example, the metering communication device may change the active utility identifier to enable communication a test network from a production network, a production network to a test network, or a first test network to a second test network. | 07-26-2012 |
20120201146 | MESH INFRASTRUCTURE UTILIZING PRIORITY REPEATERS AND MULTIPLE TRANSCEIVERS - A wireless mesh network, method, and processor-readable storage medium for using stand-alone repeaters that are designated as having priority over other communication nodes with respect to their service as repeaters are disclosed herein. According to various embodiments, a control node or collector builds a wireless mesh network by first establishing communication paths with the designated priority communication nodes and then with communication nodes that are not designated priority communication nodes. | 08-09-2012 |
20120246268 | Internet Protocol Message Routing Over A Wireless Network Of Metering Devices - Methods and apparatus are provided for routing Internet Protocol (IP) messages over a network of an advanced metering infrastructure (AMI) system that employs a different communications protocol. | 09-27-2012 |
20130010692 | Other Protocol Message Routing Over a Wireless Network of Metering Devices - Methods and apparatus are provided for routing DNP (or other) protocol messages over a network of an advanced metering infrastructure (AMI) system that employs a different communications protocol. | 01-10-2013 |
20130021956 | SYNCHRONIZED COMUNICATION FOR MESH CONNECTED TRANSCEIVER - A wireless mesh network, method, and processor-readable storage medium for operating a network that has a control node that communicates with a plurality of communication nodes, at least one of which comprises a battery-powered communication node, are disclosed. The battery-powered communication node is associated with an electric meter and is configured to maintain time- and frequency synchronization with an electric meter or with the network, to transmit a message, and to listen for a response to the message during a polling period after the message is transmitted. | 01-24-2013 |
20130275736 | GENERIC AND SECURE AMI END DEVICE CONFIGURATION - A metering device may be configured to communicate with other devices on a plurality of metering communication networks, such as an advanced metering infrastructure (AMI) network. For example, a metering end device may be programmed or reconfigured via an AMI network. A metering end device may receive, via the AMI network, a program recipe comprising one or more configuration parameters. The program recipe may be specific to the end device and formatted according to a generic program table of the end device. The end device may decrypt and validate the program recipe. The end device may implement the decrypted program recipe to configure the end device with the one or more configuration parameters. | 10-17-2013 |
20140184424 | TECHNIQUES FOR CLOCK RECOVERY FOLLOWING A POWER OUTAGE - Clock reference data may be recovered or updated in networks that include line-powered devices and other devices susceptible to power outages. For example, for a mobile information collection network, one or more devices with extended clock holdover may be strategically deployed throughout the mobile information collection network to provide reference clock data. As another example, battery-powered devices may be woken up in order to provide clock reference data to other devices. Alternatively or additionally, the battery-powered devices may be configured to periodically broadcast their clock reference data to other devices. | 07-03-2014 |
20140269272 | WIRELESS NETWORK COMMUNICATION NODES WITH OPT OUT CAPABILITY - Techniques are disclosed herein for providing wireless network communication nodes with opt-out capabilities. Such capabilities may, for example, allow particular customers to opt out of a typical full-scale communication mode such that their associated equipment operates at least temporarily in a limited communication mode. The limited communication mode may limit customer exposure to emissions resulting from RF communications near their homes or other areas, which may be attractive to customers such as those with health or other emission-related concerns. | 09-18-2014 |
20140327449 | ELECTRICITY METER HOT SOCKET DETECTION - When a poor meter to socket connection occurs, there is the potential for arcing to develop which can result in a hot socket and a fire. Disclosed herein are methods for a meter to detect the occurrence of an arc condition in the socket by analyzing the RF noise on the channels of the communication spectrum used by the meter to communicate within its metering system. For example, by keeping a record of the normal background noise and looking for a broadband increase in the noise on all channels, arc detection can be achieved. Meter quantities such as temperature, current, voltage, and harmonic content may also be used in a standalone manner or in combination with broadband RF noise to detect an arc condition. A disconnect switch within the meter can be opened to remove the arc fault. | 11-06-2014 |
20160112090 | SYNCHRONOUS FREQUENCY HOPPING SPREAD SPECTRUM METHOD FOR MESH NETWORKS - Synchronous FHSS networks operating within mesh networks typically require a certain amount of network traffic to maintain time as well as for executing other functions, such as registration and neighbor discovery. The concepts presented in this disclosure provide a mesh network with enhanced communication capabilities without adding significant hardware or firmware costs to nodes within the network. The disclosed concept of using acquisition channels (frequencies) integrated within FHSS pseudo-random sequences speeds network responses to conditions like outage and restoration. Assignment of unique hop sequences by hop level or at time of manufacture can guarantee minimal network contention while minimizing system network traffic. | 04-21-2016 |