Reliable Multicast in Heterogeneous Mobile Ad-hoc Networks

In disaster scenarios, communication infrastructure could be damaged orcompletely failed. Mobile Ad-hoc Networks (MANETs) can be used to substitutefailed communication devices and thus to enable communication. As group communicationis an important part in disaster scenarios, multicast will be used to addressseveral nodes. In this paper, we propose our new reliable multicast protocol RMDA(Reliable Multicast over Delay Tolerant Mobile Ad hoc Networks). We introducean efficient group management approach and a new method for reliable multicastdelivery over Delay Tolerant Networks. We show, that our protocol is adaptive todifferent kinds of MANETs, e.g. with or without clusterheads, respectively. Forthose without, we use our name resolution over adaptive routing approach

Performance evaluation and optimization of reliable multicast

Many multicast applications require reliable delivery of data packets to multiple receivers. Scalability is one of the key challenges in the design of reliable multicast. The major obstacles of the scalability are feedback implosion and retransmissions. Furthermore, a real network changes with time. A reliable multicast protocol must adapt to such dynamic change of multicast sessions. Thus, it is necessary to design an efficient and adaptive loss recovery scheme for reliable multicast. In this thesis, we present an efficient and adaptive loss recovery scheme, which is based on the performance evaluation of reliable multicast. The multicast performance depends on the loss recovery mechanism, the underlying tree topology, the loss characteristics, and the locations of repair servers. We present an efficient performance evaluation of these basic performance parameters, which is useful for adequate determination of the locations of repair server

Network Coding Channel Virtualization Schemes for Satellite Multicast Communications

In this paper, we propose two novel schemes to solve the problem of finding a quasi-optimal number of coded packets to multicast to a set of independent wireless receivers suffering different channel conditions. In particular, we propose two network channel virtualization schemes that allow for representing the set of intended receivers in a multicast group to be virtualized as one receiver. Such approach allows for a transmission scheme not only adapted to per-receiver channel variation over time, but to the network-virtualized channel representing all receivers in the multicast group. The first scheme capitalizes on a maximum erasure criterion introduced via the creation of a virtual worst per receiver per slot reference channel of the network. The second scheme capitalizes on a maximum completion time criterion by the use of the worst performing receiver channel as a virtual reference to the network. We apply such schemes to a GEO satellite scenario. We demonstrate the benefits of the proposed schemes comparing them to a per-receiver point-to-point adaptive strategy

Random Linear Network Coding for 5G Mobile Video Delivery

An exponential increase in mobile video delivery will continue with the demand for higher resolution, multi-view and large-scale multicast video services. Novel fifth generation (5G) 3GPP New Radio (NR) standard will bring a number of new opportunities for optimizing video delivery across both 5G core and radio access networks. One of the promising approaches for video quality adaptation, throughput enhancement and erasure protection is the use of packet-level random linear network coding (RLNC). In this review paper, we discuss the integration of RLNC into the 5G NR standard, building upon the ideas and opportunities identified in 4G LTE. We explicitly identify and discuss in detail novel 5G NR features that provide support for RLNC-based video delivery in 5G, thus pointing out to the promising avenues for future research.Comment: Invited paper for Special Issue "Network and Rateless Coding for Video Streaming" - MDPI Informatio

Experimental Evaluation of Large Scale WiFi Multicast Rate Control

WiFi multicast to very large groups has gained attention as a solution for multimedia delivery in crowded areas. Yet, most recently proposed schemes do not provide performance guarantees and none have been tested at scale. To address the issue of providing high multicast throughput with performance guarantees, we present the design and experimental evaluation of the Multicast Dynamic Rate Adaptation (MuDRA) algorithm. MuDRA balances fast adaptation to channel conditions and stability, which is essential for multimedia applications. MuDRA relies on feedback from some nodes collected via a light-weight protocol and dynamically adjusts the rate adaptation response time. Our experimental evaluation of MuDRA on the ORBIT testbed with over 150 nodes shows that MuDRA outperforms other schemes and supports high throughput multicast flows to hundreds of receivers while meeting quality requirements. MuDRA can support multiple high quality video streams, where 90% of the nodes report excellent or very good video quality

The STRESS Method for Boundary-point Performance Analysis of End-to-end Multicast Timer-Suppression Mechanisms

Evaluation of Internet protocols usually uses random scenarios or scenarios based on designers' intuition. Such approach may be useful for average-case analysis but does not cover boundary-point (worst or best-case) scenarios. To synthesize boundary-point scenarios a more systematic approach is needed.In this paper, we present a method for automatic synthesis of worst and best case scenarios for protocol boundary-point evaluation. Our method uses a fault-oriented test generation (FOTG) algorithm for searching the protocol and system state space to synthesize these scenarios. The algorithm is based on a global finite state machine (FSM) model. We extend the algorithm with timing semantics to handle end-to-end delays and address performance criteria. We introduce the notion of a virtual LAN to represent delays of the underlying multicast distribution tree. The algorithms used in our method utilize implicit backward search using branch and bound techniques and start from given target events. This aims to reduce the search complexity drastically. As a case study, we use our method to evaluate variants of the timer suppression mechanism, used in various multicast protocols, with respect to two performance criteria: overhead of response messages and response time. Simulation results for reliable multicast protocols show that our method provides a scalable way for synthesizing worst-case scenarios automatically. Results obtained using stress scenarios differ dramatically from those obtained through average-case analyses. We hope for our method to serve as a model for applying systematic scenario generation to other multicast protocols.Comment: 24 pages, 10 figures, IEEE/ACM Transactions on Networking (ToN) [To appear

An autonomic delivery framework for HTTP adaptive streaming in multicast-enabled multimedia access networks

The consumption of multimedia services over HTTP-based delivery mechanisms has recently gained popularity due to their increased flexibility and reliability. Traditional broadcast TV channels are now offered over the Internet, in order to support Live TV for a broad range of consumer devices. Moreover, service providers can greatly benefit from offering external live content (e. g., YouTube, Hulu) in a managed way. Recently, HTTP Adaptive Streaming (HAS) techniques have been proposed in which video clients dynamically adapt their requested video quality level based on the current network and device state. Unlike linear TV, traditional HTTP- and HAS-based video streaming services depend on unicast sessions, leading to a network traffic load proportional to the number of multimedia consumers. In this paper we propose a novel HAS-based video delivery architecture, which features intelligent multicasting and caching in order to decrease the required bandwidth considerably in a Live TV scenario. Furthermore we discuss the autonomic selection of multicasted content to support Video on Demand (VoD) sessions. Experiments were conducted on a large scale and realistic emulation environment and compared with a traditional HAS-based media delivery setup using only unicast connections

Notes on the use of RTP for shared workspace applications

The Real-time Transport Protocol, RTP, has become the dominant protocol for streaming audio and video in IP-based environments. A number of proposals have been made which attempt to build on this success and apply RTP for shared workspace applications. We discuss the needs of such applications and the features provided by RTP, with an aim to showing why RTP is not appropriate for such uses

Evaluation of error control mechanisms for 802.11b multicast transmissions

This article first presents several packet loss profiles collected during 802.11b multicast transmissions carried out under variable reception conditions (mobile and fixed receivers). Then, an original approach consisting in mapping a posteriori some error control mechanisms over these observations is presented. This approach allows to evaluate the performance of these mechanisms according to their parameters and various channel properties. It is shown in particular that relatively simple mechanisms based on retransmissions and/or error correcting codes of small length achieve very good performance in this context (92% of the best performance)