Muhammad Ali 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:

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:

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:

7706383, Apr 27, 2010

Filed:

Jul 31, 2001

Appl. No.:

09/919045

Inventors:

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

Assignee:

Alcatel-Lucent USA Inc. - Murray Hill NJ

International Classification:

H04L 12/56

US Classification:

37039531, 709229

Abstract:

An optical transport network comprises a number of nodes, or routers, which are coupled together via optical fibers. When a physical link comes up between a node and a neighboring node, a handshake between the node and the neighboring node recognizes the link such that the node, and the neighboring node, include it in respective link assignment tables. In addition, the node and the neighboring node negotiate a predefined sequence for assigning link resources from their respective assignment tables for satisfying future connection requests.

US Patent:

7760745, Jul 20, 2010

Filed:

Sep 17, 2007

Appl. No.:

11/856305

Inventors:

Muhammad Akber Qureshi - Irvine CA, US
David Brian Lofquist - Yorba Linda CA, US

Assignee:

The Boeing Company - Chicago IL

International Classification:

H04J 1/16
H04L 12/56

US Classification:

370401, 370315, 370328, 370389

Abstract:

A method, apparatus, and computer usable program code for managing networks. In one advantageous embodiment, a computer implemented method processes routing information. The process collects updates to the routing information in a first network. Responsive to an event, a cost of reaching each address in the first network from each of a plurality of gateways in the first network that has access to a second network is identified to form identified costs. The process also selects a set of addresses for a set of gateways providing access to the second network, wherein each gateway in the set of gateways is identified using a policy with respect to a cost of reaching a particular address in the first network to form an update list. The update list is sent to the second network.

US Patent:

7782882, Aug 24, 2010

Filed:

Sep 17, 2007

Appl. No.:

11/856334

Inventors:

Muhammad Akber Qureshi - Irvine CA, US
David Brian Lofquist - Yorba Linda CA, US

Assignee:

The Boeing Company - Chicago IL

International Classification:

H04J 1/16
H04L 12/56

US Classification:

370401, 370252, 370254, 370315

Abstract:

A computer implemented method, apparatus, and computer usable program code for managing addresses in a network. In one advantageous embodiment, a computer implemented method is used to managing addresses for a plurality of destinations in a network. Addresses assigned to a plurality of gateways are summarized to form summarized addresses containing prefixes and addresses for the plurality of gateways in which each gateway in the plurality of gateways is associated with a portion of the prefixes and addresses for destinations handled by the each gateway in the plurality of gateways. A gateway in the plurality of gateways having a largest portion of the summarized addresses is assigned a prefix for all addresses assigned to the network to form a selected gateway. An associated portion of the summarized addresses for the selected gateway is replaced with the prefix.