The service model is constantly changing on the Internet, and the most prominent model in recent years is the use of cloud computing. The more connected world has generated new needs that must be met by the core of the network in order for the Internet to function. Communication at high speeds, always available and efficient is vital if demand is to be met. The characteristics of this traffic have prompted the development of new mechanisms to deal with the increasing rate of data transmitted over the network. Innovations at earlier layers of the network are emerging, and the proposal for flexible spectrum links is proving to be very promising for meeting the heterogeneous requests coming in. In this context, this paper proposes a routing algorithm for the SDM-DC-EONs network model. The proposed solution presents results that surpass models in the literature by up to two orders of magnitude when it comes to establishing transmissions in the network, represented by the Bandwidth Blocking Ratio.

In recent years, global communication has undergone intense transformations, especially in its use. The post-pandemic world shows new everyday situations where the connection needs specific characteristics, such as low latency, higher reliability, and higher bandwidth, among other things. The Space Division Multiplexing Elastic Optical Networks provide the scenario that contemplates these demanded situations but exposes the need for mechanisms capable of managing such a network architecture. This article evaluates four routing algorithms for Elastic Optical Networks with Space Division Multiplexing and some of its most discussed problems, such as Fragmentation and Crosstalk. The proposed algorithms prevent the formation of network bottlenecks and reduce the resources used. Also, it is possible to compare the impact of using different routing schemes in SDM-EONs.

Virtual Reality (VR) content is gaining popularity and allowing users to immerse themselves in a new world over the Internet. However, the high-demand for resources and the low latency requirements of VR services require changes in the current 5G networks to deliver VR with quality assurance. Microservices present a suitable model for deploying services at different levels of a 5G fog computing architecture for managing traffic and providing Quality of Experience (QoE) guarantees to VR clients. However, finding the most suitable fog node to allocate microservices for VR clients in QoE-aware 5G scenarios is a difficult task. This article proposes a QoE VR-based mechanism for allocating microservice dynamically in 5G architectures, called Fog4VR. Fog4VR determines the optimal fog node to allocate the VR microservice based on delay, migration time, and resource utilization rate. This article also presents the INFORMER, an integer linear programming model aiming to find the optimal global solution for microservice allocation. Results obtained with INFORMER serve as a baseline to evaluate Fog4VR in different scenarios using a simulation environment. Results demonstrate the efficiency of Fog4VR compared to existing mechanisms in terms of cost, migration time, fairness index, and QoE.

In modern 5G and Beyond (B5G) networks, the number of users and devices consuming highly-demanding services in terms of latency and throughput. Due to their high dynamicity and fine-grainess, such services must be supported by a joint management and integration effort between technologies such as Mobile Edge Computing (MEC), Unmanned Aerial Vehicles (UAVs), and novel radio and energy transfer techniques. The notion of Flying Edge Computing (FEC) arises as a prominent solution to provide a deeper level of integration and capabilities to UAV networks in collaboration with traditional edge computing and B5G infrastructure. FEC constitutes a highly elastic computation layer in modern networks, which can quickly adapt to surges in demand. This paper dives into FEC’s main opportunities and motivations in modern scenarios and presents some of the important design aspects of FEC. Experimental results show that the coupling of traditional MEC with FEC can deliver significantly better Quality of Service (QoS), improve service availability, and user satisfaction. Furthermore, FEC can adapt to user mobility patterns more efficiently, delivering contents and services.

Long Range Wide Area Network (LoRaWAN) enables flexible long-range communication with low power consumption and low-cost design perspectives. However, the adoption of this technology brings new challenges due to the densification of IoT devices, which causes signal interference and affects the QoS directly. On the other hand, the flexibility in the LoRaWAN transmission configurations allows higher management in the use of end-device parameters, which allows better resource utilization and improves network scalability. This paper proposes an adaptive solution to handle the define best LoRaWAN parameter settings to reduce the channel utilization and, consequently, maximize the number of packets delivered. Additionally, to validate our method, we formulated mixed-Integer linear programming and results compared to those given by the heuristics. Results provided by the heuristic are close to those provided by the MILP.

In Connected Autonomous Vehicles scenarios or CAV, ubiquitous connectivity will play a significant role in the safety of the vehicles and passengers. The extensive amount of sensors in each car will generate vast amounts of data that cannot be processed promptly by onboard units. Edge and fog computing are emerging solutions for remote data processing for autonomous vehicles, offering higher computing power, as well as the low latency required by autonomous driving. However, due to the highly distributed nature of fog and edge computing servers, CAV mobility may pose a challenge to keep services close to end-users and maintaining QoS. In this paper, we propose MOSAIC, service migration, and resource management algorithm for intra-tier and inter-tier communication in edge and fog computing. The proposed solution performs proactive migration of services based on mobility information, server resources, QoS, and network conditions. Simulation results show the efficiency of the proposed algorithm in terms of latency, migration failures, and network throughput.

The growing popularity of heterogeneous applications on the Internet, added to new information and communication technologies, has driven the exhaustion of the physical limitations of the Internet backbone. To overcome these limitations, emerged the Space-Division Multiplexing Elastic optical networks is a promising solution to cope with the expected depletion of the capacity of single-core networks. This paper proposes an algorithm for routing, modulation, spectrum, and core allocation (RMSCA) problem. The proposed solution maps the links, slots, and cores on edge efficiently, improving resource allocation. Results show that the proposed algorithm decreases the blocking ratio by up to three orders of magnitude when compared with other RMSCA algorithms in the literature.

Wearable devices/sensors and wireless networking play a pivotal role in enabling e-Health environments demanding biometry monitoring outside hospital facilities. In this regard, the Long-Range Wide-Area Network (LoRaWAN) technology is considered the most adopted wide area network since it promises ubiquitous connectivity in outdoor e-Health applications while keeping network structures and simple management, recently gained interest from the research and industrial community. However, the coexistence of high-dense wireless sensors brings several issues to LoRaWAN, such as high interference and channel congestion. In this paper, we introduce assessments on the LoRaWAN in an e-Health scenario by modeling wireless sensor traffic and implementing it on a network simulator. Simulation results suggest that while LoRaWAN can be extremely useful, by providing communication to thousands of simultaneous users, but its MAC layer structure and design limits significantly. We also introduce future research directions driven by the simulation results and LoRaWAN characteristics, for the goal to improve LoRaWAN performance in an e-Health scenario.

The adoption ofSpace division multiplexing (SDM) in elastic optical networks brings new challenges for spectrum allocation. This paper proposes an algorithm for routing, spectrum and core allocation based on single/multipath routing for providing path protection. The proposed solution has the advantage of using small contiguous bands divided into several paths to provide the request protected bandwidth, allowing the increase in the number of requests accepted. Results show that the proposed algorithm can decrease the blocking ratio by three orders of magnitude when compared with other existing algorithms.

The use of protection in elastic optical networks (EONs) with spatial division multiplexing (SDM) can lead to under-utilization of the spectrum, since a high number of resources is reserved for protection. In this paper, we propose an algorithm that employs minimum interference routing, FIPP p-cycle, optical traffic grooming, and spectrum overlap to increase the efficiency in spectrum utilization in protected EONs-SDM. Extensive simulation results show that the proposed algorithm prevents the formation of network bottlenecks and reduces the resources used for protection.

Spatial division multiplexing is a promising solution proposed for elastic optical networks to cope with the expected depletion of the capacity of single core networks. The introduction of space division multiplexing in optical networks brings new challenges for network protection since a lightpath can span high capacity and transmit data at different rates. In addition, there is a great need for protection mechanisms against failure due to the high volume of traffic carried in these networks. Moreover, these networks suffer from the fragmentation of the spectrum that hampers the contiguity and continuity constraints and therefore increase blocking. To address these problems, in this paper, we propose a protection algorithm for elastic optical networks with spatial division multiplexing using hybrid routing and FIPP pcycle. The proposed algorithm prioritizes the use of single path routing, and uses multipath when no single path can be found to accommodate the requested bandwidth. The proposed algorithm is compared to four other algorithms that use single path routing. Results indicate that 100% protection for single failures with low overhead can be provided by the proposed algorithm.

The Space division multiplexing (SDM) in elastic optical networks brings new challenges for protection of networks since a lightpath can span multiple cores. Although previous studies have studied protection in SDM elastic optical networks (EON), no work has considered the joint use of p-cycle, traffic grooming and spectrum overlap for these networks. In this paper, we investigate the problem of protection in space division multiplexing elastic optical networks, generating primary paths and p-cycles. The proposed solution allows a more efficient use of network, keeping crosstalk acceptable. Results derived via simulation show that the proposed spectrum overlap, traffic grooming and FIPP p-cycle algorithm can keep the quality of transmission and yet decrease the blocking of connections.

The introduction of space division multiplexing (SDM) is a promising solution to cope with the ever increasing Internet traffic. The introduction of SDM brings new challenges for protecting the network since a lightpath can span multiple cores. In this paper, we propose a novel routing, modulation level and spectrum assignment (RMLSA) algorithm to dynamically generate primary and backup paths using a shared backup scheme and adaptive modulation in elastic optical networks employing multi-core fibers and space division multiplexing. The proposed algorithm is evaluated and its performance compared to the performance of other algorithms in the literature. Results indicate that 100% protection for single failures is achieved by our algorithm and yet it produces better performance when compared to the performance of existing algorithms.

Although shared path protection has been employed for protecting traffic flows against network failures, to our knowledge, it has not been considered for path protection in elastic optical networks with space division multiplexing (SDM). In this paper, we propose an algorithm to dynamically generate primary and backup paths using a shared backup scheme. The proposed algorithm is compared to the Failure-Independent Path Protecting for MultiCore network (FIPPMC) algorithm and to the Shared path with Spectrum and Core Assignment (SSCA) algorithm. Results indicate that 100% protection for single failures can be provided by the proposed algorithm with low overhead when compared to the other two algorithms.

In recent years, elastic optical networks have emerged as a solution for dealing with the diversity of the bandwidth demands of network applications. The use of only two multiplexing dimensions has limited the network capacity. To ameliorate this problem, a third dimension has been added in space division multiplexing(SDM). As transmission rates increase so does the need for protection against network failures. Among the protection schemes,those protecting paths are of great interest due to their end-to-end solutions. This paper introduces a novel algorithm based on p-cycle to provide failure-independent path protection in elastic optical networks with SDM.

In multilayer networks, protection can be accomplished in any of the layers. However, which layer to protect most remains an important problem. In this paper, we consider a three-layer with IP/MPLS-over-OTN-over-DWDM in which we consider an optimization modeling framework incorporating modularization of its capacity for protection in any layer. Our resulting study, conducted on two topologies, shows that the cost ratio of different layers is an important factor in answering this question, as well as the actual modular values of the capacity used. Furthermore, we found that the cost providing protection in the OTN layer is highly influenced by the network connectivity.

In optical networks, faults in links and nodes cause massive loss of data even if for short periods. Therefore, protection techniques have been developed to cope with failures. Among these techniques, p-cycle is very attractive since it provides ring-like speed of restoration in mesh topologies. In recent years, the technology of flexgrid networks has emerged as a solution for dealing with the diversity of bandwidth demands of network applications. However, very few investigations have been proposed for path protection in flexgrid networks. This paper introduces a novel algorithm to provide Failure-independent path protecting p-cycle for path protection in flexgrid networks. The proposed algorithm is compared to two other algorithms in the literature. Results indicate that the 100% protection for single failures can be provided by the proposed algorithm with low overhead to networks with high node connectivity.