Daniel H Andrews

US Patent:

6363334, Mar 26, 2002

Filed:

Feb 23, 1999

Appl. No.:

09/255945

Inventors:

Daniel Matthew Andrews - New Providence NJ
Yihao Lisa Zhang - New Providence NJ

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

G06F 1750

US Classification:

703 13, 703 2

Abstract:

A method is disclosed, for designing an access network that is to carry communication traffic between end nodes and a core network. Information is provided that describes end node locations, the level of demand associated with each end node, available trunk types and their related capacities, and a cost structure. The cost structure includes a fixed overhead cost for each trunk type, and a service charge per unit distance for each trunk type. The provided information is incorporated in a linear program to find an optimal-cost access network. The linear program is solved to obtain a provisional solution that defines the composition and usage of each link of the optimal-cost access network. For each such link, the composition is defined by a fractional level of investment (incurring a like fraction of the corresponding overhead charge) in each pertinent trunk type. The provisional solution is rounded such that each trunk in which there is a fractional investment is either removed, or replaced by a trunk in which there is an integral investment.

US Patent:

6496490, Dec 17, 2002

Filed:

Jul 9, 1998

Appl. No.:

09/112547

Inventors:

Daniel Matthew Andrews - New Providence NJ
Simon C. Borst - North Plainfield NJ
Francis Dominique - Elmwood Park NJ
Predrag Jelenkovic - New York NY
Krishnan Kumaran - Scotch Plains NJ
Philip Alfred Whiting - New Providence NJ

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

H04Q 700

US Classification:

370329, 455447, 455450

Abstract:

We disclose a method of dynamic channel assignment for wireless transmission systems that employ time or frequency multiplexing, or both time and frequency multiplexing. The invention is specifically addressed to the problem of avoiding interference in the channels of such systems. In a broad aspect, the invention involves partitioning base stations of a network into non-interfering sets. Channels are allocated to the non-interfering sets according to need. Stages of channel reallocation take place periodically. The reallocation takes place through coordinated activity by the base stations. That is, the channel reallocation is carried out in response to information that is exchanged between base stations, or it is centrally directed by the network in response to information passed to the network by the base stations.

US Patent:

6771598, Aug 3, 2004

Filed:

Mar 23, 2000

Appl. No.:

09/533725

Inventors:

Daniel Matthew Andrews - New Providence NJ

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

H04L 1226

US Classification:

370230, 3703952, 3703954

Abstract:

A method is disclosed for determining the admissibility of an offered session of traffic of a specified class to a server in a packetized communication network. Each class c has a peak traffic rate r(c). The server has a total processing rate C. Admitted packets are scheduled according to an EDF scheduling discipline. The method for determining admissibility comprises defining an operating point for the server. The operating point represents the number of sessions N of each respective class currently offered or currently being served. The method further comprises determining whether the defined operating point falls within a set of operating points that together define an admissible region. The admissible region consists of operating points for which the probability of violating a delay bound for any packet is below a threshold. The determination of the admissible region involves principles of statistical multiplexing.

US Patent:

7065046, Jun 20, 2006

Filed:

Apr 6, 2001

Appl. No.:

09/827999

Inventors:

Daniel M. Andrews - New Providence NJ, US
Kameshwar V. Munagala - Stanford CA, US
Aleksandr Stolyar - Basking Ridge NJ, US

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

G01R 31/08
H04L 12/26

US Classification:

370230, 370229, 370412, 370413, 370397, 370398, 370396, 370429

Abstract:

A method and apparatus are disclosed for scheduling arriving data packets for input to a switch having a plurality of input channels, and a plurality of output channels, the scheduling method is performed in successive scheduling phases where each scheduling phase further comprises at least log N scheduling iterations. The method is a parallelized weight-driven input queued switch scheduling algorithm which possesses good bandwidth and delay properties, is stable, and can be configured to offer various delay and quality of service (QoS) guarantees. The scheduling method utilizes envelope scheduling techniques and considers partially filled envelopes for scheduling.

US Patent:

7174180, Feb 6, 2007

Filed:

Jul 21, 2004

Appl. No.:

10/895743

Inventors:

Daniel Matthew Andrews - New Providence NJ, US
Aleksandr Stolyar - Basking Ridge NJ, US

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

H04Q 7/20
H04L 12/28
H04L 12/56

US Classification:

455512, 455513, 4554353, 455517, 455518, 37039542, 37039541, 37039521, 3703954

Abstract:

Systems and techniques for scheduling of data transmission to remote mobile units so as to provide at least an acceptably low level of delay. A scheduler computes an urgency value for each data stream serving a mobile unit and sets the urgency value equal to the highest urgency value of a data stream serving the mobile unit. The scheduler computes a scheduling priority for each mobile unit based on a computation that takes into account the urgency value of the mobile unit and schedules the highest priority mobile unit for service, selecting the highest priority data stream serving the mobile unit scheduled for transmission. The urgency value for a data stream depends on the sensitivity of the data stream to delay and the delay experienced by the data stream. Computation of the urgency value may take into account a delay limit associated with the data stream.

US Patent:

7298719, Nov 20, 2007

Filed:

Apr 15, 2002

Appl. No.:

10/122660

Inventors:

Daniel Matthew Andrews - New Providence NJ, US
Lijun Qian - Piscataway NJ, US
Aleksandr Stolyar - Basking Ridge NJ, US

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

H04Q 7/00

US Classification:

370329, 370468

Abstract:

A new approach is described for scheduling uplink or downlink transmissions in a network having remote terminals communicating with a central hub. The scheduler keeps track of a token count. The token count for a given remote terminal is incremented by a target amount in each pertinent timeslot, but is also decremented each time that the remote terminal is served. The amount of the decrement for one timeslot is the amount of data served, i. e. , transmitted to or from the remote terminal, in that timeslot. In exemplary embodiments of the invention, the target amount by which T is incremented depends on the current value of T. Whenever the token count is non-negative (i. e. , whenever it has a positive or zero value), the target amount is a desired floor, or lower limit, on an average amount of data delivered to or from the given remote terminal in one timeslot. Whenever the token count is negative, the target amount is a desired ceiling, or upper limit, on the same average amount of data delivered. In each timeslot, each remote terminal is assigned a weight proportional to a product of at least two factors: a function relating the individual remote terminal to overall network performance, and at least one increasing function of the token count.

US Patent:

7633865, Dec 15, 2009

Filed:

Jan 19, 2007

Appl. No.:

11/655613

Inventors:

Daniel Matthew Andrews - New Providence NJ, US
Piyush Gupta - Piscataway NJ, US
Iraj Saniee - New Providence NJ, US
Aleksandr Stolyar - Basking Ridge NJ, US

Assignee:

Alcatel-Lucent USA Inc. - Murray Hill NJ

International Classification:

H04L 12/28
H04L 12/56
G06F 15/16

US Classification:

370230, 370235, 370413, 709232

Abstract:

A technique for controlling a packet data network to maintain network stability and efficiently utilize network resources through mechanisms involving per-destination queues and urgency weights for medium access control. The technique jointly controls congestion, scheduling, and contention resolution on hop-by-hop basis, such that the length of queues of packets at a node does not become arbitrarily large. In one embodiment, queue lengths and urgency weights may be transmitted and received via medium access control messages.

US Patent:

8554894, Oct 8, 2013

Filed:

Mar 12, 2010

Appl. No.:

12/723116

Inventors:

Daniel Matthew Andrews - Chatham NJ, US
Yihao Zhang - Chatham NJ, US
Antonio Fernandez - Madrid, ES

Assignee:

Alcatel Lucent - Paris

International Classification:

G06F 15/16

US Classification:

709223, 709231, 709234, 709235, 709236, 709238, 709239, 709240

Abstract:

A network comprising a plurality of network devices is configured to implement scheduling for energy efficiency. In one aspect, a set of network devices interconnected in a line within a network is identified, and a common frame size is established. For each of the network devices of the line, active and inactive periods for that network device are scheduled in a corresponding frame having the common frame size, with the frames in the respective network devices of the line being time shifted relative to one another by designated offsets. For each of one or more of the active periods of each of the network devices of the line, received packets are scheduled for processing in that network device.