On time diversity for packet channels

Packet losses and delays represent two of the main causes of impairment on packet-based communications. Recent proposals for robust and efficient transmission suggest joint design of coding and routing strategies. This paper introduces a general framework to analyze time diversity in packet-based communications. An algorithm for designing an efficient distribution of information in multiple packets that takes into account for both losses and delays is presented. Simulation results show in which cases time diversity may have a positive impact on various applications.

[1]  Pierluigi Salvo Rossi,et al.  INTERLEAVING FOR PACKET CHANNELS , 2004 .

[2]  C. Bovy,et al.  Analysis of end-to-end delay measurements in the Internet , 2002 .

[3]  Vivek K. Goyal,et al.  Generalized multiple description coding with correlating transforms , 2001, IEEE Trans. Inf. Theory.

[4]  Avideh Zakhor,et al.  Error control for video multicast using hierarchical FEC , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[5]  Avideh Zakhor,et al.  Path diversity with forward error correction (PDF) system for packet switched networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Muriel Médard,et al.  A throughput-delay trade-off in packetized systems with erasures , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[7]  J. LiangY.,et al.  Analysis of Packet Loss for Compressed Video , 2008 .

[8]  Francesco Palmieri,et al.  Joint end-to-end loss-delay hidden Markov model for periodic UDP traffic over the Internet , 2006, IEEE Transactions on Signal Processing.

[9]  B. Goode,et al.  Voice over Internet protocol (VoIP) , 2002, Proc. IEEE.

[10]  B. Girod,et al.  Model-based delay-distortion optimization for video streaming using packet interleaving , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[11]  Francesco Palmieri,et al.  Multiple description image coder using correlating transforms , 2004, 2004 12th European Signal Processing Conference.

[12]  E. Gilbert.  Capacity of a burst-noise channel , 1960 .

[13]  G. Iannello,et al.  Packet interleaving over lossy channels , 2004, Proceedings of the Fourth IEEE International Symposium on Signal Processing and Information Technology, 2004..

[14]  Francesco Palmieri,et al.  Optimal correlating transform for erasure channels , 2005, IEEE Signal Processing Letters.

[15]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[16]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[17]  R.A. Berry,et al.  Cross-layer wireless resource allocation , 2004, IEEE Signal Processing Magazine.

[18]  Bernd Girod,et al.  Analysis of packet loss for compressed video: does burst-length matter? , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[19]  Edmund M. Yeh,et al.  Optimal Capacity Allocation, Routing, and Congestion Control in Wireless Networks , 2006, 2006 IEEE International Symposium on Information Theory.