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.
The energy efficiency in telecommunication networks is gaining more relevance with the actual increasing traffic demand. In this paper, we compare the performance in terms of energy efficiency and blocking rate in elastic optical network (EON) for the NSFNET and USA topologies, by adopting three modulations formats: Binary Phase-Shift Keying (BPSK), Quadrature Phase-Shift Keying (QPSK) and Quadrature...
Elastic Optical Networks (EON) have been a constant focus of studies in recent years because they have characteristics that stand out in relation to current optical networks. Among these characteristics, it is possible to highlight the ability to transmit data with different bandwidths, adapted to the demand, which guarantees a high spectral efficiency. Different techniques and heuristics have been...
Studies on Flexible-Grid technology reveals that it provides desirable solution for next generation high-speed network design. Multicast Routing and Spectrum assignment (MRSA) in Flexible-Grid Optical Networks (alternately Elastic Optical Networks) generates a multicast tree for each multicast session request and spectrum frequency slots are allocated to each of the edge of the multicast tree. Orthogonal...
We present an optimal and efficient algorithm for finding a shortest path in an elastic optical network. The algorithm is an adaptation of the Dijkstra shortest path algorithm, where we take into account the spectrum continuity and contiguity constraints, and a limit on the path length. The adaptation redefines the node label in the Dijkstra algorithm, allows for revisiting nodes even at a higher...
Elastic optical networks employ flexible routing and spectrum allocation algorithms to support diverse services and heterogeneous traffic. By splitting a traffic request into multiple small-size subconnections and individually transmitting them through several optical paths, multipath routing algorithms can more flexibly utilize spectrum resources than single-path routing algorithms in dynamic scenario...
Routing and Spectrum Allocation (RSA) algorithms are used to compute both routing and spectrum allocation of connection demands in Elastic Optical Networks (EONs). A number of RSA algorithms have been proposed. Their performance is usually measured in terms of overall blocking probability. In this paper the authors pursue an additional performance indicator that is introduced to quantify the level...
In this paper we present a tabu search-based algorithm, which is dedicated to solving the routing and spectrum allocation problem in elastic optical networks. To evaluate performance of the proposed method, we carry a number of experiments on realistic network topologies. We compare our method with both optimal results yielded by the CPLEX solver and results obtained by heuristic algorithms that were...
We present a network planning and operation tool, called Mantis, for designing the next generation optical networks, supporting both flex-grid and mixed line rate networks. Through Mantis, the user is able to define the network topology the traffic matrix, the CAPEX/OPEX parameters, setup basic configuration parameters, and use a library of algorithms to plan, operate, or evaluate an optical network...
In this article, we address the problem of static routing and spectrum allocation (RSA) in an elastic optical network (EON) with dedicated path protection (DPP) consideration. We formulate RSA-DPP as an Integer Linear Programming (ILP) problem. Since RSA is a difficult problem, we propose an Adaptive Frequency Assignment with Dedicated Path Protection (AFA-DPP) heuristic algorithm to provide near-optimal...
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.