Campus Event Calendar
Event Entry
What and Who
FlexSched*: A Parameterized Data Schedule Generator for Multi-Channel Broadcast Systems
Andre Seifert
Uni Konstanz
Talk
AG 1, AG 2, AG 3, AG 4, AG 5
AG Audience
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 9 November 2005
14:00
60 Minutes
46.1 - MPII
021
Saarbrücken
Abstract
In wireless asymmetric communication networks, broadcasting is an efficient way of simultaneously disseminating data to a large number of clients. In this talk we discuss the problem of finding an efficient schedule for broadcasting a given set of data items over multiple physical broadcast channels. The goal here is threefold: (a) to minimize
the cost of building the broadcast program, (b) to minimize the average access latency to fulfill data requests of mobile clients, and (c) to provide the ability to tune the period length of the broadcast schedule so as to ease
air-indexing and to enable clients to determine when the desired data item is broadcast next. To achieve these goals, a parameterized scheduler, called FlexSched*, will be proposed that extends the capabilities of our FlexSched scheduler by allowing data objects to have arbitrary length and by enabling system engineers to specify a limit on the maximum period length of the schedule. Since the scheduling problem of data items with different lengths for an arbitrary number of physical broadcast channels is strong NP-hard, we devise a heuristic polynomial time algorithm that uses a divide-and-conquer approach to efficiently obtain a solution to the problem.
the cost of building the broadcast program, (b) to minimize the average access latency to fulfill data requests of mobile clients, and (c) to provide the ability to tune the period length of the broadcast schedule so as to ease
air-indexing and to enable clients to determine when the desired data item is broadcast next. To achieve these goals, a parameterized scheduler, called FlexSched*, will be proposed that extends the capabilities of our FlexSched scheduler by allowing data objects to have arbitrary length and by enabling system engineers to specify a limit on the maximum period length of the schedule. Since the scheduling problem of data items with different lengths for an arbitrary number of physical broadcast channels is strong NP-hard, we devise a heuristic polynomial time algorithm that uses a divide-and-conquer approach to efficiently obtain a solution to the problem.
Contact
Gerhard Weikum
--email hidden
passcode not visible
logged in users only
Petra Schaaf, 11/03/2005 10:37 -- Created document.