Time-dependent multi-scheduling of multicast

DOI10.1145/1644015.1644029MaRDI QIDQ2930289zbMATH OpenOpenAlexFDO

Authors Rami Cohen, Danny Raz, Dror Rawitz

Publication date 18 November 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1644015.1644029

zbMATH Keywords

approximation algorithmslocal ratiomulticastscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Algorithms – ESA 2004
• Optimal receiver scheduling algorithms for a multicast problem
• Layered multicast scheduling for the L_ objective
• Algorithms and Computation
• On multicast algorithms for heterogeneous networks of workstations

Cited in

(10)

• Multicast pull scheduling: When fairness is fine
• Scheduling time-constrained multicast messages in circuit-switched tree networks.
• scientific article; zbMATH DE number 1726640 (Why is no real title available?)
• Layered multicast scheduling for the L_ objective
• scientific article; zbMATH DE number 1947442 (Why is no real title available?)
• scientific article; zbMATH DE number 2080515 (Why is no real title available?)
• Algorithms – ESA 2004
• Algorithms and Computation
• Multimedia information delivery over wireless channels
• A comparison of multicast pull models

This page was built for publication: Time-dependent multi-scheduling of multicast

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