Andrea Araldo

Andrea Araldo

Auto-generated profile, based on publicly available information

Andrea Araldo

Samovar, Télécom SudParis, Institut Polytechinique de Paris

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 May 2018 in Transportation Research Record: Journal of the Transportation Research Board
Verified
Journal Article
Open access
RBRounaq Basu
Rounaq Basu
AAAndrea Araldo
Andrea Araldo
AAArun Prakash Akkinepally
Arun Prakash Akkinepally
BNBat-hen Nahmias-Biran
Bat-hen Nahmias-Biran
KBKalaki Basak
Kalaki Basak
MBMoshe Ben-Akiva
Moshe Ben-Akiva
Among the new transportation services made possible by the introduction of automated vehicles, automated mobility-on-demand (AMoD) has attracted a lot of attention from both industry and researchers. AMoD provides a service similar to taxi or ride-sharing services, while being driverless. It is expected to attract a huge fraction of travelers currently using mass transit or private vehicles and will have a disruptive effect on urban transportation. While most studies have focused on the operational efficiency of the technology itself, our work aims to investigate its impact on urban mobility. Our contribution is two-fold. First, we present a flexible AMoD modeling and simulation framework developed within a multi-modal agent-based urban simulation platform (SimMobility). The framework allows the detailed simulation and assessment of different AMoD operations together with an activity-based framework that accounts for changes in demand, such as activity participation, trip making, mode, destination, or route choice decisions. Second, we focus our attention on the role of mass transit in a futuristic urban system where AMoD is widely available. Mass transit is already challenged by current ride-sharing services, for example, Uber and Lyft, which provide comparatively better and cheaper services. This trend will plausibly be exacerbated with the introduction of AMoD, which may indirectly act as a replacement to mass transit. Our simulation results show that mass transit is irreplaceable, despite the high efficiency of AMoD, in order to avoid congestion and maintain a sustainable urban transportation system with acceptable levels of service.

14 May 2015 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
AAAndrea Araldo
Andrea Araldo
DRDario Rossi
Dario Rossi
FMFabio Martignon
Fabio Martignon
Albeit an important goal of caching is traffic reduction, a perhaps even more important aspect follows from the above achievement: the reduction of internet service provider (ISP) operational costs that comes as a consequence of the reduced load on transit and provider links. Surprisingly, to date this crucial aspect has not been properly taken into account in cache design. In this paper, we show that the classic caching efficiency indicator, i.e., the hit ratio, conflicts with cost. We therefore propose a mechanism whose goal is the reduction of cost and, in particular, we design a cost-aware (CoA) cache decision policy that, leveraging price heterogeneity among external links, tends to store with more probability the objects that the ISP has to retrieve through the most expensive links. We provide a model of our mechanism, based on Che's approximation, and, by means of a thorough simulation campaign, we contrast it with traditional cost-blind schemes, showing that CoA yields a significant cost saving, that is furthermore consistent over a wide range of scenarios. We show that CoA is easy to implement and robust, making the proposal of practical relevance.

1 December 2014
Verified
Conference Paper
Closed access
AAAndrea Araldo
Andrea Araldo
MMMichele Mangili
Michele Mangili
FMFabio Martignon
Fabio Martignon
DRDario Rossi
Dario Rossi
Caching is frequently used by Internet Service Providers as a viable technique to reduce the latency perceived by end users, while jointly offloading network traffic. While the cache hit-ratio is generally considered in the literature as the dominant performance metric for such type of systems, in this paper we argue that a critical missing piece has so far been neglected. Adopting a radically different perspective, in this paper we explicitly account for the cost of content retrieval, i.e. the cost associated to the external bandwidth needed by an ISP to retrieve the contents requested by its customers. Interestingly, we discover that classical cache provisioning techniques that maximize cache efficiency (i.e., the hit-ratio), lead to suboptimal solutions with higher overall cost. To show this mismatch, we propose two optimization models that either minimize the overall costs or maximize the hit-ratio, jointly providing cache sizing, object placement and path selection. We formulate a polynomial-time greedy algorithm to solve the two problems and analytically prove its optimality. We provide numerical results and show that significant cost savings are attainable via a cost-aware design.

31 January 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
AAAndrea Araldo
Andrea Araldo
GDGyorgy Dan
Gyorgy Dan
DRDario Rossi
Dario Rossi
In-network caching is an appealing solution to cope with the increasing bandwidth demand of video, audio, and data transfer over the Internet. Nonetheless, in order to protect consumer privacy and their own business, content providers (CPs) increasingly deliver encrypted content, thereby preventing Internet service providers (ISPs) from employing traditional caching strategies, which require the knowledge of the objects being transmitted. To overcome this emerging tussle between security and efficiency, in this paper we propose an architecture in which the ISP partitions the cache space into slices, assigns each slice to a different CP, and lets the CPs remotely manage their slices. This architecture enables transparent caching of encrypted content and can be deployed in the very edge of the ISP's network (i.e., base stations and femtocells), while allowing CPs to maintain exclusive control over their content. We propose an algorithm, called SDCP, for partitioning the cache storage into slices so as to maximize the bandwidth savings provided by the cache. A distinctive feature of our algorithm is that ISPs only need to measure the aggregated miss rates of each CP, but they need not know the individual objects that are requested. We prove that the SDCP algorithm converges to a partitioning that is close to the optimal, and we bound its optimality gap. We use simulations to evaluate SDCP's convergence rate under stationary and nonstationary content popularity. Finally, we show that SDCP significantly outperforms traditional reactive caching techniques, considering both CPs with perfect and with imperfect knowledge of their content popularity.

19 April 2023 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Open access
SCSiyu Chen
Siyu Chen
RSRavi Seshadri
Ravi Seshadri
CACarlos Lima Azevedo
Carlos Lima Azevedo
AAArun P. Akkinepally
Arun P. Akkinepally
RLRenming Liu
Renming Liu
MBMoshe E. Ben-Akiva
Moshe E. Ben-Akiva

1 May 2016
Verified
Conference Paper
Closed access
AAAndrea Araldo
Andrea Araldo
FMFabio Martignon
Fabio Martignon
DRDario Rossi
Dario Rossi
To cope with Internet video explosion, recent work proposes to deploy caches to absorb part of the traffic related to popular videos. Nonetheless, caching literature has mainly focused on network-centric metrics, while the quality of users' video streaming experience should be the key performance index to optimize. Additionally, the general assumption is that each user request can be satisfied by a single object, which does not hold when multiple representations at different quality levels are available for the same video. Our contribution in this paper is to extend the classic object placement problem (which object to cache and where) by further considering the representation selection problem (i.e., which quality representation to cache), employing two methodologies to tackle this challenge. First, we employ a Mixed Integer Linear Programming (MILP) formulation to obtain the centralized optimal solution, as well as bounds to natural policies that are readily obtained as additional constraints of the MILP. Second, from the structure of the optimal solution, we learn guidelines that assist the design of distributed caching strategies: namely, we devise a simple yet effective distributed strategy that incrementally improves the quality of cached objects. Via simulation over large scale scenarios comprising up to hundred nodes and hundred million objects, we show our proposal to be effective in balancing user perceived utility vs bandwidth usage.