A Comparative Study of Evolutionary Algorithms for Maximizing Reliability of a Flow in Cellular IP Network

2012 ◽  
pp. 247-257
Author(s):  
Mohammad Anbar ◽  
Deo P. Vidyarthi
Keyword(s):  
Evolutionary Algorithms ◽  
Comparative Study ◽  
Rapid Development ◽  
Experimental Studies ◽  
Access Network ◽  
Search Space ◽  
Ip Network ◽  
Cellular Ip ◽  
Reliability Issue ◽  
Characteristic Measure

The rapid development in technology, witnessed in daily communication, especially in wireless communication, is a good motivation for performance improvement in this field. Cellular IP access network is a suitable environment where a micro mobility of mobile users is implemented and managed. The reliability of Cellular IP network during the communication is an important characteristic measure and must be considered while designing a new model. Evolutionary Algorithms are powerful tools for optimization and problem solving, which require extracting the best solution from a big search space. This chapter explores the reliability issue in Cellular IP of a flow of packets passing through the route from a source to a destination. The main aim of the chapter is to maximize the reliability of the flow passing through a route having number of routers. Two Evolutionary Algorithms (EAs), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), have been used for this purpose, and a comparative study between the two is performed. Experimental studies of the proposed work have also been performed.

Buffer Management in Cellular IP Networks using Evolutionary Algorithms

2010 ◽  
Vol 1 (4) ◽  
pp. 1-22 ◽  
Author(s):  
Mohammad Anbar ◽  
Deo P. Vidyarthi
Keyword(s):  
Evolutionary Algorithms ◽  
Real Time ◽  
Optimization Problems ◽  
Buffer Management ◽  
Complex Problem ◽  
Base Station ◽  
Base Stations ◽  
Real Time Traffic ◽  
Ip Network ◽  
Cellular Ip

Real-time traffic in Cellular IP network is considered to be important and therefore given priority over non-real-time. Buffer is an important but scarce resource and to optimize Quality of Service by managing buffers of the network is an important and complex problem. Evolutionary Algorithms are quite useful in solving such complex optimization problems, and in this regard, a two-tier model for buffer, Gateway and Base Station, management in Cellular IP network has been propsed. The first tier applies a prioritization algorithm for prioritizing real-time packets in the buffer of the gateway with a specified threshold. Packets which couldn’t be served, after the threshold, is given to the nearest cells of the network to be dealt with in the second tier, while Evolutionary Algorithm (EA) based procedures are applied in order to optimally store these packets in the buffer of the base stations. Experiments have been conducted to observe the performance of the proposed models and a comparative study of the models, GA based and PSO based, has been carried out to depict the advantage and disadvantage of the proposed models.

Buffer Management in Cellular IP Networks using Evolutionary Algorithms

2012 ◽  
pp. 254-275
Author(s):  
Mohammad Anbar ◽  
Deo P. Vidyarthi
Keyword(s):  
Evolutionary Algorithms ◽  
Real Time ◽  
Optimization Problems ◽  
Buffer Management ◽  
Base Stations ◽  
Real Time Traffic ◽  
Ip Network ◽  
Cellular Ip ◽  
Second Tier ◽  
Time Buffer

Real-time traffic in Cellular IP network is considered to be important and therefore given priority over non-real-time. Buffer is an important but scarce resource and to optimize Quality of Service by managing buffers of the network is an important and complex problem. Evolutionary Algorithms are quite useful in solving such complex optimization problems, and in this regard, a two-tier model for buffer, Gateway and Base Station, management in Cellular IP network has been proposed. The first tier applies a prioritization algorithm for prioritizing real-time packets in the buffer of the gateway with a specified threshold. Packets which couldn’t be served, after the threshold, is given to the nearest cells of the network to be dealt with in the second tier, while Evolutionary Algorithm (EA) based procedures are applied in order to optimally store these packets in the buffer of the base stations. Experiments have been conducted to observe the performance of the proposed models and a comparative study of the models, GA based and PSO based, has been carried out to depict the advantage and disadvantage of the proposed models.

scholarly journals Digital nanophotonics: the highway to the integration of subwavelength-scale photonics

Nanophotonics ◽  
2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Jie Huang ◽  
Hansi Ma ◽  
Dingbo Chen ◽  
Huan Yuan ◽  
Jinping Zhang ◽  
...  
Keyword(s):  
Rapid Development ◽  
Search Space ◽  
Inverse Design ◽  
Analytical Models ◽  
Nanophotonic Devices ◽  
Single Function ◽  
Intelligence Operations ◽  
Complex Functions ◽  
Parameter Search Space ◽  
Design Algorithms

AbstractNanophotonic devices with high densities are extremely attractive because they can potentially merge photonics and electronics at the nanoscale. However, traditional integrated photonic circuits are designed primarily by manually selecting parameters or employing semi-analytical models. Limited by the small parameter search space, the designed nanophotonic devices generally have a single function, and the footprints reach hundreds of microns. Recently, novel ultra-compact nanophotonic devices with digital structures were proposed. By applying inverse design algorithms, which can search the full parameter space, the proposed devices show extremely compact footprints of a few microns. The results from many groups imply that digital nanophotonics can achieve not only ultra-compact single-function devices but also miniaturized multi-function devices and complex functions such as artificial intelligence operations at the nanoscale. Furthermore, to balance the performance and fabrication tolerances of such devices, researchers have developed various solutions, such as adding regularization constraints to digital structures. We believe that with the rapid development of inverse design algorithms and continuous improvements to the nanofabrication process, digital nanophotonics will play a key role in promoting the performance of nanophotonic integration. In this review, we uncover the exciting developments and challenges in this field, analyse and explore potential solutions to these challenges and provide comments on future directions in this field.

A New Method for Modeling the Behavior of Finite Population Evolutionary Algorithms

2010 ◽  
Vol 18 (3) ◽  
pp. 451-489 ◽  
Author(s):  
Tatsuya Motoki
Keyword(s):  
Markov Chain ◽  
Evolutionary Algorithms ◽  
Finite Population ◽  
Fitness Landscape ◽  
Markov Chain Model ◽  
Search Space ◽  
Chain Model ◽  
Transition Matrices ◽  
Memory Space ◽  
Exact Model

As practitioners we are interested in the likelihood of the population containing a copy of the optimum. The dynamic systems approach, however, does not help us to calculate that quantity. Markov chain analysis can be used in principle to calculate the quantity. However, since the associated transition matrices are enormous even for modest problems, it follows that in practice these calculations are usually computationally infeasible. Therefore, some improvements on this situation are desirable. In this paper, we present a method for modeling the behavior of finite population evolutionary algorithms (EAs), and show that if the population size is greater than 1 and much less than the cardinality of the search space, the resulting exact model requires considerably less memory space for theoretically running the stochastic search process of the original EA than the Nix and Vose-style Markov chain model. We also present some approximate models that use still less memory space than the exact model. Furthermore, based on our models, we examine the selection pressure by fitness-proportionate selection, and observe that on average over all population trajectories, there is no such strong bias toward selecting the higher fitness individuals as the fitness landscape suggests.

Sign in / Sign up

Export Citation Format

Share Document