Muhammad T Qureshi

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:

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.

US Patent:

8296407, Oct 23, 2012

Filed:

Sep 26, 2003

Appl. No.:

10/673381

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 - Paris

International Classification:

G06F 15/177
G06F 15/173
H04J 3/22

US Classification:

709223, 709238, 370468

Abstract:

A method for representing, in a network data structure, a minimum amount of protection bandwidth required to be reserved on each link in a mesh network, to restore service upon failure of another node or link in the network. The method includes (1) receiving a request for a new service in the network, wherein the new service is represented by a service data structure having an identification of each link and transit node in a primary path for the new service, (2) determining, using the network and service data structures, whether the new service requires additional protection bandwidth to be reserved on any link in the network, and (3) updating the network data structure if any additional protection bandwidth is determined to be needed. In one implementation the network and service data structures are vectors and the steps of determining and updating involve vector operations between these structures.

US Patent:

20040205237, Oct 14, 2004

Filed:

Sep 26, 2003

Appl. No.:

10/673055

Inventors:

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

International Classification:

G06F015/16
G06F015/173
H04L012/28

US Classification:

709/241000, 709/249000, 370/351000

Abstract:

A method for determining a restoration path for a new service in a mesh network involves selecting between candidate restoration paths corresponding to a primary path for the new service based on the shared-risk link groups (SRLGs) associated with links in the primary path. The method includes, for each of a plurality of candidate restoration paths associated with the primary path, (1) determining whether the primary path requires any additional restoration bandwidth to be reserved on any link of the restoration path based on whether, for each link of the restoration path, the primary path is SRLG-disjoint from each other primary path that is protected by that link, (2) generating a path cost for the restoration path, where the path cost is a function of whether any additional restoration bandwidth is required; and (3) selecting the restoration path for the new service based on the path cost.