Muhammad Saleem Qureshi

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.

US Patent:

8111612, Feb 7, 2012

Filed:

Apr 2, 2004

Appl. No.:

10/817748

Inventors:

Zbigniew M Dziong - Montreal, CA
Muhammad A. Qureshi - Irvine CA, US

Assignee:

Alcatel Lucent - Paris

International Classification:

G08C 15/00
H04L 12/26

US Classification:

370218, 370222

Abstract:

A protected communication network utilizes a link-based recovery strategy that supports independent recovery paths for individual demands, where each link includes one or more lines and each line can support one or more demands. Failure of one or more—or even all—of the lines/ports of a link will typically result in the independent rerouting of the affected demands along one or more link-detour paths. The flexibility afforded by recovery at the granularity of a demand supports the computation of more-optimal link-detour paths and a corresponding increase in sharing of network resources between disjoint failures. The network also addresses the restricted case where all demands on a line/port are recovered along the same link-detour path.

US Patent:

8238346, Aug 7, 2012

Filed:

Jul 9, 2009

Appl. No.:

12/500049

Inventors:

Wayne R. Howe - Irvine CA, US
Muhammad Akber Qureshi - Irvine CA, US

Assignee:

The Boeing Company - Chicago IL

International Classification:

H04L 12/28
H04L 12/54

US Classification:

37039542, 370412, 370413, 370415, 370417, 370429

Abstract:

A node in a mobile ad-hoc network or other network classifies packets (a) in accordance with a first set of priority levels based on urgency and (b) within each priority level of the first set, in accordance with a second set of priority levels based on importance. The node: (a) queues packets classified at highest priority levels of the first and/or second sets in high-priority output queues; (b) queues packets classified at medium priority levels of the first set in medium-priority output queue(s); and (3) queues packets classified at low priority levels of the first and/or second set in low-priority output queue(s). Using an output priority scheduler, the node serves the packets in order of the priorities of the output queues. In such manner, orthogonal aspects of DiffServ and MLPP can be resolved in a MANET or other network.

US Patent:

8442057, May 14, 2013

Filed:

Jul 11, 2012

Appl. No.:

13/546233

Inventors:

Wayne R. Howe - Irvine CA, US
Muhammad Akbar Qureshi - Irvine CA, US

Assignee:

The Boeing Company - Chicago IL

International Classification:

H04L 12/28
H04L 12/54

US Classification:

37039542, 370412, 370413, 370415, 370417, 370429

Abstract:

A node in a mobile ad-hoc network or other network classifies packets (a) in accordance with a first set of priority levels based on urgency and (b) within each priority level of the first set, in accordance with a second set of priority levels based on importance. The node: (a) queues packets classified at highest priority levels of the first and/or second sets in high-priority output queues; (b) queues packets classified at medium priority levels of the first set in medium-priority output queue(s); and (3) queues packets classified at low priority levels of the first and/or second set in low-priority output queue(s). Using an output priority scheduler, the node serves the packets in order of the priorities of the output queues. In such manner, orthogonal aspects of DiffServ and MLPP can be resolved in a MANET or other network.

US Patent:

20050226212, Oct 13, 2005

Filed:

Apr 2, 2004

Appl. No.:

10/817745

Inventors:

Zbigniew Dziong - Montreal, CA
Muhammad Qureshi - Irvine CA, US

International Classification:

H04L012/28

US Classification:

370351000

Abstract:

A protected communication network utilizes a link-based recovery strategy that incorporates loop-avoidance mechanisms to eliminate redundant traversal of links in recovery paths, thereby improving network efficiency. The loop-avoidance mechanisms can include calculation of recovery paths taking into account protected segments that include shared risk link groups. In one two-phase loop-avoidance mechanism, a full link-detour path is calculated for a primary-path link by generating a minimum cost path between the upstream and downstream terminating nodes for the link. Next, the full link-detour path is shortened by removing redundant links that are shared by the full link-detour path and the original primary path. Calculation of link-detours and elimination of loops is supported in some embodiments by the distribution of link-state parameters via extensions to the link-state-advertisement (LSA) protocol.