On the public citation graph

On-the-Fly Adaptive Routing in High-Radix Hierarchical Networks

0 signed · 99 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.1006/jpdc.2001.1746openalex-snapshot
The Adaptive Bubble Router
inferredcites →https://doi.org/10.1007/bf01784721openalex-snapshot
Deadlock analysis in networks of communicating processes
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/12.338098openalex-snapshot
The Chaos router
inferredcites →https://doi.org/10.1109/26.142797openalex-snapshot
Deflection routing in hypercube networks
inferredcites →https://doi.org/10.1109/26.212370openalex-snapshot
MetaRing-a full-duplex ring with fairness and spatial reuse
inferredcites →https://doi.org/10.1109/40.748793openalex-snapshot
Designing and implementing a fast crossbar scheduler
inferredcites →https://doi.org/10.1109/71.127260openalex-snapshot
Virtual-channel flow control
inferredcites →https://doi.org/10.1109/71.250114openalex-snapshot
A new theory of deadlock-free adaptive routing in wormhole networks
inferredcites →https://doi.org/10.1109/hipc.1997.634510openalex-snapshot
A flow control mechanism to avoid message deadlock in k-ary n-cube networks
inferredcites →https://doi.org/10.1109/hoti.2010.16openalex-snapshot
The PERCS High-Performance Interconnect
inferredcites →https://doi.org/10.1109/isca.1990.134508openalex-snapshot
Virtual-channel flow control
inferredcites →https://doi.org/10.1109/isca.2004.1310775openalex-snapshot
Immunet: a cheap and robust fault-tolerant packet routing mechanism
inferredcites →https://doi.org/10.1109/isca.2008.19openalex-snapshot
Technology-Driven, Highly-Scalable Dragonfly Topology
inferredcites →https://doi.org/10.1109/tcom.1981.1095021openalex-snapshot
Prevention of Deadlocks in Packet-Switched Data Transport Systems
inferredcites →https://doi.org/10.1137/0211027openalex-snapshot
A Scheme for Fast Parallel Communication
inferredcites →https://doi.org/10.1145/1028176.1006718openalex-snapshot
Immunet
inferredcites →https://doi.org/10.1145/1080695.1070005openalex-snapshot
Microarchitecture of a High-Radix Router
inferredcites →https://doi.org/10.1145/1394608.1382129openalex-snapshot
Technology-Driven, Highly-Scalable Dragonfly Topology
inferredcites →https://doi.org/10.1145/1555754.1555783openalex-snapshot
Indirect adaptive routing on large scale interconnection networks
inferredcites →https://doi.org/10.1145/2063384.2063419openalex-snapshot
The IBM Blue Gene/Q interconnection network and message unit
inferredcites →https://doi.org/10.1145/2063384.2063486openalex-snapshot
Avoiding hot-spots on two-level direct networks

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.4066openalex-snapshot
Providing differentiated services, congestion management, and deadlock freedom in dragonfly networks with adaptive routing
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_2openalex-snapshot
All-to-All Broadcast in Dragonfly Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-72971-8_7openalex-snapshot
Modeling UGAL on the Dragonfly Topology
inferred← citeshttps://doi.org/10.1007/978-981-19-9582-8_1openalex-snapshot
High-Radix Interconnection Networks
inferred← citeshttps://doi.org/10.1007/s10617-014-9133-xopenalex-snapshot
Randomizing task placement and route selection do not randomize traffic (enough)
inferred← citeshttps://doi.org/10.1007/s11227-014-1357-9openalex-snapshot
On-the-fly adaptive routing for dragonfly interconnection networks
inferred← citeshttps://doi.org/10.1007/s11227-016-1758-zopenalex-snapshot
Network unfairness in dragonfly topologies
inferred← citeshttps://doi.org/10.1007/s11227-024-06146-1openalex-snapshot
Ant Mill: an adversarial traffic pattern for low-diameter direct networks
inferred← citeshttps://doi.org/10.1007/s12596-023-01142-9openalex-snapshot
Efficient implementation of multi-level Dragonfly networks with Hamming graph for future optical networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2025.111334openalex-snapshot
Improving the performance of Dragonfly networks through restrictive Proxy routing strategies
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.04.022openalex-snapshot
ACOR: Adaptive congestion-oblivious routing in dragonfly networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.07.010openalex-snapshot
Leveraging InfiniBand controller to configure deadlock-free routing engines for Dragonflies
inferred← citeshttps://doi.org/10.1016/j.jpdc.2025.105095openalex-snapshot
2-edge-Hamilton-connected dragonfly network
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.028openalex-snapshot
Connectivity and constructive algorithms of disjoint paths in dragonfly networks
inferred← citeshttps://doi.org/10.1109/ccgrid64434.2025.00055openalex-snapshot
Exploiting Software-Defined Networking Technology for Improving Ugal Routing in Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/cluster.2015.136openalex-snapshot
Throughput Unfairness in Dragonfly Networks under Realistic Traffic Patterns
inferred← citeshttps://doi.org/10.1109/cluster.2015.57openalex-snapshot
Comparing Global Link Arrangements for Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/cluster49012.2020.00021openalex-snapshot
Opportunities and limitations of Quality-of-Service in Message Passing applications on adaptively routed Dragonfly and Fat Tree networks
inferred← citeshttps://doi.org/10.1109/globecom46510.2021.9685963openalex-snapshot
Flow-level Adaptive Routing Scheme for RDMA enabled Dragonfly Network
inferred← citeshttps://doi.org/10.1109/hipineb.2017.11openalex-snapshot
Dragonfly+: Low Cost Topology for Scaling Datacenters
inferred← citeshttps://doi.org/10.1109/hipineb.2017.14openalex-snapshot
New Link Arrangements for Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/hipineb.2018.00009openalex-snapshot
Analysis and Improvement of Valiant Routing in Low-Diameter Networks
inferred← citeshttps://doi.org/10.1109/hipineb.2019.00008openalex-snapshot
Shortest paths in Dragonfly systems
inferred← citeshttps://doi.org/10.1109/hoti.2013.16openalex-snapshot
OFAR-CM: Efficient Dragonfly Networks with Simple Congestion Management
inferred← citeshttps://doi.org/10.1109/hoti.2016.017openalex-snapshot
Traffic Pattern-Based Adaptive Routing for Intra-Group Communication in Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/hpca.2015.7056051openalex-snapshot
Overcoming far-end congestion in large-scale networks
inferred← citeshttps://doi.org/10.1109/hpca51647.2021.00064openalex-snapshot
BoomGate: Deadlock Avoidance in Non-Minimal Routing for High-Radix Networks
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys60770.2023.00057openalex-snapshot
QVal: A Novel Routing Algorithm for Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/hpcsim.2015.7237037openalex-snapshot
Straightforward modeling of fully-connected dragonfly topologies in HPC-system simulators
inferred← citeshttps://doi.org/10.1109/hpsr.2015.7483107openalex-snapshot
Performance optimization of load imbalanced workloads in large scale Dragonfly systems
inferred← citeshttps://doi.org/10.1109/icc45041.2023.10278794openalex-snapshot
Adaptive Routing with Hierarchical Reinforcement Learning on Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/icpads.2017.00083openalex-snapshot
An Efficient Label Routing on High-Radix Interconnection Networks
inferred← citeshttps://doi.org/10.1109/icpp.2013.72openalex-snapshot
Efficient Routing Mechanisms for Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/icppw.2017.33openalex-snapshot
Improving Valiant Routing for Slim Fly Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2015.78openalex-snapshot
Contention-Based Nonminimal Adaptive Routing in High-Radix Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2017.110openalex-snapshot
FlexVC: Flexible Virtual Channel Management in Low-Diameter Networks
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00042openalex-snapshot
Performance Evaluation of Adaptive Routing on Dragonfly-based Production Systems
inferred← citeshttps://doi.org/10.1109/isca.2018.00064openalex-snapshot
Synchronized Progress in Interconnection Networks (SPIN): A New Theory for Deadlock Freedom
inferred← citeshttps://doi.org/10.1109/isca.2018.00065openalex-snapshot
TCEP: Traffic Consolidation for Energy-Proportional High-Radix Networks
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom52081.2021.00045openalex-snapshot
PAARD: Proximity-Aware All-Reduce Communication for Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/ps.2015.7329011openalex-snapshot
Large-scale system partitioning using OCS
inferred← citeshttps://doi.org/10.1109/sc.companion.2012.56openalex-snapshot
Modeling a Million-Node Dragonfly Network Using Massively Parallel Discrete-Event Simulation
inferred← citeshttps://doi.org/10.1109/sc41405.2020.00031openalex-snapshot
FatPaths: Routing in Supercomputers and Data Centers when Shortest Paths Fall Short
inferred← citeshttps://doi.org/10.1109/sc41405.2020.00039openalex-snapshot
An In-Depth Analysis of the Slingshot Interconnect
inferred← citeshttps://doi.org/10.1109/tc.2020.3029682openalex-snapshot
Remote Control: A Simple Deadlock Avoidance Scheme for Modular Systems-on-Chip
inferred← citeshttps://doi.org/10.1109/tdsc.2017.2693372openalex-snapshot
Fault-Tolerant Adaptive Routing in Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/tmscs.2018.2877264openalex-snapshot
TPR: Traffic Pattern-Based Adaptive Routing for Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/tpds.2015.2503746openalex-snapshot
Deadlock-Free Broadcast Routing in Dragonfly Networks without Virtual Channels
inferred← citeshttps://doi.org/10.1109/tpds.2016.2543725openalex-snapshot
Enabling Parallel Simulation of Large-Scale HPC Network Systems
inferred← citeshttps://doi.org/10.1109/tpds.2017.2666807openalex-snapshot
Routing and Fault Tolerance in Z-Fat Tree
inferred← citeshttps://doi.org/10.1109/tpds.2017.2742503openalex-snapshot
Scalable Deadlock-Free Deterministic Minimal-Path Routing Engine for InfiniBand-Based Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/tpds.2020.3035761openalex-snapshot
High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks
inferred← citeshttps://doi.org/10.1109/tpds.2021.3100783openalex-snapshot
Exploring the Galaxyfly Family to Build Flexible-Scale Interconnection Networks
inferred← citeshttps://doi.org/10.1145/2482759.2482762openalex-snapshot
Randomizing task placement does not randomize traffic (enough)
inferred← citeshttps://doi.org/10.1145/2482759.2482763openalex-snapshot
Global misrouting policies in two-level hierarchical networks
inferred← citeshttps://doi.org/10.1145/2556857.2556860openalex-snapshot
Performance implications of remote-only load balancing under adversarial traffic in Dragonflies
inferred← citeshttps://doi.org/10.1145/2600212.2600225openalex-snapshot
Efficient task placement and routing of nearest neighbor exchanges in dragonfly networks
inferred← citeshttps://doi.org/10.1145/2677038openalex-snapshot
Topological Characterization of Hamming and Dragonfly Networks and Its Implications on Routing
inferred← citeshttps://doi.org/10.1145/2983387openalex-snapshot
Interconnection Networks in Petascale Computer Systems
inferred← citeshttps://doi.org/10.1145/3225058.3225081openalex-snapshot
Load-Balanced Slim Fly Networks
inferred← citeshttps://doi.org/10.1145/3295500.3356151openalex-snapshot
Practical and efficient incremental adaptive routing for HyperX networks
inferred← citeshttps://doi.org/10.1145/3295500.3356208openalex-snapshot
Topology-custom UGAL routing on dragonfly
inferred← citeshttps://doi.org/10.1145/3316480.3325515openalex-snapshot
Fit Fly
inferred← citeshttps://doi.org/10.1145/3341302.3342065openalex-snapshot
Gentle flow control
inferred← citeshttps://doi.org/10.1145/3349620openalex-snapshot
Modeling Universal Globally Adaptive Load-Balanced Routing
inferred← citeshttps://doi.org/10.1145/3352460.3358255openalex-snapshot
SWAP
inferred← citeshttps://doi.org/10.1145/3392717.3392747openalex-snapshot
Bundlefly
inferred← citeshttps://doi.org/10.1145/3392717.3392756openalex-snapshot
Global link arrangement for practical Dragonfly
inferred← citeshttps://doi.org/10.1145/3431379.3460650openalex-snapshot
Q-adaptive
inferred← citeshttps://doi.org/10.1145/3458817.3476140openalex-snapshot
SEEC: stochastic escape express channel
inferred← citeshttps://doi.org/10.1145/3650200.3656602openalex-snapshot
Enhanced UGAL Routing Schemes for Dragonfly Networks
inferred← citeshttps://doi.org/10.1145/3660320.3660333openalex-snapshot
Defining the Boundaries for Endpoint Congestion Management in Networks for High-Performance Computing
inferred← citeshttps://doi.org/10.1145/3797905.3807854openalex-snapshot
RPFC: A Router Partitioning and Forward Channel Routing Framework for 2.5D MCM System
inferred← citeshttps://doi.org/10.1145/3820906openalex-snapshot
Continuous Fluid Modeling of Credit-Based Flow Control for HPC Interconnection Networks
inferred← citeshttps://doi.org/10.20944/preprints202306.1262.v1openalex-snapshot
HyperZ: Hyper Z-Tree Topology
inferred← citeshttps://doi.org/10.48550/arxiv.1910.04882openalex-snapshot
Remote Control: A Simple Deadlock Avoidance Scheme for Modular System on Chip
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95212openalex-snapshot
Optimization techniques for fine-grained communication in PGAS environments
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.