Title: New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation
Abstract: This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the competitive ratio of the problem. The novelty of our work is the introduction of a new job scheduling problem that allows cancellation. We prove that the broadcasting problem can be reduced to this scheduling problem. This reduction frees us from the complication of the broadcasting model and allows us to work on a conceptually simpler model for upper bound results.
Publication Year: 2004
Publication Date: 2004-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 43
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot