Presents
Implementing Frequency Division (FD) with Time Division (TD): The Broadcast Disks Problem
Amotz Barnoy, PhD
AT&T Research Labs
3:00pm, March 21, 2000
ECEC 202, New Jersey Institute of Technology
Abstract
Consider the problem of scheduling activities of several types under the constraint that at most a fixed number of activities can be scheduled in any single period. Any given activity type is associated with a service cost, and an operating cost that increases linearly with the number of periods since the last service of this type. The problem is to find an optimal schedule that minimizes the long-run average cost per period.
Applications of such a model are the scheduling of maintenance service to machines, multi-item replenishment of stock, and minimizing the mean response time in {\em broadcast disks}. Broadcast disks gained a lot of attention recently, since they are used to model backbone communications in wireless systems, Teletext systems, and web caching in satellite systems.
The talk will concentrate on the broadcast disks application. We will present the problem, some solutions and open problems.
About the Speaker
Dr. Amotz Bar-Noy received a BSc degree in 1981 in Mathematics and Computer Science and PhD degree in 1987 in Computer Science, both from the Hebrew University, Israel. From 1987 to 1989 he was a post-doc fellow in Stanford University, California. From 1989 to 1996 he was a Research Staff Member with the IBM T.J. Watson Research Center, New York. Since 1995 he has been an associate Professor with the Electrical Engineering - Systems department of Tel Aviv University, Israel. He has been with AT&T research labs in New Jersey since 1999.
His main areas of interest are: Communication Networks, Combinatorial Optimization and Algorithms, Parallel and Distributed Computing.
For more information, contact Dr. Yuguang "Michael" Fang, (973) 596-6594, . For directions, visit http://www.njit.edu/University/Directions.html.