Tekelec

Netapp, Inc.

John Hildebrand

Robert J Delaney

Peter Joseph Marsico

Santosh Ananth Rao

John Meneghini

Jonathan James Palmer

Frederick Knight

Geoffrey Stewart Brown

Paul H Hardin, Sr

James Arnold Young

Nathan Baker

Techniques to managing non-disruptive SAN availability in a partitioned cluster comprising one or more components configured to determine whether to separate a cluster into two or more partitions, notify one or more responsive cluster nodes to separate the cluster into a first partition and a second partition, update one or more access states, notify the host that access states of one or more network paths has been updated, and provide the one or more access states. Other embodiments are described and claimed.

Techniques to manage non-disruptive SAN availability in a partitioned cluster

Methods, systems, and computer program products for multicast compression and pacing are disclosed. In one method, messages relating to events that affect or require use of a database maintained by multiple processing modules in a distributed processing system are received. The messages are buffered and placed in a third message in a manner that preserves time ordering of the messages. The packed message is then multicast to the processing modules. Each processing module processes messages that are addressed to it. A method for pacing multicast messages destined for the processing modules is also provided.

Methods, systems, and computer program products for multicast compression and pacing of database update messages transmitted between processing modules in a distributed processing system

Methods, systems, and computer program products for reducing the likelihood of signaling link congestion on a failing or recovering signaling linkset are disclosed. According to one aspect, a method for reducing or eliminating congestion on a recovered link in a previously failed linkset due to the routing of post-global title (GT) translated signaling message traffic is disclosed. When the first link in a previously failed linkset becomes available, routes associated with the recovering linkset are marked as restricted. GT translated messages are directed to the lowest cost route that is marked as allowed. If no routes are marked as allowed, messages are directed to the lowest cost route that is marked as restricted. When a predetermined number or percentage of the links in a linkset become available, routes associated with the recovering linkset are marked as allowed.

Methods, systems, and computer program products for reducing signaling link congestion

Methods and systems for providing enhanced network security for network management messages and subsystem management messages are disclosed. A network security function receives a network or subsystem management message from a first location in a network. The network security function determines whether one or more predetermined parameters in the network management message are not associated with the originating location. In response to determining that are not associated with the originating location, a network security action, such as discarding the message and/or notifying a network operator, is performed.

Methods and systems for enhancing network security in a telecommunications signaling network

Methods and systems for distributing signaling messages among multiple processors for stateful processing and/or sequenced processing of the messages on a per sequence basis are disclosed. A signaling message is received and it is determined whether the signaling message requires stateful and/or sequenced processing. If the signaling message requires stateful and/or sequenced processing, a sequence identifier is computed for the signaling message. The sequence identifier is unique on a per sequence basis. The sequence identifier is then used to distribute the signaling message to an application processor for stateful and/or sequenced processing.

Methods and systems for distributing signaling messages among multiple processors for stateful and/or sequenced processing of the messages on a per-sequence basis

Growing community of inventors

Hillsborough, NC, United States of America

John Hildebrand