Physical topologies are evolving from elementary survivable rings into complex mesh networks. Nevertheless, no topology model is known to provide an economic, systematic, and flexible interconnection paradigm for ensuring that those meshes bear resilience features. This paper argues that intrinsic resilience can be brought by twin graph topologies, as they satisfy equal length disjoint path property with minimal number of physical links. Also, they benefit from property preserving recursive methods to graciously scale up/down and merge/split topologies. An exhaustive investigation is performed across twin graph families composing networks from 4 to 17 nodes, whereas diverse real-world topologies and ring networks are used as benchmarks. First, we illustrate the growing and the merging processes, and discuss the topology diversity of twin graphs. We analyze the impact of single cable cuts between neighbouring nodes, then we stress topologies with 2, 3, and 4 simultaneous cable cuts. Improved resiliency is seen for neighbor nodes and also reduction of cut sets able to disconnect the twin topologies in comparison with real-world networks. At transport layer, we derive and validate an upper bound for additional capacity required to implement \(1+1\) path dedicated protection. As networks grow larger, this protection cost is consistently reduced compared to benchmark topologies. We also test the suitability of our approach at optical layer regarding transponders consumption. Finally, we present as a use case the redesign of CESNET into a resilient network.

物理拓扑结构已从基本的可生存环演化为复杂的网格网络。然而，尚无拓扑模型能够提供经济，系统和灵活的互连范例来确保这些网格具有弹性特征。本文认为，双图拓扑可以带来内在的弹性，因为它们满足了等长的不相交路径属性，并具有最少的物理链接数。此外，它们还受益于保留属性的递归方法，可以轻松地按比例放大/缩小和合并/拆分拓扑。对构成4到17个节点的网络的双图族进行了详尽的研究，而使用各种现实世界的拓扑和环形网络作为基准。首先，我们说明了增长和合并过程，并讨论了双图的拓扑多样性。我们分析相邻节点之间单根电缆切割的影响，然后通过同时进行2、3和4条电缆切割来强调拓扑。与实际网络相比，邻居节点的弹性得到了改善，并且割线集的减少也使双拓扑结构断开。在传输层，我们导出并验证实施所需的额外容量的上限\（1 + 1 \）路径专用保护。随着网络的扩大，与基准拓扑相比，保护成本不断降低。我们还测试了在光层上有关应答器消耗的方法的适用性。最后，我们将CESNET重新设计为弹性网络作为用例。