arXiv subjects

Tung-Wei Kuo

Publications and source records attributed to Tung-Wei Kuo.

7 recordsLinked to original sources

arXiv2025

Minimizing $\ell_2$ Norm of Flow Time by Starvation Mitigation

The assessment of a job's Quality of Service (QoS) often revolves around its flow time, also referred to as response time. This study delves into two fundamental objectives for scheduling jobs: the average flow time and the maximum flow time. While the Shortest Remaining Processing Time (SRPT) algorithm minimizes average flow time, it can result in job starvation, causing certain jobs to experience disproportionately long and unfair flow times. In contrast, the First-Come-First-Served (FCFS) algorithm minimizes the maximum flow time but may compromise the average flow time. To strike a balance between these two objectives, a common approach is to minimize the $\ell_2$ norm of flow time. SRPT and FCFS are $O(n^{\frac{1}{2}})$-competitive for this problem, where $n$ is the number of jobs. Prior to this work, no algorithm is known to achieve a competitive ratio better than SRPT and FCFS. In this paper, we use FCFS to mitigate the starvation caused by SRPT. Given a good estimate of $n$, we prove that this approach achieves a much better competitive ratio of $O(n^{\frac{1}{3}})$. Our results provide the first theoretical evidence that mitigating starvation in SRPT leads to a provable improvement in scheduling performance.

cs.DS↗

arXiv2024

Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line

We study the online minimum cost bipartite perfect matching with delays problem. In this problem, $m$ servers and $m$ requests arrive over time, and an online algorithm can delay the matching between servers and requests by paying the delay cost. The objective is to minimize the total distance and delay cost. When servers and requests lie in a known metric space, there is a randomized $O(\log n)$-competitive algorithm, where $n$ is the size of the metric space. When the metric space is unknown a priori, Azar and Jacob-Fanani proposed a deterministic $O\left(\frac{1}εm^{\log\left(\frac{3+ε}{2}\right)}\right)$-competitive algorithm for any fixed $ε> 0$. This competitive ratio is tight when $n = 1$ and becomes $O(m^{0.59})$ for sufficiently small $ε$. In this paper, we improve upon the result of Azar and Jacob-Fanani for the case where servers and requests are on the real line, providing a deterministic $\tilde{O}(m^{0.5})$-competitive algorithm. Our algorithm is based on the Robust Matching (RM) algorithm proposed by Raghvendra for the minimum cost bipartite perfect matching problem. In this problem, delay is not allowed, and all servers arrive in the beginning. When a request arrives, the RM algorithm immediately matches the request to a free server based on the request's minimum $t$-net-cost augmenting path, where $t > 1$ is a constant. In our algorithm, we delay the matching of a request until its waiting time exceeds its minimum $t$-net-cost divided by $t$.

cs.DS↗

arXiv2019

No Need for Recovery: A Simple Two-Step Byzantine Consensus

In this paper, we give a deterministic two-step Byzantine consensus protocol that achieves safety and liveness. A two-step Byzantine consensus protocol only needs two communication steps to commit in the absence of faults. Most two-step Byzantine consensus protocols exploit optimism and require a recovery protocol in the presence of faults. In this paper, we give a simple two-step Byzantine consensus protocol that does not need a recovery protocol.

cs.DC↗

arXiv2019

Minimum Age TDMA Scheduling

We consider a transmission scheduling problem in which multiple systems receive update information through a shared Time Division Multiple Access (TDMA) channel. To provide timely delivery of update information, the problem asks for a schedule that minimizes the overall age of information. We call this problem the Min-Age problem. This problem is first studied by He \textit{et al.} [IEEE Trans. Inform. Theory, 2018], who identified several special cases where the problem can be solved optimally in polynomial time. Our contribution is threefold. First, we introduce a new job scheduling problem called the Min-WCS problem, and we prove that, for any constant $r \geq 1$, every $r$-approximation algorithm for the Min-WCS problem can be transformed into an $r$-approximation algorithm for the Min-Age problem. Second, we give a randomized 2.733-approximation algorithm and a dynamic-programming-based exact algorithm for the Min-WCS problem. Finally, we prove that the Min-Age problem is NP-hard.

cs.DS↗

arXiv2018

On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint

In the problem of minimum connected dominating set with routing cost constraint, we are given a graph $G=(V,E)$, and the goal is to find the smallest connected dominating set $D$ of $G$ such that, for any two non-adjacent vertices $u$ and $v$ in $G$, the number of internal nodes on the shortest path between $u$ and $v$ in the subgraph of $G$ induced by $D \cup \{u,v\}$ is at most $α$ times that in $G$. For general graphs, the only known previous approximability result is an $O(\log n)$-approximation algorithm ($n=|V|$) for $α= 1$ by Ding et al. For any constant $α> 1$, we give an $O(n^{1-\frac{1}α}(\log n)^{\frac{1}α})$-approximation algorithm. When $α\geq 5$, we give an $O(\sqrt{n}\log n)$-approximation algorithm. Finally, we prove that, when $α=2$, unless $NP \subseteq DTIME(n^{poly\log n})$, for any constant $ε> 0$, the problem admits no polynomial-time $2^{\log^{1-ε}n}$-approximation algorithm, improving upon the $Ω(\log n)$ bound by Du et al. (albeit under a stronger hardness assumption).

cs.DS↗

arXiv2014

Leader-Contention-Based User Matching for 802.11 Multiuser MIMO Networks

In multiuser MIMO (MU-MIMO) LANs, the achievable throughput of a client depends on who are transmitting concurrently with it. Existing MU-MIMO MAC protocols however enable clients to use the traditional 802.11 contention to contend for concurrent transmission opportunities on the uplink. Such a contention-based protocol not only wastes lots of channel time on multiple rounds of contention, but also fails to maximally deliver the gain of MU-MIMO because users randomly join concurrent transmissions without considering their channel characteristics. To address such inefficiency, this paper introduces MIMOMate, a leader-contention-based MU-MIMO MAC protocol that matches clients as concurrent transmitters according to their channel characteristics to maximally deliver the MU-MIMO gain, while ensuring all users to fairly share concurrent transmission opportunities. Furthermore, MIMOMate elects the leader of the matched users to contend for transmission opportunities using traditional 802.11 CSMA/CA. It hence requires only a single contention overhead for concurrent streams, and can be compatible with legacy 802.11 devices. A prototype implementation in USRP-N200 shows that MIMOMate achieves an average throughput gain of 1.42x and 1.52x over the traditional contention-based protocol for 2-antenna and 3-antenna AP scenarios, respectively, and also provides fairness for clients.

cs.NI↗

arXiv2014

On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms

In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, it is important to collect these data efficiently, that is, to reduce the energy cost of data transmission. Under such applications, a tree is usually adopted as the routing structure to save the computation costs for maintaining the routing tables of sensors. In this paper, we work on the problem of constructing a data aggregation tree that minimizes the total energy cost of data transmission in a wireless sensor network. In addition, we also address such a problem in the wireless sensor network where relay nodes exist. We show these two problems are NP-complete, and propose O(1)-approximation algorithms for each of them. Simulations show that the proposed algorithms each have good performance in terms of the energy cost.

cs.NI↗