A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast

DOI10.1007/11809678_35MaRDI QIDQ3591340zbMATH OpenOpenAlexFDO

Authors

Publication date 10 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11809678_35

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
• A Near Optimal Scheduler for On-Demand Data Broadcasts
• A near optimal scheduler for on-demand data broadcasts
• ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
• Scheduling real-time requests in on-demand data broadcast environments

Cited in

(2)

• Design and analysis of online batching systems
• Competitive analysis of most-request-first for scheduling broadcasts with start-up delay

This page was built for publication: A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591340)