On the utility of network coding in dynamic environments
暂无分享,去创建一个
Yu-Han Chang | R. Koetter | M. Medard | M. Effros | T. Ho | B. Leong | Yu-Han Chang | M. Effros | Muriel Médard | Ralf Koetter | Ben Leong | Tracey Ho
[1] B. M. Waxman. New Approximation Algorithms for the Steiner Tree Problem , 1989 .
[2] Murali S. Kodialam,et al. Online multicast routing with bandwidth guarantees: a new approach using multicast network flow , 2003, TNET.
[3] Takahiro Matsuda,et al. Performance evaluation of new multicast architecture with network coding , 2003 .
[4] P. Chou,et al. Low complexity algebraic multicast network codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[5] Yossi Azar,et al. On-line generalized Steiner problem , 1996, SODA '96.
[6] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[7] S. Ramanathan,et al. Multicast tree generation in networks with asymmetric links , 1996, TNET.
[8] Marek Karpinski,et al. New Approximation Algorithms for the Steiner Tree Problems , 1997, J. Comb. Optim..
[9] R. Koetter,et al. The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[10] K. Jain,et al. Practical Network Coding , 2003 .
[11] Muriel Medard,et al. On Randomized Network Coding , 2003 .
[12] Baochun Li,et al. How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.
[13] Ying Zhu,et al. Multicast with network coding in application-layer overlay networks , 2004, IEEE Journal on Selected Areas in Communications.
[14] Sudipto Guha,et al. Approximation algorithms for directed Steiner problems , 1999, SODA '98.
[15] Piotr Berman,et al. Improved approximations for the Steiner tree problem , 1992, SODA '92.
[16] Peter Sanders,et al. Polynomial time algorithms for network information flow , 2003, SPAA '03.
[17] Muriel Médard,et al. An algebraic approach to network coding , 2003, TNET.
[18] Bernard M. Waxman,et al. Performance evaluation of multipoint routing algorithms , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[19] Peter Sanders,et al. Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.
[20] Marek Karpinski,et al. Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem , 2003, WADS.