Abstract: An apparatus and method is described for computing repair path information around a failure component in a data communications network having a components nodes and links therebetween. Where, according to a routing protocol, a node sends to a neighbor node a metric indicative of reachability of a destination node, the protocol requiring differentiated action by the node if the route to the destination node includes the neighbor node, the apparatus is arranged to compute a repair path to the destination node via candidate nodes comprising only neighbor nodes to the apparatus not requiring differentiated action relative to the apparatus.

Abstract: A method is described of constructing a transition route in a data communication network having as components nodes and links. Upon receipt of a transition notification identifying a first component a non-neighboring node constructs a transition route around the first component.

Abstract: A method of forwarding data in a data communications network comprising a plurality of nodes comprises the step of forwarding data according to a forwarding strategy implemented at a forwarding node. Where the implemented strategy comprises a repair strategy to compensate for a change in the network, the method further comprises the step of encapsulating the data in a primary repair encapsulating packet and marking the primary repairing encapsulating packet as repaired.

Abstract: Methods and apparatus are disclosed for mapping prefixes and/or values of a hierarchical space to other representations while maintaining the original hierarchy, which may be especially useful in conjunction with associative memories, such as binary and ternary content-addressable memories. In one implementation, a set of prefixes associated with a hierarchical space is received. A new representation of the set of prefixes is developed, such as by using a trie representation, with the new representation maintaining the original hierarchical relationship. This new representation may be an optimized representation selected to reduce or minimize the depth of the trie or some other cost. A set of new prefixes are generated along with a set of lookup values. During processing, a value, such as that included in a packet, is converted to one of the lookup values, which is used to generate a lookup word for use in matching against the new prefixes.

Abstract: In a broadcasting network, programs are distributed to targeted customer premises equipment. A first program source generates first segments of the program, the first segments having a first identified content. A second program source generates second segments of the program, the second segments having a second identified content. Some of the second segments are generated concurrently to have different second identified content. The segments are transported over the network to the customer premises equipment. While being transported, the segments are selectively merged to form the program. The program having temporally adjacent segments. The signals of the merged first and second segments are synchronized to a common time base, and the selection is responsive to identities of the first and second identified content of the program, and demographics of the network and customer premises equipment.