On the public citation graph

Strong Performance Guarantees for Asynchronous Crossbar Schedulers

0 signed · 63 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.1016/0376-5075(79)90032-1openalex-snapshot
Virtual cut-through: A new computer communication switching technique
inferredcites →https://doi.org/10.1109/26.780463openalex-snapshot
Achieving 100% throughput in an input-queued switch
inferredcites →https://doi.org/10.1109/49.772435openalex-snapshot
On the speedup required for work-conserving crossbar switches
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/hpsr.2001.923655openalex-snapshot
CIXB-1: combined input-one-cell-crosspoint buffered switch
inferredcites →https://doi.org/10.1109/hpsr.2003.1226682openalex-snapshot
CBF: a high-performance scheduling algorithm for buffered crossbar switches
inferredcites →https://doi.org/10.1109/icc.2004.1312669openalex-snapshot
Variable packet size buffered crossbar (CICQ) switches
inferredcites →https://doi.org/10.1109/icc.2005.1494499openalex-snapshot
Variable-size multipacket segments in buffered crossbar (CICQ) architectures
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.2005.1498327openalex-snapshot
Practical algorithms for performance guarantees in buffered crossbars
inferredcites →https://doi.org/10.1109/iwqos.1998.675243openalex-snapshot
On the speedup required for work-conserving crossbar switches
inferredcites →https://doi.org/10.1109/jsac.1987.1146646openalex-snapshot
Integrated Services Packet Network Using Bus Matrix Switch
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/lcomm.2003.815665openalex-snapshot
MCBF: a high-performance scheduling algorithm for buffered crossbar switches
inferredcites →https://doi.org/10.1145/143365.143495openalex-snapshot
High speed switch scheduling for local area networks
inferredcites →https://doi.org/10.1145/161541.161736openalex-snapshot
High-speed switch scheduling for local-area networks
inferredcites →https://doi.org/10.1145/633025.633050openalex-snapshot
Routers with a single stage of buffering
inferredcites →https://doi.org/10.1145/964725.633050openalex-snapshot
Routers with a single stage of buffering
inferredcites →https://doi.org/10.7936/k7g15z5nopenalex-snapshot
When is a Work-Conserving Switch Not?

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-642-02205-0_18openalex-snapshot
Scalable Model for Packet Loss Analysis of Load-Balancing Switches with Identical Input Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-02924-0_16openalex-snapshot
Packet Loss Analysis of Load-Balancing Switch with ON/OFF Input Processes
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/s00446-010-0114-4openalex-snapshot
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
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.1109/dsd.2006.30openalex-snapshot
BCB: A Buffered CrossBar Switch Fabric Utilizing Shared Memory
inferred← citeshttps://doi.org/10.1109/fgcn.2008.202openalex-snapshot
Assessment and Open-Issues of the Load-Balanced Switching Architecture
inferred← citeshttps://doi.org/10.1109/glocom.2009.5425406openalex-snapshot
Packet-Mode Asynchronous Scheduling Algorithm for Partially Buffered Crossbar Switches
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.5683322openalex-snapshot
Achieving Flow Level Constant Performance Guarantees for CICQ Switches without Speedup
inferred← citeshttps://doi.org/10.1109/glocom.2011.6134427openalex-snapshot
Parallel Packet Switch without Segmentation-and-Reassembly
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/hpsr.2007.4281262openalex-snapshot
Providing 100% Throughput in a Buffered Crossbar Switch
inferred← citeshttps://doi.org/10.1109/hpsr.2010.5580261openalex-snapshot
DISQUO: A distributed 100% throughput algorithm for a buffered crossbar switch
inferred← citeshttps://doi.org/10.1109/hspr.2008.4734442openalex-snapshot
A low complexity scheduling algorithm for a crosspoint buffered switch with 100% throughput
inferred← citeshttps://doi.org/10.1109/icc.2011.5962552openalex-snapshot
Avoiding Speedup from Bandwidth Overhead in a Practical Output-Queued Packet Switch
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.2007.161openalex-snapshot
CR Switch: A Load-Balanced Switch with Contention and Reservation
inferred← citeshttps://doi.org/10.1109/infcom.2009.5061981openalex-snapshot
The Crosspoint-Queued Switch
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/infcom.2011.5935208openalex-snapshot
OpenFlow based flow level bandwidth provisioning for CICQ switches
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370242openalex-snapshot
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536318openalex-snapshot
Providing flow based performance guarantees for buffered crossbar switches
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/tc.2008.140openalex-snapshot
Localized Independent Packet Scheduling for Buffered Crossbar Switches
inferred← citeshttps://doi.org/10.1109/tcomm.2011.040111.100256openalex-snapshot
Load-Balanced Combined Input-Crosspoint Buffered Packet Switches
inferred← citeshttps://doi.org/10.1109/tcomm.2012.082812.100625openalex-snapshot
Flow Based Performance Guarantee Scheduling in Buffered Crossbar Switches
inferred← citeshttps://doi.org/10.1109/tnet.2007.900402openalex-snapshot
On Guaranteed Smooth Switching for Buffered Crossbar Switches
inferred← citeshttps://doi.org/10.1109/tnet.2008.2006221openalex-snapshot
Strong Performance Guarantees for Asynchronous Buffered Crossbar Schedulers
inferred← citeshttps://doi.org/10.1109/tnet.2008.2010624openalex-snapshot
CR Switch: A Load-Balanced Switch With Contention and Reservation
inferred← citeshttps://doi.org/10.1109/tnet.2010.2042460openalex-snapshot
SQUID: A Practical 100% Throughput Scheduler for Crosspoint Buffered Switches
inferred← citeshttps://doi.org/10.1145/1148109.1148134openalex-snapshot
Packet-mode emulation of output-queued switches
inferred← citeshttps://doi.org/10.1145/1185347.1185368openalex-snapshot
Localized asynchronous packet scheduling for buffered crossbar switches
inferred← citeshttps://doi.org/10.1145/1400751.1400796openalex-snapshot
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
inferred← citeshttps://doi.org/10.12681/eadd/16134openalex-snapshot
Request-grant scheduling for congestion elimination in multistage networks
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.15168/11572_368663openalex-snapshot
Design and Analysis of Load-Balancing Switch with Finite Buffers and Variable Size Packets
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.1112.4214openalex-snapshot
A Distributed Scheduling Algorithm for High-Speed Switching Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1406.4235openalex-snapshot
Distributed Scheduling Algorithms for Crosspoint-Buffered Switches
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.