742 research outputs found
Reliable multicast transport by satellite: a hybrid satellite/terrestrial solution with erasure codes
Geostationary satellites are an efficient way to provide a large scale multipoint communication service. In the context of reliable multicast communications, a new hybrid satellite/terrestrial approach is proposed. It aims at reducing the overall communication cost using satellite broadcasting only when enough receivers are present, and terrestrial transmissions otherwise. This approach has been statistically evaluated for a particular cost function and seems interesting. Then since the hybrid approach relies on Forward Error Correction, several practical aspects of MDS codes and LDPC codes are investigated in order to select a code
Scalable and Reliable File Transfer for Clusters Using Multicast.
A cluster is a group of computing resources that are connected by a single computer network and are managed as a single system. Clusters potentially have three key advantages over workstations operated in isolation—fault tolerance, load balancing and support for distributed computing.
Information sharing among the cluster’s resources affects all phases of cluster administration. The thesis describes a new tool for distributing files within clusters. This tool, the Scalable and Reliable File Transfer Tool (SRFTT), uses Forward Error Correction (FEC) and multiple multicast channels to achieve an efficient reliable file transfer, relative to heterogeneous clusters. SRFTT achieves scalability by avoiding feedback from the receivers. Tests show that, for large files, retransmitting recovery information on multiple multicast channels gives significant performance gains when compared to a single retransmission channel
Group size estimation for hybrid satellite/terrestrial reliable multicast
This paper addresses the problem of group size estimation for hybrid satellite/terrestrial multipoint communications. Estimators based on the maximum likelihood principle are investigated. These estimators assume that a Nack suppression mechanism is implemented at transport layer. The performance of these estimators is studied theoretically and via simulations. The integration of an appropriate group size estimator in a transport mechanism is finally considered
On Cloud-based multisource Reliable Multicast Transport in Broadband Multimedia Satellite Networks
Multimedia synchronization, Software Over the Air, Personal Information Management on Cloud networks require new reliable protocols, which reduce the traffic load in the core and edge network. This work shows via simulations the performance of an efficient multicast file delivery, which advantage of the distributed file storage in Cloud computing. The performance evaluation focuses on the case of a personal satellite equipment with error prone channels
Recommended from our members
Improving Reliable Multicast Using Active Parity Encoding Services (APES)
We propose and evaluate novel reliable multicast protocols that combine active repair service (a.k.a. local recovery) and parity encoding (a.k.a. forward error correction or FEC) techniques. We show that, compared to other repair service protocols, our protocols require less buffer inside the network, maintain the low bandwidth requirements of previously proposed repair service / FEC combination protocols, and reduce the amount of FEC processing at repair servers, moving more of this processing to the end-hosts. We also examine repair service / FEC combination protocols in an environment where loss rates differ across domains within the network. We find that repair services are more effective than FEC at reducing bandwidth utilization in such environments. Furthermore, adding FEC to a repair services protocol not only reduces buffer requirements at repair servers, but also reduces bandwidth utilization in domains with high loss, or in domains with large populations of receivers
Memory and Complexity Analysis of On-the-Fly Coding Schemes for Multimedia Multicast Communications
A new class of erasure codes for delay-constraint applications, called on-the-fly coding, have recently been introduced for their improvements in terms of recovery delay and achievable capacity. Despite their promising characteristics, little is known about the complexity of the systematic and non-systematic variants of this code, notably for live multicast transmission of multimedia content which is their ideal use case. Our paper aims to fill this gap and targets specifically the metrics relevant to mobile receivers with limited resources: buffer size requirements and computation complexity of the receiver. As our contribution, we evaluate both code variants on uniform and bursty erasure channels. Results obtained are unequivocal and demonstrate that the systematic codes outperform the nonsystematic ones, in terms of both the buffer occupancy and computation overhead
- …