面向数据分发的网络编码研究
|
摘要
大规模的数据分发有着广泛的应用背景。在现有网络条件下,如何更有效利用网络资源并实现高质量的数据分发,已成为网络信息流研究领域的重要课题之一。近些年来提出的网络编码为实现这一目标提供了新的解决方案。网络编码的核心思想是允许通信网络中的节点对传输的信息进行处理和操作(如有限域中的运算等),而不再限于存储和转发。网络编码革命性地拓展了现有的基于存储和转发的数据分发模式,被认为是进入21世纪后信息处理和信息传输理论研究领域上的重大突破,具有重要的理论价值和广泛的应用前景。国内外许多知名大学、科研机构和公司等都积极投入对网络编码的研究,并取得了一些重要的研究成果。
已经证明,网络编码能显著改善数据分发系统的性能,如提升网络吞吐量,节约传输带宽和均衡网络负载等。然而,与基于存储和转发操作的路由传输机制相比,网络编码系统中的节点需要执行频繁的编码和译码操作,这必将消耗额外的计算资源(如I/O和CPU等),从而增加了在实际网络中部署和实施网络编码的成本和代价。因此,对面向数据分发的网络编码传输过程进行优化,减少网络编码操作所需的额外计算消耗,以此来实现低代价网络编码数据分发,对进一步提升数据分发系统的性能并促进网络编码的大规模应用有重要的指导意义。
本文以降低网络编码操作所需的额外计算消耗为出发点,研究能实现更高效的基于网络编码的数据分发模式。研究主要从以下几个方面展开:(1)基于信息流向量的网络编码传输模型的研究;(2)基于关键链路的低代价网络编码实现算法的研究;(3)基于分簇网络编码的传输策略与相关算法的研究。本文的研究工作得到了国家自然科学基金“无线Mesh网络流媒体分发研究”(No. 60773193),华为公司高科技基金“面向P2P的网络编码研究”(No. HW200606301254),湖北省智能互联网技术重点实验室开放基金(No. HSIT-200605)和华中科技大学电信系基础理论研究基金(2008)的资助。
本文的研究成果包含以下几个方面:
1)基于信息流向量的网络编码传输模型:将数据分发系统中传输的信息建模为网络信息流,提出了一种具有线性复杂性的描述网络信息流的方法:信息流向量。结合信息流向量,分析了网络编码系统中存在的信息流向量约束,提出了反映网络编码操作数的指标:代价函数,并构建了最小代价的网络编码传输模型。该模型将网络编码数据分发系统的优化问题转化为数学规划问题,因此能够利用数学规划的相关理论求解并确定出最小代价的网络编码数据分发模式。此外,为考虑一些特殊网络中网络编码操作执行效率的问题,提出了一种基于效用折中的网络编码传输模型。该模型对在实际网络中,构建具有最小代价的,基于网络编码的数据分发系统具有重要的理论指导意义。
2)低代价网络编码实现算法的研究:通过分析网络编码的本质特性,将网络编码区分于传统的基于存储和转发的数据分发模式并显著提升数据分发系统性能的根本原因归结为构建的传输路径上存在“关键”链路。为实现给定网络中数据分发系统的理论吞吐量,关键链路必须传输编码信息。编码信息能够在信宿节点通过合适的译码操作加以“区分”。因此,在构建网络编码数据分发系统的传输路径时,如果能够保证形成较少的关键链路,就能在一定程度上减少系统中网络编码操作的执行次数,从而降低网络编码所需的额外计算消耗,进而降低网络编码的实施成本和代价,并构建低代价的基于网络编码的数据分发模式。基于该思想,提出了一种基于关键链路的低代价网络编码实现算法,并对该算法进行了分布式实现。
3)基于分簇网络编码的传输策略与相关算法研究。虽然网络编码源于IP组播,并被证明能提升组播网络中的数据分发性能,但由于技术和非技术上的挑战,IP组播并没有在现有互联网上得到大规模的部署和应用。作为一种替代的解决方案,基于对等网的协作式数据分发模型及其系统近年来得到了长足的发展,并被广泛应用。网络编码与基于对等网的协作式数据分发模型相结合,是网络编码应用研究领域的热点。然而,由于网络编码固有的特点,即节点需要执行编码和译码操作,一些学者对网络编码究竟能在多大程度上提升协作式数据分发系统的性能表示怀疑。以此为研究背景,以降低节点执行编码和译码操作的复杂性为目标,提出了分簇网络编码的思想。基于分簇网络编码,提出了随机性选择和相关性检测等机制来保证在降低网络编码复杂性的前提下,进一步提升数据分发系统的性能。
Many applications based on Internet need to use the large-scale data delivery mechanism, such as IP multicast and P2P cooperative content distribution, to deliver information to a large number of users. How to obtain the better delivery performance with the limited network resources has become a“hot spot”in the research community of network information flow. To achieve the goal, network coding, as one of the most important breakthroughs on the theory of information processing and transmission, was proposed in recent years. The main principle behind network coding is that the relay (intermediate) nodes in the communication network make encoding and decoding operations to the data bits. Network coding generalizes the traditional data delivery mechanism where the data bits can only be stored and forwarded. With network coding,the communication network can achieve better transmission performance, such as higher network throughput and lower bandwidth consumption etc. Due to its significant potentials, network coding has received much concern in both the research and industrial community. Lots of famous universities and research agencies have put much attention on the research of network coding and finished some important works.
It can be proved from the theoretical aspects that network coding can enhance the performance of a given data network to a large extent. However, compared with the traditional data delivery mechanism based on storing and forwarding, the nodes in network coding system need to perform encoding and decoding operations such that the system based on network coding takes additional computational overheads (such as I/O and CPU consumption), which will bring high cost (computational and non-computational) to deploy network coding in real data networks. Hence, it is better to find out an optimal network coding scheme in which the additional computational overheads caused by network coding is as lower as possible. To address this issue, this thesis investigates the optimization technologies of network coding from the theoretical and practical interests respectively. The content of this thesis includes three aspects: 1) Information flow vector-based optimal network coding model; 2) Key links-based low-cost network coding algorithm and its distributed implementation; 3) Clustered network coding-based cooperative content distribution scheme and algorithms.
The works in this thesis have been supported by the National Science Foundation of China“Wireless Mesh Network-based Stream Media Distribution”(No. 60773193), High-Tech Foundation of Huawei Corporation (China)“Peer to Peer Oriented Network Coding”(No.YJCB2006049RE), the Foundation of Hubei Provincial Key Laboratory of Smart Internet Technology (HSIT-200605) and the Research Foundation of Department of Electronics and Information Engineering, Huazhong University of Science and Technology (2008).
The contributions of this thesis contain:
1. Information flow vector-base optimal network coding model. By modeling the information transmitted in the data delivery network as network information flow, we present a simple but effective approach to describe the information flow on each link in the data delivery system, referred to information flow vector. We analyze the properties of information flow vector, and conclude some requirements the information flow vector should meet with, and then construct an optimal network coding model. With the model, the problem of reducing the additional computational overheads of network coding operations can be converted into a programming formulation. Therefore, we can find out the optimal network coding-based data delivery scheme with minimal computational overheads by solving the model. Moreover, we consider some special cases and proposed a utility tradeoff-based network coding model in which the utility and computational overheads are considered together.
2. Key link-based low-cost network coding algorithm and its distributed implementation. From the viewpoint of practical interests, we analyze the inherent characteristics of network coding and show that the essence of network coding is that there are some key links shared by deferent paths between the source and multi-receivers when we establish the transmission paths for the data delivery network. To achieve the maximal throughput of the network, network coding is needed and the key links should carry encoded information. Since the additional computational overheads in network coding system are caused by the network coding operations, an effective way of reducing additional computational overheads and realizing a low-cost network coding transmission scheme is to reduce the number of key links while constructing transmission paths. Following this idea, we present a key links-based algorithm for low-cost network coding and propose its distribution implementation.
3. Cluster network coding-based content distribution scheme. Due to the technical and non-technical reasons, the IP multicast based data delivery system which the network coding original proposed for has not been widely implemented in the network till now. As a scable solution to deliver content to a large number of end-users, the overlay network based P2P cooperative data delivery scheme and systems have been widely used recently. Borrowing the idea of network coding, a novel data delivery scheme which is based on network coding was proposed. However, some reaserchers think the performance of such novel scheme be less optimistics due to the additional computational overheads caused by network coding operations. To optimize the data delivery scheme and enhance the performance further, we proposed some new mechanisms, such as clustered network coding, random choice-based strategy and independence checking algorithm etc. Based on the proposed mechanisms, we construct an improved network coding-based data delivery scheme. Compare to the common used data delivery scheme, the improved scheme can reduce the additional computational consumptions of network coding operations to a large extent, and improve the performance of data delivery system significantly.
已经证明,网络编码能显著改善数据分发系统的性能,如提升网络吞吐量,节约传输带宽和均衡网络负载等。然而,与基于存储和转发操作的路由传输机制相比,网络编码系统中的节点需要执行频繁的编码和译码操作,这必将消耗额外的计算资源(如I/O和CPU等),从而增加了在实际网络中部署和实施网络编码的成本和代价。因此,对面向数据分发的网络编码传输过程进行优化,减少网络编码操作所需的额外计算消耗,以此来实现低代价网络编码数据分发,对进一步提升数据分发系统的性能并促进网络编码的大规模应用有重要的指导意义。
本文以降低网络编码操作所需的额外计算消耗为出发点,研究能实现更高效的基于网络编码的数据分发模式。研究主要从以下几个方面展开:(1)基于信息流向量的网络编码传输模型的研究;(2)基于关键链路的低代价网络编码实现算法的研究;(3)基于分簇网络编码的传输策略与相关算法的研究。本文的研究工作得到了国家自然科学基金“无线Mesh网络流媒体分发研究”(No. 60773193),华为公司高科技基金“面向P2P的网络编码研究”(No. HW200606301254),湖北省智能互联网技术重点实验室开放基金(No. HSIT-200605)和华中科技大学电信系基础理论研究基金(2008)的资助。
本文的研究成果包含以下几个方面:
1)基于信息流向量的网络编码传输模型:将数据分发系统中传输的信息建模为网络信息流,提出了一种具有线性复杂性的描述网络信息流的方法:信息流向量。结合信息流向量,分析了网络编码系统中存在的信息流向量约束,提出了反映网络编码操作数的指标:代价函数,并构建了最小代价的网络编码传输模型。该模型将网络编码数据分发系统的优化问题转化为数学规划问题,因此能够利用数学规划的相关理论求解并确定出最小代价的网络编码数据分发模式。此外,为考虑一些特殊网络中网络编码操作执行效率的问题,提出了一种基于效用折中的网络编码传输模型。该模型对在实际网络中,构建具有最小代价的,基于网络编码的数据分发系统具有重要的理论指导意义。
2)低代价网络编码实现算法的研究:通过分析网络编码的本质特性,将网络编码区分于传统的基于存储和转发的数据分发模式并显著提升数据分发系统性能的根本原因归结为构建的传输路径上存在“关键”链路。为实现给定网络中数据分发系统的理论吞吐量,关键链路必须传输编码信息。编码信息能够在信宿节点通过合适的译码操作加以“区分”。因此,在构建网络编码数据分发系统的传输路径时,如果能够保证形成较少的关键链路,就能在一定程度上减少系统中网络编码操作的执行次数,从而降低网络编码所需的额外计算消耗,进而降低网络编码的实施成本和代价,并构建低代价的基于网络编码的数据分发模式。基于该思想,提出了一种基于关键链路的低代价网络编码实现算法,并对该算法进行了分布式实现。
3)基于分簇网络编码的传输策略与相关算法研究。虽然网络编码源于IP组播,并被证明能提升组播网络中的数据分发性能,但由于技术和非技术上的挑战,IP组播并没有在现有互联网上得到大规模的部署和应用。作为一种替代的解决方案,基于对等网的协作式数据分发模型及其系统近年来得到了长足的发展,并被广泛应用。网络编码与基于对等网的协作式数据分发模型相结合,是网络编码应用研究领域的热点。然而,由于网络编码固有的特点,即节点需要执行编码和译码操作,一些学者对网络编码究竟能在多大程度上提升协作式数据分发系统的性能表示怀疑。以此为研究背景,以降低节点执行编码和译码操作的复杂性为目标,提出了分簇网络编码的思想。基于分簇网络编码,提出了随机性选择和相关性检测等机制来保证在降低网络编码复杂性的前提下,进一步提升数据分发系统的性能。
Many applications based on Internet need to use the large-scale data delivery mechanism, such as IP multicast and P2P cooperative content distribution, to deliver information to a large number of users. How to obtain the better delivery performance with the limited network resources has become a“hot spot”in the research community of network information flow. To achieve the goal, network coding, as one of the most important breakthroughs on the theory of information processing and transmission, was proposed in recent years. The main principle behind network coding is that the relay (intermediate) nodes in the communication network make encoding and decoding operations to the data bits. Network coding generalizes the traditional data delivery mechanism where the data bits can only be stored and forwarded. With network coding,the communication network can achieve better transmission performance, such as higher network throughput and lower bandwidth consumption etc. Due to its significant potentials, network coding has received much concern in both the research and industrial community. Lots of famous universities and research agencies have put much attention on the research of network coding and finished some important works.
It can be proved from the theoretical aspects that network coding can enhance the performance of a given data network to a large extent. However, compared with the traditional data delivery mechanism based on storing and forwarding, the nodes in network coding system need to perform encoding and decoding operations such that the system based on network coding takes additional computational overheads (such as I/O and CPU consumption), which will bring high cost (computational and non-computational) to deploy network coding in real data networks. Hence, it is better to find out an optimal network coding scheme in which the additional computational overheads caused by network coding is as lower as possible. To address this issue, this thesis investigates the optimization technologies of network coding from the theoretical and practical interests respectively. The content of this thesis includes three aspects: 1) Information flow vector-based optimal network coding model; 2) Key links-based low-cost network coding algorithm and its distributed implementation; 3) Clustered network coding-based cooperative content distribution scheme and algorithms.
The works in this thesis have been supported by the National Science Foundation of China“Wireless Mesh Network-based Stream Media Distribution”(No. 60773193), High-Tech Foundation of Huawei Corporation (China)“Peer to Peer Oriented Network Coding”(No.YJCB2006049RE), the Foundation of Hubei Provincial Key Laboratory of Smart Internet Technology (HSIT-200605) and the Research Foundation of Department of Electronics and Information Engineering, Huazhong University of Science and Technology (2008).
The contributions of this thesis contain:
1. Information flow vector-base optimal network coding model. By modeling the information transmitted in the data delivery network as network information flow, we present a simple but effective approach to describe the information flow on each link in the data delivery system, referred to information flow vector. We analyze the properties of information flow vector, and conclude some requirements the information flow vector should meet with, and then construct an optimal network coding model. With the model, the problem of reducing the additional computational overheads of network coding operations can be converted into a programming formulation. Therefore, we can find out the optimal network coding-based data delivery scheme with minimal computational overheads by solving the model. Moreover, we consider some special cases and proposed a utility tradeoff-based network coding model in which the utility and computational overheads are considered together.
2. Key link-based low-cost network coding algorithm and its distributed implementation. From the viewpoint of practical interests, we analyze the inherent characteristics of network coding and show that the essence of network coding is that there are some key links shared by deferent paths between the source and multi-receivers when we establish the transmission paths for the data delivery network. To achieve the maximal throughput of the network, network coding is needed and the key links should carry encoded information. Since the additional computational overheads in network coding system are caused by the network coding operations, an effective way of reducing additional computational overheads and realizing a low-cost network coding transmission scheme is to reduce the number of key links while constructing transmission paths. Following this idea, we present a key links-based algorithm for low-cost network coding and propose its distribution implementation.
3. Cluster network coding-based content distribution scheme. Due to the technical and non-technical reasons, the IP multicast based data delivery system which the network coding original proposed for has not been widely implemented in the network till now. As a scable solution to deliver content to a large number of end-users, the overlay network based P2P cooperative data delivery scheme and systems have been widely used recently. Borrowing the idea of network coding, a novel data delivery scheme which is based on network coding was proposed. However, some reaserchers think the performance of such novel scheme be less optimistics due to the additional computational overheads caused by network coding operations. To optimize the data delivery scheme and enhance the performance further, we proposed some new mechanisms, such as clustered network coding, random choice-based strategy and independence checking algorithm etc. Based on the proposed mechanisms, we construct an improved network coding-based data delivery scheme. Compare to the common used data delivery scheme, the improved scheme can reduce the additional computational consumptions of network coding operations to a large extent, and improve the performance of data delivery system significantly.
引文
[1] E. Derini, M. Aly, H. Yassin, et al. Supporting a multicast communication for large scale groups. Cairo, Egypt: Institute of Electrical and Electronics Engineers Inc., vol. 1, 2002. p.7-11.
[2] Lin. C. R and Chao. S. W. Multicast routing protocol for multihop wireless networks. RiodeJaneiro, Braz: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ, USA, vol. 1 (A), 1999. p.235-239.
[3] Trossen. D. On receiver-driven congestion control for multicast streaming delivery. in. Orlando, FL: Institute of Electrical and Electronics Engineers Inc., vol. 2, 2001. p.1905-1910.
[4] Lau. L. C. Packing Steiner forests. Berlin, Germany: Springer Verlag, Heidelberg, D-69121, Germany, vol. 3509, 2005. p.362-376.
[5] Cheriyan. J and Salavatipour. M. R. Packing element-disjoint steiner trees. ACM Transactions on Algorithms. 2007, 3(4): 1290684.
[6] Ratnakar. N. Traskov. D and Koetter. R. Approaches to network coding for multiple unicasts. Zurich, Switzerland: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, vol. 2006, 2006. p.70-73.
[7] Wan. Z. W, Kadoch. M and Elhakeem. A. Optimizing the performance of tree-based reliable multicast. Computers and Electrical Engineering. 2006, 32(5): p.394-410.
[8] Gao. H, Papka. M. E and Stevens. R. L. Performance metrics of IP multicast sessions. Irvine, CA, United States: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, vol. 2005, 2005. p.183-192.
[9] Ahlswede. R, Ning. C, Li. S.-Y. R. et al. Network information flow. IEEE Transactions on Information Theory. 2000, 46(4): p.1204-1216.
[10] Agarwal. A and Charikar. M. On the advantage of network coding for improving network throughput. San Antonio, TX, USA: IEEE CS, 2004. p.247-249.
[11] D. Lun, N. R, R. Koetter, et al. Achieving minimum-cost multicast: A decentralized approach based on network coding. In Proceedings of IEEE INFOCOM: 2005.
[12] Bhadra.S and Gupta.P. Min-cost Selfish Multicast with Network Coding. In 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc andWireless Networks: 2006
[13] Servetto.S.D and B. J. A coding theorem for network information flow with correlated sources. In Proceeding of IEEE International Symposium on Information Theory (ISIT): 2005.
[14] Gkantsidis. C and Rodriguez. P. R. Network coding for large scale content distribution. Miami, FL, USA: IEEE CS, vol. 4, 2005. p.2235-2245.
[15] Jingyao. Z and Pingyi. F. On network coding in wireless ad-hoc networks. Guangzhou, China: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, vol. 2005, 2005. 1627968.
[16] Xu. C, Xu. Y, Zhan. C, et al. On network coding based multirate video streaming in directed networks. New Orleans, LA, United States: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, 2007. p.332-339.
[17] Chi. K, Yang. C and Wang. X. Performance of network coding based multicast. IEE Proceedings-Communications. 2006, 153(3): p.399-404.
[18] Jin Zhao, F. Y., Qian Zhang,Zhensheng Zhang and Fuyan Zhang. LION: layered overlay multicast with network coding. IEEE Transactions on Multimedia. 2006.
[19] Li, S. Y. R., Yeung, R. W. On convolutional network coding. in. Seattle, WA, USA: IEEE, 2006. p.1743-1747.
[20] Li, S. Y. R., Yeung, R. W., Ning, C. Linear network coding. IEEE Transactions on Information Theory. 2003, 49(2): p.371-381.
[21] P. Sanders, S. E. a. L. T. Polynomial time algorithms for network information flow. in: In Proc. 15th ACM Symposium on Parallel Algorithms and Architectures: 2003.
[22] Deb. S, Medard. M and Choute. C. On random network coding based information dissemination. Adelaide, SA, Australia: IEEE Computer Society, 2005. p. 278-282.
[23] Mea. W and Baochun. L. Network coding in live peer-to-peer streaming. IEEE Transactions on Multimedia. 2007, 9(8): p.1554-1567.
[24] Liu. Y, Dou. W, Peng. Y, et al. Network coding for peer-to-peer live media streaming. Hunan, China: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, 2006. p.149-155.
[25] Chou. P. A and Wu. Y. Network coding for the internet and wireless networks. IEEE Signal Processing Magazine. 2007, 24(5): p.177-185.
[26] Medard. M. Network coding in wireless networks. New York, NY, United States: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, vol. 2005.
[27] Bhattad. K, Ratnakar. N and Koetter. R., Narayanan, K. R. Minimal network coding for multicast. in. Adelaide, SA, Australia: IEEE Computer Society, 2005. p.1730-1734.
[28] Langberg. M, Sprintson. A and Bruck. J. The encoding complexity of network coding. IEEE Transactions on Information Theory. 2006, 52(6): p.2386-2397.
[29] Wang. M and Baochun. L. How practical is network coding? New Haven, CT, USA: IEEE Computer Society, 2006. p.274-278.
[30] Ning. C and Yeung, R. W. Secure network coding. Lausanne, Switzerland: IEEE Computer Society, 2002. p.323-331.
[31] Oliveira. P. F and Barros. J. Network coding protocols for secret key distribution. Vilamoura, Portugal: Springer Verlag, Heidelberg, D-69121, Germany, vol. 4804 NCS, 2007. p.1718-1733.
[32] Zhang. Z, Yan. X and Balli. H. Some Key Problems in Network Error Correction Coding Theory. In Proceeding of IEEE Information Theory Workshop on Information Theory for Wireless Networks: 2007. p.1-5.
[33] Sprintson. A, Rouayheb. S and Georghiades. Robust network coding for bidirected networks. in. La Jolla, CA, USA: Computer Society, 2007. p.376-381.
[34] Campo. A. T and Grant, A. Robustness of Random Network Coding to Interfering Sources. In Proceedings of 7th Australian Communications Theory Workshop, 2006. p. 120-124.
[35] Zhang. X and Wicker. S. B. Robustness vs. Efficiency in sensor networks. in. Los Angeles, CA, United States: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, vol. 2005, 2005. p. 225-230.
[36] Sun. Y, Yang, Y and Wang. X. M. Multicast fault recovery on network coding. Journal of Xidian University. 2007, 34(1): p.122-125.
[37] Sagduyu. Y. E and Ephremides. A. Crosslayer design for distributed MAC and network coding in wireless ad hoc networks. in. Adelaide, SA, Australia: IEEE Computer Society, 2005. p. 1863-1867.
[38] Sagduyu. Y. E and Ephremides. A. On Joint MAC and Network Coding in Wireless Ad Hoc Networks. IEEE Transactions on Information Theory. 2007, 53(10): p. 3697-3713.
[39] Yunnan. W and Sun-Yuan, K. Reduced-complexity network coding for multicasting over ad hoc networks. in. Philadelphia, PA, USA: IEEE Computer Society, vol. 3, 2005. p.501-504.
[40] Cui. Y, Xue. Y and Nahrstedt. K. Optimal distributed multicast routing using network coding: theory and applications. Performance Evaluation Review. 2004, 32(2): p. 47-49.
[41] Li. Z, Li. B, Jiang. D, et al. On achieving optimal throughput with network coding. in. Miami, FL, United States: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, vol. 3, 2005. p. 2184-2194.
[42] Sidharth. J, Yuval. C and Michelle. E. Low Complexity Encoding for Network Codes. In IEEE International Symposium on Information Theory (ISIT2006), 2006. p. 40-44.
[43] Kai. C and Pingyi. F. Link decomposition of network coding. Busan, South Korea: IEEE Computer Society, 2006. 5
[44] Sagduyu.Y. E and Ephremides. A. Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks. IEEE Transactions on Information Theory. 2008, 54(2): p.554-571.
[45] Yuan. J, Li. Z, Yu. W, et al. A cross-layer optimization framework for multicast in multi-hop wireless networks. Budapest, Hungary: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, vol. 2005, 2005. p.547-554.
[46] De Clercq. J and Beck, M. Content distribution networks. Alcatel Telecommunications Review. 2003, (2): p.138-141.
[47] Das. S and Kangasharju. J. Evaluation of network impact of content distribution mechanisms. Hong Kong, China: Association for Computing Machinery, New York, NY 10036-5701, United States, vol. 152, 2006.
[48] Makki. K and Pissinou.N. The Steiner tree problem with minimum number of vertices in graphs. Proceedings of the Second Great Lakes Symposium on VLSI. 1992. p. 202-206
[49] Jain. K, Mahdian. M and Salavatipour. M. R. Packing Steiner trees. Boston, MA,United States: Association for Computing Machinery, 2003. p.266-274.
[50] Saad. M, Terlaky. T, Vannelli. A, et al. Packing trees in communication networks. in. Hong Kong, China: Springer Verlag, Heidelberg, D-69121, Germany, vol. 3828 NCS, 2005. p. 688-697.
[51] Li. Z, Li. B and Lau. L. C. On achieving maximum multicast throughput in undirected networks. IEEE Transactions on Information Theory. 2006, 52(6): p. 2467-2485.
[52] Fragouli. C, Boudec. J. Y and Widmer. J. Network coding: an instant primer. Computer Communication Review. 2006, 36(1): p.63-68.
[53] Fragouli. C and Soljanin. E. Network coding fundamentals. Foundations and Trends in Networking. 2007, 2(1): p.129-133.
[54] Handley. S. On the use of a directed acyclic graph to represent a population of computer programs. Orlando, FL, USA: IEEE, Piscataway, NJ, USA, vol. /1, 1994. p.154-159.
[55]卢开澄,卢华明.图论及其应用.北京:清华大学出版社, 1995.
[56] Koetter. R and Medard. M. An algebraic approach to network coding. IEEE/ACM Transactions on Networkings. 2003, 11(5): p.782-795.
[57] Ho. T, Medard. M, Koetter. R, et al. A random linear network coding approach to multicast. IEEE Transactions on Information Theory. 2006, 52(10): p.4413-4430.
[58] Ho. T, Koetter. R, Medard, et al. The benefits of coding over routing in a randomized setting. In Proceedings. IEEE International Symposium on Information Theory (ISIT2003). p.442-441.
[59] P. A. Chou, Y. W and K. J. Practical network codinmg. In Proceeding of 41st Annual Allerton Conference on Communicatioin, Control, and Computing: 2003.
[60] T. Noguchi, T. M and M. Yamamoto. Performance evaluation of new mulitcast architecture with network coding. In IEICE Transaction on communication: 2003.
[61] Ramamoorthy. A, Jun. S and Wesel. R. D. On the capacity of network coding for random networks. IEEE Transactions on Information Theory. 2005, 51(8): p. 2878-2885.
[62] Li. S-Y. R, Ning. C and Yeung. R. W. On theory of linear network coding. in. Adelaide, SA, Australia: Computer Society, 2005. p.273-277.
[63] T. Ho, M. M and R. K. A coding view of network capacity, recovery andmanagement. In Proceeding of the 2002 IEEE international symposium on Information theory (ISIT2002). 2002.
[64] Hamra. A, Barakat. C and Turletti. T. Network coding for wireless mesh networks: a case study. Buffalo-Niagara Falls, NY, USA: IEEE Computer Society, 2006. 9 p. 67-72
[65] Gong. Y, Jin. D and Zeng. L. An introduction to network coding. in. Beijing, China: International Society for Optical Engineering, Bellingham, WA 98227-0010, United States, vol. 5626, 2005. p.629-635.
[66] Ying. Z, Baochun. L and J. G. Multicast with network coding in application-layer overlay networks. IEEE Journal on Selected Areas in Communications. 2004.
[67] Lun. D. S, Medard. M, Koetter. R. Network coding for efficient wireless unicast. in. Zurich, Switzerland: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, vol. 2006, p.174-177.
[68] Lun. D. S, Ahmed. E, Brothers.L. R., et al. Network coding for wireless applications. Bruges, Belgium: International Society for Optical Engineering, Bellingham WA, WA 98227-0010, United States, vol. 5986, 2005.
[69] Zhang. J, Cai.K, Letaief. K. B, et al. A network coding unicast strategy for wireless multi-hop networks. Kowloon, China: Institute of Electrical and Electronics Engineers Inc., New York, NY 10016-5997, United States, 2007. p. 4224-4229.
[70] Sagduyu. Y. E and Ephremides. A. On joint MAC and network coding in wireless ad hoc networks. IEEE Transactions on Information Theory. 2007, 53(10): p. 3697-3713.
[71] Jiang. G, Ying. Z and Baochun. Li. CodedStream: Live media streaming with overlay coded multicast. In ACM conference on Multimedia computing and networking (MMCN). California: 2004.
[72] Ying. Z, J. G and Baochun Li. oEvolve: Towards evolutionary overlay topologies for high bandwidth data dissemination. IEEE Journal on Selected Areas in Communications. 2004.
[73] Nad. T. Problems with network coding in overlay networks. [Online]: http://zoo.cs.yale.edu/classes/cs490/04-05a.
[74] Katabi. D, Katti. S, Wenjun. H, et al. On practical network coding for wireless environments. Zurich, Switzerland: IEEE Computer Society, 2006. p.184-189.
[75] Wu. Y, Chou. P. A and Kung, S. Y. Minimum-energy multicast in mobile ad hoc networks using network coding. IEEE Transactions on Communications. 2005, 53(11): p.1906-1918.
[76] Chen. Y, Kishore. S and Li. J. Wireless diversity through network coding. Las Vegas, NV, United States: Institute of Electrical and Electronics Engineers Inc., New York, NY 10016-5997, United States, vol. 3, 2006. p.1681-1686.
[77] Petrovic. D, Ramchandran. K and Rabaey. J. Coding for sensor networks using untuned radios. New York, NY, United States: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, vol. 2005, 2005. p. 1093-1097.
[78] S. Katti, W. Hu, H. Rahul, et al. The importance of being opportunistic:practical network coding for wireless enviroments. In the Proceeding 43th Annual Allerton conference on communication: 2005.
[79] Anxiao. J. Network coding for joint storage and transmission with minimum cost. Seattle, WA, USA: IEEE Computer Society, 2006. p.1359-1363.
[80] Mea. W and Baochun. L. R2: Random push with random network coding in live peer-to-peer streaming. IEEE Journal on Selected Areas in Communications. 2007, 25(9): p.1655-1667.
[81] E. Rouayheb, S. Y. Georghiades and C. N. Sprintson. A. Network coding in minimal multicast networks. PuntadelEste, Uruguay: IEEEComputer Society, 2006. 5
[82] Chekuri. C, Fragouli. C and Soljanin. E. On average throughput and alphabet size in network coding. Adelaide, SA, Australia: IEEE Computer Society, 2005. p.1593-1597.
[83] Koetter. R and Medard. M. Beyond routing: an algebraic approach to network coding. New York, NY, USA: Computer Society, vol.1, 2002. p.122-130.
[84] Lee. A. H and Medard. M. Simplified random network codes for multicast networks. International Symposium on International Symposium on Information Theory (ISIT2005). 2005. p. 1725-1729.
[85] Fragouli. C and Soljanin. E. Subtree decomposition for network coding. Chicago, IL, USA: IEEE Computer Society, 2004. p.145-152.
[86] Yunnan. W, Kamal. J and Sun-Yuan, K. A unification of network coding and tree-packing (routing) theorems. IEEE Transactions on Information Theory. 2006, 52(6): p. 2398-2409.
[87] Wu. Y, Chou. P. A and Jain. K. A comparison of network coding and tree packing. Chicago, IL, USA: IEEE Computer Society, 2004. p.143-154.
[88] Jianlong. T and Medard. M. Secure Network Coding with a Cost Criterion. In 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks 2006. IEEE Computer Society. 2006. p.171-176.
[89] Bollobas. B. Graph Theory: An Introduction Course. New York: Springer-verlag, 1979.
[90]越民义.最优化理论与应用西安:西安电子科技大学出版社, 1994.
[91] Waxman. B. M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications. 1988.
[92] Sagduyu. Y. E and Ephremides. A. On Network Coding for Stable Multicast Communication. Ephremides. In proceeding of MILCOM 2007. IEEE Society: 2007. p.1-7.
[93] Tang. Y, Sun. L, Zhang. M, et al. On deployment of overlay network for live video streaming. Kos, Greece: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, 2006. p. 1331-1334.
[94] Igarashi. D, Tsuchiya. T and Kikuno. T. Overlay network topologies for gossip-based multicast. Fukuoka, Japan: IEEE Computer Society, Vol. 1, 2005. p. 2-7.
[95] Banerjee. S, Bhattacharjee. B and Kommareddy. C. Scalable application layer multicast. Pittsburgh, PA, USA: ACM, vol. 32, 2002. 205-217.
[96] Schoder. D and Fischbach. K. Peer-to-peer paradigm. Big Island, HI, USA: IEEE Computer Society, 2004. 1. p.173-182
[97] Mao. Y, Yafei. D and Jing. T. Analyzing peer-to-peer traffic's impact on large scale networks. Reading, UK: Springer-Verlag, 2006. p.412-419.
[98] Rong. L and Burnett. I. BitTorrent in a dynamic resource adapting peer-to-peer network. Florence, Italy: IEEE Computer Society, 2006. p. 1862-1868
[99] Krishnan. R, Smith. M. D, Zhulei. T, el tal. The impact of free-riding on peer-to-peer networks. Big Island, HI, USA: IEEE Computer Society. 2004. 10 p. 1903-1907
[100] Kothapalli. K and Scheideler. C. Supervised peer-to-peer systems. Las Vegas, NV, USA: IEEE Computer Society, 2006. p. 891-897
[101] Dah. M. Chiu, Raymond. W. Y and Huang. J. Q. Can network coding help P2P? In: 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks: April ,2006. 1-5.
[102] Alouf. S, Dandoush. A and Nain. P. Performance analysis of peer-to-peer storage systems. Ottawa, ON, Canada: Springer Verlag, Heidelberg, D-69121, Germany, vol. 4516 NCS, 2007. 642-653.
[103] Silvey. P and Hurwitz. L. Adapting peer-to-peer topologies to improve system performance. BigIsland, HI, United States: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, vol. 37, 2004. 3117-3126.
[104] Kannan. V. [Online]: http://www.isi.edu/nsnam/ns/2002.
[105] K. Eger, T. H, A. Binzenh?fer, et al. Efficient Simulation of Large-Scale P2P Networks: Packet-level vs. Flow-level Simulations. In 2nd Workshop on the Use of P2P, GRID and Agents for the Development of Content Networks (UPGRADE-CN'07) in conjunction with IEEE HPDC. Monterey Bay, USA: June, 2007.
[2] Lin. C. R and Chao. S. W. Multicast routing protocol for multihop wireless networks. RiodeJaneiro, Braz: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ, USA, vol. 1 (A), 1999. p.235-239.
[3] Trossen. D. On receiver-driven congestion control for multicast streaming delivery. in. Orlando, FL: Institute of Electrical and Electronics Engineers Inc., vol. 2, 2001. p.1905-1910.
[4] Lau. L. C. Packing Steiner forests. Berlin, Germany: Springer Verlag, Heidelberg, D-69121, Germany, vol. 3509, 2005. p.362-376.
[5] Cheriyan. J and Salavatipour. M. R. Packing element-disjoint steiner trees. ACM Transactions on Algorithms. 2007, 3(4): 1290684.
[6] Ratnakar. N. Traskov. D and Koetter. R. Approaches to network coding for multiple unicasts. Zurich, Switzerland: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, vol. 2006, 2006. p.70-73.
[7] Wan. Z. W, Kadoch. M and Elhakeem. A. Optimizing the performance of tree-based reliable multicast. Computers and Electrical Engineering. 2006, 32(5): p.394-410.
[8] Gao. H, Papka. M. E and Stevens. R. L. Performance metrics of IP multicast sessions. Irvine, CA, United States: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, vol. 2005, 2005. p.183-192.
[9] Ahlswede. R, Ning. C, Li. S.-Y. R. et al. Network information flow. IEEE Transactions on Information Theory. 2000, 46(4): p.1204-1216.
[10] Agarwal. A and Charikar. M. On the advantage of network coding for improving network throughput. San Antonio, TX, USA: IEEE CS, 2004. p.247-249.
[11] D. Lun, N. R, R. Koetter, et al. Achieving minimum-cost multicast: A decentralized approach based on network coding. In Proceedings of IEEE INFOCOM: 2005.
[12] Bhadra.S and Gupta.P. Min-cost Selfish Multicast with Network Coding. In 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc andWireless Networks: 2006
[13] Servetto.S.D and B. J. A coding theorem for network information flow with correlated sources. In Proceeding of IEEE International Symposium on Information Theory (ISIT): 2005.
[14] Gkantsidis. C and Rodriguez. P. R. Network coding for large scale content distribution. Miami, FL, USA: IEEE CS, vol. 4, 2005. p.2235-2245.
[15] Jingyao. Z and Pingyi. F. On network coding in wireless ad-hoc networks. Guangzhou, China: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, vol. 2005, 2005. 1627968.
[16] Xu. C, Xu. Y, Zhan. C, et al. On network coding based multirate video streaming in directed networks. New Orleans, LA, United States: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, 2007. p.332-339.
[17] Chi. K, Yang. C and Wang. X. Performance of network coding based multicast. IEE Proceedings-Communications. 2006, 153(3): p.399-404.
[18] Jin Zhao, F. Y., Qian Zhang,Zhensheng Zhang and Fuyan Zhang. LION: layered overlay multicast with network coding. IEEE Transactions on Multimedia. 2006.
[19] Li, S. Y. R., Yeung, R. W. On convolutional network coding. in. Seattle, WA, USA: IEEE, 2006. p.1743-1747.
[20] Li, S. Y. R., Yeung, R. W., Ning, C. Linear network coding. IEEE Transactions on Information Theory. 2003, 49(2): p.371-381.
[21] P. Sanders, S. E. a. L. T. Polynomial time algorithms for network information flow. in: In Proc. 15th ACM Symposium on Parallel Algorithms and Architectures: 2003.
[22] Deb. S, Medard. M and Choute. C. On random network coding based information dissemination. Adelaide, SA, Australia: IEEE Computer Society, 2005. p. 278-282.
[23] Mea. W and Baochun. L. Network coding in live peer-to-peer streaming. IEEE Transactions on Multimedia. 2007, 9(8): p.1554-1567.
[24] Liu. Y, Dou. W, Peng. Y, et al. Network coding for peer-to-peer live media streaming. Hunan, China: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, 2006. p.149-155.
[25] Chou. P. A and Wu. Y. Network coding for the internet and wireless networks. IEEE Signal Processing Magazine. 2007, 24(5): p.177-185.
[26] Medard. M. Network coding in wireless networks. New York, NY, United States: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, vol. 2005.
[27] Bhattad. K, Ratnakar. N and Koetter. R., Narayanan, K. R. Minimal network coding for multicast. in. Adelaide, SA, Australia: IEEE Computer Society, 2005. p.1730-1734.
[28] Langberg. M, Sprintson. A and Bruck. J. The encoding complexity of network coding. IEEE Transactions on Information Theory. 2006, 52(6): p.2386-2397.
[29] Wang. M and Baochun. L. How practical is network coding? New Haven, CT, USA: IEEE Computer Society, 2006. p.274-278.
[30] Ning. C and Yeung, R. W. Secure network coding. Lausanne, Switzerland: IEEE Computer Society, 2002. p.323-331.
[31] Oliveira. P. F and Barros. J. Network coding protocols for secret key distribution. Vilamoura, Portugal: Springer Verlag, Heidelberg, D-69121, Germany, vol. 4804 NCS, 2007. p.1718-1733.
[32] Zhang. Z, Yan. X and Balli. H. Some Key Problems in Network Error Correction Coding Theory. In Proceeding of IEEE Information Theory Workshop on Information Theory for Wireless Networks: 2007. p.1-5.
[33] Sprintson. A, Rouayheb. S and Georghiades. Robust network coding for bidirected networks. in. La Jolla, CA, USA: Computer Society, 2007. p.376-381.
[34] Campo. A. T and Grant, A. Robustness of Random Network Coding to Interfering Sources. In Proceedings of 7th Australian Communications Theory Workshop, 2006. p. 120-124.
[35] Zhang. X and Wicker. S. B. Robustness vs. Efficiency in sensor networks. in. Los Angeles, CA, United States: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, vol. 2005, 2005. p. 225-230.
[36] Sun. Y, Yang, Y and Wang. X. M. Multicast fault recovery on network coding. Journal of Xidian University. 2007, 34(1): p.122-125.
[37] Sagduyu. Y. E and Ephremides. A. Crosslayer design for distributed MAC and network coding in wireless ad hoc networks. in. Adelaide, SA, Australia: IEEE Computer Society, 2005. p. 1863-1867.
[38] Sagduyu. Y. E and Ephremides. A. On Joint MAC and Network Coding in Wireless Ad Hoc Networks. IEEE Transactions on Information Theory. 2007, 53(10): p. 3697-3713.
[39] Yunnan. W and Sun-Yuan, K. Reduced-complexity network coding for multicasting over ad hoc networks. in. Philadelphia, PA, USA: IEEE Computer Society, vol. 3, 2005. p.501-504.
[40] Cui. Y, Xue. Y and Nahrstedt. K. Optimal distributed multicast routing using network coding: theory and applications. Performance Evaluation Review. 2004, 32(2): p. 47-49.
[41] Li. Z, Li. B, Jiang. D, et al. On achieving optimal throughput with network coding. in. Miami, FL, United States: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, vol. 3, 2005. p. 2184-2194.
[42] Sidharth. J, Yuval. C and Michelle. E. Low Complexity Encoding for Network Codes. In IEEE International Symposium on Information Theory (ISIT2006), 2006. p. 40-44.
[43] Kai. C and Pingyi. F. Link decomposition of network coding. Busan, South Korea: IEEE Computer Society, 2006. 5
[44] Sagduyu.Y. E and Ephremides. A. Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks. IEEE Transactions on Information Theory. 2008, 54(2): p.554-571.
[45] Yuan. J, Li. Z, Yu. W, et al. A cross-layer optimization framework for multicast in multi-hop wireless networks. Budapest, Hungary: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, vol. 2005, 2005. p.547-554.
[46] De Clercq. J and Beck, M. Content distribution networks. Alcatel Telecommunications Review. 2003, (2): p.138-141.
[47] Das. S and Kangasharju. J. Evaluation of network impact of content distribution mechanisms. Hong Kong, China: Association for Computing Machinery, New York, NY 10036-5701, United States, vol. 152, 2006.
[48] Makki. K and Pissinou.N. The Steiner tree problem with minimum number of vertices in graphs. Proceedings of the Second Great Lakes Symposium on VLSI. 1992. p. 202-206
[49] Jain. K, Mahdian. M and Salavatipour. M. R. Packing Steiner trees. Boston, MA,United States: Association for Computing Machinery, 2003. p.266-274.
[50] Saad. M, Terlaky. T, Vannelli. A, et al. Packing trees in communication networks. in. Hong Kong, China: Springer Verlag, Heidelberg, D-69121, Germany, vol. 3828 NCS, 2005. p. 688-697.
[51] Li. Z, Li. B and Lau. L. C. On achieving maximum multicast throughput in undirected networks. IEEE Transactions on Information Theory. 2006, 52(6): p. 2467-2485.
[52] Fragouli. C, Boudec. J. Y and Widmer. J. Network coding: an instant primer. Computer Communication Review. 2006, 36(1): p.63-68.
[53] Fragouli. C and Soljanin. E. Network coding fundamentals. Foundations and Trends in Networking. 2007, 2(1): p.129-133.
[54] Handley. S. On the use of a directed acyclic graph to represent a population of computer programs. Orlando, FL, USA: IEEE, Piscataway, NJ, USA, vol. /1, 1994. p.154-159.
[55]卢开澄,卢华明.图论及其应用.北京:清华大学出版社, 1995.
[56] Koetter. R and Medard. M. An algebraic approach to network coding. IEEE/ACM Transactions on Networkings. 2003, 11(5): p.782-795.
[57] Ho. T, Medard. M, Koetter. R, et al. A random linear network coding approach to multicast. IEEE Transactions on Information Theory. 2006, 52(10): p.4413-4430.
[58] Ho. T, Koetter. R, Medard, et al. The benefits of coding over routing in a randomized setting. In Proceedings. IEEE International Symposium on Information Theory (ISIT2003). p.442-441.
[59] P. A. Chou, Y. W and K. J. Practical network codinmg. In Proceeding of 41st Annual Allerton Conference on Communicatioin, Control, and Computing: 2003.
[60] T. Noguchi, T. M and M. Yamamoto. Performance evaluation of new mulitcast architecture with network coding. In IEICE Transaction on communication: 2003.
[61] Ramamoorthy. A, Jun. S and Wesel. R. D. On the capacity of network coding for random networks. IEEE Transactions on Information Theory. 2005, 51(8): p. 2878-2885.
[62] Li. S-Y. R, Ning. C and Yeung. R. W. On theory of linear network coding. in. Adelaide, SA, Australia: Computer Society, 2005. p.273-277.
[63] T. Ho, M. M and R. K. A coding view of network capacity, recovery andmanagement. In Proceeding of the 2002 IEEE international symposium on Information theory (ISIT2002). 2002.
[64] Hamra. A, Barakat. C and Turletti. T. Network coding for wireless mesh networks: a case study. Buffalo-Niagara Falls, NY, USA: IEEE Computer Society, 2006. 9 p. 67-72
[65] Gong. Y, Jin. D and Zeng. L. An introduction to network coding. in. Beijing, China: International Society for Optical Engineering, Bellingham, WA 98227-0010, United States, vol. 5626, 2005. p.629-635.
[66] Ying. Z, Baochun. L and J. G. Multicast with network coding in application-layer overlay networks. IEEE Journal on Selected Areas in Communications. 2004.
[67] Lun. D. S, Medard. M, Koetter. R. Network coding for efficient wireless unicast. in. Zurich, Switzerland: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, vol. 2006, p.174-177.
[68] Lun. D. S, Ahmed. E, Brothers.L. R., et al. Network coding for wireless applications. Bruges, Belgium: International Society for Optical Engineering, Bellingham WA, WA 98227-0010, United States, vol. 5986, 2005.
[69] Zhang. J, Cai.K, Letaief. K. B, et al. A network coding unicast strategy for wireless multi-hop networks. Kowloon, China: Institute of Electrical and Electronics Engineers Inc., New York, NY 10016-5997, United States, 2007. p. 4224-4229.
[70] Sagduyu. Y. E and Ephremides. A. On joint MAC and network coding in wireless ad hoc networks. IEEE Transactions on Information Theory. 2007, 53(10): p. 3697-3713.
[71] Jiang. G, Ying. Z and Baochun. Li. CodedStream: Live media streaming with overlay coded multicast. In ACM conference on Multimedia computing and networking (MMCN). California: 2004.
[72] Ying. Z, J. G and Baochun Li. oEvolve: Towards evolutionary overlay topologies for high bandwidth data dissemination. IEEE Journal on Selected Areas in Communications. 2004.
[73] Nad. T. Problems with network coding in overlay networks. [Online]: http://zoo.cs.yale.edu/classes/cs490/04-05a.
[74] Katabi. D, Katti. S, Wenjun. H, et al. On practical network coding for wireless environments. Zurich, Switzerland: IEEE Computer Society, 2006. p.184-189.
[75] Wu. Y, Chou. P. A and Kung, S. Y. Minimum-energy multicast in mobile ad hoc networks using network coding. IEEE Transactions on Communications. 2005, 53(11): p.1906-1918.
[76] Chen. Y, Kishore. S and Li. J. Wireless diversity through network coding. Las Vegas, NV, United States: Institute of Electrical and Electronics Engineers Inc., New York, NY 10016-5997, United States, vol. 3, 2006. p.1681-1686.
[77] Petrovic. D, Ramchandran. K and Rabaey. J. Coding for sensor networks using untuned radios. New York, NY, United States: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, vol. 2005, 2005. p. 1093-1097.
[78] S. Katti, W. Hu, H. Rahul, et al. The importance of being opportunistic:practical network coding for wireless enviroments. In the Proceeding 43th Annual Allerton conference on communication: 2005.
[79] Anxiao. J. Network coding for joint storage and transmission with minimum cost. Seattle, WA, USA: IEEE Computer Society, 2006. p.1359-1363.
[80] Mea. W and Baochun. L. R2: Random push with random network coding in live peer-to-peer streaming. IEEE Journal on Selected Areas in Communications. 2007, 25(9): p.1655-1667.
[81] E. Rouayheb, S. Y. Georghiades and C. N. Sprintson. A. Network coding in minimal multicast networks. PuntadelEste, Uruguay: IEEEComputer Society, 2006. 5
[82] Chekuri. C, Fragouli. C and Soljanin. E. On average throughput and alphabet size in network coding. Adelaide, SA, Australia: IEEE Computer Society, 2005. p.1593-1597.
[83] Koetter. R and Medard. M. Beyond routing: an algebraic approach to network coding. New York, NY, USA: Computer Society, vol.1, 2002. p.122-130.
[84] Lee. A. H and Medard. M. Simplified random network codes for multicast networks. International Symposium on International Symposium on Information Theory (ISIT2005). 2005. p. 1725-1729.
[85] Fragouli. C and Soljanin. E. Subtree decomposition for network coding. Chicago, IL, USA: IEEE Computer Society, 2004. p.145-152.
[86] Yunnan. W, Kamal. J and Sun-Yuan, K. A unification of network coding and tree-packing (routing) theorems. IEEE Transactions on Information Theory. 2006, 52(6): p. 2398-2409.
[87] Wu. Y, Chou. P. A and Jain. K. A comparison of network coding and tree packing. Chicago, IL, USA: IEEE Computer Society, 2004. p.143-154.
[88] Jianlong. T and Medard. M. Secure Network Coding with a Cost Criterion. In 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks 2006. IEEE Computer Society. 2006. p.171-176.
[89] Bollobas. B. Graph Theory: An Introduction Course. New York: Springer-verlag, 1979.
[90]越民义.最优化理论与应用西安:西安电子科技大学出版社, 1994.
[91] Waxman. B. M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications. 1988.
[92] Sagduyu. Y. E and Ephremides. A. On Network Coding for Stable Multicast Communication. Ephremides. In proceeding of MILCOM 2007. IEEE Society: 2007. p.1-7.
[93] Tang. Y, Sun. L, Zhang. M, et al. On deployment of overlay network for live video streaming. Kos, Greece: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, 2006. p. 1331-1334.
[94] Igarashi. D, Tsuchiya. T and Kikuno. T. Overlay network topologies for gossip-based multicast. Fukuoka, Japan: IEEE Computer Society, Vol. 1, 2005. p. 2-7.
[95] Banerjee. S, Bhattacharjee. B and Kommareddy. C. Scalable application layer multicast. Pittsburgh, PA, USA: ACM, vol. 32, 2002. 205-217.
[96] Schoder. D and Fischbach. K. Peer-to-peer paradigm. Big Island, HI, USA: IEEE Computer Society, 2004. 1. p.173-182
[97] Mao. Y, Yafei. D and Jing. T. Analyzing peer-to-peer traffic's impact on large scale networks. Reading, UK: Springer-Verlag, 2006. p.412-419.
[98] Rong. L and Burnett. I. BitTorrent in a dynamic resource adapting peer-to-peer network. Florence, Italy: IEEE Computer Society, 2006. p. 1862-1868
[99] Krishnan. R, Smith. M. D, Zhulei. T, el tal. The impact of free-riding on peer-to-peer networks. Big Island, HI, USA: IEEE Computer Society. 2004. 10 p. 1903-1907
[100] Kothapalli. K and Scheideler. C. Supervised peer-to-peer systems. Las Vegas, NV, USA: IEEE Computer Society, 2006. p. 891-897
[101] Dah. M. Chiu, Raymond. W. Y and Huang. J. Q. Can network coding help P2P? In: 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks: April ,2006. 1-5.
[102] Alouf. S, Dandoush. A and Nain. P. Performance analysis of peer-to-peer storage systems. Ottawa, ON, Canada: Springer Verlag, Heidelberg, D-69121, Germany, vol. 4516 NCS, 2007. 642-653.
[103] Silvey. P and Hurwitz. L. Adapting peer-to-peer topologies to improve system performance. BigIsland, HI, United States: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, vol. 37, 2004. 3117-3126.
[104] Kannan. V. [Online]: http://www.isi.edu/nsnam/ns/2002.
[105] K. Eger, T. H, A. Binzenh?fer, et al. Efficient Simulation of Large-Scale P2P Networks: Packet-level vs. Flow-level Simulations. In 2nd Workshop on the Use of P2P, GRID and Agents for the Development of Content Networks (UPGRADE-CN'07) in conjunction with IEEE HPDC. Monterey Bay, USA: June, 2007.