Article
Computer Science, Information Systems
Marco Chiesa, Andrzej Kamisinski, Jacek Rak, Gabor Retvari, Stefan Schmid
Summary: This survey provides a systematic overview of packet-based fast-recovery mechanisms in the data plane in modern packet-switched communication networks, focusing on concepts and structured around different networking technologies. It examines the evolution of fast-recovery standards and mechanisms over time, identifies fundamental principles and algorithms, and proposes future research directions.
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS
(2021)
Article
Computer Science, Hardware & Architecture
Zaid Hussain, Hosam AboElFotoh, Bader AlBdaiwi
Summary: This paper presents two efficient methods for solving the problem of finding a maximal set of independent spanning trees in Eisenstein-Jacobi networks. It also provides a distributed fault-tolerant routing algorithm based on these constructed trees. The experimental results demonstrate that the proposed method outperforms the state-of-the-art method in broadcasting in terms of node coverage.
JOURNAL OF SUPERCOMPUTING
(2022)
Article
Chemistry, Multidisciplinary
Jozef Papan, Pavel Segec, Michal Kvet
Summary: The advancement of virtualized infrastructures, IoT, and WSN has raised quality requirements for underlay communication networks, leading to the development of the IP FRR technology to address communication interruptions.
APPLIED SCIENCES-BASEL
(2021)
Article
Computer Science, Information Systems
Dun-Wei Cheng, Kai-Hsun Yao, Sun-Yuan Hsieh
Summary: The generalized recursive circulant networking can be widely applied in the design and implementation of interconnection networks, with processors connected through bidirectional, point-to-point communication channels. By applying the concept of shortest path routing to build independent spanning trees, this approach loosens previous research restrictions and extends results to a more general vertex setting using a specific algorithm to address constraint issues.
Article
Computer Science, Information Systems
Anix Anbiah, Krishna M. Sivalingam
Summary: In this paper, a segment-level recovery framework is proposed for protection of each segment of an end-to-end path, which proves to be more efficient than other existing techniques using segment routing for recovery. Simulation results demonstrate that the proposed scheme offers efficient failure recovery in terms of flow drop rates, ability to recover from multiple failures, and required resources for recovery, resulting in lower flow drop rates and path length increase, leading to robust protection and better resource utilization.
COMPUTER COMMUNICATIONS
(2022)
Article
Engineering, Multidisciplinary
Kung-Jui Pai, Jinn-Shyong Yang, Guan-Yu Chen, Jou-Ming Chang
Summary: The existence of multiple completely independent spanning trees (CISTs) in a network has significant applications in fault-tolerant routing and secure message distribution. This paper proposes linear-time algorithms for constructing dual CISTs in dense Gaussian networks (DGNs) and evaluates the performance of protection routing in DGNs using simulation results.
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING
(2022)
Article
Engineering, Electrical & Electronic
Kazuya Suzuki
Summary: This paper introduces the concepts of segment routing and TI-LFA and their application in real networks. To address the high computational cost of determining segment routing sections, an algorithm is proposed that only requires three shortest-path tree calculations to determine the egress node of the segment routing section for all destination nodes.
IEICE TRANSACTIONS ON COMMUNICATIONS
(2022)
Article
Computer Science, Theory & Methods
Baolei Cheng, Dajin Wang, Jianxi Fan
Summary: This survey provides a comprehensive collection of important works on ISTs and offers a historical perspective on the development of ISTs, serving as a useful reference for future research in this field.
ACM COMPUTING SURVEYS
(2023)
Article
Computer Science, Information Systems
Yuya Tarutani, Masashi Ishigai, Naoto Numata, Yukinobu Fukushima, Tokumi Yokohira
Summary: This paper proposes a new routing method using multiple routing tables to decrease the routing cost for network failure recovery and reduce the number of entries in the backup routing table. Experimental results show that this method is superior to the conventional method.
JOURNAL OF INTERNET TECHNOLOGY
(2022)
Article
Chemistry, Multidisciplinary
Tabinda Ashraf, Steven S. W. Lee, Muhammad Iqbal, Jen-Yi Pan
Summary: This paper discusses the potential issues that may arise when using Fibbing to control an IP network, and presents a solution to ensure fast failure recovery and load balancing in the network while applying Fibbing technology.
APPLIED SCIENCES-BASEL
(2021)
Article
Mathematics, Applied
Xia Hong, Wei Feng
Summary: For a graph G, if there exist k spanning trees T-1, T-2, ..., T-k, such that the paths from any two vertices u, v in these k trees are pairwise openly disjoint, then these k trees are completely independent. Hasunuma proved that there are two completely independent spanning trees in any 4-connected maximal planar graph, and the problem of deciding whether there exist two completely independent spanning trees in a given graph G is NP-complete. This paper investigates the number of completely independent spanning trees in some Cartesian product graphs.
Article
Mathematics, Applied
Jinn-Shyong Yang, Xiao-Yan Li, Sheng-Lung Peng, Jou-Ming Chang
Summary: The emerging data center network HSDC is a server-centric DCN that supports various cloud services and applications through the construction of independent spanning trees. This study focuses on establishing the vertex-symmetry of HSDC and modifying the algorithm for constructing ISTs to fit the requirements of HSDC. The algorithm developed can construct n ISTs in O(nN) time or parallelize the process in O(n) time using N processors, resulting in ISTs with a diameter about twice that of Q(n).
APPLIED MATHEMATICS AND COMPUTATION
(2022)
Article
Computer Science, Information Systems
Yi-Cheng Yang, Shih-Shun Kao, Ralf Klasing, Sun-Yuan Hsieh, Hsin-Hung Chou, Jou-Ming Chang
Summary: The concept of independent spanning trees has significant implications in graph theory, studying the applications of multiple spanning trees in networks, such as fault-tolerant transmission and secure message distribution in communication networks. This paper proposes a scheme for constructing independent spanning trees on a burnt pancake network and proves the correctness of the algorithm.
Article
Computer Science, Hardware & Architecture
Fu-Hsing Wang, Shuo- Wang
Summary: This paper proposes two linear time algorithms to solve the ISTs rooted at an arbitrary vertex for WK-recursive networks and WK-recursive pyramids separately. The performance of the algorithms is evaluated through analytical and experimental analysis of tree heights and average distances.
JOURNAL OF SUPERCOMPUTING
(2022)
Article
Computer Science, Theory & Methods
Guo Chen, Baolei Cheng, Dajin Wang
Summary: This article discusses the importance and applications of constructing Completely Independent Spanning Trees (CISTs) in a network, especially in data center networks. It also introduces the augmented cube AQn as the underlying structure of a data center network and studies how to construct n-1 optimal CISTs in its logic graph L-AQDNn. Additionally, the relationship between the dimension of a hypercube-family network and the number of CISTs it can host is established for the first time.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
(2021)