Abstract: Aspects of the subject disclosure may include, for example, a virtual processing system initiating a first streaming session with a content streaming server to receive content data, creating a first transport connection with a viewer streaming the content data in a second streaming session with the content streaming server by imitating a transport connection of the content streaming server with the viewer, creating a second transport connection with the content streaming server by imitating a transport connection of the viewer with the content streaming server, splitting the first streaming session between the content streaming server and the viewer, and streaming the content data to the viewer. Other embodiments are disclosed.

Abstract: 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.

Abstract: Aspects of the subject disclosure may include, for example, a virtual processing system initiating a first streaming session with a content streaming server to receive content data, creating a first transport connection with a viewer streaming the content data in a second streaming session with the content streaming server by imitating a transport connection of the content streaming server with the viewer, creating a second transport connection with the content streaming server by imitating a transport connection of the viewer with the content streaming server, splitting the first streaming session between the content streaming server and the viewer, and streaming the content data to the viewer. Other embodiments are disclosed.

Abstract: A network controller comprising a processor configured to obtain topology information of a network, wherein the topology information indicates a plurality of non-software-defined networking (non-SDN) network elements (NEs) interconnected by a plurality of links in the network, analyze each non-SDN NE according to the topology information to determine whether the non-SDN NE is a candidate NE for establishing a backup tunnel to protect a single-link failure at one of the plurality of links, and select a plurality of target NEs from the candidate NEs to protect against all single link-failures in the network, and a transmitter coupled to the processor and configured to send a first message to a first of the target NEs to dynamically enable software-defined networking (SDN) functionalities at the first target NE in order to facilitate single-link failure protection in the network.

Abstract: A network controller comprising a processor configured to obtain topology information of a network, wherein the topology information indicates a plurality of non-software-defined networking (non-SDN) network elements (NEs) interconnected by a plurality of links in the network, analyze each non-SDN NE according to the topology information to determine whether the non-SDN NE is a candidate NE for establishing a backup tunnel to protect a single-link failure at one of the plurality of links, and select a plurality of target NEs from the candidate NEs to protect against all single link-failures in the network, and a transmitter coupled to the processor and configured to send a first message to a first of the target NEs to dynamically enable software-defined networking (SDN) functionalities at the first target NE in order to facilitate single-link failure protection in the network.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: State machines are used to order and select matching operations for determining whether an input string matches any of at least one regular expression by (1) accepting the set of regular expression(s), and (2) for each of the regular expression(s) of the set accepted, (A) identifying any look-ahead type strings within the given regular expression, (B) identifying any sequential type strings within the given regular expression, (C) partitioning the regular expression based on any identified simple strings, any identified look-ahead type variable strings, and any sequential type variable strings to generate partitioned parts, (D) reordering the partitioned parts of the regular expression using optimization policies to generate reordered partitioned parts, and (E) configuring nodes of a state machine corresponding to the given regular expression. Once configured, the state machines check for a match between the input string accepted and the regular expression using the configured nodes of the state machine.

Abstract: Effective control of communications traffic, even under fast-changing DDoS attacks, might be performed by (a) determining parameters of a leaky bucket using nominal communications traffic, (b) applying current communications traffic to the leaky bucket, (c) observing overflows, if any, of the leaky bucket, (d) scoring the current traffic based on the observed overflows, and (e) passing or dropping traffic based on the score. Alternatively, such control might be performed by (a) determining average mean and variance of each of one or more attribute values of nominal communications traffic, (b) determining a mean of each of the one or more attribute values of current communications traffic, (c) determining a probability that for each of the one or more attributes, its current mean value deviates more from its average mean that its current attribute value, (d) scoring the current traffic based on the determined probability or probabilities, and (e) passing or dropping traffic based on the score.

Abstract: 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.

Abstract: A method and apparatus for updating stored data structures representing network forwarding information used for network route lookup is described.

Abstract: 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.

Abstract: 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.

Abstract: 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 (1) accepting the set of regular expression(s), and (2) for each of the regular expression(s) of the set accepted, (A) identifying any look-ahead type strings within the given regular expression, (B) identifying any sequential type strings within the given regular expression, (C) partitioning the regular expression based on any identified simple strings, any identified look-ahead type variable strings, and any sequential type variable strings to generate partitioned parts of the given regular expression, (D) reordering the partitioned parts of the given regular expression using optimization policies to generate reordered partitioned parts of the regular expression, and (E) configuring nodes of a state machine corresponding to the given regular expression, by recording configured information of the nodes on a tangible storage medium, using (i) an o

Abstract: A pipeline-based matching scheduling approach for input-buffered switches relaxes the timing constraint for arbitration with matching schemes, such as CRRD and CMSD. In the new approach, arbitration may operate in a pipelined manner. Each sub-scheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides a matching result(s). The sub-scheduler can use a matching scheme such as CRRD and CMSD.

Abstract: A Pipelined-based Maximal-sized Matching (PMM) scheduling approach for input-buffered switches relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration may operate in a pipelined manner. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient maximal matching algorithm such as iSLIP and DRRM. PMM maximizes the efficiency of the adopted arbitration scheme by allowing sufficient time for a number of iterations. PMM preserves 100% throughput under uniform traffic and fairness for best-effort traffic.

Abstract: A pipeline-based matching scheduling approach for input-buffered switches relaxes the timing constraint for arbitration with matching schemes, such as CRRD and CMSD. In the new approach, arbitration may operate in a pipelined manner. Each sub-scheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides a matching result(s). The sub-scheduler can use a matching scheme such as CRRD and CMSD.