期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
基于蚁群算法的QoS多播路由优化策略
1
作者 崔明义 张新祥 +1 位作者 苏白云 张瑞 《计算机应用与软件》 CSCD 北大核心 2007年第10期50-52,共3页
对QoS多播路由和约束最小Steiner多播树进行了分析,提出了基于蚁群算法搜索约束最小Steiner多播树的ACMC算法,并与DDMC算法进行了实验比较。结果表明,在同样环境和多播组规模的条件下,ACMC算法花费的网络代价小于DDMC算法,从而验证了ACM... 对QoS多播路由和约束最小Steiner多播树进行了分析,提出了基于蚁群算法搜索约束最小Steiner多播树的ACMC算法,并与DDMC算法进行了实验比较。结果表明,在同样环境和多播组规模的条件下,ACMC算法花费的网络代价小于DDMC算法,从而验证了ACMC算法的有效性和可行性。 展开更多
关键词 QOS多播路由 Steiner多播树 蚁群算法 ddmc算法 ACMC算法
下载PDF
Performance Analysis on Destination Driven Multicast Routing Algorithm
2
作者 Cheru Haile Yimer Amedie Yimenu Atinaf 《Journal of Computer and Communications》 2022年第2期46-56,共11页
The internet’s architecture today has a problem in routing information depending on what the receiver is interested in without knowing the sender and receiver addresses. As a result, the Publish-Subscribe paradigm wa... The internet’s architecture today has a problem in routing information depending on what the receiver is interested in without knowing the sender and receiver addresses. As a result, the Publish-Subscribe paradigm was developed. In this network, we build and use in the design, implementation, and evaluation of Publish-Subscribe network via destination driven multicast routing algorithm for selecting the shortest path in the network. Basically, the networks have Router to perform routing mechanism, the publisher is the producer of information, and the subscriber is the consumer of information with their own deferent type of module for facilitating their function. Every connection in the network is bidirectional way of communication (an undirected graph) with random seed available in the network. Each Router has topology management module for creating a picture of the networks and computing the available path. It informs to the forwarder in order to send the information of network for intended receiver. Record table module used for recording of the network information comes from the subscriber or the publisher via link state advertisement then it informs to the topology manager. In this network, the receiver and sender don’t expect to be active at the same time, don’t know each other’s addresses, and don’t use any blocking mechanisms or client send requests and server replay responses. The Publish-Subscribe network is first developed and designed enough, after which it is implemented and evaluated using the destination driven multicast routing algorithm (DDMC) to pick the shortest path in the network and active match published information. The proposed work evaluated via total bit (produced 1,000,000 bit per second), and throughput was 83.33%. 展开更多
关键词 PUBLISH-SUBSCRIBE ddmc Link State
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部