scholarly journals Research of the Secure Routing Method of Confidential Messages on Disjoint Paths

2020 ◽  
pp. 43-55
Author(s):  
Oleksandr Lemeshko ◽  
Yurii Hrachov ◽  
Batoul Sleiman
Keyword(s):  
Optimization Problems ◽  
Telecommunication Network ◽  
Telecommunication Networks ◽  
Secure Routing ◽  
Disjoint Paths ◽  
Network Configuration ◽  
Study Results ◽  
Sequential Solution ◽  
Communication Links ◽  
Routing Method

The article proposes a secure routing method of confidential messages in a telecommunication network by disjoint paths and its research results. The presented method of disjoint paths secure routing of confidential messages is based on the sequential solution of two optimization problems: calculating disjoint routes and secure balancing of confidential message fragments on a set of precalculated paths. An optimization model was chosen to determine the set of routes, namely, to calculate the maximum number of disjoint paths, including communication links with minimum compromise probability. Additionally, a model of fragmented transmission using a precalculated set of disjoint paths was selected according to the SPREAD mechanism and Shamir’s scheme to ensure the minimum possible probability of message compromise. The study of the proposed secure routing method on the selected network configuration for three different variants of the link compromise probabilities has been conducted. The study results confirmed the effectiveness of the proposed secure routing method and the efficiency of the underlying optimization models to determine both the set of disjoint paths and the order of secure balancing of confidential message fragments. Prospects for further research in the field of secure routing in telecommunication networks are related to considering the link compromise probabilities and other essential indicators of network security.

The Map-Based Shortest Route Selection by Using Ant Colony Optimization Algorithm

2018 ◽  
Vol 1 (1) ◽  
pp. 15
Author(s):  
Achmad Fanany Onnilita Gaffar ◽  
Agusma Wajiansyah ◽  
Supriadi Supriadi
Keyword(s):  
Ant Colony Optimization ◽  
Shortest Path ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Google Earth ◽  
Ant Colony ◽  
Food Sources ◽  
Shortest Route ◽  
Study Results ◽  
Destination Point

The shortest path problem is one of the optimization problems where the optimization value is a distance. In general, solving the problem of the shortest route search can be done using two methods, namely conventional methods and heuristic methods. The Ant Colony Optimization (ACO) is the one of the optimization algorithm based on heuristic method. ACO is adopted from the behavior of ant colonies which naturally able to find the shortest route on the way from the nest to the food sources. In this study, ACO is used to determine the shortest route from Bumi Senyiur Hotel (origin point) to East Kalimantan Governor's Office (destination point). The selection of the origin and destination points is based on a large number of possible major roads connecting the two points. The data source used is the base map of Samarinda City which is cropped on certain coordinates by using Google Earth app which covers the origin and destination points selected. The data pre-processing is performed on the base map image of the acquisition results to obtain its numerical data. ACO is implemented on the data to obtain the shortest path from the origin and destination point that has been determined. From the study results obtained that the number of ants that have been used has an effect on the increase of possible solutions to optimal. The number of tours effect on the number of pheromones that are left on each edge passed ant. With the global pheromone update on each tour then there is a possibility that the path that has passed the ant will run out of pheromone at the end of the tour. This causes the possibility of inconsistent results when using the number of ants smaller than the number of tours.

Optimization Design of Trusses Based on Covariance Matrix Adaptation Evolution Strategy Algorithm

2012 ◽  
Vol 215-216 ◽  
pp. 133-137
Author(s):  
Guo Shao Su ◽  
Yan Zhang ◽  
Zhen Xing Wu ◽  
Liu Bin Yan
Keyword(s):  
Stochastic Optimization ◽  
Covariance Matrix ◽  
Optimization Problems ◽  
Fitness Function ◽  
Optimization Methods ◽  
Evolution Strategy ◽  
Covariance Matrix Adaptation ◽  
Study Results ◽  
Highly Nonlinear ◽  
Adaptation Evolution

Covariance matrix adaptation evolution strategy algorithm (CMA-ES) is a newly evolution algorithm. It has become a powerful tool for solving highly nonlinear multi-peak optimization problems. In many real-world optimization problems, the location of multiple optima is often required in a search space. In order to evaluate the solution, thousands of fitness function evaluations are involved that is a time consuming or expensive processes. Therefore, conventional stochastic optimization methods meet a special challenge for a very large number of problem function evaluations. Aiming to overcome the shortcoming of stochastic optimization methods in the high calculation cost, a truss optimal method based on CMA-ES algorithm is proposed and applied to solve the section and shape optimization problems of trusses. The study results show that the method is feasible and has the advantages of high accuracy, high efficiency and easy implementation.

THE METHOD OF ESTIMATION FRACTAL DIMENSION OF THE TELECOMMUNICATION NETWORK

2021 ◽  
Author(s):  
Ф.Х. НАХЛИ ◽  
А.И. ПАРАМОНОВ
Keyword(s):  
Fractal Dimension ◽  
Comparative Analysis ◽  
Telecommunication Network ◽  
Shortest Paths ◽  
Network Connectivity ◽  
Telecommunication Networks ◽  
New Method ◽  
Topological Properties

Анализируется фрактальная размерность (ФР) сети связи и ее использование для исследования и планирования сетей связи. Рассматривается применение метода «выращивания кластера» для оценки ФР и предлагается новый метод определения ФР сети, основанный на оценивании связности сети путем поиска кратчайших путей. Показано, что оценка ФР сети является дополнительной характеристикой, отражающей топологические свойства сети. Дается сравнительный анализ предложенного метода и «выращивания кластера». Полученные результаты позволяют выбрать метод и получить оценки ФР сети в зависимости от ее особенностей. The paper analyzes the fractal dimension of the network and its use for telecommunication networks research and planning. The analysis of the "cluster growing" method for assessing the fractal dimension is given and a new method for assessing the fractal dimensionof anetwork is proposed, based onassessing the network connectivity by finding the shortest paths. The article shows that the assessment of the fractal dimension of the network is an additional characteristic that reflects the topological properties of the network. Comparative analysis of the proposed method and "cluster growing" is given. The results obtained make it possible to select a method and obtain estimates of the fractal dimension of the network, depending on its features.

scholarly journals Cooperative Problem Solving in Telecommunication Network

2013 ◽  
Vol 4 (3) ◽  
pp. 388-392
Author(s):  
Shanu K Rakesh ◽  
Bharat Choudhary ◽  
Rachna Sandhu
Keyword(s):  
Communication Network ◽  
Problem Solving ◽  
Distributed Control ◽  
Communication Networks ◽  
Foraging Behaviour ◽  
Telecommunication Network ◽  
Telecommunication Networks ◽  
Control Problems ◽  
Engineering Systems ◽  
Biologically Inspired

Swarm intelligence, as demonstrated by natural biological swarms, has numerous powerful properties desirable in many engineering systems, such as telecommunication. Communication network management is becoming increasingly difficult  due to the increasing size, rapidly changing topology, and complexity of communication networks. This paper describes  how biologically-inspired agents can be used to solve control problems in telecommunications. These agents, inspired by the foraging behaviour of ants, exhibit the desirable characteristics of simplicity of action and interaction. The colle ction of agents, or swarm system, deals only with local knowledge and exhibits a form of distributed control with agent communication effected through the environment. In this paper we explore the application of ant-like agents to the problem of routing in telecommunication networks.

scholarly journals Multilayer, locality aware, telecommunication network deployment algorithm

2019 ◽  
Vol 11 (1) ◽  
pp. 145-158
Author(s):  
Luis M. Roman ◽  
Ante Salcedo ◽  
Miguel Alonso Vilchis
Keyword(s):  
Rural Communities ◽  
Population Density ◽  
Telecommunication Network ◽  
Voronoi Tessellation ◽  
Telecommunication Networks ◽  
Small Cells ◽  
Iterative Approach ◽  
Local Approach ◽  
Sheer Size ◽  
Practical Implications

Purpose – In this paper we propose an iterative approach for the deployment of rural telecommunication networks. Methodology/approach/design – This approach relies heavily on the concept of locality, prioritizing small ‘cells’ with a considerable population density, and exploits the natural nesting of the distribution of rural communities, focusing in communities which are populous enough to justify the investment required to provide them with connectivity, and whose sheer size promotes the formation of ‘satellite’ communities that could be benefited from the initial investment at a marginal expense. For this approach, the concept of ‘cells’ is paramount, which are constructed iteratively based on the contour of a Voronoi tessellation centered on the community of interest. Once the focal community has been ‘connected’ with network of the previous layer, the process is repeated with less populous communities at each stage until a coverage threshold has been reached. One of the main contributions of this methodology is that it makes every calculation based on ‘street distance’ instead of Euclidean, giving a more realistic approximate of the length of the network and hence the amount of the investment. To test our results, we ran our experiments on two segregated communities in one of the most complicated terrains, due to the mountain chains, in the state of Chiapas, Mexico. Findings – The results suggest that the use of ‘street distance’ and a local approach leads to the deployment of a remarkably different network than the standard methodology would imply. Practical implications – The results of this paper might lead to a significant reduction in the costs associated with these kinds of projects and therefore make the democratization of connectivity a reality. In order to make our results reproducible, we make all our code open and publicly available on GitHub.

Critical Infrastructure Management for Telecommunication Networks

2014 ◽  
Vol 5 (1) ◽  
pp. 1-13
Author(s):  
Haibo Wang ◽  
Bahram Alidaee ◽  
Wei Wang ◽  
Wei Ning
Keyword(s):  
Ad Hoc ◽  
Critical Infrastructure ◽  
Telecommunication Network ◽  
Telecommunication Networks ◽  
Critical Infrastructures ◽  
Infrastructure Management ◽  
Detection Model ◽  
Proposed Model ◽  
The Stability ◽  
Supporting Structures

Telecommunication network infrastructures both stationary and ad hoc, play an important role in maintaining the stability of society worldwide. The protection of these critical infrastructures and their supporting structures become highly challenged due to its complexity. The understanding of interdependency of these infrastructures is the essential step to protect these infrastructures from destruction and attacks. This paper presents a critical infrastructure detection model to discover the interdependency based on the theories from social networks and new telecommunication pathways while this study transforms social theory into computational constructions. The procedure and solution of protecting critical infrastructures are discussed and computational results from the proposed model are presented.

scholarly journals Methodology and Software Tool for Energy Consumption Evaluation and Optimization in Multilayer Transport Optical Networks

Energies ◽  
2020 ◽  
Vol 13 (23) ◽  
pp. 6370
Author(s):  
Krzysztof Przystupa ◽  
Mykola Beshley ◽  
Mykola Kaidan ◽  
Volodymyr Andrushchak ◽  
Ivan Demydov ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Optical Networks ◽  
Telecommunication Network ◽  
Software Tool ◽  
Optical Devices ◽  
Optical Quality ◽  
Simulation Software ◽  
Telecommunication Networks ◽  
Optical Modulators ◽  
Optical Transport

In communication networks, the volume of traffic, the number of connected devices and users continues to grow. As a result, the energy consumption generated by the communication infrastructure has become an important parameter that needs to be carefully considered and optimized both when designing the network and when operating it in real-time. In this paper, the methodology of calculation of complex parameters of energy consumption for transport telecommunication networks is proposed. Unlike the known techniques, the proposed methodology takes into account heterogeneity and multilayer networks. It also takes into account the energy consumption parameter during the downtime of the network equipment in the process of processing the service data blocks, which is quite an important task for improving the accuracy of energy consumption at the stage of implementing the energy-saving network. We also developed simulation software to estimate and manage the energy consumption of the optical transport network using the LabVIEW environment. This software tool allows telecommunication network designers to evaluate energy consumption, which allows them to choose the optimal solution for the desired projects. The use of electro-and acousto-optical devices for optical transport networks is analyzed. We recommended using electro-optical devices for optical modulators and acousto-optical devices for optical switches. The gain from using this combination of optical devices and the parameter of rij electro-optical coefficient and M2 acousto-optical quality parameter found in the paper is about 36.1% relative to the complex criterion of energy consumption.

scholarly journals Enhanced method of fast re-routing with load balancing in software-defined networks

2017 ◽  
Vol 68 (6) ◽  
pp. 444-454 ◽  
Author(s):  
Oleksandr Lemeshko ◽  
Oleksandra Yeremenko
Keyword(s):  
Load Balancing ◽  
Traffic Engineering ◽  
Optimization Problems ◽  
Linear Optimization ◽  
Iterative Solution ◽  
Efficiency And Effectiveness ◽  
Communication Links ◽  
Linear Optimization Problems ◽  
Level Method ◽  
Upper Level

AbstractA two-level method of fast re-routing with load balancing in a software-defined network (SDN) is proposed. The novelty of the method consists, firstly, in the introduction of a two-level hierarchy of calculating the routing variables responsible for the formation of the primary and backup paths, and secondly, in ensuring a balanced load of the communication links of the network, which meets the requirements of the traffic engineering concept. The method provides implementation of link, node, path, and bandwidth protection schemes for fast re-routing in SDN. The separation in accordance with the interaction prediction principle along two hierarchical levels of the calculation functions of the primary (lower level) and backup (upper level) routes allowed to abandon the initial sufficiently large and nonlinear optimization problem by transiting to the iterative solution of linear optimization problems of half the dimension. The analysis of the proposed method confirmed its efficiency and effectiveness in terms of obtaining optimal solutions for ensuring balanced load of communication links and implementing the required network element protection schemes for fast re-routing in SDN.

scholarly journals Consistent Neighborhood Search for Combinatorial Optimization

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Michel Vasquez ◽  
Nicolas Zufferey
Keyword(s):  
Local Search ◽  
Optimization Problems ◽  
Search Space ◽  
Partial Solution ◽  
Telecommunication Networks ◽  
Frequency Assignment ◽  
Neighborhood Search ◽  
Great Success ◽  
Heuristic Solution ◽  
Complete Solutions

Many optimization problems (from academia or industry) require the use of a local search to find a satisfying solution in a reasonable amount of time, even if the optimality is not guaranteed. Usually, local search algorithms operate in a search space which contains complete solutions (feasible or not) to the problem. In contrast, in Consistent Neighborhood Search (CNS), after each variable assignment, the conflicting variables are deleted to keep the partial solution feasible, and the search can stop when all the variables have a value. In this paper, we formally propose a new heuristic solution method, CNS, which has a search behavior between exhaustive tree search and local search working with complete solutions. We then discuss, with a unified view, the great success of some existing heuristics, which can however be considered within the CNS framework, in various fields: graph coloring, frequency assignment in telecommunication networks, vehicle fleet management with maintenance constraints, and satellite range scheduling. Moreover, some lessons are given in order to have guidelines for the adaptation of CNS to other problems.

Sign in / Sign up

Export Citation Format

Share Document