Experimental Analysis of Scheduling Algorithms for Aggregated Links

DOI10.1007/978-3-540-93980-1_20MaRDI QIDQ3602845zbMATH OpenOpenAlexFDO

Authors Wojciech Jawor, Marek Chrobak, Mart L. Molle

Publication date 12 February 2009

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-93980-1_20

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• Competitive Analysis of Scheduling Algorithms for Aggregated Links
• Competitive analysis of scheduling algorithms for aggregated links
• A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis
• Congestion allocation for distributed networks: an experimental study
• A Cross-Layer View of Optimal Scheduling

Cites work

• Competitive analysis of scheduling algorithms for aggregated links

Cited in

(5)

• scientific article; zbMATH DE number 7404004 (Why is no real title available?)
• Competitive Analysis of Scheduling Algorithms for Aggregated Links
• scientific article; zbMATH DE number 1900304 (Why is no real title available?)
• Analysis of the scheduling mechanism for virtualization of links with partial isolation
• Competitive analysis of scheduling algorithms for aggregated links

This page was built for publication: Experimental Analysis of Scheduling Algorithms for Aggregated Links

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