Greedy packet scheduling on shortest paths (preliminary version)

DOI10.1145/112600.112615zbMath1314.68092OpenAlexW2148659537MaRDI QIDQ5255817

Yishay Mansour, Boaz Patt-Shamir

Publication date: 19 June 2015

Published in: Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Efficient delay routing ⋮ Database placement in communication networks for minimizing the overall transmission cost

This page was built for publication: Greedy packet scheduling on shortest paths (preliminary version)