We study the scheduling of flows on a switch with the goal of optimizing metrics related to
the response time of the flows. The input is a sequence of flow requests on a switch, where …

Most of today's high-speed switches and routers adopt an input-queued crossbar switch
architecture. Such a switch needs to compute a matching (crossbar schedule) between the …

We consider the problem of scheduling flows subject to endpoint capacity constraints. We
are given a set of capacitated nodes and an online sequence of requests where each …

In an input-queued switch, a crossbar schedule, or a matching between the input ports and
the output ports needs to be computed in each switching cycle, or time slot. Designing …

In an input-queued switch, a crossbar schedule, or a matching between the input ports and
the output ports needs to be computed for each switching cycle, or time slot. It is a …

In this work, we first propose a parallel batch switching algorithm called Small-Batch Queue-
Proportional Sampling (SB-QPS). Compared to other batch switching algorithms, SB-QPS …

Современные телекоммуникационные системы работают в условиях повышенной
нагрузки и неоднородности трафика. Одним из подходов для решения этой задачи …

A Complete Bibliography of Proceedings of the ACM on Measurement and Analysis of
Computing Systems (POMACS) Page 1 A Complete Bibliography of Proceedings of the …

The problem of efficiently allocating limited resources to competing demands manifests as
the key problem in various real-world systems, such as road-traffic network, cellular network …

In this addendum, we show that the switching algorithm QPS-SERENA can be converted R
(QPS-SERENA), an algorithm for computing approximate Maximum Weight Matching …