2026· IEEE Transactions on Networking· Vol 34, pp. 6156-6169· 0 citations· 33 references
Computer Science
Abstract
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.
With the surge in bandwidth demand, optical cross-connects (OXCs) face scalability issues. The flexible-grid OXC-Clos network composed of small-scale OXC modules offers a scalable solution. However, strictly nonblocking (SNB) and wide-sense nonblocking (WSNB) designs suffer from high costs. To remarkably reduce the network cost, this paper explores rearrangeable route assignment for flexible-grid OXC-Clos networks without wavelength converters (WCs). We generalize the bipartite graph model for classical Clos networks and propose an extended bipartite graph model, which constructs a distinct bipartite graph for each frequency slot (fSlot), to capture the feature that a lightpath (LP) may encounter distinct conflicts in successive fSlots it uses. The extended model maps the LPs occupying multiple fSlots to different bipartite graphs, rendering the coloring of different graphs mutually coupled. We propose a recursive coloring process to resolve this coupling and properly color the graphs, thereby realizing routing assignment and network reconfiguration. Based on this process, we derive the rearrangeably nonblocking (RNB) condition, which is independent of the number of LP granularity types, delivering much lower costs than that of WSNB networks. For further cost reduction, we explore blocking flexible-grid OXC-Clos networks where a very low blocking probability is permitted. We first reveal a blocking property via simulation and then devise a recursive first-fit (FF) routing strategy by analyzing blocking scenarios. Leveraging this property and the recursive FF strategy, we demonstrate that blocking networks achieve a substantial cost reduction (up to 38.2%) relative to RNB networks.
Qi-Xiang Lai, Tong Ye, Yi-Bei Yao et al.· IEEE Transactions on Network...· 0 citations
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.
Ricardo Santos, J. L. Sobrinho· Conference on Applications,...· 0 citations
The results support HON as a simple low-degree construction for structured inter-group communication, whereas higher-radix, adaptive, or more richly connected fabrics remain better suited to less structured traffic and larger bandwidth demand.
Han Ni Soe, Yao Zhang, Zhipeng Xu· Parallel Processing Letters· 0 citations
ESMP, a multi-graph-based heuristic framework for efficient and stable multicast construction over heterogeneous parallel communication links, is presented and it is shown that an aggregate-edge-delay-constrained decision variant of the formulation is NP-hard.
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.
A two-stage framework that combines graph-theoretic optimization with empirical device-level measurements to inform sustainable campus network design is developed and indicates that device-specific characteristics play a crucial role in determining actual energy efficiency.
Irmak Uzun Bayar, Ceyda Ceylan· Ankara Hacı Bayram Veli Üniv...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
