[HTML][HTML] Fast and accurate quantitative business process analysis using feature complete queueing models
Quantitative business process analysis is a powerful approach for analyzing timing
properties of a business process, such as the expected waiting time of customers or the …
properties of a business process, such as the expected waiting time of customers or the …
Cloud computing value chains: Research from the operations management perspective
Problem definition: Cloud computing is recognized as a critical driver of information
technology–enabled innovations. The operations management (OM) community, however …
technology–enabled innovations. The operations management (OM) community, however …
Modeling landside container terminal queues: Exact analysis and approximations
With the growth of ocean transport and with increasing vessel sizes, managing congestion at
the landside of container terminals has become a major challenge. The landside of a sea …
the landside of container terminals has become a major challenge. The landside of a sea …
Heavy-traffic limits for an infinite-server fork–join queueing system with dependent and disruptive services
H Lu, G Pang - Queueing Systems, 2017 - Springer
We study an infinite-server fork–join queueing system with dependent services, which
experiences alternating renewal service disruptions. Jobs are forked into a fixed number of …
experiences alternating renewal service disruptions. Jobs are forked into a fixed number of …
Optimizing differentiated latency in multi-tenant, erasure-coded storage
Y Xiang, T Lan, V Aggarwal… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Erasure codes are widely used in distributed storage systems since they provide space-
optimal data redundancy to protect against data loss. Despite recent progress on quantifying …
optimal data redundancy to protect against data loss. Despite recent progress on quantifying …
A Worst-Case Latency and Age Analysis of Coded Distributed Computing With Unreliable Workers and Periodic Tasks
Over the past decade, the deep learning revolution has led to ever-increasing demands for
computing power and working memory to support larger and larger neural networks. As this …
computing power and working memory to support larger and larger neural networks. As this …
Subdiffusive load balancing in time-varying queueing systems
Load-balancing algorithms for systems that operate in heavy traffic are known to lead, under
suitable conditions, to state space collapse (SSC). This term refers to the phenomenon …
suitable conditions, to state space collapse (SSC). This term refers to the phenomenon …
Admission Control of Parallel Queues with Fork Types of Jobs
B Lin, R Bhatnagar, Y Lin - Methodology and Computing in Applied …, 2024 - Springer
In this paper, we consider the problem of admission control for a stream of jobs arriving at
two single-server queues working in parallel, with general inter-arrival time distribution and …
two single-server queues working in parallel, with general inter-arrival time distribution and …
How to staff when customers arrive in batches
In many different settings, requests for service can arrive in near or true simultaneity with one
another. This creates batches of arrivals to the underlying queueing system. In this paper …
another. This creates batches of arrivals to the underlying queueing system. In this paper …
On the Role of Preemption for Timing Metrics in Coded Multipath Communication
Recent trends in communication networks have focused on Quality of Service (QoS)
requirements expressed through timing metrics such as latency or Age of Information (AoI) …
requirements expressed through timing metrics such as latency or Age of Information (AoI) …