On the public citation graph
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks
0 signed · 77 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/net.3230180105openalex-snapshot
Generalized de Bruijn digraphs
inferredcites →https://doi.org/10.1007/bf02579310openalex-snapshot
The diameter of random regular graphs
inferredcites →https://doi.org/10.1007/s11134-017-9546-xopenalex-snapshot
Costly circuits, submodular schedules and approximate Carathéodory Theorems
inferredcites →https://doi.org/10.1016/0012-365x(81)90006-6openalex-snapshot
Matchings in regular graphs
inferredcites →https://doi.org/10.1016/j.osn.2021.100621openalex-snapshot
A Survey of Reconfigurable Optical Networks
inferredcites →https://doi.org/10.1109/90.251892openalex-snapshot
Random early detection gateways for congestion avoidance
inferredcites →https://doi.org/10.1109/90.664262openalex-snapshot
Dynamic queue length thresholds for shared-memory packet switches
inferredcites →https://doi.org/10.1109/hpsr.2013.6602305openalex-snapshot
PIE: A lightweight control scheme to address the bufferbloat problem
inferredcites →https://doi.org/10.1109/jlt.2003.822207openalex-snapshot
Tunable Semiconductor Lasers: A Tutorial
inferredcites →https://doi.org/10.1109/jstqe.2013.2295879openalex-snapshot
Ultra-Compact Silicon Photonic 512 × 512 25 GHz Arrayed Waveguide Grating Router
inferredcites →https://doi.org/10.1109/mic.2021.3075326openalex-snapshot
FLEET—Fast Lanes for Expedited Execution at 10 Terabits: Program Overview
inferredcites →https://doi.org/10.1109/sc.2014.34openalex-snapshot
Slim Fly: A Cost Effective Low-Diameter Network Topology
inferredcites →https://doi.org/10.1109/sc.2016.64openalex-snapshot
Measuring and Understanding Throughput of Network Topologies
inferredcites →https://doi.org/10.1109/tc.1983.1676323openalex-snapshot
A Design for Directed Graphs with Minimum Diameter
inferredcites →https://doi.org/10.1109/tc.1985.1676569openalex-snapshot
Connectivity of Regular Directed Graphs with Small Diameters
inferredcites →https://doi.org/10.1109/tnet.2013.2253120openalex-snapshot
OSA: An Optical Switching Architecture for Data Center Networks With Unprecedented Flexibility
inferredcites →https://doi.org/10.1109/tnet.2015.2410313openalex-snapshot
SplayNet: Towards Locally Self-Adjusting Networks
inferredcites →https://doi.org/10.1109/tnet.2020.3032999openalex-snapshot
One More Config is Enough: Saving (DC)TCP for High-Speed Extremely Shallow-Buffered Datacenters
inferredcites →https://doi.org/10.1137/1.9781611976489.3openalex-snapshot
ReNets: Statically-Optimal Demand-Aware Networks
inferredcites →https://doi.org/10.1137/s0097539793243016openalex-snapshot
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
inferredcites →https://doi.org/10.1137/s0097539794285983openalex-snapshot
An O (log k ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
inferredcites →https://doi.org/10.1145/1402958.1402967openalex-snapshot
A scalable, commodity data center network architecture
inferredcites →https://doi.org/10.1145/1851182openalex-snapshot
Proceedings of the ACM SIGCOMM 2010 conference
inferredcites →https://doi.org/10.1145/2377677.2377710openalex-snapshot
Finishing flows quickly with preemptive scheduling
inferredcites →https://doi.org/10.1145/2934872openalex-snapshot
Proceedings of the 2016 ACM SIGCOMM Conference
inferredcites →https://doi.org/10.1145/3098822.3098825openalex-snapshot
Re-architecting datacenter networks and stacks for low latency and high performance
inferredcites →https://doi.org/10.1145/3098822.3098836openalex-snapshot
Beyond fat-trees without antennae, mirrors, and disco-balls
inferredcites →https://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferredcites →https://doi.org/10.1145/3409964.3461786openalex-snapshot
Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters
inferredcites →https://doi.org/10.1145/3452296openalex-snapshot
Proceedings of the 2021 ACM SIGCOMM 2021 Conference
inferredcites →https://doi.org/10.1145/3452296.3472913openalex-snapshot
A throughput-centric view of the performance of datacenter topologies
inferredcites →https://doi.org/10.1145/3491050openalex-snapshot
Cerberus: The Power of Choices in Datacenter Topology Design (A Throughput Perspective)
inferredcites →https://doi.org/10.1145/3579449openalex-snapshot
Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control
inferredcites →https://doi.org/10.1145/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
inferredcites →https://doi.org/10.21236/ada211908openalex-snapshot
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms
inferredcites →https://doi.org/10.48550/arxiv.1903.12307openalex-snapshot
Expanding across time to deliver bandwidth efficiency and low latency
inferredcites →https://doi.org/10.48550/arxiv.1905.02800openalex-snapshot
Online and Offline Greedy Algorithms for Routing with Switching Costs
inferredcites →https://doi.org/10.48550/arxiv.2112.14309openalex-snapshot
PowerTCP: Pushing the Performance Limits of Datacenter 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-032-00347-8_3openalex-snapshot
Distributed Computation of Temporal Twins in Periodic Undirected Time-Varying Graphs
inferred← citeshttps://doi.org/10.1016/j.comnet.2023.110143openalex-snapshot
Beyond matchings: Dynamic multi-hop topology for demand-aware datacenters
inferred← citeshttps://doi.org/10.1016/j.comnet.2025.111803openalex-snapshot
Integrating topology and traffic engineering to maximize throughput in reconfigurable networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2026.112255openalex-snapshot
D3: Enhancing reconfigurable datacenters with adaptive demand-oblivious and demand-aware integration
inferred← citeshttps://doi.org/10.1109/iwqos65803.2025.11143394openalex-snapshot
Talbot: Improving Throughput for Traffic Dynamics in Reconfigurable Datacenters
inferred← citeshttps://doi.org/10.1109/lcn67947.2026.11660425openalex-snapshot
Flipping the Script: Out-of-Order Transmission with In-Order Delivery for Maximized Link Utilization
inferred← citeshttps://doi.org/10.1145/3578338.3593537openalex-snapshot
Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control
inferred← citeshttps://doi.org/10.1145/3581784.3607057openalex-snapshot
Optimizing Reconfigurable Optical Datacenters: The Power of Randomization
inferred← citeshttps://doi.org/10.1145/3606376.3593537openalex-snapshot
Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control
inferred← citeshttps://doi.org/10.1145/3618260.3649608openalex-snapshot
Breaking the VLB Barrier for Oblivious Reconfigurable Networks
inferred← citeshttps://doi.org/10.1145/3651890.3672245openalex-snapshot
Uniform-Cost Multi-Path Routing for Reconfigurable Data Center Networks
inferred← citeshttps://doi.org/10.1145/3651890.3672248openalex-snapshot
Shale: A Practical, Scalable Oblivious Reconfigurable Network
inferred← citeshttps://doi.org/10.1145/3726854.3727308openalex-snapshot
Application-driven Reexamination of Datacenter Microbursts
inferred← citeshttps://doi.org/10.1145/3727126openalex-snapshot
Poison comes in small packages: Application-driven Reexamination of Datacenter Microbursts
inferred← citeshttps://doi.org/10.1145/3744970.3727308openalex-snapshot
Application-driven Reexamination of Datacenter Microbursts
inferred← citeshttps://doi.org/10.1145/3789240.3829166openalex-snapshot
Harvest: Adaptive Photonic Switching Schedules for Collective Communication in Scale-up Domains
inferred← citeshttps://doi.org/10.1145/3796701.3815941openalex-snapshot
A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput
inferred← citeshttps://doi.org/10.1145/3797905.3800555openalex-snapshot
DistroMatch: Distributed Disjoint Weighted Matchings in Demand-Aware Reconfigurable Optical Datacenters
inferred← citeshttps://doi.org/10.1364/jocn.554450openalex-snapshot
Optimal placement of multi-wavelength integrated tunable transmitters in reconfigurable optical data center interconnection networks with multi-hop routing
inferred← citeshttps://doi.org/10.23919/ifipnetworking70592.2026.11579086openalex-snapshot
CBB-Net: Towards a demand-aware periodic microsecond-switching RDCN for skewed traffic
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.