Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleApril 2024
Load Balancing with Job-Size Testing: Performance Improvement or Degradation?
ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), Volume 9, Issue 2Article No.: 8, Pages 1–27https://doi.org/10.1145/3651154In the context of decision making under explorable uncertainty, scheduling with testing is a powerful technique used in the management of computer systems to improve performance via better job-dispatching decisions. Upon job arrival, a scheduler may run ...
- rapid-communicationFebruary 2024
Price of Anarchy with multiple information sources under competition
Operations Research Letters (OPERRL), Volume 51, Issue 6Pages 605–611https://doi.org/10.1016/j.orl.2023.10.004AbstractWe characterize the Price of Anarchy (PoA) in a single channel under the presence of K competing sources. As performance metric we consider the Age of Information, which measures the freshness of information in a remote system. In our main ...
- ArticleJanuary 2023
Product Form Solution for the Steady-State Distribution of a Markov Chain Associated with a General Matching Model with Self-loops
AbstractWe extend the general matching graph model to deal with matching graph where every node has a self loop. Thus the states on the Markov chain are associated with the independent sets of the matching graph. We prove that under i.i.d. arrivals ...
- research-articleApril 2022
Analysis of an optimal policy in dynamic bipartite matching models
AbstractA dynamic bipartite matching model is given by a bipartite matching graph which determines the possible matchings between the various types of supply and demand items. Both supply and demand items arrive to the system according to a ...
- articleMarch 2022
Flexibility can Hurt Dynamic Matching System Performance
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 49, Issue 3Pages 37–42https://doi.org/10.1145/3529113.3529126We study the performance of stochastic matching models with general compatibility graphs. Items of different classes arrive to the system according to independent Poisson processes. Upon arrival, an item is matched with a compatible item according to ...
- research-articleJanuary 2022
A Resource Sharing Game for the Freshness of Status Updates
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 49, Issue 2Pages 15–17https://doi.org/10.1145/3512798.3512805Timely information is a crucial factor in a wide range of information, communication, and control systems. For instance, in autonomous driving systems, the state of the traffic and the location of the vehicles must be as recent as possible. The Age of ...
- research-articleDecember 2021
Multiclass Energy Packet Networks with finite capacity energy queues
AbstractEnergy Packet Network (EPN) consists of a queueing network formed by N blocks, where each of them is formed by one data queue, that handles the workload, and one energy queue, that handles packets of energy.
We study an EPN ...
- research-articleMay 2020
Energy Packet Networks with Finite Capacity Energy Queues
VALUETOOLS '20: Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and ToolsPages 142–149https://doi.org/10.1145/3388831.3388841Energy Packet Network (EPN) consists of a queueing network formed by n blocks, where each of them is formed by one data queue, that handles the workload, and one energy queue, that handles packets of energy.
We study an EPN model where the energy ...
- research-articleFebruary 2020
Optimal Path Discovery Problem with Homogeneous Knowledge
Theory of Computing Systems (TOCSYS), Volume 64, Issue 2Pages 227–250https://doi.org/10.1007/s00224-019-09928-wAbstractConsider the following problem: given a complete graph G = (V, E), two nodes s and t in V, and a positive hidden value f(e) for each edge e ∈ E, discover an s − t-path P that minimizes the value F(P), for some objective function F. The issue is ...
- research-articleNovember 2019
Asymptotically Optimal Size-Interval Task Assignments
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 30, Issue 11Pages 2422–2433https://doi.org/10.1109/TPDS.2019.2920121Size-based routing provides robust strategies to improve the performance of computer and communication systems with highly variable workloads because it is able to isolate small jobs from large ones in a static manner. The basic idea is that each server ...
- ArticleSeptember 2019
UTOPIC: Under-Approximation Through Optimal Control
AbstractWe consider a class of nonlinear systems of differential equations with uncertainties, i.e., with lack of knowledge in some of the parameters that is represented by a time-varying unknown bounded functions. An under-approximation of such systems ...
- research-articleApril 2019
Performance Degradation in Parallel-Server Systems
IEEE/ACM Transactions on Networking (TON), Volume 27, Issue 2Pages 875–888https://doi.org/10.1109/TNET.2019.2902531We consider a parallel-server system with homogeneous servers where incoming tasks, arriving at rate $\lambda $ , are dispatched by $n$ dispatchers, each of them balancing a fraction $1/n$ of the load to $K/n$ servers. Servers are first-come-first-...
- research-articleMarch 2019
Optimal Control of Dynamic Bipartite Matching Models
VALUETOOLS 2019: Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and ToolsPages 39–46https://doi.org/10.1145/3306309.3306317A dynamic bipartite matching model is given by a bipartite matching graph which determines the possible matchings between the various types of supply and demand items. Both supply and demand items arrive to the system according to a stochastic process. ...
- research-articleDecember 2017
Size-based Routing to Balance Performance of the Queues
VALUETOOLS 2017: Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and ToolsPages 198–205https://doi.org/10.1145/3150928.3150948We study a queueing system with a Poisson arrival process, in which a dispatcher sends the jobs to K homogeneous queues. The dispatcher knows the size of each job, and can implement a size-aware policy. Instead of trying to optimize system performance, ...
- research-articleOctober 2014
Is the Price of Anarchy the Right Measure for Load-Balancing Games?
ACM Transactions on Internet Technology (TOIT), Volume 14, Issue 2-3Article No.: 18, Pages 1–20https://doi.org/10.1145/2663498Price of anarchy is an oft-used worst-case measure of the inefficiency of noncooperative decentralized architectures. For a noncooperative load-balancing game with two classes of servers and for a finite or infinite number of dispatchers, we show that ...
- ArticleFebruary 2014
Predicting Response Times of Applications in Virtualized Environments
NCCA '14: Proceedings of the 2014 IEEE 3rd Symposium on Network Cloud Computing and Applications (ncca 2014)Pages 83–90https://doi.org/10.1109/NCCA.2014.21We propose simple queueing models for predicting response times of applications executed in a cloud computing platform under the SaaS model. We assume that each application instance is executed within a virtual machine running on a computing node of a ...
- research-articleDecember 2013
Congestion control of TCP flows in Internet routers by means of index policy
Computer Networks: The International Journal of Computer and Telecommunications Networking (CNTW), Volume 57, Issue 17Pages 3463–3478https://doi.org/10.1016/j.comnet.2013.08.001In this paper we address the problem of fast and fair transmission of flows in a router, which is a fundamental issue in networks like the Internet. We model the interaction between a source using the Transmission Control Protocol (TCP) and a bottleneck ...
- columnJanuary 2012
Optimal congestion control of TCP flows for internet routers
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 40, Issue 3Pages 62–64https://doi.org/10.1145/2425248.2425263In this work we address the problem of fast and fair transmission of ows in a router, which is a fundamental issue in networks like the Internet. We model the interaction between a TCP source and a bottleneck queue with the objective of designing ...