Local failover mechanisms are used to achieve fast recovery from edge failures in most modern communication networks. These mechanisms are implemented using static routing tables, only relying on locally available information, to route the packets to their destination, as long as some path remains available. In destination-based routing, static failover routing has been shown to allow for at most one edge failure (denoted 1-resilient) in general graphs, while 2-resiliency is not possible on all topologies without the use of additional bits in the packet header. In this work, we analyze real-world topologies from three datasets and show that 2-resilience is already possible in many real-world networks, and can be achieved in almost all studied topologies, when using 2 additional bits, which can be overwritten and read by the routers, in the packet header. We also close a gap in the analysis of complete bipartite graphs, showing that any \(K_{2,n}\)  has \(\infty \) -resilient forwarding patterns.