On the public citation graph
Oversubscription Bounded Multicast Scheduling in Fat-Tree Data Center Networks
0 signed · 48 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.1109/12.811110openalex-snapshot
The necessary conditions for Clos-type nonblocking multicast networks
inferredcites →https://doi.org/10.1109/12.83662openalex-snapshot
Nonblocking broadcast switching networks
inferredcites →https://doi.org/10.1109/90.700894openalex-snapshot
Blocking and nonblocking multirate Clos switching networks
inferredcites →https://doi.org/10.1109/infcom.2011.5935228openalex-snapshot
RDCM: Reliable data center multicast
inferredcites →https://doi.org/10.1109/infcom.2012.6195470openalex-snapshot
REWIRE: An optimization-based framework for unstructured data center network design
inferredcites →https://doi.org/10.1109/infcom.2012.6195506openalex-snapshot
Exploring server redundancy in nonblocking multicast data center networks
inferredcites →https://doi.org/10.1109/mcom.2003.1235592openalex-snapshot
A survey of noriblocking multicast three-stage clos networks
inferredcites →https://doi.org/10.1109/tc.2014.2346576openalex-snapshot
Exploring Server Redundancy in Nonblocking Multicast Data Center Networks
inferredcites →https://doi.org/10.1109/tnet.2003.815302openalex-snapshot
Online multicast routing with bandwidth guarantees: A new approach using multicast network flow
inferredcites →https://doi.org/10.1109/tnet.2011.2169985openalex-snapshot
ESM: Efficient and Scalable Data Center Multicast Routing
inferredcites →https://doi.org/10.1145/1402946.1402967openalex-snapshot
A scalable, commodity data center network architecture
inferredcites →https://doi.org/10.1145/1402958.1402967openalex-snapshot
A scalable, commodity data center network architecture
inferredcites →https://doi.org/10.1145/181181.181541openalex-snapshot
An analysis model on nonblocking multirate broadcast networks
inferredcites →https://doi.org/10.1145/1879141.1879175openalex-snapshot
Network traffic characteristics of data centers in the wild
inferredcites →https://doi.org/10.1145/2018436.2018465openalex-snapshot
Towards predictable datacenter networks
inferredcites →https://doi.org/10.1145/2018436.2018467openalex-snapshot
Improving datacenter performance and robustness with multipath TCP
inferredcites →https://doi.org/10.1145/316188.316209openalex-snapshot
A flexible model for resource management in virtual private networks
inferredcites →https://doi.org/10.1145/316194.316209openalex-snapshot
A flexible model for resource management in virtual private networks
inferredcites →https://doi.org/10.17487/rfc2992openalex-snapshot
Analysis of an Equal-Cost Multi-Path Algorithm
inferredcites →https://doi.org/10.21276/ijre.2018.5.5.4openalex-snapshot
MapReduce: Simplified Data Processing on Large Cluster
inferredcites →https://doi.org/10.5555/1855711.1855730openalex-snapshot
Hedera: dynamic flow scheduling for data center 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/978-3-030-62098-1_10openalex-snapshot
Fat Tree Algebraic Formal Modelling Applied to Fog Computing
inferred← citeshttps://doi.org/10.1007/978-981-33-6987-0_42openalex-snapshot
Modelling a Folded N-Hypercube Topology for Migration in Fog Computing
inferred← citeshttps://doi.org/10.1007/978-981-33-6987-0_47openalex-snapshot
Modelling a Plain N-Hypercube Topology for Migration in Fog Computing
inferred← citeshttps://doi.org/10.1007/s10723-017-9402-6openalex-snapshot
Construction and Resource Allocation of Cost-Efficient Clustered Virtual Network in Software Defined Networks
inferred← citeshttps://doi.org/10.1051/epjconf/202429504020openalex-snapshot
Dynamic scheduling using CPU oversubscription in the ALICE Grid
inferred← citeshttps://doi.org/10.1109/ains47559.2019.8968700openalex-snapshot
Scalability Evaluation of Aspen Tree and Fat Tree Using NS3
inferred← citeshttps://doi.org/10.1109/cloud.2014.81openalex-snapshot
Simulating the Effects of Cloud-Based Oversubscription on Datacenter Revenues and Performance in Single and Multi-class Service Levels
inferred← citeshttps://doi.org/10.1109/comst.2016.2626784openalex-snapshot
A Survey on Data Center Networking (DCN): Infrastructure and Operations
inferred← citeshttps://doi.org/10.1109/confluence.2016.7508187openalex-snapshot
MCDC: Multicast routing leveraging SDN for Data Center networks
inferred← citeshttps://doi.org/10.1109/ecs.2015.7125057openalex-snapshot
Addressing agility and improving load balance in fat-tree data center network — A review
inferred← citeshttps://doi.org/10.1109/glocom.2018.8647836openalex-snapshot
Adaptively Fitting Network Topologies to Traffic Locality in Clos-Type Data Center Networks
inferred← citeshttps://doi.org/10.1109/icc.2018.8422567openalex-snapshot
Fitted Fat-Tree for Localized Traffic in Data Center Networks
inferred← citeshttps://doi.org/10.1109/jlt.2021.3062629openalex-snapshot
10 OAM × 16 Wavelengths Two-Layer Switch Based on an Integrated Mode Multiplexer for 19.2 Tb/s Data Traffic
inferred← citeshttps://doi.org/10.1109/tc.2014.2315631openalex-snapshot
On Nonblocking Multicast Fat-Tree Data Center Networks with Server Redundancy
inferred← citeshttps://doi.org/10.1109/tpds.2018.2817623openalex-snapshot
MCL: A Cost-Efficient Nonblocking Multicast Interconnection Network
inferred← citeshttps://doi.org/10.1109/trustcom.2016.0234openalex-snapshot
MRDC: Multicast Data Restoration in Fat-Tree Data Center Networks
inferred← citeshttps://doi.org/10.1145/2684083.2684093openalex-snapshot
1-to-N and N-to-1 Communication for Optical Networks
inferred← citeshttps://doi.org/10.14445/22315381/ijett-v8p273openalex-snapshot
On Cloud-based Oversubscription
inferred← citeshttps://doi.org/10.3390/app12126235openalex-snapshot
Link Load Correlation-Based Blocking Performance Analysis for Tree-Type Data Center 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.