Packet delay under the golden ratio weighted tdm policy in a multiple-access channel
IEEE Transactions on Information Theory
Exact computation of optimal inventory policies over an unbounded horizon
Mathematics of Operations Research
Pinwheel scheduling with two distinct numbers
Theoretical Computer Science
General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction
IEEE Transactions on Computers
Feasibility of scheduling lot sizes of three products on one machine
Management Science
Energy efficient indexing on air
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Cell multiplexing in ATM networks
IEEE/ACM Transactions on Networking (TON)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Log-time algorithms for scheduling single and multiple channel data broadcast
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
The scheduling of maintenance service
Discrete Applied Mathematics
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal broadcasting of two files over an asymmetric channel
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile computing and communications
Minimizing Service and Operation Costs of Periodic Scheduling
Mathematics of Operations Research
Broadcast Scheduling for Information Distribution
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Data Broadcast Scheduling: On-line and Off-line Algorithms
Data Broadcast Scheduling: On-line and Off-line Algorithms
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
A New Hybrid Scheduling Framework for Asymmetric Wireless Environments with Request Repetition
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
SOM: Dynamic Push-Pull Channel Allocation Framework for Mobile Data Broadcasting
IEEE Transactions on Mobile Computing
FCLOS: A client-server architecture for mobile OLAP
Data & Knowledge Engineering
Hi-index | 0.00 |
In broadcast disks systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. Broadcast disks systems are particularly attractive in settings where the potential customers have a highly-asymmetric communication capabilities, i.e., receiving is significantly cheaper than transmitting. This is the case with satellite networks, mobile hosts in wireless networks, and Teletext system.The fundamental algorithmic problem for such systems is to determine the broadcast schedule based on the demand probability of items, and the cost incurred to the system by clients waiting. The goal is to minimize the mean access cost of a random client. Typically, it was assumed that the access cost is proportional to the waiting time. In this paper, we ask what are the best broadcast schedules for access costs which are arbitrary polynomials in the waiting time. These may serve as reasonable representations of reality in many cases, where the "patience" of a client is not necessarily proportional to its waiting time.We present an asymptotically optimal algorithm for a fractional model, where the bandwidth may be divided to allow for fractional concurrent broadcasting. This algorithm, besides being justified in its own right, also serves as a lower bound against which we test known discrete algorithms. We show that the Greedy algorithm has the best performance in most cases. Then we show that the performance of other algorithms deteriorate exponentially with the degree of the cost polynomial and approaches the fractional solution for sub-linear cost. Finally, we study the quality of approximating the greedy schedule by a finite schedule.