On the public citation graph
On Nonblocking Multirate Interconnection Networks
0 signed · 69 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.1002/j.1538-7305.1950.tb02349.xopenalex-snapshot
Memory Requirements in a Telephone Exchange
inferredcites →https://doi.org/10.1002/j.1538-7305.1953.tb01433.xopenalex-snapshot
A Study of Non-Blocking Switching Networks
inferredcites →https://doi.org/10.1002/net.3230010406openalex-snapshot
On non‐blocking switching networks
inferredcites →https://doi.org/10.2307/2003526openalex-snapshot
Mathematical Theory of Connecting Networks and Telephone Traffic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1755openalex-snapshot
Monotone Routing in Multirate Rearrangeable Clos Networks
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_26openalex-snapshot
Multirate Multicast Switching Networks
inferred← citeshttps://doi.org/10.1007/978-0-387-35068-4_15openalex-snapshot
Strictly Nonblocking Operation of 3-stage Clos Switching Networks
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-0openalex-snapshot
Switching Networks: Recent Advances
inferred← citeshttps://doi.org/10.1007/978-1-4613-0281-0_13openalex-snapshot
Multicast Switching Networks
inferred← citeshttps://doi.org/10.1007/978-1-4613-0281-0_4openalex-snapshot
Wide-sense Nonblocking for 3-stage Clos Networks
inferred← citeshttps://doi.org/10.1007/978-1-4613-0281-0_6openalex-snapshot
Nonblocking Routing Properties of Clos Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_34openalex-snapshot
Edge Coloring and Decompositions of Weighted Graphs
inferred← citeshttps://doi.org/10.1007/978-981-96-1195-9_1openalex-snapshot
Multi-layer CLOS Network Task Optimization Based on Heuristic and Greedy Algorithm
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-011-9402-6openalex-snapshot
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
inferred← citeshttps://doi.org/10.1007/s11227-006-0009-0openalex-snapshot
Scheduling and performance analysis of multicast interconnects
inferred← citeshttps://doi.org/10.1016/j.disopt.2023.100803openalex-snapshot
More on online weighted edge coloring
inferred← citeshttps://doi.org/10.1016/j.osn.2019.03.002openalex-snapshot
A unifying approach to nonblocking Clos-like networks with k multiplexing levels
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.007openalex-snapshot
On rearrangeable multirate three-stage Clos networks
inferred← citeshttps://doi.org/10.1016/s0140-3664(02)00085-3openalex-snapshot
Split-connection rearrangeably nonblocking operation of three-stage multirate Clos networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00016-4openalex-snapshot
On 1-rate wide-sense nonblocking for 3-stage Clos networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00142-0openalex-snapshot
Multirate multicast switching networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00579-0openalex-snapshot
A new routing algorithm for multirate rearrangeable Clos networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00151-xopenalex-snapshot
Wide-sense nonblocking for multirate 3-stage Clos networks
inferred← citeshttps://doi.org/10.1109/26.476102openalex-snapshot
Buffered or unbuffered: a case study based on log/sub d/(N,e,p) networks
inferred← citeshttps://doi.org/10.1109/49.481946openalex-snapshot
Hierarchical path hunt in a broadband multirate circuit switching fabric
inferred← citeshttps://doi.org/10.1109/90.251915openalex-snapshot
Optimal cost/performance design of ATM switches
inferred← citeshttps://doi.org/10.1109/90.491014openalex-snapshot
Semi-rearrangeably nonblocking operation of Clos networks in the multirate environment
inferred← citeshttps://doi.org/10.1109/90.700894openalex-snapshot
Blocking and nonblocking multirate Clos switching networks
inferred← citeshttps://doi.org/10.1109/90.720877openalex-snapshot
A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks
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/glocom.1993.318168openalex-snapshot
Rearrangeability conditions for multirate Benes networks
inferred← citeshttps://doi.org/10.1109/glocom.1994.513490openalex-snapshot
Multirate log/sub d/(N,e,p) networks
inferred← citeshttps://doi.org/10.1109/glocom.2009.5425455openalex-snapshot
The New Banyan-Based Switching Fabric Architecture Composed of Asymmetrical Optical Switching Elements
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/icc.1999.765449openalex-snapshot
Non-blocking folded architectures for multirate ATM switching fabrics
inferred← citeshttps://doi.org/10.1109/icccn.2003.1284181openalex-snapshot
A random graph approach for multicast scheduling and performance analysis
inferred← citeshttps://doi.org/10.1109/iccs.2002.1183309openalex-snapshot
An efficient switching system for next-generation large-scale computer networking
inferred← citeshttps://doi.org/10.1109/icct.1998.743088openalex-snapshot
Non-blocking asymmetrical three-stage multirate switching networks
inferred← citeshttps://doi.org/10.1109/infcom.1992.263584openalex-snapshot
Optimal cost/performance design of ATM switches
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462100openalex-snapshot
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
inferred← citeshttps://doi.org/10.1109/iscc.2000.860685openalex-snapshot
Continuous bandwidth, nonblocking, multirate switching in 3-stage Clos networks
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/lcomm.2018.2790908openalex-snapshot
Nonblocking Multirate 2-Stage Networks
inferred← citeshttps://doi.org/10.1109/netsoft.2015.7116182openalex-snapshot
Load balancing in data center networks with folded-Clos architectures
inferred← citeshttps://doi.org/10.1109/tcomm.2002.802564openalex-snapshot
Multirate non-blocking generalized three-stage Clos switching networks
inferred← citeshttps://doi.org/10.1109/tcomm.2010.110310.090620openalex-snapshot
The log_2{N-1} Optical Switching Fabrics
inferred← citeshttps://doi.org/10.1137/060656413openalex-snapshot
Improved Bounds on Nonblocking 3-Stage Clos Networks
inferred← citeshttps://doi.org/10.1137/s0097539702408235openalex-snapshot
Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
inferred← citeshttps://doi.org/10.1137/s0097539703433158openalex-snapshot
Strictly Nonblocking Multirate log d ( N , m , p ) Networks
inferred← citeshttps://doi.org/10.1137/s0097539795284716openalex-snapshot
On Multirate Rearrangeable Clos Networks
inferred← citeshttps://doi.org/10.1137/s0097539796313921openalex-snapshot
On Rearrangeability of Multirate Clos Networks
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/s0219265902000549openalex-snapshot
ANALYSIS OF A HIGH-SPEED INTERCONNECTION NETWORK
inferred← citeshttps://doi.org/10.1142/s0219265911002861openalex-snapshot
WEIGHTED-EDGE-COLORING OF k-DEGENERATE GRAPHS AND BIN-PACKING
inferred← citeshttps://doi.org/10.1145/1007352.1007417openalex-snapshot
An approximate König's theorem for edge-coloring weighted bipartite graphs
inferred← citeshttps://doi.org/10.1145/181181.181541openalex-snapshot
An analysis model on nonblocking multirate broadcast networks
inferred← citeshttps://doi.org/10.1145/3662158.3662777openalex-snapshot
Impossibility Results for Data-Center Routing with Congestion Control and Unsplittable Flows
inferred← citeshttps://doi.org/10.1155/2016/4090656openalex-snapshot
Multiservice Switching Networks with Overflow Links and Resource Reservation
inferred← citeshttps://doi.org/10.1155/2017/1575828openalex-snapshot
The Strict‐Sense Nonblocking Multirate logd(N, 0, p) Switching Network
inferred← citeshttps://doi.org/10.1155/2019/2096598openalex-snapshot
Strict‐Sense Nonblocking Conditions for the log2N − 1 Multirate Switching Fabric for the Discrete Bandwidth Model
inferred← citeshttps://doi.org/10.1587/transcom.2018eup0004openalex-snapshot
Wide-Sense Nonblocking W-S-W Node Architectures for Elastic Optical Networks
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.3390/s22166217openalex-snapshot
Wide-Sense Nonblocking Converting-Converting Networks with Multirate Connections
inferred← citeshttps://doi.org/10.48550/arxiv.1204.3180openalex-snapshot
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
inferred← citeshttps://doi.org/10.5555/644108.644248openalex-snapshot
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
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.