论文信息 - A comparison of network coding and tree packing

A comparison of network coding and tree packing

Network coding solutions and routing solutions, namely packing distribution trees, for the problem of information multicast is compared in this paper. To enable the comparison, we develop greedy tree packing algorithms that repeatedly pack the maximum-rate distribution tree and a greedy tree packing algorithm based on Lovasz' proof to Edmonds' theorem. We then investigate the potential advantages of network coding over routing. In terms of throughput, tree packing performs comparably to network coding on the network graphs of six Internet service providers. However, network coding offers additional benefits, including fewer network resources consumed, ease of management, and robustness.

[1] R. Prim. Shortest connection networks and some generalizations , 1957 .

[2] K. Jain,et al. Practical Network Coding , 2003 .

[3] Muriel Médard,et al. An algebraic approach to network coding , 2003, TNET.

[4] Mohammad R. Salavatipour,et al. Packing Steiner trees , 2003, SODA '03.

[5] D. R. Fulkerson,et al. On edge-disjoint branchings , 1976, Networks.

[6] Sidharth Jaggi,et al. Low complexity optimal algebraic multicast codes , 2003 .

[7] László Lovász,et al. On two minimax theorems in graph , 1976, J. Comb. Theory, Ser. B.

[8] Peter Sanders,et al. Polynomial time algorithms for network information flow , 2003, SPAA '03.

[9] Sidharth Jaggi,et al. Polynomial time algorithms for network code construction , 2005 .

[10] Baochun Li,et al. How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

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

[12] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .