arXiv subjects

Brunilde Sansò

Publications and source records attributed to Brunilde Sansò.

13 recordsLinked to original sources

arXiv2024

A Scalable Architecture for Future Regenerative Satellite Payloads

This paper addresses the limitations of current satellite payload architectures, which are predominantly hardware-driven and lack the flexibility to adapt to increasing data demands and uneven traffic. To overcome these challenges, we present a novel architecture for future regenerative and programmable satellite payloads and utilize interconnected modem banks to promote higher scalability and flexibility. We formulate an optimization problem to efficiently manage traffic among these modem banks and balance the load. Additionally, we provide comparative numerical simulation results, considering end-to-end delay and packet loss analysis. The results illustrate that our proposed architecture maintains lower delays and packet loss even with higher traffic demands and smaller buffer sizes.

eess.SP↗

arXiv2023

Evolution of High Throughput Satellite Systems: Vision, Requirements, and Key Technologies

High throughput satellites (HTS), with their digital payload technology, are expected to play a key role as enablers of the upcoming 6G networks. HTS are mainly designed to provide higher data rates and capacities. Fueled by technological advancements including beamforming, advanced modulation techniques, reconfigurable phased array technologies, and electronically steerable antennas, HTS have emerged as a fundamental component for future network generation. This paper offers a comprehensive state-of-the-art of HTS systems, with a focus on standardization, patents, channel multiple access techniques, routing, load balancing, and the role of software-defined networking (SDN). In addition, we provide a vision for next-satellite systems that we named as extremely-HTS (EHTS) toward autonomous satellites supported by the main requirements and key technologies expected for these systems. The EHTS system will be designed such that it maximizes spectrum reuse and data rates, and flexibly steers the capacity to satisfy user demand. We introduce a novel architecture for future regenerative payloads while summarizing the challenges imposed by this architecture.

eess.SP↗

arXiv2023

Data privacy for Mobility as a Service

Mobility as a Service (MaaS) is revolutionizing the transportation industry by offering convenient, efficient and integrated transportation solutions. However, the extensive use of user data as well as the integration of multiple service providers raises significant privacy concerns. The objective of this survey paper is to provide a comprehensive analysis of the current state of data privacy in MaaS, in particular by discussing the associated challenges, existing solutions as well as potential future directions to ensure user privacy while maintaining the benefits of MaaS systems for society.

cs.CR↗

arXiv2022

On the economic viability of solar energy when upgrading cellular networks

The massive increase of data traffic, the widespread proliferation of wireless applications and the full-scale deployment of 5G and the IoT, imply a steep increase in cellular networks energy use, resulting in a significant carbon footprint. This paper presents a comprehensive model to show the interaction between the networking and energy features of the problem and study the economical and technical viability of green networking. Solar equipment, cell zooming, energy management and dynamic user allocation are considered in the upgrading network planning process. We propose a mixed-integer optimization model to minimize long-term capital costs and operational energy expenditures in a heterogeneous on-grid cellular network with different types of base station, including solar. Based on eight scenarios where realistic costs of solar panels, batteries, and inverters were considered, we first found that solar base stations are currently not economically interesting for cellular operators. We next studied the impact of a significant and progressive carbon tax on reducing greenhouse gas emissions (GHG). We found that, at current energy and equipment prices, a carbon tax ten-fold the current value is the only element that could make green base stations economically viable.

cs.CE↗

arXiv2020

5G Simulation-Based Experimentation Framework for Vertical Performance Assessment

5G is being designed as a common platform where multiple vertical applications will be able to co-exist and grow in a seamless manner. The diversity of the vertical requirements as well as the particular features of the 5G network itself, make it a real challenge to be able to assess or predict applications performance for those verticals. In this paper we motivate the fact that because of the very nature of verticals and 5G infrastructure, measurements alone will not be sufficient for application performance monitoring and prediction. We then propose a comprehensive framework to integrate those measurements in a simulation setting, presenting the key features and current roadblocks for an end-to-end wide-spread implementation.

eess.SP↗

arXiv2018

Privacy-preserving classifiers recognize shared mobility behaviours from WiFi network imperfect data

This paper proves the concept that it is feasible to accurately recognize specific human mobility shared patterns, based solely on the connection logs between portable devices and WiFi Access Points (APs), while preserving user's privacy. We gathered data from the Eduroam WiFi network of Polytechnique Montreal, making omission of device tracking or physical layer data. The behaviors we chose to detect were the movements associated to the end of an academic class, and the patterns related to the small break periods between classes. Stringent conditions were self-imposed in our experiments. The data is known to have errors noise, and be susceptible to information loss. No countermeasures were adopted to mitigate any of these issues. Data pre-processing consists of basic statistics that were used in aggregating the data in time intervals. We obtained accuracy values of 93.7 % and 83.3 % (via Bagged Trees) when recognizing behaviour patterns of breaks between classes and end-of-classes, respectively.

eess.SP↗

arXiv2018

Planning Solar in Energy-managed Cellular Networks

There has been a lot of interest recently on the energy efficiency and environmental impact of wireless networks. Given that the base stations are the network elements that use most of this energy, much research has dealt with ways to reduce the energy used by the base stations by turning them off during periods of low load. In addition to this, installing a solar harvesting sys- tem composed of solar panels, batteries, charge con- trollers and inverters is another way to further reduce the network environmental impact and some research has been dealing with this for individual base stations. In this paper, we show that both techniques are tightly coupled. We propose a mathematical model that captures the synergy between solar installation over a network and the dynamic operation of energy-managed base stations. We study the interactions between the two methods for networks of hundreds of base stations and show that the order in which each method is intro- duced into the system does make a difference in terms of cost and performance. We also show that installing solar is not always the best solution even when the unit cost of the solar energy is smaller than the grid cost. We conclude that planning the solar installation and energy management of the base stations have to be done jointly.

cs.NI↗

arXiv2015

SPIDER: Fault Resilient SDN Pipeline with Recovery Delay Guarantees

When dealing with node or link failures in Software Defined Networking (SDN), the network capability to establish an alternative path depends on controller reachability and on the round trip times (RTTs) between controller and involved switches. Moreover, current SDN data plane abstractions for failure detection (e.g. OpenFlow "Fast-failover") do not allow programmers to tweak switches' detection mechanism, thus leaving SDN operators still relying on proprietary management interfaces (when available) to achieve guaranteed detection and recovery delays. We propose SPIDER, an OpenFlow-like pipeline design that provides i) a detection mechanism based on switches' periodic link probing and ii) fast reroute of traffic flows even in case of distant failures, regardless of controller availability. SPIDER can be implemented using stateful data plane abstractions such as OpenState or Open vSwitch, and it offers guaranteed short (i.e. ms) failure detection and recovery delays, with a configurable trade off between overhead and failover responsiveness. We present here the SPIDER pipeline design, behavioral model, and analysis on flow tables' memory impact. We also implemented and experimentally validated SPIDER using OpenState (an OpenFlow 1.3 extension for stateful packet processing), showing numerical results on its performance in terms of recovery latency and packet losses.

cs.NI↗

arXiv2015

Detour Planning for Fast and Reliable Failure Recovery in SDN with OpenState

A reliable and scalable mechanism to provide protection against a link or node failure has additional requirements in the context of SDN and OpenFlow. Not only it has to minimize the load on the controller, but it must be able to react even when the controller is unreachable. In this paper we present a protection scheme based on precomputed backup paths and inspired by MPLS crankback routing, that guarantees instantaneous recovery times and aims at zero packet-loss after failure detection, regardless of controller reachability, even when OpenFlow's "fast-failover" feature cannot be used. The proposed mechanism is based on OpenState, an OpenFlow extension that allows a programmer to specify how forwarding rules should autonomously adapt in a stateful fashion, reducing the need to rely on remote controllers. We present the scheme as well as two different formulations for the computation of backup paths.

cs.NI↗

arXiv2015

Energy management in communication networks: a journey through modelling and optimization glasses

The widespread proliferation of Internet and wireless applications has produced a significant increase of ICT energy footprint. As a response, in the last five years, significant efforts have been undertaken to include energy-awareness into network management. Several green networking frameworks have been proposed by carefully managing the network routing and the power state of network devices. Even though approaches proposed differ based on network technologies and sleep modes of nodes and interfaces, they all aim at tailoring the active network resources to the varying traffic needs in order to minimize energy consumption. From a modeling point of view, this has several commonalities with classical network design and routing problems, even if with different objectives and in a dynamic context. With most researchers focused on addressing the complex and crucial technological aspects of green networking schemes, there has been so far little attention on understanding the modeling similarities and differences of proposed solutions. This paper fills the gap surveying the literature with optimization modeling glasses, following a tutorial approach that guides through the different components of the models with a unified symbolism. A detailed classification of the previous work based on the modeling issues included is also proposed.

cs.NI↗

arXiv2014

Priority Queueing Models for Cognitive Radio Networks with Traffic Differentiation

In this paper, we present a new queueing model providing the accurate average system time for packets transmitted over a cognitive radio (CR) link for multiple traffic classes with the preemptive and non-preemptive priority service disciplines. The analysis considers general packet service time, general distributions for the channel availability periods and service interruption periods, and a service-resume transmission. We further introduce and analyze two novel priority service disciplines for opportunistic spectrum access (OSA) networks which take advantage of interruptions to preempt low priority traffic at a low cost. Analytical results, in addition to simulation results to validate their accuracy, are also provided and illustrate the impact of different OSA network parameters on the average system time. We particularly show that, for the same average CR transmission link availability, the packet system time significantly increases in a semi-static network with long operating and interruption periods compared to an OSA network with fast alternating operating and interruption periods. We also present results indicating that, due to the presence of interruptions, priority queueing service disciplines provide a greater differentiated service in OSA networks than in traditional networks. The analytical tools presented in this paper are general and can be used to analyze the traffic metrics of most OSA networks carrying multiple classes of traffic with priority queueing service differentiation.

cs.NI↗

arXiv2014

Delay Analysis of Multichannel Opportunistic Spectrum Access MAC Protocols

We provide in this paper a comprehensive delay and queueing analysis for two baseline medium access control (MAC) protocols for multi-user cognitive radio (CR) networks and investigate the impact of different network parameters, such as packet size, Aloha-type medium access probability and number of channels on the system performance. In addition to an accurate Markov chain, which follows the queue status of all users, several lower complexity queueing theory approximations are provided. Accuracy and performance of the proposed analytical approximations are verified with extensive simulations. It is observed that for CR networks using an Aloha-type access to the control channel, a buffering MAC protocol, where in case of interruption the CR user waits for the primary user to vacate the channel before resuming the transmission, outperforms a switching MAC protocol, where the CR user vacates the channel in case of appearance of primary users and then compete again to gain access to a new channel. The reason is that the delay bottleneck for both protocols is the time required to successfully access the control channel, which occurs more frequently for the switching MAC protocol. We also propose a user clustering approach, where users are divided into clusters with a separate control channel per cluster, and observe that it can significantly improve the performance by reducing the number of competing users per control channel.

cs.NI↗

arXiv2014

Robust Energy Management for Green and Survivable IP Networks

Despite the growing necessity to make Internet greener, it is worth pointing out that energy-aware strategies to minimize network energy consumption must not undermine the normal network operation. In particular, two very important issues that may limit the application of green networking techniques concern, respectively, network survivability, i.e. the network capability to react to device failures, and robustness to traffic variations. We propose novel modelling techniques to minimize the daily energy consumption of IP networks, while explicitly guaranteeing, in addition to typical QoS requirements, both network survivability and robustness to traffic variations. The impact of such limitations on final network consumption is exhaustively investigated. Daily traffic variations are modelled by dividing a single day into multiple time intervals (multi-period problem), and network consumption is reduced by putting to sleep idle line cards and chassis. To preserve network resiliency we consider two different protection schemes, i.e. dedicated and shared protection, according to which a backup path is assigned to each demand and a certain amount of spare capacity has to be available on each link. Robustness to traffic variations is provided by means of a specific modelling framework that allows to tune the conservatism degree of the solutions and to take into account load variations of different magnitude. Furthermore, we impose some inter-period constraints necessary to guarantee network stability and preserve the device lifetime. Both exact and heuristic methods are proposed. Experimentations carried out with realistic networks operated with flow-based routing protocols (i.e. MPLS) show that significant savings, up to 30%, can be achieved also when both survivability and robustness are fully guaranteed.

cs.NI↗