On the public citation graph
On the speedup required for work-conserving crossbar switches
0 signed · 117 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/978-0-387-34987-9_30openalex-snapshot
Fair Prioritized Scheduling in an Input-Buffered Switch
inferredcites →https://doi.org/10.1016/s0005-1098(99)00129-6openalex-snapshot
On the speedup required for combined input- and output-queued switching
inferredcites →https://doi.org/10.1109/49.76643openalex-snapshot
Throughput analysis, optimal buffer allocation, and traffic imbalance study of a generic nonblocking packet switch
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/glocom.1989.64244openalex-snapshot
Performance of a non-blocking space-division packet switch with correlated input traffic
inferredcites →https://doi.org/10.1109/icc.1989.49731openalex-snapshot
Effect of speedup in nonblocking packet switch
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.1996.497906openalex-snapshot
Achieving 100% throughput in an input-queued switch
inferredcites →https://doi.org/10.1109/infcom.1998.665102openalex-snapshot
A practical scheduling algorithm to achieve 100% throughput in input-queued switches
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/isit.1998.708760openalex-snapshot
On the speedup required for combined input and output queued switching
inferredcites →https://doi.org/10.1109/iwqos.1998.675244openalex-snapshot
Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedup
inferredcites →https://doi.org/10.1109/jsac.1987.1146645openalex-snapshot
The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching
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.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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_13openalex-snapshot
The Inherent Queuing Delay of Parallel Packet Switches
inferred← citeshttps://doi.org/10.1007/1-84628-274-8_1openalex-snapshot
Architectures of Internet Switches and Routers
inferred← citeshttps://doi.org/10.1007/3-540-47734-9_35openalex-snapshot
FPCF Input–Queued Packet Switch for Variable-Size Packets
inferred← citeshttps://doi.org/10.1007/s42045-020-00032-zopenalex-snapshot
SharpEdge: an asynchronous and core-agnostic solution to guarantee bounded-delays
inferred← citeshttps://doi.org/10.1016/j.comcom.2005.01.002openalex-snapshot
Packet-based scheduling algorithm for CIOQ switches with multiple traffic classes
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.12.012openalex-snapshot
A new scalable service discipline for real-time traffic: The framed-deadline scheduler
inferred← citeshttps://doi.org/10.1016/s0005-1098(99)00129-6openalex-snapshot
On the speedup required for combined input- and output-queued switching
inferred← citeshttps://doi.org/10.1016/s0140-3664(01)00425-xopenalex-snapshot
Design and analysis of enhanced Abacus switch
inferred← citeshttps://doi.org/10.1016/s0140-3664(01)00426-1openalex-snapshot
Input queued switches for variable length packets: analysis for Poisson and self-similar traffic
inferred← citeshttps://doi.org/10.1016/s0140-3664(02)00185-8openalex-snapshot
The impact of bursty traffic on FPCF packet switch performance
inferred← citeshttps://doi.org/10.1016/s0141-9331(03)00025-5openalex-snapshot
Stability degree of switches with finite buffers and non-negligible round-trip time☆
inferred← citeshttps://doi.org/10.1016/s0166-5316(03)00103-2openalex-snapshot
Delay bounds for combined input–output switches with low speedup
inferred← citeshttps://doi.org/10.1049/el:19991397openalex-snapshot
Guaranteeing delay in ATM switches by using outputport QoS controllers
inferred← citeshttps://doi.org/10.1109/35.888259openalex-snapshot
On the provision of quality-of-service guarantees for input queued switches
inferred← citeshttps://doi.org/10.1109/ciss.2006.286435openalex-snapshot
Greedy weighted matching for scheduling the input-queued switch
inferred← citeshttps://doi.org/10.1109/comnet.2015.7566638openalex-snapshot
Optimal scheduling of CIOQ switches resources in virtual network environments
inferred← citeshttps://doi.org/10.1109/conect.2002.1039251openalex-snapshot
A four-terabit single-stage packet switch with large round-trip time support
inferred← citeshttps://doi.org/10.1109/date.2008.4484878openalex-snapshot
GMDS: Hardware implementation of novel real output queuing architecture
inferred← citeshttps://doi.org/10.1109/eurcon.2001.938170openalex-snapshot
Enabling quality of service in input-queued packet switches
inferred← citeshttps://doi.org/10.1109/glocom.2000.892052openalex-snapshot
Saturn: a terabit packet switch using dual round-robin
inferred← citeshttps://doi.org/10.1109/glocom.2001.965088openalex-snapshot
Fast fault detection for a multiple-plane packet switch
inferred← citeshttps://doi.org/10.1109/glocom.2001.966256openalex-snapshot
CIXOB-k: combined input-crosspoint-output buffered packet switch
inferred← citeshttps://doi.org/10.1109/glocom.2002.1189040openalex-snapshot
Performance analysis of a dual round robin matching switch with exhaustive service
inferred← citeshttps://doi.org/10.1109/glocom.2002.1189106openalex-snapshot
Delay performance of high-speed packet switches with low speedup
inferred← citeshttps://doi.org/10.1109/glocom.2004.1378142openalex-snapshot
Multiple priorities in a two-lane buffered crossbar
inferred← citeshttps://doi.org/10.1109/glocom.2005.1577697openalex-snapshot
Scheduling in switches with small internal buffers
inferred← citeshttps://doi.org/10.1109/hpsr.2001.923654openalex-snapshot
On scheduling using parallel input-output queued crossbar switches with no speedup
inferred← citeshttps://doi.org/10.1109/hpsr.2001.923655openalex-snapshot
CIXB-1: combined input-one-cell-crosspoint buffered switch
inferred← citeshttps://doi.org/10.1109/hpsr.2002.1024227openalex-snapshot
Next generation carriers Internet backbone node architecture (MSN Type-X)
inferred← citeshttps://doi.org/10.1109/hpsr.2004.1303428openalex-snapshot
Tracking the behavior of an ideal output queued switch using an input queued switch with unity speedup
inferred← citeshttps://doi.org/10.1109/hpsr.2005.1503184openalex-snapshot
Byte-focal: a practical load balanced switch
inferred← citeshttps://doi.org/10.1109/hpsr.2006.1709705openalex-snapshot
Load balancing in a switch without buffers
inferred← citeshttps://doi.org/10.1109/hpsr.2007.4281265openalex-snapshot
Crossbars with Minimally-Sized Crosspoint Buffers
inferred← citeshttps://doi.org/10.1109/icait59485.2023.10367215openalex-snapshot
To Work-Conserving Packet Scheduling by Load Balance for VOQ Switches
inferred← citeshttps://doi.org/10.1109/icc.2000.853798openalex-snapshot
Stability of maximal size matching scheduling in input-queued cell switches
inferred← citeshttps://doi.org/10.1109/icc.2002.997025openalex-snapshot
An adaptive scheduler to provide QoS guarantees in an input-buffered switch
inferred← citeshttps://doi.org/10.1109/icc.2002.997217openalex-snapshot
MSN Type-X: next generation Internet backbone switch/router architecture
inferred← citeshttps://doi.org/10.1109/icc.2004.1312669openalex-snapshot
Variable packet size buffered crossbar (CICQ) switches
inferred← citeshttps://doi.org/10.1109/icc.2007.1049openalex-snapshot
LOOFA-PB: A Modified LOOFA Scheduler for Variable-Length Packet Switching
inferred← citeshttps://doi.org/10.1109/icccn.2002.1043104openalex-snapshot
Stability of CIOQ switches with finite buffers and non-negligible round-trip time
inferred← citeshttps://doi.org/10.1109/icnp.2003.1249763openalex-snapshot
Stress resistant scheduling algorithms for CIOQ switches
inferred← citeshttps://doi.org/10.1109/icnsc.2004.1297419openalex-snapshot
Performance analysis for a packet mode combined input-output queued switch
inferred← citeshttps://doi.org/10.1109/ictel.2003.1191682openalex-snapshot
A scalable switch architecture for ultra-large IP and lambda switch routers
inferred← citeshttps://doi.org/10.1109/infcom.1999.751673openalex-snapshot
Matching output queueing with a combined input output queued switch
inferred← citeshttps://doi.org/10.1109/infcom.2000.832229openalex-snapshot
The throughput of data switches with and without speedup
inferred← citeshttps://doi.org/10.1109/infcom.2000.832559openalex-snapshot
On the stability of input-buffer cell switches with speed-up
inferred← citeshttps://doi.org/10.1109/infcom.2001.916665openalex-snapshot
Making parallel packet switches practical
inferred← citeshttps://doi.org/10.1109/infcom.2001.916666openalex-snapshot
On the performance of a dual round-robin switch
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019249openalex-snapshot
Packet scale rate guarantee for non-FIFO nodes
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019351openalex-snapshot
Maintaining packet order in two-stage switches
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019366openalex-snapshot
Towards simple, high-performance schedulers for high-aggregate bandwidth switches
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019413openalex-snapshot
On the throughput achievable by isolated and interconnected input-queueing switches under multiclass traffic
inferred← citeshttps://doi.org/10.1109/infcom.2004.1354605openalex-snapshot
Rate quantization and service quality over single crossbar switches
inferred← citeshttps://doi.org/10.1109/infcom.2004.1354642openalex-snapshot
Rate guarantees and overload protection in input-queued switches
inferred← citeshttps://doi.org/10.1109/infcom.2007.307openalex-snapshot
Efficient, Fully Local Algorithms for CIOQ Switches
inferred← citeshttps://doi.org/10.1109/infocom.2006.135openalex-snapshot
Strong Performance Guarantees for Asynchronous Crossbar Schedulers
inferred← citeshttps://doi.org/10.1109/isit.1998.708760openalex-snapshot
On the speedup required for combined input and output queued switching
inferred← citeshttps://doi.org/10.1109/iwqos.2008.12openalex-snapshot
On the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches
inferred← citeshttps://doi.org/10.1109/iwsoc.2004.1319888openalex-snapshot
SERDES technology for gigabit I/O communications in storage area networking
inferred← citeshttps://doi.org/10.1109/iwsoc.2004.58openalex-snapshot
SERDES technology for gigabit I/O communications in storage area networking
inferred← citeshttps://doi.org/10.1109/jsac.2003.810496openalex-snapshot
Randomized scheduling algorithms for high-aggregate bandwidth switches
inferred← citeshttps://doi.org/10.1109/jsac.2003.810532openalex-snapshot
Output-queued switch emulation by fabrics with limited memory
inferred← citeshttps://doi.org/10.1109/lcn.2003.1243135openalex-snapshot
Characterization of the burst stabilization protocol for the RR/RR CICQ switch
inferred← citeshttps://doi.org/10.1109/lcomm.2002.804254openalex-snapshot
Work-conservingness of CIOQ packet switches with limited output buffers
inferred← citeshttps://doi.org/10.1109/mm.2003.1179894openalex-snapshot
A four-terabit packet switch supporting long round-trip times
inferred← citeshttps://doi.org/10.1109/tc.2009.186openalex-snapshot
Packet-Mode Emulation of Output-Queued Switches
inferred← citeshttps://doi.org/10.1109/tc.2009.65openalex-snapshot
PBC: A Partially Buffered Crossbar Packet Switch
inferred← citeshttps://doi.org/10.1109/tcomm.2005.858667openalex-snapshot
On the Combined Input-Crosspoint Buffered Switch With Round-Robin Arbitration
inferred← citeshttps://doi.org/10.1109/tit.2004.842562openalex-snapshot
On the Stability of Isolated and Interconnected Input-Queueing Switches Under Multiclass Traffic
inferred← citeshttps://doi.org/10.1109/tnet.2002.803919openalex-snapshot
Switching using parallel input-output queued switches with no speedup
inferred← citeshttps://doi.org/10.1109/tnet.2003.810315openalex-snapshot
Analysis of the parallel packet switch architecture
inferred← citeshttps://doi.org/10.1109/tnet.2003.815303openalex-snapshot
Concurrent fault detection for a multiple-plane packet switch
inferred← citeshttps://doi.org/10.1109/tnet.2003.818180openalex-snapshot
On achieving throughput in an input-queued switch
inferred← citeshttps://doi.org/10.1109/tnet.2003.818188openalex-snapshot
Packet scale rate guarantee for non-fifo nodes
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.2007.909727openalex-snapshot
Design Issues in Next-Generation Merchant Switch Fabrics
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.2009.2014948openalex-snapshot
On Tracking the Behavior of an Output-Queued Switch Using an Input-Queued Switch
inferred← citeshttps://doi.org/10.1109/tnet.2009.2038582openalex-snapshot
Rate Quantization and the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches
inferred← citeshttps://doi.org/10.1109/tpds.2006.126openalex-snapshot
Overall Blocking Behavior Analysis of General Banyan-Based Optical Switching Networks
inferred← citeshttps://doi.org/10.1109/tpds.2006.129openalex-snapshot
The Inherent Queuing Delay of Parallel Packet Switches
inferred← citeshttps://doi.org/10.1109/tpds.2007.70799openalex-snapshot
A Framework to Provide Quality of Service over Advanced Switching
inferred← citeshttps://doi.org/10.1109/tpds.2017.2671429openalex-snapshot
Analyzing and Enhancing Dynamic Threshold Policy of Data Center Switches
inferred← citeshttps://doi.org/10.1137/050648250openalex-snapshot
Randomization Does Not Reduce the Average Delay in Parallel Packet Switches
inferred← citeshttps://doi.org/10.1145/1007912.1007954openalex-snapshot
The inherent queuing delay of parallel packet switches
inferred← citeshttps://doi.org/10.1145/1015467.1015496openalex-snapshot
Work-conserving distributed schedulers for Terabit routers
inferred← citeshttps://doi.org/10.1145/1030194.1015496openalex-snapshot
Work-conserving distributed schedulers for Terabit routers
inferred← citeshttps://doi.org/10.1145/1073970.1073973openalex-snapshot
Randomization does not reduce the average delay in parallel packet switches
inferred← citeshttps://doi.org/10.1145/1148109.1148134openalex-snapshot
Packet-mode emulation of output-queued switches
inferred← citeshttps://doi.org/10.1145/1323548.1323555openalex-snapshot
Experimental evaluation of a coarse-grained switch scheduler
inferred← citeshttps://doi.org/10.12681/eadd/16134openalex-snapshot
Request-grant scheduling for congestion elimination in multistage networks
inferred← citeshttps://doi.org/10.12681/eadd/26898openalex-snapshot
VLSI micro-architectures for high-radix crossbars
inferred← citeshttps://doi.org/10.20381/ruor-13096openalex-snapshot
Frame-based bandwidth allocation for Agile All-Photonic Networks
inferred← citeshttps://doi.org/10.3844/jcssp.2006.347.354openalex-snapshot
A Simulation-Based Comparison of Multimedia Traffic Prioritization Schemes for High-Performance Input-Queued Packet Switches
inferred← citeshttps://doi.org/10.48550/arxiv.1512.09002openalex-snapshot
The Bounded Edge Coloring Problem and Offline Crossbar Scheduling
inferred← citeshttps://doi.org/10.5120/8811-3128openalex-snapshot
A Priority based SRM Algorithm for VOQ Packet Switch Architecture
inferred← citeshttps://doi.org/10.7936/k70g3hcbopenalex-snapshot
Design and Evaluation of a Practical, High Performance Crossbar Scheduler
inferred← citeshttps://doi.org/10.7936/k7g15z5nopenalex-snapshot
When is a Work-Conserving Switch Not?
inferred← citeshttps://doi.org/10.7936/k7ks6pv6openalex-snapshot
Work-Conserving Distributed Schedulers
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.