Average-case analysis of greedy packet scheduling

DOI10.1007/S00224-002-1095-XMaRDI QIDQ1871776zbMATH OpenOpenAlexFDO

Authors Zvi Lotker, Boaz Patt-Shamir

Publication date 4 May 2003

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-002-1095-x

zbMATH Keywords

scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

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

Cited in

(5)

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

This page was built for publication: Average-case analysis of greedy packet scheduling

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