On the public citation graph

Adaptive Max-Min Fair Scheduling in Buffered Crossbar Switches Without Speedup

0 signed · 42 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.1109/49.772430openalex-snapshot
Matching output queueing with a combined input/output-queued switch
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.649568openalex-snapshot
Hierarchical packet fair queueing algorithms
inferredcites →https://doi.org/10.1109/90.769767openalex-snapshot
The iSLIP scheduling algorithm for input-queued switches
inferredcites →https://doi.org/10.1109/90.909028openalex-snapshot
On the stability of input-queued switches with speed-up
inferredcites →https://doi.org/10.1109/glocom.2004.1378140openalex-snapshot
An efficient scheduling algorithm for combined input-crosspoint-queued (CICQ) switches
inferredcites →https://doi.org/10.1109/hpsr.2001.923655openalex-snapshot
CIXB-1: combined input-one-cell-crosspoint buffered switch
inferredcites →https://doi.org/10.1109/hpsr.2003.1226674openalex-snapshot
Weighted fairness in buffered crossbar scheduling
inferredcites →https://doi.org/10.1109/icc.2001.937187openalex-snapshot
A high-throughput scheduling algorithm for a buffered crossbar switch fabric
inferredcites →https://doi.org/10.1109/icc.2004.1312667openalex-snapshot
Nash equilibria as a fundamental issue concerning network-switches design
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.1996.497906openalex-snapshot
Achieving 100% throughput in an input-queued switch
inferredcites →https://doi.org/10.1109/infcom.1998.659664openalex-snapshot
Implementing distributed packet fair queueing in a scalable switch architecture
inferredcites →https://doi.org/10.1109/infcom.1999.751673openalex-snapshot
Matching output queueing with a combined input output queued switch
inferredcites →https://doi.org/10.1109/infcom.2000.832229openalex-snapshot
The throughput of data switches with and without speedup
inferredcites →https://doi.org/10.1109/infcom.2002.1019364openalex-snapshot
Fair scheduling and buffer management in Internet routers
inferredcites →https://doi.org/10.1109/infcom.2005.1498327openalex-snapshot
Practical algorithms for performance guarantees in buffered crossbars
inferredcites →https://doi.org/10.1109/isca.1988.5245openalex-snapshot
High-performance multiqueue buffers for VLSI communication switches
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/pccc.2003.1203733openalex-snapshot
The RR/RR CICQ switch: hardware design for 10-Gbps link speed
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.1145/633625.52439openalex-snapshot
High-performance multi-queue buffers for VLSI communications switches
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.1007/s11432-011-4286-8openalex-snapshot
Achieve load balancing with a dynamic re-routing CICQ switching scheme
inferred← citeshttps://doi.org/10.1007/s11432-011-4435-0openalex-snapshot
Achieving fair service with a hybrid scheduling scheme for CICQ switches
inferred← citeshttps://doi.org/10.1016/j.comnet.2010.10.011openalex-snapshot
Distributed WFQ scheduling converging to weighted max–min fairness
inferred← citeshttps://doi.org/10.1016/j.jnca.2011.10.011openalex-snapshot
Load-balanced three-stage switch
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/glocomw.2010.5700470openalex-snapshot
Bandwidth allocation for best effort traffic to achieve 100% throughput
inferred← citeshttps://doi.org/10.1109/icdma.2011.41openalex-snapshot
Achieving Fair Service with a Layered Scheduling Scheme for CICQ Switches
inferred← citeshttps://doi.org/10.1109/infcom.2009.5061983openalex-snapshot
A Dynamic Frame Sizing Algorithm for CICQ Switches with 100% Throughput
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/pacrim.2009.5291289openalex-snapshot
A low-jitter Guaranteed-Rate scheduling algorithm for crosspoint-buffered switches
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/tpds.2008.262openalex-snapshot
On the Integration of Unicast and Multicast Cell Scheduling in Buffered Crossbar Switches
inferred← citeshttps://doi.org/10.1109/wicom.2009.5301803openalex-snapshot
A Combined Fair Scheduling Algorithm for Combined-Input-Crosspoint-Queued Switch
inferred← citeshttps://doi.org/10.1360/zf2011-41-12-1450openalex-snapshot
一种基于CICQ 的动态重路由交换机制
inferred← citeshttps://doi.org/10.1360/zf2012-42-4-410openalex-snapshot
支持公平服务的CICQ 分层混合调度策略
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.4028/www.scientific.net/amr.268-270.2101openalex-snapshot
A High-Performance Scheduling Algorithm for Buffered Crossbar Switch
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.