Patent application number | Description | Published |
20080232347 | Determining rerouting information for single-node failure recovery in an internet protocol network - For a survivable portion of a network, a backup port for a first router of the survivable network, to reach a destination node in the event of a single node failure, may be determined by (a) accepting a routing path graph having the destination node, wherein the routing path graph includes one or more links terminated by one or more primary ports of the first router; and (b) for each router of at least a part of the routing path graph, (1) assuming that the current router is removed, defining (A) a first part of the routing path graph including the destination node, and (B) a second part of the routing path graph separated from the first part wherein the second part defines one or more sub-graphs, and (2) determining the backup port for the first router by examining at least one of the one or more sub-graphs to find a link to the first part of the routing path graph. | 09-25-2008 |
20100202460 | MAINTAINING PACKET SEQUENCE USING CELL FLOW CONTROL - Packets out-of-sequence problem can be solved by using a window flow control scheme that can dispatch traffic at the cell level, in a round robin fashion, as evenly as possible. Each VOQ at the input port has a sequence head pointer that is used to assign sequence numbers (SN) to the cells. Also a sequence tail pointer is available at each VOQ that is used to acknowledge and limit the amount of cells that can be sent to the output ports based on the window size of the scheme. Each VIQ at the output port has a sequence pointer or sequence number (SN) pointer that indicates to the VIQ which cell to wait for. Once the VIQ receives the cell that the SN pointer indicated, the output port sends an ACK packet back to the input port. By using sequence numbers and the relevant pointers, the packet out-of-sequence problem is solved. | 08-12-2010 |
20110093484 | CONFIGURING STATE MACHINES USED TO ORDER AND SELECT MATCHING OPERATIONS FOR DETERMINING WHETHER AN INPUT STRING MATCHES ANY OF AT LEAST ONE REGULAR EXPRESSION USING LOOKAHEAD FINITE AUTOMATA BASED REGULAR EXPRESSION DETECTION - State machines used to order and select matching operations for determining whether an input string matches any of at least one regular expression are configured by ( | 04-21-2011 |
20110093496 | DETERMINING WHETHER AN INPUT STRING MATCHES AT LEAST ONE REGULAR EXPRESSION USING LOOKAHEAD FINITE AUTOMATA BASED REGULAR EXPRESSION DETECTION - Previously configured state machines may accept an input string, and for each of the regular expression(s), check for a match between the input string accepted and the given regular expression using the configured nodes of the state machine corresponding to the given regular expression. Checking for a match between the input string accepted and the given regular expression using configured nodes of a state machine corresponding to the given regular expression by using the configured nodes of the state machine may include (1) checking detection events from a simple string detector, (2) submitting queries to identified modules of a variable string detector, and (3) receiving detection events from the identified modules of the variable string detector. | 04-21-2011 |
20110128959 | HASH-BASED PREFIX-COMPRESSED TRIE FOR IP ROUTE LOOKUP - A method and apparatus for performing an Internet Protocol (IP) network lookup in a forwarding device including an internal processor memory storing a first next hop information table and membership query information, and an external processor memory storing a plurality of prefix-compressed trees and a second next hop information table is described. In another embodiment consistent with present invention, a method (and apparatus) for creating stored data structures representing network forwarding information used for network route lookup is described. | 06-02-2011 |
20110128960 | HASH-BASED PREFIX-COMPRESSED TRIE FOR IP ROUTE LOOKUP - A method and apparatus for updating stored data structures representing network forwarding information used for network route lookup is described. By making sure there is only one level of dependency between data structures storing forwarding information, these data structures may be updated quickly and with minimal overhead | 06-02-2011 |
20150326426 | PARTIAL SOFTWARE DEFINED NETWORK SWITCH REPLACEMENT IN IP NETWORKS - The claimed subject matter is directed to novel methods and systems for a network topology wherein an IP network is partially integrated and enhanced with a relatively small number of SDN-OF enabled network devices to provide a resilient network that is able to quickly recover from a network failure and achieves post-recovery load balancing while minimizing cost and complexity. By combining SDN-OF enabled switches with traditional IP nodes such as routers, a novel network architecture and methods are described herein that allows for ultra-fast and load balancing-aware failure recovery of the data network. | 11-12-2015 |
20160119255 | Partial Software Defined Network Switch Replacement in IP Networks - The claimed subject matter is directed to novel methods and systems for a network topology wherein an Internet Protocol (IP) network is partially integrated and enhanced with a relatively small number of Software Defined Network (SDN)-Openflow (SDN-OF) enabled network devices to provide a resilient network that is able to quickly recover from a network failure and achieves post-recovery load balancing while minimizing cost and complexity. The SDN-OF Controller, or a management node, determines such a minimum set of SDN-OF enabled devices and establishes IP tunnels to route traffic from nodes affected by failure to designated SDN-OF switches and finally to the final destination without looping back to the failed link or node. By combining SDN-OF enabled switches with IP nodes such as routers, a novel network architecture and methods are described herein that allows for ultra-fast and load balancing-aware failure recovery of the data network. | 04-28-2016 |