On the public citation graph

Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates

0 signed · 56 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.1007/978-3-540-24693-0_97openalex-snapshot
On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity
inferredcites →https://doi.org/10.1007/978-3-540-73530-4_14openalex-snapshot
A Novel Loop-Free IP Fast Reroute Algorithm
inferredcites →https://doi.org/10.1016/b978-0-12-557189-0.x5000-8openalex-snapshot
Routing, Flow, and Capacity Design in Communication and Computer Networks
inferredcites →https://doi.org/10.1016/j.comnet.2009.10.020openalex-snapshot
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
inferredcites →https://doi.org/10.1109/comswa.2007.382443openalex-snapshot
Evaluation of IP Fast Reroute Proposals
inferredcites →https://doi.org/10.1109/drcn.2011.6076886openalex-snapshot
Optimizing IGP link costs for improving IP-level resilience
inferredcites →https://doi.org/10.1109/hpsr.2003.1226686openalex-snapshot
Improving the resilience in IP networks
inferredcites →https://doi.org/10.1109/infcom.2003.1208692openalex-snapshot
An approach to alleviate link overload as observed on an IP backbone
inferredcites →https://doi.org/10.1109/infcom.2004.1354492openalex-snapshot
Proactive vs reactive approaches to failure resilient routing
inferredcites →https://doi.org/10.1109/infcom.2005.1498576openalex-snapshot
Failure inferencing based fast rerouting for handling transient link and node failures
inferredcites →https://doi.org/10.1109/infcom.2009.5062229openalex-snapshot
IP Fast ReRoute: Lightweight Not-Via without Additional Addresses
inferredcites →https://doi.org/10.1109/infcom.2010.5461923openalex-snapshot
On the Feasibility and Efficacy of Protection Routing in IP Networks
inferredcites →https://doi.org/10.1109/infcom.2011.5935135openalex-snapshot
IP fast ReRoute: Loop Free Alternates revisited
inferredcites →https://doi.org/10.1109/infocom.2006.353openalex-snapshot
Failure Inferencing Based Fast Rerouting for Handling Transient Link and Node Failures
inferredcites →https://doi.org/10.1109/jsac.2011.111002openalex-snapshot
The Internet Topology Zoo
inferredcites →https://doi.org/10.1109/mcom.2002.1039866openalex-snapshot
Traffic engineering with traditional IP routing protocols
inferredcites →https://doi.org/10.1109/tnet.2008.926507openalex-snapshot
Multiple Routing Configurations for Fast IP Network Recovery
inferredcites →https://doi.org/10.1145/1070873.1070877openalex-snapshot
Achieving sub-second IGP convergence in large IP networks
inferredcites →https://doi.org/10.1145/1095921.1095962openalex-snapshot
An evaluation of IP-based fast reroute techniques
inferredcites →https://doi.org/10.1145/1364654.1364688openalex-snapshot
On improving the efficiency and manageability of NotVia
inferredcites →https://doi.org/10.1145/1658939.1658974openalex-snapshot
SafeGuard
inferredcites →https://doi.org/10.1145/637201.637237openalex-snapshot
Inferring link weights using end-to-end measurements
inferredcites →https://doi.org/10.1145/863955.863991openalex-snapshot
Making intra-domain routing robust to changing and uncertain traffic demands
inferredcites →https://doi.org/10.1287/ijoc.10.1.1openalex-snapshot
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems
inferredcites →https://doi.org/10.17487/rfc1195openalex-snapshot
Use of OSI IS-IS for routing in TCP/IP and dual environments
inferredcites →https://doi.org/10.17487/rfc2328openalex-snapshot
OSPF Version 2
inferredcites →https://doi.org/10.17487/rfc4090openalex-snapshot
Fast Reroute Extensions to RSVP-TE for LSP Tunnels
inferredcites →https://doi.org/10.17487/rfc4928openalex-snapshot
Avoiding Equal Cost Multipath Treatment in MPLS Networks
inferredcites →https://doi.org/10.17487/rfc5286openalex-snapshot
Basic Specification for IP Fast Reroute: Loop-Free Alternates
inferredcites →https://doi.org/10.17487/rfc5714openalex-snapshot
IP Fast Reroute Framework
inferredcites →https://doi.org/10.17487/rfc6981openalex-snapshot
A Framework for IP and MPLS Fast Reroute Using Not-Via Addresses
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.

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-642-38082-2_6openalex-snapshot
High Availability in the Future Internet
inferred← citeshttps://doi.org/10.1007/978-981-13-5802-9_2openalex-snapshot
A Reliable Routing Protocol with Backup Scheme in Wired Computer Networks
inferred← citeshttps://doi.org/10.1007/s11235-015-0006-9openalex-snapshot
On providing fast protection with remote loop-free alternates
inferred← citeshttps://doi.org/10.1016/j.comcom.2013.01.003openalex-snapshot
Reliable network-based services
inferred← citeshttps://doi.org/10.1016/j.comnet.2015.11.009openalex-snapshot
Routing optimization for IP networks with loop-free alternates
inferred← citeshttps://doi.org/10.1016/j.ress.2024.110629openalex-snapshot
Service risk evaluation of telecommunication core network: A perspective of routing resilience
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/elektro.2016.7512037openalex-snapshot
Fast rerouting traffic algorithm between data centers
inferred← citeshttps://doi.org/10.1109/iceta51985.2020.9379175openalex-snapshot
Review of Fast ReRoute solutions
inferred← citeshttps://doi.org/10.1109/icin.2018.8401580openalex-snapshot
Destination-specific maximally redundant trees: Design, performance comparison, and applications
inferred← citeshttps://doi.org/10.1109/meco.2016.7525755openalex-snapshot
Paired transitions algorithm of communication links in computer networks based on subnet routing method
inferred← citeshttps://doi.org/10.1109/netsoft.2018.8459923openalex-snapshot
Efficient Data Plane Protection for SDN
inferred← citeshttps://doi.org/10.1109/notere.2015.7293450openalex-snapshot
Survivable Virtual Network Embedding with resource sharing and optimization
inferred← citeshttps://doi.org/10.1109/rndm.2018.8489832openalex-snapshot
Evolution of IP Fast-Reroute Strategies
inferred← citeshttps://doi.org/10.1109/sibcon.2016.7491720openalex-snapshot
Proactive backup scheme of routes in distributed computer networks
inferred← citeshttps://doi.org/10.1109/tnsm.2021.3090843openalex-snapshot
Robust LFA Protection for Software-Defined Networks (RoLPS)
inferred← citeshttps://doi.org/10.32604/cmc.2021.016368openalex-snapshot
Energy-Efficient Routing Algorithm Based on Multipath Routing in Large-Scale Networks
inferred← citeshttps://doi.org/10.3390/app11073133openalex-snapshot
Enhanced Bit Repair IP Fast Reroute Mechanism for Rapid Network Recovery
inferred← citeshttps://doi.org/10.3390/app15158151openalex-snapshot
Intra-Domain Routing Protection Scheme Based on the Minimum Cross-Degree Between the Shortest Path and Backup Path
inferred← citeshttps://doi.org/10.3390/s20123428openalex-snapshot
Enhanced Multicast Repair Fast Reroute Mechanism for Smart Sensors IoT and Network Infrastructure
inferred← citeshttps://doi.org/10.3390/s20185230openalex-snapshot
A New Bit Repair Fast Reroute Mechanism for Smart Sensors IoT Network Infrastructure
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
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.