Analysis of queueing policies in QoS switches
From MaRDI portal
Publication:3159486
DOI10.1016/J.JALGOR.2004.04.007zbMATH Open1089.68027OpenAlexW2008545695WikidataQ115041881 ScholiaQ115041881MaRDI QIDQ3159486FDOQ3159486
Publication date: 16 February 2005
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.04.007
Recommendations
Cited In (13)
- A universal randomized packet scheduling algorithm
- An optimal algorithm for 2-bounded delay buffer management with lookahead
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
- Comparison-based buffer management in QoS switches
- On queuing lengths in on-line switching
- Preemptive and delay-based mechanisms to provide preference to emergency traffic
- Bounded delay packet scheduling in a bounded buffer
- Queues with switchover. -- A review and critique
- Title not available (Why is that?)
- Randomized competitive algorithms for online buffer management in the adaptive adversary model
- An optimal lower bound for buffer management in multi-queue switches
- Management of multi-queue switches in QoS networks
- Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
This page was built for publication: Analysis of queueing policies in QoS switches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159486)
