In this paper we analyze the jitter experienced by a node that receives data streamed over a peer-to-peer network that employs network coding procedures. In the considered scheme, a node can reconstruct a content packet as soon as it receives the first fastest K packets of a set of N > K packets. We propose a model of the overall delay experienced by the user based on Order Statistics theory. The analytical results are validated by means of simulations and transmission experiments over the Internet. The reported results show that the jitter observed by the node decreases as the square root of the invers of N, when ratio N/K remains constant.
Peer-to-peer streaming based on network coding decreases packet jitter
Riccardo Bernardini
2010-01-01
Abstract
In this paper we analyze the jitter experienced by a node that receives data streamed over a peer-to-peer network that employs network coding procedures. In the considered scheme, a node can reconstruct a content packet as soon as it receives the first fastest K packets of a set of N > K packets. We propose a model of the overall delay experienced by the user based on Order Statistics theory. The analytical results are validated by means of simulations and transmission experiments over the Internet. The reported results show that the jitter observed by the node decreases as the square root of the invers of N, when ratio N/K remains constant.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
