Segui
Andrea Araldo
Andrea Araldo
Associate Professor - Institut Polytechnique de Paris - Télécom SudParis
Email verificata su telecom-sudparis.eu - Home page
Titolo
Citata da
Citata da
Anno
Automated mobility-on-demand vs. mass transit: a multi-modal activity-driven agent-based simulation approach
R Basu, A Araldo, AP Akkinepally, BH Nahmias Biran, K Basak, ...
Transportation Research Record 2672 (8), 608-618, 2018
127*2018
Cost-aware caching: Caching more (costly items) for less (ISPs operational expenditures)
A Araldo, D Rossi, F Martignon
Transactions on Parallel and Distributed Systems (TPDS), 2015
632015
Cost-aware caching: optimizing cache provisioning and object placement in ICN
A Araldo, M Mangili, F Martignon, D Rossi
2014 IEEE Global Communications Conference, 1108-1113, 2014
502014
Representation selection problem: optimizing video delivery through caching
A Araldo, F Martignon, D Rossi
IFIP Networking 2016, 2016
282016
From traditional to automated mobility on demand: a comprehensive framework for modeling on-demand services in SimMobility
B Nahmias-Biran, JB Oke, N Kumar, K Basak, A Araldo, R Seshadri, ...
Transportation Research Record 2673 (12), 15-29, 2019
252019
Resource Allocation for Edge Computing with Multiple Tenant Configurations
A Araldo, A Di Stefano, A Di Stefano
ACM Symposium on Applied Computing (SAC), 2020
212020
Caching Encrypted Content via Stochastic Cache Partitioning
A Araldo, G Dán, D Rossi
IEEE/ACM Transactions on Networking 26 (1), 548-561, 2018
202018
Design and evaluation of cost-aware information centric routers
A Araldo, D Rossi, F Martignon
ACM SIGCOMM ICN conference 2014, 147-156, 2014
152014
Integrating fixed and demand-responsive transportation for flexible transit network design
G Calabrò, A Araldo, S Oh, R Seshadri, G Inturri, M Ben-Akiva
TRB 2021: 100th Annual Meeting of the Transportation Research Board, 2021
142021
On the Importance of demand Consolidation in Mobility on Demand
A Araldo, A Di Maria, A Di Stefano, G Morana
IEEE/ACM DS-RT: Distributed Simulation and Real Time Applications (23rd Int …, 2019
142019
Stochastic Dynamic Cache Partitioning for Encrypted Content Delivery
A Araldo, G Dan, D Rossi
International Teletraffic Congress (ITC) 2016, 2016
112016
Towards Inference Delivery Networks: Distributing Machine Learning with Optimality Guarantees
TS Salem, G Castellano, G Neglia, F Pianese, A Araldo
19th Mediterranean Communication and Computer Networking Conference (MedComNet), 2021
92021
On the deployability of augmented reality using embedded edge devices
AB Ameur, A Araldo, F Bronzino
2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC …, 2021
82021
Integrated simulation of activity-based demand and multi-modal dynamic supply for energy assessment
N Fournier, S Chen, IHV De Lima, Z Needell, A Deliali, A Araldo, ...
2018 21st International Conference on Intelligent Transportation Systems …, 2018
82018
Dissecting bufferbloat: Measurement and per-application breakdown of queueing delay
AG Araldo, D Rossi
CoNEXT Student workhop 2013, 2013
82013
Cache Allocation in Multi-Tenant Edge Computing via online Reinforcement Learning
A Ben-Ameur, A Araldo, T Chahed
IEEE ICC 2022, 2022
72022
System-Level Optimization of Multi-Modal Transportation Networks for Energy Efficiency using Personalized Incentives: Formulation, Implementation and Performance
A Araldo, S Gao, R Seshadri, C Lima Azevedo, H Ghafourian, Y Sui, ...
Transportation Research Record, 2019
72019
A two-stage algorithm for the Virtual Network Embedding problem
M Elkael, B Jouaber, H Castel-Taleb, A Araldo, D Olivier
2021 IEEE 46th Conference on Local Computer Networks (LCN), 395-398, 2021
52021
Analysis and Design of Markets for Tradable MobilityCredit Schemes
S Chen, R Seshadri, C Lima Azevedo, AP Akkinepally, R Liu, A Araldo, ...
arXiv e-prints, arXiv: 2101.00669, 2021
52021
EdgeMORE: Improving resource allocation with multiple options from tenants
A Araldo, A Di Stefano, A Di Stefano
IEEE Consumer Communications & Networking Conference (CCNC), 2020
52020
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20