12,195 research outputs found
Fault-Tolerant Real-Time Streaming with FEC thanks to Capillary Multi-Path Routing
Erasure resilient FEC codes in off-line packetized streaming rely on time
diversity. This requires unrestricted buffering time at the receiver. In
real-time streaming the playback buffering time must be very short. Path
diversity is an orthogonal strategy. However, the large number of long paths
increases the number of underlying links and consecutively the overall link
failure rate. This may increase the overall requirement in redundant FEC
packets for combating the link failures. We introduce the Redundancy Overall
Requirement (ROR) metric, a routing coefficient specifying the total number of
FEC packets required for compensation of all underlying link failures. We
present a capillary routing algorithm for constructing layer by layer steadily
diversifying multi-path routing patterns. By measuring the ROR coefficients of
a dozen of routing layers on hundreds of network samples, we show that the
number of required FEC packets decreases substantially when the path diversity
is increased by the capillary routing construction algorithm
Online multipath convolutional coding for real-time transmission
Most of multipath multimedia streaming proposals use Forward Error Correction
(FEC) approach to protect from packet losses. However, FEC does not sustain
well burst of losses even when packets from a given FEC block are spread over
multiple paths. In this article, we propose an online multipath convolutional
coding for real-time multipath streaming based on an on-the-fly coding scheme
called Tetrys. We evaluate the benefits brought out by this coding scheme
inside an existing FEC multipath load splitting proposal known as Encoded
Multipath Streaming (EMS). We demonstrate that Tetrys consistently outperforms
FEC in both uniform and burst losses with EMS scheme. We also propose a
modification of the standard EMS algorithm that greatly improves the
performance in terms of packet recovery. Finally, we analyze different
spreading policies of the Tetrys redundancy traffic between available paths and
observe that the longer propagation delay path should be preferably used to
carry repair packets.Comment: Online multipath convolutional coding for real-time transmission
(2012
Bandwidth efficient multi-station wireless streaming based on complete complementary sequences
Data streaming from multiple base stations to a client is recognized as a robust technique for multimedia streaming. However the resulting transmission in parallel over wireless channels poses serious challenges, especially multiple access interference, multipath fading, noise effects and synchronization. Spread spectrum techniques seem the obvious choice to mitigate these effects, but at the cost of increased bandwidth requirements. This paper proposes a solution that exploits complete complementary spectrum spreading and data compression techniques jointly to resolve the communication challenges whilst ensuring efficient use of spectrum and acceptable bit error rate. Our proposed spreading scheme reduces the required transmission bandwidth by exploiting correlation among information present at multiple base stations. Results obtained show 1.75 Mchip/sec (or 25%) reduction in transmission rate, with only up to 6 dB loss in frequency-selective channel compared to a straightforward solution based solely on complete complementary spectrum spreading
Multi-View Video Packet Scheduling
In multiview applications, multiple cameras acquire the same scene from
different viewpoints and generally produce correlated video streams. This
results in large amounts of highly redundant data. In order to save resources,
it is critical to handle properly this correlation during encoding and
transmission of the multiview data. In this work, we propose a
correlation-aware packet scheduling algorithm for multi-camera networks, where
information from all cameras are transmitted over a bottleneck channel to
clients that reconstruct the multiview images. The scheduling algorithm relies
on a new rate-distortion model that captures the importance of each view in the
scene reconstruction. We propose a problem formulation for the optimization of
the packet scheduling policies, which adapt to variations in the scene content.
Then, we design a low complexity scheduling algorithm based on a trellis search
that selects the subset of candidate packets to be transmitted towards
effective multiview reconstruction at clients. Extensive simulation results
confirm the gain of our scheduling algorithm when inter-source correlation
information is used in the scheduler, compared to scheduling policies with no
information about the correlation or non-adaptive scheduling policies. We
finally show that increasing the optimization horizon in the packet scheduling
algorithm improves the transmission performance, especially in scenarios where
the level of correlation rapidly varies with time
On the Limit of Fountain MDC Codes for Video Peer-To-Peer Networks
Video streaming for heterogeneous types of devices, where nodes have different devices characteristics in terms of computational capacity and display, is usually handled by encoding the video with different qualities. This is not well suited for Peer-To-Peer (P2P) systems, as a single peer group can only share content of the same quality, thus limiting the peer group size and efficiency. To address this problem, several existing works propose the use of Multiple Descriptions Coding (MDC). The concept of this type of video codec is to split a video in a number of descriptions which can be used on their own, or aggregated to improve the global quality of the video. Unfortunately existing MDC codes are not flexible, as the video is split in a defined number of descriptions. In this paper, we focus on the practical feasibility of using a Fountain MDC code with properties similar to existing Fountain erasure codes, including the ability to create any number of descriptions when needed (on the fly). We perform simulations using selected pictures to assess the feasibility of using these codes, knowing that they should improve the availability of the video pieces in a P2P system and hence the video streaming quality. We observe that, although this idea seems promising, the evaluated benefits, demonstrated by the PSNR values, are limited when used in a real P2P video streaming system
Wireless Video Transmission with Over-the-Air Packet Mixing
In this paper, we propose a system for wireless video transmission with a
wireless physical layer (PHY) that supports cooperative forwarding of
interfered/superimposed packets. Our system model considers multiple and
independent unicast transmissions between network nodes while a number of them
serve as relays of the interfered/superimposed signals. For this new PHY the
average transmission rate that each node can achieve is estimated first. Next,
we formulate a utility optimization framework for the video transmission
problem and we show that it can be simplified due to the features of the new
PHY. Simulation results reveal the system operating regions for which
superimposing wireless packets is a better choice than a typical cooperative
PHY.Comment: 2012 Packet Video Worksho
- âŠ