This paper proposes an eflcient distributed multicast routing algorithm that provides quality of service (QoS) guarantees for real-time applications. It focuses on the delay-constrained minimum cost tree (or constrained Steiner tree) problem; that is, it constructs a multicast tree that not only meets the constrained end-to-end delay requirements but also is the minimum cost multicast tree. Thi...

Collective communication in high-performance computing is traditionally implemented as a sequence of point-to-point communication operations. For example, in MPI a broadcast is often implemented using a linear or binomial tree algorithm. These algorithms are inherently unaware of any underlying network heterogeneity. Integrating topology awareness into the algorithms is the traditional way to a...

We propose new antichain-based algorithms for checking universality and inclusion of nondeterministic tree automata. We have implemented these algorithms in a prototype tool and we present experiments which show that the algorithms provide a significant improvement over the traditional determinisationbased approaches. Furthermore, we use the proposed antichain-based inclusion checking algorithm...

Intrusion Detection is an efficient way of detecting the abnormal behavior of packets in the network, Although in data mining there are various effective decision tree based algorithms are implemented for the classification and detection of Intrusions in KDDCup99 Dataset. Here an efficient technique is implemented for the classification and detection of Intrusions in KDDCup99 Dataset using Feat...