The Internet interdomain routing protocol (border gateway protocol) exhibits slow
convergence. Many Internet applications suffer from the effects of its high convergence …

Recent proposals on Data Center Networks (DCN) are based on centralized control and a
logical network fabric following a well-controlled baseline topology. The architectural split of …

Handling link failures is the fundamental task of routing schemes. Routing protocols based
on link state (eg, OSPF) require a global state advertisement and re-computation when link …

IP Fast ReRoute (IPFRR) is the IETF standard for providing fast failure protection in IP and
MPLS/LDP networks and Loop Free Alternates (LFA) is a basic specification for …

This paper addresses a core question in distributed systems: how should applications be
notified of failures? When a distributed system acts on failure reports, the system's …

This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular
graph embeddings to reroute packets that would otherwise be dropped in case of link or …

Source-controlled routing has been proposed as a way to improve flexibility of future
network architectures, as well as simplifying the data plane. However, if a packet specifies its …

A major concern in IP networks is to ensure that any topology changes, whether planned or
unplanned, do not disrupt network performance. IP Fast Reroute (IP FRR) is a general …

We present and study the Static-Routing-Resiliency problem, motivated by routing on the
Internet: Given a graph $ G $, a unique destination vertex $ d $, and an integer constant $ c> …

This paper proposes KAR (Key-for-Any-Route), a new intra-domain resilient routing system
in which edge-nodes set a route ID to select any existing route as an alternative to safely …