default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVittoria de Nitto Persone
Person information
- affiliation: Università di Roma Tor Vergata, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Vittoria de Nitto Persone, Y. C. Tay:
Report on the Second International Workshop on Teaching Performance Analysis of Computer Systems 2023. SIGMETRICS Perform. Evaluation Rev. 51(2): 42-44 (2023)- 2022
- [j13]Vittoria de Nitto Persone, Y. C. Tay:
Report on the First International Workshop on Teaching Performance Analysis of Computer Systems 2021. SIGMETRICS Perform. Evaluation Rev. 49(4): 1-2 (2022) - 2020
- [i1]Vittoria de Nitto Persone:
Teaching Performance Modeling in the era of millennials. CoRR abs/2001.08949 (2020)
2010 – 2019
- 2019
- [j12]Vittoria de Nitto Persone, Andrea Di Lonardo:
Approximating finite resources: An approach based on MVA. Perform. Evaluation 131: 1-21 (2019) - [c10]Vittoria de Nitto Persone, Vincenzo Grassi:
Architectural Issues for Self-Adaptive Service Migration Management in Mobile Edge Computing Scenarios. EDGE 2019: 27-29 - 2017
- [c9]Vittoria de Nitto Persone:
Teaching Performance Modeling in the Era of 140characters Information. ICPE Companion 2017: 183-184 - 2016
- [j11]Valeria Cardellini
, Vittoria De Nitto Persone, Valerio Di Valerio, Francisco Facchinei, Vincenzo Grassi, Francesco Lo Presti, Veronica Piccialli:
A game-theoretic approach to computation offloading in mobile cloud computing. Math. Program. 157(2): 421-449 (2016) - [j10]Giuliano Casale, Vittoria De Nitto Persone, Evgenia Smirni:
QRF: An Optimization-Based Framework for Evaluating Complex Stochastic Networks. ACM Trans. Model. Comput. Simul. 26(3): 15:1-15:24 (2016) - 2013
- [c8]Vittoria De Nitto Persone, Andrea Di Lonardo:
An Approximate Mean Value Analysis Approach for System Management and Overload Control. EPEW 2013: 288-299 - 2012
- [j9]Vittoria De Nitto Persone:
Heuristics for QoS maintenance: adaptive policies in differentiated services wireless networks. SIGMETRICS Perform. Evaluation Rev. 39(4): 99-107 (2012) - 2011
- [c7]Vittoria De Nitto Persone, Giuliano Casale, Evgenia Smirni:
Approximate analysis of blocking queueing networks with temporal dependence. DSN 2011: 574-585 - 2010
- [c6]Lei Lu, Ludmila Cherkasova, Vittoria De Nitto Persone, Ningfang Mi, Evgenia Smirni:
AWAIT: Efficient Overload Management for Busy Multi-tier Web Services under Bursty Workloads. ICWE 2010: 81-97 - [c5]Vittoria De Nitto Persone, Andreas Pillekeit, Matteo Iacari:
Investigation of the Multimedia Adaptive Threshold Strategy for Mobile Integrated Services Networks. MMB/DFT 2010: 151-167
2000 – 2009
- 2009
- [j8]Vittoria De Nitto Persone:
Analysis of cyclic queueing networks with parallelism and vacation. Ann. Oper. Res. 170(1): 95-112 (2009) - [c4]Vittoria De Nitto Persone, Elisa Campagna:
Adaptive bandwidth allocation and admission control for wireless integrated service networks with flexible QoS. SimuTools 2009: 85 - 2004
- [c3]Andrea D'Ambrogio, Vittoria De Nitto Persone, Giuseppe Iazeolla:
Model-Driven Maintenance of QoS Characteristics in Heterogeneous Networks. ISCIS 2004: 584-593 - 2003
- [j7]Simonetta Balsamo, Vittoria De Nitto Persone, Paola Inverardi:
A review on queueing network models with finite capacity queues for software architectures performance prediction. Perform. Evaluation 51(2/4): 269-288 (2003) - [j6]Vittoria De Nitto Persone, Vincenzo Grassi:
Performance analysis of caching and prefetching strategies for palmtop-based navigational tools. IEEE Trans. Intell. Transp. Syst. 4(1): 23-34 (2003)
1990 – 1999
- 1999
- [j5]Vittoria De Nitto Persone, Vincenzo Grassi:
An Analytical Model for a Parallel Fault-Tolerant Computing System. Perform. Evaluation 38(3-4): 201-218 (1999) - 1998
- [j4]Vittoria De Nitto Persone, Vincenzo Grassi:
Optimal access control for integrated services wireless networks. Comput. Commun. 21(17): 1559-1570 (1998) - [c2]Vittoria De Nitto Persone, Vincenzo Grassi, Antonio Morlupi:
Modeling and Evaluation of Prefetching Policies for Context-Aware Information Services. MobiCom 1998: 55-65 - 1994
- [j3]Simonetta Balsamo, Vittoria de Nitto Persone:
A survey of product form queueing networks with blocking and their equivalences. Ann. Oper. Res. 48(1): 31-61 (1994) - [j2]Vittoria De Nitto Persone, Giuseppe Iazeolla:
Performance Analysis of the Parallel Cyclic Two-Stage Queueing Model. Perform. Evaluation 19(2-3): 167-193 (1994) - 1991
- [j1]Simonetta Balsamo, Vittoria De Nitto Persone:
Closed Queueing Networks with Finite Capacities: Blocking Types, Product-Form Solution and Performance Indices. Perform. Evaluation 12(2): 85-102 (1991)
1980 – 1989
- 1988
- [c1]Vittoria De Nitto Persone:
Immediate vs Deferred Blocking Policies in Symmetrical Networks. SIGMETRICS 1988: 279
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-04-24 23:05 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:
