Optimized WDM network with consideration of lesser blocking probability & shortest path selection

2012 ◽  
Author(s):  
Amandeep Sharma ◽  
Ajay Kakkar ◽  
Sandeep Sachdeva
Keyword(s):  
Shortest Path ◽  
Blocking Probability ◽  
Path Selection ◽  
Wdm Network

scholarly journals A Multi-Objective Optimization Algorithm for Routing Path Selection and Wavelength Allocation for Dynamic WDM Network using MO-HLO

2021 ◽  
Vol 10 (5) ◽  
pp. 111-118
Author(s):  
Hamsaveni M ◽  
Savita Choudhary
Keyword(s):  
Shortest Path ◽  
Optimization Algorithm ◽  
Network Architecture ◽  
Time Instant ◽  
Path Selection ◽  
Packet Transmission ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Wdm Network ◽  
Wavelength Allocation

The data transmission system in the optical WDM network increases the speed of packet transmission by the wavelength of light beams . The Selection of the wavelength and the shortest path to transmit the packets form source to destination is a challenge in a large network architecture. To solve these two problems, the optimization model must handle both the objectives. In this paper we are proposing a novel multi-objective optimization algorithm to solve both the problem of wavelength allocation and shortest path identification in a WDM network. This can be achieved by the enhanced model of Multi-Objective Hunger Locust Optimization algorithm (MO-HLO). In this, it analyse traffic level in a network path and the availability of wavelength present at each time instant. The proposed system retrieves the parameters of network architecture and with the weight value of dynamic traffic occur in the routing path. Among these data, the optimization selects the best among overall feature set of the WDM arrangement. The MO-HLO algorithm extracts the combination of each attribute to form the cluster that segregates the routing path along with the traffic range. From the fitness of the objective function of MO-HLO, the best routing path and the availability of wavelength for a node can be analysed at each time instant.

Multi-hop traffic grooming routing and wavelength assignment using split light trail in WDM all optical mesh networks

2021 ◽  
pp. 1-14
Author(s):  
Sampa Rani Bhadra ◽  
Ashok Kumar Pradhan ◽  
Utpal Biswas
Keyword(s):  
Mesh Networks ◽  
Blocking Probability ◽  
Wavelength Assignment ◽  
End User ◽  
Network Resources ◽  
Wdm Network ◽  
Optical Wdm ◽  
All Optical ◽  
User Access ◽  
Optical Mesh Networks

For the last few decades, fiber optic cables not only replaced copper cables but also made drastic evolution in the technology to overcome the optoelectronic bandwidth mismatch. Light trail concept is such an attempt to minimize the optoelectronic bandwidth gap between actual WDM bandwidth and end user access bandwidth. A light trail is an optical bus that connects two nodes of an all optical WDM network. In this paper, we studied the concept of split light trail and proposed an algorithm namely Static Multi-Hop Split Light Trail Assignment (SMSLTA), which aims to minimize blocking probability, the number of static split light trails assigned and also the number of network resources used, at the same time maximizing the network throughput. Our proposed algorithm works competently with the existing algorithms and generates better performance in polynomial time complexity.

Note on “Optimal path selection approach for fuzzy reliable shortest path problem”

2020 ◽  
Vol 39 (5) ◽  
pp. 7653-7656
Author(s):  
Ranjan Kumar ◽  
SA Edalatpanah ◽  
Hitesh Mohapatra
Keyword(s):  
Shortest Path ◽  
Fuzzy Systems ◽  
Optimal Path ◽  
Vital Role ◽  
Path Selection ◽  
Shortest Path Problem ◽  
Shortest Path Problems ◽  
Fuzzy Environment ◽  
Selection Approach ◽  
Arc Lengths

There are different conditions where SPP play a vital role. However, there are various conditions, where we have to face with uncertain parameters such as variation of cost, time and so on. So to remove this uncertainty, Yang et al. [1] “[Journal of Intelligent & Fuzzy Systems, 32(1), 197-205”] have proposed the fuzzy reliable shortest path problem under mixed fuzzy environment and claimed that it is better to use their proposed method as compared to the existing method i.e., “[Hassanzadeh et al.; A genetic algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths, Mathematical and Computer Modeling, 57(2013) 84-99” [2]]. The aim of this note is, to highlight the shortcoming that is carried out in Yang et al. [1] article. They have used some mathematical incorrect assumptions under the mixed fuzzy domain, which is not true in a fuzzy environment.

scholarly journals Routing Optimization Algorithms Based on Node Compression in Big Data Environment

2017 ◽  
Vol 2017 ◽  
pp. 1-7
Author(s):  
Lifeng Yang ◽  
Liangming Chen ◽  
Ningwei Wang ◽  
Zhifang Liao
Keyword(s):  
Big Data ◽  
Shortest Path ◽  
Optimization Algorithms ◽  
Real Life ◽  
Large Data ◽  
Path Selection ◽  
Shortest Path Problem ◽  
Limited Time ◽  
Starting Point ◽  
Data Environment

Shortest path problem has been a classic issue. Even more so difficulties remain involving large data environment. Current research on shortest path problem mainly focuses on seeking the shortest path from a starting point to the destination, with both vertices already given; but the researches of shortest path on a limited time and limited nodes passing through are few, yet such problem could not be more common in real life. In this paper we propose several time-dependent optimization algorithms for this problem. In regard to traditional backtracking and different node compression methods, we first propose an improved backtracking algorithm for one condition in big data environment and three types of optimization algorithms based on node compression involving large data, in order to realize the path selection from the starting point through a given set of nodes to reach the end within a limited time. Consequently, problems involving different data volume and complexity of network structure can be solved with the appropriate algorithm adopted.

Extended shortest path selection for package routing of complex networks

2017 ◽  
Vol 28 (11) ◽  
pp. 1750129 ◽  
Author(s):  
Fan Ye ◽  
Lei Zhang ◽  
Bing-Hong Wang ◽  
Lu Liu ◽  
Xing-Yi Zhang
Keyword(s):  
Complex Networks ◽  
Shortest Path ◽  
Network Flow ◽  
Path Selection ◽  
Local Load ◽  
Maximum Throughput ◽  
Distance Analysis ◽  
Routing Optimization ◽  
Routing Strategy ◽  
Peer To Peer Networks

The routing strategy plays a very important role in complex networks such as Internet system and Peer-to-Peer networks. However, most of the previous work concentrates only on the path selection, e.g. Flooding and Random Walk, or finding the shortest path (SP) and rarely considering the local load information such as SP and Distance Vector Routing. Flow-based Routing mainly considers load balance and still cannot achieve best optimization. Thus, in this paper, we propose a novel dynamic routing strategy on complex network by incorporating the local load information into SP algorithm to enhance the traffic flow routing optimization. It was found that the flow in a network is greatly affected by the waiting time of the network, so we should not consider only choosing optimized path for package transformation but also consider node congestion. As a result, the packages should be transmitted with a global optimized path with smaller congestion and relatively short distance. Analysis work and simulation experiments show that the proposed algorithm can largely enhance the network flow with the maximum throughput within an acceptable calculating time. The detailed analysis of the algorithm will also be provided for explaining the efficiency.

Optimasi Pencarian Jalur dengan Metode A-Star

2013 ◽  
Vol 5 (2) ◽  
pp. 42-47
Author(s):  
Veronica Mutiana ◽  
Fitria Amastini ◽  
Noviana Mutiara
Keyword(s):  
Shortest Path ◽  
Path Selection ◽  
Traffic Density ◽  
Optimal Route ◽  
A Algorithm ◽  
Worst Case ◽  
Traffic Jam ◽  
Sensor Module ◽  
Using Data ◽  
High Level

High level of traffic density can lead to traffic jam those will make troublesome for driver to reach destination with alternative shortest path on time. Therefore, it is neccessary to make an agent that can choose optimal route without being stuck on traffic jam. In this paper, algorithm for choose optimal route is A* method for shortest path problem and use backtrack process when there is a traffic jam occurs on several roads. The design of algorithm is tested by using data which contain 100 locations or nodes and 158 roads or paths in Gading Serpong with an agent that can searching shortest path and sensor module that can send the traffic status based on number of vehicle on several particular node. Based on testing, A* method does not guarantee for path selection if agent is not full observable with environment and there is some case that can lead a worst case. Index Terms— A* Algorithm, Backtrack, Shortest Path, Traffic Density

scholarly journals Shortest Path Selection Algorithm for Cold Chain Logistics Transportation Based on Improved Artificial Bee Colony

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Zhihuan Liu
Keyword(s):  
Shortest Path ◽  
Artificial Bee Colony Algorithm ◽  
Food Source ◽  
Artificial Bee Colony ◽  
Selection Effect ◽  
Path Selection ◽  
Cold Chain ◽  
Selection Algorithm ◽  
Selection Accuracy ◽  
Bee Colony

Aiming at the problems of low shortest path selection accuracy, longer response time, and poor selection effect in current cold chain logistics transportation methods, a cold chain logistics transportation shortest path selection algorithm based on improved artificial bee colony is proposed. The improved algorithm is used to initialize the food source, reevaluate the fitness value of the food source, generate a new food source, optimize the objective function and food source evaluation strategy, and get an improved artificial bee colony algorithm. Based on the improved artificial bee colony algorithm, the group adaptive mechanism of particle swarm algorithm is introduced to initialize the position and velocity of each particle randomly. Dynamic detection factor and octree algorithm are adopted to dynamically update the path of modeling environment information. According to the information sharing mechanism between individual particles, the group adaptive behavior control is performed. After the maximum number of cycles, the path planning is completed, the shortest path is output, and the shortest path selection of cold chain logistics transportation is realized. The experimental results show that the shortest path selection effect of the cold chain logistics transportation of the proposed algorithm is better, which can effectively improve the shortest path selection accuracy and reduce the shortest path selection time.

Sign in / Sign up

Export Citation Format

Share Document