Approximation and Online Algorithms
From MaRDI portal
Publication:5713426
DOI10.1007/B106130zbMATH Open1124.68456OpenAlexW4299357393MaRDI QIDQ5713426FDOQ5713426
Publication date: 14 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106130
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cited In (9)
- A universal randomized packet scheduling algorithm
- On queuing lengths in on-line switching
- Universal Bufferless Packet Switching
- Title not available (Why is that?)
- On the population dynamics of the malaria vector
- Packet Switching Networks for Multiprocessors and Data Flow Computers
- Randomized competitive algorithms for online buffer management in the adaptive adversary model
- Title not available (Why is that?)
- Packet Bundling
Recommendations
- Competitive on-Line switching policies 👍 👎
- Online packet scheduling for CIOQ and buffered crossbar switches 👍 👎
- An experimental study of new and known online packet buffering algorithms 👍 👎
- An Experimental Study of New and Known Online Packet Buffering Algorithms 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Approximation and Online Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713426)
