On the public citation graph

A scalable approach to routing in ATM networks

https://doi.org/10.1007/bfb0020435
0 signed · 43 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.1002/jgt.3190130114openalex-snapshot
Graph spanners
inferredcites →https://doi.org/10.1002/net.3230100305openalex-snapshot
Optimal clustering structures for hierarchical topological design of large computer networks
inferredcites →https://doi.org/10.1007/bf01762113openalex-snapshot
Designing networks with compact routing tables
inferredcites →https://doi.org/10.1016/0376-5075(77)90002-2openalex-snapshot
Hierarchical routing for large networks Performance evaluation and optimization
inferredcites →https://doi.org/10.1093/comjnl/36.1.19openalex-snapshot
Feedback Techniques for Intra-Media Continuity and Inter-Media Synchronization in Distributed Multimedia Systems
inferredcites →https://doi.org/10.1093/comjnl/36.1.32openalex-snapshot
The Design of a Storage Server for Continuous Media
inferredcites →https://doi.org/10.1109/infcom.1994.337617openalex-snapshot
Virtual path layout design on ATM networks
inferredcites →https://doi.org/10.1109/infcom.1994.337618openalex-snapshot
Connection management and rerouting in ATM networks
inferredcites →https://doi.org/10.1109/sfcs.1986.49openalex-snapshot
Separator-based strategies for efficient message routing
inferredcites →https://doi.org/10.1137/0405013openalex-snapshot
Routing with Polynomial Communication-Space Trade-Off
inferredcites →https://doi.org/10.1145/197917.198100openalex-snapshot
The virtual path layout problem in fast networks (extended abstract)
inferredcites →https://doi.org/10.1145/62212.62217openalex-snapshot
A tradeoff between space and efficiency for routing tables
inferredcites →https://doi.org/10.1145/73007.73053openalex-snapshot
Compact distributed data structures for adaptive routing

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-40064-8_28openalex-snapshot
Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_8openalex-snapshot
On the Use of Duality and Geometry in Layouts for ATM Networks
inferred← citeshttps://doi.org/10.1007/3-540-45414-4_18openalex-snapshot
The Average Hop Count Measure For Virtual Path Layouts
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_4openalex-snapshot
Duality in ATM Layout Problems
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_167openalex-snapshot
Optimal layouts on a chain ATM network
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_208openalex-snapshot
A complete characterization of the path layout construction problem for ATM networks with given hop count and load
inferred← citeshttps://doi.org/10.1007/3-540-63774-5_103openalex-snapshot
Path layout in ATM networks
inferred← citeshttps://doi.org/10.1007/3-540-63774-5_116openalex-snapshot
Lower bounds for the virtual path layout problem in ATM networks
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_7openalex-snapshot
Two-Hop Virtual Path Layout in Tori
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_143openalex-snapshot
Dynamic Layouts for Wireless ATM
inferred← citeshttps://doi.org/10.1007/bfb0024497openalex-snapshot
On optimal graphs embedded into paths and rings, with analysis using l 1-spheres
inferred← citeshttps://doi.org/10.1007/bfb0024510openalex-snapshot
Optimal fault-tolerant ATM-routings for biconnected graphs
inferred← citeshttps://doi.org/10.1007/bfb0030675openalex-snapshot
ATM layouts with bounded hop count and congestion
inferred← citeshttps://doi.org/10.1007/pl00008929openalex-snapshot
ATM layouts with bounded hop count and congestion
inferred← citeshttps://doi.org/10.1016/j.dam.2004.05.004openalex-snapshot
Virtual network embedding in the cycle
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.025openalex-snapshot
Layouts for mobility management in wireless ATM networks
inferred← citeshttps://doi.org/10.1016/j.jda.2004.04.009openalex-snapshot
Optimal fault-tolerant routings with small routing tables for k-connected graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2004.05.003openalex-snapshot
Virtual path layouts optimizing total hop count on ATM tree networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)80002-4openalex-snapshot
Optimal layouts on a chain ATM network
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00396-0openalex-snapshot
On the design of efficient ATM routing schemes
inferred← citeshttps://doi.org/10.1023/b:mone.0000048544.06992.f7openalex-snapshot
Wireless ATM Layouts for Chain Networks
inferred← citeshttps://doi.org/10.1109/65.539856openalex-snapshot
Resource management with virtual paths in ATM networks
inferred← citeshttps://doi.org/10.1109/infcom.1995.515892openalex-snapshot
Dynamic maintenance of the virtual path layout
inferred← citeshttps://doi.org/10.1109/infcom.1996.493076openalex-snapshot
Efficient support for the client/server paradigm over heterogeneous ATM networks
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213403openalex-snapshot
Wireless ATM layouts for chain networks
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213411openalex-snapshot
Quality of service in wireless networks
inferred← citeshttps://doi.org/10.1109/spdp.1995.530745openalex-snapshot
Hop-congestion trade-offs for high-speed networks
inferred← citeshttps://doi.org/10.1142/s0129626403001446openalex-snapshot
TRADE-OFFS BETWEEN LOAD AND DEGREE IN VIRTUAL PATH LAYOUTS
inferred← citeshttps://doi.org/10.1145/225058.225270openalex-snapshot
Bubbles
inferred← citeshttps://doi.org/10.4086/cjtcs.1996.003openalex-snapshot
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.