A comprehensive study of an online packet scheduling algorithm (Q391217): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086268226 / 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: Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buffer Overflow Management in QoS Switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934598 / rank
 
Normal rank

Latest revision as of 04:46, 7 July 2024

scientific article
Language Label Description Also known as
English
A comprehensive study of an online packet scheduling algorithm
scientific article

    Statements

    A comprehensive study of an online packet scheduling algorithm (English)
    0 references
    0 references
    10 January 2014
    0 references
    online algorithm
    0 references
    competitive analysis
    0 references
    buffer management
    0 references
    packet scheduling
    0 references

    Identifiers