共查询到20条相似文献,搜索用时 109 毫秒
1.
介绍分析了几种典型的IP多播路由协议,如距离向量多播路由协议、协议独立多播、多播开放最短路径优先和基于核心树的多播等,并对这几种IP多播路由协议进行了分析对比。 相似文献
2.
本从IP多播技术的概念、基础知识,IP多播路由及其协议。IP多播路由中的隧道传输机制。IP多播技术的应用等方面。详细地介绍了IP多播技术及其应用。 相似文献
3.
丈章给出一种基于移动组的全序可靠多播协议-MGTOM(Mobile-group-based Totally Ordered Reliable Multicast)协议,借助于逻辑令牌环来实现.MGTOM协议实现了移动组多播的原子性和全序性,原子性用于保证多播消息能够最终传递到移动组内的所有移动Agent,全序性则保证任意一对多播消息都按照相同顺序被所有组内移动Agent传递.在多播算法中,为了保证原子性,所有收到多播消息的组成员必须回复,然后持有令牌的组成员作为Sequencer,对多播消息进行排序. 相似文献
4.
5.
多播提供了一种以一对多的方式发送数据的有效通讯机制,它没有为上层提供任何服务质量和投递保证。为了提高其可靠性,设计了大量的可靠多播协议,但设计一种在各种不同应用情况下都适合的多播协议是不可能的。针对在C/S架构下,基于双机热备的系统,设计了一种简单弹性可靠多播协议——SFRM(simple Flexible Reliable Multicast)协议。 相似文献
7.
本文主要研讨了具有QoS约束的动态多播路由问题.文中描述了一种适用于QoS多播路由的网络模型,提出了一种动态QoS多播路由协议(DQMRP),该协议能操作在单播路由协议的顶层,它只要求网络链路(或节点)的局部状态信息,不需要维护全局状态信息.DQMRP可有效地减少构造一棵多播树的开销,多播组成员可动态地加入/退出多播会晤.该协议可搜索多条可行树枝,并能选择一条最优(或近优)树枝将新成员连接到多播树.文中给出了DQMRP的正确性证明和复杂性分析,并通过仿真实验验证了该协议的可用性和有效性. 相似文献
8.
分析介绍了几种典型的IP多播路由协议,如DVMRP、PIM、MOSPF和CBT等,并对这几种IP多播路由协议进行了分析对比。 相似文献
9.
适用于视频会议与在线聊天室的CSM(Conference Steiner Multicast)协议,在支持移动主机时存在多播树切换频率过高,网络开销过大的问题。运用Range(服务范围)的概念,结合Mobile IP隧道技术,提出了一种改进的CSM协议--RBCSM(Range Based CSM)协议。RBCSM协议在降低多播切换频率,节省网络带宽方面性能优越。同时由于运用了Mobile IP的隧道技术,还有进一步提高网络安全性的可能,最后,对CSM和RBCSM的多播树切换频率及多播树路径总长度两个性能指标进行了仿真模拟比较。 相似文献
10.
11.
组播协议由于能够有效的利用网络带宽并降低服务器的负担因而受到广泛的关注.其中的共享树组播协议由于具有良好的扩展性而得到更多的支持,然而目前的共享树组播协议在动态移动环境中的性能很差,一些改进协议(单核移动协议)虽然可以很好的提高原有协议的性能但是所需要的额外开销很大.针对这种情况,本文提出了一种新的共享树组播协议-动态多核协议,该协议能够根据组播成员的分布动态的渐进的调整组播树的形状,从而能够在低开销的情况下为移动用户提供良好的性能.计算机仿真和数学分析都表明动态多核协议要明显优于共享树组播协议和单核移动协议. 相似文献
12.
Pricing Multicast Communication: A Cost-Based Approach 总被引:3,自引:0,他引:3
Multicast and unicast traffic share and compete for network resources. A cost-based approach to multicast pricing, based on accurate characterization of multicast scalability, will facilitate the efficient and equitable resource allocation between traffic types. Through the quantification of link usage, this paper establishes a multicast scaling relationship: the cost of a multicast distribution tree varies at the 0.8 power of the multicast group size. This result is validated with both real and generated networks, and is robust across topological styles and network sizes. Since multicast cost can be accurately predicted given the membership size, there is strong motivation to price multicast according to membership size. Furthermore, a price ceiling should be set to account for the effect of tree saturation. This tariff structure is superior to either a purely membership-based or a flat-rate pricing scheme, since it reflects the actual tree cost at all group membership levels. 相似文献
13.
14.
15.
基于EPON的可控组播技术 总被引:1,自引:0,他引:1
以太无源光网络( EPON)作为光纤到户的理想解决方案之一,凭借其带宽优势非常适合承载组播业务.EPON可控组播技术结合EPON的特点,从安全性和可维护性考虑,提出了一套可控组播实现方案,包括组播源管理、用户认证和组播流量控制等内容,以满足组播业务可维、可控的运营管理需要. 相似文献
16.
Multicast routing research efforts have mostly focused on supporting the host-group model in which multicast packets are addressed to a host (or multicast) group. Another multicast routing approach uses multi-destination addressing, where a multicast packet carries a list of the unique (unicast) addresses of all the group members. This form of routing can be accomplished using limited or no additional state beyond the existing unicast routing tables. It, therefore, scales well with the number of multicast sessions but does not scale well with the size of the multicast group and, in fact, requires the size of the multicast group to be below a certain threshold. In this paper, we envision a future scenario in which both host-group and multi-destination addressing routing approaches coexist within the Internet. We develop a dynamic routing context for this future scenario wherein a multicast session can adapt among different routing configurations depending on the number of multicast group members and how this number changes over time. We consider three routing options: (1) A single multi-destination addressed flow – suitable for small-group sessions, (2) multiple multi-destination addressed flows – suitable for medium-group sessions and (3) a single host-group addressed flow – suitable for large-group sessions. For multicast sessions that vary in group membership over time, different routing protocols may be best at different points in time. Our work is concerned with the development and evaluation of protocols that allow a multicast session to dynamically switch among these three routing options as the size of the session changes. 相似文献
17.
18.
19.
20.
Wireless ad hoc and sensor networks are emerging with advances in electronic device technology, wireless communications and mobile computing with flexible and adaptable features. Routing protocols act as an interface between the lower and higher layers of the network protocol stack. Depending on the size of target nodes, routing techniques are classified into unicast, multicast and broadcast protocols. In this article, we give analysis and performance evaluation of tree‐based multicast routing in wireless sensor networks with varying network metrics. Geographic multicast routing (GMR) and its variations are used extensively in sensor networks. Multicast routing protocols considered in the analytical model are GMR, distributed GMR, demand scalable GMR, hierarchical GMR, destination clustering GMR and sink‐initiated GMR. Simulations are given with comparative analysis based on varying network metrics such as multicast group size, number of sink nodes, average multicast latency, number of clusters, packet delivery ratio, energy cost ratio and link failure rate. Analytical results indicate that wireless sensor network multicast routing protocols operate on the node structure (such as hierarchical, clustered, distributed, dense and sparse networks) and application specific parameters. Simulations indicate that hierarchical GMR is used for generic multicast applications and that destination clustering GMR and demand scalable GMR are used for distributed multicast applications. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献