We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the sets. It is shown that disjoint ordering is useful for network routing. More precisely, we show that Hall’s ‘marriage’ condition for a collection of finite sets guarantees the existence of a disjoint ordering for the set...

Recently, quality-of-service routing in dynamic, wireless multi-hop ad hoc networks becomes a hot research topic, and various QoS protocols are proposed Even so, popular QoS routing protocols rarely provide multiple routes. Once links break due to node mobility, establishment of new routes leads to large control overhead and more end-to-end delay. In MANETs to support multimedia applications su...

Ad hoc networks are multi-hop wireless networks without a pre-installed infrastructure. Such networks are widely used in military applications and in emergency situations as they permit the establishment of a communication network at very short notice with a very low cost. Video is very sensitive for packet loss and wireless ad-hoc networks are error prone due to node mobility and weak links. H...

We present an algorithm which given a source node and a set of n− 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n − 1 node-disjoint paths, one from each target node to the source. The collection of paths output from the algorithm is such that each path has length at most 6k − 7, and the algorithm has time complexity O(k2n2). keywords: interco...

Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath routing (DMPR) requires the multiple paths to be linkor node-disjoint. Both MPR and DMPR poses significant challenges in terms of obtaining loop-free multiple (disjoint) paths and effectively forwarding the data over the ...