L Fu. An Adaptive routing algorithm for in2vehicle route guid2 ance systems with real2time information [J ] . Transportation re2 search part B ,2001 , (35) :7492765.Ping F L.An adaptive routing algorithmfor in-vehicle routeguidance systems with real-ti me information. Transporta-tion ...
Simulation results of FCCN-MANET show that FCCN adaptive routing algorithm achieves good performance of end-to-end packet delivery ratio. 仿真结果显示,全互联立方体拓扑的自适应路由具有良好的端到端吞吐率。 www.pet2008.cn 2. A Priority Supporting Adaptive Routing Algorithm in Direct Interconnection Netwo...
LSPI is a model-free learning algorithm. Unlike the traditional RL algorithm such as Q-Routing which evaluates the optimal action-value function directly, LSPI approximates Q-values Qπ for a given policy π with a parametric function. 2.2.2 Functioning of the scheme The value function is ...
DHT, KAD, routing algorithm, Link AnalysisDHT (Distributed Hash Tables) has been applied to the structured P2P system to achieve information retrieval and positioning efficiently. KAD is a large-scale network protocol based on the XOR metric in practice, which uses DHT technology to improve ...
The directed adaptive face-based routing algorithm (DAFR) is a local state routing algorithm, the compromise between the storage capacity and the calculation communication traffic of the node is realized, fields are added in the cache of each node to avoid repeated search, and the global routing...
An adaptive ant-based routing algorithm used routing history in dynamic networks 机译:基于Adaptive ant基于基于蚂蚁的路由算法在动态网络中使用路由历史记录 获取原文 获取原文并翻译 | 示例页面导航 摘要 著录项 相似文献 相关主题 摘要 In recent year, we can use the mobile communication in our life ...
This research study introduces a new adaptive and dynamic routing algorithm for MANETs based on the Ant Colony Optimization (ACO) algorithms with network delay analysis. Ant colony optimization algorithm helps in finding, if not the shortest, at least a very good path connecting the colony nest ...
The proposed method is an adaptive congestion-aware routing algorithm; it is aimed at preventing the congestion of WRs in WiNoC. This method selects a number of LD packets for using the wireless channels at a specific time period. In [29], total latency, T0, includes three components: rout...
Examples of table-driven ad hoc routing protocols are the following: the Destination-Sequenced Distance-Vector (DSDV) [5], [6], [7] routing algorithm is based on the classical Bellman-Ford Routing Algorithm with certain improvements; the Wireless Routing Protocol (WRP) [8] is a table-based ...
[WO 99/33232] by Ericsson discloses an algorithm for computing a quality parameter called ‘link cost’, recording that parameter in router tables and using it for establishing connections in an ATM system. The inputs for this computation are themselves computed variables such as maximum cell ...