Patent application number | Description | Published |
20080201403 | Maintaning a View of a Cluster's Membership - A method for maintaining a current view of a cluster's membership comprising the steps of maintaining a list of member nodes and updating the list when a modification thereto is noticed by a first node by receiving a first update message from the first node in a second node, thereafter, sending a second update message from the second node to a third node to propagate the modification and sending to the first node a first confirm message from the second or the third node. A node member of a cluster capable of maintaining a first list of neighboring nodes, maintaining a second list of neighboring nodes sharing a current view therewith and ensuring that the first list matches the second by exchanging messages with neighboring nodes, wherein each message comprises topology information. Upon confirmation that both lists match, the node being capable of sending a confirmation message toward neighboring nodes. | 08-21-2008 |
20090031394 | METHODS AND SYSTEMS FOR INTER-RESOURCE MANAGEMENT SERVICE TYPE DESCRIPTIONS - Communication nodes, systems and methods are described which provide access screening for services based upon service type description information and policy criteria information associated with an access network. If a requested service is, e.g., banned due to regulatory policies in a geographic region associated with a particular access network, then the requested service shall be denied even if the user has a valid subscription to such requested service via another access network. | 01-29-2009 |
20090154366 | EXCHANGE OF PROCESSING METRIC INFORMATION BETWEEN NODES - Method and nodes are provided for propagating between the nodes information about processing capacity of peer nodes. Two types of signals are sent from propagating nodes towards their peer nodes. A propagating node sends first signal type at a constant rate and a second signal type at a variable rate. A ratio of the rates calculated at a peer node represents the processing capacity available a propagating node. Sequence numbers may be added to signals of the first and second type in order to assist peer nodes in detecting capacity issues. | 06-18-2009 |
20090164782 | METHOD AND APPARATUS FOR AUTHENTICATION OF SERVICE APPLICATION PROCESSES IN HIGH AVAILABILITY CLUSTERS - A method and communication node that for generate a unique service application process biometric identifier for a service application service application process requesting resources and services to another service application service application process in a High Availability (HA) cluster. The method and communication node further authenticate the requesting service application service application process using the unique service application process biometric identifier and thus allowing communication between the first service application process and the second service application process. | 06-25-2009 |
20090190758 | Method and Apparatus for Authentication Service Application Processes During Service Reallocation in High Availability Clusters - A method and communication node for providing secure communications and services in a High Availability (HA) cluster. The communication node comprises an Operating System (OS) that detects an unavailability of a first service application process and switches a second service application process from the first state to the second state, the second service application being selected for taking over service currently provided from the first service application process, the first state and the second state each being associated to a set of rights in the cluster. The OS generates a private key for the second service application process based on its second state. The set of rights associated to the second state allows the OS to replace the first service application process with the second service application process for providing secure communications between the second service application and other service application processes in the HA cluster. | 07-30-2009 |
20090216953 | METHODS AND SYSTEMS FOR DYNAMIC CACHE PARTITIONING FOR DISTRIBUTED APPLICATIONS OPERATING ON MULTIPROCESSOR ARCHITECTURES - Software, systems and methods are described which provide cache management capabilities. The number of cache sets to be used in each partition of the cache memory space is based on a number of cache pages in each partition and an associativity level associated with the set associative cache. The cache sets can be numbered based on the partition number, a total number of partitions and a cache page index. Cache management according to these exemplary embodiments reduces problems associated with cache trashing in multiprocessor environments sharing common data structures in set associative caches. | 08-27-2009 |
20100002697 | OPTIMAL FRAGMENTATION OF MULTICAST PACKETS - Methods, a data source and a router are provided to fragment packets that are to be sent in multicast mode towards a plurality of destinations comprised in a multicast group. Each router along a path leading from the data source towards some of the destinations sends its maximum transmission unit value in an uplink direction. Each router directly connected to the data source calculates a lowest maximum transmission unit based on various maximum transmission unit values received from downstream routers. The data source receives from each of the directly connected routers a maximum transmission unit value, which is certain to be acceptable to all routers and destinations of the multicast group downstream of that directly connected router. The data source selects a lowest one of the received maximum transmission unit values and fragments data contents accordingly. | 01-07-2010 |
20100011165 | CACHE MANAGEMENT SYSTEMS AND METHODS - A multi mode cache system that uses a direct mapped cache scheme for some addresses and an associative cache scheme for other addresses. | 01-14-2010 |
20130311495 | Apparatus and Method for Parallel Regular Expression Matching - A regular expression matching hardware implementation comprises two tightly coupled hardware engines. A regex engine performs state transitions and accepts (as matching) or rejects (as not matching) an input string. The regex engine takes also care of the logic of the operators and deals with the complexity of the state machine. A lookup engine reads characters from an input (e.g., tape, memory, network packets, or the like), and provides them to the regex engine. A preprocessing procedure transforms a regular expression into a regex state transition table and a lookup table, for use by the regex engine and lookup engine, respectively. The two hardware engines are synchronized by a global state machine. The regex engine advances the state machine, and the lookup engine reads it. | 11-21-2013 |