基于网络编码的多播信息流研究
|
摘要
网络传输自TCP/IP协议诞生并取代原始ATM交换方式以来,数年来未有大的改动。2000年,Ahlswede、Cai和Li等人提出“网络编码”的新概念,将网络上的信息处理技术带入了新的时代,尤其对于网络多播场景,通过网络编码的方式进行信息融合后,可大幅度提高多播传输速率。网络编码技术使得多播网络传输上的研究主题由信息内容分发转变成信息容量界定。然而,在以数据包作为网络信息传输和处理载体的传统方式中,由于存在传输冗余过大、处理复杂度高和理论建模较为繁琐等问题,难以应对未来社会网络规模大、用户多和信息业务多样化等多方面的需求,势必将被以信息流作为信息承载和网络交换的基本单位这种新型方式所取代。因此,本文以信息流在多播网络的表现形式和应用方式为主题展开研究。
如今的网络信息流已不再是ATM时代狭义上的信息流,而是广义上基于网络信息论的、具有多种表现形式且难以简单用香农定理量化的信息承载方式。它具有易统计、易处理、易纠检错和低损耗的特点,更能适应未来超大规模网络通信的需求。另外在实际网络的应用中,这一概念将和其他类型的学科技术交融,如图论、排队论。
基于以上思想,本文首先分析多播网络下网络编码的本质和网络信息流的定义,然后研究信息空间的自由度、信息流的新型网络编码算法以及在实际网络系统中的应用。基于网络编码的网络信息流在理论上可以达到网络多播的传输最大流,实际中则需要结合各种理论知识建模、设计适合不同多播场景的传输机制,最终逼近理论极限。
本文的主要研究方向包括以下几个方面：
第一,基于线性空间对多播网络的信息流建模,进而基于此信息流模型对多播网络的容量进行分析,并通过与最优路由算法下的多播传输进行各方面性能比较,展示网络编码给多播网络带来的增益和优势。然后,通过对网络编码的各种算法进行比较总结,提出以网络信息流为处理对象的新型网络编码算法,即混洗网络编码。该算法可有效降低编码和解码的复杂度。
第二,结合图论,将混播交换上的阻塞问题转化为基于信息流的改进冲突图(Enhanced Conflict Graph)上的着色问题,分析网络编码解决此类问题的原理并推出结合范德蒙矩阵而形成的半随机网络编码方式,弥补以往在换结点(本文以网络交换机为例)上运用网络编码技术的缺陷,使编码复杂度大幅度降低。
第三,分析应用网络编码技术的交换机所对应的基于帧的改进冲突图,通过提取信息流和分析信息流内网络编码的实质,揭示原有调度算法无法高效支持网络编码算法的实质,从而提出编码驱动的交换机调度算法,增加信息流内网络编码的机会,达到进一步提升交换吞吐率的目的。
第四,在多感知中继这一协同通信模式下,应对无线媒介容易信息丢失后冗余重传这一问题,对通过不同感知信道的信息划分得到网络信息流并建模；提出基于无线信道的信息流熵估计机制,和缓存编码算法的编码感知传输协议,从而有效减少冗余,显著地提高了频谱利用率。
通过对多播信息流流的建模和理论分析,本文验证网络编码对网络传输改进的有效性,然后对各类应用场景建模,基于网络编码的思想进行信息流建模并设计传输机制,显著地提高了实际网络的传输速率和处理效率。基于理论分析,本文还分别引用实验数据对所提的算法机制进行了验证。理论分析和实验结果同时表明,采用信息流建模的方式对多播任务设计调度算法和传输协议,更有利于网络编码在实际网络的融合,进一步减少传输中信息冗余度,提高传输效率。
Since the ATM switching was placed by packet switching in TCP/IP protocols, there are rarely major revisions on transmission protocols for several decades. However, the situation has been changed by introducing a new technology called as network coding, which are presented by Ahlswede et al.. It brought a new age for information theory. With network coding, information can be distributed after integration in multicast scenarios, which noticeably increases transmission rates. With the leverage of network coding in multicasts, the subject of transmission is not how to distribute the information, but the capacity of network information flow. In the traditional schemes, information is delivered and processed in packets, which brings burdens due to redundancies, computing and modeling complexity. The burdens become huge when the network scale grows with large group of clients and the corresponding growing requirements on services. One of the approaches to lower the burdens is to transmit and process information by flow. As the main motivation of my research work, the questions rise about how to represent information flows and how to apply them.
Network information flow in this thesis is not the information flow defined for ATM switching. Based on network information theory, it can be formed as multiple specifications in different functions, like vector for coding, such that the entropy of the flow is hardly defined by Shannon's theory. However, it is much simpler to measure, process and correct in big scaled network with much lower cost than packet switching. To apply information flow in real network, we should further consider the leverage with other theory, such as graph theory and queue theory.
With the aforementioned conceptions, the thesis first presents the definition of network information flow and the core idea of network coding. I also discuss a new metric, which is called the degree of freedom, to measure the dimension of information flow field. Based on flows, I explored new approaches applying network coding to be compatitable with different multicast scenarios, as well as the corresponding revisions on transmission protocols. In theory, network coding can assists multicast transmissions to achieve their maximum flow, which are the upper-bounds of transmission rates. However, in practice, the upper-bounds are hard to achieve without specially designed transmission schemes, which are referred by theoretical results. The research interests and the corresponding contributions of this thesis are list as follows.
First, I establish a linear space model for information flows and explain the maximum flow in multicast networks based on the model. Furthermore, I analyze the capacity of multicast networks, and show the advantages to apply network coding in multicast networks by comparing with the optimal results by fractional routing in traditional protocols. After the illustrations of various coding algorithms for network coding, I present a novel coding algorithm to employ flow as the coding unit and shuffle them for coding, which lowers the complexity for both encoding and decoding.
Second, I studied the Head of Line blocking problem in network multicast switches and deduce the problem as the graph coloring problem. The function of network coding in multicast switches is presented as well as the proof on its promising enhancement. I further propose a new coding algorithm based on Vandermond matrices, which can lower the requirements of coding processes on switch buffer as well as the complexity.
Third, based on the theoretical results in my second contribution, I further analyze the gap between theory and practice when applying network coding in frame-based multicast switches. To assist network coding in switches, I propose a so-called Coding-Driven scheduling algorithm instead of traditional scheduling policies, and enhance performances of switches with network coding.
Fourth, under the mode of cognitive relay with multiple assistants,I aim to handle the lost information when propagating through wireless medium. With the character of wireless broadcasting in the spectrum, the information flows go through different sensing channels synchronically. A further estimation on the entropy of end-to-end information flows is made in the model according to CSI (Channel State Information). Accordingly, with network coding, I propose a so-called CodeAssist relay protocol, which can decrease the redundancy of relay and enhance the efficiency to use the spectrum.
According to analysis on network properties, the promise of network coding on network transmission is given in this thesis. By establishing universal models in different applications, I analyze the properties of information flows and revise the correlated transmission schemes to enhance the efficiency. I also support the information flow theory by empirical results. It is demonstrated in both theoretical and empirical phases that, to model and design transmission protocols for network multicast missions with integrated information flows will benefit the leverage of network coding in practice. It will definitely decrease the redundancies in transmissions and enhance the transmission efficiency.
如今的网络信息流已不再是ATM时代狭义上的信息流,而是广义上基于网络信息论的、具有多种表现形式且难以简单用香农定理量化的信息承载方式。它具有易统计、易处理、易纠检错和低损耗的特点,更能适应未来超大规模网络通信的需求。另外在实际网络的应用中,这一概念将和其他类型的学科技术交融,如图论、排队论。
基于以上思想,本文首先分析多播网络下网络编码的本质和网络信息流的定义,然后研究信息空间的自由度、信息流的新型网络编码算法以及在实际网络系统中的应用。基于网络编码的网络信息流在理论上可以达到网络多播的传输最大流,实际中则需要结合各种理论知识建模、设计适合不同多播场景的传输机制,最终逼近理论极限。
本文的主要研究方向包括以下几个方面：
第一,基于线性空间对多播网络的信息流建模,进而基于此信息流模型对多播网络的容量进行分析,并通过与最优路由算法下的多播传输进行各方面性能比较,展示网络编码给多播网络带来的增益和优势。然后,通过对网络编码的各种算法进行比较总结,提出以网络信息流为处理对象的新型网络编码算法,即混洗网络编码。该算法可有效降低编码和解码的复杂度。
第二,结合图论,将混播交换上的阻塞问题转化为基于信息流的改进冲突图(Enhanced Conflict Graph)上的着色问题,分析网络编码解决此类问题的原理并推出结合范德蒙矩阵而形成的半随机网络编码方式,弥补以往在换结点(本文以网络交换机为例)上运用网络编码技术的缺陷,使编码复杂度大幅度降低。
第三,分析应用网络编码技术的交换机所对应的基于帧的改进冲突图,通过提取信息流和分析信息流内网络编码的实质,揭示原有调度算法无法高效支持网络编码算法的实质,从而提出编码驱动的交换机调度算法,增加信息流内网络编码的机会,达到进一步提升交换吞吐率的目的。
第四,在多感知中继这一协同通信模式下,应对无线媒介容易信息丢失后冗余重传这一问题,对通过不同感知信道的信息划分得到网络信息流并建模；提出基于无线信道的信息流熵估计机制,和缓存编码算法的编码感知传输协议,从而有效减少冗余,显著地提高了频谱利用率。
通过对多播信息流流的建模和理论分析,本文验证网络编码对网络传输改进的有效性,然后对各类应用场景建模,基于网络编码的思想进行信息流建模并设计传输机制,显著地提高了实际网络的传输速率和处理效率。基于理论分析,本文还分别引用实验数据对所提的算法机制进行了验证。理论分析和实验结果同时表明,采用信息流建模的方式对多播任务设计调度算法和传输协议,更有利于网络编码在实际网络的融合,进一步减少传输中信息冗余度,提高传输效率。
Since the ATM switching was placed by packet switching in TCP/IP protocols, there are rarely major revisions on transmission protocols for several decades. However, the situation has been changed by introducing a new technology called as network coding, which are presented by Ahlswede et al.. It brought a new age for information theory. With network coding, information can be distributed after integration in multicast scenarios, which noticeably increases transmission rates. With the leverage of network coding in multicasts, the subject of transmission is not how to distribute the information, but the capacity of network information flow. In the traditional schemes, information is delivered and processed in packets, which brings burdens due to redundancies, computing and modeling complexity. The burdens become huge when the network scale grows with large group of clients and the corresponding growing requirements on services. One of the approaches to lower the burdens is to transmit and process information by flow. As the main motivation of my research work, the questions rise about how to represent information flows and how to apply them.
Network information flow in this thesis is not the information flow defined for ATM switching. Based on network information theory, it can be formed as multiple specifications in different functions, like vector for coding, such that the entropy of the flow is hardly defined by Shannon's theory. However, it is much simpler to measure, process and correct in big scaled network with much lower cost than packet switching. To apply information flow in real network, we should further consider the leverage with other theory, such as graph theory and queue theory.
With the aforementioned conceptions, the thesis first presents the definition of network information flow and the core idea of network coding. I also discuss a new metric, which is called the degree of freedom, to measure the dimension of information flow field. Based on flows, I explored new approaches applying network coding to be compatitable with different multicast scenarios, as well as the corresponding revisions on transmission protocols. In theory, network coding can assists multicast transmissions to achieve their maximum flow, which are the upper-bounds of transmission rates. However, in practice, the upper-bounds are hard to achieve without specially designed transmission schemes, which are referred by theoretical results. The research interests and the corresponding contributions of this thesis are list as follows.
First, I establish a linear space model for information flows and explain the maximum flow in multicast networks based on the model. Furthermore, I analyze the capacity of multicast networks, and show the advantages to apply network coding in multicast networks by comparing with the optimal results by fractional routing in traditional protocols. After the illustrations of various coding algorithms for network coding, I present a novel coding algorithm to employ flow as the coding unit and shuffle them for coding, which lowers the complexity for both encoding and decoding.
Second, I studied the Head of Line blocking problem in network multicast switches and deduce the problem as the graph coloring problem. The function of network coding in multicast switches is presented as well as the proof on its promising enhancement. I further propose a new coding algorithm based on Vandermond matrices, which can lower the requirements of coding processes on switch buffer as well as the complexity.
Third, based on the theoretical results in my second contribution, I further analyze the gap between theory and practice when applying network coding in frame-based multicast switches. To assist network coding in switches, I propose a so-called Coding-Driven scheduling algorithm instead of traditional scheduling policies, and enhance performances of switches with network coding.
Fourth, under the mode of cognitive relay with multiple assistants,I aim to handle the lost information when propagating through wireless medium. With the character of wireless broadcasting in the spectrum, the information flows go through different sensing channels synchronically. A further estimation on the entropy of end-to-end information flows is made in the model according to CSI (Channel State Information). Accordingly, with network coding, I propose a so-called CodeAssist relay protocol, which can decrease the redundancy of relay and enhance the efficiency to use the spectrum.
According to analysis on network properties, the promise of network coding on network transmission is given in this thesis. By establishing universal models in different applications, I analyze the properties of information flows and revise the correlated transmission schemes to enhance the efficiency. I also support the information flow theory by empirical results. It is demonstrated in both theoretical and empirical phases that, to model and design transmission protocols for network multicast missions with integrated information flows will benefit the leverage of network coding in practice. It will definitely decrease the redundancies in transmissions and enhance the transmission efficiency.
引文
[1]Shannon C. A mathematical theory of communication. Bell System Technical Journal, July and October 1948,27:379-423 and 623-656.
[2]Ahlswede R, Cai N, Li S R andYeung R W. Network information flow. IEEE Trans. Information Theory, July 2000,46(4):1204-1216
[3]Li S R, Yueng R W and Cai N. Linear network coding. IEEE Trans. Information Theory, Feb.2003,49(2):371-381
[4]Ford L and Fulkerson D. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
[5]Elias P, Feinstein A, and Shannon C E, A Note on The Maximum Flow Through A Network [J]. IRE Trans. Information Theory, Dec.1956,4(2):117-119.
[6]Gupta P and Kumar P R, The Capacity of Wireless Networks. IEEE Trans. Information Theory, Feb.2000,46(2):388-404.
[7]Xie L L and Kummer P R, A Network Information Theory for Wireless Communication:Scaling Low and Optimal Operation. IEEE Trans. Information Theory, May 2004,50(5):748-767.
[8]Grossglauser M and Tse D N C. Mobility Increases the Capacity of Ad hoc Wireless Networks. IEEE/ACM Trans, on Networking, April 2002,10(4):477-486.
[9]Cover T and Thomas J, Elements of Information Theory, New York:Wiley,1991.
[10]Gamal A E and Kim Y. Lecture Notes on Network Information Theory. Available on http://circuit.ucsd.edu/yhk/.
[11]Slepian D and Wolf J K. Noiseless coding of correlated information sources. IEEE Trans. Information Theory, July 1973,19(7):471-480.
[12]Wyner A and Ziv J. The rate-distortion function for source coding with side information at the decoder. IEEE Trans. Information Theory, January 1976,22(1): 1-10.
[13]Berger T. Multiterminal source coding. The Information Theory Approach to Communications, G. Longo, Ed., New York:Springer-Verlag,1977.
[14]Berger T, Zhang Z and Viswanathan H. The CEO problem. IEEE Trans. Information Theory, May 1996,42(5):887-902.
[15]Ozarow L. On a source-coding problem with two channels and three receivers. Bell System Technical Journal, December 1980,59(12):1909-1921.
[16]Gelfand S and Pinsker M. Coding for channel with random parameters. Proceeding on Control and Information Theory,1980,9:19-31.
[17]Costa M. Writing on dirty paper. IEEE Trans. Information Theory, May 1983,29(5) 439-441.
[18]Cover T. Broadcast channels. IEEE Trans. Information Theory, January 1972,18(1): 2-14.
[19]Caire G and Shamai S. On the achievable throughput of a multi-antenna Gaussian broadcast channel. IEEE Trans. Information Theory, July 2003,49(7):1691-1706.
[20]Liao H. Multiple access channels. Ph.D. Thesis, Dept. of EE, University of Hawaii, Honolulu,1972.
[21]Cover T and Gamal A E. Capacity Theorems for the Relay Channel. IEEE Trans. Information Theory, September 1979,25(9):572-584.
[22]Korner J and Marton K. How to encode the modulo-two sum of binary sources. IEEE Trans. Information Theory, March 1979,25(3):219-221.
[23]Krithivasan D and Pradhan S S. Lattices for distributed source coding:jointly Gaussian sources and reconstruction of a linear function. IEEE Trans. Information Theory, December 2009,55(12):5628-5651.
[24]Nazer B and Gastpar M. Compute-and-forward:Harnessing interference through structured codes. Submitted to IEEE Trans. Information Theory, August 2009.
[25]Wagner A. On distributed compression of linear functions. IEEE Trans. Information Theory, January 2011, vol.57(1):79-94.
[26]Yang Y and Xiong Z. An improved lattice-based scheme for lossy distributed compression of linear functions. Proc. ITA'11, San Diego, CA, February 2011.
[27]Dougherty R, Freiling C and Zeger K. Networks, matroids, and non-Shannon information inequalities. IEEETrans. Information Theory, June2007,53(6): 1949-1969.
[28]Chekuri C, Fragouli C and Soljanin E. On Average Throughput and Alphabet Size in Network Coding. IEEE Trans. Information Theory, June 2006,52(6):2410-2424.
[29]Wu Y, Chou P A and Jain K. A comparison of network coding and tree packing. ISIT, Chicago, June 27th-July 2nd,2004
[30]Li Z and Li B. Network coding in undirected networks. CISS 2004,257-262. March, 2004.
[31]Li S R, Cai N and Yeung R W. On theory of linear network coding. ISIT 2005, Australia.
[32]Yeung R W, Li S R and Cai N, et al.. Network Coding Theory. Now Publishers.
[33]Lun D S, Medard M and Effros M. On coding for reliable communication over packet networks. Proceeding of 42nd Annual Allerton Conference on Communication, Control, and Computing, September-October 2004.
[34]Pakzad P, Fragouli C and Shokrollahi A. On low complexity coding for line networks. ISIT, Australia, Sept.2005.
[35]Wu Y, Chou P A and Kung S Y. Information exchange in wireless networks with network coding and physical-layer broadcast. Technical Report MSR-TR-2004-78, Microsoft Research,2004.
[36]Katti S, Katabi D, Hu W, et al.. The importance of being opportunistic:Practica network coding for wireless environments. In Proc.43rd Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sep.2005.
[37]Widmer J, Fragouli C and LeBoudec J Y. Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding. Proceedings of Workshop on Network Coding, Theory, and Applications, Apr.2005.
[38]Fragouli C, Widmer J and LeBoudec J Y. A network coding approach to energy efficient broadcasting:from theory to practice. INFOCOM,2006.
[39]Widmer J and LeBoudec J Y. Network coding for efficient communication in extreme networks. Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking,2005.
[40]Wu Y, Chou P A and Kung S Y. Minimum-energy multicast in mobile ad hoc networks using network coding. IEEE Trans. Communications,2005,53(11): 1906-1918.
[41]Wu Y, Chou P A and Kung S Y. Minimum-energy multicast in mobile ad hoc networks using network coding. Proceedings of IEEE Information Theory Workshop, 2004,304-309.
[42]Katti S, Rahul H and Hu W, et al.. XORs in the Air:Practical Wireless Network Coding. ACM SIGCOMM, Pisa,2006.
[43]Hamra A A, Barakat C and Turletti T. Network coding for wireless mesh networks: A case study. Proceedings of 7th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, June 26-29,2006.
[44]Noguchi T, Matsuda T and Yamamoto M. Performance evaluation of new multicast architecture with network coding. IEICE Trans. Communication,2003, E86-B(6): 1788-1795.
[45]Koetter R and Medard M. An algebraic approach to network coding. IEEE Trans. Networking, Oct.2003,11(5):782-795.
[46]Koetter R and Medard M. Beyond routing:an algebraic approach to network coding. INFOCOM 2002,2002.
[47]Sanders P, Egner S and Tolhuizen L. Polynomial time algorithms for network information flow. Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures,2003.
[48]Jaggi S, Sanders P, Chou P A, et al.. Polynomial time algorithms for multicast network code construction. IEEE Trans. Information Theory,2005,51 (6):1973-1982.
[49]Ho T, Medard M, Koetter R, Karger D R, Effros M, Shi J and Leong B. A random linear network coding approach to multicast. IEEE Trans, on Information Theory, Oct. 2006,52(10):4413-4430.
[50]Ho T, Koetter R, Medard M, Karger D, and Effros M. The benefits of coding over routing in a randomized setting. ISIT, Yokohama, Japan, Jun.2003:442-447.
[51]Chachulski S, Jennings M, Katti S, and Katabi D, Trading structure for randomness in wireless opportunistic routing. ACM SIGCOMM, Kyoto, Japan, Aug.2007:169-180.
[52]Bhattad K, Ratnakar N, Koetter R, et al.. Minimal Network Coding for Multicast. ISIT 2005,2005.
[53]Lun D S, Ratnakar N, Medard M, et al.. Minimum-cost multicast over coded packet networks. IEEE Trans. Information Theory,2006,52(6):2608-2623.
[54]Lee A, Medard M, Haigh K Z, et al.. Minimum-Cost Subgraphs for Joint Distributed Source and Network Coding. Proceedings of Workshop on Network Coding, Theory and Applications (NetCod). San Diego, California. January 29,2007.
[55]Cai N and Yeung R W. Network coding and error correction. Proceedings of the 2002 IEEE Information Theory Workshop,2002,119-122.
[56]Yeung R W and Cai N. Network error correction, part I:Basic concepts and upper bounds. Communications in Information and Systems,2006,6(1):19-36.
[57]Cai N and Yeung R W. Network error correction, part II:Lower bounds. Communications in Information and Systems,2006,6(1):37-54.
[58]Yang S, Ngai C K and Yeung R W. Construction of Linear Network Codes that Achieve a Refined Singleton Bound. ISIT, June 2007.
[59]Yang S and Yeung R W. Refined Coding Bounds for Network Error Correction. Proceedings of IEEE Information Theory Workshop Information Theory for Wireless Networks, July,2007.
[60]Chi K K and Wang X M. Analysis of network error correction based on network coding. IEE Proceedings on Communications,2005,152(4):393-396.
[61]Ho T, Medard M and Koetter R. A coding view of network recovery and management for single receiver communications. Proceedings of Conference on Information Science & Systems, Princeton, NJ, April 2002.
[62]Riis S. Linear versus non-linear boolean functions in network flow. Proceedings of Conference on Information Science & Systems (CISS),2004.
[63]Cai N and Yeung R W. Secure network coding. Proceedings of 2002 IEEE International Symposium on Information Theory, June 30-July 5,2002.
[64]Cai N and Yeung R W. A Security Condition for Multi-Source Linear Network Coding. ISIT, June 2007.
[65]Feldman J, Malkin T, Servedio R A, et al.. On the capacity of secure network coding. 42nd Annual Allerton Conference on Communication, Control, and Computing, September 2004.
[66]Gkantsidis C, Rodriguez P R. Cooperative security for network coding file distribution. INFOCOM,2006.
[67]Chou P A, Wu Y and Jain K. Practical network coding. Proceedings of the Annual Allerton Conference on Communication Control and Computing, Monticello, USA, Oct.2003.
[68]Widmer J and Boudec J Y L. Network coding for efficient communication in extreme networks. Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, Philadelphia, PA, August 2005.
[69]Petrovic D, Ramchandran K and Rabaey J. Overcoming untuned radios in wireless networks with network coding. IEEE Trans. Information Theory,2006,52(6): 2649-2657.
[70]Zhang S, Liew S C and Lam P P. Hot Topic:Physical-Layer Network Coding. Mobicom 2008,2008.
[71]Avalanche:File swarming with network coding. http://research.microsoft.com/pablo/avalanche.aspx.
[72]Gkantsidis C and Rodriquez P R. Network coding for large scale content distribution. INFOCOM,2005.
[73]Sundararajan J K, Medard M et al. Network coding in a Multicast Switch. INFOCOM,2007.
[74]Yang S, Wang X and Li B. Haste:Practical Online Network Coding in a Multicast Switch. INFOCOM,2010.
[75]Wang W, Yu L, Zhu G, Li H. Network Coding Driven Scheduling for Frame-based Multicast Switches, accepted by Netcod2011
[76]Sundararajan J K, Shah D, Medard M, Mitzenmacher M and Barros J. Network coding meets TCP. INFOCOM, Brazil, April 2009.
[77]Sundararajan J K, Shah D, and Medard M. On Queueing in Coded Networks-Queue Size Follows Degrees of Freedom, invited paper, Proceedings of Information Theory Workshop, July 2007.
[78]Harvey N J A, Kleinberg R D and Lehman A R. Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, http://theory. csail. mit. edu/nickh/Publications/Gaps/TR964. pdf.
[79]Li B and Niu D. Random network coding in peer-to-peer networks:From theory to practice. Journal of IEEE, March 2011,99:513-523.
[80]http://en.wikipedia.org/wiki/Degrees_of_freedom_(statistics)
[81]Xu J. Topological structure and analysis of interconnection networks. Kluwer Academic Publishers, Oct.2001
[82]Harvey N J A, Kleinberg R and Lehman A R. On the capacity of information networks. IEEE Trans. Networking,52(16), Oct.2006:2345-2364
[83]Koo J C and Gill J T. Low-complexity non-uniform demand multicast network coding problems. Proceedings of the Annual Allerton Conference on Communication Control and Computing, Monticello, IL, Sept.2009:228-235
[84]Fragouli C, Soljanin E and Shokrollahi A. Network coding as a coloring problem. CISS, Princeton, USA,2004
[85]Jain K, Mahdian M and Salavatipour M R. Packing Steiner Trees. ACM SIAM,2003.
[86]Robins G and Zelikovsky A. Improved Steiner tree approximation in graphs. Proceedings of 7th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), San Francisco, CA, Jan.2000.
[87]Cunningham W H. Optimal Attack and Reinforcement of a Network. Journal of the ACM,1985,32:549-561.
[88]Yang S, Yeung R W and Zhang Z. Weight properties of network codes. European Trans. Telecommunications,2008,19(4):371-383.
[89]Booker G and Sprintson A. Design of efficient robust network codes for multicast connections. International Symposium on Information Theory, Seoul, Korea, June 2009:991-995.
[90]Fragouli C, Boudec J L and Widmer J. Network coding:an instant primer. Computer Communication Review. ACM SIGCOMM Computer Communication Review, Jan. 2006:65-68.
[91]Langberg M, Sprintson A and Bruck J. The encoding complexity of network coding. IEEE Trans. Information Theory, June 2006,52(6):2386-2397.
[92]Wang W, Yu L. and Zhu G. A novel approach in network coding based on shuffle coding. Proceedings of International Symposium on Intelligent Signal Processing and Communication Systems, Xiamen, China, Nov,2008:8-11
[93]Shokrollahi A. Raptor codes. IEEE Trans. Information Theory, Jun.2006, vol.52(6): 2551-2567
[94]Silva D, Zeng W and Kschischang F R. Sparse network coding with overlapping classes. Proceedings of Workshop on Network Coding, Theory, and Applications (NetCod), June 2009.
[95]Kim M J, Sundararajan J K, Medard M, Eryilmaz A and Koetter R. Network Coding in a Multicast Switch. IEEE Trans. Information Theory,2011,57(1):436-460.
[96]Gandhi R, Greening B, Pemmaraju S and Raman R, Sub-coloring and Hypo-coloring Interval Graphs. in Graph-Theoretic Concepts in Computer Science. Springer,2010: 122-132.
[97]Lacan J and Fimes J. Systematic MDS Erasure Codes Based on Vandermonde Matrices. IEEE Communications Letters,2004,8(9):570-572.
[98]McKeown N, Anantharam V, and J. Walrand. Achieving 100% throughput in an input-queued switch. INFOCOM,1996.
[99]Li J. Scheduling algorithms for high speed switches. Ph.D. dissertation, New Jersey Institute of Technology, May 2001.
[100]Marsan M A, Bianco A, Giaccone P, Leonardi E and Neri F. Multicast traffic in input-queued switches:optimal scheduling and maximum throughput. IEEE/ACM Trans. Networking,2003,11(3):465-477.
[101]Agarwal M, Cho J H, Gao L and Wu J. Energy Efficient Broadcast in Wireless Ad hoc Networks with Hitch-hiking. INFOCOM,2004.
[102]Lee T. Nonblocking copy networks for multicast packet switching. IEEE Trans. Selected Areas in Communications, Dec.1988,6(9):1455-1467.
[103]Andrews M, Khanna S and Kumaran K. Integrated Scheduling of Unicast and Multicast Traffic in an Inputqueued Switch. IEEE INFOCOM,1999.
[104]Zhang X and Bhuyan L. An Efficient Scheduling Algorithm for Combined Input-crosspoint-queued (CICQ) Switches. Proceedings of IEEE GLOBECOM,2004.
[105]Bianco A, Giaccone P, Leonardi E and Neri F. A framework for differential frame-based matching algorithms in input-queued switches. INFOCOM 2004,2004.
[106]Ye T, Micheli G D and Benini L. Analysis of Power Consumption on Switch Fabrics in Network Routers. Proceedings of the 39th conference on Design automation. ACM New York, NY, USA,2002.
[107]Tartre M and Lin B. Frame-Based Multicast Switching. IEEE Communications Letters,2010,14(3):251-253.
[108]Koksal C. On the Speedup Required to Achieve 100%Throughput for Multicast Traffic over Crossbar Switches. Citeseer, Tech. Rep.,2008.
[109]Feige U and Kilian J. Zero knowledge and the chromatic number. Proceeding, Eleventh Annual IEEE Conference on Computational Complexity,1996.
[110]Sundararajan J K, Deb S and Medard M. Extending the Birkhoffvon Neumann switching strategy to sulticast switches. Proceedings of the 4th International IFIP-TC6 Networking Conference, May 2005.
[111]Lee T T. The Kraft's Inequality of Scheduling for Packet-Switched Clos Networks. Proceedings of Infocom2008,2008.
[112]Avestimehr S, Diggavi S and Tse D. Approximate capacity of Gaussian relay networks. Proceedings of ISIT2008, Toronto, Canada, July 2008.
[113]Tian C, Mohajer S and Diggavi D. Approximating the Gaussian multiple description rate region under symmetric distortion constraints. Proceedings of ISIT2008, Toronto, Canada, July 2008.
[114]Yang Y and Xiong Z. Distributed compression of linear functions:Partial sum-rate tightness and gap to optimal sum-rate. Submitted to ISIT2011, St Petersburg, Russia, July/August,2011.
[115]Akyildiz I, Lee W, Vuran M and Mohanty S. NeXt generation/dynamic spectrum access/cognitive radio wireless networks:a survey. Computer Networks,2006,50(13): 2127-2159.
[116]Stevenson C, Chouinard G, Lei Z, Hu W, Shellhammer S and Caldwell W. IEEE 802.22:The first cognitive radio wireless regional area network standard, IEEE Communication Magazine.2009,47(1):120-138.
[117]Krikidis I, Sun Z, Laneman J N and Thompson J. Cognitive legacy networks via cooperative diversity. IEEE Communication Letters,2009,13(2):106-108
[118]Zhang Q, Jia J and Zhang J. Cooperative relay to improve diversity in cognitive radio networks. IEEE Communications Magazine,2009,47(2):111-117.
[119]Simeone O, Bar-Ness Y, and Spagnolini U. Stable throughput of cognitive radios with and without relaying capability. IEEE Trans. Communications,2007,55(12): 2351-2360.
[120]Gambini J, Simeone O and Spagnolini U. Cognitive relaying and opportunistic spectrum sensing in unlicensed multiple access channels. Proceedings of IEEE ISSSTA Proceedings, Bologna, Italy, Aug.2008:371-375.
[121]Devroye N, Mitran P and Tarokh V. Limits on communications in a cognitive radio channel. IEEE Trans. Communications,2006,44(6):44-49.
[122]杨黎,王晓湘,赵堃.多天线感知无线电中的协作频谱感知算法.电子与信息学报,2009,30(10)：2338-2342.
[123]Jovicic A and Viswanath P. Cognitive radio:an information-theoretic perspective. ISIT, Seattle, USA, Jul.2006:2413-2417.
[124]Sridharan S and Vishwanath S. On the capacity of a class of MIMO cognitive radios. IEEE Journal of Selected Topics in Signal Processing,2008,2(1):103-117.
[125]Ahlswede R, Cai N, and Li.S R, et al.. Network information flow. IEEE Trans. Information Theory,2000,46(4):1204-1216.
[126]Li S R, Yueng R W, and Cai N. Linear network coding. IEEE Trans. Information Theory,2003,49(2):371-381.
[127]Chen W, Yu L, Wang W and Xiong F, Trusted network coding in wireless Ad Hoc networks. GLOBECOM, Miami, USA, Dec.2010.
[128]Umehara D, Hirano T, Denno S, Morikura M and Sugiyama T. Wireless network coding in slotted ALOHA with two-hop unbalanced traffic, IEEE Journal of Select Areas in Communications,2009,27(5):647-661.
[129]Luo W and Ephremides A. Stability of N interacting queues in random access systems. IEEE Trans. Information Theory, Jul.1999,45(5):1579-1587.
[130]Loynes R M. The Stability of a Queue with Non-independent Inter-arrival and Service Times. Mathematical Proceedings of the Cambridge Philosophical Society, 1962,58(03):497-520
[131]Zhang J and Zhang, Q. Stackelberg game for utility-based cooperative cognitive radio networks. ACM MobiHoc, New Orleans, USA, May 2009:23-32.
[132]朱佳,郑宝玉,邹玉龙.基于最佳中继选择的协作频谱感知方案研究.电子学报,2010,36(1)：92-98.
[2]Ahlswede R, Cai N, Li S R andYeung R W. Network information flow. IEEE Trans. Information Theory, July 2000,46(4):1204-1216
[3]Li S R, Yueng R W and Cai N. Linear network coding. IEEE Trans. Information Theory, Feb.2003,49(2):371-381
[4]Ford L and Fulkerson D. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
[5]Elias P, Feinstein A, and Shannon C E, A Note on The Maximum Flow Through A Network [J]. IRE Trans. Information Theory, Dec.1956,4(2):117-119.
[6]Gupta P and Kumar P R, The Capacity of Wireless Networks. IEEE Trans. Information Theory, Feb.2000,46(2):388-404.
[7]Xie L L and Kummer P R, A Network Information Theory for Wireless Communication:Scaling Low and Optimal Operation. IEEE Trans. Information Theory, May 2004,50(5):748-767.
[8]Grossglauser M and Tse D N C. Mobility Increases the Capacity of Ad hoc Wireless Networks. IEEE/ACM Trans, on Networking, April 2002,10(4):477-486.
[9]Cover T and Thomas J, Elements of Information Theory, New York:Wiley,1991.
[10]Gamal A E and Kim Y. Lecture Notes on Network Information Theory. Available on http://circuit.ucsd.edu/yhk/.
[11]Slepian D and Wolf J K. Noiseless coding of correlated information sources. IEEE Trans. Information Theory, July 1973,19(7):471-480.
[12]Wyner A and Ziv J. The rate-distortion function for source coding with side information at the decoder. IEEE Trans. Information Theory, January 1976,22(1): 1-10.
[13]Berger T. Multiterminal source coding. The Information Theory Approach to Communications, G. Longo, Ed., New York:Springer-Verlag,1977.
[14]Berger T, Zhang Z and Viswanathan H. The CEO problem. IEEE Trans. Information Theory, May 1996,42(5):887-902.
[15]Ozarow L. On a source-coding problem with two channels and three receivers. Bell System Technical Journal, December 1980,59(12):1909-1921.
[16]Gelfand S and Pinsker M. Coding for channel with random parameters. Proceeding on Control and Information Theory,1980,9:19-31.
[17]Costa M. Writing on dirty paper. IEEE Trans. Information Theory, May 1983,29(5) 439-441.
[18]Cover T. Broadcast channels. IEEE Trans. Information Theory, January 1972,18(1): 2-14.
[19]Caire G and Shamai S. On the achievable throughput of a multi-antenna Gaussian broadcast channel. IEEE Trans. Information Theory, July 2003,49(7):1691-1706.
[20]Liao H. Multiple access channels. Ph.D. Thesis, Dept. of EE, University of Hawaii, Honolulu,1972.
[21]Cover T and Gamal A E. Capacity Theorems for the Relay Channel. IEEE Trans. Information Theory, September 1979,25(9):572-584.
[22]Korner J and Marton K. How to encode the modulo-two sum of binary sources. IEEE Trans. Information Theory, March 1979,25(3):219-221.
[23]Krithivasan D and Pradhan S S. Lattices for distributed source coding:jointly Gaussian sources and reconstruction of a linear function. IEEE Trans. Information Theory, December 2009,55(12):5628-5651.
[24]Nazer B and Gastpar M. Compute-and-forward:Harnessing interference through structured codes. Submitted to IEEE Trans. Information Theory, August 2009.
[25]Wagner A. On distributed compression of linear functions. IEEE Trans. Information Theory, January 2011, vol.57(1):79-94.
[26]Yang Y and Xiong Z. An improved lattice-based scheme for lossy distributed compression of linear functions. Proc. ITA'11, San Diego, CA, February 2011.
[27]Dougherty R, Freiling C and Zeger K. Networks, matroids, and non-Shannon information inequalities. IEEETrans. Information Theory, June2007,53(6): 1949-1969.
[28]Chekuri C, Fragouli C and Soljanin E. On Average Throughput and Alphabet Size in Network Coding. IEEE Trans. Information Theory, June 2006,52(6):2410-2424.
[29]Wu Y, Chou P A and Jain K. A comparison of network coding and tree packing. ISIT, Chicago, June 27th-July 2nd,2004
[30]Li Z and Li B. Network coding in undirected networks. CISS 2004,257-262. March, 2004.
[31]Li S R, Cai N and Yeung R W. On theory of linear network coding. ISIT 2005, Australia.
[32]Yeung R W, Li S R and Cai N, et al.. Network Coding Theory. Now Publishers.
[33]Lun D S, Medard M and Effros M. On coding for reliable communication over packet networks. Proceeding of 42nd Annual Allerton Conference on Communication, Control, and Computing, September-October 2004.
[34]Pakzad P, Fragouli C and Shokrollahi A. On low complexity coding for line networks. ISIT, Australia, Sept.2005.
[35]Wu Y, Chou P A and Kung S Y. Information exchange in wireless networks with network coding and physical-layer broadcast. Technical Report MSR-TR-2004-78, Microsoft Research,2004.
[36]Katti S, Katabi D, Hu W, et al.. The importance of being opportunistic:Practica network coding for wireless environments. In Proc.43rd Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sep.2005.
[37]Widmer J, Fragouli C and LeBoudec J Y. Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding. Proceedings of Workshop on Network Coding, Theory, and Applications, Apr.2005.
[38]Fragouli C, Widmer J and LeBoudec J Y. A network coding approach to energy efficient broadcasting:from theory to practice. INFOCOM,2006.
[39]Widmer J and LeBoudec J Y. Network coding for efficient communication in extreme networks. Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking,2005.
[40]Wu Y, Chou P A and Kung S Y. Minimum-energy multicast in mobile ad hoc networks using network coding. IEEE Trans. Communications,2005,53(11): 1906-1918.
[41]Wu Y, Chou P A and Kung S Y. Minimum-energy multicast in mobile ad hoc networks using network coding. Proceedings of IEEE Information Theory Workshop, 2004,304-309.
[42]Katti S, Rahul H and Hu W, et al.. XORs in the Air:Practical Wireless Network Coding. ACM SIGCOMM, Pisa,2006.
[43]Hamra A A, Barakat C and Turletti T. Network coding for wireless mesh networks: A case study. Proceedings of 7th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, June 26-29,2006.
[44]Noguchi T, Matsuda T and Yamamoto M. Performance evaluation of new multicast architecture with network coding. IEICE Trans. Communication,2003, E86-B(6): 1788-1795.
[45]Koetter R and Medard M. An algebraic approach to network coding. IEEE Trans. Networking, Oct.2003,11(5):782-795.
[46]Koetter R and Medard M. Beyond routing:an algebraic approach to network coding. INFOCOM 2002,2002.
[47]Sanders P, Egner S and Tolhuizen L. Polynomial time algorithms for network information flow. Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures,2003.
[48]Jaggi S, Sanders P, Chou P A, et al.. Polynomial time algorithms for multicast network code construction. IEEE Trans. Information Theory,2005,51 (6):1973-1982.
[49]Ho T, Medard M, Koetter R, Karger D R, Effros M, Shi J and Leong B. A random linear network coding approach to multicast. IEEE Trans, on Information Theory, Oct. 2006,52(10):4413-4430.
[50]Ho T, Koetter R, Medard M, Karger D, and Effros M. The benefits of coding over routing in a randomized setting. ISIT, Yokohama, Japan, Jun.2003:442-447.
[51]Chachulski S, Jennings M, Katti S, and Katabi D, Trading structure for randomness in wireless opportunistic routing. ACM SIGCOMM, Kyoto, Japan, Aug.2007:169-180.
[52]Bhattad K, Ratnakar N, Koetter R, et al.. Minimal Network Coding for Multicast. ISIT 2005,2005.
[53]Lun D S, Ratnakar N, Medard M, et al.. Minimum-cost multicast over coded packet networks. IEEE Trans. Information Theory,2006,52(6):2608-2623.
[54]Lee A, Medard M, Haigh K Z, et al.. Minimum-Cost Subgraphs for Joint Distributed Source and Network Coding. Proceedings of Workshop on Network Coding, Theory and Applications (NetCod). San Diego, California. January 29,2007.
[55]Cai N and Yeung R W. Network coding and error correction. Proceedings of the 2002 IEEE Information Theory Workshop,2002,119-122.
[56]Yeung R W and Cai N. Network error correction, part I:Basic concepts and upper bounds. Communications in Information and Systems,2006,6(1):19-36.
[57]Cai N and Yeung R W. Network error correction, part II:Lower bounds. Communications in Information and Systems,2006,6(1):37-54.
[58]Yang S, Ngai C K and Yeung R W. Construction of Linear Network Codes that Achieve a Refined Singleton Bound. ISIT, June 2007.
[59]Yang S and Yeung R W. Refined Coding Bounds for Network Error Correction. Proceedings of IEEE Information Theory Workshop Information Theory for Wireless Networks, July,2007.
[60]Chi K K and Wang X M. Analysis of network error correction based on network coding. IEE Proceedings on Communications,2005,152(4):393-396.
[61]Ho T, Medard M and Koetter R. A coding view of network recovery and management for single receiver communications. Proceedings of Conference on Information Science & Systems, Princeton, NJ, April 2002.
[62]Riis S. Linear versus non-linear boolean functions in network flow. Proceedings of Conference on Information Science & Systems (CISS),2004.
[63]Cai N and Yeung R W. Secure network coding. Proceedings of 2002 IEEE International Symposium on Information Theory, June 30-July 5,2002.
[64]Cai N and Yeung R W. A Security Condition for Multi-Source Linear Network Coding. ISIT, June 2007.
[65]Feldman J, Malkin T, Servedio R A, et al.. On the capacity of secure network coding. 42nd Annual Allerton Conference on Communication, Control, and Computing, September 2004.
[66]Gkantsidis C, Rodriguez P R. Cooperative security for network coding file distribution. INFOCOM,2006.
[67]Chou P A, Wu Y and Jain K. Practical network coding. Proceedings of the Annual Allerton Conference on Communication Control and Computing, Monticello, USA, Oct.2003.
[68]Widmer J and Boudec J Y L. Network coding for efficient communication in extreme networks. Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, Philadelphia, PA, August 2005.
[69]Petrovic D, Ramchandran K and Rabaey J. Overcoming untuned radios in wireless networks with network coding. IEEE Trans. Information Theory,2006,52(6): 2649-2657.
[70]Zhang S, Liew S C and Lam P P. Hot Topic:Physical-Layer Network Coding. Mobicom 2008,2008.
[71]Avalanche:File swarming with network coding. http://research.microsoft.com/pablo/avalanche.aspx.
[72]Gkantsidis C and Rodriquez P R. Network coding for large scale content distribution. INFOCOM,2005.
[73]Sundararajan J K, Medard M et al. Network coding in a Multicast Switch. INFOCOM,2007.
[74]Yang S, Wang X and Li B. Haste:Practical Online Network Coding in a Multicast Switch. INFOCOM,2010.
[75]Wang W, Yu L, Zhu G, Li H. Network Coding Driven Scheduling for Frame-based Multicast Switches, accepted by Netcod2011
[76]Sundararajan J K, Shah D, Medard M, Mitzenmacher M and Barros J. Network coding meets TCP. INFOCOM, Brazil, April 2009.
[77]Sundararajan J K, Shah D, and Medard M. On Queueing in Coded Networks-Queue Size Follows Degrees of Freedom, invited paper, Proceedings of Information Theory Workshop, July 2007.
[78]Harvey N J A, Kleinberg R D and Lehman A R. Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, http://theory. csail. mit. edu/nickh/Publications/Gaps/TR964. pdf.
[79]Li B and Niu D. Random network coding in peer-to-peer networks:From theory to practice. Journal of IEEE, March 2011,99:513-523.
[80]http://en.wikipedia.org/wiki/Degrees_of_freedom_(statistics)
[81]Xu J. Topological structure and analysis of interconnection networks. Kluwer Academic Publishers, Oct.2001
[82]Harvey N J A, Kleinberg R and Lehman A R. On the capacity of information networks. IEEE Trans. Networking,52(16), Oct.2006:2345-2364
[83]Koo J C and Gill J T. Low-complexity non-uniform demand multicast network coding problems. Proceedings of the Annual Allerton Conference on Communication Control and Computing, Monticello, IL, Sept.2009:228-235
[84]Fragouli C, Soljanin E and Shokrollahi A. Network coding as a coloring problem. CISS, Princeton, USA,2004
[85]Jain K, Mahdian M and Salavatipour M R. Packing Steiner Trees. ACM SIAM,2003.
[86]Robins G and Zelikovsky A. Improved Steiner tree approximation in graphs. Proceedings of 7th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), San Francisco, CA, Jan.2000.
[87]Cunningham W H. Optimal Attack and Reinforcement of a Network. Journal of the ACM,1985,32:549-561.
[88]Yang S, Yeung R W and Zhang Z. Weight properties of network codes. European Trans. Telecommunications,2008,19(4):371-383.
[89]Booker G and Sprintson A. Design of efficient robust network codes for multicast connections. International Symposium on Information Theory, Seoul, Korea, June 2009:991-995.
[90]Fragouli C, Boudec J L and Widmer J. Network coding:an instant primer. Computer Communication Review. ACM SIGCOMM Computer Communication Review, Jan. 2006:65-68.
[91]Langberg M, Sprintson A and Bruck J. The encoding complexity of network coding. IEEE Trans. Information Theory, June 2006,52(6):2386-2397.
[92]Wang W, Yu L. and Zhu G. A novel approach in network coding based on shuffle coding. Proceedings of International Symposium on Intelligent Signal Processing and Communication Systems, Xiamen, China, Nov,2008:8-11
[93]Shokrollahi A. Raptor codes. IEEE Trans. Information Theory, Jun.2006, vol.52(6): 2551-2567
[94]Silva D, Zeng W and Kschischang F R. Sparse network coding with overlapping classes. Proceedings of Workshop on Network Coding, Theory, and Applications (NetCod), June 2009.
[95]Kim M J, Sundararajan J K, Medard M, Eryilmaz A and Koetter R. Network Coding in a Multicast Switch. IEEE Trans. Information Theory,2011,57(1):436-460.
[96]Gandhi R, Greening B, Pemmaraju S and Raman R, Sub-coloring and Hypo-coloring Interval Graphs. in Graph-Theoretic Concepts in Computer Science. Springer,2010: 122-132.
[97]Lacan J and Fimes J. Systematic MDS Erasure Codes Based on Vandermonde Matrices. IEEE Communications Letters,2004,8(9):570-572.
[98]McKeown N, Anantharam V, and J. Walrand. Achieving 100% throughput in an input-queued switch. INFOCOM,1996.
[99]Li J. Scheduling algorithms for high speed switches. Ph.D. dissertation, New Jersey Institute of Technology, May 2001.
[100]Marsan M A, Bianco A, Giaccone P, Leonardi E and Neri F. Multicast traffic in input-queued switches:optimal scheduling and maximum throughput. IEEE/ACM Trans. Networking,2003,11(3):465-477.
[101]Agarwal M, Cho J H, Gao L and Wu J. Energy Efficient Broadcast in Wireless Ad hoc Networks with Hitch-hiking. INFOCOM,2004.
[102]Lee T. Nonblocking copy networks for multicast packet switching. IEEE Trans. Selected Areas in Communications, Dec.1988,6(9):1455-1467.
[103]Andrews M, Khanna S and Kumaran K. Integrated Scheduling of Unicast and Multicast Traffic in an Inputqueued Switch. IEEE INFOCOM,1999.
[104]Zhang X and Bhuyan L. An Efficient Scheduling Algorithm for Combined Input-crosspoint-queued (CICQ) Switches. Proceedings of IEEE GLOBECOM,2004.
[105]Bianco A, Giaccone P, Leonardi E and Neri F. A framework for differential frame-based matching algorithms in input-queued switches. INFOCOM 2004,2004.
[106]Ye T, Micheli G D and Benini L. Analysis of Power Consumption on Switch Fabrics in Network Routers. Proceedings of the 39th conference on Design automation. ACM New York, NY, USA,2002.
[107]Tartre M and Lin B. Frame-Based Multicast Switching. IEEE Communications Letters,2010,14(3):251-253.
[108]Koksal C. On the Speedup Required to Achieve 100%Throughput for Multicast Traffic over Crossbar Switches. Citeseer, Tech. Rep.,2008.
[109]Feige U and Kilian J. Zero knowledge and the chromatic number. Proceeding, Eleventh Annual IEEE Conference on Computational Complexity,1996.
[110]Sundararajan J K, Deb S and Medard M. Extending the Birkhoffvon Neumann switching strategy to sulticast switches. Proceedings of the 4th International IFIP-TC6 Networking Conference, May 2005.
[111]Lee T T. The Kraft's Inequality of Scheduling for Packet-Switched Clos Networks. Proceedings of Infocom2008,2008.
[112]Avestimehr S, Diggavi S and Tse D. Approximate capacity of Gaussian relay networks. Proceedings of ISIT2008, Toronto, Canada, July 2008.
[113]Tian C, Mohajer S and Diggavi D. Approximating the Gaussian multiple description rate region under symmetric distortion constraints. Proceedings of ISIT2008, Toronto, Canada, July 2008.
[114]Yang Y and Xiong Z. Distributed compression of linear functions:Partial sum-rate tightness and gap to optimal sum-rate. Submitted to ISIT2011, St Petersburg, Russia, July/August,2011.
[115]Akyildiz I, Lee W, Vuran M and Mohanty S. NeXt generation/dynamic spectrum access/cognitive radio wireless networks:a survey. Computer Networks,2006,50(13): 2127-2159.
[116]Stevenson C, Chouinard G, Lei Z, Hu W, Shellhammer S and Caldwell W. IEEE 802.22:The first cognitive radio wireless regional area network standard, IEEE Communication Magazine.2009,47(1):120-138.
[117]Krikidis I, Sun Z, Laneman J N and Thompson J. Cognitive legacy networks via cooperative diversity. IEEE Communication Letters,2009,13(2):106-108
[118]Zhang Q, Jia J and Zhang J. Cooperative relay to improve diversity in cognitive radio networks. IEEE Communications Magazine,2009,47(2):111-117.
[119]Simeone O, Bar-Ness Y, and Spagnolini U. Stable throughput of cognitive radios with and without relaying capability. IEEE Trans. Communications,2007,55(12): 2351-2360.
[120]Gambini J, Simeone O and Spagnolini U. Cognitive relaying and opportunistic spectrum sensing in unlicensed multiple access channels. Proceedings of IEEE ISSSTA Proceedings, Bologna, Italy, Aug.2008:371-375.
[121]Devroye N, Mitran P and Tarokh V. Limits on communications in a cognitive radio channel. IEEE Trans. Communications,2006,44(6):44-49.
[122]杨黎,王晓湘,赵堃.多天线感知无线电中的协作频谱感知算法.电子与信息学报,2009,30(10)：2338-2342.
[123]Jovicic A and Viswanath P. Cognitive radio:an information-theoretic perspective. ISIT, Seattle, USA, Jul.2006:2413-2417.
[124]Sridharan S and Vishwanath S. On the capacity of a class of MIMO cognitive radios. IEEE Journal of Selected Topics in Signal Processing,2008,2(1):103-117.
[125]Ahlswede R, Cai N, and Li.S R, et al.. Network information flow. IEEE Trans. Information Theory,2000,46(4):1204-1216.
[126]Li S R, Yueng R W, and Cai N. Linear network coding. IEEE Trans. Information Theory,2003,49(2):371-381.
[127]Chen W, Yu L, Wang W and Xiong F, Trusted network coding in wireless Ad Hoc networks. GLOBECOM, Miami, USA, Dec.2010.
[128]Umehara D, Hirano T, Denno S, Morikura M and Sugiyama T. Wireless network coding in slotted ALOHA with two-hop unbalanced traffic, IEEE Journal of Select Areas in Communications,2009,27(5):647-661.
[129]Luo W and Ephremides A. Stability of N interacting queues in random access systems. IEEE Trans. Information Theory, Jul.1999,45(5):1579-1587.
[130]Loynes R M. The Stability of a Queue with Non-independent Inter-arrival and Service Times. Mathematical Proceedings of the Cambridge Philosophical Society, 1962,58(03):497-520
[131]Zhang J and Zhang, Q. Stackelberg game for utility-based cooperative cognitive radio networks. ACM MobiHoc, New Orleans, USA, May 2009:23-32.
[132]朱佳,郑宝玉,邹玉龙.基于最佳中继选择的协作频谱感知方案研究.电子学报,2010,36(1)：92-98.