Multicast pull scheduling: When fairness is fine

DOI10.1007/S00453-003-1018-5MaRDI QIDQ1400899zbMATH OpenOpenAlexFDO

Authors Jeff Edmonds, Kirk Pruhs

Publication date 17 August 2003

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-003-1018-5

zbMATH Keywords

SchedulingMulticastResource augmentationBroadcast

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2119692
• Time-dependent multi-scheduling of multicast
• Scheduling broadcasts in wireless networks
• Algorithms – ESA 2004
• scientific article; zbMATH DE number 1670667

Cited in

(13)

• scientific article; zbMATH DE number 2119692 (Why is no real title available?)
• scientific article; zbMATH DE number 6381650 (Why is no real title available?)
• A note on on-line broadcast scheduling with deadlines
• scientific article; zbMATH DE number 1981013 (Why is no real title available?)
• Scheduling scheme of IPTV multicast traffic control based on fair service and multidimensional weighted round robin
• Scheduling to minimize energy and flow time in broadcast scheduling
• Computing and Combinatorics
• A maiden analysis of longest wait first
• scientific article; zbMATH DE number 1947442 (Why is no real title available?)
• scientific article; zbMATH DE number 1726637 (Why is no real title available?)
• A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
• A near optimal scheduler for on-demand data broadcasts
• A comparison of multicast pull models

This page was built for publication: Multicast pull scheduling: When fairness is fine

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