On the public citation graph
Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
0 signed · 28 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s00224-011-9346-3openalex-snapshot
Buffer Management for Colored Packets with Deadlines
inferredcites →https://doi.org/10.1007/s00453-003-1025-6openalex-snapshot
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
inferredcites →https://doi.org/10.1007/s00453-005-1158-xopenalex-snapshot
Improved Competitive Guarantees for QoS Buffering
inferredcites →https://doi.org/10.1007/s00453-008-9236-5openalex-snapshot
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
inferredcites →https://doi.org/10.1016/j.jda.2005.03.005openalex-snapshot
Online competitive algorithms for maximizing weighted throughput of unit jobs
inferredcites →https://doi.org/10.1016/j.orl.2010.05.012openalex-snapshot
Bounded delay packet scheduling in a bounded buffer
inferredcites →https://doi.org/10.1016/j.tcs.2011.05.015openalex-snapshot
Randomized competitive algorithms for online buffer management in the adaptive adversary model
inferredcites →https://doi.org/10.1023/a:1022904408360openalex-snapshot
Competitive On-Line Scheduling with Level of Service
inferredcites →https://doi.org/10.1137/s0097539701399666openalex-snapshot
Buffer Overflow Management in QoS Switches
inferredcites →https://doi.org/10.1145/1290672.1290687openalex-snapshot
Improved online algorithms for buffer management in QoS switches
inferredcites →https://doi.org/10.1145/1753171.1753195openalex-snapshot
A survey of buffer management policies for packet switches
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_29openalex-snapshot
An Optimal Algorithm for 2-Bounded Delay Buffer Management with Lookahead
inferred← citeshttps://doi.org/10.1007/978-3-319-28472-9_10openalex-snapshot
Maximizing Throughput in Energy-Harvesting Sensor Nodes
inferred← citeshttps://doi.org/10.1007/s00453-017-0393-2openalex-snapshot
Comparison-Based Buffer Management in QoS Switches
inferred← citeshttps://doi.org/10.1007/s00453-018-0421-xopenalex-snapshot
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
inferred← citeshttps://doi.org/10.1007/s10951-016-0474-0openalex-snapshot
Non-preemptive buffer management for latency sensitive packets
inferred← citeshttps://doi.org/10.1016/j.comcom.2021.10.008openalex-snapshot
Bounded delay scheduling with packet dependencies
inferred← citeshttps://doi.org/10.1016/j.orl.2021.01.010openalex-snapshot
Randomized two-valued bounded delay online buffer management
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.013openalex-snapshot
Online packet scheduling with bounded delay and lookahead
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.10.005openalex-snapshot
An optimal algorithm for 2-bounded delay buffer management with lookahead
inferred← citeshttps://doi.org/10.1109/infcomw.2014.6849241openalex-snapshot
Bounded delay scheduling with packet dependencies
inferred← citeshttps://doi.org/10.1137/1.9781611975482.9openalex-snapshot
A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines
inferred← citeshttps://doi.org/10.1137/21m1469753openalex-snapshot
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
inferred← citeshttps://doi.org/10.1145/3154494openalex-snapshot
An Optimal Randomized Online Algorithm for QoS Buffer Management
inferred← citeshttps://doi.org/10.1145/3219617.3219629openalex-snapshot
An Optimal Randomized Online Algorithm for QoS Buffer Management
inferred← citeshttps://doi.org/10.1145/3676887openalex-snapshot
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
inferred← citeshttps://doi.org/10.48550/arxiv.1403.0486openalex-snapshot
Online Algorithms for Machine Minimization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.