An improved algorithm for RWA problem on sparse multifiber wavelength routed optical networks

Forghani-elahabad, Majid; Bonani, Luiz Henrique

doi:10.1016/j.osn.2017.03.001

Cited by 8 publications

(2 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first approach is used in algorithms as Least Congested Path (LCP) [91] or Fixed-Paths Least-Congestion (FPLC) [92]. Proposals based on the second technique, i.e., the calculation of new routes, are found in [63], [89], [93], [94], [95], [96].…”

Section: Authorsmentioning

confidence: 99%

See 1 more Smart Citation

Virtualisation and resource allocation in MECEnabled metro optical networks

Pérez¹

View full text Add to dashboard Cite

The appearance of new network services and the ever-increasing network traffic and number of connected devices will push the evolution of current communication networks towards the Future Internet. In the area of optical networks, wavelength routed optical networks (WRONs) are evolving to elastic optical networks (EONs) in which, thanks to the use of OFDM or Nyquist WDM, it is possible to create super-channels with custom-size bandwidth. The basic element in these networks is the lightpath, i.e., all-optical circuits between two network nodes. The establishment of lightpaths requires the selection of the route that they will follow and the portion of the spectrum to be used in order to carry the requested traffic from the source to the destination node. That problem is known as the routing and spectrum assignment (RSA) problem, and new algorithms must be proposed to address this design problem. Some early studies on elastic optical networks studied gridless scenarios, in which a slice of spectrum of variable size is assigned to a request. However, the most common approach to the spectrum allocation is to divide the spectrum into slots of fixed width and allocate multiple, consecutive spectrum slots to each lightpath, depending on the requested bandwidth. Moreover, EONs also allow the proposal of more flexible routing and spectrum assignment techniques, like the split-spectrum approach in which the request is divided into multiple "sub-lightpaths". In this thesis, four RSA algorithms are proposed combining two different levels of flexibility with the well-known k−shortest paths and first fit heuristics. After comparing the performance of those methods, a novel spectrum assignment technique, Best Gap, is proposed to overcome the inefficiencies emerged when combining the first fit heuristic with highly flexible networks. A simulation study is presented to demonstrate that, thanks to the use of Best Gap, EONs can exploit the network flexibility and reduce the blocking ratio. On the other hand, operators must face profound architectural changes to increase the adaptability and flexibility of networks and ease their management. Thanks to the use of network function virtualisation (NFV), the necessary network functions that must be applied to offer a service can be deployed as virtual appliances hosted by commodity servers, which can be located in data centres, network nodes or even end-user premises. The appearance of new computation and networking paradigms, like multi-access edge computing (MEC), may facilitate the adaptation of communication networks to the new demands. Furthermore, the use of MEC technology will enable the possibility of installing those virtual network functions (VNFs) not only at data centres (DCs) and central offices (COs), traditional hosts of VFNs, but also at the edge nodes of the network. Since data processing is performed closer to the enduser, the latency associated to each service connection request can be reduced. MEC nodes will be usually connected between them and with the DCs and COs ...

show abstract

Section: Authorsmentioning

confidence: 99%

“…The techniques for solving the wavelength assignment problem in static WRON can also be applied in the dynamic scenario. Consequently, we can find the First Fit technique in [36], [63], [95], [97], [98], Random in [86], [87]; while [63], [64] utilise Most Used and Least Used is employed in [63].…”

Section: Authorsmentioning

confidence: 99%