共查询到18条相似文献,搜索用时 468 毫秒
1.
路由选择机制是分布式多媒体系统中的重要研究方向.其中,基于服务质量的多媒体通信目的节点加入与退出算法是关键组成部分.该文在基于服务质量的多媒体通信初始路由建立算法的基础上,基于资源共享原则,提出支持成员动态加入与退出多媒体组通信的目的节点加入与退出算法,以增加使用费用最小为目标在满足服务质量约束的条件下完成目的节点加入,在不影响多媒体组通信服务质量的前提下,在完成目的节点退出的同时最大限度地释放已占用资源.文中还探讨了这些算法的有效性.它们和基于服务质量的多媒体通信初始路由建立算法相结合,可以提供对分布式多媒体组应用服务质量保证的支持. 相似文献
2.
一种目的节点启动多媒体组通信成员加入算法 总被引:1,自引:0,他引:1
文中在基于服务质量的动态组多媒体通信初始路由建立算法基础之上,提出了一种由目的节点启动的基于服务质量的支持成员加入动态组的算法。该算法同初始路由建立算法及目的节点退出算法相结合,可以提供对分布式多媒体动态组应用服务质量保证的支持。 相似文献
3.
基于服务质量的多媒体组通信目的节点加入与退出算法的研究 总被引:2,自引:0,他引:2
路由选择机制是分布多式媒体系统中的重要研究方向。其中,基于服务质量的多媒体通信目的节点加入与退出算法是关键组成部分。该文在基于服务质量的多媒体通信初始路由建立算法的基础上,基于资源共享原则,提出支持成员动态加入与退出多媒体组通信的目的节点加入与退出算法,以增加使用费用最小为目标在满足服务质量约束的条件下完成目的节点加入,在不影响多媒体组通信服务质量的前提下,在完成目的节点退出的同时最大限度地释放已占用资源。文中还探讨了这些算法的有效性。它们和基于服务质量的多媒体通信初始路由建立算法相结合,可以提供对分布式多毁体组应用服务质量保证的支持。 相似文献
4.
文中在基于服务质量的动态组多媒体通信路由建立算法基础之上,提出了一种由目的节点的基于服务质量的支持成员加动态组的算法。该处同初始路由建立算法及目的节点退出算法相结合,可以提供对分布式多媒体动态组应用服务质量保证的支持。 相似文献
5.
很多分布式多媒体应用都属于组应用,例如远程教学、远程医疗诊断、计算机会议。根据是否允许成员动态加入/退出组,分布式多媒体组应用可以分成动态组和静态组两类。支持动态组应用的基于QoS的路由选择机制仍然是分布式多媒体系统中有待进一步深入研究的问题。对于动态组应用,可以认为最初只有两个成员,对于动态组应用,可以认为最初只有两个成员,随着应用的进行,成员可以动态加入与退出因而路由选择机制需要支持以下三个问题的解决:初始路由建立、成员动态加入、成员动态退出。 相似文献
6.
7.
8.
移动自组织网络路由选择算法研究进展 总被引:1,自引:1,他引:1
移动Ad Hoc无需基础设施,可支持高动态的移动数据通信,具有广泛应用的前景。然而,其高动态特性导致互联网现有路由协议不再适用。近年来学者针对Ad Hoc网络提出了大量的路由选择算法。给出了各种路由技术分类方法,简述了Ad Hoc网络的基本路由协议和路由选择算法,进而从预测模型、能量模型、位置信息、服务质量控制和安全支持等5个角度,深入分析了当前Ad Hoc网络路由选择算法的最新研究进展。预测模型通过基于历史信息的移动预测,降低了路由选择的时间代价;能耗模型则采用适当的数学模型来描述网络能耗情况,在选路过程中实现了分组传送的能耗最小化和能量负担均衡之间的权衡;基于位置的路由选择算法根据节点的地理位置来标识目的地,从而利用该地理位置信息进行路由选择;服务质量感知的路由选择算法在本地计算中考虑带宽、延迟、能量和电池生命周期,从而在选路过程中提供了服务质量支持;安全路由选择算法则利用适合移动Ad Hoc网络的密钥、哈希链、电子签名等技术对协议交互消息进行加密来保障网络安全。最后从通信开销、计算和存储开销、路径数量、关键节点的存在性以及算法类型等方面详细对比总结了近年来提出的30余种典型路由选择算法,指出了各自的特点... 相似文献
9.
10.
自由光通信网络作为一种新兴的宽带无线网络,适用于多媒体通信的要求。针对多媒体业务在FSO网络中的传输进行了研究,考虑FSO网络的特点,提出了适用于多媒体任务的FSO网络模型。利用该模型,设计了基于拓扑控制算法的路由算法TCR。TCR改进三角剖分算法进行拓扑控制,形成虚拟拓扑图,使得节点的平均吞吐量大;同时,TCR是基于位置的、按需和主动混合的路由,适用于数据量大,实时性要求高的多媒体通信需求。 相似文献
11.
Algorithms for delay-constrained low-cost multicast tree construction 总被引:19,自引:0,他引:19
With the proliferation of multimedia group applications, the construction of multicast trees satisfying quality of service (QoS) requirements is becoming a problem of prime importance. Multicast groups are usually classified as sparse or pervasive groups depending on the physical distribution of group members. They are also classified based on the temporal characteristics of group membership into static and dynamic groups. In this paper, we propose two algorithms for constructing multicast trees for multimedia group communication in which the members are sparse and static. The proposed algorithms use a constrained distributed unicast routing algorithm for generating low-cost, bandwidth and delay constrained multicast trees. These algorithms have lower message complexity and call setup time due to their nature of iteratively adding paths, rather than edges, to partially constructed trees. We study the performance (in terms of call acceptance rate, call setup time and multicast tree cost) of these algorithms through simulation by comparing them with that of a recently proposed algorithm (V. Kompella, J.C. Pasquale, G.C. Polyzos, Two distributed algorithms for the constrained Steiner tree problem, in: Proc. Comp. Comm. Networking, San Diego, CA, June 1993) for the same problem. The simulation results indicate that the proposed algorithms provide larger call acceptance rates, lower setup times and comparable tree costs. 相似文献
12.
《Knowledge》2006,19(7):554-564
The delay and delay variation-bounded Steiner tree problem is an important problem in real-time multimedia networks, and is known to be NP-complete. In this paper, we propose an efficient heuristic multicast routing algorithm based on simulated annealing named SADDVMA to construct the constrained Steiner tree. To avoid enlargement of search area and increase of computing time, the proposed heuristic algorithm uses a procedure called Paths-switching to construct neighbors in feasible region according to the relationship between delay and delay variation. We also give a method to dynamically reorganize the multicast tree in response to changes for the destinations. Simulations demonstrate that our algorithm is better in terms of tree cost as compared to the existing algorithms. Further, it performs excellent performance of delay and delay variation, rapid convergence and better real-time property. 相似文献
13.
一种基于服务质量的启发式点对点多媒体通信路由选择算法 总被引:3,自引:1,他引:3
1 引言分布式多媒体应用通常有比较严格的QoS需求。通常,如果网络要向分布式多媒体应用提供QoS保证,就应该进行接纳控制并且作出资源预约。但是,接纳测试和资源预约依赖于路由,仅当路由选择算法找到有足够资源满足应用需求的路径时,才能作出资源预约,也才能确定能否提供先验QoS保证。因此,路由选择算法需要考虑应用的QoS需求,同时,从尽可能多地容纳分布式多媒体应用用户的角度出发,在进行路由选择时还应考虑QoS计费。研究基于QoS的网络路由选择机制既有理论意义也有应用价值。 相似文献
14.
《Knowledge》2006,19(3):172-179
With the development of multimedia group applications, the construction of multicast routing tree satisfying Quality of Service (QoS) is more important. In many multicast applications, it is required that the network supports dynamic multicast, which the membership of the multicast group changes with the time. In this paper an effective heuristic algorithm is proposed for dynamic multicast routing with delay-constrained. Aims of this proposed algorithm is to guarantee that: (1) the cost of multicast tree is as small as possible at each node addition/removal event, (2) all the maximal path delay is meet a fixed delay-constrained, (3) minimize perturbation to an existing tree. The proposed algorithm is based on ‘damage’ and ‘usefulness’ concept, and a Balancing Factor (BF) is provided to judge whether or not to arrange a region of tree. Mutation operation in Genetic Algorithm (GA) is also employed to find an attached node in tree for a dynamic adding node. Simulation shows that our algorithm performs well than those static heuristic algorithms in term of cost especially. 相似文献
15.
《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. 相似文献
16.
17.
随着多媒体应用的普及,服务质量(Quality of Service,QoS)保证已逐渐成为Ad Hoc网络必须支持的一项重要功能,QoS 路由对实现Qos保证起着非常重要的作用,而带宽又是QoS保证的最重要参数之一,因此提出了一种基于TDMA的带宽约束的Ad Hoc网络QoS按需路由协议。该协议采用了启发式的带宽计算算法。仿真结果验证了协议的有效性,表明该QoS路由协议具有较好的端到端性能,可以满足Ad Hoc网络的路由需求。 相似文献
18.
研究了该算法在QoS组播路由问题中的应用,描述了QoS路由优化问题。基于多个不相关可加度量的QoS路由问题是NP完全问题,目前采用的方法多为启发式算法。由于蚁群算法是一种基于蚁群系统原理的、具有自组织能力的、新型的启发式优化算法,利用其能够寻找最短路径这一特性,提出了一种基于蚁群系统原理,用于解决时延和时延抖动约束问题的组播路由问题的QoS组播路由算法。该算法改进了路径选择策略,优化了信息素更新公式。仿真结果表明,该算法能够迅速、准确地找到最优解。 相似文献