Competitive weighted throughput analysis of greedy protocols on DAGs

DOI10.1145/1798596.1798603zbMath1300.68009OpenAlexW2090278743MaRDI QIDQ2930332

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

competitive analysisonline algorithmsbuffer managementcompetitive network throughput

Mathematics Subject Classification ID

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

Related Items (1)

Approximation algorithms for time-constrained scheduling on line networks

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