Back to search

University of Patras

Αλγόριθμοι δρομολόγησης και δέσμευσης φάσματος σε ελαστικά οπτικά δίκτυα

Abstract

dc:description

The continuous growth of consumers’ IP traffic, fed by the generalization of broadband access through digital subscriber lines (DSL) and fiber to the home (FTTH) and the emerging rich- content high-rate and burst applications, such as video-on-demand, HDTV, and cloud computing, can be met only with the abundant capacity provided by optical core and metro networks. For the future, it is expected that the traffic will not only increase in volume (traffic increases by 34% on average per year) but will also exhibit high burstiness, resulting in large variations over time and direction. To cope with the increasing capacity requirements, WDM systems target the employment of higher rate and improved distance transmissions. However, the rigid granularity of WDM systems leads to inefficient capacity usage, a problem expected to become more significant with the deployment of the higher channel rate systems. To improve system efficiency, recent research efforts have focused on architectures that support variable spectrum connections. Typically, wavelength routed WDM networks operate over the ITU-T grid, that is, connections are established over a 100 or 50 GHz frequency spaced grid. Elastic optical networks assume the use of tunable transponders and a flexible spectrum grid or flex-grid. Flex-grid’s granularity is much finer than that of standard WDM systems: the spectrum is divided into spectrum slots (12.5 GHz) that can be combined to create channels that are as wide as needed. Tunable optical transponders, also called bandwidth variable transponders (BVTs) or software defined transponders, have been proposed. The key difference to standard transponders is that they can adapt several transmission parameters, such as the baudrate, the modulation format, the spectrum, the launch power or even the Forward Error Connection (FEC) code that they use. In a flexible network, a BVT uses just enough spectrum to serve the demand and every bandwidth-variable Optical Cross-Connect (OXC) on the path establishes a cross-connection with sufficient spectrum to create an appropriately sized end-to-end connection. we propose impairment-aware RSA (IARSA) algorithms for planning transparent and translucent flexible optical networks under physical layer impairments. Although core networks offer high capacities, they consume a non-negligible amount of energy. If the corresponding energy requirements grow analogously with the traffic volume in metro and core networks, they will sooner rather than later form a bottleneck for network communications. Thus, energy efficiency in optical networks is mandatory for the sustainability of the future Internet. The objectives of the current work are to identify the main causes of energy consumption for current fixedgrid wavelength division multiplexing and future flex-grid optical networks, and to propose and compare techniques for improving their energy efficiency. Toward this end, we carried out a comparative study of energy efficiency of elastic networks and fixed-grid single- line-rate and mixed-line-rate networks. Under realistic network scenarios, we calculated the energy consumption of the different components of the optical layer and demonstrated that by using energy-aware techniques in planning such networks, we can achieve significant power savings. Since energy prices are location dependent, especially in large networks, e.g., over continents, we show that accounting. We also consider the problem of dynamic connection establishment and spectrum defragmentation in flexible optical networks. During the operation phase, new connections are established and torn down dynamically with time. In contrast to traditional WDM networks, where spectrum assignment is uniform in the form of wavelengths, in flexible networks the spectrum eventually becomes fragmented, a problem that becomes more severe as time progresses. Thus, after a point the available spectrum is inefficiently utilized, the network serves fewer demands than one would expect at its actual load level, and connections are blocked even though there is enough spectrum on the links that could be used to serve them. The proposed algorithm reactively re-optimizes the network by shifting (“pushing”) in the spectrum domain and/or rerouting existing connections. We present an algorithm based on Integer Linear Programming (ILP) formulation that searches among all combinations of shiftings and reroutings and selects the one that minimizes the changes in existing connections. We also present a heuristic algorithm that recursively shifts/reroutes connections around a void. Our simulation results show that the blocking probability can be substantially reduced using the proposed techniques as opposed to a network that does not reactively defragments the spectrum. Next, we considered the problem of multi-period planning in optical transport networks. The common practice to ensure uninterrupted communication, is to over-provision lightpaths in terms of capacity and physical layer performance. Overprovisioning at the physical layer is achieved using worst-case assumptions and high margins in the estimation of the Quality of Transmission (QoT) when provisioning lightpaths. End-of-Life (EOL) system margins are used to anticipate performance deteriorations due to additional future interference, ageing and maintenance operations, while the design margin is used to account for inaccuracies in the QoT estimation. Such assumptions decrease network efficiency and increase the network cost. The advent of Elastic optical networks (EON) and software defined networking (SDN) will enable a dynamically and adaptably operated optical network. We envision an optical network that continuously senses the physical layer and optimizes connections accordingly. This enables static (e.g. worst case) physical information to be replaced by real-time (and accurate) information. We propose an algorithm that takes into account the actual physical layer performance to provision the lightpaths with actual (just enough) margins, optimizing the decisions regarding the placement and transmission parameters of transponders and regenerators including their launch powers. Using this algorithm in a multi-period planning scenario, we quantify the cost benefits of provisioning with actual margins as opposed to planning with worst case margins. Finally, we present an approach based on admission control and solution validation, for the embedding of virtual network requests in elastic optical networks. This makes use of an optimal offline VNE mechanism for parameterizing the way the online VNE algorithm will operate. To do so, it blocks virtual network requests that if served would negatively affect the performance of the network in the future (waste of network resources, increasing the fragmentation of the network, etc). For the same reason, the presented approach also rejects candidate reservation solutions for accepted (non-blocked) requests, calculated by the online allocation mechanism, and leads to their recalculation. We show through simulations that this optimally-driven approach, for online time-varying virtual network embedding in the elastic optical network, can improve network performance regarding accepted Virtual Network (VN) requests, with similar execution time as the respective (non-optimally-driven) heuristic.

Degree

thesis:*
Grantor dc:publisher
University of Patras
Year dc:date
2017

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Soumplis, Polyzois
  • Σούμπλης, Πολυζώης

Subjects

dc:subject × 12

Rights

Language dc:language
gre

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/56300

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Soumplis, Polyzois; Σούμπλης, Πολυζώης. Αλγόριθμοι δρομολόγησης και δέσμευσης φάσματος σε ελαστικά οπτικά δίκτυα. University of Patras, 2017. http://hdl.handle.net/10442/hedi/56300