Many Internet multicast applications such as videoconferencing, distance education, and
online simulation require to send information from a source to some selected destinations …

QoS multicast routing is a non-linear combinatorial optimization problem. It tries to find a
multicast routing tree with minimal cost that can satisfy constraints such as bandwidth, delay …

Multicast routing protocols need a new path discovery algorithm for a newly joining node
(receiver) in an ad hoc network. One issue of the approach to find the nearest forwarding …

Many popular applications of wireless mesh networks (WMNs) depend on delay-constraint
multicast communication. To support such multicast communication, this paper proposes a …

Purpose The purpose of this paper is to apply security policies over the mobile ad hoc
networks. A mobile ad hoc network refers to infrastructure-less, persistently self-designing …

In this paper, we study the problem of QoS group communication in a heterogeneous
network, which consists of multiple MANETs attached to the backbone Internet. We propose …

Steiner tree problem and its derivations are widely employed to optimize the design of
transportation, communication networks, biological engineering and the QoS multicast …

Finding a near-optimal routing solution for multicast requests is a challenge for supporting
different multicast applications including video and group communications over wireless ad …

The QoS multicast routing problem is to find a multicast routing tree with minimal cost that
can satisfy constraints such as bandwidth, delay, delay jitter and loss rate. This problem is …

Designing a backbone IP network, especially to support both unicast and multicast traffic
under delay constraints, is a difficult problem. Real network design must consider cost …