On the public citation graph

Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches

0 signed · 50 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.1023/a:1022848304724openalex-snapshot
Fair Scheduling for Input Buffered Switches
inferredcites →https://doi.org/10.1109/26.126711openalex-snapshot
Performance of a nonblocking space-division packet switch with correlated input traffic
inferredcites →https://doi.org/10.1109/26.780463openalex-snapshot
Achieving 100% throughput in an input-queued switch
inferredcites →https://doi.org/10.1109/35.668285openalex-snapshot
Issues and trends in router design
inferredcites →https://doi.org/10.1109/4236.735981openalex-snapshot
IP routers: new tool for gigabit networking
inferredcites →https://doi.org/10.1109/90.234856openalex-snapshot
A generalized processor sharing approach to flow control in integrated services networks: the single-node case
inferredcites →https://doi.org/10.1109/90.502236openalex-snapshot
Efficient fair queuing using deficit round-robin
inferredcites →https://doi.org/10.1109/icpp.2004.1327938openalex-snapshot
FIFO based multicast scheduling algorithm for VOQ packet switches
inferredcites →https://doi.org/10.1109/infcom.1995.515971openalex-snapshot
Providing bandwidth guarantees in an input-buffered crossbar switch
inferredcites →https://doi.org/10.1109/infcom.1996.497885openalex-snapshot
WF/sup 2/Q: worst-case fair weighted fair queueing
inferredcites →https://doi.org/10.1109/infcom.1998.662953openalex-snapshot
A generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism
inferredcites →https://doi.org/10.1109/infcom.2005.1498315openalex-snapshot
Credit based fair scheduling for packet switched networks
inferredcites →https://doi.org/10.1109/infcom.2005.1498327openalex-snapshot
Practical algorithms for performance guarantees in buffered crossbars
inferredcites →https://doi.org/10.1109/infocom.2006.135openalex-snapshot
Strong Performance Guarantees for Asynchronous Crossbar Schedulers
inferredcites →https://doi.org/10.1109/jsac.2003.810495openalex-snapshot
Deficit round-robin scheduling for input-queued switches
inferredcites →https://doi.org/10.1109/jsac.2003.810532openalex-snapshot
Output-queued switch emulation by fabrics with limited memory
inferredcites →https://doi.org/10.1109/tcom.1987.1096719openalex-snapshot
Input Versus Output Queueing on a Space-Division Packet Switch
inferredcites →https://doi.org/10.1109/tnet.2005.858449openalex-snapshot
On achieving fairness in the joint allocation of processing and bandwidth resources: principles and algorithms
inferredcites →https://doi.org/10.1109/tpds.2003.1167371openalex-snapshot
A fair resource allocation protocol for multimedia wireless networks
inferredcites →https://doi.org/10.1109/tpds.2007.70746openalex-snapshot
Max-Min Fair Scheduling in Input-Queued Switches
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/161541.161736openalex-snapshot
High-speed switch scheduling for local-area networks
inferredcites →https://doi.org/10.1145/633025.633052openalex-snapshot
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms
inferredcites →https://doi.org/10.1145/75246.75248openalex-snapshot
Analysis and simulation of a fair queueing algorithm
inferredcites →https://doi.org/10.1145/75247.75248openalex-snapshot
Analysis and simulation of a fair queueing algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1002/wcm.1004openalex-snapshot
Proportional bandwidth adjustment using BER ratios, in a two‐tier hierarchical NEMO system
inferred← citeshttps://doi.org/10.1007/978-3-030-37157-9_1openalex-snapshot
Fairness in Resource Allocation: Foundation and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-10625-5_19openalex-snapshot
Providing Performance Guarantees for Buffered Crossbar Switches without Speedup
inferred← citeshttps://doi.org/10.1007/s11277-012-0647-xopenalex-snapshot
Novel Fairness Improved Radio Resource Management Schemes for Best-Effort Service in OFDMA Systems
inferred← citeshttps://doi.org/10.1109/aciids.2009.16openalex-snapshot
How to Maximize User Satisfaction Degree in Multi-service IP Networks
inferred← citeshttps://doi.org/10.1109/dcoss-iot58021.2023.00037openalex-snapshot
EDICT: Simulation of Edge Interactions Across IoT-Enhanced Environments
inferred← citeshttps://doi.org/10.1109/glocom.2009.5425680openalex-snapshot
Fair Queueing Based Packet Scheduling for Buffered Crossbar Switches
inferred← citeshttps://doi.org/10.1109/glocom.2010.5684329openalex-snapshot
Reducing Crosspoint Buffers for Performance Guaranteed Asynchronous Crossbar Scheduling
inferred← citeshttps://doi.org/10.1109/glocom.2011.6134433openalex-snapshot
Queue-Length Proportional and Max-Min Fair Bandwidth Allocation for Best Effort Flows
inferred← citeshttps://doi.org/10.1109/glocomw.2010.5700470openalex-snapshot
Bandwidth allocation for best effort traffic to achieve 100% throughput
inferred← citeshttps://doi.org/10.1109/icfcc.2009.133openalex-snapshot
Bandwidth Resource Allocation
inferred← citeshttps://doi.org/10.1109/infocom.2008.69openalex-snapshot
Fair Scheduling through Packet Election
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470456openalex-snapshot
Achieve constant performance guarantees using asynchronous crossbar scheduling without speedup
inferred← citeshttps://doi.org/10.1109/micc.2009.5431429openalex-snapshot
Novel radio resource management schemes for best-effort service in OFDMA systems
inferred← citeshttps://doi.org/10.1109/nof.2014.7119765openalex-snapshot
Integration of time-dependent pricing with transmission rate control for flattening out peak-time demand
inferred← citeshttps://doi.org/10.1109/seams59076.2023.00029openalex-snapshot
PlanIoT: A Framework for Adaptive Data Flow Management in IoT-enhanced Spaces
inferred← citeshttps://doi.org/10.1109/seams59076.2023.00032openalex-snapshot
Artifact: Implementation of an Adaptive Flow Management Framework for IoT Spaces
inferred← citeshttps://doi.org/10.1109/tc.2012.167openalex-snapshot
OpenFlow-Based Flow-Level Bandwidth Provisioning for CICQ Switches
inferred← citeshttps://doi.org/10.1109/tit.2010.2103851openalex-snapshot
Fair Scheduling in Networks Through Packet Election
inferred← citeshttps://doi.org/10.1587/transinf.2020edl8135openalex-snapshot
Dynamic Incentive Mechanism for Industrial Network Congestion Control
inferred← citeshttps://doi.org/10.25148/etd.fi12111301openalex-snapshot
Cross-Layer Design for Energy Efficiency on Data Center Network
inferred← citeshttps://doi.org/10.25148/etd.fi12111906openalex-snapshot
Host and Network Optimizations for Performance Enhancement and Energy Efficiency in Data Center Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1007.1270openalex-snapshot
How to Maximize User Satisfaction Degree in Multi-service IP Networks
inferred← citeshttps://doi.org/10.70675/91d8cb03z7677z4d0dz8fd4zbf7f08f040f9openalex-snapshot
Enabling autonomous IoT systems : A middleware-based hybrid AI approach to self-adaptation
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.