Muhammad A Qureshi

US Patent:

7099327, Aug 29, 2006

Filed:

Oct 12, 2000

Appl. No.:

09/687348

Inventors:

Ramesh Nagarajan - Somerset NJ, US
Muhammad A Qureshi - Metuchen NJ, US
Steven A Surek - Leonardo NJ, US

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

H04L 12/28

US Classification:

370394

Abstract:

An Optical Transport Network (OTN) (comprising a number of OTN nodes) uses an Internet Protocol (IP) based control plane (out-of-band signaling on a separate wavelength). Each OTN node of the IP-based control plane performs dual-feeding and dual-selecting of signaling messages on diverse signaling paths. The IP-based control plane establishes a pair of physically disjoint signaling paths between every set of neighboring OTN nodes (pre-computed and pre-established physically disjoint primary and secondary message paths in the IP-based control plane).

US Patent:

7349635, Mar 25, 2008

Filed:

Dec 1, 2003

Appl. No.:

10/725342

Inventors:

Mooi Choo Chuah - Marlboro NJ, US
Randy C. Giles - Whippany NJ, US
Xiang Liu - Marlboro NJ, US
Muhammad A. Qureshi - Green Brook NJ, US

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

H04B 10/00
H04B 10/04

US Classification:

398163, 398115, 398116, 398182

Abstract:

Method and apparatus for routing messages in a network includes first filters to provide frequency-based message signals converted from an optically-based signal and mixers adapted to mix the frequency-based message signals with sub-carriers to generate frequency-based sub-carrier modulated message signals. A frequency generator connected to the mixers provides the sub-carriers to the mixers and a combiner connected to the mixers combines the frequency-based sub-carrier modulated message signals. Second filters connected to the combiner receive and group the frequency-based sub-carrier modulated message signals. Optical transmitters connected to second filters optically convert and transmit the frequency-based sub-carrier modulated message signals. The frequency generator generates and applies a particular sub-carrier frequency to one of the mixers according to information contained in the frequency-based message signal. The information is encoded into the frequency-based message signal via a generalized MPLS (GMPLS) label contained in a header portion of the frequency-based message signal.

US Patent:

7372805, May 13, 2008

Filed:

May 4, 2001

Appl. No.:

09/849187

Inventors:

Ramesh Nagarajan - Somerset NJ, US
Muhammad A Qureshi - Metuchen NJ, US

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

G01R 31/08

US Classification:

370222, 370254

Abstract:

In a network architecture, selective grooming is performed. In selective grooming, a low traffic node is coupled (a) directly to an other low traffic node via a high capacity trunk, and (b) to a high traffic node via a high capacity trunk such that only a portion of the client signals destined for the other low traffic node are groomed into the high capacity trunk to the high traffic node.

US Patent:

7406082, Jul 29, 2008

Filed:

Sep 30, 2002

Appl. No.:

10/261090

Inventors:

Ramesh Nagarajan - Somerset NJ, US
Vinay D. Purohit - Branchburg NJ, US
Muhammad A. Qureshi - Metuchen NJ, US

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

H04L 12/28

US Classification:

370394, 370401

Abstract:

In a packet-based data network, packets are duplicated and a sequence number is inserted into each duplicate packet, where the duplicate packets are transmitted along two different paths from a source node to a destination node in the network. Depending on the implementation, the source node inserts different types of sequence numbers into the duplicate packets, and the destination node processes those sequence numbers accordingly to determine whether to accept or reject each received packet. In certain implementations, the number of sequence bits allocated to each packet is smaller than the size of the effective sequence number for the packet as interpreted by the destination node.

US Patent:

7451340, Nov 11, 2008

Filed:

Sep 26, 2003

Appl. No.:

10/673382

Inventors:

Bharat T. Doshi - Holmdel NJ, US
Zbigniew M. Dziong - Montreal, CA
Ramesh Nagarajan - Somerset NJ, US
Muhammad A. Qureshi - Green Brook NJ, US

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

G06F 11/00

US Classification:

714 4, 714 43, 714 47, 370227, 370228, 398 5

Abstract:

An extension to a connection setup protocol for establishment of a restoration path for a service in a mesh network involves, at a transit node along the restoration path, the steps of (1) receiving a service data structure having an identification of each link and transit node in a primary path for the service, and (2) determining whether to reserve additional protection bandwidth on an outgoing link incident to the transit node using the service data structure, wherein the outgoing link is part of the restoration path. In one or more embodiments, the service data structure includes identification of the service, identification of the outgoing link, and bandwidth of the service. In some cases, the extension involves reserving the additional protection bandwidth on the outgoing link, if the transit node determines that the protection bandwidth is required, based upon knowledge of the protection bandwidth already reserved on the outgoing link.

US Patent:

7500013, Mar 3, 2009

Filed:

Apr 2, 2004

Appl. No.:

10/817760

Inventors:

Zbigniew M. Dziong - Atlantic Highlands NJ, US
Muhammad A. Qureshi - Irvine CA, US

Assignee:

Alcatel-Lucent USA Inc. - Murray Hill NJ

International Classification:

G06F 15/173
G06F 12/00

US Classification:

709238, 709249

Abstract:

A protected communication network utilizes a link-based recovery strategy that includes methods for calculating and distributing link-protection parameters and calculating primary and link-detour paths based on these parameters. These link-protection parameters support the computation of more-optimal link-detour paths and a corresponding increase in sharing of network resources between disjoint failures. A joint-optimization mechanism can be employed that considers both the cost of link-detour paths as well as the cost of links in candidate primary paths in the selection of a primary path for a demand. Information for the joint optimization is preferably distributed using link-state advertisements.

US Patent:

7606237, Oct 20, 2009

Filed:

Aug 12, 2003

Appl. No.:

10/639728

Inventors:

Zbigniew M. Dziong - Atlantic Highlands NJ, US
Ramesh Nagarajan - Somerset NJ, US
Muhammad A. Qureshi - Green Brook NJ, US

Assignee:

Alcatel-Lucent USA Inc. - Murray Hill NJ

International Classification:

H04L 12/28

US Classification:

37039541, 370242, 370248, 370250, 370244

Abstract:

A shared mesh data network (SMDN) for path-based recovery at the packet level. In one implementation, a first link in the network is part of two or more different protection paths, where each protection path corresponds to a different primary path. A network manager determines how much protection bandwidth to reserve on the first link for the two or more protection paths in such a way that the protection bandwidth reserved on the first link is shared between the protection paths of the two or more primary paths. As such, the amount of protection bandwidth reserved on the first link can be less than the sum of the bandwidths of the two or more primary paths. The SMDN provides efficient sharing of protection capacity. Implementations of the SMDN are appropriate to multiprotocol label-switched (MPLS) optical networks.

US Patent:

7689693, Mar 30, 2010

Filed:

Sep 26, 2003

Appl. No.:

10/673383

Inventors:

Bharat T. Doshi - Holmdel NJ, US
Zbigniew M. Dziong - Montreal, CA
Ramesh Nagarajan - Somerset NJ, US
Muhammad A. Qureshi - Green Brook NJ, US

Assignee:

Alcatel-Lucent USA Inc. - Murray Hill NJ

International Classification:

G06F 15/173
G06F 15/16
G06F 11/00

US Classification:

709226, 709228, 709235, 370227, 714 4

Abstract:

A method for determining primary and restoration paths for a new service in a mesh network involves (1) for each of a plurality of candidate primary/restoration path pairs for the new service, generating a path cost for each candidate pair, where the path cost for each restoration path is a function of the sum of the cost of links within the restoration path, and (2) selecting the primary and restoration paths for the new service from the plurality of candidate path pairs based on the path cost. If no sharing is possible, for low utilization links, the cost of links is a function of the administrative weight of the link, whereas for high utilization links, the link cost is a function of the inverse of the available capacity on the link. If sharing is possible, the cost is a function of the inverse of a sharing degree for the link.