The routingalgorithm of the DTN, which experience frequent long-duration partitions, is quite different from the normal networks. active routing algorithms usually adopt an active host (data mule/message ferry) to ex...
详细信息
ISBN:
(纸本)9781510802704
The routingalgorithm of the DTN, which experience frequent long-duration partitions, is quite different from the normal networks. active routing algorithms usually adopt an active host (data mule/message ferry) to exchange and forward the messages. In the existing studies in DTN, the activerouting problem is generally solved by adopting the solutions of the Travelling Salesman Problem (TSP). In such solutions, the activerouting problem is often solved by finding a simple cycle with no repeated nodes nor edges. By considering a more general scenario, we propose an active routing algorithm, which is based on the historical information and node states, where the route is a closed walk. The simulations verify the accuracy and efficiency of the active routing algorithm we proposed in this paper.
By the studying of classical active applications (AA), this paper proposes a novel open mobile agent-based application layer active network. Proxy server allows to deliver service tasks to any place in the network. It...
详细信息
By the studying of classical active applications (AA), this paper proposes a novel open mobile agent-based application layer active network. Proxy server allows to deliver service tasks to any place in the network. It presents a new cost model and it's routingalgorithm to solve the problem of proxy placement.
暂无评论