Rate vs. buffer size--greedy information gathering on the line

DOI10.1145/1978782.1978787zbMath1295.68043OpenAlexW2079815698MaRDI QIDQ3189015

Adi Rosén, Gabriel Scalosub

Publication date: 9 September 2014

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

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

zbMATH Keywords

competitive analysisonline algorithmsbuffer managementinformation gatheringcompetitive 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) Network protocols (68M12) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Competitive buffer management with packet dependencies ⋮ Packet forwarding with swaps

This page was built for publication: Rate vs. buffer size--greedy information gathering on the line