Solving large-scale SONET network design problems using bee-inspired algorithms

In the past years, the number of users of Internet-based applications has exponentially increased and consequently the request for transmission capacity or bandwidth has significantly augmented. When managed properly, the ring networks are uniquely suited to deliver a large amount of bandwidth in a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Optical switching and networking Jg. 9; H. 2; S. 97 - 117
Hauptverfasser:	Bernardino, Eugénia Moreira, Bernardino, Anabela Moreira, Sánchez-Pérez, Juan Manuel, Gómez-Pulido, Juan Antonio, Vega-Rodríguez, Miguel Angel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.04.2012
Schlagworte:	Bee-inspired algorithms Intraring SONET design problem Optical telecommunication networks SONET assignment problem SONET assignment problem Optical telecommunication networks Bee-inspired algorithms Intraring SONET design problem
ISSN:	1573-4277, 1872-9770
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In the past years, the number of users of Internet-based applications has exponentially increased and consequently the request for transmission capacity or bandwidth has significantly augmented. When managed properly, the ring networks are uniquely suited to deliver a large amount of bandwidth in a reliable and inexpensive way. In this paper, we consider two problems that arise in the design of optical telecommunication networks, namely the SONET Ring Assignment Problem (SRAP) and the Intraring Synchronous Optical Network Design Problem (IDP), known to be NP-hard. In SRAP, the objective is to minimise the number of rings (i.e., DXCs). In IDP, the objective is to minimise the number of ADMs. Both problems are subject to a ring capacity constraint. To solve these problems, we propose two bee-inspired algorithms: Hybrid Artificial Bee Colony and Hybrid Bees Algorithm. We hybridise the basic form of these algorithms with local search, in order to refine newly constructed solutions. We also perform comparisons with other algorithms from the literature and use larger instances. The simulation results verify the effectiveness and robustness of the proposed algorithms.
ISSN:	1573-4277 1872-9770
DOI:	10.1016/j.osn.2011.11.001