Abstract: Short messages are formatted as control messages in a communication network but do not control the communication network. Techniques for dynamically distributing short messages include remotely reprogramming a control node that processes control messages for the communications network to change processing of short messages without further involvement by a vendor of the control node. In some embodiments, this involves sending provider data that includes a special parameter set, a special value set, and a special action set. The special parameter set includes at least one parameter among multiple parameters in multiple network protocol headers for a data packet that includes a short message. The special value set includes at least one value for each parameter in the special parameter set. The special action set includes at least one action of multiple actions for forwarding a short message.

Abstract: Techniques for dynamically distributing short messages include storing action data and parameter data. Action data indicates actions for forwarding a short message and includes an action to bypass a short message service center (SMSC). Parameter data indicates parameters in network protocol headers for a short message. Provider input data is received that indicates a special value set and a special action set. The special value set includes a value for a corresponding special parameter set that includes a parameter from the parameter data. The special action set includes an action to be performed if an actual value set matches the special value set. When a particular short message is received, it is determined whether an actual value set based on the particular short message matches the special value set. If so, then the short message is processed according to the special action set.

Abstract: A mechanism limits the flow of topology information to only those nodes of a computer network that require the information. The mechanism comprises a filter having a plurality of conditions that are evaluated by a node of the network prior to forwarding the topology information to another node. Specifically, the conditions are evaluated with respect to lists of nodes that are defined according to the configuration of the network. By applying the filtering conditions to the defined lists, each node may selectively propagate the topology information throughout the network, thereby substantially reducing the amount of information flowing over the network.