Near-Optimal One-Sided Scheduling for Coded Segmented Network Coding
暂无分享,去创建一个
Song Guo | Bin Tang | Sanglu Lu | Baoliu Ye | Shenghao Yang | Song Guo | Sanglu Lu | Shenghao Yang | Bin Tang | Baoliu Ye
[1] K. Jain,et al. Practical Network Coding , 2003 .
[2] Muriel Médard,et al. On coding for reliable communication over packet networks , 2005, Phys. Commun..
[3] Michael Luby,et al. LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[4] Baochun Li,et al. Parallelized Progressive Network Coding With Hardware Acceleration , 2007, 2007 Fifteenth IEEE International Workshop on Quality of Service.
[5] Sachin Katti,et al. Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM 2007.
[6] Masoud Ardakani,et al. Overhead-Optimized Gamma Network Codes , 2013, ArXiv.
[7] Bin Tang,et al. Expander chunked codes , 2013, EURASIP Journal on Advances in Signal Processing.
[8] D. Lun,et al. Methods for Efficient Network Coding , 2006 .
[9] Frank R. Kschischang,et al. Sparse network coding with overlapping classes , 2009, 2009 Workshop on Network Coding, Theory, and Applications.
[10] Shenghao Yang,et al. Coding for a network coded fountain , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[11] Amir H. Banihashemi,et al. Overlapped Chunked network coding , 2009, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).
[12] Baochun Li,et al. SlideOR: Online Opportunistic Network Coding in Wireless Mesh Networks , 2010, 2010 Proceedings IEEE INFOCOM.
[13] R. M. Loynes,et al. The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.
[14] Babak Hassibi,et al. Capacity of wireless erasure networks , 2006, IEEE Transactions on Information Theory.
[15] Yunnan Wu. A Trellis Connectivity Analysis of Random Linear Network Coding with Buffering , 2006, 2006 IEEE International Symposium on Information Theory.
[16] Emina Soljanin,et al. Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding , 2010, IEEE Transactions on Information Theory.
[17] Baochun Li,et al. CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding , 2008, 2008 IEEE International Conference on Network Protocols.
[18] Devavrat Shah,et al. Network Coding Meets TCP: Theory and Implementation , 2011, Proceedings of the IEEE.
[19] R. Koetter,et al. The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[20] Dimitrios Koutsonikolas,et al. CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments , 2010, INFOCOM 2010.
[21] Harald Niederreiter,et al. Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..
[22] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[23] Shuo-Yen Robert Li,et al. Linear network coding , 2003, IEEE Trans. Inf. Theory.
[24] Bin Tang,et al. Expander graph based overlapped chunked codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[25] Christina Fragouli,et al. On Capacity of Line Networks , 2007, IEEE Transactions on Information Theory.
[26] Baochun Li,et al. How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.
[27] Shenghao Yang,et al. Batched Sparse Codes , 2012, IEEE Transactions on Information Theory.
[28] Dimitrios Koutsonikolas,et al. CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments , 2010, 2010 Proceedings IEEE INFOCOM.
[29] William H. Press,et al. Numerical recipes in C. The art of scientific computing , 1987 .
[30] Tracey Ho,et al. A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.
[31] Amir H. Banihashemi,et al. Analysis of overlapped chunked codes with small chunks over line networks , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[32] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[33] Chuan Wu,et al. UUSee: Large-Scale Operational On-Demand Streaming with Random Network Coding , 2010, 2010 Proceedings IEEE INFOCOM.
[34] Amir H. Banihashemi,et al. Network Codes with Overlapping Chunks over Line Networks: A Case for Linear-Time Codes , 2011, ArXiv.
[35] Bin Tang,et al. From LDPC to chunked network codes , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).
[36] Andrew V. Goldberg,et al. Efficient maximum flow algorithms , 2014, CACM.
[37] W. Press,et al. Numerical Recipes: The Art of Scientific Computing , 1987 .