arXiv subjects

Marilet De Andrade

Publications and source records attributed to Marilet De Andrade.

3 recordsLinked to original sources

arXiv2026

Compensating the Packet Delay Variation for 6G Integrated with IEEE Time-Sensitive Networking

6G is deemed as a key technology to support emerging applications with stringent requirements for highly dependable and timecritical communication. In this paper, we investigate 6G networks integrated with TSN and how to compensate for wireless stochastic behavior which involves a large intrinsic packet delay variation. We evaluate a 6G solution to reduce packet delay variation that is based on de-jittering. For this, we propose to use virtual timeslots for providing the required time-awareness. We discuss the benefits of the proposed solution while evaluating the impact of the timeslot size on the number of schedulable TSN streams.

cs.NI↗

arXiv2023

Towards Deterministic Communications in 6G Networks: State of the Art, Open Challenges and the Way Forward

Over the last decade, society and industries are undergoing rapid digitization that is expected to lead to the evolution of the cyber-physical continuum. End-to-end deterministic communications infrastructure is the essential glue that will bridge the digital and physical worlds of the continuum. We describe the state of the art and open challenges with respect to contemporary deterministic communications and compute technologies: 3GPP 5G, IEEE Time-Sensitive Networking, IETF DetNet, OPC UA as well as edge computing. While these technologies represent significant technological advancements towards networking Cyber-Physical Systems (CPS), we argue in this paper that they rather represent a first generation of systems which are still limited in different dimensions. In contrast, realizing future deterministic communication systems requires, firstly, seamless convergence between these technologies and, secondly, scalability to support heterogeneous (time-varying requirements) arising from diverse CPS applications. In addition, future deterministic communication networks will have to provide such characteristics end-to-end, which for CPS refers to the entire communication and computation loop, from sensors to actuators. In this paper, we discuss the state of the art regarding the main challenges towards these goals: predictability, end-to-end technology integration, end-to-end security, and scalable vertical application interfacing. We then present our vision regarding viable approaches and technological enablers to overcome these four central challenges. Key approaches to leverage in that regard are 6G system evolutions, wireless friendly integration of 6G into TSN and DetNet, novel end-to-end security approaches, efficient edge-cloud integrations, data-driven approaches for stochastic characterization and prediction, as well as leveraging digital twins towards system awareness.

cs.NI↗

arXiv2018

Power-Aware Virtual Network Function Placement and Routing using an Abstraction Technique

The Network Function Virtualization (NFV) is very promising for efficient provisioning of network services and is attracting a lot of attention. NFV can be implemented in commercial off-the-shelf servers or Physical Machines (PMs), and many network services can be offered as a sequence of Virtual Network Functions (VNFs), known as VNF chains. Furthermore, many existing network devices (e.g., switches) and collocated PMs are underutilized or over-provisioned, resulting in low power-efficiency. In order to achieve more energy efficient systems, this work aims at designing the placement of VNFs such that the total power consumption in network nodes and PMs is minimized, while meeting the delay and capacity requirements of the foreseen demands. Based on existing switch and PM power models, we propose a Integer Linear Programming (ILP) formulation to find the optimal solution. We also propose a heuristic based on the concept of Blocking Islands (BI), and a baseline heuristic based on the Betweenness Centrality (BC) property of the graph. Both heuristics and the ILP solutions have been compared in terms of total power consumption, delay, demands acceptance rate, and computation time. Our simulation results suggest that BI-based heuristic is superior compared with the BC-based heuristic, and very close to the optimal solution obtained from the ILP in terms of total power consumption and demands acceptance rate. Compared to the ILP, the proposed BI-based heuristic is significantly faster and results in 22% lower end-to-end delay, with a penalty of consuming 6% more power in average.

cs.NI↗