Wing F Lau

6400684, Jun 4, 2002

Sep 1, 1998

09/145351

Lotfi Benmohamed - Freehold NJ
Wing Cheong Lau - Eatontown NJ

Lucent Technologies Inc. - Murray Hill NJ

H04L 1226

3702301, 37039543

A flow control method for available bit rate service in an asynchronous transfer mode network for detecting congestion in a switch and conveying congestion status information using resource management cells to the source which adjusts its flow rate accordingly. During detection of congestion in the switch the explicit rate field of the resource management cell is updated using a dynamic major reduction factor to improve transient queue-length performance.

6400688, Jun 4, 2002

Sep 23, 1998

09/159109

Wing Cheong Lau - Eatontown NJ

Lucent Technologies Inc. - Murray Hill NJ

G01R 3108

3702361, 370407, 370408, 3703952

A method for consolidating backward resource management (BRM) cells in an available bit rate point-to-multipoint tree including a root, a plurality of leaves and a branch point interconnected between the root and the leaves. Initially, congestion information memory devices are reset. Then for each incoming return BRM cell to the branch point a determination is made whether the branch point has received a return BRM cell from a predetermined number of candidates in a candidate set of candidate-branches. If the branch point has not received a return BRM cell from the predetermined number of candidates in the candidate set then the congestion information from the incoming return BRM cell and the congestion information in the congestion information memory devices are consolidated in the congestion information memory devices. After the congestion information memory devices have been updated with the consolidated congestion information then the incoming return BRM cell is discarded and the determination is repeated for the next incoming return BRM cell. If the branch point has received a return BRM cell from the predetermined number of candidates in the candidate set then the congestion information from the incoming return BRM cell and the congestion information in the congestion information memory devices are consolidated in the incoming return BRM cell before being passed back to the root.

6795399, Sep 21, 2004

Nov 24, 1998

09/198727

Lotfi Benmohamed - Freehold NJ
Subrahmanyam Dravida - Groton MA
Wing Cheong Lau - Eatontown NJ
Ajay Kumar Mittal - Edison NJ

Lucent Technologies Inc. - Murray Hill NJ

H04L 500

370235, 370252, 370255, 709226, 709238

Methods and apparatus are provided for designing IP networks with substantially improved performance as compared to existing IP networks such as, for example, those networks designed under best-effort criteria. Particularly, the invention includes methods and apparatus for: computing worst-case and optimistic link capacity requirements; optimizing network topology; and determining router placement within a network.

6909700, Jun 21, 2005

Nov 24, 1998

09/198728

Lotfi Benmohamed - Freehold NJ, US
Subrahmanyam Dravida - Groton MA, US
Wing Cheong Lau - Eatontown NJ, US
Ajay Kumar Mittal - Edison NJ, US

Lucent Technologies Inc. - Murray Hill NJ

H04J003/14

370255, 370231, 370232, 370235, 370238, 709223, 709226, 709229, 709241

Methods and apparatus are provided for designing IP networks with substantially improved performance as compared to existing IP networks such as, for example, those networks designed under best-effort criteria. Particularly, the invention includes methods and apparatus for: computing worst-case and optimistic link capacity requirements; optimizing network topology; and determining router placement within a network.

6992979, Jan 31, 2006

Jun 28, 2001

09/894946

Oded Hauser - Matawan NJ, US
Muralidharan Sampath Kodialam - Marlboro NJ, US
Wing Cheong Lau - Middletown NJ, US

Lucent Technologies Inc. - Murray Hill NJ

H04L 12/26

370228, 370227

A network element maintains failure information for a packet-based network and usage information for a backup path. Upon receipt of a new demand, with an associated bandwidth, d, the network element determines if the backup path can be shared as a function of the failure information and the usage information associated with the backup path.

7096039, Aug 22, 2006

Jun 28, 2002

10/185993

Mooi Choo Chuah - Marlboro NJ, US
Wing Cheong Lau - Middletown NJ, US

Lucent Technologies Inc. - Murray Hill NJ

H04M 1/00

455561, 455503, 4554565

The present invention sets forth a methodology for providing improved downlink backhaul services from a radio network controller (RNC) to a plurality of base stations via a backhaul network that provides Ethernet services. The Ethernet services are provided by a group of provider edge (PE) switches and regular label switch routers (referred to as P switches). Base stations within the network are assigned into clusters, each of the clusters having a cluster ID. The RNC transmits packets to a given switch or switches out on the network based on a cluster ID included within the transmitted packet. The communications traffic is then multicast from at least one last hop switch in the network to candidate base stations on the basis of the cluster ID and an active set within the cluster. Advantageously, the clusters act as subgroups for more easily directing the transmission of the backhaul multicast traffic. Significant advantages are realized through use of the present invention, including the ability to allow faster and smoother handoffs, as well as backhaul bandwidth savings since intelligence regarding cell switching is extended out at a point farther along the network than was previously enabled.

7356561, Apr 8, 2008

May 1, 2003

10/426691

Krishna Balachandran - Morganville NJ, US
Joseph H. Kang - Belle Mead NJ, US
Wing Cheong Lau - Middletown NJ, US

Lucent Technologies Inc. - Murray Hill NJ

H04B 7/00

709203, 709224, 709227, 370356, 370310, 455574

In a multiple node network, the method includes waking up at least one node from a sleep mode during at least one associated slot of a time-slotted frame, the sleep mode being a low power consumption mode. Also, in at least one node of a multiple node network, the period of time a node sleeps is based on the residual energy of the node, the residual energy of the nodes in the neighborhood, neighborhood node density, and combinations thereof.

7397766, Jul 8, 2008

Aug 2, 2004

10/909908

Muralidharan Sampath Kodialam - Marlboro NJ, US
Wing Cheong Lau - Middletown NJ, US

Lucent Technologies Inc. - Murray Hill NJ

G01R 31/08

370252

A network-wide traffic measurement/analysis problem is formulated as a series of set-cardinality-determination (SCD) problems, using probabilistic distinct sample counting techniques to compute network-wide traffic measurements of interest in a distributed manner via the exchange of light-weight traffic digests (TD's) amongst network nodes/routers. A TD for N packets uses only requires O(loglog N) bits of memory storage, making it possible to distribute nodal TD's to all routers within a domain by piggybacking them as opaque data objects inside existing control messages, such as OSPF link-state packets (LSPs) or I-BGP control messages. A router receiving the TD's can estimate the traffic measurements of interest for each of its local links by solving a series of set-cardinality-determination problems. The traffic measurements of interest are typically per-link, per-traffic-aggregate packet (or flow) counts, where an aggregate is defined by the group of packets sharing the same originating and/or destination nodes (or links) and/or some intermediate nodes (or links).