Evaluation of a broadcast scheduling algorithm

DOI10.1007/3-540-44803-9_15MaRDI QIDQ4790631zbMATH OpenFDO

Authors Murat Karakaya, Özgür Ulusoy

Publication date 4 February 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2151/21510182, http://hdl.handle.net/11693/27615

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• Scheduling broadcasts in wireless networks
• Scheduling broadcasts in wireless networks
• scientific article; zbMATH DE number 1982183
• Polynomial-time approximation scheme for data broadcast
• scientific article; zbMATH DE number 1445348

Cited in

(7)

• Better Scalable Algorithms for Broadcast Scheduling
• Push less and pull the current highest demanded data item to decrease the waiting time in asymmetric communication environments
• scientific article; zbMATH DE number 1982183 (Why is no real title available?)
• Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
• A dynamic hybrid scheduling algorithm for heterogeneous asymmetric environments
• Pull-based broadcasting with timing constraints
• Real time stochastic scheduling in broadcast systems with decentralized data storage

This page was built for publication: Evaluation of a broadcast scheduling algorithm

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