Greedy Packet Scheduling

DOI10.1137/S0097539791217695MaRDI QIDQ4326859zbMATH OpenOpenAlexFDO

Authors Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg

Publication date 27 March 1995

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539791217695

zbMATH Keywords

communication networksgreedy scheduling algorithmsshortest paths

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15) Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Communication theory (94A05)

Recommendations

• Greedy Packet Scheduling on Shortest Paths
• 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)

• Efficient delay routing
• Scheduling in synchronous networks and the greedy algorithm
• Average-case analysis of greedy packet scheduling
• Scheduling problems in transportation networks of line topology
• scientific article; zbMATH DE number 2088473 (Why is no real title available?)
• Source routing and scheduling in packet networks
• Baked-Potato Routing
• Greedy Packet Scheduling on Shortest Paths
• scientific article; zbMATH DE number 910914 (Why is no real title available?)
• Average-case analysis of greedy packet scheduling (extended abstract)
• Packet forwarding algorithms in a line network
• Mixed Criteria Packet Scheduling
• Bounding Residence Times for Atomic Dynamic Routings
• Competitive weighted throughput analysis of greedy protocols on dags
• A robust multi-priority topology-independent transmission schedule for packet radio networks

This page was built for publication: Greedy Packet Scheduling

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