Competitive weighted throughput analysis of greedy protocols on DAGs

DOI10.1145/1073814.1073856MaRDI QIDQ5177245zbMATH OpenOpenAlexFDO

Authors Eyal Gordon, Adi Rosén

Publication date 10 March 2015

Published in Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Network protocols (68M12) Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Recommendations

• Competitive weighted throughput analysis of greedy protocols on dags
• Average-case analysis of greedy packet scheduling
• Average-case analysis of greedy packet scheduling (extended abstract)
• Greedy Packet Scheduling on Shortest Paths
• scientific article; zbMATH DE number 2079411

Cited in

(2)

• Competitive weighted throughput analysis of greedy protocols on dags
• Competitive analysis of scheduling algorithms for aggregated links

This page was built for publication: Competitive weighted throughput analysis of greedy protocols on DAGs

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