Li Li

US Patent:

7120453, Oct 10, 2006

Filed:

Apr 18, 2001

Appl. No.:

09/837809

Inventors:

Thomas F. La Porta - Holmdel NJ, US
Li Li - Ithaca NY, US
Ramachandran Ramjee - Matawan NJ, US

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

H04Q 7/20

US Classification:

455458, 4554221, 4554321, 4554561

Abstract:

Base stations on an Internet protocol (IP) network define a number of paging areas. An IP mobile host assumes one of (i) an active state, wherein the host informs other network nodes of a change in its point of attachment from one base station to another, and (ii) a standby state wherein the host informs other nodes only when a new point of attachment is a base station of a different paging area from a last point of attachment, thus conserving power at the mobile host. When data on the network is addressed to a standby mobile host, a page request is directed to a base station(s) in the host's current paging area for transmission. The host enters the active state and transmits a page response which is received by a base station in the current paging area, and network routing information for the host is updated accordingly.

US Patent:

7502329, Mar 10, 2009

Filed:

Jan 27, 2003

Appl. No.:

10/351913

Inventors:

Li Li - Iselin NJ, US
Sanjoy Paul - Marlboro NJ, US
Marina K. Thottan - Westfield NJ, US
Bin Yao - Middletown NJ, US

Assignee:

Alcatel-Lucent USA Inc. - Murray Hill NJ

International Classification:

H04L 12/28
H04L 12/403
H04J 3/16
G06F 15/173

US Classification:

370252, 370346, 370449, 709224

Abstract:

A method and apparatus for optimizing a distributed polling system in a network comprising a plurality of nodes. The method includes identifying bandwidth constraints on polling traffic for each of the plurality of nodes. Selecting, from a plurality of unpolled nodes within the plurality of nodes, at least one poller node according to a maximum number of unpolled nodes assignable to each of the at least one poller node without violating bandwidth constraints, and respectively assigning the unpolled nodes as pollee nodes to the at least one poller node. The apparatus includes a central manager and a plurality of pollee nodes coupled to at least one poller node via at least one routing path. At least one aggregating node is coupled to the at least one poller nodes, where the aggregating node is further coupled to the central manager.

US Patent:

7643469, Jan 5, 2010

Filed:

Jan 4, 2006

Appl. No.:

11/325060

Inventors:

Mansoor Ali Khan Alicherry - Scotch Plains NJ, US
Randeep S. Bhatia - Somerset NJ, US
Li Li - Edison NJ, US

Assignee:

Alcatel-Lucent USA Inc. - Murray Hill NJ

International Classification:

H04L 12/28

US Classification:

370351, 370254

Abstract:

A methodology for making joint channel and routing assignments in multi-radio wireless mesh networks that takes into account interference constraints, the number of channels in a network and the number of radio available at each mesh router, and maximizes bandwidth allocation subject to fairness constraints. In particular, the methodology provides for routing, channel assignment and link scheduling in multi-radio mesh wireless networks utilizing a constant factor approximation technique that models the interference and fairness constraints and is able to account for the number of radios at each of the wireless nodes of a wireless mesh network.

US Patent:

7836181, Nov 16, 2010

Filed:

Aug 17, 2005

Appl. No.:

11/205768

Inventors:

Yigal Bejerano - Springfield NJ, US
Seung-Jae Han - Basking Ridge NJ, US
Li Li - Iselin NJ, US

Assignee:

Alcatel-Lucent USA Inc. - Murray Hill NJ

International Classification:

G06F 15/173

US Classification:

709226

Abstract:

Association control is utilized for associating wireless local area network users with at least one wireless local area network access point and thereby achieving simultaneous fairness and load balancing. In the present method, a network operation center receives user parameters from each user in the wireless network via the access points. It then sets out both to determine a set of associations between each user and one or more access points based on the user parameters using fractional load balancing and produce a second set of associations by rounding so that, in said second set, each user is associated with only one access point. The present method achieves close to optimal load balancing and max-min fairness while outperforming commonly-used heuristic approaches.

US Patent:

7885271, Feb 8, 2011

Filed:

Aug 20, 2008

Appl. No.:

12/194601

Inventors:

Li Li - Edison NJ, US
Marina K. Thottan - Westfield NJ, US
Minlan Yu - Princeton NJ, US

Assignee:

Alcatel-Lucent USA Inc. - Murray Hill NJ

International Classification:

H04L 12/28
G01R 31/08

US Classification:

370400, 370252, 370255, 37039521

Abstract:

A network configuration that supports latency-equalization (LEQ) routing by effectively “storing” packets on communication links, rather than at end points. A suitable network configuration is found by (i) identifying a candidate pool of routers through which the participating client terminals and application servers can exchange packets intended for LEQ routing and (ii) analyzing the delay inventory corresponding to the network paths connecting the client terminals and application servers, through those routers. Based on the analysis, M routers from the candidate pool are selected to serve as hub nodes. Each participating client terminal is assigned m of these M hub nodes and, thereafter, directs and receives its packets intended for LEQ routing through one of these m hub nodes.

US Patent:

8042017, Oct 18, 2011

Filed:

Apr 24, 2007

Appl. No.:

11/789287

Inventors:

Milind M Buddhikot - Manalapan NJ, US
Li Li - Edison NJ, US
Scott C Miller - Freehold NJ, US
Ramachandran Ramjee - Summit NJ, US

Assignee:

Alcatel Lucent - Paris

International Classification:

G08C 25/02
H04L 1/18

US Classification:

714748, 370328, 370331, 370338

Abstract:

The present invention demonstrates how network-coding can be applied to a deterministic broadcast approach, resulting in significant reductions in the number of transmissions in the network. We propose two algorithms, that rely only on local two-hop topology information and make extensive use of opportunistic listening to reduce the number of transmissions: 1) a simple XOR-based coding algorithm and 2) a Reed-Solomon based coding algorithm that determines the optimal coding gain achievable for a coding algorithm that relies only on local information.

US Patent:

8081567, Dec 20, 2011

Filed:

Jan 30, 2008

Appl. No.:

12/011908

Inventors:

Li (Erran) Li - Edison NJ, US
Tian Bu - Basking Ridge NJ, US
Scott C. Miller - Freehold NJ, US
Aiyou Chen - New Providence NJ, US

Assignee:

Alcatel Lucent - Paris

International Classification:

G08C 15/00

US Classification:

370230, 370310, 709223

Abstract:

A system and method for network based detection of wireless data subscribers using network address translation devices is provided. The method includes identifying a minimum number of devices showing the same internet protocol address. Packet identification sequences may include port numbers or internet protocol identification numbers. The method continues with grouping these applications by their packet identification sequences and applying detection logic where detection logic yields a conclusion that there are multiple host computers when a set of applications appears in a plurality of packet identification sequences. This method is particularly useful when internet protocol addresses are dynamic, as opposed to static. This method overcomes previous embodiments known in the art by being able to account for and work with live traffic, which enables real time detection.

US Patent:

8134934, Mar 13, 2012

Filed:

Sep 21, 2009

Appl. No.:

12/563476

Inventors:

Aiyou Chen - New Providence NJ, US
Jin Cao - Edison NJ, US
Li Li - Edison NJ, US

Assignee:

Alcatel Lucent - Paris

International Classification:

H04J 3/14

US Classification:

370253, 370229, 370230, 370235

Abstract:

A network-equipment-implemented method and apparatus for tracking durations of flows received at a network node in consecutive intervals utilizes two counting bloom filters in ping-pong operation to reduce memory and processing. Identifiers for flows that exceed a predetermined duration or number of intervals are stored in a long-duration flow-identifier table. Hash functions used within the counting bloom filters and optionally used in the long-duration flow-identifier table are chosen to minimize the probability of false positives in the detection of long-duration flows. In some embodiments, flows are sampled to conserve memory and processing resources at the risk of missing detection of some long-duration flows.