On the public citation graph
On Count-to-Infinity Induced Forwarding Loops Ethernet 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.1016/0020-0190(80)90021-6openalex-snapshot
Termination detection for diffusing computations
inferredcites →https://doi.org/10.1109/12.142678openalex-snapshot
Manetho: transparent roll back-recovery with low overhead, limited rollback, and fast output commit
inferredcites →https://doi.org/10.1109/90.222913openalex-snapshot
Loop-free routing using diffusing computations
inferredcites →https://doi.org/10.1109/infcom.2004.1354641openalex-snapshot
Scalable cycle-breaking algorithms for gigabit Ethernet backbones
inferredcites →https://doi.org/10.1109/infcom.2004.1354651openalex-snapshot
Viking: a multi-spanning-tree Ethernet architecture for metropolitan area and cluster networks
inferredcites →https://doi.org/10.1109/infcom.2004.1357007openalex-snapshot
Rbridges: transparent routing
inferredcites →https://doi.org/10.1109/nca.2003.1201170openalex-snapshot
LSOM: A Link State protocol Over MAC addresses for metropolitan backbones using Optical Ethernet switches
inferredcites →https://doi.org/10.1109/tcom.1979.1094552openalex-snapshot
A Failsafe Distributed Routing Protocol
inferredcites →https://doi.org/10.1109/tcom.1982.1095632openalex-snapshot
A Responsive Distributed Routing Algorithm for Computer Networks
inferredcites →https://doi.org/10.1145/128738.128742openalex-snapshot
Lightweight causal and atomic group multicast
inferredcites →https://doi.org/10.1145/190809.190336openalex-snapshot
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
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-031-64657-7_5openalex-snapshot
Resilience Schemes for Fast Recovery in Packet-Switched Communication Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-77510-4_4openalex-snapshot
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72990-7_13openalex-snapshot
Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-21887-3_44openalex-snapshot
A Speed-Up Technique for Distributed Shortest Paths Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_12openalex-snapshot
Engineering a New Loop-Free Shortest Paths Routing Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-38789-0_13openalex-snapshot
A Dependable Alternative to the Spanning Tree Protocol
inferred← citeshttps://doi.org/10.1007/s00224-015-9608-6openalex-snapshot
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios
inferred← citeshttps://doi.org/10.1016/j.comnet.2007.10.009openalex-snapshot
ABridges: Scalable, self-configuring Ethernet campus networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2009.08.007openalex-snapshot
HURP/HURBA: Zero-configuration hierarchical Up/Down routing and bridging architecture for Ethernet backbones and campus networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.001openalex-snapshot
A loop-free shortest-path routing algorithm for dynamic networks
inferred← citeshttps://doi.org/10.1109/comst.2021.3063980openalex-snapshot
A Survey of Fast-Recovery Mechanisms in Packet-Switched Networks
inferred← citeshttps://doi.org/10.1109/ecoc.2008.4729523openalex-snapshot
GMPLS-controlled Ethernet segment protection
inferred← citeshttps://doi.org/10.1109/glocom.2009.5425398openalex-snapshot
VLAN-Based Routing Infrastructure for an All-Optical Circuit Switched LAN
inferred← citeshttps://doi.org/10.1109/glocom.2010.5683943openalex-snapshot
Simple Protocol Enhancements of Rapid Spanning Tree Protocol over Ring Topologies
inferred← citeshttps://doi.org/10.1109/iccs.2008.4737195openalex-snapshot
Ethernet Ultra Fast Switching: A tree-based local recovery scheme
inferred← citeshttps://doi.org/10.1109/ict.2016.7500475openalex-snapshot
Improving carrier ethernet recovery time using a fast reroute mechanism
inferred← citeshttps://doi.org/10.1109/iraniancee.2012.6292536openalex-snapshot
A fast convergence solution for distance vector routing protocol using hidden markov model (HMM)
inferred← citeshttps://doi.org/10.1109/surv.2009.090108openalex-snapshot
A survey of advanced ethernet forwarding approaches
inferred← citeshttps://doi.org/10.1109/tnet.2008.920874openalex-snapshot
Understanding and Mitigating the Effects of Count to Infinity in Ethernet Networks
inferred← citeshttps://doi.org/10.1109/tnet.2009.2025374openalex-snapshot
Always Acyclic Distributed Path Computation
inferred← citeshttps://doi.org/10.1109/tnsm.2021.3099620openalex-snapshot
TEL: Low-Latency Failover Traffic Engineering in Data Plane
inferred← citeshttps://doi.org/10.1109/tridentcom.2009.4976212openalex-snapshot
Emulation of GMPLS-controlled Ethernet Label Switching
inferred← citeshttps://doi.org/10.1117/12.804287openalex-snapshot
Multiple enhanced self-protected spanning trees based architecture for recovery from single failure in metro ethernet
inferred← citeshttps://doi.org/10.1145/1402946.1402966openalex-snapshot
A policy-aware switching layer for data centers
inferred← citeshttps://doi.org/10.1145/2611354.2611359openalex-snapshot
In-Band Control for an Ethernet-Based Software-Defined Network
inferred← citeshttps://doi.org/10.14569/ijacsa.2020.0111268openalex-snapshot
An Effective Solution to Count-to-Infinity Problem for both Complex and Linear Sub-Networks
inferred← citeshttps://doi.org/10.20944/preprints201707.0081.v1openalex-snapshot
Distance-Vector Algorithms for Distributed Shortest Paths on Dynamic Power-Law Networks
inferred← citeshttps://doi.org/10.36227/techrxiv.12367508openalex-snapshot
A Survey of Fast Recovery Mechanisms in the Data Plane
inferred← citeshttps://doi.org/10.36227/techrxiv.12367508.v1openalex-snapshot
Fast Recovery Mechanisms in the Data Plane
inferred← citeshttps://doi.org/10.36227/techrxiv.12367508.v2openalex-snapshot
A Survey of Fast Recovery Mechanisms in the Data Plane
inferred← citeshttps://doi.org/10.7508/jist.2013.04.007openalex-snapshot
A NEW APPROACH TO OVERCOME THE COUNT TO INFINITY PROBLEM IN DVR PROTOCOL BASED ON HMM MODELLING
inferred← citeshttps://doi.org/10.9790/0661-0431320openalex-snapshot
Distributed Path Computation Using DIV Algorithm
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.