On the public citation graph

The Mathematical Theory of Nonblocking Switching Networks

0 signed · 107 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/net.20043openalex-snapshot
Strict nonblockingness of reduced shuffle‐exchange networks
inferred← citeshttps://doi.org/10.1002/net.20403openalex-snapshot
Nonblocking multirate log 2 (N ,m ,p ) switching networks with multicast connections
inferred← citeshttps://doi.org/10.1007/0-387-29026-5_15openalex-snapshot
WDM Switching Networks: Complexity and Constructions
inferred← citeshttps://doi.org/10.1007/0-387-29159-8_10openalex-snapshot
Switch Fabric Control
inferred← citeshttps://doi.org/10.1007/3-540-40888-6_16openalex-snapshot
On the Rearrangeability of Multistage Networks Employing Uniform Connection Pattern
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_37openalex-snapshot
Linear Programming Analysis of Switching Networks
inferred← citeshttps://doi.org/10.1007/978-1-4613-0281-0_14openalex-snapshot
Notes on the Complexity of Switching Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_50openalex-snapshot
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_20openalex-snapshot
Single-Sink Multicommodity Flow with Side Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_36openalex-snapshot
A New Approach for Rearrangeable Multicast Switching Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-12133-3_23openalex-snapshot
Design Automation for Reconfigurable Interconnection Networks
inferred← citeshttps://doi.org/10.1007/978-981-10-6442-5_27openalex-snapshot
A Cost-Effective Wide-Sense Nonblocking k-Fold Multicast Network
inferred← citeshttps://doi.org/10.1007/bf02841764openalex-snapshot
Monotone routing in multirate rearrangeable logd(N,m,p) network
inferred← citeshttps://doi.org/10.1007/s10878-007-9065-5openalex-snapshot
Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks
inferred← citeshttps://doi.org/10.1007/s10878-009-9240-yopenalex-snapshot
A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints
inferred← citeshttps://doi.org/10.1007/s10878-011-9402-6openalex-snapshot
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
inferred← citeshttps://doi.org/10.1007/s11107-006-0045-yopenalex-snapshot
Design alternatives for N-stage WDM optical planar permutation networks
inferred← citeshttps://doi.org/10.1007/s11107-019-00858-8openalex-snapshot
Rearrangeable $$2 \times 2$$ elastic optical switch with two connection rates and spectrum conversion capability
inferred← citeshttps://doi.org/10.1007/s11390-006-0466-1openalex-snapshot
Scalable and Practical Nonblocking Switching Networks
inferred← citeshttps://doi.org/10.1016/j.dam.2016.06.009openalex-snapshot
Edge-coloring of 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.osn.2016.04.005openalex-snapshot
Strict-sense nonblocking networks with k degrees of freedom
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.021openalex-snapshot
Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.048openalex-snapshot
Wide-sense nonblocking for multi- log d N networks under various routing strategies
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.026openalex-snapshot
Repackable multi-Log2N networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.01.018openalex-snapshot
The number of rearrangements for Clos networks – new results
inferred← citeshttps://doi.org/10.1049/iet-com.2019.0242openalex-snapshot
New upper bound for a rearrangeable non‐blocking WSW architecture
inferred← citeshttps://doi.org/10.1109/access.2019.2896283openalex-snapshot
Necessary and Sufficient Conditions for the Rearrangeability of WSW1 Switching Fabrics
inferred← citeshttps://doi.org/10.1109/aict.2005.56openalex-snapshot
Lower bounds for WSNB multi-log/sub 2/N switching networks
inferred← citeshttps://doi.org/10.1109/ciss.2006.286436openalex-snapshot
On Random Routing and its Application to Quantum Interconnection Networks
inferred← citeshttps://doi.org/10.1109/fpt.2005.1568553openalex-snapshot
Post-silicon debug using programmable logic cores
inferred← citeshttps://doi.org/10.1109/globecom38437.2019.9014232openalex-snapshot
Increasing Capacity of the Clos Structure for Optical Switching Networks
inferred← citeshttps://doi.org/10.1109/glocom.2003.1258683openalex-snapshot
Blocking probability of bicast connections in a Clos network
inferred← citeshttps://doi.org/10.1109/glocom.2004.1378111openalex-snapshot
A class of self-routing strictly nonblocking photonic switching networks
inferred← citeshttps://doi.org/10.1109/glocom.2007.427openalex-snapshot
Constructions of Multicast Flexible Delay Lines and Optical Multicast Switches with 100% Throughput
inferred← citeshttps://doi.org/10.1109/glocom.2007.452openalex-snapshot
The Control Algorithm and WSNB Operation of Log2(N,1,p) Switching Fabrics
inferred← citeshttps://doi.org/10.1109/glocom.2008.ecp.507openalex-snapshot
Crosstalk-Free Widesense Nonblocking Multicast Photonic Switching Networks
inferred← citeshttps://doi.org/10.1109/glocom.2008.ecp.508openalex-snapshot
Nonblocking Multicast-Capable Optical Cross Connects Based on the 4-Stage Multicast Network
inferred← citeshttps://doi.org/10.1109/glocom.2008.ecp.538openalex-snapshot
Strictly Nonblocking f-Cast Photonic Switching Networks under General Crosstalk Constraints
inferred← citeshttps://doi.org/10.1109/glocom.2009.5425509openalex-snapshot
Optimization of Multicast logd(N, m, p) Switching Networks
inferred← citeshttps://doi.org/10.1109/hpsr.2004.1303462openalex-snapshot
Multiwavelength distribution networks
inferred← citeshttps://doi.org/10.1109/hpsr.2004.1303471openalex-snapshot
Simultaneous connections routing in multi-log/sub 2/N switching fabrics
inferred← citeshttps://doi.org/10.1109/hpsr.2004.1303496openalex-snapshot
Performance of load balancing algorithms in Clos packet switches
inferred← citeshttps://doi.org/10.1109/hpsr.2007.4281231openalex-snapshot
Strictly Nonblocking Design off-cast Photonic Multi-log2N Networks with Crosstalk Constraints
inferred← citeshttps://doi.org/10.1109/hpsr.2007.4281250openalex-snapshot
Constructions of Given-Depth and Optimal Multirate Rearrangeably Nonblocking Distributors
inferred← citeshttps://doi.org/10.1109/hpsr.2015.7483108openalex-snapshot
The strict-sense nonblocking elastic optical switch
inferred← citeshttps://doi.org/10.1109/hpsr.2019.8808115openalex-snapshot
Wide-Sense Nonblocking Converting-Space-Converting Switching Node Architecture under Xs VarSLOT Algorithm
inferred← citeshttps://doi.org/10.1109/icc.2004.1312818openalex-snapshot
Cost-effective constructions for nonblocking WDM multicast switching networks
inferred← citeshttps://doi.org/10.1109/icc.2005.1494510openalex-snapshot
Wide-sense nonblocking log/sub 2/ (N, 0, p) switching networks with even number of stages
inferred← citeshttps://doi.org/10.1109/icc.2006.255203openalex-snapshot
Wide-Sense Nonblocking Multiplane Photonic Banyan-Type Switching Fabrics With Zero Crosstalk
inferred← citeshttps://doi.org/10.1109/icc.2007.1057openalex-snapshot
Wide-Sense Nonblocking Multiplane Baseline Switching Networks Composed of d × d Switches
inferred← citeshttps://doi.org/10.1109/icc.2008.1013openalex-snapshot
Strictly Nonblocking Function-Cast d-Ary Multi-Log Networks under Fanout and Crosstalk Constraints
inferred← citeshttps://doi.org/10.1109/icc.2013.6655155openalex-snapshot
The control algorithm and the FPGA controller for non-interruptive rearrangeable Log2(N, 0, p) switching networks
inferred← citeshttps://doi.org/10.1109/icc.2015.7249021openalex-snapshot
A necessary and sufficient closure property for two-stage constructions of switching networks
inferred← citeshttps://doi.org/10.1109/icedsa.2010.5503093openalex-snapshot
Comparative analysis of resource requirements for monolithic and multi-stage Clos crosspoint switch implementations in VLSI
inferred← citeshttps://doi.org/10.1109/icicic.2006.260openalex-snapshot
Design and Analysis of a Fully Non-blocking Quantum Switch
inferred← citeshttps://doi.org/10.1109/icpp.2004.1327924openalex-snapshot
Parallel routing and wavelength assignment for optical multistage interconnection networks
inferred← citeshttps://doi.org/10.1109/icpp.2004.54openalex-snapshot
Parallel routing and wavelength assignment for optical multistage interconnection networks
inferred← citeshttps://doi.org/10.1109/infcom.2004.1357020openalex-snapshot
Nonblocking WDM switches based on arrayed waveguide grating and limited wavelength conversion
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462100openalex-snapshot
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
inferred← citeshttps://doi.org/10.1109/infocom.2006.106openalex-snapshot
Multistage Constructions of Linear Compressors, Non-Overtaking Delay Lines, and Flexible Delay Lines
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303182openalex-snapshot
Parallel routing algorithms for nonblocking electronic and photonic multistage switching networks
inferred← citeshttps://doi.org/10.1109/iscas.2005.1464520openalex-snapshot
Concentrator Access Networks for Programmable Logic Cores on SoCs
inferred← citeshttps://doi.org/10.1109/isncc.2015.7238577openalex-snapshot
Strict-sense nonblocking networks with three multiplexing and switching levels
inferred← citeshttps://doi.org/10.1109/jlt.2006.890437openalex-snapshot
An Architecture for TSI-Free Nonblocking Optical TDM Switches
inferred← citeshttps://doi.org/10.1109/jlt.2016.2560624openalex-snapshot
Strict-Sense Nonblocking W-S-W Node Architectures for Elastic Optical Networks
inferred← citeshttps://doi.org/10.1109/jsac.2006.258221openalex-snapshot
The Routing Algorithm and Wide-Sense Nonblocking Conditions for Multiplane Baseline Switching Networks
inferred← citeshttps://doi.org/10.1109/lcomm.2003.821323openalex-snapshot
Rearrangeability of multicast Clos networks with middle-stage fan-out
inferred← citeshttps://doi.org/10.1109/lcomm.2008.081209openalex-snapshot
Reduced banyan-type multiplane rearrangeable switching networks
inferred← citeshttps://doi.org/10.1109/mcom.2003.1235591openalex-snapshot
50th anniversary of clos networks - nonblocking, repackable, and rearrangeable clos networks: fifty years, of the theory evolution
inferred← citeshttps://doi.org/10.1109/mcom.2003.1235592openalex-snapshot
A survey of noriblocking multicast three-stage clos networks
inferred← citeshttps://doi.org/10.1109/ps.2018.8751273openalex-snapshot
Control Algorithms for Simultaneous Connections Routing in Flexible Optical Switching Networks
inferred← citeshttps://doi.org/10.1109/sarnof.2004.1302852openalex-snapshot
Blocking probability of bicast connections in a rearrangeable Clos network
inferred← citeshttps://doi.org/10.1109/tc.2004.1268399openalex-snapshot
A fault-tolerant rearrangeable permutation network
inferred← citeshttps://doi.org/10.1109/tc.2008.161openalex-snapshot
An Enhanced Universal N x N Fully Nonblocking Quantum Switch
inferred← citeshttps://doi.org/10.1109/tc.2010.125openalex-snapshot
An Optimal Wide-Sense Nonblocking Distributor
inferred← citeshttps://doi.org/10.1109/tcomm.2005.858662openalex-snapshot
Expanding the Switching Capabilities of Optical Crossconnects
inferred← citeshttps://doi.org/10.1109/tcomm.2007.908541openalex-snapshot
Wide-Sense Nonblocking ${\rm log}_{d}(N, 0, p)$ Multicast Switching Networks
inferred← citeshttps://doi.org/10.1109/tcomm.2009.11.070666openalex-snapshot
A low-jitter guaranteed-rate scheduling algorithm for packet-switched ip routers
inferred← citeshttps://doi.org/10.1109/tcomm.2009.12.080316openalex-snapshot
Wide-sense nonblocking multicast logd (N, m, p) switching networks under the window algorithm
inferred← citeshttps://doi.org/10.1109/tit.2006.874538openalex-snapshot
Constructions of optical FIFO queues
inferred← citeshttps://doi.org/10.1109/tnet.2005.863459openalex-snapshot
Constructions and analyses of nonblocking WDM switches based on arrayed waveguide grating and limited wavelength conversion
inferred← citeshttps://doi.org/10.1109/tnet.2006.882846openalex-snapshot
On Noninterruptive Rearrangeable Networks
inferred← citeshttps://doi.org/10.1109/tnet.2007.899061openalex-snapshot
Rate and Delay Guarantees Provided by Clos Packet Switches With Load Balancing
inferred← citeshttps://doi.org/10.1109/tnet.2008.2001728openalex-snapshot
Rearrangeable and Nonblocking $[w,f]$-Distributors
inferred← citeshttps://doi.org/10.1109/tnet.2009.2014159openalex-snapshot
Constructions of Linear Compressors, Nonovertaking Delay Lines, and Flexible Delay Lines for Optical Packet Switching
inferred← citeshttps://doi.org/10.1109/tnse.2017.2749327openalex-snapshot
A Mathematical Theory for Multistage Battery Switching Networks
inferred← citeshttps://doi.org/10.1109/tpds.2005.95openalex-snapshot
Parallel routing algorithms for nonblocking electronic and photonic switching networks
inferred← citeshttps://doi.org/10.1137/05062336xopenalex-snapshot
On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out
inferred← citeshttps://doi.org/10.1137/s0097539704442714openalex-snapshot
WDM Switching Networks, Rearrangeable and Nonblocking [w,f]-connectors
inferred← citeshttps://doi.org/10.1137/s0895480102414806openalex-snapshot
Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks
inferred← citeshttps://doi.org/10.1142/s0218126606003088openalex-snapshot
THREE-STAGE CLOS-NETWORK SWITCH ARCHITECTURE WITH BUFFERED CENTER STAGE FOR MULTI-CLASS TRAFFIC
inferred← citeshttps://doi.org/10.1142/s0219265910002805openalex-snapshot
ALGORITHM-HARDWARE CODESIGN OF A FAST PARALLEL ROUTING ARCHITECTURE FOR CLOS NETWORKS
inferred← citeshttps://doi.org/10.1142/s1793830909000117openalex-snapshot
ANALYZING NONBLOCKING MULTILOG NETWORKS WITH THE KÖNIG–EGEVARÝ THEOREM
inferred← citeshttps://doi.org/10.1145/1185347.1185351openalex-snapshot
A practical fast parallel routing architecture for Clos networks
inferred← citeshttps://doi.org/10.1145/1629911.1630006openalex-snapshot
Interconnection fabric design for tracing signals in post-silicon validation
inferred← citeshttps://doi.org/10.1145/3120895.3120920openalex-snapshot
Access Network Generation for Efficient Debugging of FPGAs
inferred← citeshttps://doi.org/10.1364/jocn.11.000282openalex-snapshot
Rearrangeable W-S-W Elastic Optical Networks Generated by Graph Approaches: erratum
inferred← citeshttps://doi.org/10.1515/bpasts-2015-0085openalex-snapshot
Towards the boundary between easy and hard control problems in multicast Clos networks
inferred← citeshttps://doi.org/10.15199/59.2018.8-9.58openalex-snapshot
Algorytmy do jednoczesnego zestawiania połączeń w polach typu WSW1 o pojmeności 2×2 obsługujących dwa rodzaje połączeń
inferred← citeshttps://doi.org/10.1631/jzus.2005.a0555openalex-snapshot
Monotone routing in multirate rearrangeable log d (N,m,p) network
inferred← citeshttps://doi.org/10.21742/ijeic.2021.12.1.01openalex-snapshot
Applying Bidirectional Crossbar Switches with Extra Sets of Inlets and Outlets to Three-Stage Clos Networks
inferred← citeshttps://doi.org/10.3233/jcs-130478openalex-snapshot
A more efficient computationally sound non-interactive zero-knowledge shuffle argument
inferred← citeshttps://doi.org/10.46298/dmtcs.638openalex-snapshot
Computation with No Memory, and Rearrangeable Multicast Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1204.3180openalex-snapshot
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
inferred← citeshttps://doi.org/10.48550/arxiv.1310.5380openalex-snapshot
Computation with No Memory, and Rearrangeable Multicast Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1401.7263openalex-snapshot
Superconcentration on a Pair of Butterflies
inferred← citeshttps://doi.org/10.48550/arxiv.1402.2963openalex-snapshot
Running in Circles: Packet Routing on Ring Networks
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.