排序方式: 共有6条查询结果,搜索用时 15 毫秒
1
1.
一种基于克隆策略的多播路由算法 总被引:1,自引:0,他引:1
该文针对网络计算中的NPcomplet问题一带时延约束的多播路由问题,提出了一种基于克隆策略的路由算法.仿真实验表明,与基于遗传算法的多播路由算法相比,该算法具有更快的收敛速度和更好的全局寻优能力,而且算法稳定、灵活,操作简单. 相似文献
2.
Ronald Beaubrun Jhon-Fredy Llano-RuizBenoit Poirier Alejandro Quintero 《Journal of Network and Computer Applications》2012,35(1):403-411
Data dissemination is a process where information is transmitted towards different destinations. In order to prevent accidents, coordinate rescue operations and warn people about critical events, this process imposes end-to-end delay constraints. Accordingly, the delay from each source to each destination should be monitored. For this purpose, a middleware is required between the network and the applications, offering the tracking capabilities of disseminated information. In this paper, we propose a middleware architecture for disseminating delay-constrained information in Wireless Sensor Networks (WSNs). In order to evaluate the feasibility of such architecture, a proof of concept of a real scenario is implemented. For performance evaluation, the end-to-end delay and the percentage of success related to the disseminated information are analyzed. Such analysis reveals that the middleware offers a percentage of success close to 98%, which is highly superior to the success of individual resources, such as Short Message Services (SMS), emailing and twitter. 相似文献
3.
4.
A new approach for delay-constrained routing 总被引:1,自引:0,他引:1
Delay-constrained routing protocols are used to find paths subject to a delay constraint while efficiently using network resources. Many of the delay-constrained routing protocols that have been proposed in the literature give priority to cost minimization during the path computing process. With this approach, paths with end-to-end delays too close to the delay constraint are obtained. We believe that such paths are prone to delay constraint violations during load variations in the network. The root of such violations can be found in the imprecision of delay information during the routing process. In this paper, we propose a new approach for delay-constrained routing which captures the tradeoff between cost minimization and the risk level regarding to the delay constraint. We propose a protocol called Parameterized Delay-Constrained Routing protocol that implements our approach using a simple and efficient parameterized selection function. We expand this work to multicasting by proposing three new delay-constrained multicast routing protocols based on the source (Naïve), destination (Greedy) and mixed multicast routing techniques. Our simulations show that our protocols produce paths and trees which are stable, less risky and suitable for various network conditions. 相似文献
5.
6.
1