Data-Aware Multicast

This paper presents a multicast algorithm for peer-to-peer dissemination of events in a distributed topic-based publish-subscribe system, where processes publish events of certain topics, organized in a hierarchy, and expect events of topics they subscribed to. Our algorithm is ``data-aware'' in the sense that it exploits information about process subscriptions and topic inclusion relationships to build dynamic groups of processes and efficiently manage the flow of information within and between these process groups. This ``data-awareness'' helps limit the membership information that each process needs to maintain and preserves processes from receiving messages related to topics they have not subscribed to. It also provides the application with means to control, for each topic in a hierarchy, the trade-off between the message complexity and the reliability of event dissemination. We convey this trade-off through both analysis and simulation

Optimizing Network Coding Algorithms for Multiple Applications.

Deviating from the archaic communication approach of treating information as a fluid moving through pipes, the concepts of Network Coding (NC) suggest that optimal throughput of a multicast network can be achieved by processing information at individual network nodes. However, existing challenges to harness the advantages of NC concepts for practical applications have prevented the development of NC into an effective solution to increase the performance of practical communication networks. In response, the research work presented in this thesis proposes cross-layer NC solutions to increase the network throughput of data multicast as well as video quality of video multicast applications. First, three algorithms are presented to improve the throughput of NC enabled networks by minimizing the NC coefficient vector overhead, optimizing the NC redundancy allocation and improving the robustness of NC against bursty packet losses. Considering the fact that majority of network traffic occupies video, rest of the proposed NC algorithms are content-aware and are optimized for both data and video multicast applications. A set of content and network-aware optimization algorithms, which allocate redundancies for NC considering content properties as well as the network status, are proposed to efficiently multicast data and video across content delivery networks. Furthermore content and channel-aware joint channel and network coding algorithms are proposed to efficiently multicast data and video across wireless networks. Finally, the possibilities of performing joint source and network coding are explored to increase the robustness of high volume video multicast applications. Extensive simulation studies indicate significant improvements with the proposed algorithms to increase the network throughput and video quality over related state-of-the-art solutions. Hence, it is envisaged that the proposed algorithms will contribute to the advancement of data and video multicast protocols in the future communication networks

Policy aware QoS inter-domain multicast

Future Internet applications are expected to have higher QoS requirements. Therefore, routing protocols must be adapted to find a path which satisfies such requirements. Most multicast applications are QoS sensitive in nature, because they involve the transmission of real-time multimedia data streams. There are several research projects aiming to extend existing multicast routing protocols with QoS capabilities, or even proposing new QoS aware ones. However key requirements for inter-domain routing like scalability, intra-domain independence, and policy awareness are missing in most of existing multicast routing protocols. In this paper, it is proposed an inter-domain multicast routing strategy that builds inter-domain unidirectional multicast distribution trees, taking into account multicast specific routing policies, and supporting QoS requirements

A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

Speeding up Future Video Distribution via Channel-Aware Caching-Aided Coded Multicast

Future Internet usage will be dominated by the consumption of a rich variety of online multimedia services accessed from an exponentially growing number of multimedia capable mobile devices. As such, future Internet designs will be challenged to provide solutions that can deliver bandwidth-intensive, delay-sensitive, on-demand video-based services over increasingly crowded, bandwidth-limited wireless access networks. One of the main reasons for the bandwidth stress facing wireless network operators is the difficulty to exploit the multicast nature of the wireless medium when wireless users or access points rarely experience the same channel conditions or access the same content at the same time. In this paper, we present and analyze a novel wireless video delivery paradigm based on the combined use of channel-aware caching and coded multicasting that allows simultaneously serving multiple cache-enabled receivers that may be requesting different content and experiencing different channel conditions. To this end, we reformulate the caching-aided coded multicast problem as a joint source-channel coding problem and design an achievable scheme that preserves the cache-enabled multiplicative throughput gains of the error-free scenario,by guaranteeing per-receiver rates unaffected by the presence of receivers with worse channel conditions.Comment: 11 pages,6 figures,to appear in IEEE JSAC Special Issue on Video Distribution over Future Interne

Multicast Mobility in Mobile IP Version 6 (MIPv6) : Problem Statement and Brief Survey

Publisher PD