Penggunaan Algoritma Genetika untuk Desain Topologi Mesh pada Jaringan Fisik Telekomunikasi

Paper ini bertujuan untuk mendesain topologi mesh yang biasanya berada pada jaringan fisik telekomunikasi level atas. Topologi mesh ini menggunakan pendekatan desain multi ring, dimana dalam proses desainnya akan ditentukan jumlah node dan ring untuk membentuk topologi mesh. Terdapat beberapa metode optimasi yang biasa digunakan dalam perencanaan jaringan fisik telekomunikasi, salah satu metode yang dapat digunakan adalah Algoritma Genetika. Pada jurnal ini, gen-gen yang digunakan pada desain menggunakan representasi kode biner

Investigation of the tolerance of wavelength-routed optical networks to traffic load variations.

This thesis focuses on the performance of circuit-switched wavelength-routed optical network with unpredictable traffic pattern variations. This characteristic of optical networks is termed traffic forecast tolerance. First, the increasing volume and heterogeneous nature of data and voice traffic is discussed. The challenges in designing robust optical networks to handle unpredictable traffic statistics are described. Other work relating to the same research issues are discussed. A general methodology to quantify the traffic forecast tolerance of optical networks is presented. A traffic model is proposed to simulate dynamic, non-uniform loads, and used to test wavelength-routed optical networks considering numerous network topologies. The number of wavelengths required and the effect of the routing and wavelength allocation algorithm are investigated. A new method of quantifying the network tolerance is proposed, based on the calculation of the increase in the standard deviation of the blocking probabilities with increasing traffic load non-uniformity. The performance of different networks are calculated and compared. The relationship between physical features of the network topology and traffic forecast tolerance is investigated. A large number of randomly connected networks with different sizes were assessed. It is shown that the average lightpath length and the number of wavelengths required for full interconnection of the nodes in static operation both exhibit a strong correlation with the network tolerance, regardless of the degree of load non-uniformity. Finally, the impact of wavelength conversion on network tolerance is investigated. Wavelength conversion significantly increases the robustness of optical networks to unpredictable traffic variations. In particular, two sparse wavelength conversion schemes are compared and discussed: distributed wavelength conversion and localized wavelength conversion. It is found that the distributed wavelength conversion scheme outperforms localized wavelength conversion scheme, both with uniform loading and in terms of the network tolerance. The results described in this thesis can be used for the analysis and design of reliable WDM optical networks that are robust to future traffic demand variations

Parallel evolutionary algorithms in telecommunications: two case studies

Sequential and parallel evolutionary algorithms (EAs) are developed and evaluated on two hard optimisation problems arising in the field of Telecommunications: designing error correcting codes, and finding optimal placements for antennas in radio networks. Different EA models (generational, steadystate and cellular) are compared on these two problems, both in sequential and parallel versions. We conclude that the cellular EA is a very effective technique, consistently finding the optimum, although it is slower than a steady-state EA. A distributed steady-state EA is shown to be the best approach, achieving the same success rate than the cellular EA in much lower time. Furthermore, it is shown that linear speedups are possible when using separate processors.Eje: Sistemas inteligentesRed de Universidades con Carreras en Informática (RedUNCI

Studies of Uncertainties in Smart Grid: Wind Power Generation and Wide-Area Communication

This research work investigates the uncertainties in Smart Grid, with special focus on the uncertain wind power generation in wind energy conversion systems (WECSs) and the uncertain wide-area communication in wide-area measurement systems (WAMSs). For the uncertain wind power generation in WECSs, a new wind speed modeling method and an improved WECS control method are proposed, respectively. The modeling method considers the spatial and temporal distributions of wind speed disturbances and deploys a box uncertain set in wind speed models, which is more realistic for practicing engineers. The control method takes maximum power point tracking, wind speed forecasting, and wind turbine dynamics into account, and achieves a balance between power output maximization and operating cost minimization to further improve the overall efficiency of wind power generation. Specifically, through the proposed modeling and control methods, the wind power control problem is developed as a min-max optimal problem and efficiently solved with semi-definite programming. For the uncertain communication delay and communication loss (i.e. data loss) in WAMSs, the corresponding solutions are presented. First, the real-world communication delay is measured and analyzed, and the bounded modeling method for the communication delay is proposed for widearea applications and further applied for system-area and substation-area protection applications, respectively. The proposed bounded modeling method is expected to be an important tool in the planning, design, and operation of time-critical wide-area applications. Second, the real synchronization signal loss and synchrophasor data loss events are measured and analyzed. For the synchronization signal loss, the potential reasons and solutions are explored. For the synchrophasor data loss, a set of estimation methods are presented, including substitution, interpolation, and forecasting. The estimation methods aim to improve the accuracy and availability of WAMSs, and mitigate the effect of communication failure and data loss on wide-area applications

Fault Tolerant Dense Wavelength Division Multiplexing Optical Transport Networks, Journal of Telecommunications and Information Technology, 2009, nr 1

Design of fault tolerant dense wavelength division multiplexing (DWDM) backbones is a major issue for service provision in the presence of failures. The problem is an NP-hard problem. This paper presents a genetic algorithm based approach for designing fault tolerant DWDM optical networks in the presence of a single link failure. The working and spare lightpaths are encoded into variable length chromosomes. Then the best lightpaths are found by use of a fitness function and these are assigned the minimum number of wavelengths according to the problem constraints using first-fit (FF) algorithm. The proposed approach has been evaluated for dedicated path protection architecture. The results, obtained from the ARPA2 test bench network, show that the method is well suited to tackling this complex and multi-constraint problem

Optimización metaheurística para la planificación de redes WDM

Las implementaciones actuales de las redes de telecomunicaciones no permiten soportar el incremento en la demanda de ancho de banda producido por el crecimiento del tráfico de datos en las últimas décadas. La aparición de la fibra óptica y el desarrollo de la tecnología de multiplexación por división de longitudes de onda (WDM) permite incrementar la capacidad de redes de telecomunicaciones existentes mientras se minimizan costes. En este trabajo se planifican redes ópticas WDM mediante la resolución de los problemas de Provisión y Conducción en redes WDM (Provisioning and Routing Problem) y de Supervivencia (Survivability Problem). El Problema de Conducción y Provisión consiste en incrementar a mínimo coste la capacidad de una red existente de tal forma que se satisfaga un conjunto de requerimientos de demanda. El problema de supervivencia consiste en garantizar el flujo del tráfico a través de una red en caso de fallo de alguno de los elementos de la misma. Además se resuelve el Problema de Provisión y Conducción en redes WDM con incertidumbre en las demandas. Para estos problemas se proponen modelos de programación lineal entera. Las metaheurísticas proporcionan un medio para resolver problemas de optimización complejos, como los que surgen al planificar redes de telecomunicaciones, obteniendo soluciones de alta calidad en un tiempo computacional razonable. Las metaheurísticas son estrategias que guían y modifican otras heurísticas para obtener soluciones más allá de las generadas usualmente en la búsqueda de optimalidad local. No garantizan que la mejor solución encontrada, cuando se satisfacen los criterios de parada, sea una solución óptima global del problema. Sin embargo, la experimentación de implementaciones metaheurísticas muestra que las estrategias de búsqueda embebidas en tales procedimientos son capaces de encontrar soluciones de alta calidad a problemas difíciles en industria, negocios y ciencia. Para la solución del problema de Provisión y Conducción en Redes WDM, se desarrolla un algoritmo metaheurístico híbrido que combina principalmente ideas de las metaheurísticas Búsqueda Dispersa (Scatter Search) y Búsqueda Mutiarranque (Multistart). Además añade una componente tabú en uno de los procedimiento del algoritmo. Se utiliza el modelo de programación lineal entera propuesto por otros autores y se propone un modelo de programación lineal entera alternativo que proporciona cotas superiores al problema, pero incluye un menor número de variables y restricciones, pudiendo ser resuelto de forma óptima para tamaños de red mayores. Los resultados obtenidos por el algoritmo metaheurístico diseñado se comparan con los obtenidos por un procedimiento basado en permutaciones de las demandas propuesto anteriormente por otros autores, y con los dos modelos de programación lineal entera usados. Se propone modelos de programación lineal entera para sobrevivir la red en caso de fallos en un único enlace. Se proponen modelos para los esquemas de protección de enlace compartido, de camino compartido con enlaces disjuntos, y de camino compartido sin enlaces disjuntos. Se propone un método de resolución metaheurístico que obtiene mejores costes globales que al resolver el problema en dos fases, es decir, al resolver el problema de servicio y a continuación el de supervivencia. Se proponen además modelos de programación entera para resolver el problema de provisión en redes WDM con incertidumbres en las demandas

Joint optimization of topology, switching, routing and wavelength assignment

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.Includes bibliographical references (p. 279-285).To provide end users with economic access to high bandwidth, the architecture of the next generation metropolitan area networks (MANs) needs to be judiciously designed from the cost perspective. In addition to a low initial capital investment, the ultimate goal is to design networks that exhibit excellent scalability - a decreasing cost-per-node-per-unit-traffic as user number and transaction size increase. As an effort to achieve this goal, in this thesis we search for the scalable network architectures over the solution space that embodies the key aspects of optical networks: fiber connection topology, switching architecture selection and resource dimensioning, routing and wavelength assignment (RWA). Due to the inter-related nature of these design elements, we intended to solve the design problem jointly in the optimization process in order to achieve over-all good performance. To evaluate how the cost drives architectural tradeoffs, an analytical approach is taken in most parts of the thesis by first focusing on networks with symmetric and well defined structures (i.e., regular networks) and symmetric traffic patterns (i.e., all-to-all uniform traffic), which are fair representations that give us suggestions of trends, etc.(cont.) We starts with a examination of various measures of regular topologies. The average minimum hop distance plays a crucial role in evaluating the efficiency of network architecture. From the perspective of designing optical networks, the amount of switching resources used at nodes is proportional to the average minimum hop distance. Thus a smaller average minimum hop distance translates into a lower fraction of pass-through traffic and less switching resources required. Next, a first-order cost model is set up and an optimization problem is formulated for the purpose of characterizing the tradeoffs between fiber and switching resources. Via convex optimization techniques, the joint optimization problem is solved analytically for (static) uniform traffic and symmetric networks. Two classes of regular graphs - Generalized Moore Graphs and A-nearest Neighbors Graphs - are identified to yield lower and upper cost bounds, respectively. The investigation of the cost scalability further demonstrates the advantage of the Generalized Moore Graphs as benchmark topologies: with linear switching cost structure, the minimal normalized cost per unit traffic decreases with increasing network size for the Generalized Moore Graphs and their relatives.(cont.) In comparison, for less efficient fiber topologies (e.g., A-nearest Neighbors) and switching cost structures (e.g., quadratic cost), the minimal normalized cost per unit traffic plateaus or even increases with increasing network size. The study also reveals other attractive properties of Generalized Moore Graphs in conjunction with minimum hop routing - the aggregate network load is evenly distributed over each fiber. Thus, Generalized Moore Graphs also require the minimum number of wavelengths to support a given uniform traffic demand. Further more, the theoretical works on the Generalized Moore Graphs and their close relatives are extended to study more realistic design scenarios in two aspects. One aspect addresses the irregular topologies and (static) non-uniform traffic, for which the results of Generalized Moore networks are used to provide useful estimates of network cost, and are thus offering good references for cost-efficient optical networks. The other aspect deals with network design under random demands. Two optimization formulations that incorporate the traffic variability are presented.(cont.) The results show that as physical architecture, Generalized Moore Graphs are most robust (in cost) to the demand uncertainties. Analytical results also provided design guidelines on how optimum dimensioning, network connectivity, and network costs vary as functions of risk aversion, service level requirements, and probability distributions of demands.by Kyle Chi Guan.Ph.D