In general, many protocols with congestion control utilize acknowledgement packets for the notification of network status. In the case of the communication between a source node and a destination node, data packets and acknowledgement packets share the same path. This can cause packet collisions. AODV is one of the most popular routing protocols of this type for Mobile ad hoc networks. In this ...

There have been several approaches to the problem of provisioning traffic engineering between core network nodes in Internet Service Provider (ISP) networks. Such approaches aim to minimize network delay, increase capacity, and enhance security services between two core (relay) network nodes, an ingress node and an egress node. MATE (Multipath Adaptive Traffic Engineering) has been proposed for...

In the maximum simple sharing problem (MSS), we want to compute a set of node-disjoint simple paths in an undirected bipartite graph covering as many nodes as possible of one layer of the graph, with the constraint that all paths have both endpoints in the other layer. This is a variation of the maximum sharing problem (MS) that finds important applications in the design of molecular quantum-do...

With the development of Ad Hoc networks, the demand of QoS becomes more and more than ever before, it is more important to provide QoS guarantee for multimedia application. Most of present QoS routing algorithm based on single path, which do not take full advantage of resource of networks. This paper proposes a QoS-based multipath routing protocol for Ad Hoc network. Routing mechanism is descri...

Single path routing protocols in WSN may lead to holes in the network, as only the nodes present in the single path are utilized for data transmission. Therefore, multipath routing protocols are recommended for WSN. Multipath routing protocols increases the network lifetime by distributing the traffic among multiple paths. Node disjoint multiple paths are selected for data transmission to sprea...

This paper compares the performance of on-demand Directional Node-Disjoint Multipath Routing (DNDMR) protocol with those of contemporary wireless ad hoc network routing protocols. DNDMR protocol especially performs well for grid-style network topology. Multipath routing inherently allows the establishment of multiple routes between source and destination. The important features of DNDMR are pat...

We study the expressive power of some fragments of XPath equipped with (in)equality tests over data trees. Our main results are the definability theorems, which give necessary and sufficient conditions under which a class of data trees can be defined by a node expression or set of node expressions, and our separation theorems, which give sufficient conditions under which two disjoint classes of...

Disjoint Paths is the problem of finding paths between given pairs of terminals in a graph such that no vertices are shared between paths. We analyze fixed-parameter tractability of several new Disjoint Paths-like routing problems motivated by congestion control in computer networks. In one model we are interested in finding paths between k pairs of terminals such that the first edge of each pa...

A clique of a graph G is a set of pairwise adjacent nodes of G. Similarly, a biclique(U, V ) of a bipartite graph G is a pair of disjoint, independent vertex sets such that eachnode in U is adjacent to every node in V in G. We consider the problems of identifyingthe maximum clique of a graph, known as the maximum clique problem, and identifyingthe biclique (U, V ) of a bipartite...

Data communication and fault tolerance are important issues in multiprocessor systems. One way to achieve fault tolerant communication is by exploiting and e ectively utilizing the disjoint paths that exist between pairs of source, destination nodes. In this paper we construct a structure, called the multiple edgedisjoint spanning trees, on the star network, denoted by Sn. This is used for the ...