The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Routing and spectrum assignment (RSA) problem is a crucial task in designing, planning and operating next-generation optical network based on flex-grid scheme. In practical cases, solving RSA problem involves a number of objectives which, very often, may be in conflict to each other. The need is therefore to find a pool of solutions, known as Pareto-optimal solutions, which are equally optimal. In...
The routing, core allocation and spectrum assignment (RSA) problem in elastic optical networks with multi-core is a well-known NP-hard problem and the network information security is also an important problem in elastic optical networks. In this paper, we combine these two problems to investigate the routing, core allocation and spectrum assignment problem with the guaranteed secure level in elastic...
Coevolution is a well-known way of population diversity preservation in the field of Evolutionary Computation. Usually, the methods that use coevolution are effective in solving hard optimization problems, because they are less likely to stuck in local optima. Therefore, they are more capable of reaching a breakthrough, find new, promising regions in the solution search space and propose solutions...
In transparent optical networks it is critical to consider the impact of the crosstalk effect on the routing and wavelength assignment (RWA) process, in order to limit the impact of jamming attacks on the network, as well as the increased cost arising from the need for high port isolation in optical nodes. In this paper, we propose the use of a Genetic Algorithm (GA) that solves the RWA problem with...
The increasing capacity requirements for IP traffic in recent innovations are optical communication systems. In this paper, a new framework to handle the problem in which the sequence of the customer demands are fixed while trying to find the path for each demand in order to obtain more reasonable solution. Genetic algorithm (GA) is a search heuristic that minimizes the process of selection. Genetic...
Compact and simple all-Optical Wavelength Converters with 2R regeneration capabilities that do not require any high speed electronics and still are able to handle bit rates up to 100 Gbit/s and beyond, are of utmost interest to make today's and future high-speed Telecommunication Systems practical. All-optical networks employing Wavelength Division Multiplexing (WDM) technique will be the backbone...
Flexible optical network (FON) architectures are considered a very promising solution where spectrum resources are allocated within flexible frequency grids. Routing and spectrum allocation (RSA) in FON is known to be an NP-complete problem. So far, this problem has been optimally solved for small instances by the application of integer linear programming and has been sub-optimally solved for more...
A fundamental issue in Elastic Optical Networks (EONs) relies on choosing a proper route and necessary number of contiguous frequency slots from end-to-end to accommodate the traffic demands. Spectrum assignment based on the traditional First-Fit assignment has been extensively employed in EON investigations due to its inherent simplicity and favorable capacity of leaving end-to-end free slots in...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.