On the resilience-complexity tradeoff of network coding in dynamic P2P networks

IEEE International Workshop on Quality of Service, IWQoS

Volumn , Issue , 2007, Pages 38-46

  Niu, Di ^a   Li, Baochun ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DIFFERENTIAL EQUATIONS; NETWORK PROTOCOLS; PARAMETER ESTIMATION; RANDOM PROCESSES;

BLOCK DISTRIBUTIONS; NETWORK CODING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34748829075     PISSN: 1548615X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWQOS.2007.376546     Document Type: Conference Paper

References (22)

1. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, "Network Information Flow," IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
2. S. R. Li, R. W. Yeung, and N. Cai, "Linear Network Coding," IEEE Transactions on Information Theory, vol. 49, pp. 371, 2003.
3. R. Koetter and M. Medard, "An Algebraic Approach to Network Coding," IEEE/ACM Transactions on Networking, vol. 11, no. 5, pp. 782-795, October 2003.
4. C. Gkantsidis and P. Rodriguez, "Network Coding for Large Scale Content Distribution," in Proceedings of IEEE INFOCOM 2005, March 2005.
5. M. Wang and B. Li, "How Practical is Network Coding?," in Proc. of 14th IEEE International Workshop on Quality of Service (IWQoS'06), New Haven, CT, USA, June 2006.
6. P. Chou, Y. Wu, and K. Jain, "Practical Network Coding," in Proceedings of Allerton Conference on Communication, Control and Computing, October 2003.
7. T. Ho, M. Medard, J. Shi, M. Effros, and D. Karger, "On Randomized Network Coding," in Proceedings of Allerton Conference on Communication, Control and Computing, October 2003.
8. C. Gkantsidis, J. Miller, and P. Rodriguez, "Comprehensive View of a Live Network Coding P2P System," in Internet Measurement Conference (IMC 2006), 2006.
9. Y. Wu, "Network Coding for Multicasting," Tech. Rep., Princeton University, Nov. 2005.
10. D. S. Lun, M. Medard, R. Koetter, and M. Effros, "Further Results on Coding for Reliable Communication Over Packet Networks," in Proc. of IEEE International Symposium on Information Theory (ISIT2005), Sept. 2005.
11. S. Acedanski, S. Deb, M. Medard, and R. Koetter, "How Good is Random Linear Coding based Distributed Networked Storage?," in First Workshop on Network Coding, Theory, and Applications (NetCod'05), Riva del Garda, Italy, April 2005.
12. B. Fan, D. M. Chiu, and J. C. S. Lui, "Stochastic Analysis and File Availability Enhancement for BT-like File Sharing Systems," in Proc. of 14th IEEE International Workshop on Quality of Service (IWQoS'06), New Haven, CT, USA, June 2006.
13. B. Cohen, "Incentives Build Robustness in BitTorrent," in P2P Economics Workshop, Berkeley, CA, USA, 2003.
14. X. Yang and G. de Veciana, "Service Capacity of Peer to Peer Networks," in Proceedings of IEEE INFOCOM 2004, Hong Kong, China, March 2004.
15. D. Leonard, V. Rai, and D. Loguinov, "On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks," in Proc. of ACM SIGMETRICS'05, Banff, Alberta, Canada, June 2005.
16. M. Mitzenmacher, "Load Balancing and Density Dependent Jump Markov Processes," in Proc. of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS 96'), 1996, pp. 213-223.
17. K. K. Ramakrishnan and R. Jain, "A binary feedback scheme for congestion avoidance in computer networks," ACM Transactions on Computer Systems, vol. 8, no. 2, pp. 158-181, May 1990.
18. T. G. Kurtz, "Approximation of Population Processes," in CBMS-NSF Regional Conference Series in Applied Math. SIAM, 1981.
19. M. Mitzenmacher, "Studying Balanced Allocations with Differential Equations," in Technical Note 1997-024, Palo Alto, CA, October 1997, Digital Equipment Corporation Systems Research Center.
20. G. Tan and S. A. Jarvis, "On the Reliability of DHT-Based Multicast," Tech. Rep., University of Warwick, 2006.
21. Di Niu and Baochun Li, "Quantifying the Resilience-Complexity Tradeoff of Network Coding in Dynamic P2P Networks," Tech. Rep., http://iqua.ece.toronto.edu/papers/ResilienceNC.pdf, ECE, University of Toronto, February 2007.
22. S. Deb, M. Medard, and C. Choute, "Algebraic Gossip: A Network Coding Approach to Optimal Multiple Rumor Mongering," IEEE Transactions on Information Theory, vol. 52, no. 6, June 2006.