In this paper, we study a combination of the multicast communication problem and the maximum disjoint paths problem. Specifically, we are given a directed tree T rooted at r, and we want to send a message from r to a subset of nodes in T. We accomplish this via a multicast schedule which consists of a number of time steps in which informed nodes deliver the message to uninformed nodes until all...

In this paper, we analyze the packet delivery reliability of ad hoc routing protocols for lossand-delay sensitive applications. Since a typical flooding-based route discovery used in ad hoc routing protocols – DSR for instance – can only discover node-disjoint paths. In this context, we first show that the reliability function of such a multipath system is concave with respect to the total numb...

Support for real time multimedia applications such as, video telephony, financial stock quote services, and multiplayer interactive games etc., is very essential in Mobile Ad hoc Networks (MANETs). Such applications require multiple Quality of Service (QoS) parameters to be satisfied, like bandwidth, end-toend delay, packet loss rate, jitter, etc. This paper considers the problem of finding nod...

In this paper we consider a multipath extension to the dynamic source routing (DSR) protocol proposed by Johnson and Maltz, an on-demand routing protocol for ad hoc wireless networks. This extension keeps two node disjoint paths between the source and the destination of a routing process without introducing extra overhead. Several optimization options are also considered. Simulation is conducte...

For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n − 1 internally disjoint paths connecting the nodes in the time complexity of polynomial order of n. The length of each path obtained and the time complexity of the algorithm are estimated theoretically and verified by computer simulation. key words: pancake graphs, node-to-node disjoint paths proble...

Chudnovsky et al. gave a min-max formula for the maximum number of node-disjoint non-zero A-paths in group-labeled graphs [1], which is a generalization of Mader’s theorem on node-disjoint A-paths [3]. Here we present a further generalization with a shorter proof. The main feature of Theorem 2.1 is that parity is “hidden” inside ν̂, which is given by an oracle for non-bipartite matching.

The concept of strong fault-tolerance was introduced to characterize the property of parallel routing [15]. A network G of degree d is said strongly fault-tolerant if with at most d 2 faulty nodes, any two nodes u and v in G are connected by minfdegf (u); degf (v)g node-disjoint paths, where degf (u) and degf (v) are the numbers of non-faulty neighbors of the nodes u and v in G, respectively. W...

In this paper we present a distributed routing protocol for finding two node-disjoint paths between each pair of nodes in a computer network. In the proposed protocol, each node in the network has the same procedure, which is driven by local information with respect to the network topology, such as adjacent nodes on a spanning tree in the network. Thus, the execution of the protocol can continu...