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

DOI10.1145/1978782.1978787MaRDI QIDQ3189015zbMATH OpenOpenAlexFDO

Authors 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

online algorithmsbuffer managementcompetitive analysisinformation gatheringcompetitive network throughput

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) 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

• Algorithms – ESA 2005
• On the Performance of Greedy Algorithms in Packet Buffering
• Buffer size for routing limited-rate adversarial traffic
• On the performance of greedy algorithms in packet buffering
• The network as a storage device: dynamic routing with bounded buffers

Cited in

(3)

• Algorithms – ESA 2005
• Packet forwarding with swaps
• Competitive buffer management with packet dependencies

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

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