We present a method to compute the delay-constrained multicast routing tree by employing chaotic neural networks. The experimental result shows that the noisy chaotic neural network (NCNN) provides an optimal solution more often compared to the transiently chaotic neural network (TCNN) and the Hopfield neural network (HNN). Furthermore, compared with the bounded shortest multicast algorithm (BSMA), the NCNN is able to find multicast trees with lower cost. ....etc

[:=Read Full Message Here=:]

Abstract
The present network-layer multicast routing protocols build multicast trees based only on hop count and policy. If a tree cannot meet application require- ments, the receivers have no alternative. A general and modular architecture that integrates alternate path routing with the network multicast services is proposed. This enables individual multicast receivers to reroute a multicast tree according to their needs, subject to policy restrictions. Many Internet multicast applications such as teleconferencing and remote diagnosis have Q ....etc

[:=Read Full Message Here=:]

Optimal State Allocation for Multicast Communications with Explicit Multicast Forwarding- IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 19, NO. 4, - Java

Abstract—
In this paper, we propose a scalable and adaptive multicast forwarding mechanism based on Explicit Multicast (Xcast). This mechanism optimizes the allocation of forwarding states in routers and can be used to improve the scalability of traditional IP multicast and Source-Specific Multicast. Compared with previous work, our mechanism needs fewer routers in ....etc

[:=Read Full Message Here=:]

HIERARCHICAL MULTICAST ROUTING PROTOCOL BASED ON Q0S ....etc

[:=Read Full Message Here=:]

Multicast Routing with Delay and Delay Variation Constraints for Collaborative Applications on Overlay Networks

Maximum variation in the delays from a source to the destinations. The time-complexity of our Algorithm is O (|E| +nk log (|E|/n) +m2 k), where n and |E| are the number of nodes and edges in the network, respectively, k is the Number of shortest paths determined, and Abstract”Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispers ....etc

[:=Read Full Message Here=:]

In the age of multimedia and high-speed networks, multicast is one of the mechanisms by which the power of the Internet can be further harnessed in an efficient manner. It has been increasingly used by various continuous media applications such as teleconferencing, distance learning, and voice & video transmission. Compared with unicast and broadcast, multicast can save network bandwidth and make transmission more efficient. In this seminars, we will review the history of the multicast, present you several existing multicast routing algorithms ....etc

[:=Read Full Message Here=:]

In the age of multimedia and high-speed networks, multicast is one of the mechanisms by which the power of the Internet can be further harnessed in an efficient manner. It has been increasingly used by various continuous media applications such as teleconferencing, distance learning, and voice & video transmission. Compared with unicast and broadcast, multicast can save network bandwidth and make transmission more efficient. In this seminars, we will review the history of the multicast, present you several existing multicast routing algorithms ....etc

[:=Read Full Message Here=:]

full report ....etc

[:=Read Full Message Here=:]

Incremental deployment service of Hop by hop multicast routing protocol
Abstract: IP multicast is facing a slow take-off although it has been a hotly debated topic for more than a decade. Many reasons are responsible for this status. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment of the multicast service by supporting unicast clouds. This paper presents HBH (hop-by-hop multicast routing protocol). HBH adop ....etc

[:=Read Full Message Here=:]

Selective Encryption of Still Image
Abstract: In some applications, it is relevant to hide the content of a message when it enters an insecure channel. The accepted view among professional cryptographers is that the encryption algorithm should be published, whereas the key must be kept secret. In the field of image cryptography, the focus has been put on steganography and in particular on watermarking during the last years. Watermarking, as opposed to steganography has the additional requirement of robustness against possible image transform ....etc

[:=Read Full Message Here=:]