default search action
Urtzi Ayesta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j50]Urtzi Ayesta:
Foreword from Chair of 2023 ACM SIGMETRICS Doctoral Dissertation Award Committee. SIGMETRICS Perform. Evaluation Rev. 51(3): 28 (2024) - [j49]Francisco Robledo Relaño
, Vivek S. Borkar
Tabular and Deep Learning for the Whittle Index. ACM Trans. Model. Perform. Evaluation Comput. Syst. 9(3): 11:1-11:21 (2024) - [c26]Francisco Robledo
Deep Reinforcement Learning for Weakly Coupled MDP's with Continuous Actions. ASMTA 2024: 67-80 - [i11]Nahuel Soprano-Loto, Urtzi Ayesta, Matthieu Jonckheere, Ina Maria Verloop:
Decision-Epoch Matters: Unveiling its Impact on the Stability of Scheduling with Randomly Varying Connectivity. CoRR abs/2403.18686 (2024) - [i10]Francisco Robledo, Urtzi Ayesta, Konstantin Avrachenkov:
Deep reinforcement learning for weakly coupled MDP's with continuous actions. CoRR abs/2406.01099 (2024) - [i9]Francisco Robledo Relaño, Vivek S. Borkar, Urtzi Ayesta, Konstantin Avrachenkov:
Tabular and Deep Learning for the Whittle Index. CoRR abs/2406.02057 (2024) - 2023
- [j48]Fernando Miguelez, Urtzi Ayesta, Josu Doncel
Price of Anarchy with multiple information sources under competition. Oper. Res. Lett. 51(6): 605-611 (2023) - 2022
- [j47]Urtzi Ayesta, Tejas Bodas, Jan-Pieter L. Dorsman
A Token-Based Central Queue with Order-Independent Service Rates. Oper. Res. 70(1): 545-561 (2022) - [j46]Urtzi Ayesta:
Reinforcement learning in queues. Queueing Syst. Theory Appl. 100(3-4): 497-499 (2022) - [j45]Santiago Duran
On the Whittle index of Markov modulated restless bandits. Queueing Syst. Theory Appl. 102(3-4): 373-430 (2022) - [j44]Fernando Miguelez, Josu Doncel, Urtzi Ayesta:
A Resource Sharing Game for the Freshness of Status Updates. SIGMETRICS Perform. Evaluation Rev. 49(2): 15-17 (2022) - [j43]Francisco Robledo, Vivek S. Borkar, Urtzi Ayesta, Konstantin Avrachenkov
QWI: Q-learning with Whittle Index. SIGMETRICS Perform. Evaluation Rev. 49(2): 47-50 (2022) - 2021
- [j42]Elene Anton
On the Stability of Redundancy Models. Oper. Res. 69(5): 1540-1565 (2021) - [j41]Urtzi Ayesta, Manu K. Gupta
On the computation of Whittle's index for Markovian restless bandits. Math. Methods Oper. Res. 93(1): 179-208 (2021) - [c25]Elene Anton, Urtzi Ayesta, Matthieu Jonckheere
Improving the Performance of Heterogeneous Data Centers through Redundancy. SIGMETRICS (Abstracts) 2021: 55-56 - [i8]Elene Anton, Urtzi Ayesta, Matthieu Jonckheere, Ina Maria Verloop:
A Survey of Stability Results for Redundancy Systems. CoRR abs/2103.10942 (2021) - 2020
- [j40]Elene Anton, Urtzi Ayesta, Matthieu Jonckheere
Improving the Performance of Heterogeneous Data Centers through Redundancy. Proc. ACM Meas. Anal. Comput. Syst. 4(3): 48:1-48:29 (2020) - [i7]Elene Anton, Urtzi Ayesta, Matthieu Jonckheere, Ina Maria Verloop:
Improving the performance of heterogeneous data centers through redundancy. CoRR abs/2003.01394 (2020)
2010 – 2019
- 2019
- [j39]C. Carballo-Lozano, Urtzi Ayesta, Dieter Fiems:
Performance analysis of space-time priority queues. Perform. Evaluation 133: 25-42 (2019) - [j38]Elene Anton, Urtzi Ayesta, Matthieu Jonckheere
Redundancy with Processor Sharing servers. SIGMETRICS Perform. Evaluation Rev. 47(2): 15-17 (2019) - [j37]Josu Doncel
Performance Degradation in Parallel-Server Systems. IEEE/ACM Trans. Netw. 27(2): 875-888 (2019) - [c24]Elene Anton, Urtzi Ayesta, Florian Simatos:
On the impact of mobility in cellular networks. WiOpt 2019: 1-8 - [c23]Thi Thuy Nga Nguyen, Urtzi Ayesta, Balakrishna J. Prabhu:
Scheduling users in drive-thru Internet: a multi-armed bandit approach. WiOpt 2019: 1-8 - [i6]Urtzi Ayesta, Tejas Bodas, Jan-Pieter L. Dorsman, Maaike Verloop:
A token-based central queue with order-independent service rates. CoRR abs/1902.02137 (2019) - 2018
- [j36]Urtzi Ayesta, Balakrishna J. Prabhu:
Special volume on selected papers from the second ECQT conference. Perform. Evaluation 119: 3-4 (2018) - [j35]Urtzi Ayesta, Tejas Bodas
On a unifying product form framework for redundancy models. Perform. Evaluation 127-128: 93-119 (2018) - [j34]Urtzi Ayesta:
On redundancy-d with cancel-on-start a.k.a Join-shortest-work (d). SIGMETRICS Perform. Evaluation Rev. 46(2): 24-26 (2018) - [j33]Urtzi Ayesta, Tejas Bodas
On a unifying product form framework for redundancy models. SIGMETRICS Perform. Evaluation Rev. 46(3): 80-81 (2018) - [c22]M. Venkateswararao Koppisetti
Bus schedule for optimal bus bunching and waiting times. COMSNETS 2018: 607-612 - [i5]Urtzi Ayesta, Manu K. Gupta, Ina Maria Verloop:
Load balancing with heterogeneous schedulers. CoRR abs/1810.07782 (2018) - 2017
- [j32]Urtzi Ayesta, Peter Jacko
Scheduling of multi-class multi-server queueing systems with abandonments. J. Sched. 20(2): 129-145 (2017) - [c21]Josu Doncel
Economies of scale in parallel-server systems. INFOCOM 2017: 1-9 - 2016
- [j31]Urtzi Ayesta, Martin Erausquin, Eva Ferreira
Optimal dynamic resource allocation to prevent defaults. Oper. Res. Lett. 44(4): 451-456 (2016) - [j30]Ane Izagirre
Sojourn Time Approximations for a Discriminatory Processor Sharing Queue. ACM Trans. Model. Perform. Evaluation Comput. Syst. 1(1): 5:1-5:31 (2016) - [j29]Maialen Larrañaga
Dynamic Control of Birth-and-Death Restless Bandits: Application to Resource-Allocation Problems. IEEE/ACM Trans. Netw. 24(6): 3812-3825 (2016) - 2015
- [j28]Ane Izagirre
Interpolation approximations for the steady-state distribution in multi-class resource-sharing systems. Perform. Evaluation 91: 56-79 (2015) - [j27]Maialen Larrañaga, Urtzi Ayesta, Maaike Verloop:
Asymptotically optimal index policies for an abandonment queue with convex holding cost. Queueing Syst. Theory Appl. 81(2-3): 99-169 (2015) - [c20]Maialen Larrañaga, Urtzi Ayesta, Ina Maria Verloop:
Stochastic and fluid index policies for resource allocation problems. INFOCOM 2015: 1230-1238 - [c19]Urtzi Ayesta, Lionel Bertaux, Denis Carvin:
Non-intrusive scheduling of TCP flows. Networking 2015: 1-9 - 2014
- [j26]Josu Doncel
A resource-sharing game with relative priorities. Perform. Evaluation 79: 287-305 (2014) - [j25]Josu Doncel
Is the Price of Anarchy the Right Measure for Load-Balancing Games? ACM Trans. Internet Techn. 14(2-3): 18:1-18:20 (2014) - [c18]Ane Izagirre, Urtzi Ayesta, Ina Maria Verloop:
Sojourn time approximations in a multi-class time-sharing server. INFOCOM 2014: 2786-2794 - [c17]Maialen Larrañaga, Urtzi Ayesta, Ina Maria Verloop:
Index policies for a multi-class queue with convex holding cost and abandonments. SIGMETRICS 2014: 125-137 - 2013
- [j24]Konstantin Avrachenkov
Congestion control of TCP flows in Internet routers by means of index policy. Comput. Networks 57(17): 3463-3478 (2013) - [j23]Ianire Taboada
QoE-aware optimization of multimedia flow scheduling. Comput. Commun. 36(15-16): 1629-1638 (2013) - [j22]Maialen Larrañaga, Urtzi Ayesta, Ina Maria Verloop:
Dynamic fluid-based scheduling in a multi-class abandonment queue. Perform. Evaluation 70(10): 841-858 (2013) - [j21]Urtzi Ayesta, Martin Erausquin, Matthieu Jonckheere
Scheduling in a Random Environment: Stability and Asymptotic Optimality. IEEE/ACM Trans. Netw. 21(1): 258-271 (2013) - [c16]Josu Doncel, Urtzi Ayesta, Olivier Brun, Balakrishna J. Prabhu:
On the efficiency of non-cooperative load balancing. Networking 2013: 1-9 - 2012
- [j20]Urtzi Ayesta, Onno J. Boxma, Ina Maria Verloop:
Sojourn times in a processor sharing queue with multiple vacations. Queueing Syst. Theory Appl. 71(1-2): 53-78 (2012) - [j19]Konstantin Avrachenkov
Optimal congestion control of TCP flows for internet routers. SIGMETRICS Perform. Evaluation Rev. 40(3): 62-64 (2012) - [c15]Alexey Baraev, Urtzi Ayesta, Ina Maria Verloop, Daniele Miorandi, Imrich Chlamtac:
Technical vulnerability of the E-UTRAN paging mechanism. WCNC 2012: 2247-2252 - [i4]Josu Doncel, Urtzi Ayesta, Konstantin Avrachenkov, Peter Jacko
Congestion Control of TCP Flows in Internet Routers by Means of Index Policy. CoRR abs/1209.3638 (2012) - 2011
- [j18]Ina Maria Verloop, Urtzi Ayesta, Rudesindo Núñez-Queija
Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing. Oper. Res. 59(3): 648-660 (2011) - [j17]Jonatha Anselmi, Urtzi Ayesta, Adam Wierman:
Competition yields efficiency in load balancing games. Perform. Evaluation 68(11): 986-1001 (2011) - [j16]Urtzi Ayesta, Olivier Brun, B. J. Prabhu:
Price of anarchy in non-cooperative load balancing games. Perform. Evaluation 68(12): 1312-1332 (2011) - [j15]Urtzi Ayesta, Ane Izagirre, Ina Maria Verloop:
Heavy traffic analysis of the discriminatory randomorderofservice discipline. SIGMETRICS Perform. Evaluation Rev. 39(2): 41-43 (2011) - [j14]Eitan Altman, Urtzi Ayesta, B. J. Prabhu:
Load balancing in processor sharing systems. Telecommun. Syst. 47(1-2): 35-48 (2011) - [c14]Urtzi Ayesta, Martin Erausquin, Peter Jacko
Resource-sharing in a single server with time-varying capacity. Allerton 2011: 377-383 - [c13]Urtzi Ayesta, Peter Jacko
A nearly-optimal index rule for scheduling of users with abandonment. INFOCOM 2011: 2849-2857 - [c12]Urtzi Ayesta, Martin Erausquin, Matthieu Jonckheere
Stability and asymptotic optimality of opportunistic schedulers in wireless systems. VALUETOOLS 2011: 47-56 - [i3]Urtzi Ayesta, Martin Erausquin, Matthieu Jonckheere, Ina Maria Verloop:
Scheduling in a random environment: stability and asymptotic optimality. CoRR abs/1101.5794 (2011) - 2010
- [j13]Yi Zhang
Convergence of trajectories and optimal buffer sizing for MIMD congestion control. Comput. Commun. 33(2): 149-159 (2010) - [j12]Ina Maria Verloop, Urtzi Ayesta, Sem C. Borst:
Monotonicity Properties for Multi-Class Queueing Systems. Discret. Event Dyn. Syst. 20(4): 473-509 (2010) - [j11]Konstantin Avrachenkov
Convergence of trajectories and optimal buffer sizing for AIMD congestion control. Perform. Evaluation 67(7): 501-527 (2010) - [j10]Urtzi Ayesta, Martin Erausquin, Peter Jacko
A modeling framework for optimizing the flow-level scheduling with time-varying channels. Perform. Evaluation 67(11): 1014-1029 (2010) - [c11]Urtzi Ayesta, Olivier Brun, Balakrishna J. Prabhu:
Price of Anarchy in Non-Cooperative Load Balancing. INFOCOM 2010: 436-440 - [i2]Mark Allman, Konstantin Avrachenkov, Urtzi Ayesta, Josh Blanton, Per Hurtig:
Early Retransmit for TCP and Stream Control Transmission Protocol (SCTP). RFC 5827: 1-15 (2010)
2000 – 2009
- 2009
- [j9]Samuli Aalto
SRPT applied to bandwidth-sharing networks. Ann. Oper. Res. 170(1): 3-19 (2009) - [j8]Urtzi Ayesta, Michel Mandjes:
Bandwidth-sharing networks under a diffusion scaling. Ann. Oper. Res. 170(1): 41-58 (2009) - [j7]Samuli Aalto
On the Gittins index in the M/G/1 queue. Queueing Syst. Theory Appl. 63(1-4): 437-458 (2009) - [j6]Ina Maria Verloop, Urtzi Ayesta, Rudesindo Núñez-Queija:
Heavy-traffic analysis of the M/PH/1 discriminatory processor sharing queue with phase-dependent weights. SIGMETRICS Perform. Evaluation Rev. 37(2): 42-44 (2009) - [c10]Natalia Osipova, Urtzi Ayesta, Konstantin Avrachenkov:
Optimal policy for multi-class scheduling in a single server queue. ITC 2009: 1-8 - 2008
- [c9]Eitan Altman, Urtzi Ayesta, Balakrishna J. Prabhu:
Load balancing in processor sharing systems. VALUETOOLS 2008: 12 - [c8]Ina Maria Verloop, Urtzi Ayesta, Sem C. Borst:
Comparison of bandwidth-sharing policies in a linear network. VALUETOOLS 2008: 34 - [c7]Samuli Aalto
Optimal scheduling of jobs with a DHR tail in the M/G/1 queue. VALUETOOLS 2008: 50 - 2007
- [j5]Samuli Aalto, Urtzi Ayesta, Sem C. Borst, Vishal Misra, Rudesindo Núñez-Queija:
Beyond processor sharing. SIGMETRICS Perform. Evaluation Rev. 34(4): 36-43 (2007) - [c6]Samuli Aalto
Mean delay optimization for the M/G/1 queue with pareto type service times. SIGMETRICS 2007: 383-384 - [i1]Konstantin Avrachenkov, Urtzi Ayesta, Alexei B. Piunovskiy:
Convergence and Optimal Buffer Sizing for Window Based AIMD Congestion Control. CoRR abs/cs/0703063 (2007) - 2006
- [j4]Eitan Altman, Konstantin Avrachenkov
A survey on discriminatory processor sharing. Queueing Syst. Theory Appl. 53(1-2): 53-63 (2006) - [c5]Samuli Aalto
Mean Delay Analysis of Multi Level Processor Sharing Disciplines. INFOCOM 2006 - 2005
- [j3]Samuli Aalto
M/G/1/MLPS compared to M/G/1/PS. Oper. Res. Lett. 33(5): 519-524 (2005) - [j2]Konstantin Avrachenkov
Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling. Queueing Syst. Theory Appl. 50(4): 459-480 (2005) - [c4]Konstantin Avrachenkov
Optimal choice of the buffer size in the Internet routers. CDC/ECC 2005: 1143-1148 - [c3]Konstantin Avrachenkov, Urtzi Ayesta, Patrick Brown, R. Núñez Queija:
Discriminatory processor sharing revisited. INFOCOM 2005: 784-795 - 2004
- [c2]Konstantin Avrachenkov
Differentiation Between Short and Long TCP Flows: Predictability of the Response Time. INFOCOM 2004: 762-773 - [c1]Samuli Aalto
Two-level processor-sharing scheduling disciplines: mean delay analysis. SIGMETRICS 2004: 97-105 - 2002
- [j1]Eyjólfur Ingi Ásgeirsson, Urtzi Ayesta, Edward G. Coffman Jr., J. Etra, Petar Momcilovic, David J. Phillips, V. Vokhshoori, Z. Wang, J. Wolfe:
Closed On-Line Bin Packing. Acta Cybern. 15(3): 361-367 (2002)
Coauthor Index
Maaike Verloop
aka: Ina Maria Verloop
aka: Ina Maria Verloop
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-11-07 20:30 CET 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: