Bhawna Gupta

7397815, Jul 8, 2008

Jan 27, 2005

11/044974

Bhawna Gupta - Whitehouse Station NJ, US
Pankaj Risbood - Roselle NJ, US

Lucent Technologies Inc. - Murray Hill NJ

H04L 12/43

370458, 370907

Techniques for defragmenting at least one time division multiplexed link in a communication system, wherein provisioned circuits corresponding to traffic demands are assigned to particular time slots of the link. An optimum layout of free space for the link is computed, subject to an interface rate constraint that may be specified as a minimum cross-connect rate and a maximum cross-connect rate. Particular free slots from the optimum layout of free space are selected, and a hitless migration sequence is determined for migrating one or more of the circuits to one or more of the selected free slots. The time slot assignments of one or more of the circuits are adjusted in accordance with the determined migration, sequence in order to defragment the link.

7411900, Aug 12, 2008

May 28, 2003

10/446220

Swarup Acharya - New Providence NJ, US
Bhawna Gupta - Edison NJ, US
Pankaj Risbood - Roselle NJ, US
Anurag Srivastava - Roselle NJ, US

Lucent Technologies Inc. - Murray Hill NJ

G01R 31/08

370217, 370907

Techniques are disclosed for restoration of virtually-concatenated data traffic in a data transmission network. A virtually-concatenated group is formed comprising: (i) a plurality of primary members each associated with a corresponding data stream, and (ii) at least one backup member. Each of the plurality of primary members and the backup member of the virtually-concatenated group may be assigned a corresponding one of a plurality of data transmission routes between first and second nodes of the network. Responsive to a failure of a given one of the plurality of primary members, the backup member is utilized for restoring at least a portion of the data traffic of the given member. The invention also provides a modified link capacity adjustment scheme (LCAS) protocol which substantially reduces the time required to report changes in member status information from a sink node to a source node, thereby substantially reducing the amount of time required to perform a restoration operation.

7426186, Sep 16, 2008

Jan 16, 2003

10/345612

Swarup Acharya - New Providence NJ, US
Bhawna Gupta - Edison NJ, US
Pankaj Risbood - Roselle NJ, US
Anurag Srivastava - Roselle NJ, US

Lucent Technologies Inc. - Murray Hill NJ

G01R 31/08

370238, 370252, 370255, 370401

A method for data path provisioning in a reconfigurable data network is disclosed. A data path between a source IP router and a destination IP router is determined taking into account the IP-subnets of the network interfaces of the IP routers included in the path. In one embodiment, the requirement that two IP routers can send packets via their connected interface if and only if the two interfaces are on the same subnet (i. e. , the subnet constraint) is completely honored during the data path determination. In another embodiment, the data path is determined while allowing some number of violations of the subnet constraint. A transform network graph is computed and is used to determine the data path taking into account the IP-subnets.

7518990, Apr 14, 2009

Dec 26, 2003

10/745881

Swarup Acharya - New Providence NJ, US
Bhawna Gupta - Edison NJ, US
Pankaj Risbood - Roselle NJ, US
Anurag Srivastava - Roselle NJ, US

Alcatel Lucent USA Inc. - Murray Hill NJ

G01R 31/08

370225, 370235, 3703954, 370468

Virtually-concatenated data traffic is routed in a network comprising at least first and second nodes. The first and second nodes may comprise a source-sink node pair, an ingress-egress node pair, or any other pair of network nodes. For a given traffic demand, a plurality of routes for routing the traffic demand through the network are determined. Each of the routes corresponds to a member of a virtually-concatenated group, such that different portions of the traffic demand are assigned to different members of the virtually-concatenated group.

7675899, Mar 9, 2010

Nov 30, 2005

11/290873

Swarup Acharya - New Providence NJ, US
Bhawna Gupta - Edison NJ, US

Alcatel-Lucent USA Inc. - Murray Hill NJ

H04L 12/28

370351, 370258, 370222, 370223

Packet-aware transport architecture and techniques for implementing same that enhance data volume by scaling effectively to rapid data growth are disclosed. For example, a technique for determining a route for a demand in a circuit-switched network comprises the following steps/operations. The demand to be routed in the circuit-switched network is obtained. The circuit-switched networks implements a packet ring (PR) model such that one or more demands are routable on one or more virtual data rings in the circuit-switched network. An Ethernet-Over-SONET (EOS) communication channel in the circuit-switched network suitable for accommodating the demand is specified. The EOS communication channel or one of the one or more virtual data rings is then identified as the new route for the demand.

7813270, Oct 12, 2010

May 15, 2003

10/438431

Swarup Acharya - New Providence NJ, US
Bhawna Gupta - Edison NJ, US
Pankaj Risbood - Roselle NJ, US
Anurag Srivastava - Roselle NJ, US

Alcatel-Lucent USA Inc. - Murray Hill NJ

H04J 1/16

370225, 370238, 370252

A maximum-flow based route precomputation algorithm includes at least a route generation phase and a route selection phase, and determines one or more routes between at least a given pair of nodes in a network. In the route generation phase, a maximum-flow algorithm is applied to a first set of information characterizing links between the given pair of nodes in the network. The output of the maximum-flow algorithm is utilizable to generate a second set of information characterizing corresponding admissible flows. In the route selection phase, one or more routes are determined based on the second set of information using, for example, a shortest widest path (SWP) algorithm. The route generation and route selection phases may be repeated for each of a plurality of node pairs of the network.

7864690, Jan 4, 2011

Aug 8, 2003

10/637289

Swarup Acharya - New Providence NJ, US
Bhawna Gupta - Edison NJ, US
Pankaj Risbood - Roselle NJ, US
Anurag Srivastava - Roselle NJ, US

Alcatel-Lucent USA Inc. - Murray Hill NJ

H04L 1/00

370248, 370222, 370228, 370258

A system and method for rerouting circuits on a SONET, SDH or similar ring without disrupting service. In one embodiment, the system includes: (1) a route design subsystem adapted to identify, for the circuits, alternative routes that are subject to an alignment constraint and increase an objective value associated with the ring and (2) a path migration subsystem, associated with the route design subsystem, adapted to determine a hitless migration sequence that allows the alternative routes to be employed.

7872976, Jan 18, 2011

May 2, 2003

10/428464

Swarup Acharya - New Providence NJ, US
Bhawna Gupta - Edison NJ, US
Pankaj Risbood - Roselle NJ, US
Anurag Srivastava - Roselle NJ, US

Alcatel-Lucent USA Inc. - Murray Hill NJ

G01R 31/08
G06F 11/00
G08C 15/00
H04J 3/14
H04L 1/00

370237

A system for and method of multi-protocol label switching (MPLS) network tuning. In one embodiment, the system includes a hot zone clearing subsystem that recursively identifies label switched paths (LSPs) to be rerouted from a defined hot zone subject to edges to be avoided. In that embodiment, the system further includes an LSP ordering subsystem, which is coupled to the hot zone clearing subsystem, that orders the LSPs to be rerouted to yield a migration sequence. The migration sequence is employable to reduce a load of the hot zone.