An automatic restoration scheme for switch-based networks

International audienceThis paper presents a fully automated distributed resilient routing scheme for switch-based or new generation router based networks. The failure treatment is done locally and other nodes in the network do not need to undertake special actions. In contrast to conventional IP routing schemes, each node routes the traffic on the basis of the entering arc and of the destination. The resulting constraint is that two flows to the same destination entering in a node by a common arc have to merge after this arc. It is shown that this is sufficient for dealing with all single link failure situations, assuming that the network is symmetric and two-link connected. Two heuristic approaches are proposed to handle the corresponding dimensioning problem for large network instances. The proposed method generalizes some methods of literature [6], [8] and provides more cost-efficient solutions

Method and device for the processing of data packets

Method of configuring a Trie-type associative memory for the processing of data packets on the basis of a set of rules, the Trie memory being used for the analysis of binary strings situated at defined locations in each data packet, each rule assigning an action (110-114) to a packet on the basis of the values of the said binary strings, the Trie memory including registers made up of a defined number of individual cells for receiving respective references, the method comprising the following stages:a-for each of the said locations, consecutive elementary intervals are defined covering binary-string values possibly appearing at the said location...(extract of claims