default search action
Sara Alouf
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2017
- [b2]Sara Alouf:
From Wireless Networks to Green IT -A Journey Through Stochastic Models and Tools. (Des réseaux sans fil à l'informatique verte - -Un voyage à travers des modèles et des outils stochastiques). University of Côte d'Azur, France, 2017 - 2002
- [b1]Sara Alouf:
Parameter estimation and performance analysis of several network applications. (Estimation de paramètres et analyse des performances de diverses applications réseaux). University of Nice Sophia Antipolis, France, 2002
Journal Articles
- 2024
- [j14]Younes Ben Mazziane
, Sara Alouf, Giovanni Neglia, Daniel Sadoc Menasché:
TTL model for an LRU-based similarity caching policy. Comput. Networks 241: 110206 (2024) - [j13]Sara Alouf, Y. C. Tay:
ACM SIGMETRICS 2023 Student Research Competition. SIGMETRICS Perform. Evaluation Rev. 51(3): 2 (2024) - 2023
- [j12]Sara Alouf
Technical Perspective: Can We Uncover Private Backbone Infrastructures? Commun. ACM 66(8): 94 (2023) - 2022
- [j11]Younes Ben Mazziane
Analyzing Count Min Sketch with Conservative Updates. Comput. Networks 217: 109315 (2022) - 2016
- [j10]Sara Alouf
Performance models for hierarchy of caches: Application to modern DNS caches. Perform. Evaluation 97: 57-82 (2016) - 2014
- [j9]Abdulhalim Dandoush, Sara Alouf
Lifetime and availability of data stored on a P2P system: Evaluation of redundancy and recovery schemes. Comput. Networks 64: 243-260 (2014) - 2012
- [j8]Vincenzo Mancuso
Analysis of power saving with continuous connectivity. Comput. Networks 56(10): 2481-2493 (2012) - [j7]Amar Prakash Azad, Sara Alouf
Correction to "Analysis and Optimization of Sleeping Mode in WiMAX via Stochastic Decomposition Techniques". IEEE J. Sel. Areas Commun. 30(4): 846 (2012) - [j6]Sara Alouf
Analysis of power saving and its impact on web traffic in cellular networks with continuous connectivity. Pervasive Mob. Comput. 8(5): 646-661 (2012) - 2011
- [j5]Vincenzo Mancuso
Reducing costs and pollution in cellular networks. IEEE Commun. Mag. 49(8): 63-71 (2011) - [j4]Amar Prakash Azad, Sara Alouf
Optimal Control of Sleep Periods for Wireless Terminals. IEEE J. Sel. Areas Commun. 29(8): 1605-1617 (2011) - 2010
- [j3]Sara Alouf
Fitting genetic algorithms to distributed on-line evolution of network protocols. Comput. Networks 54(18): 3402-3420 (2010) - 2003
- [j2]Sara Alouf
Optimal estimation of multicast membership. IEEE Trans. Signal Process. 51(8): 2165-2176 (2003) - 2002
- [j1]Sara Alouf, Fabrice Huet, Philippe Nain:
Forwarders vs. centralized server: an evaluation of two approaches for locating mobile agents. Perform. Evaluation 49(1/4): 299-319 (2002)
Conference and Workshop Papers
- 2023
- [c27]Younes Ben Mazziane
No- Regret Caching with Noisy Request Estimates. VCC 2023: 341-346 - 2022
- [c26]Younes Ben Mazziane
Computing the Hit Rate of Similarity Caching. GLOBECOM 2022: 141-146 - [c25]Younes Ben Mazziane
A Formal Analysis of the Count-Min Sketch with Conservative Updates. INFOCOM Workshops 2022: 1-6 - 2017
- [c24]Dimitra Politaki
Stochastic Models for Solar Power. EPEW 2017: 282-297 - 2016
- [c23]Giovanni Neglia, Sara Alouf
Performance Evaluation of Train Moving-Block Control. QEST 2016: 348-363 - [c22]Abdulhalim Dandoush
ns-3 Based Framework for Simulating Communication Based Train Control (CBTC) Systems. WNS3 2016: 116-123 - 2015
- [c21]Ioannis Dimitriou
A Markovian Queueing System for Modeling a Smart Green Base Station. EPEW 2015: 3-18 - 2013
- [c20]Nicaise Choungmo Fofack, Sara Alouf
Modeling modern DNS caches. VALUETOOLS 2013: 184-193 - 2011
- [c19]Angelos Chatzipapas, Sara Alouf
On the minimization of power consumption in base stations using on/off power amplifiers. OnlineGreenComm 2011: 18-23 - [c18]Vincenzo Mancuso
Power save analysis of cellular networks with continuous connectivity. WOWMOM 2011: 1-9 - 2010
- [c17]Damiano Carra, Konstantin Avrachenkov
Passive Online RTT Estimation for Flow-Aware Routers Using One-Way Traffic. Networking 2010: 109-121 - 2009
- [c16]Amar Prakash Azad, Sara Alouf
Optimal sampling for state change detection with application to the control of sleep mode. CDC 2009: 1645-1650 - [c15]Abdulhalim Dandoush
Performance Analysis of Centralized versus Distributed Recovery Schemes in P2P Storage Systems. Networking 2009: 676-689 - [c14]Abdulhalim Dandoush, Sara Alouf, Philippe Nain:
Simulation analysis of download and recovery processes in P2P storage systems. ITC 2009: 1-8 - [c13]Abdulhalim Dandoush, Sara Alouf
A realistic simulation model for peer-to-peer storage systems. VALUETOOLS 2009: 7 - [c12]Amar P. Azad, Sara Alouf
Vacation policy optimization with application to IEEE 802.16e power saving mechanism. Wireless Days 2009: 1-7 - [c11]Giovanni Neglia, Giuseppe Reina, Sara Alouf
Distributed gradient optimization for epidemic routing: A preliminary evaluation. Wireless Days 2009: 1-6 - 2008
- [c10]Sara Alouf
Analysis of an M/G/1 Queue with Repeated Inhomogeneous Vacations with Application to IEEE 802.16e Power Saving Mechanism. QEST 2008: 27-36 - [c9]Sara Alouf
M/G/1 queue with repeated inhomogeneous vacations applied to ieee 802.16e power saving. SIGMETRICS 2008: 451-452 - 2007
- [c8]Sara Alouf
Embedding Evolution in Epidemic-Style Forwarding. MASS 2007: 1-6 - [c7]Sara Alouf
Performance Analysis of Peer-to-Peer Storage Systems. ITC 2007: 642-653 - 2006
- [c6]Mouhamad Ibrahim, Sara Alouf
Design and Analysis of an Adaptive Backoff Algorithm for IEEE 802.11 DCF Mechanism. Networking 2006: 184-196 - 2005
- [c5]Sara Alouf
Quasi-optimal bandwidth allocation for multi-spot MFTDMA satellites. INFOCOM 2005: 560-571 - 2003
- [c4]Sara Alouf
Estimating membership in a multicast session. SIGMETRICS 2003: 250-260 - 2002
- [c3]Sara Alouf
Optimal on-line estimation of the size of a dynamic multicast group. INFOCOM 2002: 1109-1118 - [c2]Sara Alouf
Forwarders vs. centralized server: an evaluation of two approaches for locating mobile agents. SIGMETRICS 2002: 278-279 - 2001
- [c1]Sara Alouf
Inferring Network Characteristics via Moment-Based Estimators. INFOCOM 2001: 1045-1054
Parts in Books or Collections
- 2009
- [p1]Sara Alouf
Autonomic Information Diffusion in Intermittently Connected Networks. Autonomic Computing and Networking 2009: 411-433
Editorship
- 2016
- [e1]Sara Alouf, Alain Jean-Marie, Nidhi Hegde, Alexandre Proutière:
Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, Antibes Juan-Les-Pins, France, June 14-18, 2016. ACM 2016, ISBN 978-1-4503-4266-7 [contents]
Informal and Other Publications
- 2023
- [i4]Younes Ben Mazziane, Francescomaria Faticanti, Giovanni Neglia, Sara Alouf:
No-Regret Caching with Noisy Request Estimates. CoRR abs/2309.02055 (2023) - [i3]Younes Ben Mazziane, Sara Alouf, Giovanni Neglia, Daniel S. Menasché:
Performance Model for Similarity Caching. CoRR abs/2309.12149 (2023) - 2022
- [i2]Younes Ben Mazziane, Sara Alouf, Giovanni Neglia:
A Formal Analysis of the Count-Min Sketch with Conservative Updates. CoRR abs/2203.14549 (2022) - [i1]Younes Ben Mazziane, Sara Alouf, Giovanni Neglia, Daniel Sadoc Menasché:
Computing the Hit Rate of Similarity Caching. CoRR abs/2209.03174 (2022)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: