264 results about "Node level" patented technology

A method is provided for sending data in a wireless ad-hoc network including a plurality of nodes grouped into clusters of nodes and a plurality of wireless links connecting the plurality of nodes, where each cluster node has a designated cluster leader node. The method may include sending a cluster-level route request from a source node of a source cluster to a cluster leader node of the source cluster, and determining a cluster-level route between the source cluster and a destination cluster including a destination node responsive to the cluster-level route request and using a plurality of the cluster leader nodes. Furthermore, at least one cluster target node may be designated in a cluster along the cluster-level route, and a node-level route determined from the source node to the destination node including the at least one cluster target node. In addition, the method may also include generating a mission data packet for transferring the data.

A computing method includes accepting a notification of a computing task for execution by a group of compute nodes interconnected by a communication network, which has a given interconnection topology and includes network switching elements. A set of preferred paths, which connect the compute nodes in the group via at least a subset of the network switching elements to one or more root switching elements, are identified in the communication network based on the given interconnection topology and on a criterion derived from the computing task. The network switching elements in the subset are configured to forward node-level results of the computing task produced by the compute nodes in the group to the root switching elements over the preferred paths, so as to cause the root switching elements to calculate and output an end result of the computing task based on the node-level results.

A “peer-to-peer” hierarchical routing protocol—also referred to as Zone-based Hierarchical Link State Routing protocol (or “ZHLS”)—which incorporates location information into a novel “peer-to-peer” hierarchical routing approach. The network may be divided into non-overlapping zones. Aggregating nodes into zones conceals the detail of the network topology. Initially, each node knows its own position and therefore zone ID through a position determination unit, such as a Global Positioning System (GPS). After the network is established, each node knows the low level (node level) topology about node connectivity within its zone and the high level (zone level) topology about zone connectivity of the whole network. A packet may be forwarded by specifying the hierarchical address—zone ID and node ID—of a destination node in the packet header.

A system and method for diagnosing faults in a communication network using a distributed alarm correlation system. The alarm correlation system may include node-level alarm correlation tools (ACTs) located at nodes in the network to provide node-level alarm correlation producing node-level correlation results. The node-level ACTs may share diagnostic knowledge with other node-level alarm correlation tools at other nodes. Each of the node-level ACTs may also share the diagnostic knowledge and the node-level correlation results with a higher-level ACT. The higher-level ACT may provide higher-level alarm correlation to produce higher-level correlation results.

Systems and methods are disclosed for providing security for a communities framework in a collaborative computing environment. A community can be provided for maintaining user membership during collaboration. The community can contain various collaboration resources, community services and members having access to the resources and services. A first layer of security can be implemented via membership and functional capabilities. Members can be assigned to various membership capabilities and these membership capabilities can be mapped to functional capabilities in order to control access to the resources by the various members. A second layer of security can be implemented via entitlements and security policies applied to the content repository. Entitlements can be applied at a node level of a content repository. Each node can be evaluated when operations are requested for it.

A cooling apparatus and method are provided for cooling one or more electronic components of an electronic subsystem of an electronics rack. The cooling apparatus includes a heat sink, which is configured to couple to an electronic component, and which includes a coolant-carrying channel for coolant to flow therethrough. The coolant provides two-phase cooling to the electronic component, and is discharged from the heat sink as coolant exhaust which comprises coolant vapor to be condensed. The cooling apparatus further includes a node-level condensation module, associated with the electronic subsystem, and coupled in fluid communication with the heat sink to receive the coolant exhaust from the heat sink. The condensation module is liquid-cooled, and facilitates condensing of the coolant vapor in the coolant exhaust. A controller automatically controls the liquid-cooling of the heat sink and/or the liquid-cooling of the node-level condensation module.

An architecture for a distributed data processing system comprises a system-level service processor along with one or more node-level service processors; each are uniquely associated with a node, and each is extended to comprise any components that are necessary for operating the nodes as trusted platforms, such as a TPM and a CRTM in accordance with the security model of the Trusted Computing Group. These node-level service processors then inter-operate with the system-level service processor, which also contains any components that are necessary for operating the system as a whole as a trusted platform. A TPM within the system-level service processor aggregates integrity metrics that are gathered by the node-level service processors, thereafter reporting integrity metrics as requested, e.g., to a hypervisor, thereby allowing a large distributed data processing system to be validated as a trusted computing environment while allowing its highly parallelized initialization process to proceed.

A computer-implemented method enables rack-level predictive power capping and power budget allocation to processing nodes in a rack-based IHS. A rack-level management controller receives node-level power-usage data and settings from several block controllers, including current power consumption and an initial power budget for each node. A power consumption profile is generated based on the power-usage data for each node. A total available system power of the IHS is identified. A system power cap is determined based on the power consumption profiles and the total available system power. A current power budget is determined for each node based on an analysis of at least one of the power consumption profile, the initial power budget, the current power consumption, the system power cap, and the total available system power. A power subsystem regulates power budgeted and supplied to each node based on the power consumption profiles and the system power cap.

In a server a source document is represented as a source document object model (13). For delivery of the source document to a user device such as a mobile phone the server dynamically selects transformation maps (10) and merges them to provide a compound map (12). The maps (10) are selected according to characteristics of the delivery channel and of the user device. The source DOM (13) is then transformed into a target DOM (14) in a single pass. Each node of the source DOM (13) self-transforms using the map rules. At the node level the transformation may change node attributes and/or node-to-node relationships.

The distributed computing backup and recovery (DCBR) system and method provide backup and recovery for distributed computing models (e.g., NoSQL). The DCBR system extends the protections from server node-level failure and introduces persistence in time so that the evolving data set may be stored and recovered to a past point in time. The DCBR system, instead of performing backup and recovery for an entire dataset, may be configured to apply to a subset of data. Instead of keeping or recovering snapshots of the entire dataset which requires the entire cluster, the DCBR system identifies the particular nodes and/or archive files where the dataset resides so that backup or recovery may be done with a much smaller number of nodes.

A database query is received that includes a logical query indicator at a distributed database node within a distributed network of databases. The logical query indicator includes at least one physical database query and at least one database node identifier that allows at least one distributed database node to identify at least one physical database to execute the physical database query against. It is determined that the at least one database node identifier matches a local node identifier. The at least one physical database query is executed against at least one local physical database table. A local query response is formed including data retrieved from the at least one local physical database table. The database query is responded to with at least the local query response. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

Provided method includes receiving, from the source AN, a handover request requesting a handover of an AN of the user equipment, wherein the user equipment is configured with a per node level tunnel for connection to a target user plane function node, and wherein the per node level tunnel is a common connection tunnel which is generated in the node unit for all traffics between the target AN and the target user plane function node, determining whether a service provision through the per node level tunnel is possible, determining whether generation of a new per node level tunnel for the user equipment is necessary when it is determined that service provision is impossible, and generating the new per node level tunnel for the user equipment based on a result of the determination or changing the tunnel model of the user equipment to a different tunnel model.

The invention relates to a network node evaluating method, with multi chains relations of the nodes recursively deciding the level of each webpage. The level of each node is the sum of entry chain positive weight and weighting of the source node, or the sum of negative weighting and the target node level, or the sum its commonly quoted relationship weight and the common quotation relationship node level, or the sum of common index relationship weight and the level of the common index relationship node, or further sum of the four kinds of the weighting sum. Network node can be webpage, or super webpage representing the chain relationship of all the said web pages. The evaluating result of this invention can provide even more holistic and accurate reflection of the quality, importance and authority of the nodes, with good stability, and better effect of anti plagiary. It can provide better technical result for sequencing the result of the webpage searching, website classification, and search result sequence.

A method for configuring nanoscale neural network circuits using molecular-junction-nanowire crossbars, and nanoscale neural networks produced by this method. Summing of weighted inputs within a neural-network node is implemented using variable-resistance resistors selectively configured at molecular-junction-nanowire-crossbar junctions. Thresholding functions for neural network nodes are implemented using pFET and nFET components selectively configured at molecular-junction-nanowire-crossbar junctions to provide an inverter. The output of one level of neural network nodes is directed, through selectively configured connections, to the resistor elements of a second level of neural network nodes via circuits created in the molecular-junction-nanowire crossbar. An arbitrary number of inputs, outputs, neural network node levels, nodes, weighting functions, and thresholding functions for any desired neural network are readily obtained by the methods of the present invention.

A computer-implemented method dynamically limits peak power consumption in processing nodes of an IHS. A power management micro-controller receives processing node-level power-usage and workload data from several node controllers, including current power consumption and a current workload, for each processing node within the IHS. A total available system power of the IHS is identified including a peak power output capacity and a sustained output power capacity. At least one node peak power threshold is determined based on the power-usage and workload data for each of the processing nodes. The node controllers are triggered to determine and set a device peak power limit for each of several variable performance devices within each of the processing nodes based on the node peak power threshold, wherein each of the variable performance devices dynamically adjusts a value of a corresponding device performance metric based on the device peak power limit.

The invention provides a cache policy based on match of content popularity and a node level. The cache policy is applied to a content center wireless network and realizes the match of the content popularity and the node level. Firstly, the cache performance of each node on a forwarding path is evaluated, the cache performance of the node is comprehensively evaluated from three parameters, namely the hops of the node from a user, the betweenness centrality and the replacement rate, wherein a gray correlation method is selected to assess and classify the nodes at the same time. Then, based on the matching probability of the content popularity and the node level, the node makes a cache decision on the content. By adopting the method, the cache space in the content center network is effectively utilized, so that the cache redundancy is reduced.

The invention generally relates to the technical field of network communication, and particularly relates to a method for routing an underwater sensor network. The method for routing comprises the following constituent parts: (1) node grade definition; (2) node grade information acquiring and updating processes; (3) neighbor node information recording; (4) directional flooding mechanism based on grade difference; (5) adaptive routing step based on the grade difference, node density and residual energy; and (6) differential geographical routing step based on the grade difference and distance. The method has the following advantages that the best next hop adaptive routing is determined on the basis of the neighbor table information to reduce redundant paths, so that the energy efficiency is improved to a great extent; and the adaptive routing adopts immediate routing, so that the inhibition time of the conventional underwater UWSN (underwater wireless sensor network) routing to a received package is avoided, and the time delay from terminal to terminal is reduced. A great deal of simulation experiments prove that through an underwater sensor network adaptive routing protocol based on the difference, the energy consumption can be reduced to a great extent, the time delay from terminal to terminal is reduced, the node utilization equity is improved, and the whole network life time is prolonged.

Dynamic television audience measurement systems (AMS) and methods are disclosed. The system comprises a central level AMS sub-system, a local node level AMS sub-system, a plurality of client level AMS sub-systems, and a plurality of display devices, each monitored by a client level AMS sub-system. The central level AMS sub-system receives panel definitions from panel requestors and transmits the panel definitions to and receives a merged viewership report from the local node level AMS sub-system. The local node level AMS sub-system receives panel definitions from and transmits the merged viewership report to the central level AMS sub-system, transmits the panel definitions to and receives viewership reports from the plurality of client level AMS sub-systems, and merges the viewership reports into the merged viewership report. Each client level AMS sub-systems receives panel definitions from and transmits the viewership report to the local node level AMS sub-system and compiles the viewership report.

In connection with the mining of time-evolving data streams, a general framework that mines changes and reconstructs models from a data stream with unlabeled instances or a limited number of labeled instances. In particular, there are defined herein statistical profiling methods that extend a classification tree in order to guess the percentage of drifts in the data stream without any labelled data. Exact error can be estimated by actively sampling a small number of true labels. If the estimated error is significantly higher than empirical expectations, there preferably re-sampled a small number of true labels to reconstruct the decision tree from the leaf node level.

The invention discloses a redundancy management method for improving the availability of a monitoring pair based fault tolerant system. The method comprises the steps of intra-node voting and monitoring and node-level voting and monitoring. During the intra-node voting and monitoring, a controller A and a controller B are consistent by comparison and data of the controller A are selected to enter the node-level voting and monitoring. During the node-level voting and monitoring, a mid-value is selected as a reference value of monitoring from values of three signals of three nodes, and if a difference between other two non mid-value signals and a mid-value signal is within a threshold range, then the non mid-value signals are normal, otherwise, the non mid-value signals are faulted. According to the redundancy management method, the redundancy management of a monitoring pair based three-node or two-node fault tolerant computer is realized; the credibility of system data of a fault tolerant computer system can be ensured; and compared with fault silence based monitoring pair fault tolerance, the redundancy degradation of the system is slowed down, and a backup controller can be reconfigured to be a main controller when a fault occurs once in a node through a software and hardware combination mode, so that the system is ensured not to be degraded.