Abstract: A method for identifying a particular component of an electronic system that accesses a resource of the electronic system using electronic security value units is described. First, electronic security value units are selectively distributing to a plurality of components, such as to a client, of the electronic system. Next, a unique first association is created with each individual component to which the security electronic security value units are distributed. Further, upon a particular access to a resource, a unique second association is created between particular ones of security electronic security value units and the particular access to the resource. In addition, the unique second association is analyzed to determine which particular security electronic security value units were used to access the particular resource. Then, the first association of the particular security electronic security value units is analyzed to determine the identity of the component which accessed the resource.

Abstract: A method, system and computer product for determining the source of problems in a Radio Frequency Identification (RFID) network containing a plurality of component are disclosed. The method comprises the steps of representing selected ones of the plurality of components, providing a mapping between a plurality of observable events and a plurality of causing events occurring in components, wherein the observable events are at least associated with each of the at least one components, and determining at least one likely causing event based on at least one of the plurality of observable events by determining a measure between each of a plurality of values associated with the plurality of observable events and the plurality of causing events.

Abstract: A method and apparatus for logically representing and performing an analysis on a Storage Area Network (SAN) is disclosed. The method comprising the steps representing selected ones of a plurality of components and the relationship among the components associated with the SAN, providing a mapping between a plurality events and a plurality of observable events occurring among the components, wherein the mapping is represented as a value associating each event with each observable event, and performing the system analysis based on the mapping of events and observable events. In another aspect of the invention, a method and apparatus are disclosed for representing and performing an analysis on a SAN wherein the SAN is included in a larger system logically represented as a plurality of domains is disclosed.

Abstract: A network utilizes electronic security value units to prevent unauthorized access to resources in the network. The network includes at least a resource manager and an electronic bank server (e.g., the local resource bank). The resource manager determine a pricing strategy in electronic security value units for a group of one or more resources in the network. The electronic bank server selectively distributing electronic security value units to a client in the network, where the electronic security value units are unique to a group of one or more resources. Accordingly, access to a resource in the group, by the client, is determined by at least the above pricing strategy and by an amount of electronic security value units distributed to the client.

Abstract: A method and apparatus for determining causality mapping between causing events and detectable events among a plurality of nodes in a distributed system is disclosed. The method comprises the steps of automatically generating a causality mapping model of the dependences between causing events at the nodes of the distributed system and the detectable events in a subset of the nodes, the model suitable for representing the execution of at least one system operation. In one aspect the generation is perform by selecting nodes associated with each of the detectable events from the subset of the nodes and indicating the dependency between a causing event and at least one detectable event for each causing event at a node when the causing event node is a known distance from at least one node selected from the selected nodes.

Abstract: A method and apparatus for determining the number and location of monitoring entities in a distributed system is disclosed. The method comprising the steps of automatically generating a causality mapping model of the dependences between causing events at the nodes of the distributed system and the detectable events associated with a subset of the nodes, the model suitable for representing the execution of at least one system operation, reducing the number of detectable events in the model, wherein the reduced number of detectable events is suitable for substantially representing the execution of the at least one system operation; and placing at least one of the at least one monitoring entities at selected ones of the nodes associated with the detectable events in the reduced model. In another aspect, the processing described herein is in the form of a computer-readable medium suitable for providing instruction to a computer or processing system for executing the processing claimed.

Abstract: DART dynamically assigns addresses to Nodes according to their relative location within the network. When a Node joins or moves the network, or a Link or Node fails addresses are dynamically updated. If some Nodes are mobile (either clients or servers) the ability to route to and from the mobile Node persists. Link failures, caused by movement, or otherwise, can be similarly accommodated.

Abstract: DART dynamically assigns addresses to Nodes according to their relative location within the network. When a Node joins or moves the network, or a Link or Node fails addresses are dynamically updated. If some Nodes are mobile (either clients or servers) the ability to route to and from the mobile Node persists. Link failures, caused by movement, or otherwise, can be similarly accommodated.

Abstract: DART dynamically assigns addresses to Nodes according to their relative location within the network. When a Node joins or moves the network, or a Link or Node fails addresses are dynamically updated. If some Nodes are mobile (either clients or servers) the ability to route to and from the mobile Node persists. Link failures, caused by movement, or otherwise, can be similarly accommodated.

Abstract: DART dynamically assigns addresses to Nodes according to their relative location within the network. When a Node joins or moves the network, or a Link or Node fails addresses are dynamically updated. If some Nodes are mobile (either clients or servers) the ability to route to and from the mobile Node persists. Link failures, caused by movement, or otherwise, can be similarly accommodated.

Abstract: DART dynamically assigns addresses to Nodes according to their relative location within the network. When a Node joins or moves the network, or a Link or Node fails addresses are dynamically updated. If some Nodes are mobile (either clients or servers) the ability to route to and from the mobile Node persists. Link failures, caused by movement, or otherwise, can be similarly accommodated.

Abstract: In a switched network wherein a multiplicity of switching nodes are interconnected with communications links, communications traffic within the network is switched according to different routing trees each associated with a switching node as the destination node. The routing tree specifies a subset of incoming links from which each node receives the traffic and an outgoing link to which the node transfers the received traffic. Each switching node allocates time bands for implementing the different routing trees one at a time. However, nonoverlapping routing trees which share no common link can be implemented at the same time to increase the traffic throughput.