Greedy Packet Scheduling on Shortest Paths

DOI10.1006/JAGM.1993.1024MaRDI QIDQ4696651zbMATH OpenOpenAlexFDO

Authors Yishay Mansour, Boaz Patt-Shamir

Publication date 29 June 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/6755fff76b586b85e09b742e299dac4aec38df37

zbMATH Keywords

greedy scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Greedy Packet Scheduling
• Average-case analysis of greedy packet scheduling
• Average-case analysis of greedy packet scheduling (extended abstract)
• Scheduling in synchronous networks and the greedy algorithm
• Source routing and scheduling in packet networks

Cited in

(15)

• Greedy Packet Scheduling
• Average-case analysis of greedy packet scheduling (extended abstract)
• Average-case analysis of greedy packet scheduling
• scientific article; zbMATH DE number 910914 (Why is no real title available?)
• Competitive weighted throughput analysis of greedy protocols on DAGs
• Bounding Residence Times for Atomic Dynamic Routings
• Universal-stability results and performance bounds for greedy contention-resolution protocols
• scientific article; zbMATH DE number 2088473 (Why is no real title available?)
• Two exact algorithms for the packet scheduling problem
• Networks on which hot-potato routing does not livelock
• Source routing and scheduling in packet networks
• Scheduling problems in transportation networks of line topology
• Competitive weighted throughput analysis of greedy protocols on dags
• On the benefit of supporting virtual channels in wormhole routers
• Adaptive packet routing for bursty adversarial traffic

This page was built for publication: Greedy Packet Scheduling on Shortest Paths

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