New York University

Other

Future Wei Technologies, Inc.

At&t Intellectual Property I, LP

Alcatel-lucent USA Inc.

Huawei Technologies Co., Limited

Hung-Hsiang Jonathan Chao

Eiji Oki

Kang Xi

Jinsoo Park

Roberto Rojas-Cessa

Masanori Bando

Min Luo

Nabi Sertac Artan

Yau-Ren Jenq

Rittwik Jana

Wu Chou

Mooi Choo Chuah

Shu Shi

Shivendra S Panwar

Yang Xu

Wing Cheong Lau

Bo Yan

Necdet Uzun

Cing-Yu Chu

Junjie Zhang

Huizhong Sun

Yoohwan Kim

Yihan Li

Cing-yu Chu

Jin-Soo Park

Alper Altinordu

Xiaolei Guo

Byeong-Seog Choe

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.

Transport layer network service for live content broadcasting

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.

Partial software defined network switch replacement in IP networks

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.

Capacity-aware heuristic approach for placing software-defined networking (SDN) switches in hybrid SDN networks for single link/node failure

Given a large number of traffic matrices, the matrices are divided into M clusters, where M is a relatively small number. A load-balancing apparatus is implemented as an application over the SDN controller. Such an application is executed to configure and reconfigure the switches to achieve near-optimal load balancing, even when the traffic load changes. For each cluster, a near-optimal explicit routing configuration is determined. The combination of explicit routing (cluster-specific) and destination-based routing (same for all clusters) is used to achieve near-optimal load balancing for each cluster.

Apparatus and method for dynamic hybrid routing in SDN networks to avoid congestion and balance loads under changing traffic load

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.

Updating prefix-compressed tries 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.

Hash-based prefix-compressed trie for IP route lookup

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.

Determining whether an input string matches at least one regular expression using lookahead finite automata based regular expression detection

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.

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

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.

Providing a high-speed defense against distributed denial of service (DDoS) attacks

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.

Scheduling the dispatch of cells in non-empty virtual output queues of multistage switches using a pipelined hierarchical arbitration scheme

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.

Pipelined maximal-sized matching cell dispatch scheduling

Scheduling the dispatch of cells in non-empty virtual output queues of multistage switches using a pipelined arbitration scheme

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.

Maintaining packet sequence using cell flow control

To avoid packet out-of-sequence problems, while providing good load balancing, each input port of a switch monitors the outstanding number of packets for each flow group. If there is an outstanding packet in the switch fabric, the following packets of the same flow group should follow the same path. If there is no outstanding packet of the same flow group in the switch fabric, the (first, and therefore subsequent) packets of the flow can choose a less congested path to improve load balancing performance without causing an out-of-sequence problem. To avoid HOL blocking without requiring too many queues, an input module may include two stages of buffers. The first buffer stage may be a virtual output queue (VOQ) and second buffer stage may be a virtual path queue (VPQ). At the first stage, the packets may be stored at the VOQs, and the HOL packet of each VOQ may be sent to the VPQ. By allowing each VOQ to send at most one packet to VPQ, HOL blocking can be mitigated dramatically.

Packet sequence maintenance with load balancing, and head-of-line blocking avoidance in a switch

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.

Growing community of inventors

Holmdel, NJ, United States of America

Hung-Hsiang Jonathan Chao