scholarly journals A Fuzzy Optimal Routing Problem for Sightseeing

2005 ◽  
Vol 125 (8) ◽  
pp. 1350-1357 ◽  
Author(s):  
Yoshitaka Matsuda ◽  
Morikazu Nakamura ◽  
Dongshik Kang ◽  
Hayao Miyagi
Keyword(s):  
Optimal Routing ◽  
Routing Problem

scholarly journals The optimal routing problem in Vietnam telecommunication network.

2012 ◽  
Vol 17 (1) ◽  
Author(s):  
Đỗ Trung Tá ◽  
Lê Văn Phùng ◽  
Lê Đắc Kiên
Keyword(s):  
Telecommunication Network ◽  
Optimal Routing ◽  
Routing Problem

Using GPU and OpenACC to Accelerate the Maze Optimal Routing Algorithm

2013 ◽  
Vol 380-384 ◽  
pp. 1338-1341
Author(s):  
Yu Liu ◽  
Yi Xiao
Keyword(s):  
Ant Colony Algorithm ◽  
Programming Model ◽  
Routing Algorithm ◽  
Operation Time ◽  
Ant Colony ◽  
Gpu Acceleration ◽  
Optimal Routing ◽  
Task Mapping ◽  
Routing Problem ◽  
High Level

in order to improve the efficiency of maze optimal routing problem, a GPU acceleration programming model OpenACC is used in this paper. By analyzing an algorithm which solves the maze problem based on ant colony algorithm, we complete the task mapping on the model. Though GPU acceleration, ant colony searching process was changed into parallel matrix operations. To decrease the algorithm accessing overhead and increase operating speed, data were rationally organized and stored for GPU. Experiments of different scale maze matrix show that the parallel algorithm greatly reduces the operation time. Speedup will be increased with the expansion of the matrix size. In our experiments, the maximum speedup is about 6.1. The algorithm can solve larger matrices with a high level of processing performance by adding efficient OpenACC instruction to serial code and organizing the data structure for parallel accessing.

scholarly journals Distributed Algorithm for Real-Time Energy Optimal Routing Based on Dual Decomposition of Linear Programming

2011 ◽  
Vol 8 (1) ◽  
pp. 346163
Author(s):  
Jiří Trdlička ◽  
Zdeněk Hanzálek
Keyword(s):  
Linear Programming ◽  
Real Time ◽  
Network Flow ◽  
Distributed Algorithm ◽  
Cost Functions ◽  
Optimal Routing ◽  
Communication Delays ◽  
Dual Decomposition ◽  
Routing Problem ◽  
Linear Cost

This work proposes a novel in-network distributed algorithm for real-time energy optimal routing in ad hoc and sensor networks for systems with linear cost functions and constant communication delays. The routing problem is described as a minimum-cost multicommodity network flow problem by linear programming and modified by network replication to a real-time aware form. Based on the convex programming theory we use dual decomposition to derive the distributed algorithm. Thanks to the exact mathematical derivation, the algorithm computes the energy optimal real-time routing. It uses only peer-to-peer communication between neighboring nodes and does not need any central node or knowledge about the whole network structure. Each node knows only the produced and collected data flow and the costs of its outgoing communication links. According to our knowledge, this work is the first, which solves the real-time routing problem with linear cost functions and constant communication delays, using the dual decomposition.

Sign in / Sign up

Export Citation Format

Share Document