Competitive weighted throughput analysis of greedy protocols on dags

DOI10.1145/1798596.1798603MaRDI QIDQ6486949zbMATHOpenAlexFDO

Authors Eyal Gordon, Adi Rosén, Eyal Gordon

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/1798596.1798603

zbMATH Keywords

online algorithmsbuffer managementcompetitive analysiscompetitive network throughput

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Competitive weighted throughput analysis of greedy protocols on DAGs
• Average-case analysis of greedy packet scheduling
• Greedy Packet Scheduling on Shortest Paths
• Average-case analysis of greedy packet scheduling (extended abstract)
• Greedy Packet Scheduling

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 Q6486949)