Aug 2026· Proceedings of the ACM SIGCOMM 2026 Conference· 0 citations· 15 references
TL;DR
This paper identifies an algebraic property of cycles, which is called centripetalism, that characterizes the existence of unique stable routings for all possible destinations in a network and failure scenarios and presents the Consistent-Tree algorithm, which either produces a stable routing or reports the presence of a non-centripetal cycle.
Abstract
Routing algebras provide a formal framework for reasoning about routing problems, algorithms, and protocols. They currently underpin systems that verify the correctness of internet routing protocol configurations prior to deployment. All such protocols—from BGP to IS-IS, OSPF, and EIGRP—can be regarded as solutions to the stable routing problem, namely that of finding an equilibrium choice of forwarding neighbors at each node of a network so as to reach a common destination. To date, only partial conditions for the existence and uniqueness of stable routings have been established. In this paper, we identify an algebraic property of cycles, which we call centripetalism, that characterizes the existence of unique stable routings for all possible destinations in a network and failure scenarios. Building on this characterization, we present the Consistent-Tree algorithm, which either produces a stable routing or reports the presence of a non-centripetal cycle, in O(n2 × m) time, where n and m denote the number of nodes and links in the network, respectively.
This paper presents detailed algorithm for calculating L-LSR coefficient, and shows that L-LSR algorithm not only performs better than OSPF, but also has verySignificant performance improvement over the other LSR family of algorithms.
The recursive match networks (RMNs) represent an important family of communication networks characterized by their regularity and high fault tolerance, including the logic graph of the data center network BCube, the interconnection networks bijective connection (BC) networks, and even potentially other future networks. Protection routing is a key technology to enhance the reliability of communication networks, where dual completely independent spanning trees (dual-CISTs) have garnered significant attention as they suffice to configure a protection routing. In this paper, we propose a novel concept of dual protection routing spanning trees (dual-PRSTs) and demonstrate their application for protection routing construction in RMNs. Compared with dual-CISTs, dual-PRSTs provide more relaxed conditions, allowing for link intersections, internal vertex intersections, and vertices each serving as an inner-vertex in both trees, which are not permitted in dual-CISTs. We show that the research results in this paper are directly applicable to BCube, the BC networks, and other networks that fall within the definition of RMNs. Furthermore, it is proven that as long as a communication network contains dual-PRSTs, they can be utilized to configure a protection routing in it, although the protection routing scheme is conducted in RMNs. Empirical evaluations demonstrate that the protection routing based on dual-PRSTs is not only effective with competitive performance, but also generally outperforms that built with dual-CISTs in terms of path length metrics.
Bai Yin, Qianru Zhou, B. Cheng et al.· IEEE Transactions on Network...· 0 citations
A new proof that the multiple-unicast conjecture holds for networks with at most six coding nodes, without computer-aided search, is given, and it is shown that if the conjecture holds on $\Gamma_{3,3}$, then it holds whenever no three sessions have six distinct terminal locations.
Sirui Liu, Linfeng Que, Zongpeng Li et al.· 0 citations
In graph theory and its applications to networking, such as telecommunications or transportation, path-finding is a central problem. While single-path algorithms are well established, methods for handling sets of multiple paths are less developed. A companion paper introduced a formal model for defining attributes over sets of paths based on their structural properties; this paper addresses that model's practical implementation. We present an optimized algorithm for computing cut sets of a path set—a nontrivial task that can be infeasible without efficient methods—and validate its performance via systematic benchmarks on network simulations of varying complexity. Additionally, we introduce a vectorized computational framework that expresses property calculations as matrix operations, enabling concise implementations in array-oriented languages. Together, these contributions establish practical foundations for the companion model, demonstrating that its implementation is both feasible and characterized by predictable, acceptable execution times.
G. Fiaschi, Carlo Vitucci, Thomas Westerbäck et al.· International Conference on...· 0 citations
In a distributed Internet of Agents (IoA) without centralized routing control, routing tasks to capability-matched executors is challenging because destinations are not predetermined and agents have bounded local service views. Discover-then-forward approaches, by contrast, select an executor before network forwarding and therefore do not directly support reselection when additional candidates become visible downstream. We introduce Semantic Potential Field Routing (SPFR), a distributed IoA routing algorithm that integrates executor discovery and reselection into hop-by-hop forwarding. SPFR represents each executor visible in a local semantic forwarding information base (FIB) as a task-conditioned semantic potential source, with utility setting its strength and hop distance inducing exponential attenuation. At each hop, the forwarding agent recomputes these potentials, reselects the dominant executor, and forwards the task one hop toward it. Under task-consistent frozen-FIB conditions, we prove loop freedom and finite-hop termination and derive an explicit additive error bound under bounded visibility relative to the full-visibility objective. Extensive simulations on real-world topologies show that SPFR approaches the realized utility of distributed utility-greedy routing and request-triggered global discovery while using fewer forwarding hops and substantially fewer request-triggered messages, and remains robust under network and service dynamics.
Yeguang Qin, Liang-Qi Peng, Fengxiao Tang et al.· 0 citations
Wireless multi-hop networks rely on a subset of nodes to relay traffic, broadcast control messages, and maintain global connectivity without requiring every device to forward packets. A virtual backbone formalizes this idea by selecting a sparse set of representative nodes that can cover the network and serve as a routing substrate. In graph terms, given a general communication graph G = (V,E), the backbone is often modeled as a connected dominating set (CDS): a subset S ⊆ V such that every node in V \S has a neighbor in S, and the subgraph induced by S is connected. CDS-based backbones reduce routing overhead but are NP-hard to compute and must balance sparsity, coverage, and connectivity. Here we introduce a quantum approach to solving the CDS problem based on the cyclic quantum annealing algorithm, suitable for current digital quantum computers, which we call Digitized Cyclic Annealing. We explore the dependence of the obtained solutions on the algorithm hyperparameters and show how transfer learning allows us to find their values for large-scale problems. We demonstrate the complete algorithm on a network optimization problem using N = 73 qubits on an IBM Kingston quantum processor.
M. Grandadam, M. Koch-Janusz· International Conference on...· 0 citations