Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

A Family of Concatenated Network Codes for Improved Performance With Generations

  • Thibault, Jean-Pierre (Department of Electrical Engineering, Queen's University) ;
  • Chan, Wai-Yip (Department of Electrical and Computer Engineering, Queen's University) ;
  • Yousefi, Shahram (Department of Electrical and Computer Engineering, Queen's University)
  • Published : 2008.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

Random network coding can be viewed as a single block code applied to all source packets. To manage the concomitant high coding complexity, source packets can be partitioned into generations; block coding is then performed on each set. To reach a better performance-complexity tradeoff, we propose a novel concatenated network code which mixes generations while retaining the desirable properties of generation-based coding. Focusing on the code's erasure performance, we show that the probability of successfully decoding a generation on erasure channels can increase substantially for any erasure rate. Using both analysis (for small networks) and simulations (for larger networks), we show how the code's parameters can be tuned to extract best performance. As a result, the probability of failing to decode a generation is reduced by nearly one order of magnitude.

Keywords

References

  1. R. Ahlswede, N. Cai, S.-Y. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, pp. 1204-1216, July 2000. https://doi.org/10.1109/18.850663
  2. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. IEEE ISIT, Yokohama, Japan, June 2003, p. 442.
  3. P. A. Chou, Y.Wu, and K. Jain, "Practical network coding," in Proc. Allerton Conf. Commun., Control, and Computing, Monticello, IL, 2003.
  4. G. D. Forney Jr., Concatenated Codes. Cambridge, MA: MIT Press, 1966.
  5. M.Wang and B. Li, "How practical is network coding?," in Proc. IEEE Int. Workshop on Quality of Service, New Haven, CT, June 2006, pp. 274-278.
  6. M. Wang and B. Li, "Network coding in live peer-to-peer streaming," IEEE Trans. Multimedia, vol. 9, pp. 1554-1567, Oct. 2007. https://doi.org/10.1109/TMM.2007.907460
  7. M. Langberg, A. Sprintson, and J. Bruck, "The encoding complexity of network coding," IEEE Trans. Inf. Theory, vol. 52, pp. 2386-2397, June 2006. https://doi.org/10.1109/TIT.2006.874434
  8. C. Gkantsidis, J. Miller, and P. Rodriguez, "Anatomy of a P2P content distribution system with network coding," in Proc. Int. Workshop on Peerto- Peer Systems, Santa Barbara, CA, Feb. 2006, pp. 2235-2245.
  9. P. Maymounkov, N. J. A. Harvey, and D. S. Lun, "Methods for efficient network coding," in Proc. Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sept. 2006.
  10. D. Niu and B. Li, "On the resilience-complexity tradeoff of network coding in dynamic P2P networks," in Proc. IEEE Int. Workshop on Quality of Service, Chicago, IL, June 2007, pp. 47-55.
  11. J.-P. Thibault, S. Yousefi, and W.-Y. Chan, "Throughput performance of generation-based network coding," in Proc. Canadian Workshop on Inf. Theory, Edmonton, Alberta, June 2007, pp. 89-92.
  12. S. W. Kim, "Concatenated network coding for large-scale multi-hop wireless networks," in Proc. Wireless Commun. and Network. Conf., Kowloon, China, Mar. 2007, pp. 985-989.
  13. J.-P. Thibault, W.-Y. Chan, and S. Yousefi, "Efficient mixed-generation concatenated network coding," in Proc. the 24th Queen's Biennial Symp. Commun., Kingston, Canada, June 2008.
  14. J.-P. Thibault, "Throughput performance and complexity in generationbased network coding," Master's thesis, Queen's University, Kingston, Ontario, May 2007.
  15. "Rocketfuel: An ISP topology mapping engine." http://www.cs.washingt on.edu/research/networking/rocketfuel/.