共查询到19条相似文献,搜索用时 156 毫秒
1.
组播技术从IP组播向应用层组播的发展,解决了IP组播部署难的问题.应用层组播依靠终端主机进行组播数据的转发,需要解决应用层组播的稳定性.最小延迟组播树的生成等问题.首先分析了影响应用层组播稳定和延时的3个因素:节点稳定概率、节点出度约束和节点间的通信延时.根据这些影响因素抽象出基于稳定概率的度约束边带权应用层组播树生成T-SDE模型,给出稳定度在T-SDE下的表达形式,并证明T-SDE问题属于NP-hard;其次通过分析节点对组播树稳定和延时的贡献,给出3种基于节点稳定概率和链路贡献度的T-SDE问题的近似解决算法;实验表明,该类算法生成的组播树在平均延时、最大延时和稳定度等方面有较大优势. 相似文献
2.
度约束QoS组播路由遗传算法 总被引:2,自引:0,他引:2
有度约束的QoS组播路由问题在通信网络中具有重要意义。提出一种基于遗传算法的度约束组播路由算法,采用节点连接路径形式的编码方法构成一棵组播树的表示,设计了相应的具有树形结构的交叉和变异算子,以及节点度的改变算法。算法可以实现具有树形结构染色体的遗传进化。数值实验表明算法具有找到最优解的能力,特别适合于求解大规模网络有度约束的QoS组播路由问题。 相似文献
3.
针对应用层组播树存在的稳定性的问题,在双路径组播方案的基础上,综合考虑节点度和节点在线时间对组播树构建的权重影响,定义节点稳定度,提出一种节点稳定度的双路径应用层组播树构建算法.在构建双路径组播树时,使节点稳定度高的叶子节点在第二棵组播树中距离源节点较近,并根据节点稳定度的改变动态调整双路径应用层组播树中节点的位置,使得节点退出或加入组播组时,不需要重新构建组播树也可以接收到传输的多媒体数据,从而降低组播树的中断次数,提高应用层组播稳定性,改善应用层组播的性能.通过计算机仿真,表明改进算法在组播节点动态改变时提高了组播树的稳定性,改善了性能,适合多媒体组播业务传输. 相似文献
4.
一种基于策略函数的应用层组播路由算法 总被引:1,自引:1,他引:0
由于IP组播存在可扩展性差、难以管理等方面的缺陷,研究人员提出了应用层组播.实时传输是应用层组播技术的一个主要应用领域,对网络延迟有严格的限制.文中着重研究构建最小延迟应用层组播树的算法,提出一种基于策略函数构造应用层最小直径组播树的启发式算法BCT-H.该算法采用策略函数迭代的选择使生成树直径最短的路径,从而有效地减少了网络中的转发时延和同一条链路的重复分组数量.模拟实验表明该算法能够有效地降低链路强度,减少组播树的时延. 相似文献
5.
6.
由于应用层组播技术依靠终端主机转发组播数据,任意中间节点的退出都将造成系统的稳定性问题。同时,应用层组播技术对延时有严格的要求。为了提高应用层组播系统的稳定性和数据传输效率,根据影响应用层组播稳定性和延时的因素,抽象出基于节点稳定概率的度约束的最小延时应用层组播生成树问题模型SDMD (Spanning tree based on stability probability,degree-constrained,and minimum diameter for ALM),并且证明了该问题属于NP-hard问题。为了解决该问题,给出了基于节点时间增益因子的TG-S近似算法。仿真实验表明,TG-S算法生成的组播树在平均延时、最大延时和累积中断次数等方面有明显优势。 相似文献
7.
8.
由于IP组播存在可扩展性差、难以管理等方面的缺陷,研究人员提出了应用层组播。实时传输是应用层组播技术的一个主要应用领域,对网络延迟有严格的限制。文中着重研究构建最小延迟应用层组播树的算法,提出一种基于策略函数构造应用层最小直径组播树的启发式算法BCT-H。该算法采用策略函数迭代的选择使生成树直径最短的路径,从而有效地减少了网络中的转发时延和同一条链路的重复分组数量。模拟实验表明该算法能够有效地降低链路强度,减少组播树的时延。 相似文献
9.
应用层组播的最小延迟生成树算法 总被引:22,自引:1,他引:21
实时传输是应用层组播技术的一个主要应用领域,对网络延迟有严格的限制.保证低延迟组播成功的关键在于构建高效的应用层组播树,研究构建最小延迟应用层组播树的算法.首先分析影响延迟的3个因素:链路的传输时间、结点的发送/转发时间和结点度,然后把求解应用层组播树的问题抽象成对边和点都带权的有向图求解"度约束最小延迟生成树"的问题,同时证明这个问题属于NP-hard,并且提出了两类启发式近似算法:基于度的算法和基于最大延迟路径的算法.最后通过模拟实验说明了所提出算法的有效性. 相似文献
10.
P2P流媒体在网络上已经得到了广泛的开发与应用。一个流媒体系统中的应用层组播树的构建算法将直接影响到整个系统的效率及质量。提出一种新的服务于分布式覆盖网框架的应用层组播树的构建算法——CDDMA。CDDMA首先自治地构建一个探测节点结合,利用PPAF启发式综合考虑传输时延与节点出度作为加入节点加入组播树的评价函数,解决了原有的基于Mesh优先的应用层组播协议考虑网络因素单一的问题,并能解决组播树负载不均衡的问题。在SMesh的基础上,给出了CDDMA的实现,通过类似Internet网络拓扑结构的仿真,表明了这种算法降低了链路压力及路径伸展率。 相似文献
11.
《Journal of Parallel and Distributed Computing》2001,61(1):137-149
Depending on different switching technologies, the multicast communication problem has been formulated as three different graph theoretical problems: the Steiner tree problem, the multicast tree problem, and the multicast path problem. Our efforts in this paper are to reduce the communication traffic of multicast in hypercube multiprocessors. We propose three heuristic algorithms for the three problem models. Our multicast path algorithm is distributed, our Steiner tree algorithm is centralized, and our multicast tree algorithm is hybrid. Compared with the previous results by simulation, each of our heuristic algorithms improves the communication traffic in the corresponding multicast problem model. 相似文献
12.
Application layer multicast (ALM) provides a low-cost solution for multicast over the Internet. It overcomes the deployment hurdle of IP multicast by moving all multicast related functions from network routers to end-hosts. However, since packet replication is performed on end-hosts, the system performance of an ALM is limited by the bandwidth of end-hosts. Therefore, degree-constrained QoS-aware multicast routing becomes one of the key concerns for implementing realtime multicast services, such as continuous streaming applications. In this paper, we claim that the QoS gained by most users will be better evaluated using the overall latency, and we explore the optimization of Degree-Constrained Minimum Overall Latency Spanning Tree (DCMOLST). The process for optimizing the overall latency is divided into two phases, i.e., the initialization phase and the dynamic adjustment phase. In the former phase, we present a heuristic DCMOLST algorithm which negotiates both transmission delay and node bandwidth simultaneously, so as to avoid QoS degradation caused by any single metrics. In the later phase, we define a set of distributed iterative optimizing operations to swap the position between nearby end-hosts for further optimization. Experimental results show that the proposed degree-constrained QoS-aware routing algorithm could improve the overall performance of application layer multicast services. 相似文献
13.
针对时延约束下低代价组播树的构建方法,提出了一种基于关键节点的时延约束低代价组播路由算法.该算法对已有的动态时延优化的链路选择函数进行改进,并加入关键节点和关键次数的概念.在首次选择目的节点时,重点考虑关键节点和关键次数因素,降低了选择低代价链路的时间复杂性,再利用改进后的链路选择函数依次选择节点加入树中,进而产生满足要求的组播树.实验仿真结果表明,该算法不仅能正确构建出时延约束低代价组播树,且与其他算法相比,构成组播树所需平均时间更少. 相似文献
14.
基于蚁群系统的动态QoS多播路由算法 总被引:1,自引:0,他引:1
基于蚁群系统的自组织能力,提出了一个分布式的动态QoS多播路由的算法。与其他算法不同,在该算法中,蚁群从多播组的目的结点出发进行搜索,将每次迭代选中的符合QoS约束且具有最小代价的路径加入到多播树中,而多播树以“拉”的模式分布式地被构造。仿真结果表明,与其他两种算法相比,该算法具有更好的性能,能够快速有效地找到动态QoS多播路由问题的全局最(近)优解。 相似文献
15.
16.
针对无线传感器网络应用于输电线路故障传输时存在通信代价高、实时性差的问题,提出一种输电线路故障传输多播路由算法(MRFT)。抽象出输电线路故障信息传输网络模型;根据时延最短路径树(SPT)的最大端到端时延确定多播树时延上限,将时延上限边接入多播树;设计最小代价启发函数将剩余叶子节点接入多播树。仿真结果表明,与KPP算法相比,MRFT算法构造的多播树在多播树时延、端到端时延方差和多播树代价3个方面均有良好表现。该算法能够有效保证输电线路故障信息传输的实时性,降低通信代价。 相似文献
17.
18.
《Computers & Operations Research》2001,28(12):1149-1164
The distributed algorithm for a multicast connection set-up, based on the ‘cheapest insertion’ heuristic, is reviewed. The multicast routing problem is translated into a Steiner tree problem in point-to-point networks where nodes have only a limited knowledge about the network. A solution is proposed in which the time complexity and the amount of information exchanged between network nodes are proportional to the number of members of the multicast group. The Steiner tree is constructed by means of a distributed table-passing algorithm. The analysis of the algorithm presented, backed up by simulation results, confirms its superiority over the algorithm based on ‘waving technique’.Scope and purposeMulticasting is a mechanism used in communication networks that allows distribution of information from a single source to multiple destinations. The problem of finding a multicast connection for a static group of communicating entities in connection-oriented point-to-point network can be formulated in graph theory as a minimum Steiner tree problem. Due to NP-completeness of the Steiner tree problem multicast, routing algorithms are based on heuristics. The diversity of network environments and the lack of centralised information about network topology require an effective distribution of the multicast routing algorithms among the network nodes. This article presents an alternative to the distributed algorithm proposed by Rugelj and Klavzar that implements the same heuristics for the construction of a minimum cost multicast connection in point-to-point networks. The present algorithm constitutes a substantial improvement over that previously proposed with regard to running time and the amount of the information exchanged between network nodes. 相似文献
19.
路由算法是制约Peer-to-Peer 系统整体性能的关键因素之一.目前大多数路由算法无法保证全局收敛,而链路延迟、费用、网络带宽等现实制约因素往往在选路时被忽略.针对上述问题,提出了基于遗传算法的R-GA路由算法.通过适度函数和遗传因子,R-GA可以快速地实现全局收敛.同时将链路的延迟、费用、带宽等参数插入到适度函数中, 避免了盲目路由.仿真试验的结果表明,R-GA路由算法在大规模Peer-to-Peer系统中是高效和可扩展的. 相似文献