| Records |
| Author |
Borquez-Paredes, D.; Beghelli, A.; Leiva, A.; Jara, N.; Lozada, A.; Morales, P.; Saavedra, G.; Olivares, R. |
| Title |
Agent-based distributed protocol for resource discovery and allocation of virtual networks over elastic optical networks |
Type |
|
| Year |
2022 |
Publication |
Journal of Optical Communications and Networking |
Abbreviated Journal |
J. Opt. Commun. Netw. |
| Volume |
14 |
Issue |
8 |
Pages |
667-679 |
| Keywords |
Optical fiber networks; Resource management; SubstratesVirtual links; ProtocolsVirtualization; Optical fiber communication |
| Abstract |
Network virtualization is a key enabling technology for “Infrastructure as a Service” provisioning, increasing the flexibility and cost savings offered to customers. By extending the concept of server virtualization to the network infrastructure, the allocation of different, independent virtual networks over a single physical network is carried out on demand. A fundamental challenge in network virtualization systems is to choose which physical nodes and links to use for hosting virtual networks in the physical infrastructure, known as the “virtual network allocation” problem. All virtual network allocation proposals on elastic optical networks assume a centralized operation, deploying a single node with access to the network state global information and assigning resources accordingly. However, such configuration might exhibit the inherent problems of centralized systems: survivability and scalability. In this paper, we present a distributed protocol for resource discovery, mapping, and allocation of network virtualization systems. The distributed protocol is generic enough as to be used with different substrate networks. However, in this paper, it has been adapted to work over an elastic optical network infrastructure, where further considerations regarding the spectrum continuity and contiguity constraints must also be taken into account. The distributed protocol is based on the concept of alliances: upon the arrival of a virtual network request, agents located in the physical network nodes compete to form the first alliance able to host the virtual network. Because the first alliances to be formed are also the ones composed by nearby nodes, a good network resource usage is achieved. The feasibility of the distributed protocol was studied by evaluating its ability to successfully establish virtual networks within acceptable time and with low bandwidth consumption from the coordination messages. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1943-0620 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
WOS:000837452500002 |
Approved |
|
| Call Number |
UAI @ alexi.delcanto @ |
Serial |
1632 |
| Permanent link to this record |
| |
|
| |
| Author |
Calderon, F.; Lozada, A.; Morales, P.; Borquez-Paredes, D.; Jara, N.; Olivares, R.; Saavedra, G.; Beghelli, A.; Leiva, A. |
| Title |
Heuristic Approaches for Dynamic Provisioning in Multi-Band Elastic Optical Networks |
Type |
|
| Year |
2022 |
Publication |
IEEE Communications Letters |
Abbreviated Journal |
IEEE Commun. Lett. |
| Volume |
26 |
Issue |
2 |
Pages |
379-383 |
| Keywords |
Resource management; Partitioning algorithms; Modulation; Bit rate; Signal to noise ratio; Optical scattering |
| Abstract |
Multi-band elastic optical networks are a promising alternative to meet the bandwidth demand of the ever-growing Internet traffic. In this letter, we propose a family of band allocation algorithms for multi-band elastic optical networks. Employing simulation, we evaluate the blocking performance of 3 algorithms of such a family and compare their performance with the only heuristic proposed to date. Results show that the three new algorithms outperform the previous proposal, with up to one order of magnitude improvement. We expect these results to help advance the area of dynamic resource allocation in multi-band elastic optical networks. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1089-7798 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
WOS:000754246100037 |
Approved |
|
| Call Number |
UAI @ alexi.delcanto @ |
Serial |
1733 |
| Permanent link to this record |
| |
|
| |
| Author |
Morales, P.; Lozada, A.; Borquez-Paredes, D.; Olivares, R.; Saavedra, G.; Leiva, A.; Beghelli, A.; Jara, N. |
| Title |
Improving the Performance of SDM-EON Through Demand Prioritization: A Comprehensive Analysis |
Type |
|
| Year |
2021 |
Publication |
IEEE Access |
Abbreviated Journal |
IEEE Access |
| Volume |
9 |
Issue |
|
Pages |
63475-63490 |
| Keywords |
Modulation; Optical fiber networks; Optical modulation; Routing; Resource management; Bandwidth; Optical variables control; Elastic optical networks; space-division multiplexing; resource assignment; network capacity; physical-layer impairments |
| Abstract |
This paper studies the impact of demand-prioritization on Space-Division Multiplexing Elastic Optical Networks (SDM-EON). For this purpose, we solve the static Routing, Modulation Level, Spatial Mode, and Spectrum Assignment (RMLSSA) problem using 34 different explainable demand-prioritization strategies. Although previous works have applied heuristics or meta-heuristics to perform demand-prioritization, they have not focused on identifying the best prioritization strategies, their inner operation, and the implications behind their good performance by thorough profiling and impact analysis. We focus on a comprehensive analysis identifying the best explainable strategies to sort network demands in SDM-EON, considering the physical-layer impairments found in optical communications. Also, we show that simply using the common shortest path routing might lead to higher resource requirements. Extensive simulation results show that up to 8.33% capacity savings can be achieved on average by balanced routing, up to a 16.69% capacity savings can be achieved using the best performing demand-prioritization strategy compared to the worst-performing ones, the most used demand-prioritization strategy in the literature (serving demands with higher bandwidth requirements first) is not the best-performing one but the one sorting based on the path lengths, and using double-criteria strategies to break ties is key for a good performance. These results are relevant showing that a good combination of routing and demand-prioritization heuristics impact significantly on network performance. Additionally, they increase the understanding about the inner workings of good heuristics, a valuable knowledge when network settings forbid using more computationally complex approaches. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
2169-3536 |
ISBN |
|
Medium |
|
| Area |
2169-3536 |
Expedition |
|
Conference |
|
| Notes |
WOS:000645846600001 |
Approved |
|
| Call Number |
UAI @ alexi.delcanto @ |
Serial |
1371 |
| Permanent link to this record |
