Edmund M Yeh

US Patent:

6603753, Aug 5, 2003

Filed:

Dec 3, 1999

Appl. No.:

09/454040

Inventors:

Anand S. Bedekar - Seattle WA
Simon C. Borst - Amsterdam, NL
Kavita Ramanan - New Providence NJ
Philip A. Whiting - New Providence NJ
Edmund M. Yeh - Houston TX

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

H04B 7216

US Classification:

370335, 370318, 370326, 370329, 455452, 455509

Abstract:

A base station of a code division, multiple access (CDMA) telecommunications system employs scheduling of data transmission signals to corresponding user transceivers in down-link channels of a data network. One or more user transceivers may be in communication with a base station within a cell, and each user may have a minimum data rate requirement. In accordance with the present invention, the scheduling of user data transmission follows the constraints that 1) each base station transmits to user transceivers one at a time, and 2) the base station uses full available power for the down-link channel when transmitting (for data networks only). Given a data network of users, the method of scheduling and data rates may be modeled in accordance with a linear programming problem optimized according to a predefined criterion. In addition, the present method may be employed in a hybrid CDMA/time-share system to reduce power of data channels in communication with user transceivers near the base station. A continuum of rates may be achieved based on the system signal to interference ratio (S/I).

US Patent:

6763009, Jul 13, 2004

Filed:

Dec 3, 1999

Appl. No.:

09/454039

Inventors:

Anand S. Bedekar - Seattle WA
Simon C. Borst - Amsterdam, NL
Kavita Ramanan - New Providence NJ
Philip A. Whiting - New Providence NJ
Edmund M. Yeh - Houston TX

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

H04Q 720

US Classification:

370335, 370318, 370326, 455450, 455522

Abstract:

A base station of a code division, multiple access (CDMA) telecommunications system employs scheduling of data transmission signals to corresponding user transceivers in down-link channels of a data network. One or more user transceivers may be in communication with a base station within a cell, and each user may have a minimum data rate requirement. In accordance with the present invention, the scheduling of user data transmission follows the constraints that 1) each base station transmits to user transceivers one at a time, and 2) the base station uses full available power for the down-link channel when transmitting (for data networks only). Given a data network of users, the method of scheduling and data rates may be modeled in accordance with a linear programming problem optimized according to a predefined criterion. In addition, the present method may be employed in a hybrid CDMA/time-share system to reduce power of data channels in communication with user transceivers near the base station. A continuum of rates may be achieved based on the system signal to interference ratio (S/I).

US Patent:

20210112135, Apr 15, 2021

Filed:

May 7, 2019

Appl. No.:

17/050152

Inventors:

- Boston MA, US
Armin Moharrer - Chestnut Hill MA, US
Efstratios Ioannidis - Boston MA, US
Edmund Meng Yeh - Newton MA, US

International Classification:

H04L 29/08

Abstract:

The invention relates to a computer-implemented method, a corresponding a computer program product and a corresponding apparatus for distributing cached content in a network, the computer-implemented method comprising: collecting statistics regarding requests made and paths taken by the requests from source nodes to server nodes via intermediate nodes, the source nodes, intermediate nodes, and server nodes interconnected by edges having queues with respective queue sizes associated therewith, the requests including indications of content items to be retrieved; storing the content items at the server nodes; caching, by the intermediate nodes, the content items up to a caching capacity; and performing caching decisions that determine which of the content items are to be cached at which of the intermediate nodes, based upon costs that are monotonic, non-decreasing functions of the sizes of the queues.