共查询到20条相似文献,搜索用时 125 毫秒
1.
2.
与面向源节点的路由算法不同,Core Based多播路由算法在网络中为一个多播组上 的多个多播连接只建立一棵共享树,从而实现了提高了网络资源利用率的目的。本文针对 Core Based多播路由中 core节点的定位问题,提出了一个同时最小化多播时延及目标节点间时延抖动的 core节点定位算法 QOCP。由仿真结果可知,这里提出的方法在优化服务质量性能指标方面明显优 于文中涉及的其他算法。 相似文献
3.
在许多多播应用中,降低多播树网络费用非常重要.本文提出了加权的基于多播节点的多播路由算法(WDDMC算法).由于改变了DDMC(Destination-Driven routing for low-cost Multicast )算法中的指示函数,适当降低了多播节点作为中间节点的优先级,提高非多播节点作为中间节点的优先级,从而使得多播树更接近最小Steiner树.在随机网络上的仿真结果表明,WDDMC算法的多播树网络费用优于DDMC算法.该算法的复杂度与DDMC算法完全相同. 相似文献
4.
5.
Ad Hoc网络中一种基于QoS的分布式多播路由算法 总被引:6,自引:0,他引:6
通过分析Ad Hoe网络的特点及基于QoS的多播路由问题,提出了一种新的分布式多播路由算法。实验和分析的结果表明,文中构造的路由方案成功地解决了Ad Hoe网中基于QoS的多播路由问题。当Ad Hoe网络的拓扑结构改变不太快时,本文提出的路由方案不仅满足了实时业务对网络带宽和端到端延时的要求,优化了路由树的代价,而且有效地控制了算法的复杂性并可适用于大规模的网络中。 相似文献
6.
7.
通信网络宏观可靠性指标的全代数化算法 总被引:6,自引:0,他引:6
为了更全面和客观地评价宽带大容量通信网络的可靠性能,引入宏观可靠性指标--总容量归一化加权可靠性指标概念,它是把通信容量和链路可靠性参数有机地综合在一起的指标.解决该指标全代数化计算的关键问题是寻找能够算出网络各节点之间全部路由的代数化路由算法.研究出一种逻辑代数化网络路由算法,n个节点的网络只需n次矩阵变换运算,就能得到任意节点之间的全部路由.基于新路由算法研究出网络可靠性指标的全代数化算法,它易于编写程序,利用计算机可以很方便地算出通信网络的可靠性指标,解决了总容量归一化加权可靠性指标计算困难问题,且达到实用化程度.利用算例验证了算法的正确性,并对算法的各计算过程进行了详细说明. 相似文献
8.
9.
《现代电子技术》2016,(8):51-54
传统网络多播路由编码方法采用多播分布树进行编码,但链路容量遭遇瓶颈,致使编码节点较多,导致浪费带宽资源的问题。在此提出基于Koetter指数时间的网络多播路由改进编码算法对编码软件进行设计,分析多播路由的总体设计,通过数据包编码转发模块在多播拓扑不相交路径上进行编码和转发多播数据包,利用输入模块实现网络多播路由和上游节点的信息交换,通过开关仲裁模块判断能够向特定输出端口传输信息的输入端口,利用死锁控制模块对出现死锁现象的路由节点进行检测,一段时间后使多播路由恢复正常的数据交换,通过输出模块对数据的输出进行管理。以降低带宽资源为目的,采用Koetter指数时间算法实现网络多播路由编码,并给出编码的详细代码。实验结果表明,所提方法不仅节省网络资源,而且显著降低多播路由时延,增强网络吞吐量。 相似文献
10.
电力线通信为配电自动化业务的开展提供了廉价的数据通信平台,但由于配电网具有网络拓扑未知和信道时变的特点,会导致可靠性降低和通信距离存在不足,这些问题很难在物理层进行解决,需要通过上层的通信协议来解决。为此提出一种自适应的路由算法,通过此算法可以形成节点之间的正常路由功能和链路修复功能,以增大电力线载波通信的通信距离,并提高其可靠性。仿真结果表明,该算法能够快速有效地找到网络协调节点到目的节点的路由。 相似文献
11.
针对无线网络中资源受限的组播路由问题,考虑网络节点的节点度限制和网络链路的带宽约束,以最小化组播路由开销为目标,提出了一种二进制编码方式的基于灰狼优化算法的组播路由策略.在给定的网络拓扑下,基于灰狼优化算法的组播路由策略可以迅速找到一棵包含源和目的节点的最小开销组播树.仿真结果表明,相比于遗传算法,所提出的基于灰狼优化... 相似文献
12.
传感器感知的信息需要通过网络传送给感兴趣目标节点,传统网络中的多播技术往往能耗高、实时性不够理想,不利于在传感器网络中使用。针对WSN中节点对网络拓扑未知,该文先将多播路由问题演化为最优多播路径问题,通过启发式算法求解分布式最优路径,并通过一种基于贪婪思想的裁剪合并策略优化多播路由树,直至整个网络得到最优路径,最后并结合了节点区域集中以及无线多播特性,提出了DCast路由算法。最后通过仿真实验与uCast, SenCast等经典的传感器网络的多播路由算法仿真比较,可以得出其算法在时延性以及能耗等方面性能有优势。 相似文献
13.
提出了一种用于无线传感器网络簇间通信的自适应节能路由优化算法。网络中以总体通信能耗最小为首要原则建立端到端之间的路由,并对簇间通信提出了一种优化算法,使得簇首之间相互通信时,可以在直接、中继以及协作3种不同方式中自适应地选择最节能的通信方式。所提出的路由算法可确保源节点与基站通信过程中选择到最优或次优的节能路由,并可降低由于通信覆盖盲区造成的通信中断的概率。仿真结果表明,与其他传感器网络路由算法相比,所提出的路由算法在相同吞吐量和误码率前提下每一轮都消耗更少的能量,并且在不同的节点密度下都可有效地延长网络的生命周期和工作时间。 相似文献
14.
15.
本文介绍了曙光5000高性能计算机多播网络设计的关键技术.减少多播与单播/多播与多播间的网络竞争是降低多播延迟的主要途径之一,而无死锁则是保障多播操作正确完成的前提.为了解决死锁问题,本文提出了一种基于全局资源公告的死锁避免方法;为了获得较低的多播延迟,本文充分利用胖树拓扑特点,提出了一种基于重载交换机去除的多播路径选择策略.测试结果表明,在网络重载情况下,相比于已有多播路径选择算法,本文的路径选择策略可以获得近三倍的性能提升.对于many-to-many多播通信,曙光5000多播网络可以获得90%以上的多播吞吐率. 相似文献
16.
Yu Quan Wu Kejun Luo Guoming Jin Yongxin 《电子科学学刊(英文版)》2007,24(3):412-416
A Minimizing Intermediate Multicast Routing protocol (MIMR) is proposed for dynamic multi-hop ad hoc networks. In MIMR, multicast sessions are created and released only by source nodes. In each multicast session process, the source node keeps a list of intermediate nodes and destinations, which is encapsulated into the packet header when the source node sends a multicast packet. Nodes receiving multicast packets decide to accept or forward the packet according to the list. Depending on topology matrix maintained by unicast routing, the shortest virtual hierarchy routing tree is constructed by improved Dijkstra algorithm. MIMR can achieve the minimum number of intermediate nodes, which are computed through the tree. No control packet is transmitted in the process of multicast session. Load of the network is largely decreased. Experimental result shows that MIMR is flexible and robust for dynamic ad hoc networks. 相似文献
17.
18.
19.
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. 相似文献
20.
Virtual Source Based Multicast Routing in WDM Optical Networks 总被引:2,自引:0,他引:2
Wavelength-division multiplexed (WDM) networks using wavelength-routing are considered to be potential candidates for the next generation wide-area backbone networks. Multicasting is the ability to transmit information from a single source node to multiple destination nodes and is becoming an important requirement in high-speed networks. As WDM technology matures and multicast applications become increasingly popular, supporting multicast routing at the WDM layer becomes an important and yet a challenging topic. This paper concerns with the problem of optical multicast routing in WDM networks. A few nodes in the network may have wavelength conversion and/or splitting capabilities. In this paper, a new multicast tree construction algorithm is proposed. This algorithm is based on a concept called virtual source. A virtual source is a node having both the splitting and wavelength conversion capabilities. By exploiting the presence of virtual source nodes, the proposed algorithm achieves improved performance. To further improve the performance, the algorithm assigns priorities to nodes based on their capabilities. The effectiveness of the proposed algorithm is verified through extensive simulation experiments. 相似文献