On the public citation graph

An Optimal Randomized Online Algorithm for QoS Buffer Management

0 signed · 38 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/0471667196.ess1266.pub2openalex-snapshot
International Statistical Review
inferredcites →https://doi.org/10.1007/978-3-540-74208-1_2openalex-snapshot
A Knapsack Secretary Problem with Applications
inferredcites →https://doi.org/10.1007/978-3-540-92185-1_63openalex-snapshot
Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems
inferredcites →https://doi.org/10.1007/s00453-001-0003-0openalex-snapshot
Optimal Search and One-Way Trading Online Algorithms
inferredcites →https://doi.org/10.1007/s00453-005-1159-9openalex-snapshot
Management of Multi-Queue Switches in QoS Networks
inferredcites →https://doi.org/10.1007/s00453-008-9217-8openalex-snapshot
Optimal Algorithms for k-Search with Application in Option Pricing
inferredcites →https://doi.org/10.1007/s10951-016-0474-0openalex-snapshot
Non-preemptive buffer management for latency sensitive packets
inferredcites →https://doi.org/10.1016/j.jalgor.2004.04.007openalex-snapshot
Analysis of queueing policies in QoS switches
inferredcites →https://doi.org/10.1016/j.sorms.2014.08.001openalex-snapshot
Online algorithms for conversion problems: A survey
inferredcites →https://doi.org/10.1016/j.tcs.2014.01.027openalex-snapshot
The online knapsack problem: Advice and randomization
inferredcites →https://doi.org/10.1109/infcom.2000.832216openalex-snapshot
Competitive queue policies for differentiated services
inferredcites →https://doi.org/10.1109/sfcs.1992.267758openalex-snapshot
Competitive analysis of financial games
inferredcites →https://doi.org/10.1137/1.9781611976465openalex-snapshot
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/110856745openalex-snapshot
Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
inferredcites →https://doi.org/10.1137/s0097539701399666openalex-snapshot
Buffer Overflow Management in QoS Switches
inferredcites →https://doi.org/10.1137/s0895480195290017openalex-snapshot
Improved Algorithms and Analysis for Secretary Problems and Generalizations
inferredcites →https://doi.org/10.1145/1073970.1073972openalex-snapshot
Randomized qeue management for DiffServ
inferredcites →https://doi.org/10.1145/1583991.1584070openalex-snapshot
Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms
inferredcites →https://doi.org/10.1145/1753171.1753195openalex-snapshot
A survey of buffer management policies for packet switches
inferredcites →https://doi.org/10.1145/2494232.2465751openalex-snapshot
Online load balancing under graph constraints
inferredcites →https://doi.org/10.1145/2637364.2591980openalex-snapshot
An online auction framework for dynamic resource provisioning in cloud computing
inferredcites →https://doi.org/10.1145/3078505.3078543openalex-snapshot
Hour-Ahead Offering Strategies in Electricity Market for Power Producers with Storage and Intermittent Supply
inferredcites →https://doi.org/10.1145/3084460openalex-snapshot
Optimal Posted Prices for Online Cloud Resource Allocation
inferredcites →https://doi.org/10.1145/343477.343511openalex-snapshot
Optimal smoothing schedules for real-time streams (extended abstract)
inferredcites →https://doi.org/10.1145/571825.571851openalex-snapshot
Nearly optimal FIFO buffer management for DiffServ
inferredcites →https://doi.org/10.14257/ijgdc.2013.6.5.09openalex-snapshot
Cloud Computing Pricing Models: A Survey

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.peva.2021.102249openalex-snapshot
Competitive bidding strategies for online linear optimization with inventory management constraints
inferred← citeshttps://doi.org/10.1109/ciss.2019.8693056openalex-snapshot
Online Linear Programming with Uncertain Constraints : (Invited Paper)
inferred← citeshttps://doi.org/10.1109/infocom52122.2024.10621320openalex-snapshot
Competitive Online Age-of-Information Optimization for Energy Harvesting Systems
inferred← citeshttps://doi.org/10.1109/iros47612.2022.9981400openalex-snapshot
AFR: An Efficient Buffering Algorithm for Cloud Robotic Systems
inferred← citeshttps://doi.org/10.1109/iros51168.2021.9635950openalex-snapshot
ORBBuf: A Robust Buffering Method for Remote Visual SLAM
inferred← citeshttps://doi.org/10.1109/iwqos.2018.8624184openalex-snapshot
Competitive Online Scheduling Algorithms with Applications in Deadline-Constrained EV Charging
inferred← citeshttps://doi.org/10.1109/ton.2025.3582413openalex-snapshot
Optimal Algorithms for Online Age-of-Information Optimization in Energy Harvesting Systems
inferred← citeshttps://doi.org/10.1145/3219617.3219629openalex-snapshot
An Optimal Randomized Online Algorithm for QoS Buffer Management
inferred← citeshttps://doi.org/10.1145/3292040.3219629openalex-snapshot
An Optimal Randomized Online Algorithm for QoS Buffer Management
inferred← citeshttps://doi.org/10.1145/3308809.3308825openalex-snapshot
An Optimal Randomized Online Algorithm for QoS Buffer Management
inferred← citeshttps://doi.org/10.1145/3379482openalex-snapshot
Online Linear Optimization with Inventory Management Constraints
inferred← citeshttps://doi.org/10.1145/3570361.3613276openalex-snapshot
Enabling Resilience in Virtualized RANs with Atlas
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.