摘要
随着三网融合业务的迅猛发展，以IPTV、视频点播及网络直播等为代表的流媒体应用不断涌现。这些应用都拥有庞大的用户规模，适合采用一对多的传输方式。组播技术是一种高效的点到多点数据分发手段，能够有效节省网络资源，减少互联网带宽压力。然而，在大规模流媒体组播应用中，组播路由的自适应性、规模的可扩展性和流量传输的可控性等问题，对现有的组播传输技术提出了巨大挑战。因此，研究大规模流媒体组播传输技术具有十分重要的意义，成为网络传输领域学术界和工业界共同关注的热点。
本文针对大规模流媒体组播传输的几个关键问题，深入分析了组播路由协议和算法、体系结构以及传输控制等方面的发展现状，提出了一种基于标播的流媒体传输体系结构，重点研究了基于邻居梯度的组播路由技术、基于Bloom filter的可扩展组播转发引擎和基于服务等级的边缘到边缘动态组播流量控制技术，并在此基础上设计和实现了标播交换节点原型，并对标播流媒体原型系统进行了部署和测试。
主要贡献包括以下几个方面：
1、提出了一种基于标播的适合于大规模流媒体传输的体系结构LMTA。LMTA将IP接入网络和骨干承载网络隔离，根据流量的特点，骨干承载网络采用标播网络或者经典IP核心网络。LMTA主要设备包括本地媒体中心、标播交换节点、核心路由器、客户端和内容服务器等。本地媒体中心LMC是IP接入网络和骨干承载网络之间重要的控制和转发入口，综合了标签控制器、组成员管理器和边缘路由器的功能。LMTA利用标播传输协议LTP对流媒体数据进行标签交换转发。LMTA对不同类型的流量采用不同的骨干承载网络，具有较好的自适应性和可扩展性。
2、针对标播网络和经典IP核心网络的组播路由自适应性问题，提出了一种策略可配置的组播服务模型PMSM，分为策略管理平面、路由控制平面和数据转发平面三个平面，能够将策略灵活地扩展到组播服务模型中。基于此服务模型，定义了邻居梯度的概念和转发规则，综合考虑共享组播树路径、链路剩余带宽、跳数等因素。在此基础上，提出了静态组成员的邻居梯度组播路由算法GMR-S和动态组成员的邻居梯度组播路由算法GMR-D。在根据邻居梯度建立组播树时，利用发现消息和反馈消息进行路由计算。模拟实验显示了该算法的有效性和灵活性。与其他经典的组播算法相比，GMR-S的呼叫受阻率最低，同时组播树代价和平均跳数具有良好的性能，GMR-D能够有效地适应组播树的改变并优化组播树。
3、针对经典IP核心网络中核心路由器组播转发可扩展性问题，提出了一种基于Bloom filter的可扩展组播转发引擎BSM。BSM采用Bloom filter保存组播转发信息，路由器的组播信息建立、删除和更新由组成员管理协议来完成，BSM用(s,G)来标识一个组播组，其中s为源的单播地址，G为由源分配的标准的D类组播地址。组播转发信息保存在接口的Bloom filter中，当组播数据报文到达路由器接口时，对报头中的组标识(s,G)进行hash计算，如果匹配成功，则从相应的接口转发。模拟实验表明，BSM不仅可以支持大规模组数量，同时也支持大规模长时间在线的组成员，具有较高的转发效率和较低的带宽消耗。
4、针对组播流量的可控性问题，提出了一种与骨干承载网络无关的基于服务等级的边缘到边缘动态组播流量控制机制E2E-DFCM。发送端根据报文对视频质量的影响在报文标记上质量影响标识，发送端视频网关对组播报文进行分类、服务等级映射和标记，并周期性地向接收端视频网关发送前馈报文，接收端视频网关将延迟和报文丢失率等信息反馈给发送端视频网关。发送端视频网关根据网络状况和接收端服务等级的变化动态地调整发送速率。模拟结果显示E2E-DFCM能够有效地调整发送速率，满足用户服务等级的异构性，适合大规模流媒体组播传输。
5、基于上述关键技术的研究，设计并实现了基于NetMagic平台的标播交换节点原型。NetMagic有一个内置的用户模块UM，提供了灵活的硬件逻辑可重构功能，通过对UM模块的设计来实现对LTP报文的处理。标播交换节点在处理LTP报文时主要进行修改报文头部的时间戳域和TTL域、重新计算IP头校验、查找标签表获取下一跳输出并替换报头的标签域等处理。同时，实现并部署了标播流媒体传输原型系统。通过建立真实的实验环境对流量进行监测，根据监测结果选择合适的路径进行转发。原型系统的测试验证了流媒体传输体系结构LMTA的可行性和有效性。标播流媒体传输原型系统已经在部分商用IPTV传输平台部署，完成了总体设计、详细设计以及关键技术的实现。
综上所述，本文研究工作针对大规模流媒体组播传输中存在的自适应性、可扩展性和可控性方面存在的问题，围绕流媒体组播传输技术展开研究，对于推进组播在流媒体传输中的实际部署具有一定的理论意义和应用价值。
With the rapid development of Triple Play industries, more and more streamingmedia applications such as IPTV, Video-On-Demand and webcast, etc., arecontinuously emerging. These applications have immensely large users scale, and arevery suitable for point-to-multipoint transmission mode. Multicast is a technique used tofacilitate these types of one-to-many data delivery, by transmitting the same data fromone source to a potentially large number of destinations. So multicast can efficientlysave network resource and reduce the bandwidth stress of Internet. However, with thecontinued growth of streaming media applications, multicast confronts with adaptability,scalability and controllability challenges. Therefore, research on multicast transmissiontechnology is great significance for large-scale streaming media applications, and it hasbeen widely recognized by both global academia and industry today that how to designefficient multicast transmission technology is one of the hot research topics.
In this thesis, we study some key problems of large-scale streaming mediamulticast transmission technologies, and argue the recent proposals of multicast routingprotocols, algorithms and architectures. We start our research from the proposedLabelcast based Media Transport Architecture, and then we focus on the research onneighbor gradient based multicast routing technology, a Bloom filter-based scalablemulticast forwarding engine and a service lever based edge-to-edge dynamic multicastflow control technology. We also design and implement a Labelcast switch nodeprototype, and deploy a Labelcast streaming media prototype system to validate ourwork.
The major contributions of our work are as following:
1. A Labelcast-based Media Transport Architecture (LMTA), which is verysuitable for large-scale streaming media transmission, is proposed. The IP accessnetwork and backbone network is isolated in LMTA. And the Backbone network isselected as Labelcast network or classical IP core network according to the flowcharacteristics. The main equipments in LMTA include: Local Media Center (LMC),Labelcast Switch Node(LSN), Core Router(CR), Client and Content Server. LMC is theimportant controlling and forwarding point between IP access network and backbonenetwork, and it has the integrated functions of Label Controller, Group Manager andEdge Router. Meanwhile, LMTA makes use of Labelcast Transport Protocol(LTP) todelivery data with label switching. LMTA could only adopt different backbone networkfor diverse flow types, but also has the adaptability and scalability in advance comparedwith other multicast architectures.
2. Aiming at the adaptability problem of multicast routing in Labelcast networkand classical IP core network, we present a Policy-enabled Multicast Service Model(PMSM), which is divided into three planes: Policy Manage Plane, RoutingControl Plane and Data Forwarding Plane. In PMSM, policies can be embedded flexiblyinto this multicast service. Based on this model, the neighbor gradient definition andforwarding rule is defined, which is calculated based on the weighted sum of attributessuch as residual link capacity, normalized hop count, etc. Then two distributed multicastrouting algorithms which are neighbor Gradient-based Multicast Routing for Staticmulticast membership (GMR-S) and neighbor Gradient-based Multicast Routing forDynamic multicast membership (GMR-D), are proposed. Discovery message andfeedback message are used for discovering multicast routing path when establishing themulticast tree based on the neighbor gradient. GMR-S is suitable for static membershipsituation, while GMR-D can be used for the dynamic membership network environment.Experimental results demonstrate the effectiveness and efficiency of our proposedmethods.
3. Aiming at the scalability problem of multicast routing in classical IP corenetwork, we present a Bloom filter-based Scalable Multicast—BSM. In BSM, themulticast information of the BSM router is setup, deleted and updated by membershipmanagement protocol. A multicast group is identified by a group tag(s,G), where s is thesource address and G is the D class IP multicast address. Bloom filter is used to presentthe multicast information in each interface of the routers. When a multicast packetarrives at the router, the group tag(s,G) in the header will be hashed by the hashfunctions. If the results are matched, the packet will be forwarded toward this interface.Simulation results show that BSM can not only support hundreds of thousands ofmulticast groups with long-lived membership, but can also support large multicastgroup size. Meanwhile, BSM can achieve high forwarding efficiency and lowbandwidth overhead.
4. Aiming at the controllability problem of multicast transmission, a service leverbased Edge-to-Edge Dynamic Flow Control Multicast (E2E-DFCM), which isindependent from the backbone network, is proposed. The main idea of E2E-DFCM isas follows: The packets which have been labeled with Quality Effect Identifier (QEI) isgathered and remapped by Sending Video Gateway (SVG). Receiving Video Gateway(RVG) periodically sends multicast flow status information to SVG, including delay,loss rate, etc.; SVG dynamically remaps and classifies packets according to QEI andflow status information feedback from RVG, and reassigns each QoS level flow ratesbased on their utilities. Once the QoS of receivers can not be satisfied (i.e.,average delayand loss rate exceed the tolerable range), RVG even requests to down-grade its level,and SVG will reduce the sending rate. In the end, simulation results show thatE2E-DFCM can effectively adjust the sending rate dynamically and satisfy the diversityof user service lever for large-scale streaming media multicast transmission.
5. Based on the above research work, a Labelcast switch node prototype based on
NetMagic experimental platform is designed and implemented. There is a UserModule(UM) in NetMagic platform, which can provide hardware logic reconfigurablefunction. And the LTP packet processing is implemented by the design of UM. When aLTP packet is arriving at the Labelcast switch node, the packet processing includes:modifying the time and TTL field, recomputing the IP header checksum, looking up thelabel table, getting the next hop port, and replacing the label field, etc. Meanwhile, aLabelcast steaming media transmission prototype system is built and deployed. Thestreaming media flows are monitored in the real experimental environment, and thesuitable paths will be chosen according to the monitor results. The prototype systemvalidates the feasibility and effectiveness of LMTA. Labelcast steaming mediatransmission prototype system has already deployed in some commercial IPTVtransmission platform, and the implementation of key technologies has been achieved.
In summary, we focus on the adaptability, scalability and controllability problemsfor large-scale streaming media transmission technologies. We believe that these workshave academic and practical value for advancing the theory and practicability of theabove research.
引文
[1] Traffic Analysis Research [EB/OL].http://www.caida.org/research/traffic-analysis/.
[2]中国互联网信息中心.中国互联网络发展状况统计报告[R].中国互联网信息中心(CNNIC).2012.
[3]流媒体网[EB/OL]. http://www.lmtw.com/.
[4] Internet Protocol television (IPTV)[EB/OL].http://en.wikipedia.org/wiki/IPTV.
[5] Lee GM, Lee CS, Rhee WS, et al. Functional Architecture for NGN-BasedPersonalized IPTV Services [J]. IEEE Transactions on Broadcasting,2009,55(2):329-342.
[6] Multimedia Research Group, Inc. IPTV Global Forecast–2010to2014[R].http://www.mrgco.com/iptv/gf1210.html.
[7]互联网数据中心IDC. Netguide2008中国互联网调查报告[R],技术报告:DCCI互联网数据中心,2008.
[8] Deering SE, Cheriton DR. Multicast routing in internetworks and extendedLANs [J]. ACM Transactions on Computer System,1990,8(2):85-110.
[9] Deering S. RFC1112: Host Extensions for IP Multicasting [S]. InternetEngineering Task Force, Aug.1989.
[10] Eriksson H. MBONE: the multicast backbone [J], Communications of theACM,1994,37(8):54-60.
[11] IETF (Internet Engineering Task Force)[EB/OL]. http://www.ietf.org/.
[12] Diot C, Levine BN, Lyles B, et al. Deployment issues for the IP multicastservice and architecture [J]. IEEE Network.2000,14(1):78-88.
[13] Almeroth K. Keynote: Multicast Help Wanted: From Where and How Much
[C]? In Proceedings of Workshop on Peer-to-Peer Multicasting (P2PM) at IEEEConsumer Communications and Networking Conference (CCNC),2007.
[14] Lao L, Cui JH, Gerla M, et al. A Comparative Study of Multicast ProtocolsTop, Bottom, or In the middle[C]? In Proceedings of IEEE INFOCOM2005, LosAngeles, CA, USA,2005,2809-2814.
[15] Francis P. Yoid: Extending the Internet Multicast Architecture[R]. TechnicalReport, ACIRI,2000. http://www.icir.org/yoid/docs/index.html.
[16] Chu Y, Rao SG, Seshan S, et al. A case for end system multicast [J]. IEEEJournal on Selected Areas in Communications.2002,20(8):1456-1471.
[17] Chawathe Y. Scattercast: An Architecture for Internet Broadcast Distributionas an Infrastructure Service [D]. University of California, Berkeley, December2000.
[18]曹继军.应用层组播稳定性提高技术研究[D],国防科学技术大学计算机学院,2009,4.
[19]曹继军,苏金树.代理型应用层组播体系结构研究[J].计算机科学,2009(5):45-50.
[20] Banerjee S, Kommareddy C, Kar K, et al. Construction of an efficient overlaymulticast infrastructure for real-time applications [C]. In Proceedings of IEEEINFOCOM,2003:1521-1531.
[21] Lao L, Cui JH, Gerla M. TOMA: A viable solution for large-scale multicastservice support[C]. In Proceedings of IFTP NETWORKING,2005. LNCS3462,906-917.
[22] IRTF(Internet Research Task Force)[EB/OL]. http://www.irtf.org/.
[23] Boivie R, Feldman N, Imai Y, et al. RFC5058: Explicit Multicast (Xcast)Concepts and Options[S]. Internet Engineering Task Force, November2007.
[24] Ratnasamy S, Ermolinskiy A, Shenker S. Revisiting IP Multicast[C]. InProceedings of ACM SIGCOMM2006, Aug.2006,15–26.
[25] Jokela P, Zahemszky A, Rothenberg CE, et al. LIPSIN: Line speedpublish/subscribe inter-networking [C]. In Proceedings ACM SIGCOMM2009, Aug.2009,195–206.
[26] S rel M. BloomCasting for Publish/Subscribe Networks [D]. Aalto University,2011.
[27] Tian X, Cheng Y, Shen X. DOM: A scalable multicast protocol fornext-generation Internet [J]. IEEE Network,2010,24(4):45–51.
[28] Tian X, Cheng Y, Liu B. Design of a scalable multicast scheme with anapplication-network cross-layer approach [J]. IEEE Transactions on Multimedia,2009,11(6):1160–1169.
[29] Rothenberg CE, Macapuna CAB, Magalh es MF, et al. In-packet Bloom filters:Design and networking applications [J]. Computer Networks,2011,55(6):1364–1378.
[30] Holbrook H, Cain B. RFC4607: Source-Specific Multicast for IP [S]. InternetEngineering Task Force, August2006.
[31] Fenner W. RFC2236: Internet Group Management Protocol, Version2[S].Internet Engineering Task Force, Nov.1997
[32] Cain B, Deering S, Fenner B, et al. RFC3376: Internet Group ManagementProtocol, Version3[S]. Internet Engineering Task Force, October2002.
[33]组播流媒体网[EB/OL]. http://mvn.cn/
[34]林闯,贾子骁,孟坤.自适应的未来网络体系结构[J].计算机学报,2012,35(6):1077-1093.
[35] Ballardie T, Francis P, Crowcroft J. Core based trees (CBT)[J].ACMSIGCOMM Computer Communication Review,1993,23(4):85-95.
[36] Waitzman D, Deering S, Partridge C. RFC1075: Distance Vector MulticastRouting Protocol[S]. Internet Engineering Task Force, Nov.1988.
[37] Moy J. RFC1585: MOSPF: Analysis and Experience[S]. Internet EngineeringTask Force, Mar.1994.
[38] Deering S, Estrin D, Farinacci D, et al. The PIM architecture for wide-areamulticast routing [J]. IEEE/ACM Transactions on Networking,1996,4(2):153-162.
[39] Thaler D. RFC3913: Border Gateway Multicast Protocol (BGMP): ProtocolSpecification[S]. Internet Engineering Task Force, September2004.
[40] Holbrook H, Cain B. RFC4607: Source-Specific Multicast for IP [S]. InternetEngineering Task Force, Aug.2006.
[41]刘莹,徐恪. Internet组播体系结构[M].科学出版社,2008.
[42] Garey MR, Johnson DS. Computer and Intractability: A Guide to the Theory ofNP-Completeness [M].W. H. Freeman Co. New York,1979.
[43] Cormen TH, Leiserson CE, Rivest RL, et al. Introduction to Algorithms, ThirdEdition[M].MIT Press,2009, Section24.1: The Bellman–Ford algorithm,651–655.
[44] Novak R, Rugelj J, Kandus G. Steiner Tree Based Distributed MulticastRouting in Networks [J]. Steiner Trees in Industries,2000,8(5):1–25.
[45] Kou L, Markowsky G, Berman L. A fast algorithm for Steiner trees [J]. ActaInformatica,1981,15(2):141-145.
[46] Monaghan JJ. An introduction to SPH [J]. Computer Physics Communications,1988,148(1):88–96.
[47] Kompella VP, Pasquale JC, Polyzos GC. Multicast routing for multimediacommunication [J]. IEEE/ACM Transactions on Networking,1993,1(3):286–92.
[48] Guo L, MATTA I. QDMR: an efficient QoS dependent multicast routingalgorithm[C]. In Proceedings of5th IEEE Real-Time Technology and ApplicationsSymposium,1999,213-222.
[49] Jia X. A distributed algorithm of delay-bounded multicast routing formultimedia applications in wide area networks [J]. IEEE/ACM Transactions onNetworking,1998,6(6):828-837.
[50] Garg N, Khandekar R, Kunal K, et al. Bandwidth Maximization inMulticasting[C]. In Proceedings of the11th Annual European Symposium onAlgorithms,2003,242-253.
[51] Turkcu O, Somani AK. Efficient Multicasting Approaches UsingCollection-Distribution Networks[C]. In Proceedings of the Mini-Conference at IEEEINFOCOM2011,2011,141-145.
[52] Luebben R, Li G, Wang D, et al. Fast Rerouting for IP Multicast in ManagedIPTV Networks[C]. In Proceedings of17th International Workshop on Quality ofService (IWQoS2009),2009,1-5.
[53] G Kandavanam, D Botvich, Balasubramaniam S, et al. PaCRAm: Path awareContent ReplicationApproach with Multicast for IPTV Networks[C]. In Proceedings ofthe IEEE Globecom2010,2010,1-6.
[54] G Kandavanam, D Botvich, Balasubramaniam S, et al. PaCRA: A Path-awareContent Replication Approach to Support QoS Guaranteed Video on Demand Service inMetropolitan IPTV Networks[C].2010IEEE Network Operations and ManagementSymposium (NOMS2010),2010,591-598.
[55] Belghith A, Mnaouer AB, Ali NB. A Taboo-based Search Algorithm toEnhance Multicast Routing under Multiple Additive Constraints[C]. In Proceedings ofIEEE/ACS International Conference on Computer Systems and Applications (AICCSA2009),947–954.
[56] Forsati R, Haghighat AT, Mahdavi M. Harmony search based algorithms forbandwidth-delay-constrained least-cost multicast routing [J]. ComputerCommunications,2008,31(10):2505–2519.
[57] Forsati R, Mahdavi M, Haghighat AT, et al. An efficient algorithm forbandwidth-delay constrained least cost multicast routing [C]. In Proceedings ofCanadian Conference on Electrical and Computer Engineering2008,1641–1646.
[58] Damanafshan M, Khosrowshahi-Asl E, Abbaspour M. GASANT: Anant-inspired least-cost QoS multicast routing approach based on genetic and simulatedannealing algorithms [J]. Int J Comput Commun,2012,7(3):417-431.
[59] Vijayalakshmi K, Radhakrishnan S. Artificial immune based hybrid GA forQoS based multicast routing in largecale networks (AISMR)[J]. ComputerCommunications,2008,31(17):3984–3994.
[60]胡虹雨,陆慧梅,曹元大等.支持时延-带宽约束的动态层次组播路由[J],计算机学报,2009,32(3):564-575.
[61]胡虹雨,毕军,陆慧梅.大规模组播路由中组播相关信息聚集问题研究.清华大学学报(自然科学版),2011,51(12):1800-1807.
[62] Wang H, Shi Z, Li S. Multicast routing for delay variation bound using amodified ant colony algorithm [J]. Computer Applications,2009,32(1):258–272.
[63] Wen CC, Wu CS, Yang MT. Hybrid Tree Based Explicit Routed Multicast forQoS Supported IPTV Service[C]. In Proceedings of IEEE Global TelecommunicationsConference (GLOBECOM2009),2009,1-6.
[64] Cho TW, Rabinovich M, Ramakrishnan K, et al. Enabling ContentDissemination using Efficient and Scalable Multicast[C]. In Proceedings of IEEEINFOCOM2009,2009,1980-1988.
[65] Jin X, Cheng KL, Chan SHG. Island Multicast: Combining IP Multicast withOverlay Data Distribution [J]. IEEE Transactions on Multimedia,2009,11(5):1024-1036.
[66] Bikfalvi A, García-R J, Vidal I, et al. P2P vs. IP multicast: Comparingapproaches to IPTV streaming based on TV channel popularity [J]. Computer Networks,2011,55(6):1310–1325.
[67] Shin MK, Kim YJ, Park KS, et al. Explicit Multicast Extension (Xcast+) forEfficient Multicast Packet Delivery [J]. ETRI Journal,23(4):202-204.
[68] Boudani A. Compatibility and Analysis of Explicit Multicast for NetworkGames oriented Applications [R]. TRD France,2007.
[69] Jokela P, Zahemszky A, Arianfar S, et al. LIPSIN: Line speedpublish/subscribe inter-networking [R]. PSIRP Document,2009. http://www.psirp.org/
[70] Wei Y, Yu Z, Guan Y. A Novel Architecture for Secure and Scalable Multicastover IP Network [J]. Security and Privacy in Communication Networks,2009,19(8):417–436.
[71] M S rel, Rothenberg CE, Zahemszky A, et al. BloomCasting: Security inBloom Filter based multicast[C].In Proceedings of NordSec2010, LNCS, Vol (7127),2012,1-16.
[72] Yang Y, Wang J, Yang M. A Service-Centric Multicast Architecture andRouting Protocol [J], IEEE Transactions on Parallel and Distributed Systems,2008,19(1):35-51.
[73] Yang M, Yang Y. Constructing minimum cost dynamic multicast trees underdelay constraint[C]. In Proceedings of14th International Conference on ComputerCommunications and Networks (ICCCN2005),2005,133-138.
[74] Cui JH, Kim J, Maggiorini D, et al. Aggregated multicast-a comparative study,Cluster Computing,2005,8(1):15–26.
[75] Ali NB, Belghith A, Moulierac J, et al. QoS multicast aggregation undermultiple additive constraints [J]. Computer Communications,2008,31(15):3564–3578.
[76] Ali NB, Moulierac J, Belghith A. mQMA: multi-constrained QoS MulticastAggregation[C]. In Proceedings of IEEE Global Telecommunications Conference(GLOBECOM '07),2007,1927–1932.
[77] Li J, Yuksel M, Kalyanaraman S. Explicit Rate Multicast Congestion Control[J]. Computer Networks,2006,50(15):2614–2640.
[78] Rosberg Z, CRussell C, Sivaraman V. Rate and End-to-End Delay Control forMulticast and Unicast Flows[C]. In Proceedings of IEEE International Conference onCommunications (ICC '09),2009,1-6.
[79] Bouras C, Gkamas A, Kioumourtzis G. Adaptive Smooth Multicast Protocolfor Multimedia Data Transmission[C]. In Proceedings of International Symposium onPerformance Evaluation of Computer and Telecommunication Systems (SPECTS2008),2008,269–276.
[80] Bouras C, Gkamas A, Kioumourtzis G. Adaptive smooth multicast protocol formultimedia transmission: Implementation details and performance evaluation [J].International Journal of Communication Systems,2010,23(3):299–333.
[81] Nishioka J, Miyake Y, Nakazato H, et al. Performance Study on DERACS: ATraffic Control Scheme for Video Multicast[C]. In Proceedings of IEEE GlobalTelecommunications Conference (GLOBECOM '06),2006,1-5.
[82] McCanne S, Jacobson V, Vetterli M. Receiver-driven layered multicast [C]. InProceedings of ACM SIGCOMM'96,1996,117-13.
[83] Xiong N, Jia X, Yang LT. A Distributed Efficient Flow Control Scheme forMultirate Multicast Networks [J].2010, IEEE Transactions on Parallel and DistributedSystems,21(9):1254–1266.
[84] Xiong N, Vasilakos AV, Yang LT, et al. An Adaptive and Predictive Approachfor Autonomic Multirate Multicast Networks [J]. ACM Transactions on Autonomousand Adaptive Systems,2011,6(3):1-22.
[85] Zhang Z, Li VOK. Network-Supported Layered Multicast Transport Controlfor Streaming Media [J]. IEEE Transactions on Parallel and Distributed Systems,2007,18(9):1332-1344.
[86] Lucas V, Pansiot JJ, Grad D. Fair Multicast Congestion Control (M2C)[C]. InProceedings of IEEE INFOCOM Workshops2009,2009,1-6.
[87] Johansen S, Kim AN, Perkis A. Quality Incentive Assisted Congestion Controlfor Receiver-Driven Multicast[C]. In Proceedings of IEEE International Conference onCommunications (ICC '07),2007,1642-1647.
[88] Zou J, Xiong H, Song L, et al. Prioritized Flow Optimization with GeneralizedRouting for Scalable Multirate Multicasting[C]. In Proceedings of IEEE InternationalConference on Communications (ICC '09),2009,1-6.
[89] Aggarwal R, Rekhter Y, Rosen E. RFC:5331:MPLS Upstream LabelAssignment and Context-Specific Label Space[S]. Internet Engineering Task Force,August2008.
[90] Biersack E, Nonnenmacher J. WAVE: A new multicast routing algorithm forstatic and dynamic multicast groups[C]. In Proceedings of5th Network and OperatingSystem Support for Digital Audio and Video (NOSSDAV1995),1995,228-239.
[91] Baumann R, Heimlicher S, Lenders V. HEAT: Scalable Routing in WirelessMesh Networks Using Temperature Fields[C]. In Proceedings of IEEE InternationalSymposium on a World of Wireless (WoWMoM2007),2007,1-9.
[92] Shi X, Chen Y, Lu G, et al. PMTA: Potential-based Multicast Tree Algorithmwith Connectivity Restricted Hosts[C]. In Proceedings of IEEE GlobalTelecommunications Conference (GLOBECOM '07),2007,559-564.
[93] Basu A, Lin A, Ramanathan S. Routing Using Potentials: A DynamicTraffic-Aware Routing Algorithm[C]. In Proceedings of SIGCOMM'03,2003.37-48.
[94] Balasubramaniam S, Botvich D, Mineraud J, et al. Parameterised gradientbased routing (PGBR) for future internet[C]. In Proceedings of International Conferenceon Advanced Information Networking and Applications (AINA'09),2009,58-65.
[95] Balasubramaniam S, Mineraud J, McDonagh P, et al. An Evaluation ofParameterized Gradient Based Routing With QoE Monitoring for Multiple IPTVProviders [J]. IEEE Transactions on Broadcasting,2011,57(2):183-194.
[96] Floyd RW. Algorithm97: Shortest Path [J]. Communications of the ACM,1962,5(6):345.
[97] Salama HF. MCRSIM simulator source code and Users’ Manual [Z]. Centerfor Advanced Computing and Communication, North Carolina State University,Raleigh,1995.
[98]谭敏强.宽带网络上的IP组播技术研究[D].北京邮电大学.2003
[99] Salama HF. Multicast routing for real-time communication on high-speednetworks [D]. North Carolina State University,1996.
[100] Waxman BW. Routing of multipoint connections [J]. IEEE Journal onSelected Areas in Communications,1988,6(9):1617-1622.
[101] Sriram R, Manimaran G, Murthy CSR. A rearrangeable algorithm for theconstruction of delay-constrained dynamic multicast trees [J]. IEEE/ACM Transactionson Networking,1999,7(4):514-529.
[102] www.tudou.com [EB/OL]
[103] Inoue T, Katayama Y, Sato H, et al. Multicast Forwarding Plane in FutureNetworks: Source Routing Has a Competitive Edge[C]. In Proceedings of IEEEGlobecom2010Workshop on Network of the Future,2010,333–338.
[104] www.xunlei.com [EB/OL]
[105] Stoica I, Ng TSE, Zhang H. REUNITE: A Recursive Unicast Approach toMulticast[C]. In Proceedings of IEEE INFOCOM2000,2000,1644-1653.
[106] Boudani A, Cousin B. An hybrid explicit multicast/unicast recursiveapproach for multicast routing [J]. Computer Communications,2005,28(16):1814–1834.
[107] Luo H, Harfoush K. Adaptive Hybrid Multicast with Partial NetworkSupport[C] In proceedings of HONET2008,2008,233–239.
[108] Cui JH, Lao L, Faloutsos M, et al. AQoSM: scalable QoS multicastprovisioning in Diff-Serv networks [J]. Computer Networks,2005,50(1):80–105.
[109] Li D, Cui H, Hu Y, et al. Scalable data center multicast using multi-classbloom filter[C]. In Proceedings of IEEE ICNP'11,2011,266-275.
[110] Yu M, Fabrikant A, Rexford J. BUFFALO: Bloom filter forwardingarchitecture for large organizations[C]. In Proceedings of ACM CoNEXT'09,2009,313–324.
[111] Arianfar S, Ott J, Eggert L. ConTug: A Receiver-Driven TransportProtocol for Content-Centric Networks[C]. In Proceedings of IEEE ICNP'10,2010,Poster Session.
[112] D. Li, H. Cui, Y. Hu, et al. Scalable data center multicast using multi-classbloom filter[C]. In Proceedings of IEEE ICNP'11,2011,266-275.
[113] Rothenberg CE, Macapuna CAB, Magalh es MF, et al. In-packet Bloomfilters: Design and networking applications [J]. Computer Networks.2011,55(6):1364–1378.
[114]谢鲲,文吉刚,张大方等.布鲁姆过滤器查询算法[J].软件学报,2009,20(1):96108．
[115] Fan L, Cao P, Almeida J, et al. Summary cache: A scalable wide-area webcache sharing protocol [J]. IEEE/ACM Transactions on Networking,2000,8(3):281-293.
[116] http://www.nsnam.org/releases/.[EB/OL]
[117] Rizvi S. Performance analysis of Bloom filter-based multicast [D].Master's Thesis. Aalto University,2011.
[118] Rocketfuel ISP topology data.http://www.cs.washington.edu/research/networking/rocketfuel.
[119] Kurose JF. Ross KW. Computer Networking—a Top Down ApproachFeaturing the Internet.Second Edition [M]. Publisher: Addison Wesley,2003:12-21.
[120] Mankin A, Romanow A, Bradner S, et al. RFC2357: Criteria forEvaluating Reliable Multicast Transport and Application Protocols[S]. InternetEngineering Task Force, June1998.
[121] Vicisano L, Rizzo L, Crowcroft J. TCP-like Congestion Control forLayered Multicast Data Transfer[C]. In Proceedings of INFOCOM'98,1998,996-1003.
[122] Sisalem D, Wolisz A. MLDA: A TCP-friendly congestion control forheterogeneous multicast environments[C]. In Proceedings of Eighth InternationalWorkshop on Quality of Service (IWQoS2000),2000,65-74.
[123] Striegel A, Manimaran G. DSMCast: a Scalable Approach for DiffServMulticasting [J]. Computer Networks,2004,44(6):713-735.
[124] http://en.wikipedia.org/wiki/Point_of_presence.
[125]吴建平,刘莹,吴茜.新一代互联网体系结构理论研究进展[J].中国科学E辑:信息科学,2008,38(10):1540-1564.
[126] Wiegand T, Noblet L, Rovati F. Scalable Video Coding for IPTV Services[J]. IEEE Transactions on Broadcasting,2009,55(2):527-538.
[127] Shin J, Kim JW, Kuo CCJ. Quality-of-Service Mapping Mechanism forPacket Video in Differentiated Services Network [J]. IEEE Transactions on Multimedia,2001,3(2):219-231.
[128] Heinanen J, Guerin R. RFC2698: A two rate three color marker[S].Internet Engineering Task Force, September1999.
[129] Netmagic论坛. http://bbs.netmagic.org.
[130] NetMagic设计白皮书—UMS接口规范v1.1[R], NetMagic研究组,http://netmagic.nudt.edu.cn
[131] Welch J, Clark J. RFC4445: A Proposed Media Delivery Index[S].Internet Engineering Task Force,2006.
