基于ns-2的SSM组播模型仿真

组播技术能以高效、可扩展的方式发送点到多点、多点到多点数据。传统的组播模型与协议存在可扩展性差等问题，至今未能在Internet得到广泛应用。新型的SSM组播服务模型，能克服传统组播模型的缺点，有望在Internet上得到广泛应用。本文实现了SSM组播服务模型，并对SSM实现机制进行了分析，利用所实现的SSM组播模型进行了仿真实验，论证了SSM组播模型的简单与高效性。     

基于配队蚁群算法的QoS组播路由方法

QoS组播路由是网络信息传输的一项关键技术,提出了一种配队蚁群算法对该问题进行求解。算法以满足约束条件下的组播分解、策略控制下的组播树生成为基本思想;定义了扩展组播树,并改进了蚁群算法的信息素更新策略,使之更适合于组播问题的求解。仿真实验表明,该算法能快速搜索并收敛到全局(近似)最优解,且随着网络规模的增大算法保持了良好的特性。     

基于决策图贝叶斯的多目标QoS组播路由算法

随着实时组播通信需求的不断增长，要求网络能够提供更加严格高效的QoS(Quality of Service)路由保证，需要设计一个能够同时满足不同QoS约束的高效组播路由算法。此问题可归结为图论中的NP(Non-Polymenital)问题，一般方法是把多个QoS参数加权合并为一单目标函数进行优化。提出了一种基于决策图贝叶斯的多目标QoS组播路由算法，算法在不需做预处理的情况下可对多个不同的QoS参数同时进行优化。仿真结果表明，所提出的算法能够快速收敛于一组满足不同QoS约束的非支配解。     

基于线性能量函数的组播路由算法性能评价策略

作为下一代高速网络的核心技术之一,多约束服务质量组播路由成为了当前网络研究的重点,但对算法性能进行合理的评价仍是一个开放性问题。提出了一种基于线性能量函数的组播路由算法性能综合评价策略——IESMR。算法通过线性能量函数将待评价组播算法的各项QoS性能转化为单一度量值,考察其距极限最优能量值的偏差半径作为算法性能综合度量指标。     

适用于大规模分布式交互仿真的应用层组播研究

组播技术具有良好的伸缩性和高效的数据传输效率,是大规模分布式交互仿真应用中理想的通信机制。早期的组播技术研究侧重于从IP层提供组播通信支持,但IP组播的实施涉及到网络基础设施的调整,且大规模应用还受到一些技术因素的阻碍。应用层组播(ALM)将组成员组织成覆盖网络为数据传输提供服务,组播功能完全由终端系统在应用层实现,从而易于大规模部署和实现。本文介绍了应用层组播模型的机理和构造协议,分析了大规模DIS系统中通信需求的特点,探讨在大规模DIS中实施应用层组播的一些相关问题。     

两种带多约束的组播路由算法

组播对其成员节点能够提供服务质量,且组播在未来通信网络当中起到越来越重要的角色.对多约束斯坦利最小树问题,提出了基于Boruvka方法的多约束组播算法(BMCMRA)与基于Kruskal方法的多约束组播算法(KMCMRA).仿真试验表明算法具有良好代价性能,且能够很好地满足多约束条件.     

组播核心结点选择算法及仿真分析

核心结点的选择对组播共享树的形状和路由的性能有重要影响。通过建立组播网络的抽象模型,分析相邻结点之间偏心距的关系,提出了一种适用于大规模网络拓扑的中心结点选择算法,偏心距减小(EccentricityDecreaseAlgorithm,简称EDA)算法。利用VC 语言制作的仿真测试平台,对EDA算法和穷举算法进行了仿真分析。仿真结果表明:EDA算法能够选择出拓扑图的中心结点,在CPU运行时间上优于穷举算法。     

一个时延约束的动态组播路由算法

分析了时延约束的动态最小代价组播路由问题，然后基于贪婪思想设计了一个动态组播树生成算法DCDG（Delay—Constrained Dynamic Greedy Algorithm），用于在动态环境下构造时延约束的低代价组播树。该算法通过节点动态贪婪地选择满足时延约束的最短路径加入组播树来降低代价；若时延不满足要求，则通过合并DDSP（Destination-Driven Shortest Path Algorithm）最小时延路径来产生一个满足时延约束的低代价组播树。仿真实验表明：DCDG算法动态生成的组播树代价较低、性能稳定，而计算复杂度仅为O（n）；在严格的时延约束下会话成功率高。     

异构组播网络中效用最大化的速率控制算法

针对单播和多速率组播共存网络中资源最优分配问题，本文以用户效用最大化为目标，考虑组播异构性，将单播和组播任务纳入统一的凸规划模型研究，并应用惩罚函数法推导出一种启发式速率控制算法。仿真结果表明该算法能保证单播与多速率组播公平共享网络资源，算法选择不同的效用函数可使资源分配满足不同的公平性准则，资源利用获得不同的效率。     

交互式视频点播服务器容量需求

真正的视频点播系统(TVOD)能够使用户在任意时刻观看任意节目且支持用户任意的VCR交互,但服务器资源消耗巨大.提出一种新的支持用户操作的流媒体调度方案:规则组播固定调度RMFS.RMFS周期调度常规组播,保证了流合并中目标流的存在.分析了RMFS方案的最佳组播间隔和服务器容量需求.仿真结果证明RMFS可扩展性好,即使在很高的客户交互强度下,与TVOD相比,也能够减少服务器带宽消耗91.7%.     

Performance study on Gossip-based group key distribution protocal

1 .INTRODUCTIONIP multicast[1]communication is an efficient means ofdistributing datato a group of participants .Incontrastto unicast communication, multicast routing permits asingle IP datagramto be routedto multiple hosts si m-ultaneously. Membership in a multicast group is dy-namic ,so hosts canjoinandleavethe multicast sessionwithout the permissions or knowledge of other hosts .The inherent benefits of multicast routing may alsopresent some vulnerabilities making it susceptible toatt…     

基于时钟同步的混合型安全组播密钥管理

为保护组播通信的机密性,安全组播使用不为组外成员所知的密钥来加密数据,并随组成员关系的变化而动态更新。提出一种将平坦型和分层型密钥管理相结合的、基于IGMPv3的混合型方案,它将群组划分为多个独立的小区,有效地解决了与安全组播相关的扩展性和可靠性问题。提出了一种新的基于时钟同步的密钥管理算法,各小区代理不进行信息交换而只通过定时来执行批次密钥更新,从而有效地降低了系统的通信开销。     

多速率敏感无线多跳网中最小化延迟多播路由

针对物理层提供的多速率传输特性,研究了最小化多播延迟的问题。其主要思想是上游节点将对数据包的一次低传输速率广播换成若干次传输速率不同的广播,达到最小化多播延迟的目标。首先将该问题模型化为一个最优化问题,然后提出了一个分布式最小化延迟的多播路由DMDMR算法,并且证明了该算法能够取得最优值。大量模拟实验结果表明,与上游节点对数据包只进行一次广播的经典技术相比,DMDMR算法可降低多播延迟17%以上。     

Distributed QoS multicast routing protocol in ad hoc networks

1 .INTRODUCTIONMobile ad hoc networks ( MANET) , also calledthe infrastructureless mobile network or self-or-ganized network,consists of a collection of mobilenodes sharing a wireless channel without any cen-tralized control or established communication back-bone .ad hoc networks have no fixed routers ;allnodes are capable of movement and can be connect-ed dynamically in an arbitrary manner . Usually ,these nodes act as both end systems and routers atthe same ti me . Nodes of these netwo…     

QoS-aware multicast routing protocol for Ad hoc networks

1 .INTRODUCTIONA mobile ad hoc network ( MANET) is a multi-hopwireless network formed by a collection of mobilenodes without the intervention of fixedinfrastructure.Because an Ad hoc network is infrastructure-less andself-organized,it is used to provide i mpromptu com-munication facilities in harsh environments . Typicalapplication areas of mobile ad hoc networkinclude bat-tlefields ,emergency search,rescue sites and data ac-quisitionin remote areas . A mobile Ad hoc networkisalso usef…     

QoS multicast routing algorithm based on GA

1 .INTRODUCTIONTheprovisionofquality of service (QoS) guaranteesisofutmostimportanceforthedevelopmentofthemulticastservices .Multicastroutinghascontinuedtobeaveryimportantresearchissueintheareasofnet worksanddistributedsystems.Ithasattractedtheinterestsof…     

Optimizing on multiple constrained QoS multicast routing algorithms based on GA

With the rapid development of Internet, mobile networks and high-performance networking technology,multiple constrained QoS multicast routing optimization in networks with uncertain parameters has become a very important research issue in the areas of networks and distributed systems. It is also a challenging and hard problem to the next generation Internet and high-performance networks, and has attracted the interests of many people. This paper discusses the multiple constrained QoS multicast routing problem, which may deal with the delay, delay jitter,bandwidth and packet loss metrics, and describes a network model for researching the routing problem. The paper mainly presents multiple constrained QoS multicast routing algorithm (MCQMRA), a QoS multicast routing policy for Internet,mobile network or other high-performance networks, which is based on the genetic algorithm (GA) and can provide QoS-sensitive paths in a scalable and flexible wayin the network environment with uncertain parameters. The MCQMRA can also optimize the network resources such as bandwidth, delay, packet loss metrics and can converge to the optimal or near-optimal solution within few iterations, even for the network environment with uncertain parameters. Simulation results show that MCQMRA is an available approach to QoS multicast routing decision.     

A multicast routing algorithm with multiple trees

1.INTRODUCTION Qualityofservice(QoS)multicastroutinghascon tinuedtobeaveryimportantresearchtopicintheIn ternet.Multicastisacommunicationservicethatal lowssimultaneoustransmissionofthesamemessage fromonesourcetoagroupofdestinationnodes.To carryoutdifferentmulticastsessions,anetworkmust minimizethesessions’resourceconsumption,while meetingtheirrequirements.Efficientallocationof networkresourcestosatisfyQoSrequirementsisthe primarygoalofmulticastrouting.Howevertheinter dependencyandconfli…     

Reliable adaptive multicast protocol in wireless Ad hoc networks

1.INTRODUCTIONA wireless ad hoc networkis a multi-hop wireless net-workformed by a collection of mobile nodes withoutthe intervention of fixed infrastructure.Because awireless ad hoc networkis infrastructureless and self-organized,it is used to provide i mpromptu communi-cationfacilities in harsh environments.Typical appli-cation areas of wireless ad hoc networkinclude battle-fields,emergency search,rescue sites and data acqui-sitionin remote areas.A wireless ad-hoc network isalso useful …