Competitive analysis of scheduling algorithms for aggregated links
DOI10.1007/S00453-007-9053-2zbMATH Open1147.68011OpenAlexW2121732764MaRDI QIDQ930606FDOQ930606
Authors: Wojciech Jawor, Marek Chrobak, Christoph Dürr 
Publication date: 1 July 2008
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.8418
Recommendations
- Competitive Analysis of Scheduling Algorithms for Aggregated Links
- Experimental Analysis of Scheduling Algorithms for Aggregated Links
- A Cross-Layer View of Optimal Scheduling
- Competitive weighted throughput analysis of greedy protocols on dags
- Competitive weighted throughput analysis of greedy protocols on DAGs
- Link scheduling in polynomial time
- Scheduling in synchronous networks and the greedy algorithm
- Performance analysis of priority scheduling mechanisms under heterogeneous network traffic
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
Cited In (5)
- Title not available (Why is that?)
- Competitive Analysis of Aggregate Max in Windowed Streaming
- Competitive Analysis of Scheduling Algorithms for Aggregated Links
- Experimental Analysis of Scheduling Algorithms for Aggregated Links
- Analysis of the scheduling mechanism for virtualization of links with partial isolation
This page was built for publication: Competitive 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 Q930606)
