Alcatel-lucent USA Inc.

Alcatel Lucent

Lucent Technologies Inc.

Mansoor Ali Khan Alicherry

Viswanath Poosala

Chitra Phadke

Harsha S Nagesh

Randeep Singh Bhatia

Sudipta Sengupta

Sadanand M Gogate

Muthuprasanna Muthusrinivasan

Li Erran Li

Iraj Saniee

Dimitrios Stiliadis

Vijay Pochampalli Kumar

Jin Cao

Pramod V N Koppol

Peter Hessler

Sunder Rathnavelu Raj

Sanjay D Kamat

Mary S Chan

Govindarasu Manimaran

Yung-Chun Wan

Walter Rothkegel

Pramod VN Koppol

The invention includes a method and apparatus for notification and delivery of messages to mobile users using a secure client associated with a user device. The secure client includes a power module, a communication module, a storage module, and an alert module. The power module powers the client device independent of a power state of the user device. The communication module receives a wake-up message and responsively triggers the secure client to switch from an inactive state to an active state without changing the power state of the user device, initiates a secure connection with a secure gateway in response to the wake-up message, and requests and receives a user message from a messaging application using the secure connection. The storage module stores the received message independent of the power state of the user device. The alert module activates an alert to indicate that the message is available.

Method and apparatus for notification and delivery of messages to mobile PC users

Techniques for single-failure protection in load-balanced network architectures are disclosed. For example, in one aspect of the invention, a technique for processing a traffic flow in a communication network comprising a plurality of nodes, the traffic flow being deliverable from a source node to at least one destination node via one or more intermediate nodes, comprises the following steps/operations. The traffic flow is split at the source node into a plurality of parts. The parts are distributed to respective ones of the intermediate nodes such that the parts are routed from the source node to the at least one destination node in a disjoint manner.

Single-failure protection in a load-balanced network architecture

Line system design techniques are provided for use in performing routing and coloring operations associated with one or more demands. In one aspect of the invention, a technique for designing a line system comprises the following steps/operations. A set of one or more demands is obtained for use in computing the line system design. The line system design is then represented as a graph in accordance with a graph coloring operation wherein colors represent bandwidths such that bandwidths are assigned and the one or more demands are routed so as to attempt to achieve a minimum total design cost. The line system being designed may be an optical line system.

Methods and apparatus for line system design

Network design techniques and techniques for routing virtually-concatenated data traffic in a network in a manner which distributes delay to intermediate nodes of the network are disclosed. For example, in one aspect of the invention, a technique for routing virtually-concatenated data traffic in a network comprising a plurality of nodes comprises, for a given traffic demand to be routed from a source node to a destination node in the network, the following steps/operations. Two or more paths are determined to route the given traffic demand. Each of the two or more paths correspond to a member of a virtually-concatenated group. At least one path of the two or more paths comprises the source node, the destination node and at least one other node coupled between the source node and the destination node. Further, at least a subset of the source node, the destination node and the one other node buffer at least a portion of the given traffic demand such that a delay is distributed over the at least one path. The given traffic demand is routed over the two or more determined paths. The at least one path is preferably the shorter of the two or more determined paths.

Delay distributed virtually-concatenated data traffic

Techniques for designing networks. The techniques utilize network management-based routing (NMS routing) in conjunction with the planning step (design-based routing) of the design process so that an optimal network may be designed. An automated technique for designing a network may comprise the following steps. First, one or more traffic demands are obtained. Then, a network is computed by determining one or more routes for the one or more traffic demands using a design-based routing methodology based on feedback from a network management-based routing methodology.

Network design utilizing network management routing algorithm

Method and apparatus for provisioning a protection pathway of a link joining a first point in a network and a second point in the network. The method includes the step of determining a shortest path between the first point and the second point in a protection graph, computing a length of said shortest path, determining if said link should be added to the protection graph according to said computed length and setting the shortest path in the protection graph as protection path for said link. The second step of determining includes evaluating the protection graph to determine if there no existing path or an existing path that is longer than a hop limit. Based on this evaluation, the method either adds the link or makes no change to the protection graph.

Method and apparatus for provisioning a hop limited protection pathway in a network

Improved p-cycle restoration techniques using a signaling protocol are disclosed. For example, a technique for use in at least one node of a data communication network for recovering from a failure, wherein the data communication network includes multiple nodes and multiple links for connecting the multiple nodes, comprises the following steps/operations. Notification of the failure is obtained at the at least one node. A determination is made whether the failure is a single link failure or one of a node failure and a multiple link failure. A pre-configured protection cycle (p-cycle) plan is implemented when the failure is a single link failure but not when the failure is one of a node failure and a multiple link failure, such that two independent paths in the network are not connected when implementing the pre-configured protection cycle plan. Implementation of the pre-configured protection cycle plan may further comprise the node sending at least one message to another node in the data communication network and/or receiving at least one message from another node in the data communication network.

Signaling protocol for p-cycle restoration

Disclosed is a method and system for multi-character multi-pattern pattern matching. In the multi-character multi-pattern pattern matching method, patterns in an input stream are detected by transitioning between states of a 'compressed deterministic finite state automaton (DFA)', with each transition based on multiple characters of the input stream. The compressed DFA is created by compressing an original DFA, such as an Aho-Corasick DFA, such that each state of the compressed DFA represents multiple consecutive states of the original DFA and each transition between the states of the compressed DFA is a combination of all of the transitions between the multiple consecutive states of the original DFA. This method can be implemented using a Ternary Content-Addressable Memory (TCAM) to store the transitions of the compressed DFA and compares the transitions with multiple characters of an input stream at a time to detect patterns in the input stream.

Method and system for multi-character multi-pattern pattern matching

Techniques are disclosed for designing optical transmission systems that efficiently compute cost-optimal configurations under one or more constraints. For example, in one aspect of the present invention, a technique for designing an optical transmission system comprises the following steps/operations. A set of one or more demands and a set of optical transmission system elements are obtained. Elements may be consecutively coupled via a span. At least one constraint on the design of the optical transmission system is obtained. The at least one constraint comprises: (i) a signal loss in a span should not exceed a given maximum signal loss; (ii) a signal loss in a span should not exceed a given maximum signal loss and a span should be longer than a given minimum span length; (iii) a signal loss in a span should not exceed a given first maximum signal loss and a span should be longer than a given minimum span length, however, at most one in m contiguous spans can have a loss up to a given second maximum signal loss, wherein the second maximum signal loss is greater than the first maximum signal loss; or (iv) a signal loss in a span should not exceed a given maximum signal loss and a span should be longer than a given minimum span length, and an average span loss of any m consecutive spans should not exceed a given average loss, wherein the average loss is less than the given maximum signal loss. A least-cost configuration is then computed for the optical transmission system based on at least a portion of the set of one or more demands and the set of one or more optical transmission system elements such that the at least one constraint is satisfied.

Constraint-based design of optical transmission systems

A fast shared path allocation technique is disclosed. Network nodes are pre-configured such that data from multiple data sources or multiple primary data paths may be sent via a shared secondary data path. Merge nodes merge input from a plurality of input ports onto an output port. The merge nodes implement a blocking function such that upon receipt of a signal from one of the input ports, the signals from the other input ports are blocked from reaching the output port. Upon a triggering event indicating a need to allocate the shared path, the data is first sent to the merge node where it is appropriately merged onto the output link and transmitted towards its destination. Only after the data has been sent does the merge node block the remaining input ports from reaching the output port. This blocking may be performed automatically by the merge node or by conventional network signaling.

Low latency shared data path allocation

A methodology for making joint channel and routing assignments in multi-radio wireless mesh networks that takes into account interference constraints, the number of channels in a network and the number of radio available at each mesh router, and maximizes bandwidth allocation subject to fairness constraints. In particular, the methodology provides for routing, channel assignment and link scheduling in multi-radio mesh wireless networks utilizing a constant factor approximation technique that models the interference and fairness constraints and is able to account for the number of radios at each of the wireless nodes of a wireless mesh network.

Method for channel assignment and routing for multi-radio wireless mesh networks

Multi-path routing techniques using intra-flow splitting are disclosed. For example, a technique for processing traffic flows at a node in a network comprises the following steps/operations. At least one traffic flow is obtained. The at least one traffic flow comprises multiple packets or bytes. The at least one flow is split into at least two sub-flows, wherein each of the at least two sub-flows comprises a portion of the multiple packets or bytes. The packets or bytes of the at least two sub-flows are respectively routed on at least two paths in the network.

Multi-path routing using intra-flow splitting

Disclosed is a two tier packet labeling technique for use in connection with network traceback in a network having multiple autonomous systems, with routers and other network resources within each autonomous system. Tier 1 labels are assigned at the autonomous system level, and tier 2 labels are assigned at the router level. In order to reduce the number of labels that are required, a technique called logical partitioned coloring may be used, in which certain autonomous systems and border routers may be logically partitioned into a plurality of mesh connected nodes, and the labels are assigned to these mesh-connected nodes. During network operation the network routers store either tier 1 or tier 2 labels in data packets. The determination of whether to store a label in any particular packet, and the determination of which label to store, may be determined probabilistically by the network router.

Two tiered packet labeling for data network traceback

Improved network design techniques are provided. For example, a technique for designing a protection capacity to be reserved in a network comprises the following steps/operations. One or more link capacities associated with a network topology are obtained. The network is assumed to have no pre-existing working traffic. A capacity partition including a working capacity portion and a protection capacity portion is determined for at least one link in the network topology. The protection capacity portion is reserved for rerouting working traffic upon a failure and enabling control over the number of backup tunnels, associated with the at least one link, on which working traffic can be rerouted. Determining the capacity partition substantially guarantees at least one of a minimal failure restoration time and a minimal overbuild. A minimal overbuild may include an overbuild equivalent to no more than two times an overbuild required for an optimal solution.

Method and apparatus for pre-provisioning networks to support fast restoration with minimum overbuild

Techniques and systems for designing a network providing communication and location identification services are described. A solution point comprising parameters for each of a plurality of base stations is generated. A coverage and locatability performance value for the solution point is computed, as well as derivatives of the performance value. The coverage and locatability performance value and its derivatives are used to indicate favorable directions for searching for subsequent solution points, and subsequent solution points are generated and compared against previous solution points until an optimum solution point is found. The coverage and locatability performance value is a weighted sum of coverage and locatability values for each point in the service area of the network, with coverage values representing forward and reverse link quality and locatability values representing the probability that a point will experience an acceptable power level from at least four base stations.

Growing community of inventors

Scotch Plains, NJ, United States of America

Mansoor Ali Khan Alicherry