Vinh Trong Le

Learn More
Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cycle upon the arrival of a new connection request. In this paper, we propose a novel hybrid algorithm for this problem based on a combination of the mobile agents technique and(More)
In this paper, we study the challenging problem of optimizing gateway placement for throughput in Wireless Mesh Networks and propose a novel algorithm based on Particle Swarm Optimization (PSO) for it. By generating the locations of gateway randomly and independently, we calculate the fitness value of each scheme, and update them step by step with the best(More)
In this paper, we propose a novel approach for the optimal communication spanning tree (OCST) problem. Our algorithm is based on the Particle Swarm Optimization (PSO) technique and take account into node biased encoding (NBE) scheme to find nearly optimal solution. The new algorithm can achieve a result that is better than known heuristic algorithms do, as(More)
We present an effective approach to manage, review, and distribute Digital Imaging and Communications in Medicine (DICOM) images with multiple monitors using Windows98 (Microsoft Corp, Redmond, WA) that can be implemented in an office-based setting. Computed tomography (CT), magnetic resonance imaging (MRI), and angiographic DICOM images were collected,(More)
In this paper, we study the dynamic RWA problem in WDM networks with sparse wavelength conversion and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithm. By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously update the routing(More)
In this paper, we consider the problem of survivable routing in dynamic WDM networks with single link failure model. Our work mainly concerns in how to dynamically determine a protection cycle (i.e., two link-disjoint paths between a node pair) to establish a dependable lightpath with backup paths sharing. This problem is identified as NP-complete, thus a(More)
In this paper, we study the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion, and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the(More)