基于覆盖网络的应用层多播技术研究
|
摘要
随着计算机网络的不断发展,以视频会议、视频点播、远程教育等为代表的新型多媒体多播应用的大量涌现,对多播通信服务提出了迫切的需求。与IP多播相比,基于覆盖网络思想的应用层多播最大的优势在于由端系统而不是核心路由器实现多播通信的所有功能,无需改变下层网络基础设施,易于部署,这体现了下一代网络服务的研究重点正在从网络层向应用层跃迁的趋势。在研究覆盖多播的路由协议及算法的基础上,主要研究工作和创新点如下:
在分析覆盖网络模型的理论和系统框架基础上,针对大型覆盖网络系统提出了一种DHCM(density-based hierarchical clustering multicast)应用层多播模型,改进了IHC(Incremental Hierarchical Clustering)算法,以集群满足单调性和同构性为原则,对集群的密度进行层次划分,通过密度树实现最短路由;采用peer-to-peer技术,用之字形数据传输方案来替代传统的父亲节点向孩子节点传输数据,避免同一节点向太多节点传输数据而产生瓶颈,提高了系统的数据传输效率。通过和其他多播算法进行实验比较,进一步验证DHCM系统在视频流传输上具有高效性和健壮性。
提出了MRDL(Minimum radius,degree-limited spanning tree problem)和LRRB(Limited radius,residual fraction-balanced spanning tree problem)两个模型来求解“度约束最小延迟生成树”,并且提出了相应的启发式算法:MRDL-H和LRRB-H算法;提出了一系列Swap和Switch操作动态维护多播树,引入Knock-down技术使多播树具有更广泛的可扩展性。仿真实验结果显示两类算法对不同端系统分布环境表现出良好适应性,在多播生成树的延时、重复带宽使用和网络资源占用量等性能方面均具有明显优势,从而验证了该算法的有效性。
提出一种新的基于代理的系统—应用层自适应多播iPALM系统(Proxy basedApplication-level Multicast)来改善网络的异构性和传输实时性,在局域范围内采用高效率的IP Multicast进行数据传输,每个多播域中设置一个代理服务器MPN,MPN之间的主干网络通过应用层多播进行数据传输,实现在Internet范围内的多点数据通信;采用了XML驱动的服务定制机制,通过基于客户端和基于代理服务器的双层结构的拥塞控制技术。给出了iPALM系统的功能模块图,定义了协议包的类型、功能、格式定义等,以及各个模块保存的表的具体定义。最后通过模拟实验证明,该系统可以满足不同应用需求,节省大量的网络资源,提供了网络吞吐量,平滑了网络传输的抖动,提高了视频服务质量。
With the development of computer network, the emergence of many new multimedia group applications, such as video conferencing, video-on-demand and distance learning, require multicast communication service imminently. Compared with IP multicast, the greatest advantage of overlay multicast based on the concept of overlay network is that end systems perform all multicast communication functionalities instead of IP routers and it needn't change the lower network infrastructure, and can be deployed easily. Overlay multicast embodies the trend that the emphasis of network service research is shifting from network layer to application layer in the next generation Internet. Based on the study of the overlay multicast routing protocols and algorithms, the primary work and innovative ideas are as follows:
Based on the study of basic theories and system frame of the overly network , this thesis has put forward an application-level multicast model for large overlay network system, named DHCM (density-based hierarchical clustering multicast) which has improved the IHC (Incremental Hierarchical Clustering) algorithm. This density tree of DHCM has the homogeneity and monotonicity properties, and divided the hosts into many hierarchies according to their density, and constructed a density tree to realize the shortest routing. At the same time, DHCM uses a p2p scheme in data transmission which transmits the data in zigzag fashion, but the traditional manner is that child node will get the data from the father node. This scheme will avoid the bottleneck for one node must transmit too many child nodes, and improve the data transmission efficiency of system. The experiment results compare with other application-level multicast have proved that DHCM can transmit the video stream efficiently and robustly.
This thesis has proposed two problem model MRDL (Minimum radius, degree-limited spanning tree problem) model and LRRB(Limited radius, residual fraction-balanced spanning tree problem) model in order to resolve the problem "degree-limited and minimum delay spanning tree". At the same time, this thesis has given the corresponding heuristic algorithm: MRDL-H algorithm and LRRB-H algorithm. This paper have proposed some swap and switch operation to dynamically maintenant the multicast tree and introduced the Knock-down technology to make the tree has more expansibility. The simulation experiment result has prove that these two algorithms for different sizes of the multicast tree have a better adaptability and show the obvious advantage in the aspect of repeatedly using bandwidth and network resource using capacity, so these work prove the efficiency of these algorithms.
In order to improve the network heterogeneity and the real-time transmission, this thesis has proposed a proxy-based overlay multicast system called iPALM (Proxy based Application-level Multicast). Its basic idea is that system uses efficiently data transmission of IP multicast in LAN, and every IP multicast area will has been set one proxy server named MPN, the backbone network will transmit data using application-level multicast, in this way the transmission of many nodes in the Internet can be realized. At the same time, iPALM has adopted the service subscribing mechanism in XML format, and use two level congestion control technology based on client and proxy server. This thesis also has described the function module picture, the protocol package's type and function and format definition, the detailed definition of table cashed in every module. The simulation experiment has proved that iPALM system can satisfied every different application request and save many network resource, which can offer network throughout and smooth the jitter in network transmission and improve the media service quality.
在分析覆盖网络模型的理论和系统框架基础上,针对大型覆盖网络系统提出了一种DHCM(density-based hierarchical clustering multicast)应用层多播模型,改进了IHC(Incremental Hierarchical Clustering)算法,以集群满足单调性和同构性为原则,对集群的密度进行层次划分,通过密度树实现最短路由;采用peer-to-peer技术,用之字形数据传输方案来替代传统的父亲节点向孩子节点传输数据,避免同一节点向太多节点传输数据而产生瓶颈,提高了系统的数据传输效率。通过和其他多播算法进行实验比较,进一步验证DHCM系统在视频流传输上具有高效性和健壮性。
提出了MRDL(Minimum radius,degree-limited spanning tree problem)和LRRB(Limited radius,residual fraction-balanced spanning tree problem)两个模型来求解“度约束最小延迟生成树”,并且提出了相应的启发式算法:MRDL-H和LRRB-H算法;提出了一系列Swap和Switch操作动态维护多播树,引入Knock-down技术使多播树具有更广泛的可扩展性。仿真实验结果显示两类算法对不同端系统分布环境表现出良好适应性,在多播生成树的延时、重复带宽使用和网络资源占用量等性能方面均具有明显优势,从而验证了该算法的有效性。
提出一种新的基于代理的系统—应用层自适应多播iPALM系统(Proxy basedApplication-level Multicast)来改善网络的异构性和传输实时性,在局域范围内采用高效率的IP Multicast进行数据传输,每个多播域中设置一个代理服务器MPN,MPN之间的主干网络通过应用层多播进行数据传输,实现在Internet范围内的多点数据通信;采用了XML驱动的服务定制机制,通过基于客户端和基于代理服务器的双层结构的拥塞控制技术。给出了iPALM系统的功能模块图,定义了协议包的类型、功能、格式定义等,以及各个模块保存的表的具体定义。最后通过模拟实验证明,该系统可以满足不同应用需求,节省大量的网络资源,提供了网络吞吐量,平滑了网络传输的抖动,提高了视频服务质量。
With the development of computer network, the emergence of many new multimedia group applications, such as video conferencing, video-on-demand and distance learning, require multicast communication service imminently. Compared with IP multicast, the greatest advantage of overlay multicast based on the concept of overlay network is that end systems perform all multicast communication functionalities instead of IP routers and it needn't change the lower network infrastructure, and can be deployed easily. Overlay multicast embodies the trend that the emphasis of network service research is shifting from network layer to application layer in the next generation Internet. Based on the study of the overlay multicast routing protocols and algorithms, the primary work and innovative ideas are as follows:
Based on the study of basic theories and system frame of the overly network , this thesis has put forward an application-level multicast model for large overlay network system, named DHCM (density-based hierarchical clustering multicast) which has improved the IHC (Incremental Hierarchical Clustering) algorithm. This density tree of DHCM has the homogeneity and monotonicity properties, and divided the hosts into many hierarchies according to their density, and constructed a density tree to realize the shortest routing. At the same time, DHCM uses a p2p scheme in data transmission which transmits the data in zigzag fashion, but the traditional manner is that child node will get the data from the father node. This scheme will avoid the bottleneck for one node must transmit too many child nodes, and improve the data transmission efficiency of system. The experiment results compare with other application-level multicast have proved that DHCM can transmit the video stream efficiently and robustly.
This thesis has proposed two problem model MRDL (Minimum radius, degree-limited spanning tree problem) model and LRRB(Limited radius, residual fraction-balanced spanning tree problem) model in order to resolve the problem "degree-limited and minimum delay spanning tree". At the same time, this thesis has given the corresponding heuristic algorithm: MRDL-H algorithm and LRRB-H algorithm. This paper have proposed some swap and switch operation to dynamically maintenant the multicast tree and introduced the Knock-down technology to make the tree has more expansibility. The simulation experiment result has prove that these two algorithms for different sizes of the multicast tree have a better adaptability and show the obvious advantage in the aspect of repeatedly using bandwidth and network resource using capacity, so these work prove the efficiency of these algorithms.
In order to improve the network heterogeneity and the real-time transmission, this thesis has proposed a proxy-based overlay multicast system called iPALM (Proxy based Application-level Multicast). Its basic idea is that system uses efficiently data transmission of IP multicast in LAN, and every IP multicast area will has been set one proxy server named MPN, the backbone network will transmit data using application-level multicast, in this way the transmission of many nodes in the Internet can be realized. At the same time, iPALM has adopted the service subscribing mechanism in XML format, and use two level congestion control technology based on client and proxy server. This thesis also has described the function module picture, the protocol package's type and function and format definition, the detailed definition of table cashed in every module. The simulation experiment has proved that iPALM system can satisfied every different application request and save many network resource, which can offer network throughout and smooth the jitter in network transmission and improve the media service quality.
引文
[1] S E Deering Multicast routing in a datagram internetwork[PhD thesis], Stanford University, Dec 1991.
[2] T Kohonen. Self-Organizing Maps [M]. Berlin: Springer, 1995.
[3] M.Goncalves and K.Niles, IP Multicasting Concepts and Applications, New York:The MeGraw-Hill Companies, Inc, 1999.
[4] A.S. Tanenbaum, Computer Networks, 3rd edition, Englewood Cliffs: Prentice Hall International, 1996.
[5] M. Parasa, Multicast routing in computer networks [PhD dissertation] .
[6] Yunxi Sherlia Shi, Design of overlay networks for internet multicast[PhD paper].
[7] S. Deering. Multicast Routing in Internetworks and Extended LANs. In Proceeding of the ACM SIGCOMM, August 1988, 85-110.
[8] Stephen Deering. Multicasting routing in a datagram internetwork[Ph.D.dissertation], 1991.
[9] Internet Group Management Protocol, Version 3,ftp://ftp.rfc-editor.org/in-notes/rfc3376.txt.
[10] T. Pusateri. Distance vector multicast routing protocol. Work in Progress :, February 2001.
[11] J. Moy. Multicast routing extensions for ospf. In Communication ACM, August 1994,volume37:61-ff.
[12] J. Moy. Ospf version 2. RFC 2328, April 1998.
[13] D. Estrin et al. Protocol independent multicast-sprse mode (pim-sm): protocol specification. RFC 2362, June 1998. .
[14] T. Ballardie. Core based trees (cbt version 2) multicast routing. RFC 2189,September 1997.
[15] Sonia Fahmy and Minseok Kwon. Characterizing Overlay Multicast Networks. In Proceedings of the IEEE International Conference on Network Protocols (ICNP),November 2003, 61 -70.
[16] S. Shi and J. Turner. Routing in Overlay Multicast Networks. In Proc. of IEEE INFOCOM, June 2002, 1200-1208.
[17] S. Shi and J. Turner. Multicast Routing and Bandwidth Dimensioning in Overlay Networks. Journal on Selected Areas in Communications, Volume 20, Issue 8:1444-1455, Oct. 2002.
[18] J.H. Saltzer, D.P.Reed and D.D.Clark. "End-To-End Arguments in System Design",ACM Transitions in Computer Systems, vol.2, no .4,1984, 277-288..
[19] Y. Chu, S.G Rao, and H. Zhang. "A Case for End System Multicast". In ACM Sigmetrics 2000, Santa Clara, California, USA, Volume 20, Issue 8, Oct. 2002 1456-1471.
[20] Hrishikesh Deshpande, Mayank Bawa, and Hector Garcia-Molina. Streaming live media over peers. In Stanford University, Database Group, Submitted for publication, 2002.
[21] Vincent Roca and Ayman El-Sayed. A host-based multicast (hbm) solution for group communications. In First IEEE International Conference on Networking (ICN'01), Colmar, France, 610 - 619, July 2001.
[22] Y. H. Chu, S.G Rao, S. Seshan, and H. Zhang. Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture. In proceedings of ACM Sigcomm, 2001, 31(4):55-67.
[23] Yang-hua Chu, Aditya Ganjam, T. S. Eugene Ng, Sanjay G Rao, Kunwadee Sripanidkulchai, Jibin Zhan, and Hui Zhang. Early Experience with an Internet Broadcast System Based on Overlay Multicast. Technical Report CMU-CS-03-214,Carnegie Mellon University December, 2003.
[24] P. Francis. Yoid: Extending the Multicast Internet Architecture, 1999. White paper http://www.aciri.org/yoid.
[25] Zhang Beichuan, Jamin Sugih, and Zhang Lixia. Host multicast: a framework for delivering multicast to end users. IEEE INFOCOM'02, New York, USA, June 2002, Volume 3, 23-27, 1366 - 1375.
[26] Sylvia Ratnasamy, P. Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM 2001,August 2001, 161 - 172 .
[27] Sylvia Ratnasamy, Mark Handley, RichardKarp, and Scott Shenker.Application-level multicast using content-addressable networks. In Third International Workshop on Networked Group Communication (NGC 2001),London, UK, November 2001, 14-29.
[28] Q Shelley. Y Zhuang Ben. D Zhao, Anthony. H Joseph, Randy. D Katz, and John. Kubiatowicz.Bayeux:An architecture for scalable and fault-tolerant wide-area data dissemination.In 11th International Workshop on Network and Operating Systems Support for Digital Audio and Video(NOSSDAV 2001),June 2001,11-20.
[29]Miguel Castro,Peter Druschel,Anne-Marie Kermarrec,and Antony Rowstron.Scribe:a large-scale and decentralised application-level multicast infrastructure.IEEE Journal on Selected Areas in Communications(JSAC)(Special issue on Network Support for Multicast Communications),20(8),October 2002,1489-1499.
[30]Antony Rowstron,Anne-Marie Kermarrec,Miguel Castro,and Peter Druschel.Scribe:The desgin of a large-scale event notification infrastracture.In proceeding of the third International COST264 Workshop,Networked Group Communication(NGC 2001),London,UK,November 2001,30-43.
[31]A.Rowstron and P.Druschel.Pastry:Scalable,distributed object location and routing for large-scale peer-to-peer systems.In IFIP/ACM International Conference on Distributed Systems Platforms(Middleware),November 2001,Pages:329-350.
[32]B.Y.Zhao,J.D.Kubiatowicz,and A.D.Joseph.Tapestry:An infrastructure for fault-tolerant wide-area location and routing.In Technical report UCB/CSD-01-1141,University of California at Berkeley,Computer Science Division,April 2001.
[33]J.Liebeherr,M.Nahas,and W.Si.Application-layer multicast with Delaunay triangulations.In IEEE Global Internet Symposium(Globecom'01),also Technical Report CS-2001-26,November 2001.
[34]Jorg Liebeherr,Michael Nahas,and Weisheng Si.Application-layer multicasting with Delaunay triangulation overlays.IEEE Journal on Selected Areas in Communications,20(8),October 2002,1472-1488.
[35]Dimitrios Pendarakis,Sherlia Shi,Dinesh Verma,and Marcel Waldvogel.ALMI:An application level multicast infrastructure.In Third USNIX Symposium on Internet Technologies and Systems(USITS '01),March 2001,Pages:49-60.
[36]Shi Yunxi Sherlia.Design of overlay networks for internet multicast[Ph.D Thesis],Departtement of Computer Science,Sever Institute of Technology,Washington University,August 2002.
[37] Yatin Chawathe. Scattercast: An architecture for internet broadcast distribution as an infrastructure service[Ph.D thesis], at University of California at Berkeley,September 2000.
[38] J. Jannotti, D. Gifford, K. Johnson, F. Kaashoek, and J. O'Toole. Overcast:Reliable multicasting with an overlay network. In Proceedings of the 4th conference on Symposium on Operating System Design & Implementation,October 2000, Pages:14-14.
[39] NICE working group home page. http://www.math.princeton.edu/tsp/.
[40] Suman Banerjee, Bobby Bhattacharjee, and Christopher Kommareddy. Scalable application layer multicast. In Proceedings of ACM SIGCOMM'02, Pittsburgh,USA, August 2002, Pages: 205-217. .
[41] Lee Seungjoon, Sherwood Rob, and Bhattacharjee Bobby. Cooperative peer groups in nice. IEEE INFOCOM'03, April 2003, 1272-1282 vol.2.
[42] A Duc. A Tran, Kien. T Hua, and Tai. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. IEEE INFOCOM'03, April 2003, 1272-1282 vol.2.
[43] D Widyantoro, J Yen. An incremental approach to building a cluster hierarchy [A].Proceedings of the 2002 IEEE International Conference on Data Mining [C].Maebashi City, Japan, 2002, 705-708.
[44] I.Cidon,I.Gopal,and S.Kutten,"New models and algorithms for future networks",IEEE Transaction on Information Theory, May 1995,vol.41,no.3,769-780.
[45] M Elkin, G Kortsarz. A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem. In: Proc. of the Annual ACM Symp. on Theory of Computing. Montreal, 2003. 438-447.htpp://www.crab.rutgers.edu/～guyk/pub/newbr/ nabs.ps.
[46] S. Y. Shi, J. Turner, and M. Waldvogel, "Dimensioning server access bandwidth and multicast routing in overlay networks," in NOSSDAV 2001, June 2001,83-92.
[47] T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms.McGraw-Hill,New York, NY: MIT Press, 1990, .
[48] W Zegura E, K Calvert, S Bhattacharjee. How to model an internetwork[A]. Proc of the 15th Annual Joint Conf of the IEEE Computer and Communications Soci-eties, INFOCOM' 96, Vol.2[C]. New York: Institute of Electrical and Electronics Engineers Inc, 1996. 594-602.
[49] M Faloutsos, P Faloutsos, C Faloutsos. On power-law relationships of the internet topology[J]. ACM SIG-COMM Computer Communication Review, 1999, 29(4):251-262.
[50] NM Malouch, Z Liu, D Rubenstein,et al.A Graph Theoretic Approach to Bounding Delayin Proxy-Assisted,End-System Multicast[A].In Proceedings of ACM NOSSDAV'02[C],2002, 106-115.
[51] S Banerjee, C Kommareddy, K Kar,et al.Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications[C].In Proceedings of the IEEE INFOCOM.2002. San Franciso.1521-1531.
[52] Y Chawathe.Scattercast:An Architecture for Internet Broadcast Distribution as an Infrastructure Service[D]:[Ph.D.Thesis],University of California,Berkeley,2000.
[53] S. Y. Shi, J. Turner. "Routing in overlay multicast networks." In Proceedings of Infocom.June 2002,1200-1208 vol.3.
[54] DA Helder, S Jamin,End-host Multicast Communication Using Switch-trees Protocols[C].In Proceedings of 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid(CCGRID'02),2002.419-424.
[55] H. Deshpande, M. Bawa, and H. Garcia-Molina, "Streaming live media over peers," Tech. Rep. 2001-31, CS Dept., Stanford University, 2001.
[56] S Banerjee, C Kommareddy, K Kar, B Bhattacharjee, S Khuller. Construction of an efficient overlay multicast infrastructure for real-time applications. In:INFOCOM 2003, the 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies. Vol 2, 2003. 1521-1531.http://www.informtik.uni-trier.de/～ley/db/conf/infocom/infocom2003 .html.
[57] SW Tan, G Waters, J Crawford. A survey and performance evaluation of scalable tree-based application layer multicast protocol. Technical Report, No.9-03,Canterbury: University of Kent, 2003.
[58] SY Shi, JS Turner. Multicast routing and bandwidth dimensioning in overlay networks. IEEE Journal on Selected Areas in Communications,2002,20(8): 1444-1455.
[59] E Broash, Y Shavitt. Approximation and heuristic algorithms for minimum delay application-layer multicast trees. In: INFOCOM 2004, the 23rd Annual Joint Conf.of the IEEE Computer and Communications Societies. Vol 4, 2004. 2697-2707. http://www.ieee-infocom.org/2004/Papers/56_1.PDF.
[60]MF Mokbel,WA El-Haweet,MN El-Derini.A delay-constrained shortest path algorithm for multicast routing in multimedia applications.In:Proc.of the IEEE Middle East Workshop on Networking.1999.http://www-users.cs.umn.edu/～mokbel/Beriut99.pdf.
[61]HF Salama,DS Reeves,Y Viniotis.The delay-constrained minimum spanning tree problem.In:Proc.of the 2nd IEEE Symp.on Computers and Communications.1997.699-703.http://portal.acm.org/citation.cfm?id=845348.
[62]J Widmer,R Denda,Mauve.M.A survey on TCP-friendly congestion control.IEEE Network,2001,15(3):28-37.
[63]FIPS 180-1.Secure hash standard[R].Tech Rep Publication 180-1,Federal InformationProcessing Standard(FIPS),National Institute of Standards and Technology,USDepartment of Commerce,Washington DC,April 1995.
[64]周江.基于分层组播的拥塞控制研究[硕士学位论文].华中科技大学,2004.
[65]Mathew Liste,Content Delivery Networks(CDNs)-A Reference Guide[EB/OL].Cisco2000.
[66]Guillaume Urvoy-Keller and Ernst W.Biersack.A Congestion Control Model for Multicast Overlay Networks and its Performance.Proc.of NGC 2002,October 2002,Pages:141-147.
[67]Gu-In Kwon Byers,W John.ROMA:Reliable Overlay Multicast with Loosely Coupled TCP Connections.to appear in Proc.of IEEE INFOCOM 2004,March 2004,Pages:7-11.
[68]D.G.Andersen,H.Balakrishnan,M.Frans Kaashoek,and R.Morris.Resilient overlay networks.In Proceedings of 18th ACM Symposium on Operating Systems Principles,October 2001,Pages:131-145.
[69]Y Chawathe,SE Mccanne,EA Brewer.RMX:Reliable multicast for heterogeneous networks[C].In Proceedings of INFOCOM'00,Mar.2000:795-804.
[70]Inktomi Corporation.The Inktomi Overlay Solution for Streaming Media Broadcasts.Inktomi whitepaper.
[71]Akamai Technologies[EB/OL].Inc.http://www.akamai.com.
[72]DL Tennenhouse,JM Smith,WD Sincoske,et al.A survey of active network research[J].IEEE Communications Magazine.1997,35(1):80-85.
[73]E Amir,S McCanne,R Katz.An Active Service Framework and its Application to Real-time Multimedia Transcoding[J].In Processdings of ACM SIGCOMM'98,Vancouver,British Columbia,Canada,September 1998,Pages:178-189.
[74]LW Lehman,SJ Garland,DL Tennenhouse,Active Reliable Multicast[C].In Proceedings of INFOCOM'98,Mar.1998,581-589 vol.2.
[75]J.B POSTEL,Transmission Control Protocol.Internet Engineering Task Force,September 1981.RFC 793.
[76]D Andersen,H Balakrishnan,F Kaashoek,et al.The case for resilient overlay network[C]//HotOS Ⅷ.Elmau/Oberbayern:IEEE Press,2001:152-157.
[77]S FLOYD,M HANDLEY,J PADHYE,J WIDMER.Equation-Based Congestion Control for Unicast Applications.In Proc.ACM SIGCOMM(Stockholm,Sweden,Sept.2000),43-54.
[78]Suchitra Raman,Yatin Chawathe,and Steven McCanne,libsrm:The Berkeley SRM toolkit,University of California,Berkeley,Software available at http://www-mash.cs.berkeley.edu/mash/software/srm2.0.
[79]Jiang Zhen,Zhang hongke,Zhang liyong.Research and Implementation of IPSec inside Operating System.Proceedings of SPIE.2002,4909:286-291.
[80]Lee Goo Yeon,Lee Yong.Efficient Rekey Interval for Minimum Cost on Secure Multicast System Using Group Key.IEEE Global Telecommunications Conference.2002,2:1995-1999.
[81]姜圳.基于Qos地组播路由关键技术研究[博士学位论文].哈尔滨理工大学,2005
[82]戴琼海,覃毅力,张莹.组播通信的访问控制和密钥管理.电子学报.2002,30(12A):2020-2023.
[83]屈劲,葛建华,蒋铭.安全组播的Huffman层次密钥管理.软件学报.2003,14(1):151-157.
[84]Liu Jing,Zhou Mingtian.Key Management and Access Control for Large Dynamic Multicast Groups.Ruan Jian Xue Bao/Journal of Software.2002,13(2):291-297.
[85]卿斯汉,蒙杨.分布式应用中的多级安全密钥管理.电子学报,2001,29(2):269-271.
[86]Bergadano Francesco,Cavagnino Davide,Crispo Bruno.Individual Authentication in Multiparty Communications.Computers and Security.2002,21(8):719-735.
[87]Jiang Zhen,Zhang hongke,Zhang liyong.A Key Management Approach of Multicast.Proceedings of SPIE.2002,4909:276-280.
[88]Wade Trappe,Jie Song.Key Management and Distribution for Secure Multimedia Multicast.IEEE Transactions on Multimedia.2003,5(4):544-557.
[89]吴家皋.覆盖网络多播路由协议及算法的研究[博士学位论文].东南大学,2005.
[90]杨武勇,史美林.面向多媒体协作应用的基于代理的应用层自适应组播,计算机科学,2004Vol-31No.12.
[91]陈益新,吴家皋,杨音颖.可服务定制的流媒体应用层组播系统,计算机工程与应用,2005.8.
[92]余胜生,郑心炜,胡文斌.基于密度树的P2P视频流多播.小型微型计算机系统,2006 27(11)2020-2024.
[93]YU Sheng-sheng,ZHENG Xin-wei,ZHOU Jing-li.A P2P Scheme for Live Media Stream Multicast,2006 12th International MultiMedia Modelling Conference (IEEE 2006).Jan,2006:473-477.(EI/ISTP检索)
[94]余胜生,郑心炜,周敬利.基于非线性软阈值的小波图像压缩方法。计算机工程与科学,2005 27(12)30-32.
[95]李晶.实时多媒体数据跨网关传输及拥塞控制技术研究[硕士学位论文],华中科技大学,2004.
[96]郑心炜,余胜生.最小延迟的应用层多播树算法研究.小型微型计算机系统(已录用,待发表).
[97]C Norolilia,F Tobagi.Evaluation of Multicast Routing Algorithms for Multimedia Streams[A].In Proeeedings of the IEEE International Telecommunications SymPosium[C].Technical Report,1994.
[98]B M Waxman.Routing of MultiPoint Conneetions[J].IEEE Journal on Seleeted Areas in Communications,1988,6(9):1617-1622.
[99]H F Salama.Multicast Routing for Real-Time Communieation on High-Speed Networks[PhD thesis],North Carolina State University,DePartment of Eleetrical and Computer Engineering,1996.
[2] T Kohonen. Self-Organizing Maps [M]. Berlin: Springer, 1995.
[3] M.Goncalves and K.Niles, IP Multicasting Concepts and Applications, New York:The MeGraw-Hill Companies, Inc, 1999.
[4] A.S. Tanenbaum, Computer Networks, 3rd edition, Englewood Cliffs: Prentice Hall International, 1996.
[5] M. Parasa, Multicast routing in computer networks [PhD dissertation] .
[6] Yunxi Sherlia Shi, Design of overlay networks for internet multicast[PhD paper].
[7] S. Deering. Multicast Routing in Internetworks and Extended LANs. In Proceeding of the ACM SIGCOMM, August 1988, 85-110.
[8] Stephen Deering. Multicasting routing in a datagram internetwork[Ph.D.dissertation], 1991.
[9] Internet Group Management Protocol, Version 3,ftp://ftp.rfc-editor.org/in-notes/rfc3376.txt.
[10] T. Pusateri. Distance vector multicast routing protocol. Work in Progress :
[11] J. Moy. Multicast routing extensions for ospf. In Communication ACM, August 1994,volume37:61-ff.
[12] J. Moy. Ospf version 2. RFC 2328, April 1998.
[13] D. Estrin et al. Protocol independent multicast-sprse mode (pim-sm): protocol specification. RFC 2362, June 1998. .
[14] T. Ballardie. Core based trees (cbt version 2) multicast routing. RFC 2189,September 1997.
[15] Sonia Fahmy and Minseok Kwon. Characterizing Overlay Multicast Networks. In Proceedings of the IEEE International Conference on Network Protocols (ICNP),November 2003, 61 -70.
[16] S. Shi and J. Turner. Routing in Overlay Multicast Networks. In Proc. of IEEE INFOCOM, June 2002, 1200-1208.
[17] S. Shi and J. Turner. Multicast Routing and Bandwidth Dimensioning in Overlay Networks. Journal on Selected Areas in Communications, Volume 20, Issue 8:1444-1455, Oct. 2002.
[18] J.H. Saltzer, D.P.Reed and D.D.Clark. "End-To-End Arguments in System Design",ACM Transitions in Computer Systems, vol.2, no .4,1984, 277-288..
[19] Y. Chu, S.G Rao, and H. Zhang. "A Case for End System Multicast". In ACM Sigmetrics 2000, Santa Clara, California, USA, Volume 20, Issue 8, Oct. 2002 1456-1471.
[20] Hrishikesh Deshpande, Mayank Bawa, and Hector Garcia-Molina. Streaming live media over peers. In Stanford University, Database Group, Submitted for publication, 2002.
[21] Vincent Roca and Ayman El-Sayed. A host-based multicast (hbm) solution for group communications. In First IEEE International Conference on Networking (ICN'01), Colmar, France, 610 - 619, July 2001.
[22] Y. H. Chu, S.G Rao, S. Seshan, and H. Zhang. Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture. In proceedings of ACM Sigcomm, 2001, 31(4):55-67.
[23] Yang-hua Chu, Aditya Ganjam, T. S. Eugene Ng, Sanjay G Rao, Kunwadee Sripanidkulchai, Jibin Zhan, and Hui Zhang. Early Experience with an Internet Broadcast System Based on Overlay Multicast. Technical Report CMU-CS-03-214,Carnegie Mellon University December, 2003.
[24] P. Francis. Yoid: Extending the Multicast Internet Architecture, 1999. White paper http://www.aciri.org/yoid.
[25] Zhang Beichuan, Jamin Sugih, and Zhang Lixia. Host multicast: a framework for delivering multicast to end users. IEEE INFOCOM'02, New York, USA, June 2002, Volume 3, 23-27, 1366 - 1375.
[26] Sylvia Ratnasamy, P. Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM 2001,August 2001, 161 - 172 .
[27] Sylvia Ratnasamy, Mark Handley, RichardKarp, and Scott Shenker.Application-level multicast using content-addressable networks. In Third International Workshop on Networked Group Communication (NGC 2001),London, UK, November 2001, 14-29.
[28] Q Shelley. Y Zhuang Ben. D Zhao, Anthony. H Joseph, Randy. D Katz, and John. Kubiatowicz.Bayeux:An architecture for scalable and fault-tolerant wide-area data dissemination.In 11th International Workshop on Network and Operating Systems Support for Digital Audio and Video(NOSSDAV 2001),June 2001,11-20.
[29]Miguel Castro,Peter Druschel,Anne-Marie Kermarrec,and Antony Rowstron.Scribe:a large-scale and decentralised application-level multicast infrastructure.IEEE Journal on Selected Areas in Communications(JSAC)(Special issue on Network Support for Multicast Communications),20(8),October 2002,1489-1499.
[30]Antony Rowstron,Anne-Marie Kermarrec,Miguel Castro,and Peter Druschel.Scribe:The desgin of a large-scale event notification infrastracture.In proceeding of the third International COST264 Workshop,Networked Group Communication(NGC 2001),London,UK,November 2001,30-43.
[31]A.Rowstron and P.Druschel.Pastry:Scalable,distributed object location and routing for large-scale peer-to-peer systems.In IFIP/ACM International Conference on Distributed Systems Platforms(Middleware),November 2001,Pages:329-350.
[32]B.Y.Zhao,J.D.Kubiatowicz,and A.D.Joseph.Tapestry:An infrastructure for fault-tolerant wide-area location and routing.In Technical report UCB/CSD-01-1141,University of California at Berkeley,Computer Science Division,April 2001.
[33]J.Liebeherr,M.Nahas,and W.Si.Application-layer multicast with Delaunay triangulations.In IEEE Global Internet Symposium(Globecom'01),also Technical Report CS-2001-26,November 2001.
[34]Jorg Liebeherr,Michael Nahas,and Weisheng Si.Application-layer multicasting with Delaunay triangulation overlays.IEEE Journal on Selected Areas in Communications,20(8),October 2002,1472-1488.
[35]Dimitrios Pendarakis,Sherlia Shi,Dinesh Verma,and Marcel Waldvogel.ALMI:An application level multicast infrastructure.In Third USNIX Symposium on Internet Technologies and Systems(USITS '01),March 2001,Pages:49-60.
[36]Shi Yunxi Sherlia.Design of overlay networks for internet multicast[Ph.D Thesis],Departtement of Computer Science,Sever Institute of Technology,Washington University,August 2002.
[37] Yatin Chawathe. Scattercast: An architecture for internet broadcast distribution as an infrastructure service[Ph.D thesis], at University of California at Berkeley,September 2000.
[38] J. Jannotti, D. Gifford, K. Johnson, F. Kaashoek, and J. O'Toole. Overcast:Reliable multicasting with an overlay network. In Proceedings of the 4th conference on Symposium on Operating System Design & Implementation,October 2000, Pages:14-14.
[39] NICE working group home page. http://www.math.princeton.edu/tsp/.
[40] Suman Banerjee, Bobby Bhattacharjee, and Christopher Kommareddy. Scalable application layer multicast. In Proceedings of ACM SIGCOMM'02, Pittsburgh,USA, August 2002, Pages: 205-217. .
[41] Lee Seungjoon, Sherwood Rob, and Bhattacharjee Bobby. Cooperative peer groups in nice. IEEE INFOCOM'03, April 2003, 1272-1282 vol.2.
[42] A Duc. A Tran, Kien. T Hua, and Tai. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. IEEE INFOCOM'03, April 2003, 1272-1282 vol.2.
[43] D Widyantoro, J Yen. An incremental approach to building a cluster hierarchy [A].Proceedings of the 2002 IEEE International Conference on Data Mining [C].Maebashi City, Japan, 2002, 705-708.
[44] I.Cidon,I.Gopal,and S.Kutten,"New models and algorithms for future networks",IEEE Transaction on Information Theory, May 1995,vol.41,no.3,769-780.
[45] M Elkin, G Kortsarz. A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem. In: Proc. of the Annual ACM Symp. on Theory of Computing. Montreal, 2003. 438-447.htpp://www.crab.rutgers.edu/～guyk/pub/newbr/ nabs.ps.
[46] S. Y. Shi, J. Turner, and M. Waldvogel, "Dimensioning server access bandwidth and multicast routing in overlay networks," in NOSSDAV 2001, June 2001,83-92.
[47] T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms.McGraw-Hill,New York, NY: MIT Press, 1990, .
[48] W Zegura E, K Calvert, S Bhattacharjee. How to model an internetwork[A]. Proc of the 15th Annual Joint Conf of the IEEE Computer and Communications Soci-eties, INFOCOM' 96, Vol.2[C]. New York: Institute of Electrical and Electronics Engineers Inc, 1996. 594-602.
[49] M Faloutsos, P Faloutsos, C Faloutsos. On power-law relationships of the internet topology[J]. ACM SIG-COMM Computer Communication Review, 1999, 29(4):251-262.
[50] NM Malouch, Z Liu, D Rubenstein,et al.A Graph Theoretic Approach to Bounding Delayin Proxy-Assisted,End-System Multicast[A].In Proceedings of ACM NOSSDAV'02[C],2002, 106-115.
[51] S Banerjee, C Kommareddy, K Kar,et al.Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications[C].In Proceedings of the IEEE INFOCOM.2002. San Franciso.1521-1531.
[52] Y Chawathe.Scattercast:An Architecture for Internet Broadcast Distribution as an Infrastructure Service[D]:[Ph.D.Thesis],University of California,Berkeley,2000.
[53] S. Y. Shi, J. Turner. "Routing in overlay multicast networks." In Proceedings of Infocom.June 2002,1200-1208 vol.3.
[54] DA Helder, S Jamin,End-host Multicast Communication Using Switch-trees Protocols[C].In Proceedings of 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid(CCGRID'02),2002.419-424.
[55] H. Deshpande, M. Bawa, and H. Garcia-Molina, "Streaming live media over peers," Tech. Rep. 2001-31, CS Dept., Stanford University, 2001.
[56] S Banerjee, C Kommareddy, K Kar, B Bhattacharjee, S Khuller. Construction of an efficient overlay multicast infrastructure for real-time applications. In:INFOCOM 2003, the 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies. Vol 2, 2003. 1521-1531.http://www.informtik.uni-trier.de/～ley/db/conf/infocom/infocom2003 .html.
[57] SW Tan, G Waters, J Crawford. A survey and performance evaluation of scalable tree-based application layer multicast protocol. Technical Report, No.9-03,Canterbury: University of Kent, 2003.
[58] SY Shi, JS Turner. Multicast routing and bandwidth dimensioning in overlay networks. IEEE Journal on Selected Areas in Communications,2002,20(8): 1444-1455.
[59] E Broash, Y Shavitt. Approximation and heuristic algorithms for minimum delay application-layer multicast trees. In: INFOCOM 2004, the 23rd Annual Joint Conf.of the IEEE Computer and Communications Societies. Vol 4, 2004. 2697-2707. http://www.ieee-infocom.org/2004/Papers/56_1.PDF.
[60]MF Mokbel,WA El-Haweet,MN El-Derini.A delay-constrained shortest path algorithm for multicast routing in multimedia applications.In:Proc.of the IEEE Middle East Workshop on Networking.1999.http://www-users.cs.umn.edu/～mokbel/Beriut99.pdf.
[61]HF Salama,DS Reeves,Y Viniotis.The delay-constrained minimum spanning tree problem.In:Proc.of the 2nd IEEE Symp.on Computers and Communications.1997.699-703.http://portal.acm.org/citation.cfm?id=845348.
[62]J Widmer,R Denda,Mauve.M.A survey on TCP-friendly congestion control.IEEE Network,2001,15(3):28-37.
[63]FIPS 180-1.Secure hash standard[R].Tech Rep Publication 180-1,Federal InformationProcessing Standard(FIPS),National Institute of Standards and Technology,USDepartment of Commerce,Washington DC,April 1995.
[64]周江.基于分层组播的拥塞控制研究[硕士学位论文].华中科技大学,2004.
[65]Mathew Liste,Content Delivery Networks(CDNs)-A Reference Guide[EB/OL].Cisco2000.
[66]Guillaume Urvoy-Keller and Ernst W.Biersack.A Congestion Control Model for Multicast Overlay Networks and its Performance.Proc.of NGC 2002,October 2002,Pages:141-147.
[67]Gu-In Kwon Byers,W John.ROMA:Reliable Overlay Multicast with Loosely Coupled TCP Connections.to appear in Proc.of IEEE INFOCOM 2004,March 2004,Pages:7-11.
[68]D.G.Andersen,H.Balakrishnan,M.Frans Kaashoek,and R.Morris.Resilient overlay networks.In Proceedings of 18th ACM Symposium on Operating Systems Principles,October 2001,Pages:131-145.
[69]Y Chawathe,SE Mccanne,EA Brewer.RMX:Reliable multicast for heterogeneous networks[C].In Proceedings of INFOCOM'00,Mar.2000:795-804.
[70]Inktomi Corporation.The Inktomi Overlay Solution for Streaming Media Broadcasts.Inktomi whitepaper.
[71]Akamai Technologies[EB/OL].Inc.http://www.akamai.com.
[72]DL Tennenhouse,JM Smith,WD Sincoske,et al.A survey of active network research[J].IEEE Communications Magazine.1997,35(1):80-85.
[73]E Amir,S McCanne,R Katz.An Active Service Framework and its Application to Real-time Multimedia Transcoding[J].In Processdings of ACM SIGCOMM'98,Vancouver,British Columbia,Canada,September 1998,Pages:178-189.
[74]LW Lehman,SJ Garland,DL Tennenhouse,Active Reliable Multicast[C].In Proceedings of INFOCOM'98,Mar.1998,581-589 vol.2.
[75]J.B POSTEL,Transmission Control Protocol.Internet Engineering Task Force,September 1981.RFC 793.
[76]D Andersen,H Balakrishnan,F Kaashoek,et al.The case for resilient overlay network[C]//HotOS Ⅷ.Elmau/Oberbayern:IEEE Press,2001:152-157.
[77]S FLOYD,M HANDLEY,J PADHYE,J WIDMER.Equation-Based Congestion Control for Unicast Applications.In Proc.ACM SIGCOMM(Stockholm,Sweden,Sept.2000),43-54.
[78]Suchitra Raman,Yatin Chawathe,and Steven McCanne,libsrm:The Berkeley SRM toolkit,University of California,Berkeley,Software available at http://www-mash.cs.berkeley.edu/mash/software/srm2.0.
[79]Jiang Zhen,Zhang hongke,Zhang liyong.Research and Implementation of IPSec inside Operating System.Proceedings of SPIE.2002,4909:286-291.
[80]Lee Goo Yeon,Lee Yong.Efficient Rekey Interval for Minimum Cost on Secure Multicast System Using Group Key.IEEE Global Telecommunications Conference.2002,2:1995-1999.
[81]姜圳.基于Qos地组播路由关键技术研究[博士学位论文].哈尔滨理工大学,2005
[82]戴琼海,覃毅力,张莹.组播通信的访问控制和密钥管理.电子学报.2002,30(12A):2020-2023.
[83]屈劲,葛建华,蒋铭.安全组播的Huffman层次密钥管理.软件学报.2003,14(1):151-157.
[84]Liu Jing,Zhou Mingtian.Key Management and Access Control for Large Dynamic Multicast Groups.Ruan Jian Xue Bao/Journal of Software.2002,13(2):291-297.
[85]卿斯汉,蒙杨.分布式应用中的多级安全密钥管理.电子学报,2001,29(2):269-271.
[86]Bergadano Francesco,Cavagnino Davide,Crispo Bruno.Individual Authentication in Multiparty Communications.Computers and Security.2002,21(8):719-735.
[87]Jiang Zhen,Zhang hongke,Zhang liyong.A Key Management Approach of Multicast.Proceedings of SPIE.2002,4909:276-280.
[88]Wade Trappe,Jie Song.Key Management and Distribution for Secure Multimedia Multicast.IEEE Transactions on Multimedia.2003,5(4):544-557.
[89]吴家皋.覆盖网络多播路由协议及算法的研究[博士学位论文].东南大学,2005.
[90]杨武勇,史美林.面向多媒体协作应用的基于代理的应用层自适应组播,计算机科学,2004Vol-31No.12.
[91]陈益新,吴家皋,杨音颖.可服务定制的流媒体应用层组播系统,计算机工程与应用,2005.8.
[92]余胜生,郑心炜,胡文斌.基于密度树的P2P视频流多播.小型微型计算机系统,2006 27(11)2020-2024.
[93]YU Sheng-sheng,ZHENG Xin-wei,ZHOU Jing-li.A P2P Scheme for Live Media Stream Multicast,2006 12th International MultiMedia Modelling Conference (IEEE 2006).Jan,2006:473-477.(EI/ISTP检索)
[94]余胜生,郑心炜,周敬利.基于非线性软阈值的小波图像压缩方法。计算机工程与科学,2005 27(12)30-32.
[95]李晶.实时多媒体数据跨网关传输及拥塞控制技术研究[硕士学位论文],华中科技大学,2004.
[96]郑心炜,余胜生.最小延迟的应用层多播树算法研究.小型微型计算机系统(已录用,待发表).
[97]C Norolilia,F Tobagi.Evaluation of Multicast Routing Algorithms for Multimedia Streams[A].In Proeeedings of the IEEE International Telecommunications SymPosium[C].Technical Report,1994.
[98]B M Waxman.Routing of MultiPoint Conneetions[J].IEEE Journal on Seleeted Areas in Communications,1988,6(9):1617-1622.
[99]H F Salama.Multicast Routing for Real-Time Communieation on High-Speed Networks[PhD thesis],North Carolina State University,DePartment of Eleetrical and Computer Engineering,1996.