An optimal lower bound for buffer management in multi-queue switches (Q476433): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3015166168 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1007.1535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive queue policies for differentiated services / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental study of new and known online packet buffering algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Performance of Greedy Algorithms in Packet Buffering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing throughput in multi-queue switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Management of multi-queue switches in QoS networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized competitive algorithms for online buffer management in the adaptive adversary model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online competitive algorithms for maximizing weighted throughput of unit jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with partial job values: does timesharing or randomization help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds on FIFO buffer management in QoS switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Algorithm for Agreeable Deadlines Packet Scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buffer Overflow Management in QoS Switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loss-bounded analysis for differentiated services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved competitive guarantees for QoS buffering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly optimal FIFO buffer management for two packet classes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal smoothing schedules for real-time streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of queueing policies in QoS switches / rank
 
Normal rank

Latest revision as of 08:41, 9 July 2024

scientific article
Language Label Description Also known as
English
An optimal lower bound for buffer management in multi-queue switches
scientific article

    Statements

    An optimal lower bound for buffer management in multi-queue switches (English)
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references
    packet buffering
    0 references
    buffer management
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references