The k-ary n-cube, Qnk, is one of the most popular interconnection networks. Let n≥ 2 and
k≥ 3. It is known that Qnk is a nonbipartite (resp. bipartite) graph when k is odd (resp. even) …

A k*-container of a graph G is a set of k disjoint paths between any pair of nodes whose
union covers all nodes of G. The spanning connectivity of G, κ*(G), is the largest k, such that …

The WK-recursive network has received much attention due to its many favorable properties
such as small diameter, large connectivity, and high degree of scalability and expandability …

In wireless sensor networks, routing messages through multiple (node) disjoint paths
between two sensor nodes is a promising way to increase robustness, throughput, and load …

The door management system (DMS) is a safety-critical system in an aircraft which checks if
all doors are properly closed and the cabin has the correct pressure. As for every safety …

In the KD-geodiverse shortest paths problem we intend to determine K paths with the
minimum total cost between two nodes of a network, such that the distance between the …

A shared risk link group (SRLG) is a set of links which share a common risk of failure.
Routing protocols in Generalized MultiProtocol Label Switching, using distributed SRLG …

In massive parallel and distributed systems, high fault-tolerance and reliability are extremely
important for interconnection networks. Node-disjoint paths play a key role in improving the …

This paper proposes a novel mechanism to discover delay-optimal diverse paths using
distributed learning automata for Voice-over-IP (VoIP) routing in service overlay networks. In …

This thesis considers optimization methods for two NP-hard combinatorial optimization
problems suitable to model the extension of real world communication networks. Nowadays …